---
_id: '5201'
author:
- first_name: Sönke
  full_name: Sievers, Sönke
  id: '46447'
  last_name: Sievers
- first_name: Tobias
  full_name: Schlüter, Tobias
  last_name: Schlüter
- first_name: Thomas
  full_name: Hartmann-Wendels, Thomas
  last_name: Hartmann-Wendels
citation:
  ama: Sievers S, Schlüter T, Hartmann-Wendels T. Die erfolgreiche Bindung des Sparers
    an die Bank. <i>Börsen-Zeitung</i>. 2013.
  apa: Sievers, S., Schlüter, T., &#38; Hartmann-Wendels, T. (2013). Die erfolgreiche
    Bindung des Sparers an die Bank. <i>Börsen-Zeitung</i>.
  bibtex: '@article{Sievers_Schlüter_Hartmann-Wendels_2013, title={Die erfolgreiche
    Bindung des Sparers an die Bank}, journal={Börsen-Zeitung}, author={Sievers, Sönke
    and Schlüter, Tobias and Hartmann-Wendels, Thomas}, year={2013} }'
  chicago: Sievers, Sönke, Tobias Schlüter, and Thomas Hartmann-Wendels. “Die erfolgreiche
    Bindung des Sparers an die Bank.” <i>Börsen-Zeitung</i>, 2013.
  ieee: S. Sievers, T. Schlüter, and T. Hartmann-Wendels, “Die erfolgreiche Bindung
    des Sparers an die Bank,” <i>Börsen-Zeitung</i>, 2013.
  mla: Sievers, Sönke, et al. “Die erfolgreiche Bindung des Sparers an die Bank.”
    <i>Börsen-Zeitung</i>, 2013.
  short: S. Sievers, T. Schlüter, T. Hartmann-Wendels, Börsen-Zeitung (2013).
date_created: 2018-10-31T12:29:38Z
date_updated: 2022-01-06T07:01:43Z
department:
- _id: '275'
language:
- iso: ger
main_file_link:
- url: https://www.boersen-zeitung.de/index.php?li=1&artid=2013018054&titel=Die-erfolgreiche-Bindung-des-Sparers-an-die-Bank
publication: Börsen-Zeitung
publication_date: 2013-01-10
publication_status: published
status: public
title: Die erfolgreiche Bindung des Sparers an die Bank
type: newspaper_article
user_id: '46447'
year: '2013'
...
---
_id: '5202'
author:
- first_name: Sönke
  full_name: Sievers, Sönke
  id: '46447'
  last_name: Sievers
- first_name: Thomas
  full_name: Hartmann-Wendels, Thomas
  last_name: Hartmann-Wendels
- first_name: Ramona
  full_name: Busch, Ramona
  last_name: Busch
- first_name: Tobias
  full_name: Schlüter, Tobias
  last_name: Schlüter
citation:
  ama: Sievers S, Hartmann-Wendels T, Busch R, Schlüter T. Wie Banken Kostenvorteile
    weitergeben. <i>Börsen-Zeitung</i>. 2013.
  apa: Sievers, S., Hartmann-Wendels, T., Busch, R., &#38; Schlüter, T. (2013). Wie
    Banken Kostenvorteile weitergeben. <i>Börsen-Zeitung</i>.
  bibtex: '@article{Sievers_Hartmann-Wendels_Busch_Schlüter_2013, title={Wie Banken
    Kostenvorteile weitergeben}, volume={6}, journal={Börsen-Zeitung}, author={Sievers,
    Sönke and Hartmann-Wendels, Thomas and Busch, Ramona and Schlüter, Tobias}, year={2013}
    }'
  chicago: Sievers, Sönke, Thomas Hartmann-Wendels, Ramona Busch, and Tobias Schlüter.
    “Wie Banken Kostenvorteile weitergeben.” <i>Börsen-Zeitung</i>, 2013.
  ieee: S. Sievers, T. Hartmann-Wendels, R. Busch, and T. Schlüter, “Wie Banken Kostenvorteile
    weitergeben,” <i>Börsen-Zeitung</i>, vol. 6, 2013.
  mla: Sievers, Sönke, et al. “Wie Banken Kostenvorteile weitergeben.” <i>Börsen-Zeitung</i>,
    vol. 6, 2013.
  short: S. Sievers, T. Hartmann-Wendels, R. Busch, T. Schlüter, Börsen-Zeitung 6
    (2013).
date_created: 2018-10-31T12:32:09Z
date_updated: 2022-01-06T07:01:43Z
department:
- _id: '275'
intvolume: '         6'
language:
- iso: ger
main_file_link:
- url: https://www.boersen-zeitung.de/index.php?li=1&artid=2013006066
page: '6'
publication: Börsen-Zeitung
publication_date: 2013-01-10
publication_status: published
status: public
title: Wie Banken Kostenvorteile weitergeben
type: newspaper_article
user_id: '46447'
volume: 6
year: '2013'
...
---
_id: '521'
author:
- first_name: Heinrich
  full_name: Riebler, Heinrich
  id: '8961'
  last_name: Riebler
