---
_id: '548'
abstract:
- lang: eng
  text: Peer-to-peer systems scale to millions of nodes and provide routing and storage
    functions with best effort quality. In order to provide a guaranteed quality of
    the overlay functions, even under strong dynamics in the network with regard to
    peer capacities, online participation and usage patterns, we propose to calibrate
    the peer-to-peer overlay and to autonomously learn which qualities can be reached.
    For that, we simulate the peer-to-peer overlay systematically under a wide range
    of parameter configurations and use neural networks to learn the effects of the
    configurations on the quality metrics. Thus, by choosing a specific quality setting
    by the overlay operator, the network can tune itself to the learned parameter
    configurations that lead to the desired quality. Evaluation shows that the presented
    self-calibration succeeds in learning the configuration-quality interdependencies
    and that peer-to-peer systems can learn and adapt their behavior according to
    desired quality goals.
author:
- first_name: Kalman
  full_name: Graffi, Kalman
  last_name: Graffi
- first_name: Timo
  full_name: Klerx, Timo
  last_name: Klerx
citation:
  ama: 'Graffi K, Klerx T. Bootstrapping Skynet: Calibration and Autonomic Self-Control
    of Structured Peer-to-Peer Networks. In: <i>Proceedings of the International Conference
    on Peer-to-Peer Computing (P2P’13)</i>. ; 2013:1-5. doi:<a href="https://doi.org/10.1109/P2P.2013.6688720">10.1109/P2P.2013.6688720</a>'
  apa: 'Graffi, K., &#38; Klerx, T. (2013). Bootstrapping Skynet: Calibration and
    Autonomic Self-Control of Structured Peer-to-Peer Networks. In <i>Proceedings
    of the International Conference on Peer-to-Peer Computing (P2P’13)</i> (pp. 1–5).
    <a href="https://doi.org/10.1109/P2P.2013.6688720">https://doi.org/10.1109/P2P.2013.6688720</a>'
  bibtex: '@inproceedings{Graffi_Klerx_2013, title={Bootstrapping Skynet: Calibration
    and Autonomic Self-Control of Structured Peer-to-Peer Networks}, DOI={<a href="https://doi.org/10.1109/P2P.2013.6688720">10.1109/P2P.2013.6688720</a>},
    booktitle={Proceedings of the International Conference on Peer-to-Peer Computing
    (P2P’13)}, author={Graffi, Kalman and Klerx, Timo}, year={2013}, pages={1–5} }'
  chicago: 'Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and
    Autonomic Self-Control of Structured Peer-to-Peer Networks.” In <i>Proceedings
    of the International Conference on Peer-to-Peer Computing (P2P’13)</i>, 1–5, 2013.
    <a href="https://doi.org/10.1109/P2P.2013.6688720">https://doi.org/10.1109/P2P.2013.6688720</a>.'
  ieee: 'K. Graffi and T. Klerx, “Bootstrapping Skynet: Calibration and Autonomic
    Self-Control of Structured Peer-to-Peer Networks,” in <i>Proceedings of the International
    Conference on Peer-to-Peer Computing (P2P’13)</i>, 2013, pp. 1–5.'
  mla: 'Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and Autonomic
    Self-Control of Structured Peer-to-Peer Networks.” <i>Proceedings of the International
    Conference on Peer-to-Peer Computing (P2P’13)</i>, 2013, pp. 1–5, doi:<a href="https://doi.org/10.1109/P2P.2013.6688720">10.1109/P2P.2013.6688720</a>.'
  short: 'K. Graffi, T. Klerx, in: Proceedings of the International Conference on
    Peer-to-Peer Computing (P2P’13), 2013, pp. 1–5.'
date_created: 2017-10-17T12:42:39Z
date_updated: 2022-01-06T07:01:56Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/P2P.2013.6688720
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:30:09Z
  date_updated: 2018-03-15T10:30:09Z
  file_id: '1285'
  file_name: 548-Bootstrapping.Skynet.Calibration.and.Autonomic.Self-Control.of.Structured.P2P.Networks_01.pdf
  file_size: 629234
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:30:09Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-5
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 Peer-to-Peer Computing
  (P2P'13)
status: public
title: 'Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured
  Peer-to-Peer Networks'
type: conference
user_id: '477'
year: '2013'
...
---
_id: '5484'
author:
- first_name: I
  full_name: Haus, I
  last_name: Haus
- first_name: Holger
  full_name: Steinmetz, Holger
  id: '43261'
  last_name: Steinmetz
- first_name: R
  full_name: Isidor, R
  last_name: Isidor
- first_name: Rüdiger
  full_name: Kabst, Rüdiger
  id: '42362'
  last_name: Kabst
citation:
  ama: 'Haus I, Steinmetz H, Isidor R, Kabst R. Gender Effects on Entrepreneurial
    Intention: A Meta-Analytical Structural Equation Model. <i>International Journal
    of Gender and Entrepreneurship (IJGE)</i>. 2013;5(2):130-156.'
  apa: 'Haus, I., Steinmetz, H., Isidor, R., &#38; Kabst, R. (2013). Gender Effects
    on Entrepreneurial Intention: A Meta-Analytical Structural Equation Model. <i>International
    Journal of Gender and Entrepreneurship (IJGE)</i>, <i>5</i>(2), 130–156.'
  bibtex: '@article{Haus_Steinmetz_Isidor_Kabst_2013, title={Gender Effects on Entrepreneurial
    Intention: A Meta-Analytical Structural Equation Model.}, volume={5}, number={2},
    journal={International Journal of Gender and Entrepreneurship (IJGE)}, author={Haus,
    I and Steinmetz, Holger and Isidor, R and Kabst, Rüdiger}, year={2013}, pages={130–156}
    }'
  chicago: 'Haus, I, Holger Steinmetz, R Isidor, and Rüdiger Kabst. “Gender Effects
    on Entrepreneurial Intention: A Meta-Analytical Structural Equation Model.” <i>International
    Journal of Gender and Entrepreneurship (IJGE)</i> 5, no. 2 (2013): 130–56.'
  ieee: 'I. Haus, H. Steinmetz, R. Isidor, and R. Kabst, “Gender Effects on Entrepreneurial
    Intention: A Meta-Analytical Structural Equation Model.,” <i>International Journal
    of Gender and Entrepreneurship (IJGE)</i>, vol. 5, no. 2, pp. 130–156, 2013.'
  mla: 'Haus, I., et al. “Gender Effects on Entrepreneurial Intention: A Meta-Analytical
    Structural Equation Model.” <i>International Journal of Gender and Entrepreneurship
    (IJGE)</i>, vol. 5, no. 2, 2013, pp. 130–56.'
  short: I. Haus, H. Steinmetz, R. Isidor, R. Kabst, International Journal of Gender
    and Entrepreneurship (IJGE) 5 (2013) 130–156.
date_created: 2018-11-12T10:31:29Z
date_updated: 2022-01-06T07:01:56Z
department:
- _id: '274'
intvolume: '         5'
issue: '2'
language:
- iso: eng
page: 130-156
publication: International Journal of Gender and Entrepreneurship (IJGE)
status: public
title: 'Gender Effects on Entrepreneurial Intention: A Meta-Analytical Structural
  Equation Model.'
type: journal_article
user_id: '46632'
volume: 5
year: '2013'
...
---
_id: '5489'
author:
- first_name: Holger
  full_name: Steinmetz, Holger
  id: '43261'
  last_name: Steinmetz
