---
_id: '382'
abstract:
- lang: eng
text: This paper explores how cloud provider competition influences instance pricing
in an IaaS (Infrastructure-as-a-Service) market. When reserved instance pricing
includes an on-demand price component in addition to a reservation fee (two-part
tariffs), different providers might offer different price combinations, where
the client’s choice depends on its load profile. We investigate a duopoly of providers
and analyze stable market prices in two-part tariffs. Further, we study offers
that allow a specified amount of included usage (three-part tariffs). Neither two-part
nor three-part tariffs produce an equilibrium market outcome other than a service
pricing that equals production cost, i.e., complex price structures do not significantly
affect the results from ordinary Bertrand competition.
author:
- first_name: Jörn
full_name: Künsemöller, Jörn
last_name: Künsemöller
- first_name: Sonja
full_name: Brangewitz, Sonja
last_name: Brangewitz
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
citation:
ama: 'Künsemöller J, Brangewitz S, Karl H, Haake C-J. Provider Competition in Infrastructure-as-a-Service.
In: Proceedings of the 2014 IEEE International Conference on Services Computing
(SCC). ; 2014:203-210. doi:10.1109/SCC.2014.35'
apa: Künsemöller, J., Brangewitz, S., Karl, H., & Haake, C.-J. (2014). Provider
Competition in Infrastructure-as-a-Service. In Proceedings of the 2014 IEEE
International Conference on Services Computing (SCC) (pp. 203–210). https://doi.org/10.1109/SCC.2014.35
bibtex: '@inproceedings{Künsemöller_Brangewitz_Karl_Haake_2014, title={Provider
Competition in Infrastructure-as-a-Service}, DOI={10.1109/SCC.2014.35},
booktitle={Proceedings of the 2014 IEEE International Conference on Services Computing
(SCC)}, author={Künsemöller, Jörn and Brangewitz, Sonja and Karl, Holger and Haake,
Claus-Jochen}, year={2014}, pages={203–210} }'
chicago: Künsemöller, Jörn, Sonja Brangewitz, Holger Karl, and Claus-Jochen Haake.
“Provider Competition in Infrastructure-as-a-Service.” In Proceedings of the
2014 IEEE International Conference on Services Computing (SCC), 203–10, 2014.
https://doi.org/10.1109/SCC.2014.35.
ieee: J. Künsemöller, S. Brangewitz, H. Karl, and C.-J. Haake, “Provider Competition
in Infrastructure-as-a-Service,” in Proceedings of the 2014 IEEE International
Conference on Services Computing (SCC), 2014, pp. 203–210.
mla: Künsemöller, Jörn, et al. “Provider Competition in Infrastructure-as-a-Service.”
Proceedings of the 2014 IEEE International Conference on Services Computing
(SCC), 2014, pp. 203–10, doi:10.1109/SCC.2014.35.
short: 'J. Künsemöller, S. Brangewitz, H. Karl, C.-J. Haake, in: Proceedings of
the 2014 IEEE International Conference on Services Computing (SCC), 2014, pp.
203–210.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:37Z
ddc:
- '004'
department:
- _id: '75'
- _id: '205'
doi: 10.1109/SCC.2014.35
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:34:46Z
date_updated: 2018-11-02T13:34:46Z
file_id: '5250'
file_name: 06930535.pdf
file_size: 228172
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:34:46Z
has_accepted_license: '1'
language:
- iso: eng
page: 203-210
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 2014 IEEE International Conference on Services Computing
(SCC)
status: public
title: Provider Competition in Infrastructure-as-a-Service
type: conference
user_id: '477'
year: '2014'
...
---
_id: '383'
abstract:
- lang: eng
text: Proof-carrying code approaches aim at safe execution of untrusted code by
having the code producer attach a safety proof to the code which the code consumer
only has to validate. Depending on the type of safety property, proofs can however
become quite large and their validation - though faster than their construction
- still time consuming. In this paper we introduce a new concept for safe execution
of untrusted code. It keeps the idea of putting the time consuming part of proving
on the side of the code producer, however, attaches no proofs to code anymore
but instead uses the proof to transform the program into an equivalent but more
efficiently verifiable program. Code consumers thus still do proving themselves,
however, on a computationally inexpensive level only. Experimental results show
that the proof effort can be reduced by several orders of magnitude, both with
respect to time and space.
author:
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
- first_name: Alexander
full_name: Schremmer, Alexander
last_name: Schremmer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wonisch D, Schremmer A, Wehrheim H. Programs from Proofs -- Approach and Applications.
In: Proceedings of the Software Engineering Conference (SE). Lecture Notes
in Informatics (LNI). ; 2014:67-68.'
apa: Wonisch, D., Schremmer, A., & Wehrheim, H. (2014). Programs from Proofs
-- Approach and Applications. In Proceedings of the Software Engineering Conference
(SE) (pp. 67–68).
bibtex: '@inproceedings{Wonisch_Schremmer_Wehrheim_2014, series={Lecture Notes in
Informatics (LNI)}, title={Programs from Proofs -- Approach and Applications},
booktitle={Proceedings of the Software Engineering Conference (SE)}, author={Wonisch,
Daniel and Schremmer, Alexander and Wehrheim, Heike}, year={2014}, pages={67–68},
collection={Lecture Notes in Informatics (LNI)} }'
chicago: Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Programs from
Proofs -- Approach and Applications.” In Proceedings of the Software Engineering
Conference (SE), 67–68. Lecture Notes in Informatics (LNI), 2014.
ieee: D. Wonisch, A. Schremmer, and H. Wehrheim, “Programs from Proofs -- Approach
and Applications,” in Proceedings of the Software Engineering Conference (SE),
2014, pp. 67–68.
mla: Wonisch, Daniel, et al. “Programs from Proofs -- Approach and Applications.”
Proceedings of the Software Engineering Conference (SE), 2014, pp. 67–68.
short: 'D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the Software Engineering
Conference (SE), 2014, pp. 67–68.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:38Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:04:52Z
date_updated: 2018-03-20T07:04:52Z
file_id: '1392'
file_name: 383-programmsFromProofsSE.pdf
file_size: 66474
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:04:52Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://eprints.uni-kiel.de/23752/
page: 67-68
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the Software Engineering Conference (SE)
series_title: Lecture Notes in Informatics (LNI)
status: public
title: Programs from Proofs -- Approach and Applications
type: conference
user_id: '477'
year: '2014'
...
---
_id: '384'
abstract:
- lang: eng
text: 'Reputation systems provide reputation values of rated parties to users. These
reputation values, typically aggregations of individual user ratings, shall be
reliable, i.e. should enable a realistic assessment of the probability that the
rated party behaves as expected in a transaction. In order for the reputation
values to stay reliable and, thus, for the reputation system to provide a benefit,
the system needs to be resistant against manipulations by users, the rated parties
trying to improve their reputation values, and even against competitors trying
to worsen a reputation value. At the same time, a reputation system shall provide
privacy protection for users: rated parties shall not be able to learn who provided
a certain rating. Otherwise users might not take part in the system as they fear
bad feedback in revenge for bad ratings, or users do not want to be connected
to certain transactions based on their provided ratings. In this paper we come
up with a solution that provides both, reliability of reputation values on the
one hand, and privacy protection for users on the other hand. In contrast to related
work, our solution only makes use of a single reputation provider that needs to
be trusted (to a certain extent) and does not require any bulletin boards to be
present in the system. We make use of the Paillier cryptosystem to provide an
aggregation of individual user ratings in a way that no party can learn which
user provided a certain rating.'
author:
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
- first_name: Sascha
full_name: Lutters, Sascha
last_name: Lutters
- first_name: Christoph
full_name: Sorge, Christoph
last_name: Sorge
citation:
ama: 'Petrlic R, Lutters S, Sorge C. Privacy-Preserving Reputation Management. In:
Proceedings of the 29th Symposium On Applied Computing (SAC). ; 2014:1712-1718.
doi:10.1145/2554850.2554881'
apa: Petrlic, R., Lutters, S., & Sorge, C. (2014). Privacy-Preserving Reputation
Management. In Proceedings of the 29th Symposium On Applied Computing (SAC)
(pp. 1712–1718). https://doi.org/10.1145/2554850.2554881
bibtex: '@inproceedings{Petrlic_Lutters_Sorge_2014, title={Privacy-Preserving Reputation
Management}, DOI={10.1145/2554850.2554881},
booktitle={Proceedings of the 29th Symposium On Applied Computing (SAC)}, author={Petrlic,
Ronald and Lutters, Sascha and Sorge, Christoph}, year={2014}, pages={1712–1718}
}'
chicago: Petrlic, Ronald, Sascha Lutters, and Christoph Sorge. “Privacy-Preserving
Reputation Management.” In Proceedings of the 29th Symposium On Applied Computing
(SAC), 1712–18, 2014. https://doi.org/10.1145/2554850.2554881.
ieee: R. Petrlic, S. Lutters, and C. Sorge, “Privacy-Preserving Reputation Management,”
in Proceedings of the 29th Symposium On Applied Computing (SAC), 2014,
pp. 1712–1718.
mla: Petrlic, Ronald, et al. “Privacy-Preserving Reputation Management.” Proceedings
of the 29th Symposium On Applied Computing (SAC), 2014, pp. 1712–18, doi:10.1145/2554850.2554881.
short: 'R. Petrlic, S. Lutters, C. Sorge, in: Proceedings of the 29th Symposium
On Applied Computing (SAC), 2014, pp. 1712–1718.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:42Z
ddc:
- '040'
doi: 10.1145/2554850.2554881
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:04:20Z
date_updated: 2018-03-20T07:04:20Z
file_id: '1391'
file_name: 384-reputationsystem_01.pdf
file_size: 505927
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:04:20Z
has_accepted_license: '1'
page: 1712-1718
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 29th Symposium On Applied Computing (SAC)
status: public
title: Privacy-Preserving Reputation Management
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '385'
author:
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
citation:
ama: Petrlic R. Privacy-Preserving Multiparty Digital Rights Management.
Universität Paderborn; 2014.
apa: Petrlic, R. (2014). Privacy-Preserving Multiparty Digital Rights Management.
Universität Paderborn.
bibtex: '@book{Petrlic_2014, title={Privacy-Preserving Multiparty Digital Rights
Management}, publisher={Universität Paderborn}, author={Petrlic, Ronald}, year={2014}
}'
chicago: Petrlic, Ronald. Privacy-Preserving Multiparty Digital Rights Management.
Universität Paderborn, 2014.
ieee: R. Petrlic, Privacy-Preserving Multiparty Digital Rights Management.
Universität Paderborn, 2014.
mla: Petrlic, Ronald. Privacy-Preserving Multiparty Digital Rights Management.
Universität Paderborn, 2014.
short: R. Petrlic, Privacy-Preserving Multiparty Digital Rights Management, Universität
Paderborn, 2014.
date_created: 2017-10-17T12:42:07Z
date_updated: 2022-01-06T06:59:45Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:03:37Z
date_updated: 2018-03-20T07:03:37Z
file_id: '1390'
file_name: 385-arbeit1.pdf
file_size: 2962042
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:03:37Z
has_accepted_license: '1'
language:
- iso: eng
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: Privacy-Preserving Multiparty Digital Rights Management
type: dissertation
user_id: '477'
year: '2014'
...
---
_id: '386'
abstract:
- lang: eng
text: We present a privacy-preserving multiparty DRM scheme that does not need a
trusted third party. Users anonymously buy content from content providers and
anonymously execute it at content execution centers. The executions are unlinkable
to each other. The license check is performed as part of the used ciphertext-policy
attribute-based encryption (CP-ABE) and, thus, access control is cryptographically
enforced. The problem of authorization proof towards the key center in an ABE
scheme is solved by a combination with anonymous payments.
author:
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
- first_name: Christoph
full_name: Sorge, Christoph
last_name: Sorge
citation:
ama: 'Petrlic R, Sorge C. Privacy-Preserving Digital Rights Management based on
Attribute-based Encryption. In: Proceedings of the Sixth IFIP International
Conference on New Technologies, Mobility and Security (NTMS). ; 2014:1-5.
doi:10.1109/NTMS.2014.6814044'
apa: Petrlic, R., & Sorge, C. (2014). Privacy-Preserving Digital Rights Management
based on Attribute-based Encryption. In Proceedings of the Sixth IFIP International
Conference on New Technologies, Mobility and Security (NTMS) (pp. 1–5). https://doi.org/10.1109/NTMS.2014.6814044
bibtex: '@inproceedings{Petrlic_Sorge_2014, title={Privacy-Preserving Digital Rights
Management based on Attribute-based Encryption}, DOI={10.1109/NTMS.2014.6814044},
booktitle={Proceedings of the Sixth IFIP International Conference on New Technologies,
Mobility and Security (NTMS)}, author={Petrlic, Ronald and Sorge, Christoph},
year={2014}, pages={1–5} }'
chicago: Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving Digital Rights
Management Based on Attribute-Based Encryption.” In Proceedings of the Sixth
IFIP International Conference on New Technologies, Mobility and Security (NTMS),
1–5, 2014. https://doi.org/10.1109/NTMS.2014.6814044.
ieee: R. Petrlic and C. Sorge, “Privacy-Preserving Digital Rights Management based
on Attribute-based Encryption,” in Proceedings of the Sixth IFIP International
Conference on New Technologies, Mobility and Security (NTMS), 2014, pp. 1–5.
mla: Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving Digital Rights Management
Based on Attribute-Based Encryption.” Proceedings of the Sixth IFIP International
Conference on New Technologies, Mobility and Security (NTMS), 2014, pp. 1–5,
doi:10.1109/NTMS.2014.6814044.
short: 'R. Petrlic, C. Sorge, in: Proceedings of the Sixth IFIP International Conference
on New Technologies, Mobility and Security (NTMS), 2014, pp. 1–5.'
date_created: 2017-10-17T12:42:07Z
date_updated: 2022-01-06T06:59:46Z
ddc:
- '040'
doi: 10.1109/NTMS.2014.6814044
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:03:02Z
date_updated: 2018-03-20T07:03:02Z
file_id: '1389'
file_name: 386-NTMS14.pdf
file_size: 216843
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:03:02Z
has_accepted_license: '1'
page: 1-5
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 Sixth IFIP International Conference on New Technologies,
Mobility and Security (NTMS)
status: public
title: Privacy-Preserving Digital Rights Management based on Attribute-based Encryption
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '387'
abstract:
- lang: eng
text: This article studies the design of medium access control (MAC) protocols for
wireless networks that are provably robust against arbitrary and unpredictable
disruptions (e.g., due to unintentional external interference from co-existing
networks or due to jamming). We consider a wireless network consisting of a set
of n honest and reliable nodes within transmission (and interference) range of
each other, and we model the external disruptions with a powerful adaptive adversary.
This adversary may know the protocol and its entire history and can use this knowledge
to jam the wireless channel at will at any time. It is allowed to jam a (1 − )-fraction
of the timesteps, for an arbitrary constant > 0 unknown to the nodes. The nodes
cannot distinguish between the adversarial jamming or a collision of two or more
messages that are sent at the same time. We demonstrate, for the first time, that
there is a local-control MAC protocol requiring only very limited knowledge about
the adversary and the network that achieves a constant (asymptotically optimal)
throughput for the nonjammed time periods under any of the aforementioned adversarial
strategies. The derived principles are also useful to build robust applications
on top of the MAC layer, and we present an exemplary study for leader election,
one of the most fundamental tasks in distributed computing.
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: Awerbuch B, Richa AW, Scheideler C, Schmid S, Zhang J. Principles of Robust
Medium Access and an Application to Leader Election. Transactions on Algorithms.
2014;(4). doi:10.1145/2635818
apa: Awerbuch, B., Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2014).
Principles of Robust Medium Access and an Application to Leader Election. Transactions
on Algorithms, (4). https://doi.org/10.1145/2635818
bibtex: '@article{Awerbuch_Richa_Scheideler_Schmid_Zhang_2014, title={Principles
of Robust Medium Access and an Application to Leader Election}, DOI={10.1145/2635818},
number={4}, journal={Transactions on Algorithms}, publisher={ACM}, author={Awerbuch,
Baruch and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang,
Jin}, year={2014} }'
chicago: Awerbuch, Baruch, Andrea W. Richa, Christian Scheideler, Stefan Schmid,
and Jin Zhang. “Principles of Robust Medium Access and an Application to Leader
Election.” Transactions on Algorithms, no. 4 (2014). https://doi.org/10.1145/2635818.
ieee: B. Awerbuch, A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Principles
of Robust Medium Access and an Application to Leader Election,” Transactions
on Algorithms, no. 4, 2014.
mla: Awerbuch, Baruch, et al. “Principles of Robust Medium Access and an Application
to Leader Election.” Transactions on Algorithms, no. 4, ACM, 2014, doi:10.1145/2635818.
short: B. Awerbuch, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, Transactions
on Algorithms (2014).
date_created: 2017-10-17T12:42:07Z
date_updated: 2022-01-06T06:59:47Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2635818
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:02:33Z
date_updated: 2018-03-20T07:02:33Z
file_id: '1388'
file_name: 387-a24-awerbuch_2_.pdf
file_size: 521454
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:02:33Z
has_accepted_license: '1'
issue: '4'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Transactions on Algorithms
publisher: ACM
status: public
title: Principles of Robust Medium Access and an Application to Leader Election
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '389'
abstract:
- lang: eng
text: This article presents a new approach for representing and processing abstract
optimization models. Confronted with model and data integration tasks for distributed
Decision Support Systems which are especially composed out of software services,
we describe model constituents such as constraints both structurally and semantically.
Within our approach, typed model constituents can be integrated into complete
models and the instantiation of model constituents itself with data and data models
can be wrapped into semantic software services. Besides others, this supports
the automated generation of adaptors and the search for and composition of services.
The basic idea of our approach is to represent the optimization models as instance
knowledge of different ontologies for both optimization and application domains.
By separating the model expression structure from the goal and constraint conceptualizations
predefined modeling constructs can be reused, where we do not only separate the
model structure from data, but can also abstract the structure from a specific
data model. We present an XML and ontology-query based approach for this separation
and demonstrate the resulting flexible model integration procedure out of reusable
goal and constraint types on a network flow problem.
author:
- first_name: Florian
full_name: Stapel, Florian
last_name: Stapel
- first_name: Lena
full_name: Suhl, Lena
last_name: Suhl
citation:
ama: Stapel F, Suhl L. Ontology-Based Representation of Optimization Models.
Universität Paderborn; 2014.
apa: Stapel, F., & Suhl, L. (2014). Ontology-based Representation of Optimization
Models. Universität Paderborn.
bibtex: '@book{Stapel_Suhl_2014, title={Ontology-based Representation of Optimization
Models}, publisher={Universität Paderborn}, author={Stapel, Florian and Suhl,
Lena}, year={2014} }'
chicago: Stapel, Florian, and Lena Suhl. Ontology-Based Representation of Optimization
Models. Universität Paderborn, 2014.
ieee: F. Stapel and L. Suhl, Ontology-based Representation of Optimization Models.
Universität Paderborn, 2014.
mla: Stapel, Florian, and Lena Suhl. Ontology-Based Representation of Optimization
Models. Universität Paderborn, 2014.
short: F. Stapel, L. Suhl, Ontology-Based Representation of Optimization Models,
Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:07Z
date_updated: 2022-01-06T06:59:49Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:01:29Z
date_updated: 2018-03-20T07:01:29Z
file_id: '1386'
file_name: 389-201x_-_Stapel__Suhl_-_Ontology-based_Representation_of_Optimization_Models.pdf
file_size: 595852
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:01:29Z
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: Ontology-based Representation of Optimization Models
type: report
user_id: '15504'
year: '2014'
...
---
_id: '390'
abstract:
- lang: eng
text: 'In software markets of the future, customer-specific software will be developed
on demand based on distributed software and hardware services. Based on a customer-specific
request, available service offers have to be discovered and composed into sophisticated
IT services that fulfill the customer''s request.A prerequisite of this vision
are rich service descriptions, which comprise structural as well as behavioral
aspects of the services, otherwise an accurate service discovery and composition
is not possible. However, automatic matching of service requests and offers specified
in rich service descriptions for the purpose of service discovery is a complex
task, due to the multifaceted heterogeneity of the service partners. This heterogeneity
includes the use of different specification languages, different underlying ontologies,
or different levels of granularity in the specification itself.In this article,
we present a comprehensive approach for service discovery and composition, which
overcomes the underlying heterogeneity of the service partners. Based on a realistic
case study of our industrial partner from the e-tourism domain, we first introduce
an automatic matching mechanism for service requests and offers specified in a
rich service description language. In addition, we propose an automatic service
composition approach, which determines possible service compositions by composing
the 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
citation:
ama: 'Huma Z, Gerth C, Engels G. On-the-Fly Computing: Automatic Service Discovery
and Composition in Heterogeneous Domains. Computer Science - Research and Development.
2014;(3-4):333-361. doi:10.1007/s00450-014-0254-z'
apa: 'Huma, Z., Gerth, C., & Engels, G. (2014). On-the-Fly Computing: Automatic
Service Discovery and Composition in Heterogeneous Domains. Computer Science
- Research and Development, (3–4), 333–361. https://doi.org/10.1007/s00450-014-0254-z'
bibtex: '@article{Huma_Gerth_Engels_2014, title={On-the-Fly Computing: Automatic
Service Discovery and Composition in Heterogeneous Domains}, DOI={10.1007/s00450-014-0254-z},
number={3–4}, journal={Computer Science - Research and Development}, publisher={Springer},
author={Huma, Zille and Gerth, Christian and Engels, Gregor}, year={2014}, pages={333–361}
}'
chicago: 'Huma, Zille, Christian Gerth, and Gregor Engels. “On-the-Fly Computing:
Automatic Service Discovery and Composition in Heterogeneous Domains.” Computer
Science - Research and Development, no. 3–4 (2014): 333–61. https://doi.org/10.1007/s00450-014-0254-z.'
ieee: 'Z. Huma, C. Gerth, and G. Engels, “On-the-Fly Computing: Automatic Service
Discovery and Composition in Heterogeneous Domains,” Computer Science - Research
and Development, no. 3–4, pp. 333–361, 2014.'
mla: 'Huma, Zille, et al. “On-the-Fly Computing: Automatic Service Discovery and
Composition in Heterogeneous Domains.” Computer Science - Research and Development,
no. 3–4, Springer, 2014, pp. 333–61, doi:10.1007/s00450-014-0254-z.'
short: Z. Huma, C. Gerth, G. Engels, Computer Science - Research and Development
(2014) 333–361.
date_created: 2017-10-17T12:42:08Z
date_updated: 2022-01-06T06:59:52Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.1007/s00450-014-0254-z
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:00:58Z
date_updated: 2018-03-20T07:00:58Z
file_id: '1385'
file_name: 390-HGE14.pdf
file_size: 4644980
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:00:58Z
has_accepted_license: '1'
issue: 3-4
language:
- iso: eng
page: 333-361
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: Computer Science - Research and Development
publisher: Springer
status: public
title: 'On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous
Domains'
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '391'
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
citation:
ama: Feldkord B. On Variants of the Page Migration Problem. Universität Paderborn;
2014.
apa: Feldkord, B. (2014). On Variants of the Page Migration Problem. Universität
Paderborn.
bibtex: '@book{Feldkord_2014, title={On Variants of the Page Migration Problem},
publisher={Universität Paderborn}, author={Feldkord, Björn}, year={2014} }'
chicago: Feldkord, Björn. On Variants of the Page Migration Problem. Universität
Paderborn, 2014.
ieee: B. Feldkord, On Variants of the Page Migration Problem. Universität
Paderborn, 2014.
mla: Feldkord, Björn. On Variants of the Page Migration Problem. Universität
Paderborn, 2014.
short: B. Feldkord, On Variants of the Page Migration Problem, Universität Paderborn,
2014.
date_created: 2017-10-17T12:42:08Z
date_updated: 2022-01-06T06:59:54Z
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: On Variants of the Page Migration Problem
type: mastersthesis
user_id: '477'
year: '2014'
...
---
_id: '18001'
author:
- first_name: Linghui
full_name: Luo, Linghui
last_name: Luo
citation:
ama: Luo L. Ein Selbst-Stabilisierender Algorithmus Für Das Finite Sleep Problem
in Skip+ Graphen. Universität Paderborn; 2014.
apa: Luo, L. (2014). Ein selbst-stabilisierender Algorithmus für das Finite Sleep
Problem in Skip+ Graphen. Universität Paderborn.
bibtex: '@book{Luo_2014, title={Ein selbst-stabilisierender Algorithmus für das
Finite Sleep Problem in Skip+ Graphen}, publisher={Universität Paderborn}, author={Luo,
Linghui}, year={2014} }'
chicago: Luo, Linghui. Ein Selbst-Stabilisierender Algorithmus Für Das Finite
Sleep Problem in Skip+ Graphen. Universität Paderborn, 2014.
ieee: L. Luo, Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem
in Skip+ Graphen. Universität Paderborn, 2014.
mla: Luo, Linghui. Ein Selbst-Stabilisierender Algorithmus Für Das Finite Sleep
Problem in Skip+ Graphen. Universität Paderborn, 2014.
short: L. Luo, Ein Selbst-Stabilisierender Algorithmus Für Das Finite Sleep Problem
in Skip+ Graphen, Universität Paderborn, 2014.
date_created: 2020-08-17T08:16:07Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+
Graphen
type: bachelorsthesis
user_id: '477'
year: '2014'
...
---
_id: '441'
abstract:
- lang: eng
text: Das Future Internet soll den Anforderungen heutiger und zuk{\"u}nftiger daten-intensiver
Internet-Anwendungen besser gerecht werden als dies heute der Fall ist. Seit einigen
Jahren wird an unterschiedlichen Verfahren geforscht, die das „Future Internet“
erm{\"o}glichen sollen – diese Ans{\"a}tze gehen weit {\"u}ber die Ziele von IPv6
hinaus. In diesem Beitrag stellen wir einige Kernpunkte der Future-Internet-Initiativen
vor und identifizieren Gemeinsamkeiten der unterschiedlichen Konzepte. Wir beleuchten
die Konsequenzen aus datenschutzrechtlicher Sicht und geben einen {\"U}berblick
{\"u}ber Ans{\"a}tze, die die identifizierten Datenschutz-Probleme durch technische
Maßnahmen bis zu einem gewissen Grad verhindern.
author:
- first_name: Christoph
full_name: Sorge, Christoph
last_name: Sorge
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
citation:
ama: 'Sorge C, Petrlic R. Datenschutz im Future Internet: rechtliche Aspekte und
technische Maßnahmen. In: Tagungsband Des 17. Internationalen Rechtsinformatik
Symposions. ; 2014.'
apa: 'Sorge, C., & Petrlic, R. (2014). Datenschutz im Future Internet: rechtliche
Aspekte und technische Maßnahmen. In Tagungsband des 17. Internationalen Rechtsinformatik
Symposions.'
bibtex: '@inproceedings{Sorge_Petrlic_2014, title={Datenschutz im Future Internet:
rechtliche Aspekte und technische Maßnahmen}, booktitle={Tagungsband des 17. Internationalen
Rechtsinformatik Symposions}, author={Sorge, Christoph and Petrlic, Ronald}, year={2014}
}'
chicago: 'Sorge, Christoph, and Ronald Petrlic. “Datenschutz Im Future Internet:
Rechtliche Aspekte Und Technische Maßnahmen.” In Tagungsband Des 17. Internationalen
Rechtsinformatik Symposions, 2014.'
ieee: 'C. Sorge and R. Petrlic, “Datenschutz im Future Internet: rechtliche Aspekte
und technische Maßnahmen,” in Tagungsband des 17. Internationalen Rechtsinformatik
Symposions, 2014.'
mla: 'Sorge, Christoph, and Ronald Petrlic. “Datenschutz Im Future Internet: Rechtliche
Aspekte Und Technische Maßnahmen.” Tagungsband Des 17. Internationalen Rechtsinformatik
Symposions, 2014.'
short: 'C. Sorge, R. Petrlic, in: Tagungsband Des 17. Internationalen Rechtsinformatik
Symposions, 2014.'
date_created: 2017-10-17T12:42:17Z
date_updated: 2022-01-06T07:01:02Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:29:22Z
date_updated: 2018-03-16T11:29:22Z
file_id: '1352'
file_name: 441-sorge-petrlic-iris2014_01.pdf
file_size: 207583
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:29:22Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Tagungsband des 17. Internationalen Rechtsinformatik Symposions
status: public
title: 'Datenschutz im Future Internet: rechtliche Aspekte und technische Maßnahmen'
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '442'
abstract:
- lang: eng
text: We present a new transformation of chosen-plaintext secure predicate encryption
schemes with public index into chosen-ciphertext secure schemes. Our construction
requires only a universal one-way hash function and is selectively secure in the
standard model. The transformation is not generic but can be applied to various
existing schemes constructed from bilinear groups. Using common structural properties
of these schemes we provide an efficient and simple transformation without overhead
in form of one-time signatures or message authentication codes as required in
the known generic transformations.
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. Constructing CCA-secure predicate encapsulation schemes
from CPA-secure schemes and universal one-way hash functions. 2014.
apa: Blömer, J., & Liske, G. (2014). Constructing CCA-secure predicate encapsulation
schemes from CPA-secure schemes and universal one-way hash functions. Universität
Paderborn.
bibtex: '@article{Blömer_Liske_2014, title={Constructing CCA-secure predicate encapsulation
schemes from CPA-secure schemes and universal one-way hash functions}, publisher={Universität
Paderborn}, author={Blömer, Johannes and Liske, Gennadij}, year={2014} }'
chicago: Blömer, Johannes, and Gennadij Liske. “Constructing CCA-Secure Predicate
Encapsulation Schemes from CPA-Secure Schemes and Universal One-Way Hash Functions.”
Universität Paderborn, 2014.
ieee: J. Blömer and G. Liske, “Constructing CCA-secure predicate encapsulation schemes
from CPA-secure schemes and universal one-way hash functions.” Universität Paderborn,
2014.
mla: Blömer, Johannes, and Gennadij Liske. Constructing CCA-Secure Predicate
Encapsulation Schemes from CPA-Secure Schemes and Universal One-Way Hash Functions.
Universität Paderborn, 2014.
short: J. Blömer, G. Liske, (2014).
date_created: 2017-10-17T12:42:18Z
date_updated: 2022-01-06T07:01:03Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:28:34Z
date_updated: 2018-03-16T11:28:34Z
file_id: '1351'
file_name: 442-P-KEM.pdf
file_size: 377945
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:28:34Z
has_accepted_license: '1'
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2014/511.pdf
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: Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes
and universal one-way hash functions
type: preprint
user_id: '25078'
year: '2014'
...
---
_id: '443'
abstract:
- lang: eng
text: The objective of this paper is to analyze the formation of group structures
where individuals are allowed to engage in several groups at the same time. These
structures are interpreted here as social networks. Each of the groups is supposed
to have specific rules or constitutions governing which members may join or leave
it. A social network is then considered to be stable if none of the groups is
altered any more. Given this framework, we not only analyze which influence the
constitutions have on network formation but we also provide requirements under
which stable networks are induced for sure. Furthermore, by embedding many-to-many
matchings into our setting, we apply our model to job markets with labor unions.
To some extent the unions may provide job guarantees and, therefore, have influence
on the stability of the job market.
author:
- first_name: Ana
full_name: Mauleon, Ana
last_name: Mauleon
- first_name: Nils
full_name: Röhl, Nils
last_name: Röhl
- first_name: Vincent
full_name: Vannetelbosch, Vincent
last_name: Vannetelbosch
citation:
ama: Mauleon A, Röhl N, Vannetelbosch V. Constitutions and Social Networks.
Universität Paderborn; 2014.
apa: Mauleon, A., Röhl, N., & Vannetelbosch, V. (2014). Constitutions and
Social Networks. Universität Paderborn.
bibtex: '@book{Mauleon_Röhl_Vannetelbosch_2014, title={Constitutions and Social
Networks}, publisher={Universität Paderborn}, author={Mauleon, Ana and Röhl, Nils
and Vannetelbosch, Vincent}, year={2014} }'
chicago: Mauleon, Ana, Nils Röhl, and Vincent Vannetelbosch. Constitutions and
Social Networks. Universität Paderborn, 2014.
ieee: A. Mauleon, N. Röhl, and V. Vannetelbosch, Constitutions and Social Networks.
Universität Paderborn, 2014.
mla: Mauleon, Ana, et al. Constitutions and Social Networks. Universität
Paderborn, 2014.
short: A. Mauleon, N. Röhl, V. Vannetelbosch, Constitutions and Social Networks,
Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:18Z
date_updated: 2022-01-06T07:01:03Z
ddc:
- '040'
department:
- _id: '205'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:28:04Z
date_updated: 2018-03-16T11:28:04Z
file_id: '1350'
file_name: 443-WP74.pdf
file_size: 409720
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:28:04Z
has_accepted_license: '1'
language:
- iso: eng
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: Constitutions and Social Networks
type: report
user_id: '477'
year: '2014'
...
---
_id: '444'
abstract:
- lang: eng
text: BackgroundMedical nonpersistence is a worldwide problem of striking magnitude.
Although many fields of studies including epidemiology, sociology, and psychology
try to identify determinants for medical nonpersistence, comprehensive research
to explain medical nonpersistence from an economics perspective is rather scarce.ObjectivesThe
aim of the study was to develop a conceptual framework that augments standard
economic choice theory with psychological concepts of behavioral economics to
understand how patients’ preferences for discontinuing with therapy arise over
the course of the medical treatment. The availability of such a framework allows
the targeted design of mechanisms for intervention strategies.MethodsOur conceptual
framework models the patient as an active economic agent who evaluates the benefits
and costs for continuing with therapy. We argue that a combination of loss aversion
and mental accounting operations explains why patients discontinue with therapy
at a specific point in time. We designed a randomized laboratory economic experiment
with a student subject pool to investigate the behavioral predictions.ResultsSubjects
continue with therapy as long as experienced utility losses have to be compensated.
As soon as previous losses are evened out, subjects perceive the marginal benefit
of persistence lower than in the beginning of the treatment. Consequently, subjects
start to discontinue with therapy.ConclusionsOur results highlight that concepts
of behavioral economics capture the dynamic structure of medical nonpersistence
better than does standard economic choice theory. We recommend that behavioral
economics should be a mandatory part of the development of possible intervention
strategies aimed at improving patients’ compliance and persistence behavior.
author:
- first_name: Behnud
full_name: Mir Djawadi, Behnud
id: '26032'
last_name: Mir Djawadi
orcid: 0000-0002-6271-5912
- first_name: Rene
full_name: Fahr, Rene
id: '111'
last_name: Fahr
- first_name: Florian
full_name: Turk, Florian
last_name: Turk
citation:
ama: Mir Djawadi B, Fahr R, Turk F. Conceptual Model and Economic Experiments to
Explain Nonpersistence and Enable Mechanism Designs Fosterin Behavioral Change.
Value in Health. 2014;(8):814-822. doi:10.1016/j.jval.2014.08.2669
apa: Mir Djawadi, B., Fahr, R., & Turk, F. (2014). Conceptual Model and Economic
Experiments to Explain Nonpersistence and Enable Mechanism Designs Fosterin Behavioral
Change. Value in Health, (8), 814–822. https://doi.org/10.1016/j.jval.2014.08.2669
bibtex: '@article{Mir Djawadi_Fahr_Turk_2014, title={Conceptual Model and Economic
Experiments to Explain Nonpersistence and Enable Mechanism Designs Fosterin Behavioral
Change}, DOI={10.1016/j.jval.2014.08.2669},
number={8}, journal={Value in Health}, publisher={Elsevier}, author={Mir Djawadi,
Behnud and Fahr, Rene and Turk, Florian}, year={2014}, pages={814–822} }'
chicago: 'Mir Djawadi, Behnud, Rene Fahr, and Florian Turk. “Conceptual Model and
Economic Experiments to Explain Nonpersistence and Enable Mechanism Designs Fosterin
Behavioral Change.” Value in Health, no. 8 (2014): 814–22. https://doi.org/10.1016/j.jval.2014.08.2669.'
ieee: B. Mir Djawadi, R. Fahr, and F. Turk, “Conceptual Model and Economic Experiments
to Explain Nonpersistence and Enable Mechanism Designs Fosterin Behavioral Change,”
Value in Health, no. 8, pp. 814–822, 2014.
mla: Mir Djawadi, Behnud, et al. “Conceptual Model and Economic Experiments to Explain
Nonpersistence and Enable Mechanism Designs Fosterin Behavioral Change.” Value
in Health, no. 8, Elsevier, 2014, pp. 814–22, doi:10.1016/j.jval.2014.08.2669.
short: B. Mir Djawadi, R. Fahr, F. Turk, Value in Health (2014) 814–822.
date_created: 2017-10-17T12:42:18Z
date_updated: 2022-01-06T07:01:04Z
ddc:
- '000'
department:
- _id: '179'
doi: 10.1016/j.jval.2014.08.2669
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:44:35Z
date_updated: 2018-11-02T15:44:35Z
file_id: '5311'
file_name: DjawadiFahr.pdf
file_size: 716934
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:44:35Z
has_accepted_license: '1'
issue: '8'
language:
- iso: eng
page: 814-822
project:
- _id: '1'
name: SFB 901
- _id: '8'
name: SFB 901 - Subprojekt A4
- _id: '2'
name: SFB 901 - Project Area A
publication: Value in Health
publisher: Elsevier
status: public
title: Conceptual Model and Economic Experiments to Explain Nonpersistence and Enable
Mechanism Designs Fosterin Behavioral Change
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '445'
abstract:
- lang: eng
text: We consider the inner core as a solution concept for cooperative games with
non-transferable utility (NTU) and its relationship to payoffs of competitive
equilibria of markets that are induced by NTU games. An NTU game is an NTU market
game if there exists a market such that the set of utility allocations a coalition
can achieve in the market coincides with the set of utility allocations the coalition
can achieve in the game. In this paper, we introduce a new construction of a market
based on a closed subset of the inner core which satisfies a strict positive separability.
We show that the constructed market represents the NTU game and, further, has
the given closed set as the set of payoff vectors of competitive equilibria. It
turns out that this market is not uniquely determined, and thus, we obtain a class
of markets. Our results generalize those relating to competitive outcomes of NTU
market games in the literature.
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. Competitive outcomes and the inner core of NTU market
games. Economic Theory. 2014;(3):529-554. doi:10.1007/s00199-014-0846-7
apa: Brangewitz, S., & Gamp, J.-P. (2014). Competitive outcomes and the inner
core of NTU market games. Economic Theory, (3), 529–554. https://doi.org/10.1007/s00199-014-0846-7
bibtex: '@article{Brangewitz_Gamp_2014, title={Competitive outcomes and the inner
core of NTU market games}, DOI={10.1007/s00199-014-0846-7},
number={3}, journal={Economic Theory}, publisher={Springer}, author={Brangewitz,
Sonja and Gamp, Jan-Philip}, year={2014}, pages={529–554} }'
chicago: 'Brangewitz, Sonja, and Jan-Philip Gamp. “Competitive Outcomes and the
Inner Core of NTU Market Games.” Economic Theory, no. 3 (2014): 529–54.
https://doi.org/10.1007/s00199-014-0846-7.'
ieee: S. Brangewitz and J.-P. Gamp, “Competitive outcomes and the inner core of
NTU market games,” Economic Theory, no. 3, pp. 529–554, 2014.
mla: Brangewitz, Sonja, and Jan-Philip Gamp. “Competitive Outcomes and the Inner
Core of NTU Market Games.” Economic Theory, no. 3, Springer, 2014, pp.
529–54, doi:10.1007/s00199-014-0846-7.
short: S. Brangewitz, J.-P. Gamp, Economic Theory (2014) 529–554.
date_created: 2017-10-17T12:42:18Z
date_updated: 2022-01-06T07:01:04Z
ddc:
- '040'
department:
- _id: '205'
doi: 10.1007/s00199-014-0846-7
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:27:32Z
date_updated: 2018-03-16T11:27:32Z
file_id: '1349'
file_name: 445-Brangewitz_and_Gamp__2014__-_Competitive_outcomes_and_the_inner_core_of_NTU_market_games.pdf
file_size: 391317
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:27:32Z
has_accepted_license: '1'
issue: '3'
language:
- iso: eng
page: 529-554
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Economic Theory
publisher: Springer
status: public
title: Competitive outcomes and the inner core of NTU market games
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '446'
abstract:
- lang: eng
text: 'This paper considers the problem of how to efficiently share a wireless medium
which is subject to harsh external interference or even jamming. While this problem
has already been studied intensively for simplistic single-hop or unit disk graph
models, we make a leap forward and study MAC protocols for the SINR interference
model (a.k.a. the physical model). We make two contributions. First, we introduce
a new adversarial SINR model which captures a wide range of interference phenomena.
Concretely, we consider a powerful, adaptive adversary which can jam nodes at
arbitrary times and which is only limited by some energy budget. The second contribution
of this paper is a distributed MAC protocol which provably achieves a constant
competitive throughput in this environment: we show that, with high probability,
the protocol ensures that a constant fraction of the non-blocked time periods
is used for successful transmissions.'
author:
- first_name: Adrian
full_name: Ogierman, Adrian
last_name: Ogierman
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'Ogierman A, Richa AW, Scheideler C, Schmid S, Zhang J. Competitive MAC under
adversarial SINR. In: Proceedings of the 33rd Annual IEEE International Conference
on Computer Communications (INFOCOM). ; 2014:2751--2759. doi:10.1109/INFOCOM.2014.6848224'
apa: Ogierman, A., Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2014).
Competitive MAC under adversarial SINR. In Proceedings of the 33rd Annual IEEE
International Conference on Computer Communications (INFOCOM) (pp. 2751--2759).
https://doi.org/10.1109/INFOCOM.2014.6848224
bibtex: '@inproceedings{Ogierman_Richa_Scheideler_Schmid_Zhang_2014, title={Competitive
MAC under adversarial SINR}, DOI={10.1109/INFOCOM.2014.6848224},
booktitle={Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM)}, author={Ogierman, Adrian and Richa, Andrea W. and Scheideler,
Christian and Schmid, Stefan and Zhang, Jin}, year={2014}, pages={2751--2759}
}'
chicago: Ogierman, Adrian, Andrea W. Richa, Christian Scheideler, Stefan Schmid,
and Jin Zhang. “Competitive MAC under Adversarial SINR.” In Proceedings of
the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM),
2751--2759, 2014. https://doi.org/10.1109/INFOCOM.2014.6848224.
ieee: A. Ogierman, A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive
MAC under adversarial SINR,” in Proceedings of the 33rd Annual IEEE International
Conference on Computer Communications (INFOCOM), 2014, pp. 2751--2759.
mla: Ogierman, Adrian, et al. “Competitive MAC under Adversarial SINR.” Proceedings
of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM),
2014, pp. 2751--2759, doi:10.1109/INFOCOM.2014.6848224.
short: 'A. Ogierman, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings
of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM),
2014, pp. 2751--2759.'
date_created: 2017-10-17T12:42:18Z
date_updated: 2022-01-06T07:01:05Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/INFOCOM.2014.6848224
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:27:04Z
date_updated: 2018-03-16T11:27:04Z
file_id: '1348'
file_name: 446-infocom14_01.pdf
file_size: 378095
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:27:04Z
has_accepted_license: '1'
page: 2751--2759
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 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM)
status: public
title: Competitive MAC under adversarial SINR
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '447'
abstract:
- lang: eng
text: Automatic service composition is still a challengingtask. It is even more
challenging when dealing witha dynamic market of services for end users. New servicesmay
enter the market while other services are completelyremoved. Furthermore, end
users are typically no experts in thedomain in which they formulate a request.
As a consequence,ambiguous user requests will inevitably emerge and have tobe
taken into account. To meet these challenges, we proposea new approach that combines
automatic service compositionwith adaptive service recommendation. A best first
backwardsearch algorithm produces solutions that are functional correctwith respect
to user requests. An adaptive recommendationsystem supports the search algorithm
in decision-making.Reinforcement Learning techniques enable the system to adjustits
recommendation strategy over time based on user ratings.The integrated approach
is described on a conceptional leveland demonstrated by means of an illustrative
example fromthe image processing domain.
author:
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Bernd
full_name: Kleinjohann, Bernd
last_name: Kleinjohann
citation:
ama: 'Jungmann A, Mohr F, Kleinjohann B. Combining Automatic Service Composition
with Adaptive Service Recommendation for Dynamic Markets of Services. In: Proceedings
of the 10th World Congress on Services (SERVICES). ; 2014:346-353. doi:10.1109/SERVICES.2014.68'
apa: Jungmann, A., Mohr, F., & Kleinjohann, B. (2014). Combining Automatic Service
Composition with Adaptive Service Recommendation for Dynamic Markets of Services.
In Proceedings of the 10th World Congress on Services (SERVICES) (pp. 346–353).
https://doi.org/10.1109/SERVICES.2014.68
bibtex: '@inproceedings{Jungmann_Mohr_Kleinjohann_2014, title={Combining Automatic
Service Composition with Adaptive Service Recommendation for Dynamic Markets of
Services}, DOI={10.1109/SERVICES.2014.68},
booktitle={Proceedings of the 10th World Congress on Services (SERVICES)}, author={Jungmann,
Alexander and Mohr, Felix and Kleinjohann, Bernd}, year={2014}, pages={346–353}
}'
chicago: Jungmann, Alexander, Felix Mohr, and Bernd Kleinjohann. “Combining Automatic
Service Composition with Adaptive Service Recommendation for Dynamic Markets of
Services.” In Proceedings of the 10th World Congress on Services (SERVICES),
346–53, 2014. https://doi.org/10.1109/SERVICES.2014.68.
ieee: A. Jungmann, F. Mohr, and B. Kleinjohann, “Combining Automatic Service Composition
with Adaptive Service Recommendation for Dynamic Markets of Services,” in Proceedings
of the 10th World Congress on Services (SERVICES), 2014, pp. 346–353.
mla: Jungmann, Alexander, et al. “Combining Automatic Service Composition with Adaptive
Service Recommendation for Dynamic Markets of Services.” Proceedings of the
10th World Congress on Services (SERVICES), 2014, pp. 346–53, doi:10.1109/SERVICES.2014.68.
short: 'A. Jungmann, F. Mohr, B. Kleinjohann, in: Proceedings of the 10th World
Congress on Services (SERVICES), 2014, pp. 346–353.'
date_created: 2017-10-17T12:42:19Z
date_updated: 2022-01-06T07:01:06Z
ddc:
- '040'
department:
- _id: '355'
doi: 10.1109/SERVICES.2014.68
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:26:36Z
date_updated: 2018-03-16T11:26:36Z
file_id: '1347'
file_name: 447-_FINAL__Combining_Automatic_Service_Composition_with_Adaptive_Service_Recommendation_for_Dynamic_Markets_of_Services.pdf
file_size: 429462
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:26:36Z
has_accepted_license: '1'
language:
- iso: eng
page: 346-353
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 10th World Congress on Services (SERVICES)
status: public
title: Combining Automatic Service Composition with Adaptive Service Recommendation
for Dynamic Markets of Services
type: conference
user_id: '477'
year: '2014'
...
---
_id: '448'
author:
- first_name: Yuan
full_name: Gao, Yuan
last_name: Gao
citation:
ama: Gao Y. Combination of Service Matching Steps in Consideration of Efficiency
and Fuzziness. Universität Paderborn; 2014.
apa: Gao, Y. (2014). Combination of Service Matching Steps in Consideration of
Efficiency and Fuzziness. Universität Paderborn.
bibtex: '@book{Gao_2014, title={Combination of Service Matching Steps in Consideration
of Efficiency and Fuzziness}, publisher={Universität Paderborn}, author={Gao,
Yuan}, year={2014} }'
chicago: Gao, Yuan. Combination of Service Matching Steps in Consideration of
Efficiency and Fuzziness. Universität Paderborn, 2014.
ieee: Y. Gao, Combination of Service Matching Steps in Consideration of Efficiency
and Fuzziness. Universität Paderborn, 2014.
mla: Gao, Yuan. Combination of Service Matching Steps in Consideration of Efficiency
and Fuzziness. Universität Paderborn, 2014.
short: Y. Gao, Combination of Service Matching Steps in Consideration of Efficiency
and Fuzziness, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:19Z
date_updated: 2022-01-06T07:01:06Z
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: Combination of Service Matching Steps in Consideration of Efficiency and Fuzziness
type: mastersthesis
user_id: '15504'
year: '2014'
...
---
_id: '449'
abstract:
- lang: eng
text: Cloud computing resulted in a continuously growing number of provided software
services to be used by consumers. Brokers discover services that fit best to consumers'
requirements by matching Qualityof-Service (QoS) properties. In order to negotiate
Service-Level Agreements (SLAs), a provider has to determine the provided QoS
based on QoS analyses. However, the risk for the provider to violate the SLA is
high as the service's actual quality can deviate from the specified QoS due to
uncertainties that occur during the provider's quality analysis. In this paper,
we discuss current software engineering paradigms like cloud computing and service-oriented
computing with respect to the amount of uncertainty they induce into service matching
and SLA negotiations. As a result, we explain, why cloud computing reduces such
uncertainties.
author:
- first_name: Matthias
full_name: Becker, Matthias
last_name: Becker
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
citation:
ama: 'Becker M, Platenius MC, Becker S. Cloud Computing Reduces Uncertainties in
Quality-of-Service Matching! In: Proceedings of the 2nd International Workshop
on Cloud Service Brokerage (CSB). Communications in Computer and Information
Science. ; 2014:153-159. doi:10.1007/978-3-319-14886-1_15'
apa: Becker, M., Platenius, M. C., & Becker, S. (2014). Cloud Computing Reduces
Uncertainties in Quality-of-Service Matching! In Proceedings of the 2nd International
Workshop on Cloud Service Brokerage (CSB) (pp. 153–159). https://doi.org/10.1007/978-3-319-14886-1_15
bibtex: '@inproceedings{Becker_Platenius_Becker_2014, series={Communications in
Computer and Information Science}, title={Cloud Computing Reduces Uncertainties
in Quality-of-Service Matching!}, DOI={10.1007/978-3-319-14886-1_15},
booktitle={Proceedings of the 2nd International Workshop on Cloud Service Brokerage
(CSB)}, author={Becker, Matthias and Platenius, Marie Christin and Becker, Steffen},
year={2014}, pages={153–159}, collection={Communications in Computer and Information
Science} }'
chicago: Becker, Matthias, Marie Christin Platenius, and Steffen Becker. “Cloud
Computing Reduces Uncertainties in Quality-of-Service Matching!” In Proceedings
of the 2nd International Workshop on Cloud Service Brokerage (CSB), 153–59.
Communications in Computer and Information Science, 2014. https://doi.org/10.1007/978-3-319-14886-1_15.
ieee: M. Becker, M. C. Platenius, and S. Becker, “Cloud Computing Reduces Uncertainties
in Quality-of-Service Matching!,” in Proceedings of the 2nd International Workshop
on Cloud Service Brokerage (CSB), 2014, pp. 153–159.
mla: Becker, Matthias, et al. “Cloud Computing Reduces Uncertainties in Quality-of-Service
Matching!” Proceedings of the 2nd International Workshop on Cloud Service Brokerage
(CSB), 2014, pp. 153–59, doi:10.1007/978-3-319-14886-1_15.
short: 'M. Becker, M.C. Platenius, S. Becker, in: Proceedings of the 2nd International
Workshop on Cloud Service Brokerage (CSB), 2014, pp. 153–159.'
date_created: 2017-10-17T12:42:19Z
date_updated: 2022-01-06T07:01:06Z
ddc:
- '040'
department:
- _id: '76'
doi: 10.1007/978-3-319-14886-1_15
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:26:04Z
date_updated: 2018-03-16T11:26:04Z
file_id: '1346'
file_name: 449-CSB2014_01.pdf
file_size: 362248
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:26:04Z
has_accepted_license: '1'
language:
- iso: eng
page: 153-159
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '9'
name: SFB 901 - Subproject B1
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 2nd International Workshop on Cloud Service Brokerage
(CSB)
series_title: Communications in Computer and Information Science
status: public
title: Cloud Computing Reduces Uncertainties in Quality-of-Service Matching!
type: conference
user_id: '477'
year: '2014'
...
---
_id: '450'
abstract:
- lang: eng
text: 'Configurable program analysis (CPA) is a generic concept for the formalization
of different software analysis techniques in a single framework. With the tool
CPAchecker, this framework allows for an easy configuration and subsequent automatic
execution of analysis procedures ranging from data-flow analysis to model checking.
The focus of the tool CPAchecker is thus on analysis. In this paper, we study
configurability from the point of view of software certification. Certification
aims at providing (via a prior analysis) a certificate of correctness for a program
which is (a) tamper-proof and (b) more efficient to check for validity than a
full analysis. Here, we will show how, given an analysis instance of a CPA, to
construct a corresponding sound certification instance, thereby arriving at configurable
program certification. We report on experiments with certification based on different
analysis techniques, and in particular explain which characteristics of an underlying
analysis allow us to design an efficient (in the above (b) sense) certification
procedure. '
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Jakobs M-C, Wehrheim H. Certification for Configurable Program Analysis. In:
Proceedings of the 21st International Symposium on Model Checking of Software
(SPIN). SPIN 2014. ; 2014:30-39. doi:10.1145/2632362.2632372'
apa: Jakobs, M.-C., & Wehrheim, H. (2014). Certification for Configurable Program
Analysis. In Proceedings of the 21st International Symposium on Model Checking
of Software (SPIN) (pp. 30–39). https://doi.org/10.1145/2632362.2632372
bibtex: '@inproceedings{Jakobs_Wehrheim_2014, series={SPIN 2014}, title={Certification
for Configurable Program Analysis}, DOI={10.1145/2632362.2632372},
booktitle={Proceedings of the 21st International Symposium on Model Checking of
Software (SPIN)}, author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2014},
pages={30–39}, collection={SPIN 2014} }'
chicago: Jakobs, Marie-Christine, and Heike Wehrheim. “Certification for Configurable
Program Analysis.” In Proceedings of the 21st International Symposium on Model
Checking of Software (SPIN), 30–39. SPIN 2014, 2014. https://doi.org/10.1145/2632362.2632372.
ieee: M.-C. Jakobs and H. Wehrheim, “Certification for Configurable Program Analysis,”
in Proceedings of the 21st International Symposium on Model Checking of Software
(SPIN), 2014, pp. 30–39.
mla: Jakobs, Marie-Christine, and Heike Wehrheim. “Certification for Configurable
Program Analysis.” Proceedings of the 21st International Symposium on Model
Checking of Software (SPIN), 2014, pp. 30–39, doi:10.1145/2632362.2632372.
short: 'M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 21st International Symposium
on Model Checking of Software (SPIN), 2014, pp. 30–39.'
date_created: 2017-10-17T12:42:19Z
date_updated: 2022-01-06T07:01:07Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1145/2632362.2632372
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:25:35Z
date_updated: 2018-03-16T11:25:35Z
file_id: '1345'
file_name: 450-p30-jakobs.pdf
file_size: 487366
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:25:35Z
has_accepted_license: '1'
language:
- iso: eng
page: 30-39
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 21st International Symposium on Model Checking of
Software (SPIN)
series_title: SPIN 2014
status: public
title: Certification for Configurable Program Analysis
type: conference
user_id: '477'
year: '2014'
...