citation:
  ama: Riebler H. <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln
    mit FPGAs</i>. Universität Paderborn; 2013.
  apa: Riebler, H. (2013). <i>Identifikation und Wiederherstellung von kryptographischen
    Schlüsseln mit FPGAs</i>. Universität Paderborn.
  bibtex: '@book{Riebler_2013, title={Identifikation und Wiederherstellung von kryptographischen
    Schlüsseln mit FPGAs}, publisher={Universität Paderborn}, author={Riebler, Heinrich},
    year={2013} }'
  chicago: Riebler, Heinrich. <i>Identifikation und Wiederherstellung von kryptographischen
    Schlüsseln mit FPGAs</i>. Universität Paderborn, 2013.
  ieee: H. Riebler, <i>Identifikation und Wiederherstellung von kryptographischen
    Schlüsseln mit FPGAs</i>. Universität Paderborn, 2013.
  mla: Riebler, Heinrich. <i>Identifikation und Wiederherstellung von kryptographischen
    Schlüsseln mit FPGAs</i>. Universität Paderborn, 2013.
  short: H. Riebler, Identifikation und Wiederherstellung von kryptographischen Schlüsseln
    mit FPGAs, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:34Z
date_updated: 2022-01-06T07:01:46Z
department:
- _id: '27'
- _id: '518'
keyword:
- coldboot
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '14'
  name: SFB 901 - Subprojekt C2
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs
type: mastersthesis
user_id: '477'
year: '2013'
...
---
_id: '522'
author:
- first_name: Matthias
  full_name: Feldotto, Matthias
  id: '14052'
  last_name: Feldotto
  orcid: 0000-0003-1348-6516
citation:
  ama: 'Feldotto M. <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous
    Bandwidths</i>. Universität Paderborn; 2013.'
  apa: 'Feldotto, M. (2013). <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes
    with Heterogeneous Bandwidths</i>. Universität Paderborn.'
  bibtex: '@book{Feldotto_2013, title={HSkip+: A Self-Stabilizing Overlay Network
    for Nodes with Heterogeneous Bandwidths}, publisher={Universität Paderborn}, author={Feldotto,
    Matthias}, year={2013} }'
  chicago: 'Feldotto, Matthias. <i>HSkip+: A Self-Stabilizing Overlay Network for
    Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn, 2013.'
  ieee: 'M. Feldotto, <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with
    Heterogeneous Bandwidths</i>. Universität Paderborn, 2013.'
  mla: 'Feldotto, Matthias. <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes
    with Heterogeneous Bandwidths</i>. Universität Paderborn, 2013.'
  short: 'M. Feldotto, HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous
    Bandwidths, Universität Paderborn, 2013.'
date_created: 2017-10-17T12:42:34Z
date_updated: 2022-01-06T07:01:47Z
department:
- _id: '79'
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Teilprojekt A
- _id: '5'
  name: SFB 901 - Subprojekt A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: 'HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths'
type: mastersthesis
user_id: '14052'
year: '2013'
...
---
_id: '523'
abstract:
- lang: eng
  text: In a distributed system with attacks and defenses, both attackers and defenders
    are self-interested entities. We assume a reward-sharing scheme among interdependent
    defenders; each defender wishes to (locally) maximize her own total fair share
    to the attackers extinguished due to her involvement (and possibly due to those
    of others). What is the maximum amount of protection achievable by a number of
    such defenders against a number of attackers while the system is in a Nash equilibrium?
    As a measure of system protection, we adopt the Defense-Ratio (Mavronicolas et
    al., 2008)[20], which provides the expected (inverse) proportion of attackers
    caught by the defenders. In a Defense-Optimal Nash equilibrium, the Defense-Ratio
    matches a simple lower bound.We discover that the existence of Defense-Optimal
    Nash equilibria depends in a subtle way on how the number of defenders compares
    to two natural graph-theoretic thresholds we identify. In this vein, we obtain,
    through a combinatorial analysis of Nash equilibria, a collection of trade-off
    results:• When the number of defenders is either sufficiently small or sufficiently
    large, Defense-Optimal Nash equilibria may exist. The corresponding decision problem
    is computationally tractable for a large number of defenders; the problem becomes
    NPNP-complete for a small number of defenders and the intractability is inherited
    from a previously unconsidered combinatorial problem in Fractional Graph Theory.•
    Perhaps paradoxically, there is a middle range of values for the number of defenders
    where Defense-Optimal Nash equilibria do not exist.
author:
- first_name: Marios
  full_name: Mavronicolas, Marios
  last_name: Mavronicolas
- first_name: Burkhard
  full_name: Monien, Burkhard
  last_name: Monien
- first_name: Vicky
  full_name: Papadopoulou Lesta, Vicky
  last_name: Papadopoulou Lesta