citation:
  ama: 'Steinmetz H. Analyzing observed composite differences across groups: Is partial
    measurement invariance enough? <i>European Journal of Research Methods for the
    Behavioral and Social Sciences</i>. 2013;9(1):1-12.'
  apa: 'Steinmetz, H. (2013). Analyzing observed composite differences across groups:
    Is partial measurement invariance enough? <i>European Journal of Research Methods
    for the Behavioral and Social Sciences.</i>, <i>9</i>(1), 1–12.'
  bibtex: '@article{Steinmetz_2013, title={Analyzing observed composite differences
    across groups: Is partial measurement invariance enough?}, volume={9}, number={1},
    journal={European Journal of Research Methods for the Behavioral and Social Sciences.},
    author={Steinmetz, Holger}, year={2013}, pages={1–12} }'
  chicago: 'Steinmetz, Holger. “Analyzing Observed Composite Differences across Groups:
    Is Partial Measurement Invariance Enough?” <i>European Journal of Research Methods
    for the Behavioral and Social Sciences.</i> 9, no. 1 (2013): 1–12.'
  ieee: 'H. Steinmetz, “Analyzing observed composite differences across groups: Is
    partial measurement invariance enough?,” <i>European Journal of Research Methods
    for the Behavioral and Social Sciences.</i>, vol. 9, no. 1, pp. 1–12, 2013.'
  mla: 'Steinmetz, Holger. “Analyzing Observed Composite Differences across Groups:
    Is Partial Measurement Invariance Enough?” <i>European Journal of Research Methods
    for the Behavioral and Social Sciences.</i>, vol. 9, no. 1, 2013, pp. 1–12.'
  short: H. Steinmetz, European Journal of Research Methods for the Behavioral and
    Social Sciences. 9 (2013) 1–12.
date_created: 2018-11-12T10:38:26Z
date_updated: 2022-01-06T07:01:56Z
department:
- _id: '274'
intvolume: '         9'
issue: '1'
language:
- iso: eng
page: 1-12
publication: European Journal of Research Methods for the Behavioral and Social Sciences.
status: public
title: 'Analyzing observed composite differences across groups: Is partial measurement
  invariance enough?'
type: journal_article
user_id: '46632'
volume: 9
year: '2013'
...
---
_id: '549'
author:
- first_name: Christian
  full_name: Bick, Christian
  last_name: Bick
citation:
  ama: Bick C. <i>Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte
    Datenflussrechner</i>. Universität Paderborn; 2013.
  apa: Bick, C. (2013). <i>Beschleunigung von Tiefenberechung aus Stereobildern durch
    FPGA-basierte Datenflussrechner</i>. Universität Paderborn.
  bibtex: '@book{Bick_2013, title={Beschleunigung von Tiefenberechung aus Stereobildern
    durch FPGA-basierte Datenflussrechner}, publisher={Universität Paderborn}, author={Bick,
    Christian}, year={2013} }'
  chicago: Bick, Christian. <i>Beschleunigung von Tiefenberechung aus Stereobildern
    durch FPGA-basierte Datenflussrechner</i>. Universität Paderborn, 2013.
  ieee: C. Bick, <i>Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte
    Datenflussrechner</i>. Universität Paderborn, 2013.
  mla: Bick, Christian. <i>Beschleunigung von Tiefenberechung aus Stereobildern durch
    FPGA-basierte Datenflussrechner</i>. Universität Paderborn, 2013.
  short: C. Bick, Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte
    Datenflussrechner, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:39Z
date_updated: 2022-01-06T07:01:56Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '14'
  name: SFB 901 - Subprojekt C2
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '550'
author:
- first_name: Julian
  full_name: Meschede, Julian
  last_name: Meschede
citation:
  ama: Meschede J. <i>Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen
    in Multiprozessor-Umgebungen</i>. Universität Paderborn; 2013.
  apa: Meschede, J. (2013). <i>Bandbreiten-beschränktes Scheduling mit skalierbaren
    Jobanforderungen in Multiprozessor-Umgebungen</i>. Universität Paderborn.
  bibtex: '@book{Meschede_2013, title={Bandbreiten-beschränktes Scheduling mit skalierbaren
    Jobanforderungen in Multiprozessor-Umgebungen}, publisher={Universität Paderborn},
    author={Meschede, Julian}, year={2013} }'
  chicago: Meschede, Julian. <i>Bandbreiten-beschränktes Scheduling mit skalierbaren
    Jobanforderungen in Multiprozessor-Umgebungen</i>. Universität Paderborn, 2013.
  ieee: J. Meschede, <i>Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen
    in Multiprozessor-Umgebungen</i>. Universität Paderborn, 2013.
  mla: Meschede, Julian. <i>Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen
    in Multiprozessor-Umgebungen</i>. Universität Paderborn, 2013.
  short: J. Meschede, Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen
    in Multiprozessor-Umgebungen, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:39Z
date_updated: 2022-01-06T07:01:56Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '14'
  name: SFB 901 - Subprojekt C2
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '551'
abstract:
- lang: eng
  text: In the service-oriented computing domain, the number of available software
    services steadily increased in recent years, favored by the rise of cloud computing
    with its attached delivery models like Software-as-a-Service (SaaS). To fully
    leverage the opportunities provided by these services for developing highly flexible
    and aligned SOA, integration of new services as well as the substitution of existing
    services must be simplified. As a consequence, approaches for automated and accurate
    service discovery and composition are needed. In this paper, we propose an automatic
    service composition approach as an extension to our earlier work on automatic
    service discovery. To ensure accurate results, it matches service requests and
    available offers based on their structural as well as behavioral aspects. Afterwards,
    possible service compositions are determined by composing service protocols through
    a composition strategy based on labeled transition systems.
author:
- first_name: Zille
  full_name: Huma, Zille
  last_name: Huma
- first_name: Christian
  full_name: Gerth, Christian
  last_name: Gerth
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Oliver
  full_name: Juwig, Oliver
  last_name: Juwig
citation:
  ama: 'Huma Z, Gerth C, Engels G, Juwig O. Automated Service Composition for On-the-Fly
    SOAs. In: <i>Proceedings of the 11th International Conference on Service Oriented
    Computing (ICSOC’13)</i>. LNCS. ; 2013:524--532. doi:<a href="https://doi.org/10.1007/978-3-642-45005-1_42">10.1007/978-3-642-45005-1_42</a>'
  apa: Huma, Z., Gerth, C., Engels, G., &#38; Juwig, O. (2013). Automated Service
    Composition for On-the-Fly SOAs. In <i>Proceedings of the 11th International Conference
    on Service Oriented Computing (ICSOC’13)</i> (pp. 524--532). <a href="https://doi.org/10.1007/978-3-642-45005-1_42">https://doi.org/10.1007/978-3-642-45005-1_42</a>
  bibtex: '@inproceedings{Huma_Gerth_Engels_Juwig_2013, series={LNCS}, title={Automated
    Service Composition for On-the-Fly SOAs}, DOI={<a href="https://doi.org/10.1007/978-3-642-45005-1_42">10.1007/978-3-642-45005-1_42</a>},
    booktitle={Proceedings of the 11th International Conference on Service Oriented
    Computing (ICSOC’13)}, author={Huma, Zille and Gerth, Christian and Engels, Gregor
    and Juwig, Oliver}, year={2013}, pages={524--532}, collection={LNCS} }'
  chicago: Huma, Zille, Christian Gerth, Gregor Engels, and Oliver Juwig. “Automated
    Service Composition for On-the-Fly SOAs.” In <i>Proceedings of the 11th International
    Conference on Service Oriented Computing (ICSOC’13)</i>, 524--532. LNCS, 2013.
    <a href="https://doi.org/10.1007/978-3-642-45005-1_42">https://doi.org/10.1007/978-3-642-45005-1_42</a>.
  ieee: Z. Huma, C. Gerth, G. Engels, and O. Juwig, “Automated Service Composition
    for On-the-Fly SOAs,” in <i>Proceedings of the 11th International Conference on
    Service Oriented Computing (ICSOC’13)</i>, 2013, pp. 524--532.
  mla: Huma, Zille, et al. “Automated Service Composition for On-the-Fly SOAs.” <i>Proceedings
    of the 11th International Conference on Service Oriented Computing (ICSOC’13)</i>,
    2013, pp. 524--532, doi:<a href="https://doi.org/10.1007/978-3-642-45005-1_42">10.1007/978-3-642-45005-1_42</a>.
  short: 'Z. Huma, C. Gerth, G. Engels, O. Juwig, in: Proceedings of the 11th International
    Conference on Service Oriented Computing (ICSOC’13), 2013, pp. 524--532.'
