---
_id: '547'
abstract:
- lang: eng
text: 'In recent years, the role of process models in the development of enterprise
software systems has increased continuously. Today, process models are used at
different levels in the development process. For instance, in Service-Oriented
Architectures (SOA), high-level business process models become input for the development
of IT systems, and in running IT systems executable process models describe choreographies
of Web Services. A key driver behind this development is the necessity for a closer
alignment of business and IT requirements, to reduce the reaction times in software
development to frequent changes in competitive markets.Typically in these scenarios,
process models are developed, maintained, and transformed in a team environment
by several stakeholders that are often from different business units, resulting
in different versions. To obtain integrated process models comprising the changes
applied to different versions, the versions need to be consolidated by means of
model change management. Change management for process models can be compared
to widely used concurrent versioning systems (CVS) and consists of the following
major activities: matching of process models, detection of differences, computation
of dependencies and conflicts between differences, and merging of process models.Although
in general model-driven development (MDD) is accepted as a well-established development
approach, there are still some shortcomings that let developers decide against
MDD and for more traditional development paradigms. These shortcomings comprise
a lack of fully integrated and fully featured development environments for MDD,
such as a comprehensive support for model change management.In this thesis, we
present a framework for process model change management. The framework is based
on an intermediate representation for process models that serves as an abstraction
of specific process modeling languages and focuses on common syntactic and semantic
core concepts for the modeling of workflow in process models. Based on the intermediate
representation, we match process models in versioning scenarios and compute differences
between process models generically. Further, we consider the analysis of dependencies
between differences and show how conflicts between differences can be computed
by taking into account the semantics of the modeling language.As proof-of concept,
we have implemented major parts of this framework in terms of a prototype. The
detection of differences and dependencies contributed also to the Compare & Merge
framework for the IBM WebSphere Business Modeler V 7.0 [1] (WBM), which was released
as a product in fall 2009.'
author:
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
citation:
ama: Gerth C. Business Process Models - Change Management. Universität Paderborn;
2013. doi:10.1007/978-3-642-38604-6
apa: Gerth, C. (2013). Business Process Models - Change Management. Universität
Paderborn. https://doi.org/10.1007/978-3-642-38604-6
bibtex: '@book{Gerth_2013, title={Business Process Models - Change Management},
DOI={10.1007/978-3-642-38604-6},
publisher={Universität Paderborn}, author={Gerth, Christian}, year={2013} }'
chicago: Gerth, Christian. Business Process Models - Change Management. Universität
Paderborn, 2013. https://doi.org/10.1007/978-3-642-38604-6.
ieee: C. Gerth, Business Process Models - Change Management. Universität
Paderborn, 2013.
mla: Gerth, Christian. Business Process Models - Change Management. Universität
Paderborn, 2013, doi:10.1007/978-3-642-38604-6.
short: C. Gerth, Business Process Models - Change Management, Universität Paderborn,
2013.
date_created: 2017-10-17T12:42:39Z
date_updated: 2022-01-06T07:01:55Z
department:
- _id: '66'
doi: 10.1007/978-3-642-38604-6
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
title: Business Process Models - Change Management
type: dissertation
user_id: '477'
year: '2013'
...
---
_id: '548'
abstract:
- lang: eng
text: Peer-to-peer systems scale to millions of nodes and provide routing and storage
functions with best effort quality. In order to provide a guaranteed quality of
the overlay functions, even under strong dynamics in the network with regard to
peer capacities, online participation and usage patterns, we propose to calibrate
the peer-to-peer overlay and to autonomously learn which qualities can be reached.
For that, we simulate the peer-to-peer overlay systematically under a wide range
of parameter configurations and use neural networks to learn the effects of the
configurations on the quality metrics. Thus, by choosing a specific quality setting
by the overlay operator, the network can tune itself to the learned parameter
configurations that lead to the desired quality. Evaluation shows that the presented
self-calibration succeeds in learning the configuration-quality interdependencies
and that peer-to-peer systems can learn and adapt their behavior according to
desired quality goals.
author:
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
- first_name: Timo
full_name: Klerx, Timo
last_name: Klerx
citation:
ama: 'Graffi K, Klerx T. Bootstrapping Skynet: Calibration and Autonomic Self-Control
of Structured Peer-to-Peer Networks. In: Proceedings of the International Conference
on Peer-to-Peer Computing (P2P’13). ; 2013:1-5. doi:10.1109/P2P.2013.6688720'
apa: 'Graffi, K., & Klerx, T. (2013). Bootstrapping Skynet: Calibration and
Autonomic Self-Control of Structured Peer-to-Peer Networks. In Proceedings
of the International Conference on Peer-to-Peer Computing (P2P’13) (pp. 1–5).
https://doi.org/10.1109/P2P.2013.6688720'
bibtex: '@inproceedings{Graffi_Klerx_2013, title={Bootstrapping Skynet: Calibration
and Autonomic Self-Control of Structured Peer-to-Peer Networks}, DOI={10.1109/P2P.2013.6688720},
booktitle={Proceedings of the International Conference on Peer-to-Peer Computing
(P2P’13)}, author={Graffi, Kalman and Klerx, Timo}, year={2013}, pages={1–5} }'
chicago: 'Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and
Autonomic Self-Control of Structured Peer-to-Peer Networks.” In Proceedings
of the International Conference on Peer-to-Peer Computing (P2P’13), 1–5, 2013.
https://doi.org/10.1109/P2P.2013.6688720.'
ieee: 'K. Graffi and T. Klerx, “Bootstrapping Skynet: Calibration and Autonomic
Self-Control of Structured Peer-to-Peer Networks,” in Proceedings of the International
Conference on Peer-to-Peer Computing (P2P’13), 2013, pp. 1–5.'
mla: 'Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and Autonomic
Self-Control of Structured Peer-to-Peer Networks.” Proceedings of the International
Conference on Peer-to-Peer Computing (P2P’13), 2013, pp. 1–5, doi:10.1109/P2P.2013.6688720.'
short: 'K. Graffi, T. Klerx, in: Proceedings of the International Conference on
Peer-to-Peer Computing (P2P’13), 2013, pp. 1–5.'
date_created: 2017-10-17T12:42:39Z
date_updated: 2022-01-06T07:01:56Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/P2P.2013.6688720
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:30:09Z
date_updated: 2018-03-15T10:30:09Z
file_id: '1285'
file_name: 548-Bootstrapping.Skynet.Calibration.and.Autonomic.Self-Control.of.Structured.P2P.Networks_01.pdf
file_size: 629234
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:30:09Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-5
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the International Conference on Peer-to-Peer Computing
(P2P'13)
status: public
title: 'Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured
Peer-to-Peer Networks'
type: conference
user_id: '477'
year: '2013'
...
---
_id: '551'
abstract:
- lang: eng
text: In the service-oriented computing domain, the number of available software
services steadily increased in recent years, favored by the rise of cloud computing
with its attached delivery models like Software-as-a-Service (SaaS). To fully
leverage the opportunities provided by these services for developing highly flexible
and aligned SOA, integration of new services as well as the substitution of existing
services must be simplified. As a consequence, approaches for automated and accurate
service discovery and composition are needed. In this paper, we propose an automatic
service composition approach as an extension to our earlier work on automatic
service discovery. To ensure accurate results, it matches service requests and
available offers based on their structural as well as behavioral aspects. Afterwards,
possible service compositions are determined by composing service protocols through
a composition strategy based on labeled transition systems.
author:
- first_name: Zille
full_name: Huma, Zille
last_name: Huma
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Oliver
full_name: Juwig, Oliver
last_name: Juwig
citation:
ama: 'Huma Z, Gerth C, Engels G, Juwig O. Automated Service Composition for On-the-Fly
SOAs. In: Proceedings of the 11th International Conference on Service Oriented
Computing (ICSOC’13). LNCS. ; 2013:524--532. doi:10.1007/978-3-642-45005-1_42'
apa: Huma, Z., Gerth, C., Engels, G., & Juwig, O. (2013). Automated Service
Composition for On-the-Fly SOAs. In Proceedings of the 11th International Conference
on Service Oriented Computing (ICSOC’13) (pp. 524--532). https://doi.org/10.1007/978-3-642-45005-1_42
bibtex: '@inproceedings{Huma_Gerth_Engels_Juwig_2013, series={LNCS}, title={Automated
Service Composition for On-the-Fly SOAs}, DOI={10.1007/978-3-642-45005-1_42},
booktitle={Proceedings of the 11th International Conference on Service Oriented
Computing (ICSOC’13)}, author={Huma, Zille and Gerth, Christian and Engels, Gregor
and Juwig, Oliver}, year={2013}, pages={524--532}, collection={LNCS} }'
chicago: Huma, Zille, Christian Gerth, Gregor Engels, and Oliver Juwig. “Automated
Service Composition for On-the-Fly SOAs.” In Proceedings of the 11th International
Conference on Service Oriented Computing (ICSOC’13), 524--532. LNCS, 2013.
https://doi.org/10.1007/978-3-642-45005-1_42.
ieee: Z. Huma, C. Gerth, G. Engels, and O. Juwig, “Automated Service Composition
for On-the-Fly SOAs,” in Proceedings of the 11th International Conference on
Service Oriented Computing (ICSOC’13), 2013, pp. 524--532.
mla: Huma, Zille, et al. “Automated Service Composition for On-the-Fly SOAs.” Proceedings
of the 11th International Conference on Service Oriented Computing (ICSOC’13),
2013, pp. 524--532, doi:10.1007/978-3-642-45005-1_42.
short: 'Z. Huma, C. Gerth, G. Engels, O. Juwig, in: Proceedings of the 11th International
Conference on Service Oriented Computing (ICSOC’13), 2013, pp. 524--532.'
date_created: 2017-10-17T12:42:39Z
date_updated: 2022-01-06T07:01:57Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.1007/978-3-642-45005-1_42
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:31:20Z
date_updated: 2018-03-15T10:31:20Z
file_id: '1287'
file_name: 551-978-3-642-45005-1_42.pdf
file_size: 384397
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:31:20Z
has_accepted_license: '1'
language:
- iso: eng
page: 524--532
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 11th International Conference on Service Oriented
Computing (ICSOC'13)
series_title: LNCS
status: public
title: Automated Service Composition for On-the-Fly SOAs
type: conference
user_id: '477'
year: '2013'
...
---
_id: '553'
author:
- first_name: Kathlén
full_name: Kohn, Kathlén
last_name: Kohn
citation:
ama: Kohn K. Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische
Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn; 2013.
apa: Kohn, K. (2013). Attributbasierte Verschlüsselung mittels Gittermethoden
- Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität
Paderborn.
bibtex: '@book{Kohn_2013, title={Attributbasierte Verschlüsselung mittels Gittermethoden
- Mathematische Grundlagen, Verfahren und Sicherheitsbeweise}, publisher={Universität
Paderborn}, author={Kohn, Kathlén}, year={2013} }'
chicago: Kohn, Kathlén. Attributbasierte Verschlüsselung mittels Gittermethoden
- Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität
Paderborn, 2013.
ieee: K. Kohn, Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische
Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn, 2013.
mla: Kohn, Kathlén. Attributbasierte Verschlüsselung mittels Gittermethoden -
Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn,
2013.
short: K. Kohn, Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische
Grundlagen, Verfahren und Sicherheitsbeweise, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:40Z
date_updated: 2022-01-06T07:01:57Z
department:
- _id: '64'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '43'
name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen,
Verfahren und Sicherheitsbeweise
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '555'
author:
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: Setzer A. Approximation Algorithms for the Linear Arrangement of Special
Classes of Graphs. Universität Paderborn; 2013.
apa: Setzer, A. (2013). Approximation Algorithms for the Linear Arrangement of
Special Classes of Graphs. Universität Paderborn.
bibtex: '@book{Setzer_2013, title={Approximation Algorithms for the Linear Arrangement
of Special Classes of Graphs}, publisher={Universität Paderborn}, author={Setzer,
Alexander}, year={2013} }'
chicago: Setzer, Alexander. Approximation Algorithms for the Linear Arrangement
of Special Classes of Graphs. Universität Paderborn, 2013.
ieee: A. Setzer, Approximation Algorithms for the Linear Arrangement of Special
Classes of Graphs. Universität Paderborn, 2013.
mla: Setzer, Alexander. Approximation Algorithms for the Linear Arrangement of
Special Classes of Graphs. Universität Paderborn, 2013.
short: A. Setzer, Approximation Algorithms for the Linear Arrangement of Special
Classes of Graphs, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:40Z
date_updated: 2022-01-06T07:01:59Z
department:
- _id: '79'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs
type: mastersthesis
user_id: '477'
year: '2013'
...
---
_id: '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: '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: '6729'
author:
- first_name: Dion
full_name: Coumans, Dion
last_name: Coumans
- first_name: Mai
full_name: Gehrke, Mai
last_name: Gehrke
- first_name: Lorijn
full_name: van Rooijen, Lorijn
id: '58843'
last_name: van Rooijen
citation:
ama: Coumans D, Gehrke M, van Rooijen L. Relational semantics for full linear logic.
Journal of Applied Logic. 2013;12(1):50-66. doi:10.1016/j.jal.2013.07.005
apa: Coumans, D., Gehrke, M., & van Rooijen, L. (2013). Relational semantics
for full linear logic. Journal of Applied Logic, 12(1), 50–66. https://doi.org/10.1016/j.jal.2013.07.005
bibtex: '@article{Coumans_Gehrke_van Rooijen_2013, title={Relational semantics for
full linear logic}, volume={12}, DOI={10.1016/j.jal.2013.07.005},
number={1}, journal={Journal of Applied Logic}, publisher={Elsevier BV}, author={Coumans,
Dion and Gehrke, Mai and van Rooijen, Lorijn}, year={2013}, pages={50–66} }'
chicago: 'Coumans, Dion, Mai Gehrke, and Lorijn van Rooijen. “Relational Semantics
for Full Linear Logic.” Journal of Applied Logic 12, no. 1 (2013): 50–66.
https://doi.org/10.1016/j.jal.2013.07.005.'
ieee: D. Coumans, M. Gehrke, and L. van Rooijen, “Relational semantics for full
linear logic,” Journal of Applied Logic, vol. 12, no. 1, pp. 50–66, 2013.
mla: Coumans, Dion, et al. “Relational Semantics for Full Linear Logic.” Journal
of Applied Logic, vol. 12, no. 1, Elsevier BV, 2013, pp. 50–66, doi:10.1016/j.jal.2013.07.005.
short: D. Coumans, M. Gehrke, L. van Rooijen, Journal of Applied Logic 12 (2013)
50–66.
date_created: 2019-01-15T10:09:17Z
date_updated: 2022-01-06T07:03:17Z
department:
- _id: '66'
doi: 10.1016/j.jal.2013.07.005
extern: '1'
intvolume: ' 12'
issue: '1'
language:
- iso: eng
page: 50-66
publication: Journal of Applied Logic
publication_identifier:
issn:
- 1570-8683
publication_status: published
publisher: Elsevier BV
status: public
title: Relational semantics for full linear logic
type: journal_article
user_id: '58843'
volume: 12
year: '2013'
...
---
_id: '6730'
author:
- first_name: Thomas
full_name: Place, Thomas
last_name: Place
- first_name: Lorijn
full_name: van Rooijen, Lorijn
id: '58843'
last_name: van Rooijen
- first_name: Marc
full_name: Zeitoun, Marc
last_name: Zeitoun
citation:
ama: 'Place T, van Rooijen L, Zeitoun M. Separating Regular Languages by Locally
Testable and Locally Threshold Testable Languages. In: Annual Conference on
Foundations of Software Technology and Theoretical Computer Science, (FSTTCS)
2013, December 12-14, 2013, Guwahati, India. Vol 24. LIPIcs. Schloss Dagstuhl
- Leibniz-Zentrum fuer Informatik; 2013:363--375. doi:10.4230/LIPICS.FSTTCS.2013.363'
apa: Place, T., van Rooijen, L., & Zeitoun, M. (2013). Separating Regular Languages
by Locally Testable and Locally Threshold Testable Languages. In Annual Conference
on Foundations of Software Technology and Theoretical Computer Science, (FSTTCS)
2013, December 12-14, 2013, Guwahati, India (Vol. 24, pp. 363--375). Schloss
Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.FSTTCS.2013.363
bibtex: '@inproceedings{Place_van Rooijen_Zeitoun_2013, series={LIPIcs}, title={Separating
Regular Languages by Locally Testable and Locally Threshold Testable Languages},
volume={24}, DOI={10.4230/LIPICS.FSTTCS.2013.363},
booktitle={Annual Conference on Foundations of Software Technology and Theoretical
Computer Science, (FSTTCS) 2013, December 12-14, 2013, Guwahati, India}, publisher={Schloss
Dagstuhl - Leibniz-Zentrum fuer Informatik}, author={Place, Thomas and van Rooijen,
Lorijn and Zeitoun, Marc}, year={2013}, pages={363--375}, collection={LIPIcs}
}'
chicago: Place, Thomas, Lorijn van Rooijen, and Marc Zeitoun. “Separating Regular
Languages by Locally Testable and Locally Threshold Testable Languages.” In Annual
Conference on Foundations of Software Technology and Theoretical Computer Science,
(FSTTCS) 2013, December 12-14, 2013, Guwahati, India, 24:363--375. LIPIcs.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013. https://doi.org/10.4230/LIPICS.FSTTCS.2013.363.
ieee: T. Place, L. van Rooijen, and M. Zeitoun, “Separating Regular Languages by
Locally Testable and Locally Threshold Testable Languages,” in Annual Conference
on Foundations of Software Technology and Theoretical Computer Science, (FSTTCS)
2013, December 12-14, 2013, Guwahati, India, 2013, vol. 24, pp. 363--375.
mla: Place, Thomas, et al. “Separating Regular Languages by Locally Testable and
Locally Threshold Testable Languages.” Annual Conference on Foundations of
Software Technology and Theoretical Computer Science, (FSTTCS) 2013, December
12-14, 2013, Guwahati, India, vol. 24, Schloss Dagstuhl - Leibniz-Zentrum
fuer Informatik, 2013, pp. 363--375, doi:10.4230/LIPICS.FSTTCS.2013.363.
short: 'T. Place, L. van Rooijen, M. Zeitoun, in: Annual Conference on Foundations
of Software Technology and Theoretical Computer Science, (FSTTCS) 2013, December
12-14, 2013, Guwahati, India, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
2013, pp. 363--375.'
date_created: 2019-01-15T10:10:14Z
date_updated: 2022-01-06T07:03:17Z
department:
- _id: '66'
doi: 10.4230/LIPICS.FSTTCS.2013.363
extern: '1'
intvolume: ' 24'
language:
- iso: eng
page: 363--375
publication: Annual Conference on Foundations of Software Technology and Theoretical
Computer Science, (FSTTCS) 2013, December 12-14, 2013, Guwahati, India
publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
series_title: LIPIcs
status: public
title: Separating Regular Languages by Locally Testable and Locally Threshold Testable
Languages
type: conference
user_id: '58843'
volume: 24
year: '2013'
...
---
_id: '6732'
author:
- first_name: Thomas
full_name: Place, Thomas
last_name: Place
- first_name: Lorijn
full_name: van Rooijen, Lorijn
id: '58843'
last_name: van Rooijen
- first_name: Marc
full_name: Zeitoun, Marc
last_name: Zeitoun
citation:
ama: 'Place T, van Rooijen L, Zeitoun M. Separating Regular Languages by Piecewise
Testable and Unambiguous Languages. In: Mathematical Foundations of Computer
Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria,
August 26-30, 2013. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:729-740.
doi:10.1007/978-3-642-40313-2_64'
apa: 'Place, T., van Rooijen, L., & Zeitoun, M. (2013). Separating Regular Languages
by Piecewise Testable and Unambiguous Languages. In Mathematical Foundations
of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg,
Austria, August 26-30, 2013 (pp. 729–740). Berlin, Heidelberg: Springer Berlin
Heidelberg. https://doi.org/10.1007/978-3-642-40313-2_64'
bibtex: '@inproceedings{Place_van Rooijen_Zeitoun_2013, place={Berlin, Heidelberg},
title={Separating Regular Languages by Piecewise Testable and Unambiguous Languages},
DOI={10.1007/978-3-642-40313-2_64},
booktitle={Mathematical Foundations of Computer Science 2013 - 38th International
Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013}, publisher={Springer
Berlin Heidelberg}, author={Place, Thomas and van Rooijen, Lorijn and Zeitoun,
Marc}, year={2013}, pages={729–740} }'
chicago: 'Place, Thomas, Lorijn van Rooijen, and Marc Zeitoun. “Separating Regular
Languages by Piecewise Testable and Unambiguous Languages.” In Mathematical
Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013,
Klosterneuburg, Austria, August 26-30, 2013, 729–40. Berlin, Heidelberg: Springer
Berlin Heidelberg, 2013. https://doi.org/10.1007/978-3-642-40313-2_64.'
ieee: T. Place, L. van Rooijen, and M. Zeitoun, “Separating Regular Languages by
Piecewise Testable and Unambiguous Languages,” in Mathematical Foundations
of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg,
Austria, August 26-30, 2013, 2013, pp. 729–740.
mla: Place, Thomas, et al. “Separating Regular Languages by Piecewise Testable and
Unambiguous Languages.” Mathematical Foundations of Computer Science 2013 -
38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30,
2013, Springer Berlin Heidelberg, 2013, pp. 729–40, doi:10.1007/978-3-642-40313-2_64.
short: 'T. Place, L. van Rooijen, M. Zeitoun, in: Mathematical Foundations of Computer
Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria,
August 26-30, 2013, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp.
729–740.'
date_created: 2019-01-15T10:23:36Z
date_updated: 2022-01-06T07:03:17Z
department:
- _id: '66'
doi: 10.1007/978-3-642-40313-2_64
extern: '1'
language:
- iso: eng
page: 729-740
place: Berlin, Heidelberg
publication: Mathematical Foundations of Computer Science 2013 - 38th International
Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013
publication_identifier:
isbn:
- '9783642403125'
- '9783642403132'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Separating Regular Languages by Piecewise Testable and Unambiguous Languages
type: conference
user_id: '58843'
year: '2013'
...
---
_id: '10604'
author:
- first_name: Markus
full_name: Happe, Markus
last_name: Happe
- first_name: Enno
full_name: Lübbers, Enno
last_name: Lübbers
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: Happe M, Lübbers E, Platzner M. A Self-adaptive Heterogeneous Multi-core Architecture
for Embedded Real-time Video Object Tracking. International Journal of Real-time
Image Processing. 2013;8(1):95-110. doi:doi:10.1007/s11554-011-0212-y
apa: Happe, M., Lübbers, E., & Platzner, M. (2013). A Self-adaptive Heterogeneous
Multi-core Architecture for Embedded Real-time Video Object Tracking. International
Journal of Real-Time Image Processing, 8(1), 95–110. https://doi.org/doi:10.1007/s11554-011-0212-y
bibtex: '@article{Happe_Lübbers_Platzner_2013, title={A Self-adaptive Heterogeneous
Multi-core Architecture for Embedded Real-time Video Object Tracking}, volume={8},
DOI={doi:10.1007/s11554-011-0212-y},
number={1}, journal={International Journal of Real-time Image Processing}, publisher={Springer},
author={Happe, Markus and Lübbers, Enno and Platzner, Marco}, year={2013}, pages={95–110}
}'
chicago: 'Happe, Markus, Enno Lübbers, and Marco Platzner. “A Self-Adaptive Heterogeneous
Multi-Core Architecture for Embedded Real-Time Video Object Tracking.” International
Journal of Real-Time Image Processing 8, no. 1 (2013): 95–110. https://doi.org/doi:10.1007/s11554-011-0212-y.'
ieee: M. Happe, E. Lübbers, and M. Platzner, “A Self-adaptive Heterogeneous Multi-core
Architecture for Embedded Real-time Video Object Tracking,” International Journal
of Real-time Image Processing, vol. 8, no. 1, pp. 95–110, 2013.
mla: Happe, Markus, et al. “A Self-Adaptive Heterogeneous Multi-Core Architecture
for Embedded Real-Time Video Object Tracking.” International Journal of Real-Time
Image Processing, vol. 8, no. 1, Springer, 2013, pp. 95–110, doi:doi:10.1007/s11554-011-0212-y.
short: M. Happe, E. Lübbers, M. Platzner, International Journal of Real-Time Image
Processing 8 (2013) 95–110.
date_created: 2019-07-10T09:22:45Z
date_updated: 2022-01-06T06:50:47Z
department:
- _id: '78'
doi: doi:10.1007/s11554-011-0212-y
intvolume: ' 8'
issue: '1'
language:
- iso: eng
page: 95 - 110
publication: International Journal of Real-time Image Processing
publisher: Springer
status: public
title: A Self-adaptive Heterogeneous Multi-core Architecture for Embedded Real-time
Video Object Tracking
type: journal_article
user_id: '398'
volume: 8
year: '2013'
...
---
_id: '10620'
author:
- first_name: Jahanzeb
full_name: Anwer, Jahanzeb
last_name: Anwer
- first_name: Sebastian
full_name: Meisner, Sebastian
last_name: Meisner
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Anwer J, Meisner S, Platzner M. Dynamic reliability management: Reconfiguring
reliability-levels of hardware designs at runtime. In: Reconfigurable Computing
and FPGAs (ReConFig), 2013 International Conference On. ; 2013:1-6. doi:10.1109/ReConFig.2013.6732280'
apa: 'Anwer, J., Meisner, S., & Platzner, M. (2013). Dynamic reliability management:
Reconfiguring reliability-levels of hardware designs at runtime. In Reconfigurable
Computing and FPGAs (ReConFig), 2013 International Conference on (pp. 1–6).
https://doi.org/10.1109/ReConFig.2013.6732280'
bibtex: '@inproceedings{Anwer_Meisner_Platzner_2013, title={Dynamic reliability
management: Reconfiguring reliability-levels of hardware designs at runtime},
DOI={10.1109/ReConFig.2013.6732280},
booktitle={Reconfigurable Computing and FPGAs (ReConFig), 2013 International Conference
on}, author={Anwer, Jahanzeb and Meisner, Sebastian and Platzner, Marco}, year={2013},
pages={1–6} }'
chicago: 'Anwer, Jahanzeb, Sebastian Meisner, and Marco Platzner. “Dynamic Reliability
Management: Reconfiguring Reliability-Levels of Hardware Designs at Runtime.”
In Reconfigurable Computing and FPGAs (ReConFig), 2013 International Conference
On, 1–6, 2013. https://doi.org/10.1109/ReConFig.2013.6732280.'
ieee: 'J. Anwer, S. Meisner, and M. Platzner, “Dynamic reliability management: Reconfiguring
reliability-levels of hardware designs at runtime,” in Reconfigurable Computing
and FPGAs (ReConFig), 2013 International Conference on, 2013, pp. 1–6.'
mla: 'Anwer, Jahanzeb, et al. “Dynamic Reliability Management: Reconfiguring Reliability-Levels
of Hardware Designs at Runtime.” Reconfigurable Computing and FPGAs (ReConFig),
2013 International Conference On, 2013, pp. 1–6, doi:10.1109/ReConFig.2013.6732280.'
short: 'J. Anwer, S. Meisner, M. Platzner, in: Reconfigurable Computing and FPGAs
(ReConFig), 2013 International Conference On, 2013, pp. 1–6.'
date_created: 2019-07-10T09:32:57Z
date_updated: 2022-01-06T06:50:48Z
department:
- _id: '78'
doi: 10.1109/ReConFig.2013.6732280
keyword:
- fault tolerant computing
- field programmable gate arrays
- logic design
- reliability
- BYU-LANL tool
- DRM tool flow
- FPGA based hardware designs
- avionic application
- device technologies
- dynamic reliability management
- fault-tolerant operation
- hardware designs
- reconfiguring reliability levels
- space applications
- Field programmable gate arrays
- Hardware
- Redundancy
- Reliability engineering
- Runtime
- Tunneling magnetoresistance
language:
- iso: eng
page: 1-6
publication: Reconfigurable Computing and FPGAs (ReConFig), 2013 International Conference
on
status: public
title: 'Dynamic reliability management: Reconfiguring reliability-levels of hardware
designs at runtime'
type: conference
user_id: '3118'
year: '2013'
...
---
_id: '10626'
author:
- first_name: Christian
full_name: Bick, Christian
last_name: Bick
citation:
ama: Bick C. Beschleunigung von Tiefenberechnung Aus Stereobildern Durch FPGA-Basierte
Datenflussrechner. Paderborn University; 2013.
apa: Bick, C. (2013). Beschleunigung von Tiefenberechnung aus Stereobildern durch
FPGA-basierte Datenflussrechner. Paderborn University.
bibtex: '@book{Bick_2013, title={Beschleunigung von Tiefenberechnung aus Stereobildern
durch FPGA-basierte Datenflussrechner}, publisher={Paderborn University}, author={Bick,
Christian}, year={2013} }'
chicago: Bick, Christian. Beschleunigung von Tiefenberechnung Aus Stereobildern
Durch FPGA-Basierte Datenflussrechner. Paderborn University, 2013.
ieee: C. Bick, Beschleunigung von Tiefenberechnung aus Stereobildern durch FPGA-basierte
Datenflussrechner. Paderborn University, 2013.
mla: Bick, Christian. Beschleunigung von Tiefenberechnung Aus Stereobildern Durch
FPGA-Basierte Datenflussrechner. Paderborn University, 2013.
short: C. Bick, Beschleunigung von Tiefenberechnung Aus Stereobildern Durch FPGA-Basierte
Datenflussrechner, Paderborn University, 2013.
date_created: 2019-07-10T09:40:24Z
date_updated: 2022-01-06T06:50:48Z
department:
- _id: '78'
language:
- iso: eng
publisher: Paderborn University
status: public
title: Beschleunigung von Tiefenberechnung aus Stereobildern durch FPGA-basierte Datenflussrechner
type: bachelorsthesis
user_id: '3118'
year: '2013'
...
---
_id: '10634'
author:
- first_name: Alexander
full_name: Boschmann, Alexander
last_name: Boschmann
- first_name: Barbara
full_name: Nofen, Barbara
last_name: Nofen
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Boschmann A, Nofen B, Platzner M. Improving transient state myoelectric signal
recognition in hand movement classification using gyroscopes. In: Proc. IEEE
Int. Conf. Eng. Med. Biolog. (EMBC). ; 2013.'
apa: Boschmann, A., Nofen, B., & Platzner, M. (2013). Improving transient state
myoelectric signal recognition in hand movement classification using gyroscopes.
In Proc. IEEE Int. Conf. Eng. Med. Biolog. (EMBC).
bibtex: '@inproceedings{Boschmann_Nofen_Platzner_2013, title={Improving transient
state myoelectric signal recognition in hand movement classification using gyroscopes},
booktitle={Proc. IEEE Int. Conf. Eng. Med. Biolog. (EMBC)}, author={Boschmann,
Alexander and Nofen, Barbara and Platzner, Marco}, year={2013} }'
chicago: Boschmann, Alexander, Barbara Nofen, and Marco Platzner. “Improving Transient
State Myoelectric Signal Recognition in Hand Movement Classification Using Gyroscopes.”
In Proc. IEEE Int. Conf. Eng. Med. Biolog. (EMBC), 2013.
ieee: A. Boschmann, B. Nofen, and M. Platzner, “Improving transient state myoelectric
signal recognition in hand movement classification using gyroscopes,” in Proc.
IEEE Int. Conf. Eng. Med. Biolog. (EMBC), 2013.
mla: Boschmann, Alexander, et al. “Improving Transient State Myoelectric Signal
Recognition in Hand Movement Classification Using Gyroscopes.” Proc. IEEE Int.
Conf. Eng. Med. Biolog. (EMBC), 2013.
short: 'A. Boschmann, B. Nofen, M. Platzner, in: Proc. IEEE Int. Conf. Eng. Med.
Biolog. (EMBC), 2013.'
date_created: 2019-07-10T11:03:00Z
date_updated: 2022-01-06T06:50:49Z
department:
- _id: '78'
language:
- iso: eng
publication: Proc. IEEE Int. Conf. Eng. Med. Biolog. (EMBC)
status: public
title: Improving transient state myoelectric signal recognition in hand movement classification
using gyroscopes
type: conference
user_id: '3118'
year: '2013'
...
---
_id: '10635'
author:
- first_name: Alexander
full_name: Boschmann, Alexander
last_name: Boschmann
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Boschmann A, Platzner M. Reducing the limb position effect in pattern recognition
based myoelectric control using a high density electrode array. In: Proc. IEEE
ISSNIP Biosignals and Biorobotics Conference (BRC). ; 2013.'
apa: Boschmann, A., & Platzner, M. (2013). Reducing the limb position effect
in pattern recognition based myoelectric control using a high density electrode
array. In Proc. IEEE ISSNIP Biosignals and Biorobotics Conference (BRC).
bibtex: '@inproceedings{Boschmann_Platzner_2013, title={Reducing the limb position
effect in pattern recognition based myoelectric control using a high density electrode
array}, booktitle={Proc. IEEE ISSNIP Biosignals and Biorobotics Conference (BRC)},
author={Boschmann, Alexander and Platzner, Marco}, year={2013} }'
chicago: Boschmann, Alexander, and Marco Platzner. “Reducing the Limb Position Effect
in Pattern Recognition Based Myoelectric Control Using a High Density Electrode
Array.” In Proc. IEEE ISSNIP Biosignals and Biorobotics Conference (BRC),
2013.
ieee: A. Boschmann and M. Platzner, “Reducing the limb position effect in pattern
recognition based myoelectric control using a high density electrode array,” in
Proc. IEEE ISSNIP Biosignals and Biorobotics Conference (BRC), 2013.
mla: Boschmann, Alexander, and Marco Platzner. “Reducing the Limb Position Effect
in Pattern Recognition Based Myoelectric Control Using a High Density Electrode
Array.” Proc. IEEE ISSNIP Biosignals and Biorobotics Conference (BRC),
2013.
short: 'A. Boschmann, M. Platzner, in: Proc. IEEE ISSNIP Biosignals and Biorobotics
Conference (BRC), 2013.'
date_created: 2019-07-10T11:03:01Z
date_updated: 2022-01-06T06:50:49Z
department:
- _id: '78'
language:
- iso: eng
publication: Proc. IEEE ISSNIP Biosignals and Biorobotics Conference (BRC)
status: public
title: Reducing the limb position effect in pattern recognition based myoelectric
control using a high density electrode array
type: conference
user_id: '3118'
year: '2013'
...
---
_id: '10655'
author:
- first_name: Kyrre
full_name: Glette, Kyrre
last_name: Glette
- first_name: Paul
full_name: Kaufmann, Paul
last_name: Kaufmann
- first_name: Christopher
full_name: Assad, Christopher
last_name: Assad
- first_name: Michael
full_name: Wolf, Michael
last_name: Wolf
citation:
ama: 'Glette K, Kaufmann P, Assad C, Wolf M. Investigating Evolvable Hardware Classification
for the BioSleeve Electromyographic Interface. In: IEEE Intl. Conf. on Evolvable
Systems (ICES). Vol 1. LNCS. Springer; 2013:1-1.'
apa: Glette, K., Kaufmann, P., Assad, C., & Wolf, M. (2013). Investigating Evolvable
Hardware Classification for the BioSleeve Electromyographic Interface. In IEEE
Intl. Conf. on Evolvable Systems (ICES) (Vol. 1, pp. 1–1). Springer.
bibtex: '@inproceedings{Glette_Kaufmann_Assad_Wolf_2013, series={LNCS}, title={Investigating
Evolvable Hardware Classification for the BioSleeve Electromyographic Interface},
volume={1}, booktitle={IEEE Intl. Conf. on Evolvable Systems (ICES)}, publisher={Springer},
author={Glette, Kyrre and Kaufmann, Paul and Assad, Christopher and Wolf, Michael},
year={2013}, pages={1–1}, collection={LNCS} }'
chicago: Glette, Kyrre, Paul Kaufmann, Christopher Assad, and Michael Wolf. “Investigating
Evolvable Hardware Classification for the BioSleeve Electromyographic Interface.”
In IEEE Intl. Conf. on Evolvable Systems (ICES), 1:1–1. LNCS. Springer,
2013.
ieee: K. Glette, P. Kaufmann, C. Assad, and M. Wolf, “Investigating Evolvable Hardware
Classification for the BioSleeve Electromyographic Interface,” in IEEE Intl.
Conf. on Evolvable Systems (ICES), 2013, vol. 1, pp. 1–1.
mla: Glette, Kyrre, et al. “Investigating Evolvable Hardware Classification for
the BioSleeve Electromyographic Interface.” IEEE Intl. Conf. on Evolvable Systems
(ICES), vol. 1, Springer, 2013, pp. 1–1.
short: 'K. Glette, P. Kaufmann, C. Assad, M. Wolf, in: IEEE Intl. Conf. on Evolvable
Systems (ICES), Springer, 2013, pp. 1–1.'
date_created: 2019-07-10T11:13:16Z
date_updated: 2022-01-06T06:50:49Z
department:
- _id: '78'
intvolume: ' 1'
page: 1-1
publication: IEEE Intl. Conf. on Evolvable Systems (ICES)
publisher: Springer
series_title: LNCS
status: public
title: Investigating Evolvable Hardware Classification for the BioSleeve Electromyographic
Interface
type: conference
user_id: '3118'
volume: 1
year: '2013'
...