citation:
  ama: Mavronicolas M, Monien B, Papadopoulou Lesta V. How many attackers can selfish
    defenders catch? <i>Discrete Applied Mathematics</i>. 2013;161(16-17):2563-2586.
    doi:<a href="https://doi.org/10.1016/j.dam.2013.05.022">10.1016/j.dam.2013.05.022</a>
  apa: Mavronicolas, M., Monien, B., &#38; Papadopoulou Lesta, V. (2013). How many
    attackers can selfish defenders catch? <i>Discrete Applied Mathematics</i>, <i>161</i>(16–17),
    2563–2586. <a href="https://doi.org/10.1016/j.dam.2013.05.022">https://doi.org/10.1016/j.dam.2013.05.022</a>
  bibtex: '@article{Mavronicolas_Monien_Papadopoulou Lesta_2013, title={How many attackers
    can selfish defenders catch?}, volume={161}, DOI={<a href="https://doi.org/10.1016/j.dam.2013.05.022">10.1016/j.dam.2013.05.022</a>},
    number={16–17}, journal={Discrete Applied Mathematics}, publisher={Elsevier},
    author={Mavronicolas, Marios and Monien, Burkhard and Papadopoulou Lesta, Vicky},
    year={2013}, pages={2563–2586} }'
  chicago: 'Mavronicolas, Marios, Burkhard Monien, and Vicky Papadopoulou Lesta. “How
    Many Attackers Can Selfish Defenders Catch?” <i>Discrete Applied Mathematics</i>
    161, no. 16–17 (2013): 2563–86. <a href="https://doi.org/10.1016/j.dam.2013.05.022">https://doi.org/10.1016/j.dam.2013.05.022</a>.'
  ieee: M. Mavronicolas, B. Monien, and V. Papadopoulou Lesta, “How many attackers
    can selfish defenders catch?,” <i>Discrete Applied Mathematics</i>, vol. 161,
    no. 16–17, pp. 2563–2586, 2013.
  mla: Mavronicolas, Marios, et al. “How Many Attackers Can Selfish Defenders Catch?”
    <i>Discrete Applied Mathematics</i>, vol. 161, no. 16–17, Elsevier, 2013, pp.
    2563–86, doi:<a href="https://doi.org/10.1016/j.dam.2013.05.022">10.1016/j.dam.2013.05.022</a>.
  short: M. Mavronicolas, B. Monien, V. Papadopoulou Lesta, Discrete Applied Mathematics
    161 (2013) 2563–2586.
date_created: 2017-10-17T12:42:34Z
date_updated: 2022-01-06T07:01:47Z
ddc:
- '040'
doi: 10.1016/j.dam.2013.05.022
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:37:35Z
  date_updated: 2018-03-15T10:37:35Z
  file_id: '1297'
  file_name: 523-MMP13.pdf
  file_size: 1127543
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:37:35Z
has_accepted_license: '1'
intvolume: '       161'
issue: 16-17
language:
- iso: eng
page: 2563-2586
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publication: Discrete Applied Mathematics
publisher: Elsevier
status: public
title: How many attackers can selfish defenders catch?
type: journal_article
user_id: '42447'
volume: 161
year: '2013'
...
---
_id: '524'
abstract:
- lang: eng
  text: 'We study the complexity theory for the local distributed setting introduced
    by Korman, Peleg and Fraigniaud. They have defined three complexity classes LD
    (Local Decision), NLD (Nondeterministic Local Decision) and NLD^#n. The class
    LD consists of all languages which can be decided with a constant number of communication
    rounds. The class NLD consists of all languages which can be verified by a nondeterministic
    algorithm with a constant number of communication rounds. In order to define the
    nondeterministic classes, they have transferred the notation of nondeterminism
    into the distributed setting by the use of certificates and verifiers. The class
    NLD^#n consists of all languages which can be verified by a nondeterministic algorithm
    where each node has access to an oracle for the number of nodes. They have shown
    the hierarchy LD subset NLD subset NLD^#n. Our main contributions are strict hierarchies
    within the classes defined by Korman, Peleg and Fraigniaud. We define additional
    complexity classes: the class LD(t) consists of all languages which can be decided
    with at most t communication rounds. The class NLD-O(f) consists of all languages
    which can be verified by a local verifier such that the size of the certificates
    that are needed to verify the language are bounded by a function from O(f). Our
    main results are refined strict hierarchies within these nondeterministic classes.'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Kamil
  full_name: Swirkot, Kamil
  last_name: Swirkot
citation:
  ama: Meyer auf der Heide F, Swirkot K. Hierarchies in Local Distributed Decision.
    2013.
  apa: Meyer auf der Heide, F., &#38; Swirkot, K. (2013). Hierarchies in Local Distributed
    Decision. arXiv.
  bibtex: '@article{Meyer auf der Heide_Swirkot_2013, title={Hierarchies in Local
    Distributed Decision}, publisher={arXiv}, author={Meyer auf der Heide, Friedhelm
    and Swirkot, Kamil}, year={2013} }'
  chicago: Meyer auf der Heide, Friedhelm, and Kamil Swirkot. “Hierarchies in Local
    Distributed Decision.” arXiv, 2013.
  ieee: F. Meyer auf der Heide and K. Swirkot, “Hierarchies in Local Distributed Decision.”
    arXiv, 2013.
  mla: Meyer auf der Heide, Friedhelm, and Kamil Swirkot. <i>Hierarchies in Local
    Distributed Decision</i>. arXiv, 2013.
  short: F. Meyer auf der Heide, K. Swirkot, (2013).
date_created: 2017-10-17T12:42:34Z
date_updated: 2022-01-06T07:01:48Z
ddc:
- '040'
department:
- _id: '63'
external_id:
  arxiv:
  - '1311.7229'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:37:07Z
  date_updated: 2018-03-15T10:37:07Z
  file_id: '1296'
  file_name: 524-paper_01.pdf
  file_size: 534906
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:37:07Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: arXiv
status: public
title: Hierarchies in Local Distributed Decision
type: preprint
user_id: '15415'
year: '2013'
...
---
_id: '525'
author:
- first_name: Tim
  full_name: Niklas Vinkemeier, Tim
  last_name: Niklas Vinkemeier
