---
_id: '556'
author:
- first_name: Tobias
full_name: Nickel, Tobias
last_name: Nickel
citation:
ama: Nickel T. Analyse von Benutzeranforderungen von Service-Kompositionen mittels
Modelchecking. Universität Paderborn; 2013.
apa: Nickel, T. (2013). Analyse von Benutzeranforderungen von Service-Kompositionen
mittels Modelchecking. Universität Paderborn.
bibtex: '@book{Nickel_2013, title={Analyse von Benutzeranforderungen von Service-Kompositionen
mittels Modelchecking}, publisher={Universität Paderborn}, author={Nickel, Tobias},
year={2013} }'
chicago: Nickel, Tobias. Analyse von Benutzeranforderungen von Service-Kompositionen
mittels Modelchecking. Universität Paderborn, 2013.
ieee: T. Nickel, Analyse von Benutzeranforderungen von Service-Kompositionen
mittels Modelchecking. Universität Paderborn, 2013.
mla: Nickel, Tobias. Analyse von Benutzeranforderungen von Service-Kompositionen
mittels Modelchecking. Universität Paderborn, 2013.
short: T. Nickel, Analyse von Benutzeranforderungen von Service-Kompositionen mittels
Modelchecking, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:40Z
date_updated: 2022-01-06T07:01:59Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '557'
abstract:
- lang: eng
text: Since the last two decades, the water consumption in Germany is decreasing,
which causes the water tanks and pipes in a water supply system to work inefficiently.
This paper proposes an approach for a decision support system, which helps to
decide how to plan new water tanks and resize existing tanks in water supply systems.
The approach uses a combination of network reduction, mathematical optimization
and hydraulic simulation. The mathematical optimization model is a nonconvex Mixed
Integer Quadratically Constrained Program (MIQCP), which is solved by a piecewise
linearization. As this may lead to many binary variables and therefore high computational
times, the size of the water supply system model is reduced before building the
optimization model. By applying several network reduction techniques there may
occur some hydraulic differences between the original network model and the reduced
network model. To make sure that the solution obtained in the optimization process
is feasible in the original water supply system, the solution is verified by a
hydraulic simulation tool.
author:
- first_name: Corinna
full_name: Hallmann, Corinna
last_name: Hallmann
citation:
ama: Hallmann C. An Approach for a Decision Support Systems to Optimize Water
Tanks in Water Supply Systems by Combining Network Reduction, Optimization and
Simulation. Universität Paderborn; 2013.
apa: Hallmann, C. (2013). An Approach for a Decision Support Systems to optimize
Water Tanks in Water Supply Systems by combining Network Reduction, Optimization
and Simulation. Universität Paderborn.
bibtex: '@book{Hallmann_2013, title={An Approach for a Decision Support Systems
to optimize Water Tanks in Water Supply Systems by combining Network Reduction,
Optimization and Simulation}, publisher={Universität Paderborn}, author={Hallmann,
Corinna}, year={2013} }'
chicago: Hallmann, Corinna. An Approach for a Decision Support Systems to Optimize
Water Tanks in Water Supply Systems by Combining Network Reduction, Optimization
and Simulation. Universität Paderborn, 2013.
ieee: C. Hallmann, An Approach for a Decision Support Systems to optimize Water
Tanks in Water Supply Systems by combining Network Reduction, Optimization and
Simulation. Universität Paderborn, 2013.
mla: Hallmann, Corinna. An Approach for a Decision Support Systems to Optimize
Water Tanks in Water Supply Systems by Combining Network Reduction, Optimization
and Simulation. Universität Paderborn, 2013.
short: C. Hallmann, An Approach for a Decision Support Systems to Optimize Water
Tanks in Water Supply Systems by Combining Network Reduction, Optimization and
Simulation, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:40Z
date_updated: 2022-01-06T07:01:59Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:27:58Z
date_updated: 2018-03-15T10:27:58Z
file_id: '1283'
file_name: 557-Hal13.pdf
file_size: 271038
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:27:58Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '15'
name: SFB 901 - Subprojekt C3
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: An Approach for a Decision Support Systems to optimize Water Tanks in Water
Supply Systems by combining Network Reduction, Optimization and Simulation
type: report
user_id: '15504'
year: '2013'
...
---
_id: '558'
citation:
ama: Flocchini P, Gao J, Kranakis E, Meyer auf der Heide F, eds. Algorithms for
Sensor Systems - 9th International Symposium on Algorithms and Experiments for
Sensor Systems, Wireless Networks and Distributed Robotics. Vol 8243. Springer;
2013. doi:10.1007/978-3-642-45346-5
apa: 'Flocchini, P., Gao, J., Kranakis, E., & Meyer auf der Heide, F. (Eds.).
(2013). Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
(Vol. 8243). Presented at the ALGOSENSORS 2013, Sophia Antipolis, France: Springer.
https://doi.org/10.1007/978-3-642-45346-5'
bibtex: '@book{Flocchini_Gao_Kranakis_Meyer auf der Heide_2013, series={LNCS}, title={Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics}, volume={8243},
DOI={10.1007/978-3-642-45346-5},
publisher={Springer}, year={2013}, collection={LNCS} }'
chicago: Flocchini, Paola, Jie Gao, Evangelos Kranakis, and Friedhelm Meyer auf
der Heide, eds. Algorithms for Sensor Systems - 9th International Symposium
on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed
Robotics. Vol. 8243. LNCS. Springer, 2013. https://doi.org/10.1007/978-3-642-45346-5.
ieee: P. Flocchini, J. Gao, E. Kranakis, and F. Meyer auf der Heide, Eds., Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, vol. 8243.
Springer, 2013.
mla: Flocchini, Paola, et al., editors. Algorithms for Sensor Systems - 9th International
Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks
and Distributed Robotics. Vol. 8243, Springer, 2013, doi:10.1007/978-3-642-45346-5.
short: P. Flocchini, J. Gao, E. Kranakis, F. Meyer auf der Heide, eds., Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, Springer, 2013.
conference:
end_date: 2013-09-06
location: Sophia Antipolis, France
name: ALGOSENSORS 2013
start_date: 2013-09-05
date_created: 2017-10-17T12:42:41Z
date_updated: 2022-01-06T07:02:02Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5
editor:
- first_name: Paola
full_name: Flocchini, Paola
last_name: Flocchini
- first_name: Jie
full_name: Gao, Jie
last_name: Gao
- first_name: Evangelos
full_name: Kranakis, Evangelos
last_name: Kranakis
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T16:29:07Z
date_updated: 2018-11-02T16:29:07Z
file_id: '5327'
file_name: 2014_Book_AlgorithmsForSensorSystems-1.pdf
file_size: 9186107
relation: main_file
success: 1
file_date_updated: 2018-11-02T16:29:07Z
has_accepted_license: '1'
intvolume: ' 8243'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Springer
series_title: LNCS
status: public
title: Algorithms for Sensor Systems - 9th International Symposium on Algorithms and
Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
type: conference_editor
user_id: '477'
volume: 8243
year: '2013'
...
---
_id: '559'
abstract:
- lang: eng
text: Distributed hash tables are very versatile to use, as distributed storage
is a desirable feature for various applications. Typical structured overlays like
Chord, Pastry or Kademlia consider only homogeneous nodes with equal capacities,
which does not resemble reality. In a practical use case, nodes might get overloaded
by storing popular data. In this paper, we present a general approach to enable
capacity awareness and load-balancing capability of homogeneous structured overlays.
We introduce a hierarchical second structured overlay aside, which allows efficient
capacity-based access on the nodes in the system as hosting mirrors. Simulation
results show that the structured overlay is able to store various contents, such
as of a social network, with only a negligible number of overloaded peers. Content,
even if very popular, is hosted by easily findable capable peers. Thus, long-existing
and well-evaluated overlays like Chord or Pastry can be used to create attractive
DHT-based applications.
author:
- first_name: Philip
full_name: Wette, Philip
last_name: Wette
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Wette P, Graffi K. Adding Capacity-Aware Storage Indirection to Homogeneous
Distributed Hash Tables. In: Proceedings of the Conference on Networked Systems
(NetSys). ; 2013:35-42. doi:10.1109/NetSys.2013.9'
apa: Wette, P., & Graffi, K. (2013). Adding Capacity-Aware Storage Indirection
to Homogeneous Distributed Hash Tables. In Proceedings of the Conference on
Networked Systems (NetSys) (pp. 35–42). https://doi.org/10.1109/NetSys.2013.9
bibtex: '@inproceedings{Wette_Graffi_2013, title={Adding Capacity-Aware Storage
Indirection to Homogeneous Distributed Hash Tables}, DOI={10.1109/NetSys.2013.9},
booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Wette,
Philip and Graffi, Kalman}, year={2013}, pages={35–42} }'
chicago: Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection
to Homogeneous Distributed Hash Tables.” In Proceedings of the Conference on
Networked Systems (NetSys), 35–42, 2013. https://doi.org/10.1109/NetSys.2013.9.
ieee: P. Wette and K. Graffi, “Adding Capacity-Aware Storage Indirection to Homogeneous
Distributed Hash Tables,” in Proceedings of the Conference on Networked Systems
(NetSys), 2013, pp. 35–42.
mla: Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection
to Homogeneous Distributed Hash Tables.” Proceedings of the Conference on Networked
Systems (NetSys), 2013, pp. 35–42, doi:10.1109/NetSys.2013.9.
short: 'P. Wette, K. Graffi, in: Proceedings of the Conference on Networked Systems
(NetSys), 2013, pp. 35–42.'
date_created: 2017-10-17T12:42:41Z
date_updated: 2022-01-06T07:02:04Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/NetSys.2013.9
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:27:21Z
date_updated: 2018-03-15T10:27:21Z
file_id: '1282'
file_name: 559-Adding.Capacity.Aware.Storage.Indirection.to.Homogeneous.Distributed.Hash.Tables.pdf
file_size: 734618
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:27:21Z
has_accepted_license: '1'
language:
- iso: eng
page: 35-42
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the Conference on Networked Systems (NetSys)
status: public
title: Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables
type: conference
user_id: '477'
year: '2013'
...
---
_id: '560'
abstract:
- lang: eng
text: In the last decades, development turned from monolithic software products
towards more flexible software components that can be provided on world-wide markets
in form of services. Customers request such services or compositions of several
services. However, in many cases, discovering the best services to address a given
request is a tough challenge and requires expressive, gradual matching results,
considering different aspects of a service description, e.g., inputs/ouputs, protocols,
or quality properties. Furthermore,in situations in which no service exactly satifies
the request, approximate matching which can deal with a certain amount of fuzziness
becomes necessary. There is a wealth of service matching approaches, but it is
not clear whether there is a comprehensive, fuzzy matching approach which addresses
all these challenges. Although there are a few service matchingsurveys, none of
them is able to answer this question. In this paper, we perform a systematic literature
survey of 35 (outof 504) service matching approaches which consider fuzzy matching.
Based on this survey, we propose a classication,discuss how different matching
approaches can be combined into a comprehensive matching method, and identify
future research challenges.
author:
- first_name: Marie
full_name: Platenius, Marie
last_name: Platenius
- first_name: Markus
full_name: von Detten, Markus
last_name: von Detten
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Platenius M, von Detten M, Becker S, Schäfer W, Engels G. A Survey of Fuzzy
Service Matching Approaches in the Context of On-The-Fly Computing. In: Proceedings
of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering.
; 2013:143-152. doi:10.1145/2465449.2465454'
apa: Platenius, M., von Detten, M., Becker, S., Schäfer, W., & Engels, G. (2013).
A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing.
In Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based
Software Engineering (pp. 143–152). https://doi.org/10.1145/2465449.2465454
bibtex: '@inproceedings{Platenius_von Detten_Becker_Schäfer_Engels_2013, title={A
Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing},
DOI={10.1145/2465449.2465454},
booktitle={Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based
Software Engineering}, author={Platenius, Marie and von Detten, Markus and Becker,
Steffen and Schäfer, Wilhelm and Engels, Gregor}, year={2013}, pages={143–152}
}'
chicago: Platenius, Marie, Markus von Detten, Steffen Becker, Wilhelm Schäfer, and
Gregor Engels. “A Survey of Fuzzy Service Matching Approaches in the Context of
On-The-Fly Computing.” In Proceedings of the 16th International ACM Sigsoft
Symposium on Component-Based Software Engineering, 143–52, 2013. https://doi.org/10.1145/2465449.2465454.
ieee: M. Platenius, M. von Detten, S. Becker, W. Schäfer, and G. Engels, “A Survey
of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing,”
in Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based
Software Engineering, 2013, pp. 143–152.
mla: Platenius, Marie, et al. “A Survey of Fuzzy Service Matching Approaches in
the Context of On-The-Fly Computing.” Proceedings of the 16th International
ACM Sigsoft Symposium on Component-Based Software Engineering, 2013, pp. 143–52,
doi:10.1145/2465449.2465454.
short: 'M. Platenius, M. von Detten, S. Becker, W. Schäfer, G. Engels, in: Proceedings
of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering,
2013, pp. 143–152.'
date_created: 2017-10-17T12:42:41Z
date_updated: 2022-01-06T07:02:06Z
ddc:
- '040'
department:
- _id: '66'
- _id: '76'
doi: 10.1145/2465449.2465454
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:26:49Z
date_updated: 2018-03-15T10:26:49Z
file_id: '1281'
file_name: 560-Platenius_et_al_CBSE2013.pdf
file_size: 570580
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:26:49Z
has_accepted_license: '1'
language:
- iso: eng
page: 143-152
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based
Software Engineering
status: public
title: A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly
Computing
type: conference
user_id: '477'
year: '2013'
...
---
_id: '561'
abstract:
- lang: eng
text: 'We present a privacy-friendly architecture for a future cloud computing scenario
where software licensing and software payment plays a major role. We show how
digital rights management as a technical solution for software licensing can be
achieved in a privacy-friendly manner. In our scenario, users who buy software
from software providers and execute it at computing centres stay anonymous. At
the same time, our approach guarantees that software licenses are bound to users
and that their validity is checked before execution. Thus, DRM constitutes an
incentive for software providers to take part in such a future cloud computing
scenario. We employ a software re-encryption scheme so that computing centres
are not able to build profiles of their users – not even under a pseudonym. We
make sure that malicious users are unable to relay software to others. '
author:
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
- first_name: Stephan
full_name: Sekula, Stephan
last_name: Sekula
- first_name: Christoph
full_name: Sorge, Christoph
last_name: Sorge
citation:
ama: Petrlic R, Sekula S, Sorge C. A privacy-friendly Architecture for future Cloud
Computing. International Journal of Grid and Utility Computing. 2013;(4):265-277.
doi:10.1504/IJGUC.2013.057120
apa: Petrlic, R., Sekula, S., & Sorge, C. (2013). A privacy-friendly Architecture
for future Cloud Computing. International Journal of Grid and Utility Computing,
(4), 265–277. https://doi.org/10.1504/IJGUC.2013.057120
bibtex: '@article{Petrlic_Sekula_Sorge_2013, title={A privacy-friendly Architecture
for future Cloud Computing}, DOI={10.1504/IJGUC.2013.057120},
number={4}, journal={International Journal of Grid and Utility Computing}, publisher={InderScience},
author={Petrlic, Ronald and Sekula, Stephan and Sorge, Christoph}, year={2013},
pages={265–277} }'
chicago: 'Petrlic, Ronald, Stephan Sekula, and Christoph Sorge. “A Privacy-Friendly
Architecture for Future Cloud Computing.” International Journal of Grid and
Utility Computing, no. 4 (2013): 265–77. https://doi.org/10.1504/IJGUC.2013.057120.'
ieee: R. Petrlic, S. Sekula, and C. Sorge, “A privacy-friendly Architecture for
future Cloud Computing,” International Journal of Grid and Utility Computing,
no. 4, pp. 265–277, 2013.
mla: Petrlic, Ronald, et al. “A Privacy-Friendly Architecture for Future Cloud Computing.”
International Journal of Grid and Utility Computing, no. 4, InderScience,
2013, pp. 265–77, doi:10.1504/IJGUC.2013.057120.
short: R. Petrlic, S. Sekula, C. Sorge, International Journal of Grid and Utility
Computing (2013) 265–277.
date_created: 2017-10-17T12:42:41Z
date_updated: 2022-01-06T07:02:07Z
ddc:
- '040'
doi: 10.1504/IJGUC.2013.057120
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:26:14Z
date_updated: 2018-03-15T10:26:14Z
file_id: '1280'
file_name: 561-authorFinalVersion.pdf
file_size: 1036554
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:26:14Z
has_accepted_license: '1'
issue: '4'
main_file_link:
- url: http://www.inderscience.com/offer.php?id=57120
page: 265-277
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: International Journal of Grid and Utility Computing
publisher: InderScience
status: public
title: A privacy-friendly Architecture for future Cloud Computing
type: journal_article
user_id: '477'
year: '2013'
...
---
_id: '562'
abstract:
- lang: eng
text: In Distributed Cloud Computing, applications are deployed across many data
centres at topologically diverse locations to improved network-related quality
of service (QoS). As we focus on interactive applications, we minimize the latency
between users and an application by allocating Cloud resources nearby the customers.
Allocating resources at all locations will result in the best latency but also
in the highest expenses. So we need to find an optimal subset of locations which
reduces the latency but also the expenses – the facility location problem (FLP).
In addition, we consider resource capacity restrictions, as a resource can only
serve a limited amount of users. An FLP can be globally solved. Additionally,
we propose a local, distributed heuristic. This heuristic is running within the
network and does not depend on a global component. No distributed, local approximations
for the capacitated FLP have been proposed so far due to the complexity of the
problem. We compared the heuristic with an optimal solution obtained from a mixed
integer program for different network topologies. We investigated the influence
of different parameters like overall resource utilization or different latency
weights.
author:
- first_name: Matthias
full_name: Keller, Matthias
last_name: Keller
- first_name: Stefan
full_name: Pawlik, Stefan
last_name: Pawlik
- first_name: Peter
full_name: Pietrzyk, Peter
last_name: Pietrzyk
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Keller M, Pawlik S, Pietrzyk P, Karl H. A Local Heuristic for Latency-Optimized
Distributed Cloud Deployment. In: Proceedings of the 6th International Conference
on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing.
; 2013:429-434. doi:10.1109/UCC.2013.85'
apa: Keller, M., Pawlik, S., Pietrzyk, P., & Karl, H. (2013). A Local Heuristic
for Latency-Optimized Distributed Cloud Deployment. In Proceedings of the 6th
International Conference on Utility and Cloud Computing (UCC) workshop on Distributed
cloud computing (pp. 429–434). https://doi.org/10.1109/UCC.2013.85
bibtex: '@inproceedings{Keller_Pawlik_Pietrzyk_Karl_2013, title={A Local Heuristic
for Latency-Optimized Distributed Cloud Deployment}, DOI={10.1109/UCC.2013.85},
booktitle={Proceedings of the 6th International Conference on Utility and Cloud
Computing (UCC) workshop on Distributed cloud computing}, author={Keller, Matthias
and Pawlik, Stefan and Pietrzyk, Peter and Karl, Holger}, year={2013}, pages={429–434}
}'
chicago: Keller, Matthias, Stefan Pawlik, Peter Pietrzyk, and Holger Karl. “A Local
Heuristic for Latency-Optimized Distributed Cloud Deployment.” In Proceedings
of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop
on Distributed Cloud Computing, 429–34, 2013. https://doi.org/10.1109/UCC.2013.85.
ieee: M. Keller, S. Pawlik, P. Pietrzyk, and H. Karl, “A Local Heuristic for Latency-Optimized
Distributed Cloud Deployment,” in Proceedings of the 6th International Conference
on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing,
2013, pp. 429–434.
mla: Keller, Matthias, et al. “A Local Heuristic for Latency-Optimized Distributed
Cloud Deployment.” Proceedings of the 6th International Conference on Utility
and Cloud Computing (UCC) Workshop on Distributed Cloud Computing, 2013, pp.
429–34, doi:10.1109/UCC.2013.85.
short: 'M. Keller, S. Pawlik, P. Pietrzyk, H. Karl, in: Proceedings of the 6th International
Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud
Computing, 2013, pp. 429–434.'
date_created: 2017-10-17T12:42:41Z
date_updated: 2022-01-06T07:02:11Z
ddc:
- '040'
department:
- _id: '75'
- _id: '63'
doi: 10.1109/UCC.2013.85
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:25:45Z
date_updated: 2018-03-15T10:25:45Z
file_id: '1279'
file_name: 562-dcc13_paper.pdf
file_size: 347873
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:25:45Z
has_accepted_license: '1'
language:
- iso: eng
page: 429-434
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 6th International Conference on Utility and Cloud
Computing (UCC) workshop on Distributed cloud computing
status: public
title: A Local Heuristic for Latency-Optimized Distributed Cloud Deployment
type: conference
user_id: '477'
year: '2013'
...
---
_id: '563'
abstract:
- lang: eng
text: Dominating set based virtual backbones are used for rou-ting in wireless ad-hoc
networks. Such backbones receive and transmit messages from/to every node in the
network. Existing distributed algorithms only consider undirected graphs, which
model symmetric networks with uniform transmission ranges. We are particularly
interested in the well-established disk graphs, which model asymmetric networks
with non-uniform transmission ranges. The corresponding graph theoretic problem
seeks a strongly connected dominating-absorbent set of minimum cardinality in
a digraph. A subset of nodes in a digraph is a strongly connected dominating-absorbent
set if the subgraph induced by these nodes is strongly connected and each node
in the graph is either in the set or has both an in-neighbor and an out-neighbor
in it. We introduce the first distributed algorithm for this problem in disk graphs.
The algorithm gives an O(k^4) -approximation ratio and has a runtime bound of
O(Diam) where Diam is the diameter of the graph and k denotes the transmission
ratio r_{max}/r_{min} with r_{max} and r_{min} being the maximum and minimum transmission
range, respectively. Moreover, we apply our algorithm on the subgraph of disk
graphs consisting of only bidirectional edges. Our algorithm gives an O(ln k)
-approximation and a runtime bound of O(k^8 log^∗ n) , which, for bounded k ,
is an optimal approximation for the problem, following Lenzen and Wattenhofer’s
Ω(log^∗ n) runtime lower bound for distributed constant approximation in disk
graphs.
author:
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Michael
full_name: Schubert, Michael
last_name: Schubert
citation:
ama: 'Markarian C, Meyer auf der Heide F, Schubert M. A Distributed Approximation
Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless
Ad-Hoc Networks. In: Proceedings of the 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
(ALGOSENSORS). LNCS. ; 2013:217-227. doi:10.1007/978-3-642-45346-5_16'
apa: Markarian, C., Meyer auf der Heide, F., & Schubert, M. (2013). A Distributed
Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric
Wireless Ad-Hoc Networks. In Proceedings of the 9th International Symposium
on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed
Robotics (ALGOSENSORS) (pp. 217–227). https://doi.org/10.1007/978-3-642-45346-5_16
bibtex: '@inproceedings{Markarian_Meyer auf der Heide_Schubert_2013, series={LNCS},
title={A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent
Sets in Asymmetric Wireless Ad-Hoc Networks}, DOI={10.1007/978-3-642-45346-5_16},
booktitle={Proceedings of the 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)},
author={Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert,
Michael}, year={2013}, pages={217–227}, collection={LNCS} }'
chicago: Markarian, Christine, Friedhelm Meyer auf der Heide, and Michael Schubert.
“A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent
Sets in Asymmetric Wireless Ad-Hoc Networks.” In Proceedings of the 9th International
Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks
and Distributed Robotics (ALGOSENSORS), 217–27. LNCS, 2013. https://doi.org/10.1007/978-3-642-45346-5_16.
ieee: C. Markarian, F. Meyer auf der Heide, and M. Schubert, “A Distributed Approximation
Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless
Ad-Hoc Networks,” in Proceedings of the 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
(ALGOSENSORS), 2013, pp. 217–227.
mla: Markarian, Christine, et al. “A Distributed Approximation Algorithm for Strongly
Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks.” Proceedings
of the 9th International Symposium on Algorithms and Experiments for Sensor Systems,
Wireless Networks and Distributed Robotics (ALGOSENSORS), 2013, pp. 217–27,
doi:10.1007/978-3-642-45346-5_16.
short: 'C. Markarian, F. Meyer auf der Heide, M. Schubert, in: Proceedings of the
9th International Symposium on Algorithms and Experiments for Sensor Systems,
Wireless Networks and Distributed Robotics (ALGOSENSORS), 2013, pp. 217–227.'
date_created: 2017-10-17T12:42:42Z
date_updated: 2022-01-06T07:02:13Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5_16
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:25:15Z
date_updated: 2018-03-15T10:25:15Z
file_id: '1278'
file_name: 563-978-3-642-45346-5_16.pdf
file_size: 348191
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:25:15Z
has_accepted_license: '1'
page: 217-227
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)
series_title: LNCS
status: public
title: A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent
Sets in Asymmetric Wireless Ad-Hoc Networks
type: conference
user_id: '477'
year: '2013'
...
---
_id: '564'
abstract:
- lang: eng
text: We consider the problem of resource discovery in distributed systems. In particular
we give an algorithm, such that each node in a network discovers the add ress
of any other node in the network. We model the knowledge of the nodes as a virtual
overlay network given by a directed graph such that complete knowledge of all
nodes corresponds to a complete graph in the overlay network. Although there are
several solutions for resource discovery, our solution is the first that achieves
worst-case optimal work for each node, i.e. the number of addresses (O(n)) or
bits (O(nlogn)) a node receives or sendscoincides with the lower bound, while
ensuring only a linearruntime (O(n)) on the number of rounds.
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. A Deterministic Worst-Case Message
Complexity Optimal Solution for Resource Discovery. In: Proceedings of 20th
International Colloqium on Structural Information and Communication Complexity
(SIROCCO). Lecture Notes in Computer Science. ; 2013:165-176. doi:10.1007/978-3-319-03578-9_14'
apa: Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2013). A Deterministic
Worst-Case Message Complexity Optimal Solution for Resource Discovery. In Proceedings
of 20th International Colloqium on Structural Information and Communication Complexity
(SIROCCO) (pp. 165–176). https://doi.org/10.1007/978-3-319-03578-9_14
bibtex: '@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2013, series={Lecture
Notes in Computer Science}, title={A Deterministic Worst-Case Message Complexity
Optimal Solution for Resource Discovery}, DOI={10.1007/978-3-319-03578-9_14},
booktitle={Proceedings of 20th International Colloqium on Structural Information
and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Koutsopoulos,
Andreas and Scheideler, Christian}, year={2013}, pages={165–176}, collection={Lecture
Notes in Computer Science} }'
chicago: Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
“A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.”
In Proceedings of 20th International Colloqium on Structural Information and
Communication Complexity (SIROCCO), 165–76. Lecture Notes in Computer Science,
2013. https://doi.org/10.1007/978-3-319-03578-9_14.
ieee: S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Deterministic Worst-Case
Message Complexity Optimal Solution for Resource Discovery,” in Proceedings
of 20th International Colloqium on Structural Information and Communication Complexity
(SIROCCO), 2013, pp. 165–176.
mla: Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity
Optimal Solution for Resource Discovery.” Proceedings of 20th International
Colloqium on Structural Information and Communication Complexity (SIROCCO),
2013, pp. 165–76, doi:10.1007/978-3-319-03578-9_14.
short: 'S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of 20th
International Colloqium on Structural Information and Communication Complexity
(SIROCCO), 2013, pp. 165–176.'
date_created: 2017-10-17T12:42:42Z
date_updated: 2022-01-06T07:02:17Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-03578-9_14
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:24:40Z
date_updated: 2018-03-15T10:24:40Z
file_id: '1277'
file_name: 564-SIROCCO13.pdf
file_size: 168884
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:24:40Z
has_accepted_license: '1'
page: 165-176
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of 20th International Colloqium on Structural Information
and Communication Complexity (SIROCCO)
series_title: Lecture Notes in Computer Science
status: public
title: A Deterministic Worst-Case Message Complexity Optimal Solution for Resource
Discovery
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '528'
abstract:
- lang: eng
text: Cold-boot attacks exploit the fact that DRAM contents are not immediately
lost when a PC is powered off. Instead the contents decay rather slowly, in particular
if the DRAM chips are cooled to low temperatures. This effect opens an attack
vector on cryptographic applications that keep decrypted keys in DRAM. An attacker
with access to the target computer can reboot it or remove the RAM modules and
quickly copy the RAM contents to non-volatile memory. By exploiting the known
cryptographic structure of the cipher and layout of the key data in memory, in
our application an AES key schedule with redundancy, the resulting memory image
can be searched for sections that could correspond to decayed cryptographic keys;
then, the attacker can attempt to reconstruct the original key. However, the runtime
of these algorithms grows rapidly with increasing memory image size, error rate
and complexity of the bit error model, which limits the practicability of the
approach.In this work, we study how the algorithm for key search can be accelerated
with custom computing machines. We present an FPGA-based architecture on a Maxeler
dataflow computing system that outperforms a software implementation up to 205x,
which significantly improves the practicability of cold-attacks against AES.
author:
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Christoph
full_name: Sorge, Christoph
last_name: Sorge
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Riebler H, Kenter T, Sorge C, Plessl C. FPGA-accelerated Key Search for Cold-Boot
Attacks against AES. In: Proceedings of the International Conference on Field-Programmable
Technology (FPT). IEEE; 2013:386-389. doi:10.1109/FPT.2013.6718394'
apa: Riebler, H., Kenter, T., Sorge, C., & Plessl, C. (2013). FPGA-accelerated
Key Search for Cold-Boot Attacks against AES. Proceedings of the International
Conference on Field-Programmable Technology (FPT), 386–389. https://doi.org/10.1109/FPT.2013.6718394
bibtex: '@inproceedings{Riebler_Kenter_Sorge_Plessl_2013, title={FPGA-accelerated
Key Search for Cold-Boot Attacks against AES}, DOI={10.1109/FPT.2013.6718394},
booktitle={Proceedings of the International Conference on Field-Programmable Technology
(FPT)}, publisher={IEEE}, author={Riebler, Heinrich and Kenter, Tobias and Sorge,
Christoph and Plessl, Christian}, year={2013}, pages={386–389} }'
chicago: Riebler, Heinrich, Tobias Kenter, Christoph Sorge, and Christian Plessl.
“FPGA-Accelerated Key Search for Cold-Boot Attacks against AES.” In Proceedings
of the International Conference on Field-Programmable Technology (FPT), 386–89.
IEEE, 2013. https://doi.org/10.1109/FPT.2013.6718394.
ieee: 'H. Riebler, T. Kenter, C. Sorge, and C. Plessl, “FPGA-accelerated Key Search
for Cold-Boot Attacks against AES,” in Proceedings of the International Conference
on Field-Programmable Technology (FPT), 2013, pp. 386–389, doi: 10.1109/FPT.2013.6718394.'
mla: Riebler, Heinrich, et al. “FPGA-Accelerated Key Search for Cold-Boot Attacks
against AES.” Proceedings of the International Conference on Field-Programmable
Technology (FPT), IEEE, 2013, pp. 386–89, doi:10.1109/FPT.2013.6718394.
short: 'H. Riebler, T. Kenter, C. Sorge, C. Plessl, in: Proceedings of the International
Conference on Field-Programmable Technology (FPT), IEEE, 2013, pp. 386–389.'
date_created: 2017-10-17T12:42:35Z
date_updated: 2023-09-26T13:37:35Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/FPT.2013.6718394
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:36:08Z
date_updated: 2018-03-15T10:36:08Z
file_id: '1294'
file_name: 528-plessl13_fpt.pdf
file_size: 822680
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:36:08Z
has_accepted_license: '1'
keyword:
- coldboot
language:
- iso: eng
page: 386-389
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '34'
grant_number: '610996'
name: Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous
System Architectures
publication: Proceedings of the International Conference on Field-Programmable Technology
(FPT)
publisher: IEEE
quality_controlled: '1'
status: public
title: FPGA-accelerated Key Search for Cold-Boot Attacks against AES
type: conference
user_id: '15278'
year: '2013'
...
---
_id: '505'
abstract:
- lang: eng
text: In this paper we introduce “On-The-Fly Computing”, our vision of future IT
services that will be provided by assembling modular software components available
on world-wide markets. After suitable components have been found, they are automatically
integrated, configured and brought to execution in an On-The-Fly Compute Center.
We envision that these future compute centers will continue to leverage three
current trends in large scale computing which are an increasing amount of parallel
processing, a trend to use heterogeneous computing resources, and—in the light
of rising energy cost—energy-efficiency as a primary goal in the design and operation
of computing systems. In this paper, we point out three research challenges and
our current work in these areas.
author:
- first_name: Markus
full_name: Happe, Markus
last_name: Happe
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Happe M, Kling P, Plessl C, Platzner M, Meyer auf der Heide F. On-The-Fly
Computing: A Novel Paradigm for Individualized IT Services. In: Proceedings
of the 9th IEEE Workshop on Software Technology for Future Embedded and Ubiquitous
Systems (SEUS). IEEE; 2013. doi:10.1109/ISORC.2013.6913232'
apa: 'Happe, M., Kling, P., Plessl, C., Platzner, M., & Meyer auf der Heide,
F. (2013). On-The-Fly Computing: A Novel Paradigm for Individualized IT Services.
Proceedings of the 9th IEEE Workshop on Software Technology for Future Embedded
and Ubiquitous Systems (SEUS). https://doi.org/10.1109/ISORC.2013.6913232'
bibtex: '@inproceedings{Happe_Kling_Plessl_Platzner_Meyer auf der Heide_2013, title={On-The-Fly
Computing: A Novel Paradigm for Individualized IT Services}, DOI={10.1109/ISORC.2013.6913232},
booktitle={Proceedings of the 9th IEEE Workshop on Software Technology for Future
embedded and Ubiquitous Systems (SEUS)}, publisher={IEEE}, author={Happe, Markus
and Kling, Peter and Plessl, Christian and Platzner, Marco and Meyer auf der Heide,
Friedhelm}, year={2013} }'
chicago: 'Happe, Markus, Peter Kling, Christian Plessl, Marco Platzner, and Friedhelm
Meyer auf der Heide. “On-The-Fly Computing: A Novel Paradigm for Individualized
IT Services.” In Proceedings of the 9th IEEE Workshop on Software Technology
for Future Embedded and Ubiquitous Systems (SEUS). IEEE, 2013. https://doi.org/10.1109/ISORC.2013.6913232.'
ieee: 'M. Happe, P. Kling, C. Plessl, M. Platzner, and F. Meyer auf der Heide, “On-The-Fly
Computing: A Novel Paradigm for Individualized IT Services,” 2013, doi: 10.1109/ISORC.2013.6913232.'
mla: 'Happe, Markus, et al. “On-The-Fly Computing: A Novel Paradigm for Individualized
IT Services.” Proceedings of the 9th IEEE Workshop on Software Technology for
Future Embedded and Ubiquitous Systems (SEUS), IEEE, 2013, doi:10.1109/ISORC.2013.6913232.'
short: 'M. Happe, P. Kling, C. Plessl, M. Platzner, F. Meyer auf der Heide, in:
Proceedings of the 9th IEEE Workshop on Software Technology for Future Embedded
and Ubiquitous Systems (SEUS), IEEE, 2013.'
date_created: 2017-10-17T12:42:30Z
date_updated: 2023-09-26T13:38:20Z
ddc:
- '040'
department:
- _id: '63'
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/ISORC.2013.6913232
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:38:56Z
date_updated: 2018-03-15T13:38:56Z
file_id: '1308'
file_name: 505-Plessl13_seus.pdf
file_size: 1040834
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:38:56Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 9th IEEE Workshop on Software Technology for Future
embedded and Ubiquitous Systems (SEUS)
publisher: IEEE
quality_controlled: '1'
status: public
title: 'On-The-Fly Computing: A Novel Paradigm for Individualized IT Services'
type: conference
user_id: '15278'
year: '2013'
...
---
_id: '2519'
author:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
- first_name: Jan Thomas
full_name: Martini, Jan Thomas
last_name: Martini
citation:
ama: Haake C-J, Martini JT. Negotiating Transfer Prices. Group Decision and Negotiation.
2012;22(4):657-680. doi:10.1007/s10726-012-9286-6
apa: Haake, C.-J., & Martini, J. T. (2012). Negotiating Transfer Prices. Group
Decision and Negotiation, 22(4), 657–680. https://doi.org/10.1007/s10726-012-9286-6
bibtex: '@article{Haake_Martini_2012, title={Negotiating Transfer Prices}, volume={22},
DOI={10.1007/s10726-012-9286-6},
number={4}, journal={Group Decision and Negotiation}, publisher={Springer Nature},
author={Haake, Claus-Jochen and Martini, Jan Thomas}, year={2012}, pages={657–680}
}'
chicago: 'Haake, Claus-Jochen, and Jan Thomas Martini. “Negotiating Transfer Prices.”
Group Decision and Negotiation 22, no. 4 (2012): 657–80. https://doi.org/10.1007/s10726-012-9286-6.'
ieee: C.-J. Haake and J. T. Martini, “Negotiating Transfer Prices,” Group Decision
and Negotiation, vol. 22, no. 4, pp. 657–680, 2012.
mla: Haake, Claus-Jochen, and Jan Thomas Martini. “Negotiating Transfer Prices.”
Group Decision and Negotiation, vol. 22, no. 4, Springer Nature, 2012,
pp. 657–80, doi:10.1007/s10726-012-9286-6.
short: C.-J. Haake, J.T. Martini, Group Decision and Negotiation 22 (2012) 657–680.
date_created: 2018-04-26T10:49:51Z
date_updated: 2022-01-06T06:56:54Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
doi: 10.1007/s10726-012-9286-6
file:
- access_level: closed
content_type: application/pdf
creator: cjhaake
date_created: 2018-08-09T09:59:39Z
date_updated: 2018-08-09T09:59:39Z
file_id: '3870'
file_name: Negotiating Transfer Prices.pdf
file_size: 407410
relation: main_file
success: 1
file_date_updated: 2018-08-09T09:59:39Z
has_accepted_license: '1'
intvolume: ' 22'
issue: '4'
language:
- iso: eng
page: 657-680
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publication: Group Decision and Negotiation
publication_identifier:
issn:
- 0926-2644
- 1572-9907
publication_status: published
publisher: Springer Nature
status: public
title: Negotiating Transfer Prices
type: journal_article
user_id: '65453'
volume: 22
year: '2012'
...
---
_id: '2521'
author:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
- first_name: Tim
full_name: Krieger, Tim
last_name: Krieger
- first_name: Steffen
full_name: Minter, Steffen
last_name: Minter
citation:
ama: Haake C-J, Krieger T, Minter S. On the institutional design of burden sharing
when financing external border enforcement in the EU. International Economics
and Economic Policy. 2012;10(4):583-612. doi:10.1007/s10368-012-0226-3
apa: Haake, C.-J., Krieger, T., & Minter, S. (2012). On the institutional design
of burden sharing when financing external border enforcement in the EU. International
Economics and Economic Policy, 10(4), 583–612. https://doi.org/10.1007/s10368-012-0226-3
bibtex: '@article{Haake_Krieger_Minter_2012, title={On the institutional design
of burden sharing when financing external border enforcement in the EU}, volume={10},
DOI={10.1007/s10368-012-0226-3},
number={4}, journal={International Economics and Economic Policy}, publisher={Springer
Nature}, author={Haake, Claus-Jochen and Krieger, Tim and Minter, Steffen}, year={2012},
pages={583–612} }'
chicago: 'Haake, Claus-Jochen, Tim Krieger, and Steffen Minter. “On the Institutional
Design of Burden Sharing When Financing External Border Enforcement in the EU.”
International Economics and Economic Policy 10, no. 4 (2012): 583–612.
https://doi.org/10.1007/s10368-012-0226-3.'
ieee: C.-J. Haake, T. Krieger, and S. Minter, “On the institutional design of burden
sharing when financing external border enforcement in the EU,” International
Economics and Economic Policy, vol. 10, no. 4, pp. 583–612, 2012.
mla: Haake, Claus-Jochen, et al. “On the Institutional Design of Burden Sharing
When Financing External Border Enforcement in the EU.” International Economics
and Economic Policy, vol. 10, no. 4, Springer Nature, 2012, pp. 583–612, doi:10.1007/s10368-012-0226-3.
short: C.-J. Haake, T. Krieger, S. Minter, International Economics and Economic
Policy 10 (2012) 583–612.
date_created: 2018-04-26T10:51:03Z
date_updated: 2022-01-06T06:56:55Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
doi: 10.1007/s10368-012-0226-3
file:
- access_level: closed
content_type: application/pdf
creator: cjhaake
date_created: 2018-08-09T10:01:16Z
date_updated: 2018-08-09T10:01:16Z
file_id: '3871'
file_name: On the institutional design of burden sharing when financing external
border enforcement in the EU.pdf
file_size: 442955
relation: main_file
success: 1
file_date_updated: 2018-08-09T10:01:16Z
has_accepted_license: '1'
intvolume: ' 10'
issue: '4'
language:
- iso: eng
page: 583-612
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publication: International Economics and Economic Policy
publication_identifier:
issn:
- 1612-4804
- 1612-4812
publication_status: published
publisher: Springer Nature
status: public
title: On the institutional design of burden sharing when financing external border
enforcement in the EU
type: journal_article
user_id: '65453'
volume: 10
year: '2012'
...
---
_id: '568'
abstract:
- lang: eng
text: A major goal of the On-The-Fly Computing project is the automated composition
of individual services based on services that are available in dynamic markets.
Dependent on the granularity of a market, different alternatives that satisfy
the requested functional requirements may emerge. In order to select the best
solution, services are usually selected with respect to their quality in terms
of inherent non-functional properties. In this paper, we describe our idea of
how to model this service selection process as a Markov Decision Process, which
we in turn intend to solve by means of Reinforcement Learning techniques in order
to control the underlying service composition process. In addition, some initial
issues with respect to our approach are addressed.
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 the Application of Reinforcement Learning
Techniques for Quality-Based Service Selection in Automated Service Composition.
In: Proceedings of the 9th IEEE International Conference on Service Computing
(SCC). ; 2012:701-702. doi:10.1109/SCC.2012.76'
apa: Jungmann, A., & Kleinjohann, B. (2012). Towards the Application of Reinforcement
Learning Techniques for Quality-Based Service Selection in Automated Service Composition.
In Proceedings of the 9th IEEE International Conference on Service Computing
(SCC) (pp. 701–702). https://doi.org/10.1109/SCC.2012.76
bibtex: '@inproceedings{Jungmann_Kleinjohann_2012, title={Towards the Application
of Reinforcement Learning Techniques for Quality-Based Service Selection in Automated
Service Composition}, DOI={10.1109/SCC.2012.76},
booktitle={Proceedings of the 9th IEEE International Conference on Service Computing
(SCC)}, author={Jungmann, Alexander and Kleinjohann, Bernd}, year={2012}, pages={701–702}
}'
chicago: Jungmann, Alexander, and Bernd Kleinjohann. “Towards the Application of
Reinforcement Learning Techniques for Quality-Based Service Selection in Automated
Service Composition.” In Proceedings of the 9th IEEE International Conference
on Service Computing (SCC), 701–2, 2012. https://doi.org/10.1109/SCC.2012.76.
ieee: A. Jungmann and B. Kleinjohann, “Towards the Application of Reinforcement
Learning Techniques for Quality-Based Service Selection in Automated Service Composition,”
in Proceedings of the 9th IEEE International Conference on Service Computing
(SCC), 2012, pp. 701–702.
mla: Jungmann, Alexander, and Bernd Kleinjohann. “Towards the Application of Reinforcement
Learning Techniques for Quality-Based Service Selection in Automated Service Composition.”
Proceedings of the 9th IEEE International Conference on Service Computing (SCC),
2012, pp. 701–02, doi:10.1109/SCC.2012.76.
short: 'A. Jungmann, B. Kleinjohann, in: Proceedings of the 9th IEEE International
Conference on Service Computing (SCC), 2012, pp. 701–702.'
date_created: 2017-10-17T12:42:43Z
date_updated: 2022-01-06T07:02:31Z
ddc:
- '040'
doi: 10.1109/SCC.2012.76
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:19:51Z
date_updated: 2018-03-15T10:19:51Z
file_id: '1274'
file_name: 568-Towards_the_Application_of_Reinforcement_Learning_Techniques_for_Quality-Based_Service_Selection_in_Automated_Service_Composition.pdf
file_size: 122607
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:19:51Z
has_accepted_license: '1'
page: 701-702
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 9th IEEE International Conference on Service Computing
(SCC)
status: public
title: Towards the Application of Reinforcement Learning Techniques for Quality-Based
Service Selection in Automated Service Composition
type: conference
user_id: '15504'
year: '2012'
...
---
_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: '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'
...