---
_id: '526'
author:
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
citation:
ama: Mäcker A. Greedy Network Creation With Heavy And Light Edges. Universität
Paderborn; 2013.
apa: Mäcker, A. (2013). Greedy Network Creation With Heavy And Light Edges.
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. Greedy Network Creation With Heavy And Light Edges.
Universität Paderborn, 2013.
ieee: A. Mäcker, Greedy Network Creation With Heavy And Light Edges. Universität
Paderborn, 2013.
mla: Mäcker, Alexander. Greedy Network Creation With Heavy And Light Edges.
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:
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:715-718. doi:10.1145/2491411.2492405'
apa: Christin Platenius, M. (2013). Fuzzy Service Matching in On-The-Fly Computing.
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) (pp. 715–718). https://doi.org/10.1145/2491411.2492405
bibtex: '@inproceedings{Christin Platenius_2013, title={Fuzzy Service Matching in
On-The-Fly Computing}, DOI={10.1145/2491411.2492405},
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 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), 715–18, 2013. https://doi.org/10.1145/2491411.2492405.
ieee: M. Christin Platenius, “Fuzzy Service Matching in On-The-Fly Computing,” 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.
mla: Christin Platenius, Marie. “Fuzzy Service Matching in On-The-Fly Computing.”
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–18, doi:10.1145/2491411.2492405.
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: Proceedings of the 16th International ACM SigSoft Symposium
on Component-Based Software Engineering (CBSE). ; 2013:3-12. doi:10.1145/2465449.2465452'
apa: Heinzemann, C., & Becker, S. (2013). Executing Reconfigurations in Hierarchical
Component Architectures. In Proceedings of the 16th International ACM SigSoft
Symposium on Component-Based Software Engineering (CBSE) (pp. 3–12). https://doi.org/10.1145/2465449.2465452
bibtex: '@inproceedings{Heinzemann_Becker_2013, title={Executing Reconfigurations
in Hierarchical Component Architectures}, DOI={10.1145/2465449.2465452},
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 Proceedings of the 16th International
ACM SigSoft Symposium on Component-Based Software Engineering (CBSE), 3–12,
2013. https://doi.org/10.1145/2465449.2465452.
ieee: C. Heinzemann and S. Becker, “Executing Reconfigurations in Hierarchical Component
Architectures,” in Proceedings of the 16th International ACM SigSoft Symposium
on Component-Based Software Engineering (CBSE), 2013, pp. 3–12.
mla: Heinzemann, Christian, and Steffen Becker. “Executing Reconfigurations in Hierarchical
Component Architectures.” Proceedings of the 16th International ACM SigSoft
Symposium on Component-Based Software Engineering (CBSE), 2013, pp. 3–12,
doi:10.1145/2465449.2465452.
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. Entwurf Kooperativer Verhaltensweisen Heterogener Roboter. Universität
Paderborn; 2013.
apa: Buse, D. (2013). Entwurf kooperativer Verhaltensweisen heterogener Roboter.
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. Entwurf Kooperativer Verhaltensweisen Heterogener Roboter.
Universität Paderborn, 2013.
ieee: D. Buse, Entwurf kooperativer Verhaltensweisen heterogener Roboter.
Universität Paderborn, 2013.
mla: Buse, Dominik. Entwurf Kooperativer Verhaltensweisen Heterogener Roboter.
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. Entwurf eines datenschutzgerechten Reputationssystems. Universität
Paderborn; 2013.
apa: Lutters, S. (2013). Entwurf eines datenschutzgerechten Reputationssystems.
Universität Paderborn.
bibtex: '@book{Lutters_2013, title={Entwurf eines datenschutzgerechten Reputationssystems},
publisher={Universität Paderborn}, author={Lutters, Sascha}, year={2013} }'
chicago: Lutters, Sascha. Entwurf eines datenschutzgerechten Reputationssystems.
Universität Paderborn, 2013.
ieee: S. Lutters, Entwurf eines datenschutzgerechten Reputationssystems.
Universität Paderborn, 2013.
mla: Lutters, Sascha. Entwurf eines datenschutzgerechten Reputationssystems.
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. Entwicklung und Analyse einer verteilten Speicherverwaltung
für dynamische heterogene Speichersysteme. Universität Paderborn; 2013.
apa: Hilleckes, H. (2013). Entwicklung und Analyse einer verteilten Speicherverwaltung
für dynamische heterogene Speichersysteme. 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. Entwicklung und Analyse einer verteilten Speicherverwaltung
für dynamische heterogene Speichersysteme. Universität Paderborn, 2013.
ieee: H. Hilleckes, Entwicklung und Analyse einer verteilten Speicherverwaltung
für dynamische heterogene Speichersysteme. Universität Paderborn, 2013.
mla: Hilleckes, Hendrik. Entwicklung und Analyse einer verteilten Speicherverwaltung
für dynamische heterogene Speichersysteme. 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. Entwicklung eines Hybriden Planers zur verhaltensorientierten
Selbstoptimierung. Universität Paderborn; 2013.
apa: Borkowski, R. (2013). Entwicklung eines Hybriden Planers zur verhaltensorientierten
Selbstoptimierung. 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. Entwicklung eines Hybriden Planers zur verhaltensorientierten
Selbstoptimierung. Universität Paderborn, 2013.
ieee: R. Borkowski, Entwicklung eines Hybriden Planers zur verhaltensorientierten
Selbstoptimierung. Universität Paderborn, 2013.
mla: Borkowski, Richard. Entwicklung eines Hybriden Planers zur verhaltensorientierten
Selbstoptimierung. 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. Emulating Wavelength Division Multiplexing Using Openflow.
Universität Paderborn; 2013.
apa: Satya, S. (2013). Emulating Wavelength Division Multiplexing using Openflow.
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. Emulating Wavelength Division Multiplexing Using Openflow.
Universität Paderborn, 2013.
ieee: S. Satya, Emulating Wavelength Division Multiplexing using Openflow.
Universität Paderborn, 2013.
mla: Satya, Suhas. Emulating Wavelength Division Multiplexing Using Openflow.
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. Effizienzsteigerung durch gewichtete Produktbewertungen.
Universität Paderborn; 2013.
apa: Reineke, M. (2013). Effizienzsteigerung durch gewichtete Produktbewertungen.
Universität Paderborn.
bibtex: '@book{Reineke_2013, title={Effizienzsteigerung durch gewichtete Produktbewertungen},
publisher={Universität Paderborn}, author={Reineke, Max}, year={2013} }'
chicago: Reineke, Max. Effizienzsteigerung durch gewichtete Produktbewertungen.
Universität Paderborn, 2013.
ieee: M. Reineke, Effizienzsteigerung durch gewichtete Produktbewertungen.
Universität Paderborn, 2013.
mla: Reineke, Max. Effizienzsteigerung durch gewichtete Produktbewertungen.
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. Dynamic One-to-One Matching: Theory and a Job Market Application.
Universität Paderborn; 2013.'
apa: 'Stroh-Maraun, N. (2013). Dynamic One-to-One Matching: Theory and a Job
Market Application. 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. Dynamic One-to-One Matching: Theory and a Job
Market Application. Universität Paderborn, 2013.'
ieee: 'N. Stroh-Maraun, Dynamic One-to-One Matching: Theory and a Job Market
Application. Universität Paderborn, 2013.'
mla: 'Stroh-Maraun, Nadja. Dynamic One-to-One Matching: Theory and a Job Market
Application. 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. Dispersion of Multi-Robot Teams. Universität Paderborn;
2013.
apa: Heindorf, S. (2013). Dispersion of Multi-Robot Teams. 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. Dispersion of Multi-Robot Teams. Universität Paderborn,
2013.
ieee: S. Heindorf, Dispersion of Multi-Robot Teams. Universität Paderborn,
2013.
mla: Heindorf, Stefan. Dispersion of Multi-Robot Teams. 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., & 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. Direct Chosen-Ciphertext Secure Attribute-Based
Key Encapsulations without Random Oracles. 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. Der Einfluss adaptierter Erwartungen in dynamischen Cournot
Oligopolen. Universität Paderborn; 2013.
apa: Kornhoff, T. (2013). Der Einfluss adaptierter Erwartungen in dynamischen
Cournot Oligopolen. 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. Der Einfluss adaptierter Erwartungen in dynamischen
Cournot Oligopolen. Universität Paderborn, 2013.
ieee: T. Kornhoff, Der Einfluss adaptierter Erwartungen in dynamischen Cournot
Oligopolen. Universität Paderborn, 2013.
mla: Kornhoff, Tobias. Der Einfluss adaptierter Erwartungen in dynamischen Cournot
Oligopolen. 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'
...
---
_id: '541'
abstract:
- lang: eng
text: Existing solutions for gossip-based aggregation in peer-to-peer networks use
epochs to calculate a global estimation from an initial static set of local values.
Once the estimation converges system-wide, a new epoch is started with fresh initial
values. Long epochs result in precise estimations based on old measurements and
short epochs result in imprecise aggregated estimations. In contrast to this approach,
we present in this paper a continuous, epoch-less approach which considers fresh
local values in every round of the gossip-based aggregation. By using an approach
for dynamic information aging, inaccurate values and values from left peers fade
from the aggregation memory. Evaluation shows that the presented approach for
continuous information aggregation in peer-to-peer systems monitors the system
performance precisely, adapts to changes and is lightweight to operate.
author:
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
- first_name: Vitaly
full_name: Rapp, Vitaly
last_name: Rapp
citation:
ama: 'Graffi K, Rapp V. Continuous Gossip-based Aggregation through Dynamic Information
Aging. In: Proceedings of the International Conference on Computer Communications
and Networks (ICCCN’13). ; 2013:1-7. doi:10.1109/ICCCN.2013.6614118'
apa: Graffi, K., & Rapp, V. (2013). Continuous Gossip-based Aggregation through
Dynamic Information Aging. In Proceedings of the International Conference on
Computer Communications and Networks (ICCCN’13) (pp. 1–7). https://doi.org/10.1109/ICCCN.2013.6614118
bibtex: '@inproceedings{Graffi_Rapp_2013, title={Continuous Gossip-based Aggregation
through Dynamic Information Aging}, DOI={10.1109/ICCCN.2013.6614118},
booktitle={Proceedings of the International Conference on Computer Communications
and Networks (ICCCN’13)}, author={Graffi, Kalman and Rapp, Vitaly}, year={2013},
pages={1–7} }'
chicago: Graffi, Kalman, and Vitaly Rapp. “Continuous Gossip-Based Aggregation through
Dynamic Information Aging.” In Proceedings of the International Conference
on Computer Communications and Networks (ICCCN’13), 1–7, 2013. https://doi.org/10.1109/ICCCN.2013.6614118.
ieee: K. Graffi and V. Rapp, “Continuous Gossip-based Aggregation through Dynamic
Information Aging,” in Proceedings of the International Conference on Computer
Communications and Networks (ICCCN’13), 2013, pp. 1–7.
mla: Graffi, Kalman, and Vitaly Rapp. “Continuous Gossip-Based Aggregation through
Dynamic Information Aging.” Proceedings of the International Conference on
Computer Communications and Networks (ICCCN’13), 2013, pp. 1–7, doi:10.1109/ICCCN.2013.6614118.
short: 'K. Graffi, V. Rapp, in: Proceedings of the International Conference on Computer
Communications and Networks (ICCCN’13), 2013, pp. 1–7.'
date_created: 2017-10-17T12:42:37Z
date_updated: 2022-01-06T07:01:52Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/ICCCN.2013.6614118
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:33:20Z
date_updated: 2018-03-15T10:33:20Z
file_id: '1290'
file_name: 541-Continuous.Gossip.based.Aggregation.Through.Dynamic.Information.Aging.pdf
file_size: 272960
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:33:20Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-7
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 Computer Communications
and Networks (ICCCN'13)
status: public
title: Continuous Gossip-based Aggregation through Dynamic Information Aging
type: conference
user_id: '477'
year: '2013'
...
---
_id: '542'
abstract:
- lang: eng
text: 'We consider the problem of managing a dynamic heterogeneous storagesystem
in a distributed way so that the amount of data assigned to a hostin that system
is related to its capacity. Two central problems have to be solvedfor this: (1)
organizing the hosts in an overlay network with low degree and diameterso that
one can efficiently check the correct distribution of the data androute between
any two hosts, and (2) distributing the data among the hosts so thatthe distribution
respects the capacities of the hosts and can easily be adapted asthe set of hosts
or their capacities change. We present distributed protocols forthese problems
that are self-stabilizing and that do not need any global knowledgeabout the system
such as the number of nodes or the overall capacity of thesystem. Prior to this
work no solution was known satisfying these properties.'
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. CONE-DHT: A distributed self-stabilizing
algorithm for a heterogeneous storage system. In: Proceedings of the 27th International
Symposium on Distributed Computing (DISC). LNCS. ; 2013:537-549. doi:10.1007/978-3-642-41527-2_37'
apa: 'Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2013). CONE-DHT:
A distributed self-stabilizing algorithm for a heterogeneous storage system. In
Proceedings of the 27th International Symposium on Distributed Computing (DISC)
(pp. 537–549). https://doi.org/10.1007/978-3-642-41527-2_37'
bibtex: '@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2013, series={LNCS},
title={CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous
storage system}, DOI={10.1007/978-3-642-41527-2_37},
booktitle={Proceedings of the 27th International Symposium on Distributed Computing
(DISC)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler,
Christian}, year={2013}, pages={537–549}, collection={LNCS} }'
chicago: 'Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
“CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage
System.” In Proceedings of the 27th International Symposium on Distributed
Computing (DISC), 537–49. LNCS, 2013. https://doi.org/10.1007/978-3-642-41527-2_37.'
ieee: 'S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “CONE-DHT: A distributed
self-stabilizing algorithm for a heterogeneous storage system,” in Proceedings
of the 27th International Symposium on Distributed Computing (DISC), 2013,
pp. 537–549.'
mla: 'Kniesburges, Sebastian, et al. “CONE-DHT: A Distributed Self-Stabilizing Algorithm
for a Heterogeneous Storage System.” Proceedings of the 27th International
Symposium on Distributed Computing (DISC), 2013, pp. 537–49, doi:10.1007/978-3-642-41527-2_37.'
short: 'S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 27th
International Symposium on Distributed Computing (DISC), 2013, pp. 537–549.'
date_created: 2017-10-17T12:42:38Z
date_updated: 2022-01-06T07:01:53Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-41527-2_37
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:32:48Z
date_updated: 2018-03-15T10:32:48Z
file_id: '1289'
file_name: 542-CONE-DHT_A_distributed_self-stabilizing_algorithm_for_a_heterogeneous_storage_system.pdf
file_size: 262302
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:32:48Z
has_accepted_license: '1'
page: 537-549
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 27th International Symposium on Distributed Computing
(DISC)
series_title: LNCS
status: public
title: 'CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage
system'
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '543'
author:
- first_name: Kavitha
full_name: Jagannath, Kavitha
last_name: Jagannath
citation:
ama: Jagannath K. Comparison of Various Contract-Based Approaches for Specifying
Behavior of On-The-Fly Computing Services. Universität Paderborn; 2013.
apa: Jagannath, K. (2013). Comparison of Various Contract-Based Approaches for
Specifying Behavior of On-The-Fly Computing Services. Universität Paderborn.
bibtex: '@book{Jagannath_2013, title={Comparison of Various Contract-Based Approaches
for Specifying Behavior of On-The-Fly Computing Services}, publisher={Universität
Paderborn}, author={Jagannath, Kavitha}, year={2013} }'
chicago: Jagannath, Kavitha. Comparison of Various Contract-Based Approaches
for Specifying Behavior of On-The-Fly Computing Services. Universität Paderborn,
2013.
ieee: K. Jagannath, Comparison of Various Contract-Based Approaches for Specifying
Behavior of On-The-Fly Computing Services. Universität Paderborn, 2013.
mla: Jagannath, Kavitha. Comparison of Various Contract-Based Approaches for
Specifying Behavior of On-The-Fly Computing Services. Universität Paderborn,
2013.
short: K. Jagannath, Comparison of Various Contract-Based Approaches for Specifying
Behavior of On-The-Fly Computing Services, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:38Z
date_updated: 2022-01-06T07:01:53Z
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Comparison of Various Contract-Based Approaches for Specifying Behavior of
On-The-Fly Computing Services
type: mastersthesis
user_id: '15504'
year: '2013'
...
---
_id: '544'
abstract:
- lang: eng
text: Comparative evaluations of peer-to-peer protocols through simulations are
a viable approach to judge the performance and costs of the individual protocols
in large-scale networks. In order to support this work, we enhanced the peer-to-peer
systems simulator PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive
automated measurements and gnuplot generators as well as a coordination control
to evaluate a set of experiment setups in parallel. Thus, by configuring all experiments
and protocols only once and starting the simulator, all desired measurements are
performed, analyzed, evaluated and combined, resulting in a holistic environment
for the comparative evaluation of peer-to-peer systems.
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Feldotto M, Graffi K. Comparative Evaluation of Peer-to-Peer Systems Using
PeerfactSim.KOM. In: Proceedings of the International Conference on High Performance
Computing and Simulation (HPCS’13). ; 2013:99-106. doi:10.1109/HPCSim.2013.6641399'
apa: Feldotto, M., & Graffi, K. (2013). Comparative Evaluation of Peer-to-Peer
Systems Using PeerfactSim.KOM. In Proceedings of the International Conference
on High Performance Computing and Simulation (HPCS’13) (pp. 99–106). https://doi.org/10.1109/HPCSim.2013.6641399
bibtex: '@inproceedings{Feldotto_Graffi_2013, title={Comparative Evaluation of Peer-to-Peer
Systems Using PeerfactSim.KOM}, DOI={10.1109/HPCSim.2013.6641399},
booktitle={Proceedings of the International Conference on High Performance Computing
and Simulation (HPCS’13)}, author={Feldotto, Matthias and Graffi, Kalman}, year={2013},
pages={99–106} }'
chicago: Feldotto, Matthias, and Kalman Graffi. “Comparative Evaluation of Peer-to-Peer
Systems Using PeerfactSim.KOM.” In Proceedings of the International Conference
on High Performance Computing and Simulation (HPCS’13), 99–106, 2013. https://doi.org/10.1109/HPCSim.2013.6641399.
ieee: M. Feldotto and K. Graffi, “Comparative Evaluation of Peer-to-Peer Systems
Using PeerfactSim.KOM,” in Proceedings of the International Conference on High
Performance Computing and Simulation (HPCS’13), 2013, pp. 99–106.
mla: Feldotto, Matthias, and Kalman Graffi. “Comparative Evaluation of Peer-to-Peer
Systems Using PeerfactSim.KOM.” Proceedings of the International Conference
on High Performance Computing and Simulation (HPCS’13), 2013, pp. 99–106,
doi:10.1109/HPCSim.2013.6641399.
short: 'M. Feldotto, K. Graffi, in: Proceedings of the International Conference
on High Performance Computing and Simulation (HPCS’13), 2013, pp. 99–106.'
date_created: 2017-10-17T12:42:38Z
date_updated: 2022-01-06T07:01:53Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/HPCSim.2013.6641399
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:32:17Z
date_updated: 2018-03-15T10:32:17Z
file_id: '1288'
file_name: 544-FeldGraffi13.pdf
file_size: 899441
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:32:17Z
has_accepted_license: '1'
language:
- iso: eng
page: 99-106
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 High Performance Computing
and Simulation (HPCS'13)
status: public
title: Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM
type: conference
user_id: '14052'
year: '2013'
...
---
_id: '545'
author:
- first_name: Fritz
full_name: Blumentritt, Fritz
last_name: Blumentritt
citation:
ama: Blumentritt F. Cliquenbildung in verteilten Systemen. Universität Paderborn;
2013.
apa: Blumentritt, F. (2013). Cliquenbildung in verteilten Systemen. Universität
Paderborn.
bibtex: '@book{Blumentritt_2013, title={Cliquenbildung in verteilten Systemen},
publisher={Universität Paderborn}, author={Blumentritt, Fritz}, year={2013} }'
chicago: Blumentritt, Fritz. Cliquenbildung in verteilten Systemen. Universität
Paderborn, 2013.
ieee: F. Blumentritt, Cliquenbildung in verteilten Systemen. Universität
Paderborn, 2013.
mla: Blumentritt, Fritz. Cliquenbildung in verteilten Systemen. Universität
Paderborn, 2013.
short: F. Blumentritt, Cliquenbildung in verteilten Systemen, Universität Paderborn,
2013.
date_created: 2017-10-17T12:42:38Z
date_updated: 2022-01-06T07:01:54Z
language:
- iso: ger
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: Cliquenbildung in verteilten Systemen
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '546'
abstract:
- lang: eng
text: Self-stabilization is the property of a system to transfer itself regardless
of the initial state into a legitimate state. Chord as a simple, decentralized
and scalable distributed hash table is an ideal showcase to introduce self-stabilization
for p2p overlays. In this paper, we present Re-Chord, a self-stabilizing version
of Chord. We show, that the stabilization process is functional, but prone to
strong churn. For that, we present Ca-Re-Chord, a churn resistant version of Re-Chord,
that allows the creation of a useful DHT in any kind of graph regardless of the
initial state. Simulation results attest the churn resistance and good performance
of Ca-Re-Chord.
author:
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- first_name: Mohammad
full_name: Divband, Mohammad
last_name: Divband
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
citation:
ama: 'Graffi K, Benter M, Divband M, Kniesburges S, Koutsopoulos A. Ca-Re-Chord:
A Churn Resistant Self-stabilizing Chord Overlay Network. In: Proceedings of
the Conference on Networked Systems (NetSys). ; 2013:27-34. doi:10.1109/NetSys.2013.11'
apa: 'Graffi, K., Benter, M., Divband, M., Kniesburges, S., & Koutsopoulos,
A. (2013). Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network.
In Proceedings of the Conference on Networked Systems (NetSys) (pp. 27–34).
https://doi.org/10.1109/NetSys.2013.11'
bibtex: '@inproceedings{Graffi_Benter_Divband_Kniesburges_Koutsopoulos_2013, title={Ca-Re-Chord:
A Churn Resistant Self-stabilizing Chord Overlay Network}, DOI={10.1109/NetSys.2013.11},
booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Graffi,
Kalman and Benter, Markus and Divband, Mohammad and Kniesburges, Sebastian and
Koutsopoulos, Andreas}, year={2013}, pages={27–34} }'
chicago: 'Graffi, Kalman, Markus Benter, Mohammad Divband, Sebastian Kniesburges,
and Andreas Koutsopoulos. “Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord
Overlay Network.” In Proceedings of the Conference on Networked Systems (NetSys),
27–34, 2013. https://doi.org/10.1109/NetSys.2013.11.'
ieee: 'K. Graffi, M. Benter, M. Divband, S. Kniesburges, and A. Koutsopoulos, “Ca-Re-Chord:
A Churn Resistant Self-stabilizing Chord Overlay Network,” in Proceedings of
the Conference on Networked Systems (NetSys), 2013, pp. 27–34.'
mla: 'Graffi, Kalman, et al. “Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord
Overlay Network.” Proceedings of the Conference on Networked Systems (NetSys),
2013, pp. 27–34, doi:10.1109/NetSys.2013.11.'
short: 'K. Graffi, M. Benter, M. Divband, S. Kniesburges, A. Koutsopoulos, in: Proceedings
of the Conference on Networked Systems (NetSys), 2013, pp. 27–34.'
date_created: 2017-10-17T12:42:38Z
date_updated: 2022-01-06T07:01:55Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/NetSys.2013.11
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:30:42Z
date_updated: 2018-03-15T10:30:42Z
file_id: '1286'
file_name: 546-Kalman.Graffi_CaReChord.A.Churn.Resistant.Selfstabilizing.Chord.Overlay.Network_02.pdf
file_size: 244841
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:30:42Z
has_accepted_license: '1'
page: 27-34
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the Conference on Networked Systems (NetSys)
status: public
title: 'Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network'
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '5464'
author:
- first_name: M
full_name: Baum, M
last_name: Baum
- first_name: C
full_name: Schwens, C
last_name: Schwens
- first_name: Rüdiger
full_name: Kabst, Rüdiger
id: '42362'
last_name: Kabst
citation:
ama: 'Baum M, Schwens C, Kabst R. International as Opposed to Domestic New Venturing:
The Moderating Role of Perceived Barriers to Internationalization. International
Small Business Journal (ISBJ). 2013;31(5):534-560.'
apa: 'Baum, M., Schwens, C., & Kabst, R. (2013). International as Opposed to
Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization.
International Small Business Journal (ISBJ)., 31(5), 534–560.'
bibtex: '@article{Baum_Schwens_Kabst_2013, title={International as Opposed to Domestic
New Venturing: The Moderating Role of Perceived Barriers to Internationalization.},
volume={31}, number={5}, journal={International Small Business Journal (ISBJ).},
author={Baum, M and Schwens, C and Kabst, Rüdiger}, year={2013}, pages={534–560}
}'
chicago: 'Baum, M, C Schwens, and Rüdiger Kabst. “International as Opposed to Domestic
New Venturing: The Moderating Role of Perceived Barriers to Internationalization.”
International Small Business Journal (ISBJ). 31, no. 5 (2013): 534–60.'
ieee: 'M. Baum, C. Schwens, and R. Kabst, “International as Opposed to Domestic
New Venturing: The Moderating Role of Perceived Barriers to Internationalization.,”
International Small Business Journal (ISBJ)., vol. 31, no. 5, pp. 534–560,
2013.'
mla: 'Baum, M., et al. “International as Opposed to Domestic New Venturing: The
Moderating Role of Perceived Barriers to Internationalization.” International
Small Business Journal (ISBJ)., vol. 31, no. 5, 2013, pp. 534–60.'
short: M. Baum, C. Schwens, R. Kabst, International Small Business Journal (ISBJ).
31 (2013) 534–560.
date_created: 2018-11-08T14:22:26Z
date_updated: 2022-01-06T07:01:55Z
department:
- _id: '274'
intvolume: ' 31'
issue: '5'
language:
- iso: eng
page: 534-560
publication: International Small Business Journal (ISBJ).
status: public
title: 'International as Opposed to Domestic New Venturing: The Moderating Role of
Perceived Barriers to Internationalization.'
type: journal_article
user_id: '46632'
volume: 31
year: '2013'
...
---
_id: '5465'
author:
- first_name: M
full_name: Baum, M
last_name: Baum
- first_name: Rüdiger
full_name: Kabst, Rüdiger
id: '42362'
last_name: Kabst
citation:
ama: 'Baum M, Kabst R. Conjoint implications on job preferences: The moderating
role of involvement. International Journal of Human Resource Management (IJHRM).
2013;24(7):1393-1417.'
apa: 'Baum, M., & Kabst, R. (2013). Conjoint implications on job preferences:
The moderating role of involvement. International Journal of Human Resource
Management (IJHRM)., 24(7), 1393–1417.'
bibtex: '@article{Baum_Kabst_2013, title={Conjoint implications on job preferences:
The moderating role of involvement.}, volume={24}, number={7}, journal={International
Journal of Human Resource Management (IJHRM).}, author={Baum, M and Kabst, Rüdiger},
year={2013}, pages={1393–1417} }'
chicago: 'Baum, M, and Rüdiger Kabst. “Conjoint Implications on Job Preferences:
The Moderating Role of Involvement.” International Journal of Human Resource
Management (IJHRM). 24, no. 7 (2013): 1393–1417.'
ieee: 'M. Baum and R. Kabst, “Conjoint implications on job preferences: The moderating
role of involvement.,” International Journal of Human Resource Management (IJHRM).,
vol. 24, no. 7, pp. 1393–1417, 2013.'
mla: 'Baum, M., and Rüdiger Kabst. “Conjoint Implications on Job Preferences: The
Moderating Role of Involvement.” International Journal of Human Resource Management
(IJHRM)., vol. 24, no. 7, 2013, pp. 1393–417.'
short: M. Baum, R. Kabst, International Journal of Human Resource Management (IJHRM).
24 (2013) 1393–1417.
date_created: 2018-11-08T14:28:07Z
date_updated: 2022-01-06T07:01:55Z
department:
- _id: '274'
intvolume: ' 24'
issue: '7'
language:
- iso: eng
page: 1393-1417
publication: International Journal of Human Resource Management (IJHRM).
status: public
title: 'Conjoint implications on job preferences: The moderating role of involvement.'
type: journal_article
user_id: '46632'
volume: 24
year: '2013'
...
---
_id: '547'
abstract:
- lang: eng
text: 'In recent years, the role of process models in the development of enterprise
software systems has increased continuously. Today, process models are used at
different levels in the development process. For instance, in Service-Oriented
Architectures (SOA), high-level business process models become input for the development
of IT systems, and in running IT systems executable process models describe choreographies
of Web Services. A key driver behind this development is the necessity for a closer
alignment of business and IT requirements, to reduce the reaction times in software
development to frequent changes in competitive markets.Typically in these scenarios,
process models are developed, maintained, and transformed in a team environment
by several stakeholders that are often from different business units, resulting
in different versions. To obtain integrated process models comprising the changes
applied to different versions, the versions need to be consolidated by means of
model change management. Change management for process models can be compared
to widely used concurrent versioning systems (CVS) and consists of the following
major activities: matching of process models, detection of differences, computation
of dependencies and conflicts between differences, and merging of process models.Although
in general model-driven development (MDD) is accepted as a well-established development
approach, there are still some shortcomings that let developers decide against
MDD and for more traditional development paradigms. These shortcomings comprise
a lack of fully integrated and fully featured development environments for MDD,
such as a comprehensive support for model change management.In this thesis, we
present a framework for process model change management. The framework is based
on an intermediate representation for process models that serves as an abstraction
of specific process modeling languages and focuses on common syntactic and semantic
core concepts for the modeling of workflow in process models. Based on the intermediate
representation, we match process models in versioning scenarios and compute differences
between process models generically. Further, we consider the analysis of dependencies
between differences and show how conflicts between differences can be computed
by taking into account the semantics of the modeling language.As proof-of concept,
we have implemented major parts of this framework in terms of a prototype. The
detection of differences and dependencies contributed also to the Compare & Merge
framework for the IBM WebSphere Business Modeler V 7.0 [1] (WBM), which was released
as a product in fall 2009.'
author:
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
citation:
ama: Gerth C. Business Process Models - Change Management. Universität Paderborn;
2013. doi:10.1007/978-3-642-38604-6
apa: Gerth, C. (2013). Business Process Models - Change Management. Universität
Paderborn. https://doi.org/10.1007/978-3-642-38604-6
bibtex: '@book{Gerth_2013, title={Business Process Models - Change Management},
DOI={10.1007/978-3-642-38604-6},
publisher={Universität Paderborn}, author={Gerth, Christian}, year={2013} }'
chicago: Gerth, Christian. Business Process Models - Change Management. Universität
Paderborn, 2013. https://doi.org/10.1007/978-3-642-38604-6.
ieee: C. Gerth, Business Process Models - Change Management. Universität
Paderborn, 2013.
mla: Gerth, Christian. Business Process Models - Change Management. Universität
Paderborn, 2013, doi:10.1007/978-3-642-38604-6.
short: C. Gerth, Business Process Models - Change Management, Universität Paderborn,
2013.
date_created: 2017-10-17T12:42:39Z
date_updated: 2022-01-06T07:01:55Z
department:
- _id: '66'
doi: 10.1007/978-3-642-38604-6
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
title: Business Process Models - Change Management
type: dissertation
user_id: '477'
year: '2013'
...
---
_id: '5478'
author:
- first_name: M
full_name: Baum, M
last_name: Baum
- first_name: Rüdiger
full_name: Kabst, Rüdiger
id: '42362'
last_name: Kabst
citation:
ama: Baum M, Kabst R. How to attract applicants in the atlantic versus the asia-pacific
region? A cross-national analysis on China, India, Germany, and Hungary. Journal
of World Business (JWB). 2013;48(2):175-185.
apa: Baum, M., & Kabst, R. (2013). How to attract applicants in the atlantic
versus the asia-pacific region? A cross-national analysis on China, India, Germany,
and Hungary. Journal of World Business (JWB)., 48(2), 175–185.
bibtex: '@article{Baum_Kabst_2013, title={How to attract applicants in the atlantic
versus the asia-pacific region? A cross-national analysis on China, India, Germany,
and Hungary.}, volume={48}, number={2}, journal={Journal of World Business (JWB).},
author={Baum, M and Kabst, Rüdiger}, year={2013}, pages={175–185} }'
chicago: 'Baum, M, and Rüdiger Kabst. “How to Attract Applicants in the Atlantic
versus the Asia-Pacific Region? A Cross-National Analysis on China, India, Germany,
and Hungary.” Journal of World Business (JWB). 48, no. 2 (2013): 175–85.'
ieee: M. Baum and R. Kabst, “How to attract applicants in the atlantic versus the
asia-pacific region? A cross-national analysis on China, India, Germany, and Hungary.,”
Journal of World Business (JWB)., vol. 48, no. 2, pp. 175–185, 2013.
mla: Baum, M., and Rüdiger Kabst. “How to Attract Applicants in the Atlantic versus
the Asia-Pacific Region? A Cross-National Analysis on China, India, Germany, and
Hungary.” Journal of World Business (JWB)., vol. 48, no. 2, 2013, pp. 175–85.
short: M. Baum, R. Kabst, Journal of World Business (JWB). 48 (2013) 175–185.
date_created: 2018-11-12T10:14:53Z
date_updated: 2022-01-06T07:01:55Z
department:
- _id: '274'
intvolume: ' 48'
issue: '2'
language:
- iso: eng
page: 175-185
publication: Journal of World Business (JWB).
status: public
title: How to attract applicants in the atlantic versus the asia-pacific region? A
cross-national analysis on China, India, Germany, and Hungary.
type: journal_article
user_id: '46632'
volume: 48
year: '2013'
...
---
_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: Proceedings of the International Conference
on Peer-to-Peer Computing (P2P’13). ; 2013:1-5. doi:10.1109/P2P.2013.6688720'
apa: 'Graffi, K., & Klerx, T. (2013). Bootstrapping Skynet: Calibration and
Autonomic Self-Control of Structured Peer-to-Peer Networks. In Proceedings
of the International Conference on Peer-to-Peer Computing (P2P’13) (pp. 1–5).
https://doi.org/10.1109/P2P.2013.6688720'
bibtex: '@inproceedings{Graffi_Klerx_2013, title={Bootstrapping Skynet: Calibration
and Autonomic Self-Control of Structured Peer-to-Peer Networks}, DOI={10.1109/P2P.2013.6688720},
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 Proceedings
of the International Conference on Peer-to-Peer Computing (P2P’13), 1–5, 2013.
https://doi.org/10.1109/P2P.2013.6688720.'
ieee: 'K. Graffi and T. Klerx, “Bootstrapping Skynet: Calibration and Autonomic
Self-Control of Structured Peer-to-Peer Networks,” in Proceedings of the International
Conference on Peer-to-Peer Computing (P2P’13), 2013, pp. 1–5.'
mla: 'Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and Autonomic
Self-Control of Structured Peer-to-Peer Networks.” Proceedings of the International
Conference on Peer-to-Peer Computing (P2P’13), 2013, pp. 1–5, doi:10.1109/P2P.2013.6688720.'
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. International Journal
of Gender and Entrepreneurship (IJGE). 2013;5(2):130-156.'
apa: 'Haus, I., Steinmetz, H., Isidor, R., & Kabst, R. (2013). Gender Effects
on Entrepreneurial Intention: A Meta-Analytical Structural Equation Model. International
Journal of Gender and Entrepreneurship (IJGE), 5(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.” International
Journal of Gender and Entrepreneurship (IJGE) 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.,” International Journal
of Gender and Entrepreneurship (IJGE), vol. 5, no. 2, pp. 130–156, 2013.'
mla: 'Haus, I., et al. “Gender Effects on Entrepreneurial Intention: A Meta-Analytical
Structural Equation Model.” International Journal of Gender and Entrepreneurship
(IJGE), 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? European Journal of Research Methods for the
Behavioral and Social Sciences. 2013;9(1):1-12.'
apa: 'Steinmetz, H. (2013). Analyzing observed composite differences across groups:
Is partial measurement invariance enough? European Journal of Research Methods
for the Behavioral and Social Sciences., 9(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?” European Journal of Research Methods
for the Behavioral and Social Sciences. 9, no. 1 (2013): 1–12.'
ieee: 'H. Steinmetz, “Analyzing observed composite differences across groups: Is
partial measurement invariance enough?,” European Journal of Research Methods
for the Behavioral and Social Sciences., vol. 9, no. 1, pp. 1–12, 2013.'
mla: 'Steinmetz, Holger. “Analyzing Observed Composite Differences across Groups:
Is Partial Measurement Invariance Enough?” European Journal of Research Methods
for the Behavioral and Social Sciences., 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. Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte
Datenflussrechner. Universität Paderborn; 2013.
apa: Bick, C. (2013). Beschleunigung von Tiefenberechung aus Stereobildern durch
FPGA-basierte Datenflussrechner. 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. Beschleunigung von Tiefenberechung aus Stereobildern
durch FPGA-basierte Datenflussrechner. Universität Paderborn, 2013.
ieee: C. Bick, Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte
Datenflussrechner. Universität Paderborn, 2013.
mla: Bick, Christian. Beschleunigung von Tiefenberechung aus Stereobildern durch
FPGA-basierte Datenflussrechner. 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. Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen
in Multiprozessor-Umgebungen. Universität Paderborn; 2013.
apa: Meschede, J. (2013). Bandbreiten-beschränktes Scheduling mit skalierbaren
Jobanforderungen in Multiprozessor-Umgebungen. 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. Bandbreiten-beschränktes Scheduling mit skalierbaren
Jobanforderungen in Multiprozessor-Umgebungen. Universität Paderborn, 2013.
ieee: J. Meschede, Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen
in Multiprozessor-Umgebungen. Universität Paderborn, 2013.
mla: Meschede, Julian. Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen
in Multiprozessor-Umgebungen. 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: Proceedings of the 11th International Conference on Service Oriented
Computing (ICSOC’13). LNCS. ; 2013:524--532. doi:10.1007/978-3-642-45005-1_42'
apa: Huma, Z., Gerth, C., Engels, G., & Juwig, O. (2013). Automated Service
Composition for On-the-Fly SOAs. In Proceedings of the 11th International Conference
on Service Oriented Computing (ICSOC’13) (pp. 524--532). https://doi.org/10.1007/978-3-642-45005-1_42
bibtex: '@inproceedings{Huma_Gerth_Engels_Juwig_2013, series={LNCS}, title={Automated
Service Composition for On-the-Fly SOAs}, DOI={10.1007/978-3-642-45005-1_42},
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 Proceedings of the 11th International
Conference on Service Oriented Computing (ICSOC’13), 524--532. LNCS, 2013.
https://doi.org/10.1007/978-3-642-45005-1_42.
ieee: Z. Huma, C. Gerth, G. Engels, and O. Juwig, “Automated Service Composition
for On-the-Fly SOAs,” in Proceedings of the 11th International Conference on
Service Oriented Computing (ICSOC’13), 2013, pp. 524--532.
mla: Huma, Zille, et al. “Automated Service Composition for On-the-Fly SOAs.” Proceedings
of the 11th International Conference on Service Oriented Computing (ICSOC’13),
2013, pp. 524--532, doi:10.1007/978-3-642-45005-1_42.
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. Auktionen im Beschaffungsmanagement - Eine spieltheoretische
Analyse. Universität Paderborn; 2013.
apa: Meckenstock, K. (2013). Auktionen im Beschaffungsmanagement - Eine spieltheoretische
Analyse. 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. Auktionen im Beschaffungsmanagement - Eine spieltheoretische
Analyse. Universität Paderborn, 2013.
ieee: K. Meckenstock, Auktionen im Beschaffungsmanagement - Eine spieltheoretische
Analyse. Universität Paderborn, 2013.
mla: Meckenstock, Kevin. Auktionen im Beschaffungsmanagement - Eine spieltheoretische
Analyse. 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. Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische
Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn; 2013.
apa: Kohn, K. (2013). Attributbasierte Verschlüsselung mittels Gittermethoden
- Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. 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. Attributbasierte Verschlüsselung mittels Gittermethoden
- Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität
Paderborn, 2013.
ieee: K. Kohn, Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische
Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn, 2013.
mla: Kohn, Kathlén. Attributbasierte Verschlüsselung mittels Gittermethoden -
Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. 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. Economics Letters. 2013;(2):224-227. doi:10.1016/j.econlet.2013.08.013
apa: Brangewitz, S., & Gamp, J.-P. (2013). Asymmetric Nash bargaining solutions
and competitive payoffs. Economics Letters, (2), 224–227. https://doi.org/10.1016/j.econlet.2013.08.013
bibtex: '@article{Brangewitz_Gamp_2013, title={Asymmetric Nash bargaining solutions
and competitive payoffs}, DOI={10.1016/j.econlet.2013.08.013},
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.” Economics Letters, no. 2 (2013): 224–27. https://doi.org/10.1016/j.econlet.2013.08.013.'
ieee: S. Brangewitz and J.-P. Gamp, “Asymmetric Nash bargaining solutions and competitive
payoffs,” Economics Letters, no. 2, pp. 224–227, 2013.
mla: Brangewitz, Sonja, and Jan-Philip Gamp. “Asymmetric Nash Bargaining Solutions
and Competitive Payoffs.” Economics Letters, no. 2, Elsevier, 2013, pp.
224–27, doi:10.1016/j.econlet.2013.08.013.
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. Approximation Algorithms for the Linear Arrangement of Special
Classes of Graphs. Universität Paderborn; 2013.
apa: Setzer, A. (2013). Approximation Algorithms for the Linear Arrangement of
Special Classes of Graphs. 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. Approximation Algorithms for the Linear Arrangement
of Special Classes of Graphs. Universität Paderborn, 2013.
ieee: A. Setzer, Approximation Algorithms for the Linear Arrangement of Special
Classes of Graphs. Universität Paderborn, 2013.
mla: Setzer, Alexander. Approximation Algorithms for the Linear Arrangement of
Special Classes of Graphs. 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. Analyse von Benutzeranforderungen von Service-Kompositionen mittels
Modelchecking. Universität Paderborn; 2013.
apa: Nickel, T. (2013). Analyse von Benutzeranforderungen von Service-Kompositionen
mittels Modelchecking. 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. Analyse von Benutzeranforderungen von Service-Kompositionen
mittels Modelchecking. Universität Paderborn, 2013.
ieee: T. Nickel, Analyse von Benutzeranforderungen von Service-Kompositionen
mittels Modelchecking. Universität Paderborn, 2013.
mla: Nickel, Tobias. Analyse von Benutzeranforderungen von Service-Kompositionen
mittels Modelchecking. 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. 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.
apa: Hallmann, C. (2013). 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.
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. 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.
ieee: 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.
mla: Hallmann, Corinna. 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.
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. International Journal of Information Systems for Crisis
Response and Management. 2013;5(4):63-80.
apa: Wex, F., Schryen, G., & Neumann, D. (2013). Assignments of Collaborative
Rescue Units during Emergency Response. International Journal of Information
Systems for Crisis Response and Management, 5(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.” International Journal of Information
Systems for Crisis Response and Management 5, no. 4 (2013): 63–80.'
ieee: F. Wex, G. Schryen, and D. Neumann, “Assignments of Collaborative Rescue Units
during Emergency Response,” International Journal of Information Systems for
Crisis Response and Management, vol. 5, no. 4, pp. 63–80, 2013.
mla: Wex, Felix, et al. “Assignments of Collaborative Rescue Units during Emergency
Response.” International Journal of Information Systems for Crisis Response
and Management, 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: Proceedings of the 46th Hawaii
International Conference on System Science. ; 2013.'
apa: Wex, F., Schryen, G., & Neumann, D. (2013). Decision Modeling for Assignments
of Collaborative Rescue Units during Emergency Response. In Proceedings of
the 46th Hawaii International Conference on System Science.
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 Proceedings of
the 46th Hawaii International Conference on System Science, 2013.
ieee: F. Wex, G. Schryen, and D. Neumann, “Decision Modeling for Assignments of
Collaborative Rescue Units during Emergency Response,” in Proceedings of the
46th Hawaii International Conference on System Science, 2013.
mla: Wex, Felix, et al. “Decision Modeling for Assignments of Collaborative Rescue
Units during Emergency Response.” Proceedings of the 46th Hawaii International
Conference on System Science, 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. Algorithms for
Sensor Systems - 9th International Symposium on Algorithms and Experiments for
Sensor Systems, Wireless Networks and Distributed Robotics. Vol 8243. Springer;
2013. doi:10.1007/978-3-642-45346-5
apa: 'Flocchini, P., Gao, J., Kranakis, E., & Meyer auf der Heide, F. (Eds.).
(2013). Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
(Vol. 8243). Presented at the ALGOSENSORS 2013, Sophia Antipolis, France: Springer.
https://doi.org/10.1007/978-3-642-45346-5'
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={10.1007/978-3-642-45346-5},
publisher={Springer}, year={2013}, collection={LNCS} }'
chicago: Flocchini, Paola, Jie Gao, Evangelos Kranakis, and Friedhelm Meyer auf
der Heide, eds. Algorithms for Sensor Systems - 9th International Symposium
on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed
Robotics. Vol. 8243. LNCS. Springer, 2013. https://doi.org/10.1007/978-3-642-45346-5.
ieee: P. Flocchini, J. Gao, E. Kranakis, and 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, vol. 8243.
Springer, 2013.
mla: Flocchini, Paola, et al., editors. Algorithms for Sensor Systems - 9th International
Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks
and Distributed Robotics. Vol. 8243, Springer, 2013, doi:10.1007/978-3-642-45346-5.
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: Proceedings of the Conference on Networked Systems
(NetSys). ; 2013:35-42. doi:10.1109/NetSys.2013.9'
apa: Wette, P., & Graffi, K. (2013). Adding Capacity-Aware Storage Indirection
to Homogeneous Distributed Hash Tables. In Proceedings of the Conference on
Networked Systems (NetSys) (pp. 35–42). https://doi.org/10.1109/NetSys.2013.9
bibtex: '@inproceedings{Wette_Graffi_2013, title={Adding Capacity-Aware Storage
Indirection to Homogeneous Distributed Hash Tables}, DOI={10.1109/NetSys.2013.9},
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 Proceedings of the Conference on
Networked Systems (NetSys), 35–42, 2013. https://doi.org/10.1109/NetSys.2013.9.
ieee: P. Wette and K. Graffi, “Adding Capacity-Aware Storage Indirection to Homogeneous
Distributed Hash Tables,” in Proceedings of the Conference on Networked Systems
(NetSys), 2013, pp. 35–42.
mla: Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection
to Homogeneous Distributed Hash Tables.” Proceedings of the Conference on Networked
Systems (NetSys), 2013, pp. 35–42, doi:10.1109/NetSys.2013.9.
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: Proceedings
of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering.
; 2013:143-152. doi:10.1145/2465449.2465454'
apa: Platenius, M., von Detten, M., Becker, S., Schäfer, W., & Engels, G. (2013).
A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing.
In Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based
Software Engineering (pp. 143–152). https://doi.org/10.1145/2465449.2465454
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={10.1145/2465449.2465454},
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 Proceedings of the 16th International ACM Sigsoft
Symposium on Component-Based Software Engineering, 143–52, 2013. https://doi.org/10.1145/2465449.2465454.
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 Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based
Software Engineering, 2013, pp. 143–152.
mla: Platenius, Marie, et al. “A Survey of Fuzzy Service Matching Approaches in
the Context of On-The-Fly Computing.” Proceedings of the 16th International
ACM Sigsoft Symposium on Component-Based Software Engineering, 2013, pp. 143–52,
doi:10.1145/2465449.2465454.
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. International Journal of Grid and Utility Computing. 2013;(4):265-277.
doi:10.1504/IJGUC.2013.057120
apa: Petrlic, R., Sekula, S., & Sorge, C. (2013). A privacy-friendly Architecture
for future Cloud Computing. International Journal of Grid and Utility Computing,
(4), 265–277. https://doi.org/10.1504/IJGUC.2013.057120
bibtex: '@article{Petrlic_Sekula_Sorge_2013, title={A privacy-friendly Architecture
for future Cloud Computing}, DOI={10.1504/IJGUC.2013.057120},
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.” International Journal of Grid and
Utility Computing, no. 4 (2013): 265–77. https://doi.org/10.1504/IJGUC.2013.057120.'
ieee: R. Petrlic, S. Sekula, and C. Sorge, “A privacy-friendly Architecture for
future Cloud Computing,” International Journal of Grid and Utility Computing,
no. 4, pp. 265–277, 2013.
mla: Petrlic, Ronald, et al. “A Privacy-Friendly Architecture for Future Cloud Computing.”
International Journal of Grid and Utility Computing, no. 4, InderScience,
2013, pp. 265–77, doi:10.1504/IJGUC.2013.057120.
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: Proceedings of the 6th International Conference
on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing.
; 2013:429-434. doi:10.1109/UCC.2013.85'
apa: Keller, M., Pawlik, S., Pietrzyk, P., & Karl, H. (2013). A Local Heuristic
for Latency-Optimized Distributed Cloud Deployment. In Proceedings of the 6th
International Conference on Utility and Cloud Computing (UCC) workshop on Distributed
cloud computing (pp. 429–434). https://doi.org/10.1109/UCC.2013.85
bibtex: '@inproceedings{Keller_Pawlik_Pietrzyk_Karl_2013, title={A Local Heuristic
for Latency-Optimized Distributed Cloud Deployment}, DOI={10.1109/UCC.2013.85},
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 Proceedings
of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop
on Distributed Cloud Computing, 429–34, 2013. https://doi.org/10.1109/UCC.2013.85.
ieee: M. Keller, S. Pawlik, P. Pietrzyk, and H. Karl, “A Local Heuristic for Latency-Optimized
Distributed Cloud Deployment,” in Proceedings of the 6th International Conference
on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing,
2013, pp. 429–434.
mla: Keller, Matthias, et al. “A Local Heuristic for Latency-Optimized Distributed
Cloud Deployment.” Proceedings of the 6th International Conference on Utility
and Cloud Computing (UCC) Workshop on Distributed Cloud Computing, 2013, pp.
429–34, doi:10.1109/UCC.2013.85.
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: Proceedings of the 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
(ALGOSENSORS). LNCS. ; 2013:217-227. doi:10.1007/978-3-642-45346-5_16'
apa: Markarian, C., Meyer auf der Heide, F., & Schubert, M. (2013). A Distributed
Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric
Wireless Ad-Hoc Networks. In Proceedings of the 9th International Symposium
on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed
Robotics (ALGOSENSORS) (pp. 217–227). https://doi.org/10.1007/978-3-642-45346-5_16
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={10.1007/978-3-642-45346-5_16},
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 Proceedings of the 9th International
Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks
and Distributed Robotics (ALGOSENSORS), 217–27. LNCS, 2013. https://doi.org/10.1007/978-3-642-45346-5_16.
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 Proceedings of the 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
(ALGOSENSORS), 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.” Proceedings
of the 9th International Symposium on Algorithms and Experiments for Sensor Systems,
Wireless Networks and Distributed Robotics (ALGOSENSORS), 2013, pp. 217–27,
doi:10.1007/978-3-642-45346-5_16.
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'
...
---
_id: '5637'
author:
- first_name: Guido
full_name: Schryen, Guido
id: '72850'
last_name: Schryen
citation:
ama: 'Schryen G. Revisiting IS Business Value Research: What we already know, what
we still need to know, and how we can get there. European Journal of Information
Systems (EJIS). 2013;22(2):139-169.'
apa: 'Schryen, G. (2013). Revisiting IS Business Value Research: What we already
know, what we still need to know, and how we can get there. European Journal
of Information Systems (EJIS), 22(2), 139–169.'
bibtex: '@article{Schryen_2013, title={Revisiting IS Business Value Research: What
we already know, what we still need to know, and how we can get there}, volume={22},
number={2}, journal={European Journal of Information Systems (EJIS)}, author={Schryen,
Guido}, year={2013}, pages={139–169} }'
chicago: 'Schryen, Guido. “Revisiting IS Business Value Research: What We Already
Know, What We Still Need to Know, and How We Can Get There.” European Journal
of Information Systems (EJIS) 22, no. 2 (2013): 139–69.'
ieee: 'G. Schryen, “Revisiting IS Business Value Research: What we already know,
what we still need to know, and how we can get there,” European Journal of
Information Systems (EJIS), vol. 22, no. 2, pp. 139–169, 2013.'
mla: 'Schryen, Guido. “Revisiting IS Business Value Research: What We Already Know,
What We Still Need to Know, and How We Can Get There.” European Journal of
Information Systems (EJIS), vol. 22, no. 2, 2013, pp. 139–69.'
short: G. Schryen, European Journal of Information Systems (EJIS) 22 (2013) 139–169.
date_created: 2018-11-14T14:31:37Z
date_updated: 2022-01-06T07:02:16Z
ddc:
- '000'
department:
- _id: '277'
extern: '1'
file:
- access_level: open_access
content_type: application/pdf
creator: hsiemes
date_created: 2018-12-07T11:59:54Z
date_updated: 2018-12-13T15:11:53Z
file_id: '6048'
file_name: EJIS-PAPER.pdf
file_size: 792102
relation: main_file
file_date_updated: 2018-12-13T15:11:53Z
has_accepted_license: '1'
intvolume: ' 22'
issue: '2'
language:
- iso: eng
oa: '1'
page: 139-169
publication: European Journal of Information Systems (EJIS)
status: public
title: 'Revisiting IS Business Value Research: What we already know, what we still
need to know, and how we can get there'
type: journal_article
user_id: '61579'
volume: 22
year: '2013'
...
---
_id: '564'
abstract:
- lang: eng
text: We consider the problem of resource discovery in distributed systems. In particular
we give an algorithm, such that each node in a network discovers the add ress
of any other node in the network. We model the knowledge of the nodes as a virtual
overlay network given by a directed graph such that complete knowledge of all
nodes corresponds to a complete graph in the overlay network. Although there are
several solutions for resource discovery, our solution is the first that achieves
worst-case optimal work for each node, i.e. the number of addresses (O(n)) or
bits (O(nlogn)) a node receives or sendscoincides with the lower bound, while
ensuring only a linearruntime (O(n)) on the number of rounds.
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. A Deterministic Worst-Case Message
Complexity Optimal Solution for Resource Discovery. In: Proceedings of 20th
International Colloqium on Structural Information and Communication Complexity
(SIROCCO). Lecture Notes in Computer Science. ; 2013:165-176. doi:10.1007/978-3-319-03578-9_14'
apa: Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2013). A Deterministic
Worst-Case Message Complexity Optimal Solution for Resource Discovery. In Proceedings
of 20th International Colloqium on Structural Information and Communication Complexity
(SIROCCO) (pp. 165–176). https://doi.org/10.1007/978-3-319-03578-9_14
bibtex: '@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2013, series={Lecture
Notes in Computer Science}, title={A Deterministic Worst-Case Message Complexity
Optimal Solution for Resource Discovery}, DOI={10.1007/978-3-319-03578-9_14},
booktitle={Proceedings of 20th International Colloqium on Structural Information
and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Koutsopoulos,
Andreas and Scheideler, Christian}, year={2013}, pages={165–176}, collection={Lecture
Notes in Computer Science} }'
chicago: Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
“A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.”
In Proceedings of 20th International Colloqium on Structural Information and
Communication Complexity (SIROCCO), 165–76. Lecture Notes in Computer Science,
2013. https://doi.org/10.1007/978-3-319-03578-9_14.
ieee: S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Deterministic Worst-Case
Message Complexity Optimal Solution for Resource Discovery,” in Proceedings
of 20th International Colloqium on Structural Information and Communication Complexity
(SIROCCO), 2013, pp. 165–176.
mla: Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity
Optimal Solution for Resource Discovery.” Proceedings of 20th International
Colloqium on Structural Information and Communication Complexity (SIROCCO),
2013, pp. 165–76, doi:10.1007/978-3-319-03578-9_14.
short: 'S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of 20th
International Colloqium on Structural Information and Communication Complexity
(SIROCCO), 2013, pp. 165–176.'
date_created: 2017-10-17T12:42:42Z
date_updated: 2022-01-06T07:02:17Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-03578-9_14
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:24:40Z
date_updated: 2018-03-15T10:24:40Z
file_id: '1277'
file_name: 564-SIROCCO13.pdf
file_size: 168884
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:24:40Z
has_accepted_license: '1'
page: 165-176
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of 20th International Colloqium on Structural Information
and Communication Complexity (SIROCCO)
series_title: Lecture Notes in Computer Science
status: public
title: A Deterministic Worst-Case Message Complexity Optimal Solution for Resource
Discovery
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '6456'
author:
- first_name: J. J. S.
full_name: Higham, J. J. S.
last_name: Higham
- first_name: H.-Hugo
full_name: Kremer, H.-Hugo
id: '15280'
last_name: Kremer
- first_name: D.
full_name: Yeomans, D.
last_name: Yeomans
citation:
ama: 'Higham JJS, Kremer H-H, Yeomans D. Exploring Intermediate Vocational Education
and Training for 16-19 Year-olds in Germany and England. In: Deitmer L, Hauschildt
U, Rauner F, Zelloth H, eds. The Architecture of Innovative Apprenticeship.
Dordrecht; 2013:39-50.'
apa: Higham, J. J. S., Kremer, H.-H., & Yeomans, D. (2013). Exploring Intermediate
Vocational Education and Training for 16-19 Year-olds in Germany and England.
In L. Deitmer, U. Hauschildt, F. Rauner, & H. Zelloth (Eds.), The Architecture
of Innovative Apprenticeship (pp. 39–50). Dordrecht.
bibtex: '@inbook{Higham_Kremer_Yeomans_2013, place={Dordrecht}, title={Exploring
Intermediate Vocational Education and Training for 16-19 Year-olds in Germany
and England}, booktitle={The Architecture of Innovative Apprenticeship}, author={Higham,
J. J. S. and Kremer, H.-Hugo and Yeomans, D.}, editor={Deitmer, L. and Hauschildt,
U. and Rauner, F. and Zelloth, H.Editors}, year={2013}, pages={39–50} }'
chicago: Higham, J. J. S., H.-Hugo Kremer, and D. Yeomans. “Exploring Intermediate
Vocational Education and Training for 16-19 Year-Olds in Germany and England.”
In The Architecture of Innovative Apprenticeship, edited by L. Deitmer,
U. Hauschildt, F. Rauner, and H. Zelloth, 39–50. Dordrecht, 2013.
ieee: J. J. S. Higham, H.-H. Kremer, and D. Yeomans, “Exploring Intermediate Vocational
Education and Training for 16-19 Year-olds in Germany and England,” in The
Architecture of Innovative Apprenticeship, L. Deitmer, U. Hauschildt, F. Rauner,
and H. Zelloth, Eds. Dordrecht, 2013, pp. 39–50.
mla: Higham, J. J. S., et al. “Exploring Intermediate Vocational Education and Training
for 16-19 Year-Olds in Germany and England.” The Architecture of Innovative
Apprenticeship, edited by L. Deitmer et al., 2013, pp. 39–50.
short: 'J.J.S. Higham, H.-H. Kremer, D. Yeomans, in: L. Deitmer, U. Hauschildt,
F. Rauner, H. Zelloth (Eds.), The Architecture of Innovative Apprenticeship, Dordrecht,
2013, pp. 39–50.'
date_created: 2019-01-02T10:33:48Z
date_updated: 2022-01-06T07:03:05Z
department:
- _id: '211'
editor:
- first_name: L.
full_name: Deitmer, L.
last_name: Deitmer
- first_name: U.
full_name: Hauschildt, U.
last_name: Hauschildt
- first_name: F.
full_name: Rauner, F.
last_name: Rauner
- first_name: H.
full_name: Zelloth, H.
last_name: Zelloth
language:
- iso: eng
page: 39-50
place: Dordrecht
publication: The Architecture of Innovative Apprenticeship
status: public
title: Exploring Intermediate Vocational Education and Training for 16-19 Year-olds
in Germany and England
type: book_chapter
user_id: '74378'
year: '2013'
...
---
_id: '6457'
author:
- first_name: H.-Hugo
full_name: Kremer, H.-Hugo
id: '15280'
last_name: Kremer
- first_name: Marc
full_name: Beutner, Marc
id: '21118'
last_name: Beutner
- first_name: W.
full_name: Wirth, W.
last_name: Wirth
citation:
ama: 'Kremer H-H, Beutner M, Wirth W. Lernen im Justizvollzug. Vorstellung und Grundidee
des Modellprojektes TANDEM. In: Kremer H-H, Beutner M, Wirth W, eds. Berufsorientierung,
Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung
im Jungtätervollzug. Paderborn; 2013.'
apa: Kremer, H.-H., Beutner, M., & Wirth, W. (2013). Lernen im Justizvollzug.
Vorstellung und Grundidee des Modellprojektes TANDEM. In H.-H. Kremer, M. Beutner,
& W. Wirth (Eds.), Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung
- Konzepte zur beruflichen Bildung im Jungtätervollzug. Paderborn.
bibtex: '@inbook{Kremer_Beutner_Wirth_2013, place={Paderborn}, title={Lernen im
Justizvollzug. Vorstellung und Grundidee des Modellprojektes TANDEM}, booktitle={Berufsorientierung,
Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung
im Jungtätervollzug}, author={Kremer, H.-Hugo and Beutner, Marc and Wirth, W.},
editor={Kremer, H.-H. and Beutner, M. and Wirth, W.Editors}, year={2013} }'
chicago: Kremer, H.-Hugo, Marc Beutner, and W. Wirth. “Lernen im Justizvollzug.
Vorstellung und Grundidee des Modellprojektes TANDEM.” In Berufsorientierung,
Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung
im Jungtätervollzug, edited by H.-H. Kremer, M. Beutner, and W. Wirth. Paderborn,
2013.
ieee: H.-H. Kremer, M. Beutner, and W. Wirth, “Lernen im Justizvollzug. Vorstellung
und Grundidee des Modellprojektes TANDEM,” in Berufsorientierung, Gewaltsensibilisierung
und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug,
H.-H. Kremer, M. Beutner, and W. Wirth, Eds. Paderborn, 2013.
mla: Kremer, H. Hugo, et al. “Lernen im Justizvollzug. Vorstellung und Grundidee
des Modellprojektes TANDEM.” Berufsorientierung, Gewaltsensibilisierung und
Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug,
edited by H.-H. Kremer et al., 2013.
short: 'H.-H. Kremer, M. Beutner, W. Wirth, in: H.-H. Kremer, M. Beutner, W. Wirth
(Eds.), Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung -
Konzepte zur beruflichen Bildung im Jungtätervollzug, Paderborn, 2013.'
date_created: 2019-01-02T10:43:00Z
date_updated: 2022-01-06T07:03:05Z
department:
- _id: '211'
editor:
- first_name: H.-H.
full_name: Kremer, H.-H.
last_name: Kremer
- first_name: M.
full_name: Beutner, M.
last_name: Beutner
- first_name: W.
full_name: Wirth, W.
last_name: Wirth
language:
- iso: ger
place: Paderborn
publication: Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung -
Konzepte zur beruflichen Bildung im Jungtätervollzug
status: public
title: Lernen im Justizvollzug. Vorstellung und Grundidee des Modellprojektes TANDEM
type: book_chapter
user_id: '74378'
year: '2013'
...
---
_id: '6458'
author:
- first_name: H.-Hugo
full_name: Kremer, H.-Hugo
id: '15280'
last_name: Kremer
- first_name: Marc
full_name: Beutner, Marc
id: '21118'
last_name: Beutner
citation:
ama: 'Kremer H-H, Beutner M. Berufsorientierung im Jungtätervollzug - Rahmenkonzept
und übergreifenden Prinzipien. In: Berufsorientierung, Gewaltsensibilisierung
und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug.
Paderborn; 2013.'
apa: Kremer, H.-H., & Beutner, M. (2013). Berufsorientierung im Jungtätervollzug
- Rahmenkonzept und übergreifenden Prinzipien. In Berufsorientierung, Gewaltsensibilisierung
und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug.
Paderborn.
bibtex: '@inbook{Kremer_Beutner_2013, place={Paderborn}, title={Berufsorientierung
im Jungtätervollzug - Rahmenkonzept und übergreifenden Prinzipien}, booktitle={Berufsorientierung,
Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung
im Jungtätervollzug}, author={Kremer, H.-Hugo and Beutner, Marc}, year={2013}
}'
chicago: Kremer, H.-Hugo, and Marc Beutner. “Berufsorientierung im Jungtätervollzug
- Rahmenkonzept und übergreifenden Prinzipien.” In Berufsorientierung, Gewaltsensibilisierung
und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug.
Paderborn, 2013.
ieee: H.-H. Kremer and M. Beutner, “Berufsorientierung im Jungtätervollzug - Rahmenkonzept
und übergreifenden Prinzipien,” in Berufsorientierung, Gewaltsensibilisierung
und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug,
Paderborn, 2013.
mla: Kremer, H. Hugo, and Marc Beutner. “Berufsorientierung im Jungtätervollzug
- Rahmenkonzept und übergreifenden Prinzipien.” Berufsorientierung, Gewaltsensibilisierung
und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug,
2013.
short: 'H.-H. Kremer, M. Beutner, in: Berufsorientierung, Gewaltsensibilisierung
und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug,
Paderborn, 2013.'
date_created: 2019-01-02T10:45:41Z
date_updated: 2022-01-06T07:03:05Z
department:
- _id: '211'
language:
- iso: ger
place: Paderborn
publication: Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung -
Konzepte zur beruflichen Bildung im Jungtätervollzug
status: public
title: Berufsorientierung im Jungtätervollzug - Rahmenkonzept und übergreifenden Prinzipien
type: book_chapter
user_id: '74378'
year: '2013'
...
---
_id: '6459'
author:
- first_name: M.
full_name: Gebbe, M.
last_name: Gebbe
- first_name: H.-Hugo
full_name: Kremer, H.-Hugo
id: '15280'
last_name: Kremer
citation:
ama: 'Gebbe M, Kremer H-H. myflux.eu - Ein Instrument zur Förderung von Zielorientierung,
Reflexion und Verantwortung im Berufsorientierungsprozess von Jungtätern. In:
Kremer H-H, Beutner M, Wirth W, eds. Berufsorientierung, Gewaltsensibilisierung
und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug.
Paderborn; 2013.'
apa: Gebbe, M., & Kremer, H.-H. (2013). myflux.eu - Ein Instrument zur Förderung
von Zielorientierung, Reflexion und Verantwortung im Berufsorientierungsprozess
von Jungtätern. In H.-H. Kremer, M. Beutner, & W. Wirth (Eds.), Berufsorientierung,
Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung
im Jungtätervollzug. Paderborn.
bibtex: '@inbook{Gebbe_Kremer_2013, place={Paderborn}, title={myflux.eu - Ein Instrument
zur Förderung von Zielorientierung, Reflexion und Verantwortung im Berufsorientierungsprozess
von Jungtätern}, booktitle={Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung
- Konzepte zur beruflichen Bildung im Jungtätervollzug}, author={Gebbe, M. and
Kremer, H.-Hugo}, editor={Kremer, H.-H. and Beutner, M. and Wirth, W.Editors},
year={2013} }'
chicago: Gebbe, M., and H.-Hugo Kremer. “myflux.eu - Ein Instrument zur Förderung
von Zielorientierung, Reflexion und Verantwortung im Berufsorientierungsprozess
von Jungtätern.” In Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung
- Konzepte zur beruflichen Bildung im Jungtätervollzug, edited by H.-H. Kremer,
M. Beutner, and W. Wirth. Paderborn, 2013.
ieee: M. Gebbe and H.-H. Kremer, “myflux.eu - Ein Instrument zur Förderung von Zielorientierung,
Reflexion und Verantwortung im Berufsorientierungsprozess von Jungtätern,” in
Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte
zur beruflichen Bildung im Jungtätervollzug, H.-H. Kremer, M. Beutner, and
W. Wirth, Eds. Paderborn, 2013.
mla: Gebbe, M., and H. Hugo Kremer. “myflux.eu - Ein Instrument zur Förderung von
Zielorientierung, Reflexion und Verantwortung im Berufsorientierungsprozess von
Jungtätern.” Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung
- Konzepte zur beruflichen Bildung im Jungtätervollzug, edited by H.-H. Kremer
et al., 2013.
short: 'M. Gebbe, H.-H. Kremer, in: H.-H. Kremer, M. Beutner, W. Wirth (Eds.), Berufsorientierung,
Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung
im Jungtätervollzug, Paderborn, 2013.'
date_created: 2019-01-02T10:48:32Z
date_updated: 2022-01-06T07:03:05Z
department:
- _id: '211'
editor:
- first_name: H.-H.
full_name: Kremer, H.-H.
last_name: Kremer
- first_name: M.
full_name: Beutner, M.
last_name: Beutner
- first_name: W.
full_name: Wirth, W.
last_name: Wirth
language:
- iso: ger
place: Paderborn
publication: Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung -
Konzepte zur beruflichen Bildung im Jungtätervollzug
status: public
title: myflux.eu - Ein Instrument zur Förderung von Zielorientierung, Reflexion und
Verantwortung im Berufsorientierungsprozess von Jungtätern
type: book_chapter
user_id: '74378'
year: '2013'
...
---
_id: '6461'
author:
- first_name: H.-Hugo
full_name: Kremer, H.-Hugo
id: '15280'
last_name: Kremer
- first_name: S.
full_name: Knust, S.
last_name: Knust
citation:
ama: 'Kremer H-H, Knust S. Stärkenbasierte Berufsorientierung im Jungtätervollzug
. In: Kremer H-H, Beutner M, Wirth W, eds. Berufsorientierung, Gewaltsensibilisierung
und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug.
Paderborn; 2013.'
apa: Kremer, H.-H., & Knust, S. (2013). Stärkenbasierte Berufsorientierung im
Jungtätervollzug . In H.-H. Kremer, M. Beutner, & W. Wirth (Eds.), Berufsorientierung,
Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung
im Jungtätervollzug. Paderborn.
bibtex: '@inbook{Kremer_Knust_2013, place={Paderborn}, title={Stärkenbasierte Berufsorientierung
im Jungtätervollzug }, booktitle={Berufsorientierung, Gewaltsensibilisierung und
Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug},
author={Kremer, H.-Hugo and Knust, S.}, editor={Kremer, H.-H. and Beutner, M.
and Wirth, W.Editors}, year={2013} }'
chicago: Kremer, H.-Hugo, and S. Knust. “Stärkenbasierte Berufsorientierung im Jungtätervollzug
.” In Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung -
Konzepte zur beruflichen Bildung im Jungtätervollzug, edited by H.-H. Kremer,
M. Beutner, and W. Wirth. Paderborn, 2013.
ieee: H.-H. Kremer and S. Knust, “Stärkenbasierte Berufsorientierung im Jungtätervollzug
,” in Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung -
Konzepte zur beruflichen Bildung im Jungtätervollzug, H.-H. Kremer, M. Beutner,
and W. Wirth, Eds. Paderborn, 2013.
mla: Kremer, H. Hugo, and S. Knust. “Stärkenbasierte Berufsorientierung im Jungtätervollzug
.” Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte
zur beruflichen Bildung im Jungtätervollzug, edited by H.-H. Kremer et al.,
2013.
short: 'H.-H. Kremer, S. Knust, in: H.-H. Kremer, M. Beutner, W. Wirth (Eds.), Berufsorientierung,
Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung
im Jungtätervollzug, Paderborn, 2013.'
date_created: 2019-01-02T10:52:12Z
date_updated: 2022-01-06T07:03:06Z
department:
- _id: '211'
editor:
- first_name: H.-H.
full_name: Kremer, H.-H.
last_name: Kremer
- first_name: M.
full_name: Beutner, M.
last_name: Beutner
- first_name: W.
full_name: Wirth, W.
last_name: Wirth
language:
- iso: ger
place: Paderborn
publication: Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung -
Konzepte zur beruflichen Bildung im Jungtätervollzug
status: public
title: 'Stärkenbasierte Berufsorientierung im Jungtätervollzug '
type: book_chapter
user_id: '74378'
year: '2013'
...