citation:
  ama: Niklas Vinkemeier T. <i>Haptics - Hadoop Performance Testing in Concurrent
    Job Scenarios</i>. Universität Paderborn; 2013.
  apa: Niklas Vinkemeier, T. (2013). <i>Haptics - Hadoop performance testing in concurrent
    job scenarios</i>. Universität Paderborn.
  bibtex: '@book{Niklas Vinkemeier_2013, title={Haptics - Hadoop performance testing
    in concurrent job scenarios}, publisher={Universität Paderborn}, author={Niklas
    Vinkemeier, Tim}, year={2013} }'
  chicago: Niklas Vinkemeier, Tim. <i>Haptics - Hadoop Performance Testing in Concurrent
    Job Scenarios</i>. Universität Paderborn, 2013.
  ieee: T. Niklas Vinkemeier, <i>Haptics - Hadoop performance testing in concurrent
    job scenarios</i>. Universität Paderborn, 2013.
  mla: Niklas Vinkemeier, Tim. <i>Haptics - Hadoop Performance Testing in Concurrent
    Job Scenarios</i>. Universität Paderborn, 2013.
  short: T. Niklas Vinkemeier, Haptics - Hadoop Performance Testing in Concurrent
    Job Scenarios, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:34Z
date_updated: 2022-01-06T07:01:48Z
department:
- _id: '75'
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Haptics - Hadoop performance testing in concurrent job scenarios
type: bachelorsthesis
user_id: '15504'
year: '2013'
...
---
_id: '526'
author:
- first_name: Alexander
  full_name: Mäcker, Alexander
  id: '13536'
  last_name: Mäcker
citation:
  ama: Mäcker A. <i>Greedy Network Creation With Heavy And Light Edges</i>. Universität
    Paderborn; 2013.
  apa: Mäcker, A. (2013). <i>Greedy Network Creation With Heavy And Light Edges</i>.
    Universität Paderborn.
  bibtex: '@book{Mäcker_2013, title={Greedy Network Creation With Heavy And Light
    Edges}, publisher={Universität Paderborn}, author={Mäcker, Alexander}, year={2013}
    }'
  chicago: Mäcker, Alexander. <i>Greedy Network Creation With Heavy And Light Edges</i>.
    Universität Paderborn, 2013.
  ieee: A. Mäcker, <i>Greedy Network Creation With Heavy And Light Edges</i>. Universität
    Paderborn, 2013.
  mla: Mäcker, Alexander. <i>Greedy Network Creation With Heavy And Light Edges</i>.
    Universität Paderborn, 2013.
  short: A. Mäcker, Greedy Network Creation With Heavy And Light Edges, Universität
    Paderborn, 2013.
date_created: 2017-10-17T12:42:35Z
date_updated: 2022-01-06T07:01:48Z
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Greedy Network Creation With Heavy And Light Edges
type: mastersthesis
user_id: '15504'
year: '2013'
...
---
_id: '527'
abstract:
- lang: eng
  text: 'In the future vision of software engineering, services from world-wide markets
    are composed automated in order to build custom-made systems.Supporting such scenarios
    requires an adequate service matching approach.Many existing approaches do not
    fulfill two key requirements of emerging concepts like On-The-Fly-Computing, namely
    (1) comprehensiveness, i.e., the consideration of different service aspects that
    cover not only functional properties, but also non-functional properties and (2)
    fuzzy matching, i.e., the ability to deliver gradual results in order to cope
    with a certain extent of uncertainty, incompleteness, and tolerance ranges.In
    this paper, I present a fuzzy matching process that distinguishes between different
    fuzziness sources and leverages fuzziness in different matching steps which consider
    different service aspects, e.g., behavior and quality properties. '
author:
- first_name: Marie
  full_name: Christin Platenius, Marie
  last_name: Christin Platenius
citation:
  ama: 'Christin Platenius M. Fuzzy Service Matching in On-The-Fly Computing. In:
    <i>Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European
    Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations
    of Software Engineering (FSE)</i>. ; 2013:715-718. doi:<a href="https://doi.org/10.1145/2491411.2492405">10.1145/2491411.2492405</a>'
  apa: Christin Platenius, M. (2013). Fuzzy Service Matching in On-The-Fly Computing.
    In <i>Proceedings of the Doctoral Symposium of the 9th joint meeting of the European
    Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations
    of Software Engineering (FSE)</i> (pp. 715–718). <a href="https://doi.org/10.1145/2491411.2492405">https://doi.org/10.1145/2491411.2492405</a>
  bibtex: '@inproceedings{Christin Platenius_2013, title={Fuzzy Service Matching in
    On-The-Fly Computing}, DOI={<a href="https://doi.org/10.1145/2491411.2492405">10.1145/2491411.2492405</a>},
    booktitle={Proceedings of the Doctoral Symposium of the 9th joint meeting of the
    European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium
    on the Foundations of Software Engineering (FSE)}, author={Christin Platenius,
    Marie}, year={2013}, pages={715–718} }'
  chicago: Christin Platenius, Marie. “Fuzzy Service Matching in On-The-Fly Computing.”
    In <i>Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European
    Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations
    of Software Engineering (FSE)</i>, 715–18, 2013. <a href="https://doi.org/10.1145/2491411.2492405">https://doi.org/10.1145/2491411.2492405</a>.
  ieee: M. Christin Platenius, “Fuzzy Service Matching in On-The-Fly Computing,” in
    <i>Proceedings of the Doctoral Symposium of the 9th joint meeting of the European
    Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations
    of Software Engineering (FSE)</i>, 2013, pp. 715–718.
  mla: Christin Platenius, Marie. “Fuzzy Service Matching in On-The-Fly Computing.”
    <i>Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European
    Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations
    of Software Engineering (FSE)</i>, 2013, pp. 715–18, doi:<a href="https://doi.org/10.1145/2491411.2492405">10.1145/2491411.2492405</a>.
  short: 'M. Christin Platenius, in: Proceedings of the Doctoral Symposium of the
    9th Joint Meeting of the European Software Engineering Conference (ESEC) and the
    ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE), 2013,
    pp. 715–718.'