date_created: 2017-10-17T12:42:39Z
date_updated: 2022-01-06T07:01:57Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.1007/978-3-642-45005-1_42
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:31:20Z
  date_updated: 2018-03-15T10:31:20Z
  file_id: '1287'
  file_name: 551-978-3-642-45005-1_42.pdf
  file_size: 384397
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:31:20Z
has_accepted_license: '1'
language:
- iso: eng
page: 524--532
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 11th International Conference on Service Oriented
  Computing (ICSOC'13)
series_title: LNCS
status: public
title: Automated Service Composition for On-the-Fly SOAs
type: conference
user_id: '477'
year: '2013'
...
---
_id: '552'
author:
- first_name: Kevin
  full_name: Meckenstock, Kevin
  last_name: Meckenstock
citation:
  ama: Meckenstock K. <i>Auktionen im Beschaffungsmanagement - Eine spieltheoretische
    Analyse</i>. Universität Paderborn; 2013.
  apa: Meckenstock, K. (2013). <i>Auktionen im Beschaffungsmanagement - Eine spieltheoretische
    Analyse</i>. Universität Paderborn.
  bibtex: '@book{Meckenstock_2013, title={Auktionen im Beschaffungsmanagement - Eine
    spieltheoretische Analyse}, publisher={Universität Paderborn}, author={Meckenstock,
    Kevin}, year={2013} }'
  chicago: Meckenstock, Kevin. <i>Auktionen im Beschaffungsmanagement - Eine spieltheoretische
    Analyse</i>. Universität Paderborn, 2013.
  ieee: K. Meckenstock, <i>Auktionen im Beschaffungsmanagement - Eine spieltheoretische
    Analyse</i>. Universität Paderborn, 2013.
  mla: Meckenstock, Kevin. <i>Auktionen im Beschaffungsmanagement - Eine spieltheoretische
    Analyse</i>. Universität Paderborn, 2013.
  short: K. Meckenstock, Auktionen im Beschaffungsmanagement - Eine spieltheoretische
    Analyse, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:39Z
date_updated: 2022-01-06T07:01:57Z
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: Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '553'
author:
- first_name: Kathlén
  full_name: Kohn, Kathlén
  last_name: Kohn
citation:
  ama: Kohn K. <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische
    Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn; 2013.
  apa: Kohn, K. (2013). <i>Attributbasierte Verschlüsselung mittels Gittermethoden
    - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität
    Paderborn.
  bibtex: '@book{Kohn_2013, title={Attributbasierte Verschlüsselung mittels Gittermethoden
    - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise}, publisher={Universität
    Paderborn}, author={Kohn, Kathlén}, year={2013} }'
  chicago: Kohn, Kathlén. <i>Attributbasierte Verschlüsselung mittels Gittermethoden
    - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität
    Paderborn, 2013.
  ieee: K. Kohn, <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische
    Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn, 2013.
  mla: Kohn, Kathlén. <i>Attributbasierte Verschlüsselung mittels Gittermethoden -
    Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn,
    2013.
  short: K. Kohn, Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische
    Grundlagen, Verfahren und Sicherheitsbeweise, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:40Z
date_updated: 2022-01-06T07:01:57Z
department:
- _id: '64'
language:
- iso: ger
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
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen,
  Verfahren und Sicherheitsbeweise
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '554'
abstract:
- lang: eng
  text: We establish a link between cooperative and competitive behavior. For every
    possible vector of weights of an asymmetric Nash bargaining solution there exists
    a market that has this asymmetric Nash bargaining solution as its unique competitive
    payoff vector.
author:
- first_name: Sonja
  full_name: Brangewitz, Sonja
  last_name: Brangewitz
- first_name: Jan-Philip
  full_name: Gamp, Jan-Philip
  last_name: Gamp
citation:
  ama: Brangewitz S, Gamp J-P. Asymmetric Nash bargaining solutions and competitive
    payoffs. <i>Economics Letters</i>. 2013;(2):224-227. doi:<a href="https://doi.org/10.1016/j.econlet.2013.08.013">10.1016/j.econlet.2013.08.013</a>
  apa: Brangewitz, S., &#38; Gamp, J.-P. (2013). Asymmetric Nash bargaining solutions
    and competitive payoffs. <i>Economics Letters</i>, (2), 224–227. <a href="https://doi.org/10.1016/j.econlet.2013.08.013">https://doi.org/10.1016/j.econlet.2013.08.013</a>
  bibtex: '@article{Brangewitz_Gamp_2013, title={Asymmetric Nash bargaining solutions
    and competitive payoffs}, DOI={<a href="https://doi.org/10.1016/j.econlet.2013.08.013">10.1016/j.econlet.2013.08.013</a>},
    number={2}, journal={Economics Letters}, publisher={Elsevier}, author={Brangewitz,
    Sonja and Gamp, Jan-Philip}, year={2013}, pages={224–227} }'
  chicago: 'Brangewitz, Sonja, and Jan-Philip Gamp. “Asymmetric Nash Bargaining Solutions
    and Competitive Payoffs.” <i>Economics Letters</i>, no. 2 (2013): 224–27. <a href="https://doi.org/10.1016/j.econlet.2013.08.013">https://doi.org/10.1016/j.econlet.2013.08.013</a>.'
  ieee: S. Brangewitz and J.-P. Gamp, “Asymmetric Nash bargaining solutions and competitive
    payoffs,” <i>Economics Letters</i>, no. 2, pp. 224–227, 2013.
  mla: Brangewitz, Sonja, and Jan-Philip Gamp. “Asymmetric Nash Bargaining Solutions
    and Competitive Payoffs.” <i>Economics Letters</i>, no. 2, Elsevier, 2013, pp.
    224–27, doi:<a href="https://doi.org/10.1016/j.econlet.2013.08.013">10.1016/j.econlet.2013.08.013</a>.
  short: S. Brangewitz, J.-P. Gamp, Economics Letters (2013) 224–227.
date_created: 2017-10-17T12:42:40Z
date_updated: 2022-01-06T07:01:58Z
ddc:
- '040'
department:
- _id: '205'
doi: 10.1016/j.econlet.2013.08.013
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:29:34Z
  date_updated: 2018-03-15T10:29:34Z
  file_id: '1284'
  file_name: 554-Asymmetric_Nash_bargaining_solutions_and_competitive_payoffs.pdf
  file_size: 374965
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:29:34Z
has_accepted_license: '1'
issue: '2'
language:
- iso: eng
page: 224 - 227
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publication: Economics Letters
publisher: Elsevier
status: public
title: Asymmetric Nash bargaining solutions and competitive payoffs
type: journal_article
user_id: '477'
year: '2013'
...
---
_id: '555'
author:
- first_name: Alexander
  full_name: Setzer, Alexander
  id: '11108'
  last_name: Setzer
