---
_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'
...