date_created: 2017-10-17T12:42:35Z
date_updated: 2022-01-06T07:01:48Z
ddc:
- '040'
department:
- _id: '76'
doi: 10.1145/2491411.2492405
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:36:38Z
  date_updated: 2018-03-15T10:36:38Z
  file_id: '1295'
  file_name: 527-p715-platenius.pdf
  file_size: 730490
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:36:38Z
has_accepted_license: '1'
language:
- iso: eng
page: ' 715-718 '
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the Doctoral Symposium of the 9th joint meeting of the
  European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on
  the Foundations of Software Engineering (FSE)
status: public
title: Fuzzy Service Matching in On-The-Fly Computing
type: conference
user_id: '477'
year: '2013'
...
---
_id: '529'
abstract:
- lang: eng
  text: Mechatronic systems reconfigure the structure of their software architecture,
    e.g., to avoid hazardous situations or to optimize operational conditions like
    minimizing their energy consumption. As software architectures are typically build
    on components, reconfiguration actions need to respect the component structure.
    This structure should be hierarchical to enable encapsulated components. While
    many reconfiguration approaches for embedded real-time systems allow the use of
    hierarchically embedded components, i.e., horizontal composition, none of them
    offers a modeling and verification solution to take hierarchical composition,
    i.e., encapsulation, into account. In this paper, we present an extension to our
    existing modeling language, MechatronicUML, to enable safe hierarchical reconfigurations.
    The two main extensions are (a) an adapted variant of the two-phase commit protocol
    to initiate reconfigurations which maintain component encapsulation and (b) a
    timed model checking verification approach for instances of our model. We illustrate
    our approach on a case study in the area of smart railway systems by showing two
    different use cases of our approach and the verification of their safety properties.
author:
- first_name: Christian
  full_name: Heinzemann, Christian
  last_name: Heinzemann
- first_name: Steffen
  full_name: Becker, Steffen
  last_name: Becker
citation:
  ama: 'Heinzemann C, Becker S. Executing Reconfigurations in Hierarchical Component
    Architectures. In: <i>Proceedings of the 16th International ACM SigSoft Symposium
    on Component-Based Software Engineering (CBSE)</i>. ; 2013:3-12. doi:<a href="https://doi.org/10.1145/2465449.2465452">10.1145/2465449.2465452</a>'
  apa: Heinzemann, C., &#38; Becker, S. (2013). Executing Reconfigurations in Hierarchical
    Component Architectures. In <i>Proceedings of the 16th International ACM SigSoft
    Symposium on Component-Based Software Engineering (CBSE)</i> (pp. 3–12). <a href="https://doi.org/10.1145/2465449.2465452">https://doi.org/10.1145/2465449.2465452</a>
  bibtex: '@inproceedings{Heinzemann_Becker_2013, title={Executing Reconfigurations
    in Hierarchical Component Architectures}, DOI={<a href="https://doi.org/10.1145/2465449.2465452">10.1145/2465449.2465452</a>},
    booktitle={Proceedings of the 16th International ACM SigSoft Symposium on Component-Based
    Software Engineering (CBSE)}, author={Heinzemann, Christian and Becker, Steffen},
    year={2013}, pages={3–12} }'
  chicago: Heinzemann, Christian, and Steffen Becker. “Executing Reconfigurations
    in Hierarchical Component Architectures.” In <i>Proceedings of the 16th International
    ACM SigSoft Symposium on Component-Based Software Engineering (CBSE)</i>, 3–12,
    2013. <a href="https://doi.org/10.1145/2465449.2465452">https://doi.org/10.1145/2465449.2465452</a>.
  ieee: C. Heinzemann and S. Becker, “Executing Reconfigurations in Hierarchical Component
    Architectures,” in <i>Proceedings of the 16th International ACM SigSoft Symposium
    on Component-Based Software Engineering (CBSE)</i>, 2013, pp. 3–12.
  mla: Heinzemann, Christian, and Steffen Becker. “Executing Reconfigurations in Hierarchical
    Component Architectures.” <i>Proceedings of the 16th International ACM SigSoft
    Symposium on Component-Based Software Engineering (CBSE)</i>, 2013, pp. 3–12,
    doi:<a href="https://doi.org/10.1145/2465449.2465452">10.1145/2465449.2465452</a>.
  short: 'C. Heinzemann, S. Becker, in: Proceedings of the 16th International ACM
    SigSoft Symposium on Component-Based Software Engineering (CBSE), 2013, pp. 3–12.'
date_created: 2017-10-17T12:42:35Z
date_updated: 2022-01-06T07:01:49Z
ddc:
- '040'
doi: 10.1145/2465449.2465452
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:35:39Z
  date_updated: 2018-03-15T10:35:39Z
  file_id: '1293'
  file_name: 529-p3-heinzemann.pdf
  file_size: 541849
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:35:39Z
has_accepted_license: '1'
page: 3-12
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 16th International ACM SigSoft Symposium on Component-Based
  Software Engineering (CBSE)