citation:
  ama: Setzer A. <i>Approximation Algorithms for the Linear Arrangement of Special
    Classes of Graphs</i>. Universität Paderborn; 2013.
  apa: Setzer, A. (2013). <i>Approximation Algorithms for the Linear Arrangement of
    Special Classes of Graphs</i>. Universität Paderborn.
  bibtex: '@book{Setzer_2013, title={Approximation Algorithms for the Linear Arrangement
    of Special Classes of Graphs}, publisher={Universität Paderborn}, author={Setzer,
    Alexander}, year={2013} }'
  chicago: Setzer, Alexander. <i>Approximation Algorithms for the Linear Arrangement
    of Special Classes of Graphs</i>. Universität Paderborn, 2013.
  ieee: A. Setzer, <i>Approximation Algorithms for the Linear Arrangement of Special
    Classes of Graphs</i>. Universität Paderborn, 2013.
  mla: Setzer, Alexander. <i>Approximation Algorithms for the Linear Arrangement of
    Special Classes of Graphs</i>. Universität Paderborn, 2013.
  short: A. Setzer, Approximation Algorithms for the Linear Arrangement of Special
    Classes of Graphs, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:40Z
date_updated: 2022-01-06T07:01:59Z
department:
- _id: '79'
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: Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs
type: mastersthesis
user_id: '477'
year: '2013'
...
---
_id: '556'
author:
- first_name: Tobias
  full_name: Nickel, Tobias
  last_name: Nickel
citation:
  ama: Nickel T. <i>Analyse von Benutzeranforderungen von Service-Kompositionen mittels
    Modelchecking</i>. Universität Paderborn; 2013.
  apa: Nickel, T. (2013). <i>Analyse von Benutzeranforderungen von Service-Kompositionen
    mittels Modelchecking</i>. Universität Paderborn.
  bibtex: '@book{Nickel_2013, title={Analyse von Benutzeranforderungen von Service-Kompositionen
    mittels Modelchecking}, publisher={Universität Paderborn}, author={Nickel, Tobias},
    year={2013} }'
  chicago: Nickel, Tobias. <i>Analyse von Benutzeranforderungen von Service-Kompositionen
    mittels Modelchecking</i>. Universität Paderborn, 2013.
  ieee: T. Nickel, <i>Analyse von Benutzeranforderungen von Service-Kompositionen
    mittels Modelchecking</i>. Universität Paderborn, 2013.
  mla: Nickel, Tobias. <i>Analyse von Benutzeranforderungen von Service-Kompositionen
    mittels Modelchecking</i>. Universität Paderborn, 2013.
  short: T. Nickel, Analyse von Benutzeranforderungen von Service-Kompositionen mittels
    Modelchecking, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:40Z
date_updated: 2022-01-06T07:01:59Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '557'
abstract:
- lang: eng
  text: Since the last two decades, the water consumption in Germany is decreasing,
    which causes the water tanks and pipes in a water supply system to work inefficiently.
    This paper proposes an approach for a decision support system, which helps to
    decide how to plan new water tanks and resize existing tanks in water supply systems.
    The approach uses a combination of network reduction, mathematical optimization
    and hydraulic simulation. The mathematical optimization model is a nonconvex Mixed
    Integer Quadratically Constrained Program (MIQCP), which is solved by a piecewise
    linearization. As this may lead to many binary variables and therefore high computational
    times, the size of the water supply system model is reduced before building the
    optimization model. By applying several network reduction techniques there may
    occur some hydraulic differences between the original network model and the reduced
    network model. To make sure that the solution obtained in the optimization process
    is feasible in the original water supply system, the solution is verified by a
    hydraulic simulation tool.
author:
- first_name: Corinna
  full_name: Hallmann, Corinna
  last_name: Hallmann
citation:
  ama: Hallmann C. <i>An Approach for a Decision Support Systems to Optimize Water
    Tanks in Water Supply Systems by Combining Network Reduction, Optimization and
    Simulation</i>. Universität Paderborn; 2013.
  apa: Hallmann, C. (2013). <i>An Approach for a Decision Support Systems to optimize
    Water Tanks in Water Supply Systems by combining Network Reduction, Optimization
    and Simulation</i>. Universität Paderborn.
  bibtex: '@book{Hallmann_2013, title={An Approach for a Decision Support Systems
    to optimize Water Tanks in Water Supply Systems by combining Network Reduction,
    Optimization and Simulation}, publisher={Universität Paderborn}, author={Hallmann,
    Corinna}, year={2013} }'
  chicago: Hallmann, Corinna. <i>An Approach for a Decision Support Systems to Optimize
    Water Tanks in Water Supply Systems by Combining Network Reduction, Optimization
    and Simulation</i>. Universität Paderborn, 2013.
  ieee: C. Hallmann, <i>An Approach for a Decision Support Systems to optimize Water
    Tanks in Water Supply Systems by combining Network Reduction, Optimization and
    Simulation</i>. Universität Paderborn, 2013.
  mla: Hallmann, Corinna. <i>An Approach for a Decision Support Systems to Optimize
    Water Tanks in Water Supply Systems by Combining Network Reduction, Optimization
    and Simulation</i>. Universität Paderborn, 2013.
  short: C. Hallmann, An Approach for a Decision Support Systems to Optimize Water
    Tanks in Water Supply Systems by Combining Network Reduction, Optimization and
    Simulation, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:40Z
date_updated: 2022-01-06T07:01:59Z
ddc:
- '040'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:27:58Z
  date_updated: 2018-03-15T10:27:58Z
  file_id: '1283'
  file_name: 557-Hal13.pdf
  file_size: 271038
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:27:58Z
has_accepted_license: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '15'
  name: SFB 901 - Subprojekt C3
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: An Approach for a Decision Support Systems to optimize Water Tanks in Water
  Supply Systems by combining Network Reduction, Optimization and Simulation
type: report
user_id: '15504'
year: '2013'
...
---
_id: '5575'
author:
- first_name: Felix
  full_name: Wex, Felix
  last_name: Wex
- first_name: Guido
  full_name: Schryen, Guido
  id: '72850'
  last_name: Schryen
- first_name: Dirk
  full_name: Neumann, Dirk
  last_name: Neumann
citation:
  ama: Wex F, Schryen G, Neumann D. Assignments of Collaborative Rescue Units during
    Emergency Response. <i>International Journal of Information Systems for Crisis
    Response and Management</i>. 2013;5(4):63-80.
  apa: Wex, F., Schryen, G., &#38; Neumann, D. (2013). Assignments of Collaborative
    Rescue Units during Emergency Response. <i>International Journal of Information
    Systems for Crisis Response and Management</i>, <i>5</i>(4), 63–80.
  bibtex: '@article{Wex_Schryen_Neumann_2013, title={Assignments of Collaborative
    Rescue Units during Emergency Response}, volume={5}, number={4}, journal={International
    Journal of Information Systems for Crisis Response and Management}, publisher={IGI
    Publ.}, author={Wex, Felix and Schryen, Guido and Neumann, Dirk}, year={2013},
    pages={63–80} }'
  chicago: 'Wex, Felix, Guido Schryen, and Dirk Neumann. “Assignments of Collaborative
    Rescue Units during Emergency Response.” <i>International Journal of Information
    Systems for Crisis Response and Management</i> 5, no. 4 (2013): 63–80.'
  ieee: F. Wex, G. Schryen, and D. Neumann, “Assignments of Collaborative Rescue Units
    during Emergency Response,” <i>International Journal of Information Systems for
    Crisis Response and Management</i>, vol. 5, no. 4, pp. 63–80, 2013.
  mla: Wex, Felix, et al. “Assignments of Collaborative Rescue Units during Emergency
    Response.” <i>International Journal of Information Systems for Crisis Response
    and Management</i>, vol. 5, no. 4, IGI Publ., 2013, pp. 63–80.
  short: F. Wex, G. Schryen, D. Neumann, International Journal of Information Systems
    for Crisis Response and Management 5 (2013) 63–80.
