---
_id: '569'
abstract:
- lang: eng
text: Today's real-time embedded systems operate in frequently changing environments
on which they react by self-adaptations. Such an approach needs adequate modeling
support of these reconfigurations to enable verification of safety properties,
e.g., by timed model checking. Component-based development of such systems realizes
these self-adaptations by structural reconfigurations of components and their
connectors. However, component models proposed in literature do not support reconfigurable
components in real-time embedded context but focus on other domains like business
information systems. In this paper, we present an extension of our modeling language
MechatronicUML to support structural reconfigurations taking the specific requirements
of our domain into account. Based on the proposed extension we outline our research
roadmap to achieve verification and realization of systems modeled in MechatronicUML.
author:
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
- first_name: Christian
full_name: Heinzemann, Christian
last_name: Heinzemann
- first_name: 'Claudia '
full_name: 'Priesterjahn, Claudia '
last_name: Priesterjahn
citation:
ama: 'Becker S, Heinzemann C, Priesterjahn C. Towards Modeling Reconfiguration in
Hierarchical Component Architectures. In: Proceedings of the 15th ACM SigSoft
International Symposium on Component-Based Software Engineering (CBSE). ;
2012:23--28. doi:10.1145/2304736.2304742'
apa: Becker, S., Heinzemann, C., & Priesterjahn, C. (2012). Towards Modeling
Reconfiguration in Hierarchical Component Architectures. In Proceedings of
the 15th ACM SigSoft International Symposium on Component-Based Software Engineering
(CBSE) (pp. 23--28). https://doi.org/10.1145/2304736.2304742
bibtex: '@inproceedings{Becker_Heinzemann_Priesterjahn_2012, title={Towards Modeling
Reconfiguration in Hierarchical Component Architectures}, DOI={10.1145/2304736.2304742},
booktitle={Proceedings of the 15th ACM SigSoft International Symposium on Component-Based
Software Engineering (CBSE)}, author={Becker, Steffen and Heinzemann, Christian
and Priesterjahn, Claudia }, year={2012}, pages={23--28} }'
chicago: Becker, Steffen, Christian Heinzemann, and Claudia Priesterjahn. “Towards
Modeling Reconfiguration in Hierarchical Component Architectures.” In Proceedings
of the 15th ACM SigSoft International Symposium on Component-Based Software Engineering
(CBSE), 23--28, 2012. https://doi.org/10.1145/2304736.2304742.
ieee: S. Becker, C. Heinzemann, and C. Priesterjahn, “Towards Modeling Reconfiguration
in Hierarchical Component Architectures,” in Proceedings of the 15th ACM SigSoft
International Symposium on Component-Based Software Engineering (CBSE), 2012,
pp. 23--28.
mla: Becker, Steffen, et al. “Towards Modeling Reconfiguration in Hierarchical Component
Architectures.” Proceedings of the 15th ACM SigSoft International Symposium
on Component-Based Software Engineering (CBSE), 2012, pp. 23--28, doi:10.1145/2304736.2304742.
short: 'S. Becker, C. Heinzemann, C. Priesterjahn, in: Proceedings of the 15th ACM
SigSoft International Symposium on Component-Based Software Engineering (CBSE),
2012, pp. 23--28.'
date_created: 2017-10-17T12:42:43Z
date_updated: 2022-01-06T07:02:34Z
ddc:
- '040'
doi: 10.1145/2304736.2304742
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:19:12Z
date_updated: 2018-03-15T10:19:12Z
file_id: '1273'
file_name: 569-CBSE12-Becker_Heinzemann_Priesterjahn.pdf
file_size: 139679
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:19:12Z
has_accepted_license: '1'
page: 23--28
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 15th ACM SigSoft International Symposium on Component-Based
Software Engineering (CBSE)
status: public
title: Towards Modeling Reconfiguration in Hierarchical Component Architectures
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '570'
abstract:
- lang: eng
text: 'This article studies the construction of self-stabilizing topologies for
distributed systems. While recent research has focused on chain topologies where
nodes need to be linearized with respect to their identiers, we explore a natural
and relevant 2-dimensional generalization. In particular, we present a local self-stabilizing
algorithm DStab which is based on the concept of \local Delaunay graphs" and which
forwards temporary edges in greedy fashion reminiscent of compass routing. DStab
constructs a Delaunay graph from any initial connected topology and in a distributed
manner in time O(n3) in the worst-case; if the initial network contains the Delaunay
graph, the convergence time is only O(n) rounds. DStab also ensures that individual
node joins and leaves aect a small part of the network only. Such self-stabilizing
Delaunay networks have interesting applications and our construction gives insights
into the necessary geometric reasoning that is required for higherdimensional
linearization problems.Keywords: Distributed Algorithms, Topology Control, Social
Networks'
author:
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Stephan
full_name: Ritscher, Stephan
last_name: Ritscher
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Jacob R, Ritscher S, Scheideler C, Schmid S. Towards higher-dimensional topological
self-stabilization: A distributed algorithm for Delaunay graphs. Theoretical
Computer Science. 2012:137-148. doi:10.1016/j.tcs.2012.07.029'
apa: 'Jacob, R., Ritscher, S., Scheideler, C., & Schmid, S. (2012). Towards
higher-dimensional topological self-stabilization: A distributed algorithm for
Delaunay graphs. Theoretical Computer Science, 137–148. https://doi.org/10.1016/j.tcs.2012.07.029'
bibtex: '@article{Jacob_Ritscher_Scheideler_Schmid_2012, title={Towards higher-dimensional
topological self-stabilization: A distributed algorithm for Delaunay graphs},
DOI={10.1016/j.tcs.2012.07.029},
journal={Theoretical Computer Science}, publisher={Elsevier}, author={Jacob, Riko
and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan}, year={2012},
pages={137–148} }'
chicago: 'Jacob, Riko, Stephan Ritscher, Christian Scheideler, and Stefan Schmid.
“Towards Higher-Dimensional Topological Self-Stabilization: A Distributed Algorithm
for Delaunay Graphs.” Theoretical Computer Science, 2012, 137–48. https://doi.org/10.1016/j.tcs.2012.07.029.'
ieee: 'R. Jacob, S. Ritscher, C. Scheideler, and S. Schmid, “Towards higher-dimensional
topological self-stabilization: A distributed algorithm for Delaunay graphs,”
Theoretical Computer Science, pp. 137–148, 2012.'
mla: 'Jacob, Riko, et al. “Towards Higher-Dimensional Topological Self-Stabilization:
A Distributed Algorithm for Delaunay Graphs.” Theoretical Computer Science,
Elsevier, 2012, pp. 137–48, doi:10.1016/j.tcs.2012.07.029.'
short: R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, Theoretical Computer Science
(2012) 137–148.
date_created: 2017-10-17T12:42:43Z
date_updated: 2022-01-06T07:02:36Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1016/j.tcs.2012.07.029
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:16:20Z
date_updated: 2018-03-15T10:16:20Z
file_id: '1272'
file_name: 570-Delaunay-Journal.pdf
file_size: 250051
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:16:20Z
has_accepted_license: '1'
page: 137-148
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Theoretical Computer Science
publisher: Elsevier
status: public
title: 'Towards higher-dimensional topological self-stabilization: A distributed algorithm
for Delaunay graphs'
type: journal_article
user_id: '477'
year: '2012'
...
---
_id: '571'
abstract:
- lang: eng
text: The paradigm shift from purchasing monolithic software solutions to a dynamic
composition of individual solutions entails many new possibilities yet great challenges,
too. In order to satisfy user requirements, complex services have to be automatically
composed of elementary services. Multiple possibilities of composing a complex
service inevitably emerge. The problem of selecting the most appropriate services
has to be solved by comparing the different service candidates with respect to
their quality in terms of inherent non-functional properties while simultaneously
taking the user requirements into account. We are aiming for an integrated service
rating and ranking methodology in order to support the automation of the underlying
decision-making process. The main contribution of this paper is a first decomposition
of the quality-based service selection process, while emphasizing major issues
and challenges, which we are addressing in the On-The-Fly Computing project.
author:
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
- first_name: Bernd
full_name: Kleinjohann, Bernd
last_name: Kleinjohann
citation:
ama: 'Jungmann A, Kleinjohann B. Towards an Integrated Service Rating and Ranking
Methodology for Quality Based Service Selection in Automatic Service Composition.
In: Proceedings of the 4th International Conferences on Advanced Service Computing
(SERVICE COMPUTATION). ; 2012:43-47.'
apa: Jungmann, A., & Kleinjohann, B. (2012). Towards an Integrated Service Rating
and Ranking Methodology for Quality Based Service Selection in Automatic Service
Composition. In Proceedings of the 4th International Conferences on Advanced
Service Computing (SERVICE COMPUTATION) (pp. 43–47).
bibtex: '@inproceedings{Jungmann_Kleinjohann_2012, title={Towards an Integrated
Service Rating and Ranking Methodology for Quality Based Service Selection in
Automatic Service Composition}, booktitle={Proceedings of the 4th International
Conferences on Advanced Service Computing (SERVICE COMPUTATION)}, author={Jungmann,
Alexander and Kleinjohann, Bernd}, year={2012}, pages={43–47} }'
chicago: Jungmann, Alexander, and Bernd Kleinjohann. “Towards an Integrated Service
Rating and Ranking Methodology for Quality Based Service Selection in Automatic
Service Composition.” In Proceedings of the 4th International Conferences on
Advanced Service Computing (SERVICE COMPUTATION), 43–47, 2012.
ieee: A. Jungmann and B. Kleinjohann, “Towards an Integrated Service Rating and
Ranking Methodology for Quality Based Service Selection in Automatic Service Composition,”
in Proceedings of the 4th International Conferences on Advanced Service Computing
(SERVICE COMPUTATION), 2012, pp. 43–47.
mla: Jungmann, Alexander, and Bernd Kleinjohann. “Towards an Integrated Service
Rating and Ranking Methodology for Quality Based Service Selection in Automatic
Service Composition.” Proceedings of the 4th International Conferences on Advanced
Service Computing (SERVICE COMPUTATION), 2012, pp. 43–47.
short: 'A. Jungmann, B. Kleinjohann, in: Proceedings of the 4th International Conferences
on Advanced Service Computing (SERVICE COMPUTATION), 2012, pp. 43–47.'
date_created: 2017-10-17T12:42:43Z
date_updated: 2022-01-06T07:02:37Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T09:39:02Z
date_updated: 2018-03-15T09:39:02Z
file_id: '1271'
file_name: 571-Towards_an_Integrated_Service_Rating_and_Ranking_Methodology__for_Quality_Based_Service_Selection_in_Automatic_Service_Composition.pdf
file_size: 103343
relation: main_file
success: 1
file_date_updated: 2018-03-15T09:39:02Z
has_accepted_license: '1'
page: 43-47
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 4th International Conferences on Advanced Service
Computing (SERVICE COMPUTATION)
status: public
title: Towards an Integrated Service Rating and Ranking Methodology for Quality Based
Service Selection in Automatic Service Composition
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '5716'
abstract:
- lang: eng
text: The tendency of managers to focus on short-term results rather than on sustained
company success is of particular importance to retail marketing managers, because
marketing activities involve expenditures which may only pay off in the longer
term. To address the issue of myopic management, our study shows how the complexity
of the service profit chain (SPC) can cause managers to make suboptimal decisions.
Hence, our paper departs from past research by recognizing that understanding
the temporal interplay between operational investments, employee satisfaction,
customer satisfaction, and operating profit is essential to achieving sustained
success. In particular, we intend to improve understanding of the functioning
of the SPC with respect to time lags and feedback loops. Results of our large-scale
longitudinal study set in a multi-outlet retail chain reveal time-lag effects
between operational investments and employee satisfaction, as well as between
customer satisfaction and performance. These findings, along with evidence of
a negative interaction effect of employee satisfaction on the relationship between
current performance and future investments, show the substantial risk of mismanaging
the SPC. We identify specific situations in which the dynamic approach leads to
superior marketing investment decisions, when compared to the conventional static
view of the SCP. These insights provide valuable managerial guidance for effectively
managing the SPC over time.
article_type: original
author:
- first_name: Heiner
full_name: Evanschitzky, Heiner
last_name: Evanschitzky
- first_name: Florian v
full_name: Wangenheim, Florian v
last_name: Wangenheim
- first_name: Nancy
full_name: Wünderlich, Nancy
id: '36392'
last_name: Wünderlich
citation:
ama: 'Evanschitzky H, Wangenheim F v, Wünderlich N. Perils of Managing the Service
Profit Chain: The Role of Time Lags and Feedback Loops. Journal of Retailing.
2012;88(3):356-366.'
apa: 'Evanschitzky, H., Wangenheim, F. v, & Wünderlich, N. (2012). Perils of
Managing the Service Profit Chain: The Role of Time Lags and Feedback Loops. Journal
of Retailing, 88(3), 356–366.'
bibtex: '@article{Evanschitzky_Wangenheim_Wünderlich_2012, title={Perils of Managing
the Service Profit Chain: The Role of Time Lags and Feedback Loops.}, volume={88},
number={3}, journal={Journal of Retailing}, publisher={Elsevier}, author={Evanschitzky,
Heiner and Wangenheim, Florian v and Wünderlich, Nancy}, year={2012}, pages={356–366}
}'
chicago: 'Evanschitzky, Heiner, Florian v Wangenheim, and Nancy Wünderlich. “Perils
of Managing the Service Profit Chain: The Role of Time Lags and Feedback Loops.”
Journal of Retailing 88, no. 3 (2012): 356–66.'
ieee: 'H. Evanschitzky, F. v Wangenheim, and N. Wünderlich, “Perils of Managing
the Service Profit Chain: The Role of Time Lags and Feedback Loops.,” Journal
of Retailing, vol. 88, no. 3, pp. 356–366, 2012.'
mla: 'Evanschitzky, Heiner, et al. “Perils of Managing the Service Profit Chain:
The Role of Time Lags and Feedback Loops.” Journal of Retailing, vol. 88,
no. 3, Elsevier, 2012, pp. 356–66.'
short: H. Evanschitzky, F. v Wangenheim, N. Wünderlich, Journal of Retailing 88
(2012) 356–366.
date_created: 2018-11-16T09:37:06Z
date_updated: 2022-01-06T07:02:37Z
department:
- _id: '181'
intvolume: ' 88'
issue: '3'
keyword:
- Employee satisfaction
- Customer satisfaction
- Performance
- Service profit chain
- Feedback loops
- Time lags
- Myopic marketing management
language:
- iso: eng
page: 356-366
publication: Journal of Retailing
publication_status: published
publisher: Elsevier
status: public
title: 'Perils of Managing the Service Profit Chain: The Role of Time Lags and Feedback
Loops.'
type: journal_article
user_id: '37741'
volume: 88
year: '2012'
...
---
_id: '5717'
abstract:
- lang: eng
text: Although professional service providers increasingly deliver their services
globally, little is known about cross-cultural differences in customers’ motivation
to participate in service production. To address this lacuna, we survey a total
of 2,284 banking customers in 11 countries on their motivation to provide personal
information to, and follow the advice of, their service providers. We find differences
in both aspects, but only the differences in providing personal information can
be explained by the cultural values of uncertainty avoidance, individualism/collectivism,
and masculinity/femininity. To perform certain tasks in the service process, global
professional service providers should acknowledge cultural differences in customers’
motivations.
article_type: original
author:
- first_name: Jan H
full_name: Schumann, Jan H
last_name: Schumann
- first_name: Nancy
full_name: Wünderlich, Nancy
id: '36392'
last_name: Wünderlich
- first_name: Marcus S
full_name: Zimmer, Marcus S
last_name: Zimmer
citation:
ama: Schumann JH, Wünderlich N, Zimmer MS. Culture’s Impact on Customer Motivation
to Engage in Professional Service Enactments. Schmalenbach Business Review.
2012;64(2):141-165.
apa: Schumann, J. H., Wünderlich, N., & Zimmer, M. S. (2012). Culture’s Impact
on Customer Motivation to Engage in Professional Service Enactments. Schmalenbach
Business Review, 64(2), 141–165.
bibtex: '@article{Schumann_Wünderlich_Zimmer_2012, title={Culture’s Impact on Customer
Motivation to Engage in Professional Service Enactments.}, volume={64}, number={2},
journal={Schmalenbach Business Review}, publisher={Springer}, author={Schumann,
Jan H and Wünderlich, Nancy and Zimmer, Marcus S}, year={2012}, pages={141–165}
}'
chicago: 'Schumann, Jan H, Nancy Wünderlich, and Marcus S Zimmer. “Culture’s Impact
on Customer Motivation to Engage in Professional Service Enactments.” Schmalenbach
Business Review 64, no. 2 (2012): 141–65.'
ieee: J. H. Schumann, N. Wünderlich, and M. S. Zimmer, “Culture’s Impact on Customer
Motivation to Engage in Professional Service Enactments.,” Schmalenbach Business
Review, vol. 64, no. 2, pp. 141–165, 2012.
mla: Schumann, Jan H., et al. “Culture’s Impact on Customer Motivation to Engage
in Professional Service Enactments.” Schmalenbach Business Review, vol.
64, no. 2, Springer, 2012, pp. 141–65.
short: J.H. Schumann, N. Wünderlich, M.S. Zimmer, Schmalenbach Business Review 64
(2012) 141–165.
date_created: 2018-11-16T09:40:23Z
date_updated: 2022-01-06T07:02:37Z
department:
- _id: '181'
intvolume: ' 64'
issue: '2'
keyword:
- Co-Production
- Culture
- Customer Participation
- Professional Services
language:
- iso: eng
page: 141-165
publication: Schmalenbach Business Review
publication_status: published
publisher: Springer
status: public
title: Culture’s Impact on Customer Motivation to Engage in Professional Service Enactments.
type: journal_article
user_id: '37741'
volume: 64
year: '2012'
...
---
_id: '5718'
abstract:
- lang: eng
text: The role of information and communication technology for economic growth has
been emphasized repeatedly. Technological breakthroughs have generated new forms
of services, such as self-services or remote services. Although these encounters
are qualitatively different from traditional service provision, prior service
management literature thus far had paid little attention to theory development
and the systematization of technology-based service encounters. To fill this research
gap, the present study outlines how new types of technology-based services fit
into existing service typologies and provides an extension of existing frameworks
to capture their unique characteristics. These insights in turn offer managerial
implications and highlight open research questions.
article_type: original
author:
- first_name: Jan H
full_name: Schumann, Jan H
last_name: Schumann
- first_name: Nancy
full_name: Wünderlich, Nancy
id: '36392'
last_name: Wünderlich
- first_name: Florian
full_name: Wangenheim, Florian
last_name: Wangenheim
citation:
ama: 'Schumann JH, Wünderlich N, Wangenheim F. Technology Mediation in Service Delivery:
A New Typology and an Agenda for Managers and Academics. Technovation.
2012;32(2):133-143.'
apa: 'Schumann, J. H., Wünderlich, N., & Wangenheim, F. (2012). Technology Mediation
in Service Delivery: A New Typology and an Agenda for Managers and Academics.
Technovation, 32(2), 133–143.'
bibtex: '@article{Schumann_Wünderlich_Wangenheim_2012, title={Technology Mediation
in Service Delivery: A New Typology and an Agenda for Managers and Academics.},
volume={32}, number={2}, journal={Technovation}, publisher={Elsevier}, author={Schumann,
Jan H and Wünderlich, Nancy and Wangenheim, Florian}, year={2012}, pages={133–143}
}'
chicago: 'Schumann, Jan H, Nancy Wünderlich, and Florian Wangenheim. “Technology
Mediation in Service Delivery: A New Typology and an Agenda for Managers and Academics.”
Technovation 32, no. 2 (2012): 133–43.'
ieee: 'J. H. Schumann, N. Wünderlich, and F. Wangenheim, “Technology Mediation in
Service Delivery: A New Typology and an Agenda for Managers and Academics.,” Technovation,
vol. 32, no. 2, pp. 133–143, 2012.'
mla: 'Schumann, Jan H., et al. “Technology Mediation in Service Delivery: A New
Typology and an Agenda for Managers and Academics.” Technovation, vol.
32, no. 2, Elsevier, 2012, pp. 133–43.'
short: J.H. Schumann, N. Wünderlich, F. Wangenheim, Technovation 32 (2012) 133–143.
date_created: 2018-11-16T09:43:45Z
date_updated: 2022-01-06T07:02:37Z
department:
- _id: '181'
intvolume: ' 32'
issue: '2'
keyword:
- Services
- Remote services
- Self-services
- Technology mediation
language:
- iso: eng
page: 133-143
publication: Technovation
publication_status: published
publisher: Elsevier
status: public
title: 'Technology Mediation in Service Delivery: A New Typology and an Agenda for
Managers and Academics.'
type: journal_article
user_id: '37741'
volume: 32
year: '2012'
...
---
_id: '572'
abstract:
- lang: eng
text: Service-oriented computing (SOC) promises to solve many issues in the area
of distributed software development, e.g. the realization of the loose coupling
pattern in practice through service discovery and invocation. For this purpose,
service descriptions must comprise structural as well as behavioral information
of the services otherwise an accurate service discovery is not possible. We addressed
this issue in our previous paper and proposed a UML-based rich service description
language (RSDL) providing comprehensive notations to specify service requests
and offers.However, the automatic matching of service requests and offers specified
in a RSDL for the purpose of service discovery is a complex task, due to multifaceted
heterogeneity of the service partners. This heterogeneity includes the use of
different underlying ontologies or different levels of granularity in the specification
itself resulting in complex mappings between service requests and offers. In this
paper, we present an automatic matching mechanism for service requests and offers
specified in a RSDL that overcomes the underlying heterogeneity of the service
partners.
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. Towards an Automatic Service Discovery
for UML-based Rich Service Descriptions. In: Proceedings of the ACM/IEEE 15th
International Conference on Model Driven Engineering Languages and Systems (MoDELS).
LNCS. ; 2012:709--725. doi:10.1007/978-3-642-33666-9_45'
apa: Huma, Z., Gerth, C., Engels, G., & Juwig, O. (2012). Towards an Automatic
Service Discovery for UML-based Rich Service Descriptions. In Proceedings of
the ACM/IEEE 15th International Conference on Model Driven Engineering Languages
and Systems (MoDELS) (pp. 709--725). https://doi.org/10.1007/978-3-642-33666-9_45
bibtex: '@inproceedings{Huma_Gerth_Engels_Juwig_2012, series={LNCS}, title={Towards
an Automatic Service Discovery for UML-based Rich Service Descriptions}, DOI={10.1007/978-3-642-33666-9_45},
booktitle={Proceedings of the ACM/IEEE 15th International Conference on Model
Driven Engineering Languages and Systems (MoDELS)}, author={Huma, Zille and Gerth,
Christian and Engels, Gregor and Juwig, Oliver}, year={2012}, pages={709--725},
collection={LNCS} }'
chicago: Huma, Zille, Christian Gerth, Gregor Engels, and Oliver Juwig. “Towards
an Automatic Service Discovery for UML-Based Rich Service Descriptions.” In Proceedings
of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages
and Systems (MoDELS), 709--725. LNCS, 2012. https://doi.org/10.1007/978-3-642-33666-9_45.
ieee: Z. Huma, C. Gerth, G. Engels, and O. Juwig, “Towards an Automatic Service
Discovery for UML-based Rich Service Descriptions,” in Proceedings of the ACM/IEEE
15th International Conference on Model Driven Engineering Languages and Systems
(MoDELS), 2012, pp. 709--725.
mla: Huma, Zille, et al. “Towards an Automatic Service Discovery for UML-Based Rich
Service Descriptions.” Proceedings of the ACM/IEEE 15th International Conference
on Model Driven Engineering Languages and Systems (MoDELS), 2012, pp. 709--725,
doi:10.1007/978-3-642-33666-9_45.
short: 'Z. Huma, C. Gerth, G. Engels, O. Juwig, in: Proceedings of the ACM/IEEE
15th International Conference on Model Driven Engineering Languages and Systems
(MoDELS), 2012, pp. 709--725.'
date_created: 2017-10-17T12:42:43Z
date_updated: 2022-01-06T07:02:37Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.1007/978-3-642-33666-9_45
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T09:38:22Z
date_updated: 2018-03-15T09:38:22Z
file_id: '1270'
file_name: 572-MODELS2012-Huma_Gerth_Engels_Juwig.pdf
file_size: 518982
relation: main_file
success: 1
file_date_updated: 2018-03-15T09:38:22Z
has_accepted_license: '1'
language:
- iso: eng
page: 709--725
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 ACM/IEEE 15th International Conference on Model Driven
Engineering Languages and Systems (MoDELS)
series_title: LNCS
status: public
title: Towards an Automatic Service Discovery for UML-based Rich Service Descriptions
type: conference
user_id: '477'
year: '2012'
...
---
_id: '573'
abstract:
- lang: eng
text: In software markets of the future, customer-specific software will be developed
on demand from distributed software and hardware services available on world-wide
markets. Having a request, services have to be automatically discovered and composed.
For that purpose, services have to be matched based on their specifications. For
the accurate matching, services have to be described comprehensively that requires
the integration of different domain-specific languages (DSLs) used for functional,
non-functional, and infrastructural properties. Since different service providers
use plenty of language dialects to model the same service property, their integration
is needed for the matching. In this paper, we propose a framework for integration
of DSLs. It is based on a parameterized abstract core language that integrates
key concepts needed to describe a service. Parts of the core language can be substituted
with concrete DSLs. Thus, the framework serves as a basis for the comprehensive
specification and automatic matching of services.
author:
- first_name: Svetlana
full_name: Arifulina, Svetlana
last_name: Arifulina
citation:
ama: 'Arifulina S. Towards a Framework for the Integration of Modeling Languages.
In: W. Eisenecker U, Bucholdt C, eds. Proceedings of the Doctoral Symposium
of the 5th International Conference on Software Language Engineering 2012, Dresden,
Germany (SLE (Doctoral Symposium)). CEUR Workshop Proceedings. ; 2012:23--26.'
apa: Arifulina, S. (2012). Towards a Framework for the Integration of Modeling Languages.
In U. W. Eisenecker & C. Bucholdt (Eds.), Proceedings of the Doctoral Symposium
of the 5th International Conference on Software Language Engineering 2012, Dresden,
Germany (SLE (Doctoral Symposium)) (pp. 23--26).
bibtex: '@inproceedings{Arifulina_2012, series={CEUR Workshop Proceedings}, title={Towards
a Framework for the Integration of Modeling Languages}, booktitle={Proceedings
of the Doctoral Symposium of the 5th International Conference on Software Language
Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))}, author={Arifulina,
Svetlana}, editor={W. Eisenecker, Ulrich and Bucholdt, ChristianEditors}, year={2012},
pages={23--26}, collection={CEUR Workshop Proceedings} }'
chicago: Arifulina, Svetlana. “Towards a Framework for the Integration of Modeling
Languages.” In Proceedings of the Doctoral Symposium of the 5th International
Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral
Symposium)), edited by Ulrich W. Eisenecker and Christian Bucholdt, 23--26.
CEUR Workshop Proceedings, 2012.
ieee: S. Arifulina, “Towards a Framework for the Integration of Modeling Languages,”
in Proceedings of the Doctoral Symposium of the 5th International Conference
on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium)),
2012, pp. 23--26.
mla: Arifulina, Svetlana. “Towards a Framework for the Integration of Modeling Languages.”
Proceedings of the Doctoral Symposium of the 5th International Conference on
Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium)),
edited by Ulrich W. Eisenecker and Christian Bucholdt, 2012, pp. 23--26.
short: 'S. Arifulina, in: U. W. Eisenecker, C. Bucholdt (Eds.), Proceedings of the
Doctoral Symposium of the 5th International Conference on Software Language Engineering
2012, Dresden, Germany (SLE (Doctoral Symposium)), 2012, pp. 23--26.'
date_created: 2017-10-17T12:42:43Z
date_updated: 2022-01-06T07:02:37Z
ddc:
- '040'
department:
- _id: '66'
editor:
- first_name: Ulrich
full_name: W. Eisenecker, Ulrich
last_name: W. Eisenecker
- first_name: Christian
full_name: Bucholdt, Christian
last_name: Bucholdt
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T09:37:48Z
date_updated: 2018-03-15T09:37:48Z
file_id: '1269'
file_name: 573-Framework_for_Integration_of_Modeling_Languages.pdf
file_size: 321930
relation: main_file
success: 1
file_date_updated: 2018-03-15T09:37:48Z
has_accepted_license: '1'
language:
- iso: eng
page: 23--26
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the Doctoral Symposium of the 5th International Conference
on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))
series_title: CEUR Workshop Proceedings
status: public
title: Towards a Framework for the Integration of Modeling Languages
type: conference
user_id: '477'
year: '2012'
...
---
_id: '574'
abstract:
- lang: eng
text: 'We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm.
Tiara is truly deterministic which allows it to achieve exact performance bounds.
Tiara allows logarithmic searches and topology updates. It is based on a novel
sparse 0-1 skip list. We then describe its extension to a ringed structure and
to a skip-graph.Key words: Peer-to-peer networks, overlay networks, self-stabilization.'
author:
- first_name: Thomas
full_name: Clouser, Thomas
last_name: Clouser
- first_name: Mikhail
full_name: Nesterenko, Mikhail
last_name: Nesterenko
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Clouser T, Nesterenko M, Scheideler C. Tiara: A self-stabilizing deterministic
skip list and skip graph. Theoretical Computer Science. 2012:18-35. doi:10.1016/j.tcs.2011.12.079'
apa: 'Clouser, T., Nesterenko, M., & Scheideler, C. (2012). Tiara: A self-stabilizing
deterministic skip list and skip graph. Theoretical Computer Science, 18–35.
https://doi.org/10.1016/j.tcs.2011.12.079'
bibtex: '@article{Clouser_Nesterenko_Scheideler_2012, title={Tiara: A self-stabilizing
deterministic skip list and skip graph}, DOI={10.1016/j.tcs.2011.12.079},
journal={Theoretical Computer Science}, publisher={Elsevier}, author={Clouser,
Thomas and Nesterenko, Mikhail and Scheideler, Christian}, year={2012}, pages={18–35}
}'
chicago: 'Clouser, Thomas, Mikhail Nesterenko, and Christian Scheideler. “Tiara:
A Self-Stabilizing Deterministic Skip List and Skip Graph.” Theoretical Computer
Science, 2012, 18–35. https://doi.org/10.1016/j.tcs.2011.12.079.'
ieee: 'T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A self-stabilizing
deterministic skip list and skip graph,” Theoretical Computer Science,
pp. 18–35, 2012.'
mla: 'Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List
and Skip Graph.” Theoretical Computer Science, Elsevier, 2012, pp. 18–35,
doi:10.1016/j.tcs.2011.12.079.'
short: T. Clouser, M. Nesterenko, C. Scheideler, Theoretical Computer Science (2012)
18–35.
date_created: 2017-10-17T12:42:44Z
date_updated: 2022-01-06T07:02:38Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1016/j.tcs.2011.12.079
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T09:09:29Z
date_updated: 2018-03-15T09:09:29Z
file_id: '1268'
file_name: 574-tiara.pdf
file_size: 315843
relation: main_file
success: 1
file_date_updated: 2018-03-15T09:09:29Z
has_accepted_license: '1'
page: 18-35
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Theoretical Computer Science
publisher: Elsevier
status: public
title: 'Tiara: A self-stabilizing deterministic skip list and skip graph'
type: journal_article
user_id: '477'
year: '2012'
...
---
_id: '575'
author:
- first_name: Lars
full_name: Bremer, Lars
last_name: Bremer
citation:
ama: Bremer L. Symbiotic Coupling of Peer-to-Peer and Cloud Systems. Universität
Paderborn; 2012.
apa: Bremer, L. (2012). Symbiotic Coupling of Peer-to-Peer and Cloud Systems.
Universität Paderborn.
bibtex: '@book{Bremer_2012, title={Symbiotic Coupling of Peer-to-Peer and Cloud
Systems}, publisher={Universität Paderborn}, author={Bremer, Lars}, year={2012}
}'
chicago: Bremer, Lars. Symbiotic Coupling of Peer-to-Peer and Cloud Systems.
Universität Paderborn, 2012.
ieee: L. Bremer, Symbiotic Coupling of Peer-to-Peer and Cloud Systems. Universität
Paderborn, 2012.
mla: Bremer, Lars. Symbiotic Coupling of Peer-to-Peer and Cloud Systems.
Universität Paderborn, 2012.
short: L. Bremer, Symbiotic Coupling of Peer-to-Peer and Cloud Systems, Universität
Paderborn, 2012.
date_created: 2017-10-17T12:42:44Z
date_updated: 2022-01-06T07:02:38Z
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: Symbiotic Coupling of Peer-to-Peer and Cloud Systems
type: mastersthesis
user_id: '15504'
year: '2012'
...
---
_id: '5753'
author:
- first_name: Benjamin
full_name: Nagel, Benjamin
last_name: Nagel
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
- first_name: Enes
full_name: Yigitbas, Enes
id: '8447'
last_name: Yigitbas
orcid: 0000-0002-5967-833X
- first_name: Fabian
full_name: Christ, Fabian
last_name: Christ
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Nagel B, Gerth C, Yigitbas E, Christ F, Engels G. Model-driven specification
of adaptive cloud-based systems. In: Proceedings of the 1st International Workshop
on Model-Driven Engineering for High Performance and CLoud Computing Co-Located
with 15th International Conference on Model Driven Engineering Languages and Systems
{(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012. ; 2012:4. doi:10.1145/2446224.2446228'
apa: Nagel, B., Gerth, C., Yigitbas, E., Christ, F., & Engels, G. (2012). Model-driven
specification of adaptive cloud-based systems. In Proceedings of the 1st International
Workshop on Model-Driven Engineering for High Performance and CLoud computing
co-located with 15th International Conference on Model Driven Engineering Languages
and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012 (p.
4). https://doi.org/10.1145/2446224.2446228
bibtex: '@inproceedings{Nagel_Gerth_Yigitbas_Christ_Engels_2012, title={Model-driven
specification of adaptive cloud-based systems}, DOI={10.1145/2446224.2446228},
booktitle={Proceedings of the 1st International Workshop on Model-Driven Engineering
for High Performance and CLoud computing co-located with 15th International Conference
on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck,
Austria, October 01 - 05, 2012}, author={Nagel, Benjamin and Gerth, Christian
and Yigitbas, Enes and Christ, Fabian and Engels, Gregor}, year={2012}, pages={4}
}'
chicago: Nagel, Benjamin, Christian Gerth, Enes Yigitbas, Fabian Christ, and Gregor
Engels. “Model-Driven Specification of Adaptive Cloud-Based Systems.” In Proceedings
of the 1st International Workshop on Model-Driven Engineering for High Performance
and CLoud Computing Co-Located with 15th International Conference on Model Driven
Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October
01 - 05, 2012, 4, 2012. https://doi.org/10.1145/2446224.2446228.
ieee: B. Nagel, C. Gerth, E. Yigitbas, F. Christ, and G. Engels, “Model-driven specification
of adaptive cloud-based systems,” in Proceedings of the 1st International Workshop
on Model-Driven Engineering for High Performance and CLoud computing co-located
with 15th International Conference on Model Driven Engineering Languages and Systems
{(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012, 2012, p. 4.
mla: Nagel, Benjamin, et al. “Model-Driven Specification of Adaptive Cloud-Based
Systems.” Proceedings of the 1st International Workshop on Model-Driven Engineering
for High Performance and CLoud Computing Co-Located with 15th International Conference
on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck,
Austria, October 01 - 05, 2012, 2012, p. 4, doi:10.1145/2446224.2446228.
short: 'B. Nagel, C. Gerth, E. Yigitbas, F. Christ, G. Engels, in: Proceedings of
the 1st International Workshop on Model-Driven Engineering for High Performance
and CLoud Computing Co-Located with 15th International Conference on Model Driven
Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October
01 - 05, 2012, 2012, p. 4.'
date_created: 2018-11-19T15:18:29Z
date_updated: 2022-01-06T07:02:38Z
department:
- _id: '66'
doi: 10.1145/2446224.2446228
language:
- iso: eng
page: '4'
publication: Proceedings of the 1st International Workshop on Model-Driven Engineering
for High Performance and CLoud computing co-located with 15th International Conference
on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria,
October 01 - 05, 2012
status: public
title: Model-driven specification of adaptive cloud-based systems
type: conference
user_id: '8447'
year: '2012'
...
---
_id: '576'
author:
- first_name: Henning
full_name: Schmitz, Henning
last_name: Schmitz
citation:
ama: Schmitz H. Stereo Matching on a Convey HC-1 Hybrid Core Computer. Universität
Paderborn; 2012.
apa: Schmitz, H. (2012). Stereo Matching on a Convey HC-1 Hybrid Core Computer.
Universität Paderborn.
bibtex: '@book{Schmitz_2012, title={Stereo Matching on a Convey HC-1 Hybrid Core
Computer}, publisher={Universität Paderborn}, author={Schmitz, Henning}, year={2012}
}'
chicago: Schmitz, Henning. Stereo Matching on a Convey HC-1 Hybrid Core Computer.
Universität Paderborn, 2012.
ieee: H. Schmitz, Stereo Matching on a Convey HC-1 Hybrid Core Computer.
Universität Paderborn, 2012.
mla: Schmitz, Henning. Stereo Matching on a Convey HC-1 Hybrid Core Computer.
Universität Paderborn, 2012.
short: H. Schmitz, Stereo Matching on a Convey HC-1 Hybrid Core Computer, Universität
Paderborn, 2012.
date_created: 2017-10-17T12:42:44Z
date_updated: 2022-01-06T07:02:38Z
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: Stereo Matching on a Convey HC-1 Hybrid Core Computer
type: bachelorsthesis
user_id: '15504'
year: '2012'
...
---
_id: '5760'
author:
- first_name: Enes
full_name: Yigitbas, Enes
id: '8447'
last_name: Yigitbas
orcid: 0000-0002-5967-833X
citation:
ama: Yigitbas E. Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für Geschäftsprozesse
in Service-Orientierten Systemen.; 2012.
apa: Yigitbas, E. (2012). Entwicklung eines Monitoring- und Adaptionskonzeptes
für Geschäftsprozesse in service-orientierten Systemen.
bibtex: '@book{Yigitbas_2012, title={Entwicklung eines Monitoring- und Adaptionskonzeptes
für Geschäftsprozesse in service-orientierten Systemen}, author={Yigitbas, Enes},
year={2012} }'
chicago: Yigitbas, Enes. Entwicklung Eines Monitoring- Und Adaptionskonzeptes
Für Geschäftsprozesse in Service-Orientierten Systemen, 2012.
ieee: E. Yigitbas, Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse
in service-orientierten Systemen. 2012.
mla: Yigitbas, Enes. Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für
Geschäftsprozesse in Service-Orientierten Systemen. 2012.
short: E. Yigitbas, Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für Geschäftsprozesse
in Service-Orientierten Systemen, 2012.
date_created: 2018-11-19T15:29:59Z
date_updated: 2022-01-06T07:02:38Z
department:
- _id: '66'
language:
- iso: eng
status: public
title: Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse
in service-orientierten Systemen
type: mastersthesis
user_id: '8447'
year: '2012'
...
---
_id: '577'
abstract:
- lang: eng
text: 'SSS is an international forum for researchers and practitioners in the design
and development of distributed systems with self-properties: (classical) self-stabilizing,
self-configuring, self-organizing, self-managing, self-repairing, self-healing,
self-optimizing, self-adaptive, and self-protecting. Research in distributed systems
is now at a crucialpoint in its evolution, marked by the importance of dynamic
systems such as peer-to-peer networks, large-scale wireless sensor networks, mobile
ad hoc networks, cloud computing, robotic networks, etc. Moreover, new applications
such as grid and web services, banking and e-commerce, e-health and robotics,
aerospace and avionics, automotive, industrial process control, etc. have joined
the traditional applications of distributed systems. The theory of self-stabilization
has been enriched in the last 30 years by high quality research contributions
in the areas of algorithmic techniques, formal methodologies, model theoretic
issues, and composition techniques. All these areas are essential to the understanding
and maintenance of self-properties in fault-tolerant distributed systems.'
citation:
ama: Richa AW, Scheideler C, eds. Stabilization, Safety, and Security of Distributed
Systems.; 2012. doi:10.1007/978-3-642-33536-5
apa: Richa, A. W., & Scheideler, C. (Eds.). (2012). Stabilization, Safety,
and Security of Distributed Systems. Presented at the Stabilization, Safety,
and Security of Distributed Systems (SSS), Paderborn, Germany. https://doi.org/10.1007/978-3-642-33536-5
bibtex: '@book{Richa_Scheideler_2012, title={Stabilization, Safety, and Security
of Distributed Systems}, DOI={10.1007/978-3-642-33536-5},
year={2012} }'
chicago: Richa, Andrea W., and Christian Scheideler, eds. Stabilization, Safety,
and Security of Distributed Systems, 2012. https://doi.org/10.1007/978-3-642-33536-5.
ieee: A. W. Richa and C. Scheideler, Eds., Stabilization, Safety, and Security
of Distributed Systems. 2012.
mla: Richa, Andrea W., and Christian Scheideler, editors. Stabilization, Safety,
and Security of Distributed Systems. 2012, doi:10.1007/978-3-642-33536-5.
short: A.W. Richa, C. Scheideler, eds., Stabilization, Safety, and Security of Distributed
Systems, 2012.
conference:
end_date: 2012-10-04
location: Paderborn, Germany
name: Stabilization, Safety, and Security of Distributed Systems (SSS)
start_date: 2012-10-01
date_created: 2017-10-17T12:42:44Z
date_updated: 2022-01-06T07:02:39Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-33536-5
editor:
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:09:19Z
date_updated: 2018-03-21T13:09:19Z
file_id: '1569'
file_name: 577-SSS2012Richa-Scheideler.pdf
file_size: 169564
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:09:19Z
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
status: public
title: Stabilization, Safety, and Security of Distributed Systems
type: conference_editor
user_id: '15504'
year: '2012'
...
---
_id: '578'
abstract:
- lang: eng
text: 'This paper analyzes the stability of capital tax harmonization agreements
in a stylized model where countries have formed coalitions which set a common
tax rate in order to avoid the inefficient fully non-cooperative Nash equilibrium.
In particular, for a given coalition structure we study to what extend the stability
of tax agreements is affected by the coalitions that have formed. In our set-up,
countries are symmetric, but coalitions can be of arbitrary size. We analyze stability
by means of a repeated game setting employing simple trigger strategies and we
allow a sub-coalition to deviate from the coalitional equilibrium. For a given
form of punishment we are able to rank the stability of different coalition structures
as long as the size of the largest coalition does not change. Our main results
are: (1) singleton regions have the largest incentives to deviate, (2) the stability
of cooperation depends on the degree of cooperative behavior ex-ante.'
author:
- first_name: Sonja
full_name: Brangewitz, Sonja
last_name: Brangewitz
- first_name: Sarah
full_name: Brockhoff, Sarah
last_name: Brockhoff
citation:
ama: Brangewitz S, Brockhoff S. Stability of Coalitional Equilibria within Repeated
Tax Competition. Universität Paderborn; 2012.
apa: Brangewitz, S., & Brockhoff, S. (2012). Stability of Coalitional Equilibria
within Repeated Tax Competition. Universität Paderborn.
bibtex: '@book{Brangewitz_Brockhoff_2012, title={Stability of Coalitional Equilibria
within Repeated Tax Competition}, publisher={Universität Paderborn}, author={Brangewitz,
Sonja and Brockhoff, Sarah}, year={2012} }'
chicago: Brangewitz, Sonja, and Sarah Brockhoff. Stability of Coalitional Equilibria
within Repeated Tax Competition. Universität Paderborn, 2012.
ieee: S. Brangewitz and S. Brockhoff, Stability of Coalitional Equilibria within
Repeated Tax Competition. Universität Paderborn, 2012.
mla: Brangewitz, Sonja, and Sarah Brockhoff. Stability of Coalitional Equilibria
within Repeated Tax Competition. Universität Paderborn, 2012.
short: S. Brangewitz, S. Brockhoff, Stability of Coalitional Equilibria within Repeated
Tax Competition, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:44Z
date_updated: 2022-01-06T07:02:40Z
ddc:
- '040'
department:
- _id: '205'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T09:08:24Z
date_updated: 2018-03-15T09:08:24Z
file_id: '1267'
file_name: 578-WP48Brangewitz.pdf
file_size: 876927
relation: main_file
success: 1
file_date_updated: 2018-03-15T09:08:24Z
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: Stability of Coalitional Equilibria within Repeated Tax Competition
type: report
user_id: '477'
year: '2012'
...
---
_id: '579'
abstract:
- lang: eng
text: A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number
that is strictly larger than all preceding numbers. In this article we present
a smoothed analysis of the number of left-to-right maxima in the presence of additive
random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are
perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right
maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation
σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis
of the smoothed height of binary search trees and the smoothed number of comparisons
in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε
+ n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our
results can also be applied to bound the smoothed number of points on a convex
hull of points in the two-dimensional plane and to smoothed motion complexity,
a concept we describe in this article. We bound how often one needs to update
a data structure storing the smallest axis-aligned box enclosing a set of points
moving in d-dimensional space.
author:
- first_name: Valentina
full_name: Damerow, Valentina
last_name: Damerow
- first_name: Bodo
full_name: Manthey, Bodo
last_name: Manthey
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Till
full_name: Tantau, Till
last_name: Tantau
citation:
ama: Damerow V, Manthey B, Meyer auf der Heide F, et al. Smoothed analysis of left-to-right
maxima with applications. Transactions on Algorithms. 2012;(3):30. doi:10.1145/2229163.2229174
apa: Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C.,
Sohler, C., & Tantau, T. (2012). Smoothed analysis of left-to-right maxima
with applications. Transactions on Algorithms, (3), 30. https://doi.org/10.1145/2229163.2229174
bibtex: '@article{Damerow_Manthey_Meyer auf der Heide_Räcke_Scheideler_Sohler_Tantau_2012,
title={Smoothed analysis of left-to-right maxima with applications}, DOI={10.1145/2229163.2229174},
number={3}, journal={Transactions on Algorithms}, publisher={ACM}, author={Damerow,
Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald
and Scheideler, Christian and Sohler, Christian and Tantau, Till}, year={2012},
pages={30} }'
chicago: 'Damerow, Valentina, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald
Räcke, Christian Scheideler, Christian Sohler, and Till Tantau. “Smoothed Analysis
of Left-to-Right Maxima with Applications.” Transactions on Algorithms,
no. 3 (2012): 30. https://doi.org/10.1145/2229163.2229174.'
ieee: V. Damerow et al., “Smoothed analysis of left-to-right maxima with
applications,” Transactions on Algorithms, no. 3, p. 30, 2012.
mla: Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with
Applications.” Transactions on Algorithms, no. 3, ACM, 2012, p. 30, doi:10.1145/2229163.2229174.
short: V. Damerow, B. Manthey, F. Meyer auf der Heide, H. Räcke, C. Scheideler,
C. Sohler, T. Tantau, Transactions on Algorithms (2012) 30.
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:41Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1145/2229163.2229174
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T09:04:58Z
date_updated: 2018-03-15T09:04:58Z
file_id: '1266'
file_name: 579-a30-damerow.pdf
file_size: 329282
relation: main_file
success: 1
file_date_updated: 2018-03-15T09:04:58Z
has_accepted_license: '1'
issue: '3'
page: '30'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Transactions on Algorithms
publisher: ACM
status: public
title: Smoothed analysis of left-to-right maxima with applications
type: journal_article
user_id: '477'
year: '2012'
...
---
_id: '580'
abstract:
- lang: eng
text: We present and study a new model for energy-aware and profit-oriented scheduling
on a single processor.The processor features dynamic speed scaling as well as
suspension to a sleep mode.Jobs arrive over time, are preemptable, and have different
sizes, values, and deadlines.On the arrival of a new job, the scheduler may either
accept or reject the job.Accepted jobs need a certain energy investment to be
finished in time, while rejected jobs cause costs equal to their values.Here,
power consumption at speed $s$ is given by $P(s)=s^{\alpha}+\beta$ and the energy
investment is power integrated over time.Additionally, the scheduler may decide
to suspend the processor to a sleep mode in which no energy is consumed, though
awaking entails fixed transition costs $\gamma$.The objective is to minimize the
total value of rejected jobs plus the total energy.Our model combines aspects
from advanced energy conservation techniques (namely speed scaling and sleep states)
and profit-oriented scheduling models.We show that \emph{rejection-oblivious}
schedulers (whose rejection decisions are not based on former decisions) have
– in contrast to the model without sleep states – an unbounded competitive ratio.It
turns out that the jobs' value densities (the ratio between a job's value and
its work) are crucial for the performance of such schedulers.We give an algorithm
whose competitiveness nearly matches the lower bound w.r.t\text{.} the maximum
value density.If the maximum value density is not too large, the competitiveness
becomes $\alpha^{\alpha}+2e\alpha$.Also, we show that it suffices to restrict
the value density of low-value jobs only.Using a technique from \cite{Chan:2010}
we transfer our results to processors with a fixed maximum speed.
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Fredrik
full_name: Mallmann Trenn, Fredrik
last_name: Mallmann Trenn
citation:
ama: 'Cord-Landwehr A, Kling P, Mallmann Trenn F. Slow Down & Sleep for Profit
in Online Deadline Scheduling. In: Even G, Rawitz D, eds. Proceedings of the
1st Mediterranean Conference on Algorithms (MedAlg). LNCS. ; 2012:218-231.
doi:10.1007/978-3-642-34862-4_17'
apa: Cord-Landwehr, A., Kling, P., & Mallmann Trenn, F. (2012). Slow Down &
Sleep for Profit in Online Deadline Scheduling. In G. Even & D. Rawitz (Eds.),
Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)
(pp. 218–231). https://doi.org/10.1007/978-3-642-34862-4_17
bibtex: '@inproceedings{Cord-Landwehr_Kling_Mallmann Trenn_2012, series={LNCS},
title={Slow Down & Sleep for Profit in Online Deadline Scheduling}, DOI={10.1007/978-3-642-34862-4_17},
booktitle={Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)},
author={Cord-Landwehr, Andreas and Kling, Peter and Mallmann Trenn, Fredrik},
editor={Even, Guy and Rawitz, DrorEditors}, year={2012}, pages={218–231}, collection={LNCS}
}'
chicago: Cord-Landwehr, Andreas, Peter Kling, and Fredrik Mallmann Trenn. “Slow
Down & Sleep for Profit in Online Deadline Scheduling.” In Proceedings
of the 1st Mediterranean Conference on Algorithms (MedAlg), edited by Guy
Even and Dror Rawitz, 218–31. LNCS, 2012. https://doi.org/10.1007/978-3-642-34862-4_17.
ieee: A. Cord-Landwehr, P. Kling, and F. Mallmann Trenn, “Slow Down & Sleep
for Profit in Online Deadline Scheduling,” in Proceedings of the 1st Mediterranean
Conference on Algorithms (MedAlg), 2012, pp. 218–231.
mla: Cord-Landwehr, Andreas, et al. “Slow Down & Sleep for Profit in Online
Deadline Scheduling.” Proceedings of the 1st Mediterranean Conference on Algorithms
(MedAlg), edited by Guy Even and Dror Rawitz, 2012, pp. 218–31, doi:10.1007/978-3-642-34862-4_17.
short: 'A. Cord-Landwehr, P. Kling, F. Mallmann Trenn, in: G. Even, D. Rawitz (Eds.),
Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg), 2012,
pp. 218–231.'
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:42Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-34862-4_17
editor:
- first_name: Guy
full_name: Even, Guy
last_name: Even
- first_name: Dror
full_name: Rawitz, Dror
last_name: Rawitz
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T09:03:39Z
date_updated: 2018-03-15T09:03:39Z
file_id: '1265'
file_name: 580-P._Kling__F._Mallmann-Trenn__A._Cord-Landwehr_-_Slow_Down___Sleep_for_Profit_in_Online_Deadline_Scheduling.pdf
file_size: 325939
relation: main_file
success: 1
file_date_updated: 2018-03-15T09:03:39Z
has_accepted_license: '1'
language:
- iso: eng
page: 218-231
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)
series_title: LNCS
status: public
title: Slow Down & Sleep for Profit in Online Deadline Scheduling
type: conference
user_id: '477'
year: '2012'
...
---
_id: '581'
abstract:
- lang: eng
text: 'Nanoparticles are getting more and more in the focus of the scientic community
since the potential for the development of very small particles interacting with
each other and completing medical and other tasks is getting bigger year by year.
In this work we introduce a distributed local algorithm for arranging a set of
nanoparticles on the discrete plane into specic geometric shapes, for instance
a rectangle. The concept of a particle we use can be seen as a simple mobile robot
with the following restrictions: it can only view the state of robots it is physically
connected to, is anonymous, has only a constant size memory, can only move by
using other particles as an anchor point on which it pulls itself alongside, and
it operates in Look-Compute-Move cycles. The main result of this work is the presentation
of a random distributed local algorithm which transforms any given connected set
of particles into a particular geometric shape. As an example we provide a version
of this algorithm for forming a rectangle with an arbitrary predened aspect ratio.
To the best of our knowledge this is the rst work that considers arrangement problems
for these types of robots.'
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Martina
full_name: 'Hüllmann (married name: Eikel), Martina'
last_name: 'Hüllmann (married name: Eikel)'
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Drees M, Hüllmann (married name: Eikel) M, Koutsopoulos A, Scheideler C. Self-Organizing
Particle Systems. In: Proceedings of the 26th IEEE International Parallel and
Distributed Processing Symposium (IPDPS). ; 2012:1272-1283. doi:10.1109/IPDPS.2012.116'
apa: 'Drees, M., Hüllmann (married name: Eikel), M., Koutsopoulos, A., & Scheideler,
C. (2012). Self-Organizing Particle Systems. In Proceedings of the 26th IEEE
International Parallel and Distributed Processing Symposium (IPDPS) (pp. 1272–1283).
https://doi.org/10.1109/IPDPS.2012.116'
bibtex: '@inproceedings{Drees_Hüllmann (married name: Eikel)_Koutsopoulos_Scheideler_2012,
title={Self-Organizing Particle Systems}, DOI={10.1109/IPDPS.2012.116},
booktitle={Proceedings of the 26th IEEE International Parallel and Distributed
Processing Symposium (IPDPS)}, author={Drees, Maximilian and Hüllmann (married
name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012},
pages={1272–1283} }'
chicago: 'Drees, Maximilian, Martina Hüllmann (married name: Eikel), Andreas Koutsopoulos,
and Christian Scheideler. “Self-Organizing Particle Systems.” In Proceedings
of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS),
1272–83, 2012. https://doi.org/10.1109/IPDPS.2012.116.'
ieee: 'M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, and C. Scheideler,
“Self-Organizing Particle Systems,” in Proceedings of the 26th IEEE International
Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.'
mla: Drees, Maximilian, et al. “Self-Organizing Particle Systems.” Proceedings
of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS),
2012, pp. 1272–83, doi:10.1109/IPDPS.2012.116.
short: 'M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, C. Scheideler,
in: Proceedings of the 26th IEEE International Parallel and Distributed Processing
Symposium (IPDPS), 2012, pp. 1272–1283.'
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:42Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1109/IPDPS.2012.116
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:39:33Z
date_updated: 2018-03-15T08:39:33Z
file_id: '1263'
file_name: 581-IPDPS2012-Scheideler_Huellmann.pdf
file_size: 373131
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:39:33Z
has_accepted_license: '1'
language:
- iso: eng
page: 1272-1283
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 26th IEEE International Parallel and Distributed Processing
Symposium (IPDPS)
status: public
title: Self-Organizing Particle Systems
type: conference
user_id: '14955'
year: '2012'
...
---
_id: '582'
author:
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: Strothmann TF. Self-Optimizing Binary Search Trees - A Game Theoretic Approach.
Universität Paderborn; 2012.
apa: Strothmann, T. F. (2012). Self-Optimizing Binary Search Trees - A Game Theoretic
Approach. Universität Paderborn.
bibtex: '@book{Strothmann_2012, title={Self-Optimizing Binary Search Trees - A Game
Theoretic Approach}, publisher={Universität Paderborn}, author={Strothmann, Thim
Frederik}, year={2012} }'
chicago: Strothmann, Thim Frederik. Self-Optimizing Binary Search Trees - A Game
Theoretic Approach. Universität Paderborn, 2012.
ieee: T. F. Strothmann, Self-Optimizing Binary Search Trees - A Game Theoretic
Approach. Universität Paderborn, 2012.
mla: Strothmann, Thim Frederik. Self-Optimizing Binary Search Trees - A Game
Theoretic Approach. Universität Paderborn, 2012.
short: T.F. Strothmann, Self-Optimizing Binary Search Trees - A Game Theoretic Approach,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:42Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Self-Optimizing Binary Search Trees - A Game Theoretic Approach
type: mastersthesis
user_id: '477'
year: '2012'
...
---
_id: '583'
author:
- first_name: Julian
full_name: Drücker, Julian
last_name: Drücker
citation:
ama: Drücker J. Revenue-Maximizing Order of Sale in Sequential Auctions.
Universität Paderborn; 2012.
apa: Drücker, J. (2012). Revenue-maximizing Order of Sale in Sequential Auctions.
Universität Paderborn.
bibtex: '@book{Drücker_2012, title={Revenue-maximizing Order of Sale in Sequential
Auctions}, publisher={Universität Paderborn}, author={Drücker, Julian}, year={2012}
}'
chicago: Drücker, Julian. Revenue-Maximizing Order of Sale in Sequential Auctions.
Universität Paderborn, 2012.
ieee: J. Drücker, Revenue-maximizing Order of Sale in Sequential Auctions.
Universität Paderborn, 2012.
mla: Drücker, Julian. Revenue-Maximizing Order of Sale in Sequential Auctions.
Universität Paderborn, 2012.
short: J. Drücker, Revenue-Maximizing Order of Sale in Sequential Auctions, Universität
Paderborn, 2012.
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:43Z
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: Revenue-maximizing Order of Sale in Sequential Auctions
type: mastersthesis
user_id: '15504'
year: '2012'
...