status: public
title: Executing Reconfigurations in Hierarchical Component Architectures
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '530'
author:
- first_name: Dominik
  full_name: Buse, Dominik
  last_name: Buse
citation:
  ama: Buse D. <i>Entwurf Kooperativer Verhaltensweisen Heterogener Roboter</i>. Universität
    Paderborn; 2013.
  apa: Buse, D. (2013). <i>Entwurf kooperativer Verhaltensweisen heterogener Roboter</i>.
    Universität Paderborn.
  bibtex: '@book{Buse_2013, title={Entwurf kooperativer Verhaltensweisen heterogener
    Roboter}, publisher={Universität Paderborn}, author={Buse, Dominik}, year={2013}
    }'
  chicago: Buse, Dominik. <i>Entwurf Kooperativer Verhaltensweisen Heterogener Roboter</i>.
    Universität Paderborn, 2013.
  ieee: D. Buse, <i>Entwurf kooperativer Verhaltensweisen heterogener Roboter</i>.
    Universität Paderborn, 2013.
  mla: Buse, Dominik. <i>Entwurf Kooperativer Verhaltensweisen Heterogener Roboter</i>.
    Universität Paderborn, 2013.
  short: D. Buse, Entwurf Kooperativer Verhaltensweisen Heterogener Roboter, Universität
    Paderborn, 2013.
date_created: 2017-10-17T12:42:35Z
date_updated: 2022-01-06T07:01:49Z
project:
- _id: '1'
  name: SFB 901
- _id: '10'
  name: SFB 901 - Subprojekt B2
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Entwurf kooperativer Verhaltensweisen heterogener Roboter
type: bachelorsthesis
user_id: '15504'
year: '2013'
...
---
_id: '531'
author:
- first_name: Sascha
  full_name: Lutters, Sascha
  last_name: Lutters
citation:
  ama: Lutters S. <i>Entwurf eines datenschutzgerechten Reputationssystems</i>. Universität
    Paderborn; 2013.
  apa: Lutters, S. (2013). <i>Entwurf eines datenschutzgerechten Reputationssystems</i>.
    Universität Paderborn.
  bibtex: '@book{Lutters_2013, title={Entwurf eines datenschutzgerechten Reputationssystems},
    publisher={Universität Paderborn}, author={Lutters, Sascha}, year={2013} }'
  chicago: Lutters, Sascha. <i>Entwurf eines datenschutzgerechten Reputationssystems</i>.
    Universität Paderborn, 2013.
  ieee: S. Lutters, <i>Entwurf eines datenschutzgerechten Reputationssystems</i>.
    Universität Paderborn, 2013.
  mla: Lutters, Sascha. <i>Entwurf eines datenschutzgerechten Reputationssystems</i>.
    Universität Paderborn, 2013.
  short: S. Lutters, Entwurf eines datenschutzgerechten Reputationssystems, Universität
    Paderborn, 2013.
date_created: 2017-10-17T12:42:35Z
date_updated: 2022-01-06T07:01:49Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Entwurf eines datenschutzgerechten Reputationssystems
type: mastersthesis
user_id: '477'
year: '2013'
...
---
_id: '532'
author:
- first_name: Hendrik
  full_name: Hilleckes, Hendrik
  last_name: Hilleckes
citation:
  ama: Hilleckes H. <i>Entwicklung und Analyse einer verteilten Speicherverwaltung
    für dynamische heterogene Speichersysteme</i>. Universität Paderborn; 2013.
  apa: Hilleckes, H. (2013). <i>Entwicklung und Analyse einer verteilten Speicherverwaltung
    für dynamische heterogene Speichersysteme</i>. Universität Paderborn.
  bibtex: '@book{Hilleckes_2013, title={Entwicklung und Analyse einer verteilten Speicherverwaltung
    für dynamische heterogene Speichersysteme}, publisher={Universität Paderborn},
    author={Hilleckes, Hendrik}, year={2013} }'
  chicago: Hilleckes, Hendrik. <i>Entwicklung und Analyse einer verteilten Speicherverwaltung
    für dynamische heterogene Speichersysteme</i>. Universität Paderborn, 2013.
  ieee: H. Hilleckes, <i>Entwicklung und Analyse einer verteilten Speicherverwaltung
    für dynamische heterogene Speichersysteme</i>. Universität Paderborn, 2013.
  mla: Hilleckes, Hendrik. <i>Entwicklung und Analyse einer verteilten Speicherverwaltung
    für dynamische heterogene Speichersysteme</i>. Universität Paderborn, 2013.
  short: H. Hilleckes, Entwicklung und Analyse einer verteilten Speicherverwaltung
    für dynamische heterogene Speichersysteme, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:36Z
date_updated: 2022-01-06T07:01:49Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische
  heterogene Speichersysteme
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '533'
author:
- first_name: Richard
  full_name: Borkowski, Richard
  last_name: Borkowski