date_created: 2018-11-14T11:14:07Z
date_updated: 2022-01-06T07:02:00Z
ddc:
- '000'
department:
- _id: '277'
extern: '1'
file:
- access_level: open_access
  content_type: application/pdf
  creator: hsiemes
  date_created: 2018-12-11T14:25:51Z
  date_updated: 2018-12-13T15:13:02Z
  file_id: '6168'
  file_name: ERS_IJISCRAM2013_Revision 1.pdf
  file_size: 493113
  relation: main_file
file_date_updated: 2018-12-13T15:13:02Z
has_accepted_license: '1'
intvolume: '         5'
issue: '4'
language:
- iso: eng
oa: '1'
page: 63-80
publication: International Journal of Information Systems for Crisis Response and
  Management
publisher: IGI Publ.
status: public
title: Assignments of Collaborative Rescue Units during Emergency Response
type: journal_article
user_id: '61579'
volume: 5
year: '2013'
...
---
_id: '5576'
author:
- first_name: Felix
  full_name: Wex, Felix
  last_name: Wex
- first_name: Guido
  full_name: Schryen, Guido
  id: '72850'
  last_name: Schryen
- first_name: Dirk
  full_name: Neumann, Dirk
  last_name: Neumann
citation:
  ama: 'Wex F, Schryen G, Neumann D. Decision Modeling for Assignments of Collaborative
    Rescue Units during Emergency Response. In: <i>Proceedings of the 46th Hawaii
    International Conference on System Science</i>. ; 2013.'
  apa: Wex, F., Schryen, G., &#38; Neumann, D. (2013). Decision Modeling for Assignments
    of Collaborative Rescue Units during Emergency Response. In <i>Proceedings of
    the 46th Hawaii International Conference on System Science</i>.
  bibtex: '@inproceedings{Wex_Schryen_Neumann_2013, title={Decision Modeling for Assignments
    of Collaborative Rescue Units during Emergency Response}, booktitle={Proceedings
    of the 46th Hawaii International Conference on System Science}, author={Wex, Felix
    and Schryen, Guido and Neumann, Dirk}, year={2013} }'
  chicago: Wex, Felix, Guido Schryen, and Dirk Neumann. “Decision Modeling for Assignments
    of Collaborative Rescue Units during Emergency Response.” In <i>Proceedings of
    the 46th Hawaii International Conference on System Science</i>, 2013.
  ieee: F. Wex, G. Schryen, and D. Neumann, “Decision Modeling for Assignments of
    Collaborative Rescue Units during Emergency Response,” in <i>Proceedings of the
    46th Hawaii International Conference on System Science</i>, 2013.
  mla: Wex, Felix, et al. “Decision Modeling for Assignments of Collaborative Rescue
    Units during Emergency Response.” <i>Proceedings of the 46th Hawaii International
    Conference on System Science</i>, 2013.
  short: 'F. Wex, G. Schryen, D. Neumann, in: Proceedings of the 46th Hawaii International
    Conference on System Science, 2013.'
date_created: 2018-11-14T11:14:56Z
date_updated: 2022-01-06T07:02:00Z
ddc:
- '000'
department:
- _id: '277'
extern: '1'
file:
- access_level: open_access
  content_type: application/pdf
  creator: hsiemes
  date_created: 2018-12-07T12:00:30Z
  date_updated: 2018-12-13T15:12:05Z
  file_id: '6049'
  file_name: ERS_HICSS2013_revised_v11-ACM [number].pdf
  file_size: 394101
  relation: main_file
file_date_updated: 2018-12-13T15:12:05Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
publication: Proceedings of the 46th Hawaii International Conference on System Science
status: public
title: Decision Modeling for Assignments of Collaborative Rescue Units during Emergency
  Response
type: conference
user_id: '61579'
year: '2013'
...
---
_id: '558'
citation:
  ama: Flocchini P, Gao J, Kranakis E, Meyer auf der Heide F, eds. <i>Algorithms for
    Sensor Systems - 9th International Symposium on Algorithms and Experiments for
    Sensor Systems, Wireless Networks and Distributed Robotics</i>. Vol 8243. Springer;
    2013. doi:<a href="https://doi.org/10.1007/978-3-642-45346-5">10.1007/978-3-642-45346-5</a>
  apa: 'Flocchini, P., Gao, J., Kranakis, E., &#38; Meyer auf der Heide, F. (Eds.).
    (2013). <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms
    and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics</i>
    (Vol. 8243). Presented at the ALGOSENSORS 2013, Sophia Antipolis, France: Springer.
    <a href="https://doi.org/10.1007/978-3-642-45346-5">https://doi.org/10.1007/978-3-642-45346-5</a>'
  bibtex: '@book{Flocchini_Gao_Kranakis_Meyer auf der Heide_2013, series={LNCS}, title={Algorithms
    for Sensor Systems - 9th International Symposium on Algorithms and Experiments
    for Sensor Systems, Wireless Networks and Distributed Robotics}, volume={8243},
    DOI={<a href="https://doi.org/10.1007/978-3-642-45346-5">10.1007/978-3-642-45346-5</a>},
    publisher={Springer}, year={2013}, collection={LNCS} }'
  chicago: Flocchini, Paola, Jie Gao, Evangelos Kranakis, and Friedhelm Meyer auf
    der Heide, eds. <i>Algorithms for Sensor Systems - 9th International Symposium
    on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed
    Robotics</i>. Vol. 8243. LNCS. Springer, 2013. <a href="https://doi.org/10.1007/978-3-642-45346-5">https://doi.org/10.1007/978-3-642-45346-5</a>.
  ieee: P. Flocchini, J. Gao, E. Kranakis, and F. Meyer auf der Heide, Eds., <i>Algorithms
    for Sensor Systems - 9th International Symposium on Algorithms and Experiments
    for Sensor Systems, Wireless Networks and Distributed Robotics</i>, vol. 8243.
    Springer, 2013.
  mla: Flocchini, Paola, et al., editors. <i>Algorithms for Sensor Systems - 9th International
    Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks
    and Distributed Robotics</i>. Vol. 8243, Springer, 2013, doi:<a href="https://doi.org/10.1007/978-3-642-45346-5">10.1007/978-3-642-45346-5</a>.
  short: P. Flocchini, J. Gao, E. Kranakis, F. Meyer auf der Heide, eds., Algorithms
    for Sensor Systems - 9th International Symposium on Algorithms and Experiments
    for Sensor Systems, Wireless Networks and Distributed Robotics, Springer, 2013.
conference:
  end_date: 2013-09-06
  location: Sophia Antipolis, France
  name: ALGOSENSORS 2013
  start_date: 2013-09-05
date_created: 2017-10-17T12:42:41Z
date_updated: 2022-01-06T07:02:02Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5
editor:
- first_name: Paola
  full_name: Flocchini, Paola
  last_name: Flocchini
- first_name: Jie
  full_name: Gao, Jie
  last_name: Gao