citation:
  ama: Borkowski R. <i>Entwicklung eines Hybriden Planers zur verhaltensorientierten
    Selbstoptimierung</i>. Universität Paderborn; 2013.
  apa: Borkowski, R. (2013). <i>Entwicklung eines Hybriden Planers zur verhaltensorientierten
    Selbstoptimierung</i>. Universität Paderborn.
  bibtex: '@book{Borkowski_2013, title={Entwicklung eines Hybriden Planers zur verhaltensorientierten
    Selbstoptimierung}, publisher={Universität Paderborn}, author={Borkowski, Richard},
    year={2013} }'
  chicago: Borkowski, Richard. <i>Entwicklung eines Hybriden Planers zur verhaltensorientierten
    Selbstoptimierung</i>. Universität Paderborn, 2013.
  ieee: R. Borkowski, <i>Entwicklung eines Hybriden Planers zur verhaltensorientierten
    Selbstoptimierung</i>. Universität Paderborn, 2013.
  mla: Borkowski, Richard. <i>Entwicklung eines Hybriden Planers zur verhaltensorientierten
    Selbstoptimierung</i>. Universität Paderborn, 2013.
  short: R. Borkowski, Entwicklung eines Hybriden Planers zur verhaltensorientierten
    Selbstoptimierung, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:36Z
date_updated: 2022-01-06T07:01:49Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '10'
  name: SFB 901 - Subprojekt B2
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '534'
author:
- first_name: Suhas
  full_name: Satya, Suhas
  last_name: Satya
citation:
  ama: Satya S. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>.
    Universität Paderborn; 2013.
  apa: Satya, S. (2013). <i>Emulating Wavelength Division Multiplexing using Openflow</i>.
    Universität Paderborn.
  bibtex: '@book{Satya_2013, title={Emulating Wavelength Division Multiplexing using
    Openflow}, publisher={Universität Paderborn}, author={Satya, Suhas}, year={2013}
    }'
  chicago: Satya, Suhas. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>.
    Universität Paderborn, 2013.
  ieee: S. Satya, <i>Emulating Wavelength Division Multiplexing using Openflow</i>.
    Universität Paderborn, 2013.
  mla: Satya, Suhas. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>.
    Universität Paderborn, 2013.
  short: S. Satya, Emulating Wavelength Division Multiplexing Using Openflow, Universität
    Paderborn, 2013.
date_created: 2017-10-17T12:42:36Z
date_updated: 2022-01-06T07:01:50Z
department:
- _id: '75'
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Emulating Wavelength Division Multiplexing using Openflow
type: mastersthesis
user_id: '15504'
year: '2013'
...
---
_id: '535'
author:
- first_name: Max
  full_name: Reineke, Max
  last_name: Reineke
citation:
  ama: Reineke M. <i>Effizienzsteigerung durch gewichtete Produktbewertungen</i>.
    Universität Paderborn; 2013.
  apa: Reineke, M. (2013). <i>Effizienzsteigerung durch gewichtete Produktbewertungen</i>.
    Universität Paderborn.
  bibtex: '@book{Reineke_2013, title={Effizienzsteigerung durch gewichtete Produktbewertungen},
    publisher={Universität Paderborn}, author={Reineke, Max}, year={2013} }'
  chicago: Reineke, Max. <i>Effizienzsteigerung durch gewichtete Produktbewertungen</i>.
    Universität Paderborn, 2013.
  ieee: M. Reineke, <i>Effizienzsteigerung durch gewichtete Produktbewertungen</i>.
    Universität Paderborn, 2013.
  mla: Reineke, Max. <i>Effizienzsteigerung durch gewichtete Produktbewertungen</i>.
    Universität Paderborn, 2013.
  short: M. Reineke, Effizienzsteigerung durch gewichtete Produktbewertungen, Universität
    Paderborn, 2013.
date_created: 2017-10-17T12:42:36Z
date_updated: 2022-01-06T07:01:50Z
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
title: Effizienzsteigerung durch gewichtete Produktbewertungen
type: mastersthesis
user_id: '477'
year: '2013'
...
---
_id: '536'
author:
- first_name: Nadja
  full_name: Stroh-Maraun, Nadja
  id: '13264'
  last_name: Stroh-Maraun
citation:
  ama: 'Stroh-Maraun N. <i>Dynamic One-to-One Matching: Theory and a Job Market Application</i>.
    Universität Paderborn; 2013.'
  apa: 'Stroh-Maraun, N. (2013). <i>Dynamic One-to-One Matching: Theory and a Job
    Market Application</i>. Universität Paderborn.'
  bibtex: '@book{Stroh-Maraun_2013, title={Dynamic One-to-One Matching: Theory and
    a Job Market Application}, publisher={Universität Paderborn}, author={Stroh-Maraun,
    Nadja}, year={2013} }'
  chicago: 'Stroh-Maraun, Nadja. <i>Dynamic One-to-One Matching: Theory and a Job
    Market Application</i>. Universität Paderborn, 2013.'
  ieee: 'N. Stroh-Maraun, <i>Dynamic One-to-One Matching: Theory and a Job Market
    Application</i>. Universität Paderborn, 2013.'
  mla: 'Stroh-Maraun, Nadja. <i>Dynamic One-to-One Matching: Theory and a Job Market
    Application</i>. Universität Paderborn, 2013.'
  short: 'N. Stroh-Maraun, Dynamic One-to-One Matching: Theory and a Job Market Application,
    Universität Paderborn, 2013.'
date_created: 2017-10-17T12:42:36Z
date_updated: 2022-01-06T07:01:50Z
department:
- _id: '205'
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
title: 'Dynamic One-to-One Matching: Theory and a Job Market Application'
type: mastersthesis
user_id: '13264'
year: '2013'
...
---
_id: '537'
author:
- first_name: Stefan
  full_name: Heindorf, Stefan
  last_name: Heindorf
citation:
  ama: Heindorf S. <i>Dispersion of Multi-Robot Teams</i>. Universität Paderborn;
    2013.
  apa: Heindorf, S. (2013). <i>Dispersion of Multi-Robot Teams</i>. Universität Paderborn.
  bibtex: '@book{Heindorf_2013, title={Dispersion of Multi-Robot Teams}, publisher={Universität
    Paderborn}, author={Heindorf, Stefan}, year={2013} }'
  chicago: Heindorf, Stefan. <i>Dispersion of Multi-Robot Teams</i>. Universität Paderborn,
    2013.
  ieee: S. Heindorf, <i>Dispersion of Multi-Robot Teams</i>. Universität Paderborn,
    2013.
  mla: Heindorf, Stefan. <i>Dispersion of Multi-Robot Teams</i>. Universität Paderborn,
    2013.
  short: S. Heindorf, Dispersion of Multi-Robot Teams, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:37Z
date_updated: 2022-01-06T07:01:50Z
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Dispersion of Multi-Robot Teams
type: mastersthesis
user_id: '15504'
year: '2013'
...
---
_id: '538'
abstract:
- lang: eng
  text: 'We present a new technique to realize attribute-based encryption (ABE) schemes
    secure in the standard model against chosen-ciphertext attacks (CCA-secure). Our
    approach is to extend certain concrete chosen-plaintext secure (CPA-secure) ABE
    schemes to achieve more efficient constructions than the known generic constructions
    of CCA-secure ABE schemes. We restrict ourselves to the construction of attribute-based
    key encapsulation mechanisms (KEMs) and present two concrete CCA-secure schemes:
    a key-policy attribute-based KEM that is based on Goyal''s key-policy ABE and
    a ciphertext-policy attribute-based KEM that is based on Waters'' ciphertext-policy
    ABE. To achieve our goals, we use an appropriate hash function and need to extend
    the public parameters and the ciphertexts of the underlying CPA-secure encryption
    schemes only by a single group element. Moreover, we use the same hardness assumptions
    as the underlying CPA-secure encryption schemes.'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Gennadij
  full_name: Liske, Gennadij
  last_name: Liske
citation:
  ama: Blömer J, Liske G. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations
    without Random Oracles. 2013.
  apa: Blömer, J., &#38; Liske, G. (2013). Direct Chosen-Ciphertext Secure Attribute-Based
    Key Encapsulations without Random Oracles. Universität Paderborn.
  bibtex: '@article{Blömer_Liske_2013, title={Direct Chosen-Ciphertext Secure Attribute-Based
    Key Encapsulations without Random Oracles}, publisher={Universität Paderborn},
    author={Blömer, Johannes and Liske, Gennadij}, year={2013} }'
  chicago: Blömer, Johannes, and Gennadij Liske. “Direct Chosen-Ciphertext Secure
    Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn,
    2013.
  ieee: J. Blömer and G. Liske, “Direct Chosen-Ciphertext Secure Attribute-Based Key
    Encapsulations without Random Oracles.” Universität Paderborn, 2013.
  mla: Blömer, Johannes, and Gennadij Liske. <i>Direct Chosen-Ciphertext Secure Attribute-Based
    Key Encapsulations without Random Oracles</i>. Universität Paderborn, 2013.
  short: J. Blömer, G. Liske, (2013).
date_created: 2017-10-17T12:42:37Z
date_updated: 2022-01-06T07:01:51Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:35:04Z
  date_updated: 2018-03-15T10:35:04Z
  file_id: '1292'
  file_name: 538-AB-KEM_01.pdf
  file_size: 389797
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:35:04Z
has_accepted_license: '1'
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2013/646
oa: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '43'
  name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
title: Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without
  Random Oracles
type: preprint
user_id: '25078'
year: '2013'
...
---
_id: '539'
author:
- first_name: Tobias
  full_name: Kornhoff, Tobias
  last_name: Kornhoff
citation:
  ama: Kornhoff T. <i>Der Einfluss adaptierter Erwartungen in dynamischen Cournot
    Oligopolen</i>. Universität Paderborn; 2013.
  apa: Kornhoff, T. (2013). <i>Der Einfluss adaptierter Erwartungen in dynamischen
    Cournot Oligopolen</i>. Universität Paderborn.
  bibtex: '@book{Kornhoff_2013, title={Der Einfluss adaptierter Erwartungen in dynamischen
    Cournot Oligopolen}, publisher={Universität Paderborn}, author={Kornhoff, Tobias},
    year={2013} }'
  chicago: Kornhoff, Tobias. <i>Der Einfluss adaptierter Erwartungen in dynamischen
    Cournot Oligopolen</i>. Universität Paderborn, 2013.
  ieee: T. Kornhoff, <i>Der Einfluss adaptierter Erwartungen in dynamischen Cournot
    Oligopolen</i>. Universität Paderborn, 2013.
  mla: Kornhoff, Tobias. <i>Der Einfluss adaptierter Erwartungen in dynamischen Cournot
    Oligopolen</i>. Universität Paderborn, 2013.
  short: T. Kornhoff, Der Einfluss adaptierter Erwartungen in dynamischen Cournot
    Oligopolen, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:37Z
date_updated: 2022-01-06T07:01:51Z
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
title: Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen
type: bachelorsthesis
user_id: '477'
year: '2013'
...