- first_name: Evangelos
  full_name: Kranakis, Evangelos
  last_name: Kranakis
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T16:29:07Z
  date_updated: 2018-11-02T16:29:07Z
  file_id: '5327'
  file_name: 2014_Book_AlgorithmsForSensorSystems-1.pdf
  file_size: 9186107
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T16:29:07Z
has_accepted_license: '1'
intvolume: '      8243'
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: Springer
series_title: LNCS
status: public
title: Algorithms for Sensor Systems - 9th International Symposium on Algorithms and
  Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
type: conference_editor
user_id: '477'
volume: 8243
year: '2013'
...
---
_id: '559'
abstract:
- lang: eng
  text: Distributed hash tables are very versatile to use, as distributed storage
    is a desirable feature for various applications. Typical structured overlays like
    Chord, Pastry or Kademlia consider only homogeneous nodes with equal capacities,
    which does not resemble reality. In a practical use case, nodes might get overloaded
    by storing popular data. In this paper, we present a general approach to enable
    capacity awareness and load-balancing capability of homogeneous structured overlays.
    We introduce a hierarchical second structured overlay aside, which allows efficient
    capacity-based access on the nodes in the system as hosting mirrors. Simulation
    results show that the structured overlay is able to store various contents, such
    as of a social network, with only a negligible number of overloaded peers. Content,
    even if very popular, is hosted by easily findable capable peers. Thus, long-existing
    and well-evaluated overlays like Chord or Pastry can be used to create attractive
    DHT-based applications.
author:
- first_name: Philip
  full_name: Wette, Philip
  last_name: Wette
- first_name: Kalman
  full_name: Graffi, Kalman
  last_name: Graffi
citation:
  ama: 'Wette P, Graffi K. Adding Capacity-Aware Storage Indirection to Homogeneous
    Distributed Hash Tables. In: <i>Proceedings of the Conference on Networked Systems
    (NetSys)</i>. ; 2013:35-42. doi:<a href="https://doi.org/10.1109/NetSys.2013.9">10.1109/NetSys.2013.9</a>'
  apa: Wette, P., &#38; Graffi, K. (2013). Adding Capacity-Aware Storage Indirection
    to Homogeneous Distributed Hash Tables. In <i>Proceedings of the Conference on
    Networked Systems (NetSys)</i> (pp. 35–42). <a href="https://doi.org/10.1109/NetSys.2013.9">https://doi.org/10.1109/NetSys.2013.9</a>
  bibtex: '@inproceedings{Wette_Graffi_2013, title={Adding Capacity-Aware Storage
    Indirection to Homogeneous Distributed Hash Tables}, DOI={<a href="https://doi.org/10.1109/NetSys.2013.9">10.1109/NetSys.2013.9</a>},
    booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Wette,
    Philip and Graffi, Kalman}, year={2013}, pages={35–42} }'
  chicago: Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection
    to Homogeneous Distributed Hash Tables.” In <i>Proceedings of the Conference on
    Networked Systems (NetSys)</i>, 35–42, 2013. <a href="https://doi.org/10.1109/NetSys.2013.9">https://doi.org/10.1109/NetSys.2013.9</a>.
  ieee: P. Wette and K. Graffi, “Adding Capacity-Aware Storage Indirection to Homogeneous
    Distributed Hash Tables,” in <i>Proceedings of the Conference on Networked Systems
    (NetSys)</i>, 2013, pp. 35–42.
  mla: Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection
    to Homogeneous Distributed Hash Tables.” <i>Proceedings of the Conference on Networked
    Systems (NetSys)</i>, 2013, pp. 35–42, doi:<a href="https://doi.org/10.1109/NetSys.2013.9">10.1109/NetSys.2013.9</a>.
  short: 'P. Wette, K. Graffi, in: Proceedings of the Conference on Networked Systems
    (NetSys), 2013, pp. 35–42.'
date_created: 2017-10-17T12:42:41Z
date_updated: 2022-01-06T07:02:04Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/NetSys.2013.9
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:27:21Z
  date_updated: 2018-03-15T10:27:21Z
  file_id: '1282'
  file_name: 559-Adding.Capacity.Aware.Storage.Indirection.to.Homogeneous.Distributed.Hash.Tables.pdf
  file_size: 734618
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:27:21Z
has_accepted_license: '1'
language:
- iso: eng
page: 35-42
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 Conference on Networked Systems (NetSys)
status: public
title: Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables
type: conference
user_id: '477'
year: '2013'
...
---
_id: '560'
abstract:
- lang: eng
  text: In the last decades, development turned from monolithic software products
    towards more flexible software components that can be provided on world-wide markets
    in form of services. Customers request such services or compositions of several
    services. However, in many cases, discovering the best services to address a given
    request is a tough challenge and requires expressive, gradual matching results,
    considering different aspects of a service description, e.g., inputs/ouputs, protocols,
    or quality properties. Furthermore,in situations in which no service exactly satifies
    the request, approximate matching which can deal with a certain amount of fuzziness
    becomes necessary. There is a wealth of service matching approaches, but it is
    not clear whether there is a comprehensive, fuzzy matching approach which addresses
    all these challenges. Although there are a few service matchingsurveys, none of
    them is able to answer this question. In this paper, we perform a systematic literature
    survey of 35 (outof 504) service matching approaches which consider fuzzy matching.
    Based on this survey, we propose a classication,discuss how different matching
    approaches can be combined into a comprehensive matching method, and identify
    future research challenges.
author:
- first_name: Marie
  full_name: Platenius, Marie
  last_name: Platenius
- first_name: Markus
  full_name: von Detten, Markus
  last_name: von Detten
- first_name: Steffen
  full_name: Becker, Steffen
  last_name: Becker
- first_name: Wilhelm
  full_name: Schäfer, Wilhelm
  last_name: Schäfer
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
citation:
  ama: 'Platenius M, von Detten M, Becker S, Schäfer W, Engels G. A Survey of Fuzzy
    Service Matching Approaches in the Context of On-The-Fly Computing. In: <i>Proceedings
    of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering</i>.
    ; 2013:143-152. doi:<a href="https://doi.org/10.1145/2465449.2465454">10.1145/2465449.2465454</a>'
  apa: Platenius, M., von Detten, M., Becker, S., Schäfer, W., &#38; Engels, G. (2013).
    A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing.
    In <i>Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based
    Software Engineering</i> (pp. 143–152). <a href="https://doi.org/10.1145/2465449.2465454">https://doi.org/10.1145/2465449.2465454</a>
  bibtex: '@inproceedings{Platenius_von Detten_Becker_Schäfer_Engels_2013, title={A
    Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing},
    DOI={<a href="https://doi.org/10.1145/2465449.2465454">10.1145/2465449.2465454</a>},
    booktitle={Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based
    Software Engineering}, author={Platenius, Marie and von Detten, Markus and Becker,
    Steffen and Schäfer, Wilhelm and Engels, Gregor}, year={2013}, pages={143–152}
    }'
  chicago: Platenius, Marie, Markus von Detten, Steffen Becker, Wilhelm Schäfer, and
    Gregor Engels. “A Survey of Fuzzy Service Matching Approaches in the Context of
    On-The-Fly Computing.” In <i>Proceedings of the 16th International ACM Sigsoft
    Symposium on Component-Based Software Engineering</i>, 143–52, 2013. <a href="https://doi.org/10.1145/2465449.2465454">https://doi.org/10.1145/2465449.2465454</a>.
  ieee: M. Platenius, M. von Detten, S. Becker, W. Schäfer, and G. Engels, “A Survey
    of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing,”
    in <i>Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based
    Software Engineering</i>, 2013, pp. 143–152.
  mla: Platenius, Marie, et al. “A Survey of Fuzzy Service Matching Approaches in
    the Context of On-The-Fly Computing.” <i>Proceedings of the 16th International
    ACM Sigsoft Symposium on Component-Based Software Engineering</i>, 2013, pp. 143–52,
    doi:<a href="https://doi.org/10.1145/2465449.2465454">10.1145/2465449.2465454</a>.
  short: 'M. Platenius, M. von Detten, S. Becker, W. Schäfer, G. Engels, in: Proceedings
    of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering,
    2013, pp. 143–152.'
date_created: 2017-10-17T12:42:41Z
date_updated: 2022-01-06T07:02:06Z
ddc:
- '040'
department:
- _id: '66'
- _id: '76'
doi: 10.1145/2465449.2465454
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:26:49Z
  date_updated: 2018-03-15T10:26:49Z
  file_id: '1281'
  file_name: 560-Platenius_et_al_CBSE2013.pdf
  file_size: 570580
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:26:49Z
has_accepted_license: '1'
language:
- iso: eng
page: 143-152
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 16th International ACM Sigsoft Symposium on Component-Based
  Software Engineering
status: public
title: A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly
  Computing
type: conference
user_id: '477'
year: '2013'
...
---
_id: '561'
abstract:
- lang: eng
  text: 'We present a privacy-friendly architecture for a future cloud computing scenario
    where software licensing and software payment plays a major role. We show how
    digital rights management as a technical solution for software licensing can be
    achieved in a privacy-friendly manner. In our scenario, users who buy software
    from software providers and execute it at computing centres stay anonymous. At
    the same time, our approach guarantees that software licenses are bound to users
    and that their validity is checked before execution. Thus, DRM constitutes an
    incentive for software providers to take part in such a future cloud computing
    scenario. We employ a software re-encryption scheme so that computing centres
    are not able to build profiles of their users – not even under a pseudonym. We
    make sure that malicious users are unable to relay software to others. '
author:
- first_name: Ronald
  full_name: Petrlic, Ronald
  last_name: Petrlic
- first_name: Stephan
  full_name: Sekula, Stephan
  last_name: Sekula
- first_name: Christoph
  full_name: Sorge, Christoph
  last_name: Sorge
citation:
  ama: Petrlic R, Sekula S, Sorge C. A privacy-friendly Architecture for future Cloud
    Computing. <i>International Journal of Grid and Utility Computing</i>. 2013;(4):265-277.
    doi:<a href="https://doi.org/10.1504/IJGUC.2013.057120">10.1504/IJGUC.2013.057120</a>
  apa: Petrlic, R., Sekula, S., &#38; Sorge, C. (2013). A privacy-friendly Architecture
    for future Cloud Computing. <i>International Journal of Grid and Utility Computing</i>,
    (4), 265–277. <a href="https://doi.org/10.1504/IJGUC.2013.057120">https://doi.org/10.1504/IJGUC.2013.057120</a>
  bibtex: '@article{Petrlic_Sekula_Sorge_2013, title={A privacy-friendly Architecture
    for future Cloud Computing}, DOI={<a href="https://doi.org/10.1504/IJGUC.2013.057120">10.1504/IJGUC.2013.057120</a>},
    number={4}, journal={International Journal of Grid and Utility Computing}, publisher={InderScience},
    author={Petrlic, Ronald and Sekula, Stephan and Sorge, Christoph}, year={2013},
    pages={265–277} }'
  chicago: 'Petrlic, Ronald, Stephan Sekula, and Christoph Sorge. “A Privacy-Friendly
    Architecture for Future Cloud Computing.” <i>International Journal of Grid and
    Utility Computing</i>, no. 4 (2013): 265–77. <a href="https://doi.org/10.1504/IJGUC.2013.057120">https://doi.org/10.1504/IJGUC.2013.057120</a>.'
  ieee: R. Petrlic, S. Sekula, and C. Sorge, “A privacy-friendly Architecture for
    future Cloud Computing,” <i>International Journal of Grid and Utility Computing</i>,
    no. 4, pp. 265–277, 2013.
  mla: Petrlic, Ronald, et al. “A Privacy-Friendly Architecture for Future Cloud Computing.”
    <i>International Journal of Grid and Utility Computing</i>, no. 4, InderScience,
    2013, pp. 265–77, doi:<a href="https://doi.org/10.1504/IJGUC.2013.057120">10.1504/IJGUC.2013.057120</a>.
  short: R. Petrlic, S. Sekula, C. Sorge, International Journal of Grid and Utility
    Computing (2013) 265–277.
date_created: 2017-10-17T12:42:41Z
date_updated: 2022-01-06T07:02:07Z
ddc:
- '040'
doi: 10.1504/IJGUC.2013.057120
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:26:14Z
  date_updated: 2018-03-15T10:26:14Z
  file_id: '1280'
  file_name: 561-authorFinalVersion.pdf
  file_size: 1036554
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:26:14Z
has_accepted_license: '1'
issue: '4'
main_file_link:
- url: http://www.inderscience.com/offer.php?id=57120
page: 265-277
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publication: International Journal of Grid and Utility Computing
publisher: InderScience
status: public
title: A privacy-friendly Architecture for future Cloud Computing
type: journal_article
user_id: '477'
year: '2013'
...
---
_id: '562'
abstract:
- lang: eng
  text: In Distributed Cloud Computing, applications are deployed across many data
    centres at topologically diverse locations to improved network-related quality
    of service (QoS). As we focus on interactive applications, we minimize the latency
    between users and an application by allocating Cloud resources nearby the customers.
    Allocating resources at all locations will result in the best latency but also
    in the highest expenses. So we need to find an optimal subset of locations which
    reduces the latency but also the expenses – the facility location problem (FLP).
    In addition, we consider resource capacity restrictions, as a resource can only
    serve a limited amount of users. An FLP can be globally solved. Additionally,
    we propose a local, distributed heuristic. This heuristic is running within the
    network and does not depend on a global component. No distributed, local approximations
    for the capacitated FLP have been proposed so far due to the complexity of the
    problem. We compared the heuristic with an optimal solution obtained from a mixed
    integer program for different network topologies. We investigated the influence
    of different parameters like overall resource utilization or different latency
    weights.
author:
- first_name: Matthias
  full_name: Keller, Matthias
  last_name: Keller
- first_name: Stefan
  full_name: Pawlik, Stefan
  last_name: Pawlik
- first_name: Peter
  full_name: Pietrzyk, Peter
  last_name: Pietrzyk
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Keller M, Pawlik S, Pietrzyk P, Karl H. A Local Heuristic for Latency-Optimized
    Distributed Cloud Deployment. In: <i>Proceedings of the 6th International Conference
    on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing</i>.
    ; 2013:429-434. doi:<a href="https://doi.org/10.1109/UCC.2013.85">10.1109/UCC.2013.85</a>'
  apa: Keller, M., Pawlik, S., Pietrzyk, P., &#38; Karl, H. (2013). A Local Heuristic
    for Latency-Optimized Distributed Cloud Deployment. In <i>Proceedings of the 6th
    International Conference on Utility and Cloud Computing (UCC) workshop on Distributed
    cloud computing</i> (pp. 429–434). <a href="https://doi.org/10.1109/UCC.2013.85">https://doi.org/10.1109/UCC.2013.85</a>
  bibtex: '@inproceedings{Keller_Pawlik_Pietrzyk_Karl_2013, title={A Local Heuristic
    for Latency-Optimized Distributed Cloud Deployment}, DOI={<a href="https://doi.org/10.1109/UCC.2013.85">10.1109/UCC.2013.85</a>},
    booktitle={Proceedings of the 6th International Conference on Utility and Cloud
    Computing (UCC) workshop on Distributed cloud computing}, author={Keller, Matthias
    and Pawlik, Stefan and Pietrzyk, Peter and Karl, Holger}, year={2013}, pages={429–434}
    }'
  chicago: Keller, Matthias, Stefan Pawlik, Peter Pietrzyk, and Holger Karl. “A Local
    Heuristic for Latency-Optimized Distributed Cloud Deployment.” In <i>Proceedings
    of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop
    on Distributed Cloud Computing</i>, 429–34, 2013. <a href="https://doi.org/10.1109/UCC.2013.85">https://doi.org/10.1109/UCC.2013.85</a>.
  ieee: M. Keller, S. Pawlik, P. Pietrzyk, and H. Karl, “A Local Heuristic for Latency-Optimized
    Distributed Cloud Deployment,” in <i>Proceedings of the 6th International Conference
    on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing</i>,
    2013, pp. 429–434.
  mla: Keller, Matthias, et al. “A Local Heuristic for Latency-Optimized Distributed
    Cloud Deployment.” <i>Proceedings of the 6th International Conference on Utility
    and Cloud Computing (UCC) Workshop on Distributed Cloud Computing</i>, 2013, pp.
    429–34, doi:<a href="https://doi.org/10.1109/UCC.2013.85">10.1109/UCC.2013.85</a>.
  short: 'M. Keller, S. Pawlik, P. Pietrzyk, H. Karl, in: Proceedings of the 6th International
    Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud
    Computing, 2013, pp. 429–434.'
date_created: 2017-10-17T12:42:41Z
date_updated: 2022-01-06T07:02:11Z
ddc:
- '040'
department:
- _id: '75'
- _id: '63'
doi: 10.1109/UCC.2013.85
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:25:45Z
  date_updated: 2018-03-15T10:25:45Z
  file_id: '1279'
  file_name: 562-dcc13_paper.pdf
  file_size: 347873
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:25:45Z
has_accepted_license: '1'
language:
- iso: eng
page: 429-434
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 6th International Conference on Utility and Cloud
  Computing (UCC) workshop on Distributed cloud computing
status: public
title: A Local Heuristic for Latency-Optimized Distributed Cloud Deployment
type: conference
user_id: '477'
year: '2013'
...
---
_id: '563'
abstract:
- lang: eng
  text: Dominating set based virtual backbones are used for rou-ting in wireless ad-hoc
    networks. Such backbones receive and transmit messages from/to every node in the
    network. Existing distributed algorithms only consider undirected graphs, which
    model symmetric networks with uniform transmission ranges. We are particularly
    interested in the well-established disk graphs, which model asymmetric networks
    with non-uniform transmission ranges. The corresponding graph theoretic problem
    seeks a strongly connected dominating-absorbent set of minimum cardinality in
    a digraph. A subset of nodes in a digraph is a strongly connected dominating-absorbent
    set if the subgraph induced by these nodes is strongly connected and each node
    in the graph is either in the set or has both an in-neighbor and an out-neighbor
    in it. We introduce the first distributed algorithm for this problem in disk graphs.
    The algorithm gives an O(k^4) -approximation ratio and has a runtime bound of
    O(Diam) where Diam is the diameter of the graph and k denotes the transmission
    ratio r_{max}/r_{min} with r_{max} and r_{min} being the maximum and minimum transmission
    range, respectively. Moreover, we apply our algorithm on the subgraph of disk
    graphs consisting of only bidirectional edges. Our algorithm gives an O(ln k)
    -approximation and a runtime bound of O(k^8 log^∗ n) , which, for bounded k ,
    is an optimal approximation for the problem, following Lenzen and Wattenhofer’s
    Ω(log^∗ n) runtime lower bound for distributed constant approximation in disk
    graphs.
author:
- first_name: Christine
  full_name: Markarian, Christine
  id: '37612'
  last_name: Markarian
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Michael
  full_name: Schubert, Michael
  last_name: Schubert
citation:
  ama: 'Markarian C, Meyer auf der Heide F, Schubert M. A Distributed Approximation
    Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless
    Ad-Hoc Networks. In: <i>Proceedings of the 9th International Symposium on Algorithms
    and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
    (ALGOSENSORS)</i>. LNCS. ; 2013:217-227. doi:<a href="https://doi.org/10.1007/978-3-642-45346-5_16">10.1007/978-3-642-45346-5_16</a>'
  apa: Markarian, C., Meyer auf der Heide, F., &#38; Schubert, M. (2013). A Distributed
    Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric
    Wireless Ad-Hoc Networks. In <i>Proceedings of the 9th International Symposium
    on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed
    Robotics (ALGOSENSORS)</i> (pp. 217–227). <a href="https://doi.org/10.1007/978-3-642-45346-5_16">https://doi.org/10.1007/978-3-642-45346-5_16</a>
  bibtex: '@inproceedings{Markarian_Meyer auf der Heide_Schubert_2013, series={LNCS},
    title={A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent
    Sets in Asymmetric Wireless Ad-Hoc Networks}, DOI={<a href="https://doi.org/10.1007/978-3-642-45346-5_16">10.1007/978-3-642-45346-5_16</a>},
    booktitle={Proceedings of the 9th International Symposium on Algorithms and Experiments
    for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)},
    author={Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert,
    Michael}, year={2013}, pages={217–227}, collection={LNCS} }'
  chicago: Markarian, Christine, Friedhelm Meyer auf der Heide, and Michael Schubert.
    “A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent
    Sets in Asymmetric Wireless Ad-Hoc Networks.” In <i>Proceedings of the 9th International
    Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks
    and Distributed Robotics (ALGOSENSORS)</i>, 217–27. LNCS, 2013. <a href="https://doi.org/10.1007/978-3-642-45346-5_16">https://doi.org/10.1007/978-3-642-45346-5_16</a>.
  ieee: C. Markarian, F. Meyer auf der Heide, and M. Schubert, “A Distributed Approximation
    Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless
    Ad-Hoc Networks,” in <i>Proceedings of the 9th International Symposium on Algorithms
    and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
    (ALGOSENSORS)</i>, 2013, pp. 217–227.
  mla: Markarian, Christine, et al. “A Distributed Approximation Algorithm for Strongly
    Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks.” <i>Proceedings
    of the 9th International Symposium on Algorithms and Experiments for Sensor Systems,
    Wireless Networks and Distributed Robotics (ALGOSENSORS)</i>, 2013, pp. 217–27,
    doi:<a href="https://doi.org/10.1007/978-3-642-45346-5_16">10.1007/978-3-642-45346-5_16</a>.
  short: 'C. Markarian, F. Meyer auf der Heide, M. Schubert, in: Proceedings of the
    9th International Symposium on Algorithms and Experiments for Sensor Systems,
    Wireless Networks and Distributed Robotics (ALGOSENSORS), 2013, pp. 217–227.'
date_created: 2017-10-17T12:42:42Z
date_updated: 2022-01-06T07:02:13Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5_16
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:25:15Z
  date_updated: 2018-03-15T10:25:15Z
  file_id: '1278'
  file_name: 563-978-3-642-45346-5_16.pdf
  file_size: 348191
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:25:15Z
has_accepted_license: '1'
page: 217-227
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 9th International Symposium on Algorithms and Experiments
  for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)
series_title: LNCS
status: public
title: A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent
  Sets in Asymmetric Wireless Ad-Hoc Networks
type: conference
user_id: '477'
year: '2013'
...