---
_id: '5146'
abstract:
- lang: eng
text: In this paper, we analyze a model in which two divisions negotiate over an
intrafirm transfer price for an intermediate product. Formally, we consider bargaining
problems under incomplete information, since the upstream division’s (seller's)
costs and downstream division's (buyer's) revenues are supposed to be private
information. Assuming two possible types for buyer and seller each, we first establish
that the bargaining problem is regular, regardless whether incentive and/or efficiency
constraints are imposed. This allows us to apply the generalized Nash bargaining
solution to determine transfer payments and transfer probabilities. Furthermore,
we derive general properties of this solution for the transfer pricing problem
and compare the model developed here with the existing literature for negotiated
transfer pricing under incomplete information. In particular, we focus on the
models presented in Wagenhofer (1994).
author:
- first_name: Sonja
full_name: Brangewitz, Sonja
last_name: Brangewitz
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
citation:
ama: Brangewitz S, Haake C-J. Cooperative Transfer Price Negotiations under Incomplete
Information. Vol 64. CIE Working Paper Series, Paderborn University; 2013.
apa: Brangewitz, S., & Haake, C.-J. (2013). Cooperative Transfer Price Negotiations
under Incomplete Information (Vol. 64). CIE Working Paper Series, Paderborn
University.
bibtex: '@book{Brangewitz_Haake_2013, series={Working Papers CIE}, title={Cooperative
Transfer Price Negotiations under Incomplete Information}, volume={64}, publisher={CIE
Working Paper Series, Paderborn University}, author={Brangewitz, Sonja and Haake,
Claus-Jochen}, year={2013}, collection={Working Papers CIE} }'
chicago: Brangewitz, Sonja, and Claus-Jochen Haake. Cooperative Transfer Price
Negotiations under Incomplete Information. Vol. 64. Working Papers CIE. CIE
Working Paper Series, Paderborn University, 2013.
ieee: S. Brangewitz and C.-J. Haake, Cooperative Transfer Price Negotiations
under Incomplete Information, vol. 64. CIE Working Paper Series, Paderborn
University, 2013.
mla: Brangewitz, Sonja, and Claus-Jochen Haake. Cooperative Transfer Price Negotiations
under Incomplete Information. Vol. 64, CIE Working Paper Series, Paderborn
University, 2013.
short: S. Brangewitz, C.-J. Haake, Cooperative Transfer Price Negotiations under
Incomplete Information, CIE Working Paper Series, Paderborn University, 2013.
date_created: 2018-10-31T09:20:15Z
date_updated: 2022-01-06T07:01:39Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
file:
- access_level: closed
content_type: application/pdf
creator: stela
date_created: 2018-10-31T09:22:19Z
date_updated: 2018-10-31T09:22:19Z
file_id: '5148'
file_name: WP - Cooperative Transfer Price Negotiations under Incomplete Information.pdf
file_size: 430826
relation: main_file
success: 1
file_date_updated: 2018-10-31T09:22:19Z
has_accepted_license: '1'
intvolume: ' 64'
keyword:
- Transfer Pricing
- Negotiation
- Generalized Nash Bargaining Solution
- Incomplete Information
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: CIE Working Paper Series, Paderborn University
series_title: Working Papers CIE
status: public
title: Cooperative Transfer Price Negotiations under Incomplete Information
type: working_paper
user_id: '477'
volume: 64
year: '2013'
...
---
_id: '515'
abstract:
- lang: eng
text: The as a service paradigm reflects the fundamental idea of providing basic
coherent functionality in terms of components that can be utilised on demand.
These so-called services may also be interconnected in order to provide more complex
functionality. Automation of this service composition process is indeed a formidable
challenge. In our work, we are addressing this challenge by decomposing service
composition into sequential decision making steps. Each step is supported by a
recommendation mechanism. If composition requests recur over time and if evaluations
of composition results are fed back, a proper recommendation strategy can evolve
over time through learning from experience. In this paper, we describe our approach
of modelling this service composition and recommendation process as Markov decision
process and of solving it by means of reinforcement learning. A case study serves
as proof of concept.
author:
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
- first_name: Bernd
full_name: Kleinjohann, Bernd
last_name: Kleinjohann
- first_name: Elisabeth
full_name: Kleinjohann, Elisabeth
id: '15588'
last_name: Kleinjohann
citation:
ama: Jungmann A, Kleinjohann B, Kleinjohann E. Learning Service Recommendations.
International Journal of Business Process Integration and Management. 2013;(4):284-297.
doi:10.1504/IJBPIM.2013.059135
apa: Jungmann, A., Kleinjohann, B., & Kleinjohann, E. (2013). Learning Service
Recommendations. International Journal of Business Process Integration and
Management, (4), 284–297. https://doi.org/10.1504/IJBPIM.2013.059135
bibtex: '@article{Jungmann_Kleinjohann_Kleinjohann_2013, title={Learning Service
Recommendations}, DOI={10.1504/IJBPIM.2013.059135},
number={4}, journal={International Journal of Business Process Integration and
Management}, publisher={InderScience}, author={Jungmann, Alexander and Kleinjohann,
Bernd and Kleinjohann, Elisabeth}, year={2013}, pages={284–297} }'
chicago: 'Jungmann, Alexander, Bernd Kleinjohann, and Elisabeth Kleinjohann. “Learning
Service Recommendations.” International Journal of Business Process Integration
and Management, no. 4 (2013): 284–97. https://doi.org/10.1504/IJBPIM.2013.059135.'
ieee: A. Jungmann, B. Kleinjohann, and E. Kleinjohann, “Learning Service Recommendations,”
International Journal of Business Process Integration and Management, no.
4, pp. 284–297, 2013.
mla: Jungmann, Alexander, et al. “Learning Service Recommendations.” International
Journal of Business Process Integration and Management, no. 4, InderScience,
2013, pp. 284–97, doi:10.1504/IJBPIM.2013.059135.
short: A. Jungmann, B. Kleinjohann, E. Kleinjohann, International Journal of Business
Process Integration and Management (2013) 284–297.
date_created: 2017-10-17T12:42:32Z
date_updated: 2022-01-06T07:01:39Z
ddc:
- '040'
doi: 10.1504/IJBPIM.2013.059135
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:43:38Z
date_updated: 2018-03-15T10:43:38Z
file_id: '1301'
file_name: 515-IJBPIM060402_JUNGMANN.pdf
file_size: 5301831
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:43:38Z
has_accepted_license: '1'
issue: '4'
main_file_link:
- url: http://www.inderscience.com/offer.php?id=59135
page: 284-297
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publication: International Journal of Business Process Integration and Management
publisher: InderScience
status: public
title: Learning Service Recommendations
type: journal_article
user_id: '477'
year: '2013'
...
---
_id: '516'
abstract:
- lang: eng
text: 'The as a Service paradigm reflects the fundamental idea of providing basic
coherent functionality in terms of components that can be utilized on demand.
These so-called services may also be interconnected in order to provide more complex
functionality. Automation of this service composition process is indeed a formidable
challenge. In our work, we are addressing this challenge by decomposing service
composition into sequential decision making steps. Each step is supported by a
recommendation mechanism. If composition requests recur over time and if evaluations
of composition results are fed back, a proper recommendation strategy can evolve
over time through learning from experience. In this paper, we describe our general
idea of modeling this service composition and recommendation process as Markov
Decision Process and of solving it by means of Reinforcement Learning. A case
study serves as proof of concept. '
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. Learning Recommendation System for Automated Service
Composition. In: Proceedings of the 10th IEEE International Conference on Services
Computing (SCC). ; 2013:97-104. doi:10.1109/SCC.2013.66'
apa: Jungmann, A., & Kleinjohann, B. (2013). Learning Recommendation System
for Automated Service Composition. In Proceedings of the 10th IEEE International
Conference on Services Computing (SCC) (pp. 97–104). https://doi.org/10.1109/SCC.2013.66
bibtex: '@inproceedings{Jungmann_Kleinjohann_2013, title={Learning Recommendation
System for Automated Service Composition}, DOI={10.1109/SCC.2013.66},
booktitle={Proceedings of the 10th IEEE International Conference on Services Computing
(SCC)}, author={Jungmann, Alexander and Kleinjohann, Bernd}, year={2013}, pages={97–104}
}'
chicago: Jungmann, Alexander, and Bernd Kleinjohann. “Learning Recommendation System
for Automated Service Composition.” In Proceedings of the 10th IEEE International
Conference on Services Computing (SCC), 97–104, 2013. https://doi.org/10.1109/SCC.2013.66.
ieee: A. Jungmann and B. Kleinjohann, “Learning Recommendation System for Automated
Service Composition,” in Proceedings of the 10th IEEE International Conference
on Services Computing (SCC), 2013, pp. 97–104.
mla: Jungmann, Alexander, and Bernd Kleinjohann. “Learning Recommendation System
for Automated Service Composition.” Proceedings of the 10th IEEE International
Conference on Services Computing (SCC), 2013, pp. 97–104, doi:10.1109/SCC.2013.66.
short: 'A. Jungmann, B. Kleinjohann, in: Proceedings of the 10th IEEE International
Conference on Services Computing (SCC), 2013, pp. 97–104.'
date_created: 2017-10-17T12:42:33Z
date_updated: 2022-01-06T07:01:40Z
ddc:
- '040'
doi: 10.1109/SCC.2013.66
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:43:03Z
date_updated: 2018-03-15T10:43:03Z
file_id: '1300'
file_name: 516-manuscript.pdf
file_size: 1762714
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:43:03Z
has_accepted_license: '1'
page: 97-104
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 10th IEEE International Conference on Services Computing
(SCC)
status: public
title: Learning Recommendation System for Automated Service Composition
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '517'
abstract:
- lang: eng
text: In the Semantic (Web) Services area, services are considered black boxes with
a semantic description of their interfaces as to allow for precise service selection
and configuration. The semantic description is usually grounded on domain-specific
concepts as modeled in ontologies. This accounts for types used in service signatures,
but also predicates occurring in preconditions and effects of services. Ontologies,
in particular those enhanced with rules, capture the knowledge of domain experts
on properties of and relations between domain concepts. In this paper, we present
a verification technique for service compositions which makes use of this domain
knowledge. We consider a service composition to be an assembly of services of
which we just know signatures, preconditions, and effects. We aim at proving that
a composition satisfies a (user-defined) requirement, specified in terms of guaranteed
preconditions and required postconditions. As an underlying verification engine
we use an SMT solver. To take advantage of the domain knowledge (and often, to
enable verification at all), the knowledge is fed into the solver in the form of
sorts, uninterpreted functions and in particular assertions as to enhance the
solver’s reasoning capabilities. Thereby, we allow for deductions within a domain
previously unknown to the solver. We exemplify our technique on a case study from
the area of water network optimization software.
author:
- first_name: Sven
full_name: Walther, Sven
last_name: Walther
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Walther S, Wehrheim H. Knowledge-Based Verification of Service Compositions
- An SMT approach. In: Proceedings of the 18th IEEE International Conference
on Engineering of Complex Computer Systems (ICECCS). ; 2013:24-32. doi:10.1109/ICECCS.2013.14'
apa: Walther, S., & Wehrheim, H. (2013). Knowledge-Based Verification of Service
Compositions - An SMT approach. In Proceedings of the 18th IEEE International
Conference on Engineering of Complex Computer Systems (ICECCS) (pp. 24–32).
https://doi.org/10.1109/ICECCS.2013.14
bibtex: '@inproceedings{Walther_Wehrheim_2013, title={Knowledge-Based Verification
of Service Compositions - An SMT approach}, DOI={10.1109/ICECCS.2013.14},
booktitle={Proceedings of the 18th IEEE International Conference on Engineering
of Complex Computer Systems (ICECCS)}, author={Walther, Sven and Wehrheim, Heike},
year={2013}, pages={24–32} }'
chicago: Walther, Sven, and Heike Wehrheim. “Knowledge-Based Verification of Service
Compositions - An SMT Approach.” In Proceedings of the 18th IEEE International
Conference on Engineering of Complex Computer Systems (ICECCS), 24–32, 2013.
https://doi.org/10.1109/ICECCS.2013.14.
ieee: S. Walther and H. Wehrheim, “Knowledge-Based Verification of Service Compositions
- An SMT approach,” in Proceedings of the 18th IEEE International Conference
on Engineering of Complex Computer Systems (ICECCS), 2013, pp. 24–32.
mla: Walther, Sven, and Heike Wehrheim. “Knowledge-Based Verification of Service
Compositions - An SMT Approach.” Proceedings of the 18th IEEE International
Conference on Engineering of Complex Computer Systems (ICECCS), 2013, pp.
24–32, doi:10.1109/ICECCS.2013.14.
short: 'S. Walther, H. Wehrheim, in: Proceedings of the 18th IEEE International
Conference on Engineering of Complex Computer Systems (ICECCS), 2013, pp. 24–32.'
date_created: 2017-10-17T12:42:33Z
date_updated: 2022-01-06T07:01:41Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1109/ICECCS.2013.14
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:26:08Z
date_updated: 2018-11-02T13:26:08Z
file_id: '5248'
file_name: 06601801.pdf
file_size: 217085
relation: main_file
file_date_updated: 2018-11-02T13:26:08Z
has_accepted_license: '1'
language:
- iso: eng
page: '24 - 32 '
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 18th IEEE International Conference on Engineering
of Complex Computer Systems (ICECCS)
status: public
title: Knowledge-Based Verification of Service Compositions - An SMT approach
type: conference
user_id: '477'
year: '2013'
...
---
_id: '518'
author:
- first_name: Vanessa
full_name: Petrausch, Vanessa
last_name: Petrausch
citation:
ama: Petrausch V. Klassifizierung unterschiedlicher Ansätze zum Matching von
Services. Universität Paderborn; 2013.
apa: Petrausch, V. (2013). Klassifizierung unterschiedlicher Ansätze zum Matching
von Services. Universität Paderborn.
bibtex: '@book{Petrausch_2013, title={Klassifizierung unterschiedlicher Ansätze
zum Matching von Services}, publisher={Universität Paderborn}, author={Petrausch,
Vanessa}, year={2013} }'
chicago: Petrausch, Vanessa. Klassifizierung unterschiedlicher Ansätze zum Matching
von Services. Universität Paderborn, 2013.
ieee: V. Petrausch, Klassifizierung unterschiedlicher Ansätze zum Matching von
Services. Universität Paderborn, 2013.
mla: Petrausch, Vanessa. Klassifizierung unterschiedlicher Ansätze zum Matching
von Services. Universität Paderborn, 2013.
short: V. Petrausch, Klassifizierung unterschiedlicher Ansätze zum Matching von
Services, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:33Z
date_updated: 2022-01-06T07:01:41Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Klassifizierung unterschiedlicher Ansätze zum Matching von Services
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '519'
abstract:
- lang: eng
text: In this work we present the first scalable distributed information system,i.e.,
a system with low storage overhead, that is provably robust againstDenial-of-Service
(DoS) attacks by a current insider. We allow acurrent insider to have complete
knowledge about the information systemand to have the power to block any \epsilon-fraction
of its serversby a DoS-attack, where \epsilon can be chosen up to a constant.
The taskof the system is to serve any collection of lookup requests with at most
oneper non-blocked server in an efficient way despite this attack. Previously,scalable
solutions were only known for DoS-attacks of past insiders, where apast insider
only has complete knowledge about some past time pointt_0 of the information system.
Scheideler et al. (DISC 2007, SPAA 2009) showedthat in this case it is possible
to design an information system so that anyinformation that was inserted or last
updated after t_0 is safe against a DoS-attack. But their constructions would
not work at all for a current insider. The key idea behindour IRIS system is to
make extensive use of coding. More precisely, we presenttwo alternative distributed
coding strategies with an at most logarithmicstorage overhead that can handle
up to a constant fraction of blocked servers.
author:
- first_name: Martina
full_name: Eikel, Martina
last_name: Eikel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS-Attacks.
In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA). ; 2013:119-129. doi:10.1145/2486159.2486186'
apa: 'Eikel, M., & Scheideler, C. (2013). IRIS: A Robust Information System
Against Insider DoS-Attacks. In Proceedings of the 25th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA) (pp. 119–129). https://doi.org/10.1145/2486159.2486186'
bibtex: '@inproceedings{Eikel_Scheideler_2013, title={IRIS: A Robust Information
System Against Insider DoS-Attacks}, DOI={10.1145/2486159.2486186},
booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Eikel, Martina and Scheideler, Christian},
year={2013}, pages={119–129} }'
chicago: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information
System Against Insider DoS-Attacks.” In Proceedings of the 25th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 119–29, 2013. https://doi.org/10.1145/2486159.2486186.'
ieee: 'M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider
DoS-Attacks,” in Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 2013, pp. 119–129.'
mla: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System
Against Insider DoS-Attacks.” Proceedings of the 25th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2013, pp. 119–29, doi:10.1145/2486159.2486186.'
short: 'M. Eikel, C. Scheideler, in: Proceedings of the 25th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2013, pp. 119–129.'
date_created: 2017-10-17T12:42:33Z
date_updated: 2022-01-06T07:01:42Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2486159.2486186
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:38:34Z
date_updated: 2018-03-15T10:38:34Z
file_id: '1299'
file_name: 519-iris-spaa2013_01.pdf
file_size: 554618
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:38:34Z
has_accepted_license: '1'
page: 119-129
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: 'IRIS: A Robust Information System Against Insider DoS-Attacks'
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '520'
abstract:
- lang: eng
text: Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established
lightpaths in case not enough resources are available to set up a new lightpath
in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths
to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated
properties of the network topology are required by the applications running on
the network, these requirements have to be known to the RWA algorithm.Otherwise
it might happen that by preempting a particular lightpath these requirements are
violated. If, however, these requirements include parametersknown only at the
nodes running the application, the RWA algorithm cannot evaluate the requirements.
For this reason an RWA algorithm is needed which incorporates feedback from the
application layer in the preemption decisions.This work proposes a simple interface
along with an algorithm for computing and selecting preemption candidates in case
a lightpath cannot be established. We reason about the necessity of using information
from the application layer in the RWA and present two example applications which
benefit from this idea.
author:
- first_name: Philip
full_name: Wette, Philip
last_name: Wette
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Wette P, Karl H. Incorporating feedback from application layer into routing
and wavelength assignment algorithms. In: Proceedings of the 32nd IEEE International
Conference on Computer Communications (INFOCOM). ; 2013:51-52. doi:10.1109/INFCOMW.2013.6970733'
apa: Wette, P., & Karl, H. (2013). Incorporating feedback from application layer
into routing and wavelength assignment algorithms. In Proceedings of the 32nd
IEEE International Conference on Computer Communications (INFOCOM) (pp. 51–52).
https://doi.org/10.1109/INFCOMW.2013.6970733
bibtex: '@inproceedings{Wette_Karl_2013, title={Incorporating feedback from application
layer into routing and wavelength assignment algorithms}, DOI={10.1109/INFCOMW.2013.6970733},
booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications
(INFOCOM)}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={51–52}
}'
chicago: Wette, Philip, and Holger Karl. “Incorporating Feedback from Application
Layer into Routing and Wavelength Assignment Algorithms.” In Proceedings of
the 32nd IEEE International Conference on Computer Communications (INFOCOM),
51–52, 2013. https://doi.org/10.1109/INFCOMW.2013.6970733.
ieee: P. Wette and H. Karl, “Incorporating feedback from application layer into
routing and wavelength assignment algorithms,” in Proceedings of the 32nd IEEE
International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52.
mla: Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer
into Routing and Wavelength Assignment Algorithms.” Proceedings of the 32nd
IEEE International Conference on Computer Communications (INFOCOM), 2013,
pp. 51–52, doi:10.1109/INFCOMW.2013.6970733.
short: 'P. Wette, H. Karl, in: Proceedings of the 32nd IEEE International Conference
on Computer Communications (INFOCOM), 2013, pp. 51–52.'
date_created: 2017-10-17T12:42:33Z
date_updated: 2022-01-06T07:01:43Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/INFCOMW.2013.6970733
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:38:04Z
date_updated: 2018-03-15T10:38:04Z
file_id: '1298'
file_name: 520-wetteinfocom2013.pdf
file_size: 131502
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:38:04Z
has_accepted_license: '1'
main_file_link:
- url: http://ieeexplore.ieee.org/document/6970733/
page: 51-52
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 32nd IEEE International Conference on Computer Communications
(INFOCOM)
status: public
title: Incorporating feedback from application layer into routing and wavelength assignment
algorithms
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '521'
author:
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
citation:
ama: Riebler H. Identifikation und Wiederherstellung von kryptographischen Schlüsseln
mit FPGAs. Universität Paderborn; 2013.
apa: Riebler, H. (2013). Identifikation und Wiederherstellung von kryptographischen
Schlüsseln mit FPGAs. Universität Paderborn.
bibtex: '@book{Riebler_2013, title={Identifikation und Wiederherstellung von kryptographischen
Schlüsseln mit FPGAs}, publisher={Universität Paderborn}, author={Riebler, Heinrich},
year={2013} }'
chicago: Riebler, Heinrich. Identifikation und Wiederherstellung von kryptographischen
Schlüsseln mit FPGAs. Universität Paderborn, 2013.
ieee: H. Riebler, Identifikation und Wiederherstellung von kryptographischen
Schlüsseln mit FPGAs. Universität Paderborn, 2013.
mla: Riebler, Heinrich. Identifikation und Wiederherstellung von kryptographischen
Schlüsseln mit FPGAs. Universität Paderborn, 2013.
short: H. Riebler, Identifikation und Wiederherstellung von kryptographischen Schlüsseln
mit FPGAs, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:34Z
date_updated: 2022-01-06T07:01:46Z
department:
- _id: '27'
- _id: '518'
keyword:
- coldboot
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs
type: mastersthesis
user_id: '477'
year: '2013'
...
---
_id: '522'
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
citation:
ama: 'Feldotto M. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous
Bandwidths. Universität Paderborn; 2013.'
apa: 'Feldotto, M. (2013). HSkip+: A Self-Stabilizing Overlay Network for Nodes
with Heterogeneous Bandwidths. Universität Paderborn.'
bibtex: '@book{Feldotto_2013, title={HSkip+: A Self-Stabilizing Overlay Network
for Nodes with Heterogeneous Bandwidths}, publisher={Universität Paderborn}, author={Feldotto,
Matthias}, year={2013} }'
chicago: 'Feldotto, Matthias. HSkip+: A Self-Stabilizing Overlay Network for
Nodes with Heterogeneous Bandwidths. Universität Paderborn, 2013.'
ieee: 'M. Feldotto, HSkip+: A Self-Stabilizing Overlay Network for Nodes with
Heterogeneous Bandwidths. Universität Paderborn, 2013.'
mla: 'Feldotto, Matthias. HSkip+: A Self-Stabilizing Overlay Network for Nodes
with Heterogeneous Bandwidths. Universität Paderborn, 2013.'
short: 'M. Feldotto, HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous
Bandwidths, Universität Paderborn, 2013.'
date_created: 2017-10-17T12:42:34Z
date_updated: 2022-01-06T07:01:47Z
department:
- _id: '79'
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Teilprojekt A
- _id: '5'
name: SFB 901 - Subprojekt A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: 'HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths'
type: mastersthesis
user_id: '14052'
year: '2013'
...
---
_id: '523'
abstract:
- lang: eng
text: In a distributed system with attacks and defenses, both attackers and defenders
are self-interested entities. We assume a reward-sharing scheme among interdependent
defenders; each defender wishes to (locally) maximize her own total fair share
to the attackers extinguished due to her involvement (and possibly due to those
of others). What is the maximum amount of protection achievable by a number of
such defenders against a number of attackers while the system is in a Nash equilibrium?
As a measure of system protection, we adopt the Defense-Ratio (Mavronicolas et
al., 2008)[20], which provides the expected (inverse) proportion of attackers
caught by the defenders. In a Defense-Optimal Nash equilibrium, the Defense-Ratio
matches a simple lower bound.We discover that the existence of Defense-Optimal
Nash equilibria depends in a subtle way on how the number of defenders compares
to two natural graph-theoretic thresholds we identify. In this vein, we obtain,
through a combinatorial analysis of Nash equilibria, a collection of trade-off
results:• When the number of defenders is either sufficiently small or sufficiently
large, Defense-Optimal Nash equilibria may exist. The corresponding decision problem
is computationally tractable for a large number of defenders; the problem becomes
NPNP-complete for a small number of defenders and the intractability is inherited
from a previously unconsidered combinatorial problem in Fractional Graph Theory.•
Perhaps paradoxically, there is a middle range of values for the number of defenders
where Defense-Optimal Nash equilibria do not exist.
author:
- first_name: Marios
full_name: Mavronicolas, Marios
last_name: Mavronicolas
- first_name: Burkhard
full_name: Monien, Burkhard
last_name: Monien
- first_name: Vicky
full_name: Papadopoulou Lesta, Vicky
last_name: Papadopoulou Lesta
citation:
ama: Mavronicolas M, Monien B, Papadopoulou Lesta V. How many attackers can selfish
defenders catch? Discrete Applied Mathematics. 2013;161(16-17):2563-2586.
doi:10.1016/j.dam.2013.05.022
apa: Mavronicolas, M., Monien, B., & Papadopoulou Lesta, V. (2013). How many
attackers can selfish defenders catch? Discrete Applied Mathematics, 161(16–17),
2563–2586. https://doi.org/10.1016/j.dam.2013.05.022
bibtex: '@article{Mavronicolas_Monien_Papadopoulou Lesta_2013, title={How many attackers
can selfish defenders catch?}, volume={161}, DOI={10.1016/j.dam.2013.05.022},
number={16–17}, journal={Discrete Applied Mathematics}, publisher={Elsevier},
author={Mavronicolas, Marios and Monien, Burkhard and Papadopoulou Lesta, Vicky},
year={2013}, pages={2563–2586} }'
chicago: 'Mavronicolas, Marios, Burkhard Monien, and Vicky Papadopoulou Lesta. “How
Many Attackers Can Selfish Defenders Catch?” Discrete Applied Mathematics
161, no. 16–17 (2013): 2563–86. https://doi.org/10.1016/j.dam.2013.05.022.'
ieee: M. Mavronicolas, B. Monien, and V. Papadopoulou Lesta, “How many attackers
can selfish defenders catch?,” Discrete Applied Mathematics, vol. 161,
no. 16–17, pp. 2563–2586, 2013.
mla: Mavronicolas, Marios, et al. “How Many Attackers Can Selfish Defenders Catch?”
Discrete Applied Mathematics, vol. 161, no. 16–17, Elsevier, 2013, pp.
2563–86, doi:10.1016/j.dam.2013.05.022.
short: M. Mavronicolas, B. Monien, V. Papadopoulou Lesta, Discrete Applied Mathematics
161 (2013) 2563–2586.
date_created: 2017-10-17T12:42:34Z
date_updated: 2022-01-06T07:01:47Z
ddc:
- '040'
doi: 10.1016/j.dam.2013.05.022
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:37:35Z
date_updated: 2018-03-15T10:37:35Z
file_id: '1297'
file_name: 523-MMP13.pdf
file_size: 1127543
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:37:35Z
has_accepted_license: '1'
intvolume: ' 161'
issue: 16-17
language:
- iso: eng
page: 2563-2586
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Discrete Applied Mathematics
publisher: Elsevier
status: public
title: How many attackers can selfish defenders catch?
type: journal_article
user_id: '42447'
volume: 161
year: '2013'
...
---
_id: '524'
abstract:
- lang: eng
text: 'We study the complexity theory for the local distributed setting introduced
by Korman, Peleg and Fraigniaud. They have defined three complexity classes LD
(Local Decision), NLD (Nondeterministic Local Decision) and NLD^#n. The class
LD consists of all languages which can be decided with a constant number of communication
rounds. The class NLD consists of all languages which can be verified by a nondeterministic
algorithm with a constant number of communication rounds. In order to define the
nondeterministic classes, they have transferred the notation of nondeterminism
into the distributed setting by the use of certificates and verifiers. The class
NLD^#n consists of all languages which can be verified by a nondeterministic algorithm
where each node has access to an oracle for the number of nodes. They have shown
the hierarchy LD subset NLD subset NLD^#n. Our main contributions are strict hierarchies
within the classes defined by Korman, Peleg and Fraigniaud. We define additional
complexity classes: the class LD(t) consists of all languages which can be decided
with at most t communication rounds. The class NLD-O(f) consists of all languages
which can be verified by a local verifier such that the size of the certificates
that are needed to verify the language are bounded by a function from O(f). Our
main results are refined strict hierarchies within these nondeterministic classes.'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Kamil
full_name: Swirkot, Kamil
last_name: Swirkot
citation:
ama: Meyer auf der Heide F, Swirkot K. Hierarchies in Local Distributed Decision.
2013.
apa: Meyer auf der Heide, F., & Swirkot, K. (2013). Hierarchies in Local Distributed
Decision. arXiv.
bibtex: '@article{Meyer auf der Heide_Swirkot_2013, title={Hierarchies in Local
Distributed Decision}, publisher={arXiv}, author={Meyer auf der Heide, Friedhelm
and Swirkot, Kamil}, year={2013} }'
chicago: Meyer auf der Heide, Friedhelm, and Kamil Swirkot. “Hierarchies in Local
Distributed Decision.” arXiv, 2013.
ieee: F. Meyer auf der Heide and K. Swirkot, “Hierarchies in Local Distributed Decision.”
arXiv, 2013.
mla: Meyer auf der Heide, Friedhelm, and Kamil Swirkot. Hierarchies in Local
Distributed Decision. arXiv, 2013.
short: F. Meyer auf der Heide, K. Swirkot, (2013).
date_created: 2017-10-17T12:42:34Z
date_updated: 2022-01-06T07:01:48Z
ddc:
- '040'
department:
- _id: '63'
external_id:
arxiv:
- '1311.7229'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:37:07Z
date_updated: 2018-03-15T10:37:07Z
file_id: '1296'
file_name: 524-paper_01.pdf
file_size: 534906
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:37:07Z
has_accepted_license: '1'
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: arXiv
status: public
title: Hierarchies in Local Distributed Decision
type: preprint
user_id: '15415'
year: '2013'
...
---
_id: '525'
author:
- first_name: Tim
full_name: Niklas Vinkemeier, Tim
last_name: Niklas Vinkemeier
citation:
ama: Niklas Vinkemeier T. Haptics - Hadoop Performance Testing in Concurrent
Job Scenarios. Universität Paderborn; 2013.
apa: Niklas Vinkemeier, T. (2013). Haptics - Hadoop performance testing in concurrent
job scenarios. Universität Paderborn.
bibtex: '@book{Niklas Vinkemeier_2013, title={Haptics - Hadoop performance testing
in concurrent job scenarios}, publisher={Universität Paderborn}, author={Niklas
Vinkemeier, Tim}, year={2013} }'
chicago: Niklas Vinkemeier, Tim. Haptics - Hadoop Performance Testing in Concurrent
Job Scenarios. Universität Paderborn, 2013.
ieee: T. Niklas Vinkemeier, Haptics - Hadoop performance testing in concurrent
job scenarios. Universität Paderborn, 2013.
mla: Niklas Vinkemeier, Tim. Haptics - Hadoop Performance Testing in Concurrent
Job Scenarios. Universität Paderborn, 2013.
short: T. Niklas Vinkemeier, Haptics - Hadoop Performance Testing in Concurrent
Job Scenarios, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:34Z
date_updated: 2022-01-06T07:01:48Z
department:
- _id: '75'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Haptics - Hadoop performance testing in concurrent job scenarios
type: bachelorsthesis
user_id: '15504'
year: '2013'
...
---
_id: '526'
author:
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
citation:
ama: Mäcker A. Greedy Network Creation With Heavy And Light Edges. Universität
Paderborn; 2013.
apa: Mäcker, A. (2013). Greedy Network Creation With Heavy And Light Edges.
Universität Paderborn.
bibtex: '@book{Mäcker_2013, title={Greedy Network Creation With Heavy And Light
Edges}, publisher={Universität Paderborn}, author={Mäcker, Alexander}, year={2013}
}'
chicago: Mäcker, Alexander. Greedy Network Creation With Heavy And Light Edges.
Universität Paderborn, 2013.
ieee: A. Mäcker, Greedy Network Creation With Heavy And Light Edges. Universität
Paderborn, 2013.
mla: Mäcker, Alexander. Greedy Network Creation With Heavy And Light Edges.
Universität Paderborn, 2013.
short: A. Mäcker, Greedy Network Creation With Heavy And Light Edges, Universität
Paderborn, 2013.
date_created: 2017-10-17T12:42:35Z
date_updated: 2022-01-06T07:01:48Z
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: Greedy Network Creation With Heavy And Light Edges
type: mastersthesis
user_id: '15504'
year: '2013'
...
---
_id: '527'
abstract:
- lang: eng
text: 'In the future vision of software engineering, services from world-wide markets
are composed automated in order to build custom-made systems.Supporting such scenarios
requires an adequate service matching approach.Many existing approaches do not
fulfill two key requirements of emerging concepts like On-The-Fly-Computing, namely
(1) comprehensiveness, i.e., the consideration of different service aspects that
cover not only functional properties, but also non-functional properties and (2)
fuzzy matching, i.e., the ability to deliver gradual results in order to cope
with a certain extent of uncertainty, incompleteness, and tolerance ranges.In
this paper, I present a fuzzy matching process that distinguishes between different
fuzziness sources and leverages fuzziness in different matching steps which consider
different service aspects, e.g., behavior and quality properties. '
author:
- first_name: Marie
full_name: Christin Platenius, Marie
last_name: Christin Platenius
citation:
ama: 'Christin Platenius M. Fuzzy Service Matching in On-The-Fly Computing. In:
Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European
Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations
of Software Engineering (FSE). ; 2013:715-718. doi:10.1145/2491411.2492405'
apa: Christin Platenius, M. (2013). Fuzzy Service Matching in On-The-Fly Computing.
In Proceedings of the Doctoral Symposium of the 9th joint meeting of the European
Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations
of Software Engineering (FSE) (pp. 715–718). https://doi.org/10.1145/2491411.2492405
bibtex: '@inproceedings{Christin Platenius_2013, title={Fuzzy Service Matching in
On-The-Fly Computing}, DOI={10.1145/2491411.2492405},
booktitle={Proceedings of the Doctoral Symposium of the 9th joint meeting of the
European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium
on the Foundations of Software Engineering (FSE)}, author={Christin Platenius,
Marie}, year={2013}, pages={715–718} }'
chicago: Christin Platenius, Marie. “Fuzzy Service Matching in On-The-Fly Computing.”
In Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European
Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations
of Software Engineering (FSE), 715–18, 2013. https://doi.org/10.1145/2491411.2492405.
ieee: M. Christin Platenius, “Fuzzy Service Matching in On-The-Fly Computing,” in
Proceedings of the Doctoral Symposium of the 9th joint meeting of the European
Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations
of Software Engineering (FSE), 2013, pp. 715–718.
mla: Christin Platenius, Marie. “Fuzzy Service Matching in On-The-Fly Computing.”
Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European
Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations
of Software Engineering (FSE), 2013, pp. 715–18, doi:10.1145/2491411.2492405.
short: 'M. Christin Platenius, in: Proceedings of the Doctoral Symposium of the
9th Joint Meeting of the European Software Engineering Conference (ESEC) and the
ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE), 2013,
pp. 715–718.'
date_created: 2017-10-17T12:42:35Z
date_updated: 2022-01-06T07:01:48Z
ddc:
- '040'
department:
- _id: '76'
doi: 10.1145/2491411.2492405
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:36:38Z
date_updated: 2018-03-15T10:36:38Z
file_id: '1295'
file_name: 527-p715-platenius.pdf
file_size: 730490
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:36:38Z
has_accepted_license: '1'
language:
- iso: eng
page: ' 715-718 '
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 9th joint meeting of the
European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on
the Foundations of Software Engineering (FSE)
status: public
title: Fuzzy Service Matching in On-The-Fly Computing
type: conference
user_id: '477'
year: '2013'
...
---
_id: '529'
abstract:
- lang: eng
text: Mechatronic systems reconfigure the structure of their software architecture,
e.g., to avoid hazardous situations or to optimize operational conditions like
minimizing their energy consumption. As software architectures are typically build
on components, reconfiguration actions need to respect the component structure.
This structure should be hierarchical to enable encapsulated components. While
many reconfiguration approaches for embedded real-time systems allow the use of
hierarchically embedded components, i.e., horizontal composition, none of them
offers a modeling and verification solution to take hierarchical composition,
i.e., encapsulation, into account. In this paper, we present an extension to our
existing modeling language, MechatronicUML, to enable safe hierarchical reconfigurations.
The two main extensions are (a) an adapted variant of the two-phase commit protocol
to initiate reconfigurations which maintain component encapsulation and (b) a
timed model checking verification approach for instances of our model. We illustrate
our approach on a case study in the area of smart railway systems by showing two
different use cases of our approach and the verification of their safety properties.
author:
- first_name: Christian
full_name: Heinzemann, Christian
last_name: Heinzemann
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
citation:
ama: 'Heinzemann C, Becker S. Executing Reconfigurations in Hierarchical Component
Architectures. In: Proceedings of the 16th International ACM SigSoft Symposium
on Component-Based Software Engineering (CBSE). ; 2013:3-12. doi:10.1145/2465449.2465452'
apa: Heinzemann, C., & Becker, S. (2013). Executing Reconfigurations in Hierarchical
Component Architectures. In Proceedings of the 16th International ACM SigSoft
Symposium on Component-Based Software Engineering (CBSE) (pp. 3–12). https://doi.org/10.1145/2465449.2465452
bibtex: '@inproceedings{Heinzemann_Becker_2013, title={Executing Reconfigurations
in Hierarchical Component Architectures}, DOI={10.1145/2465449.2465452},
booktitle={Proceedings of the 16th International ACM SigSoft Symposium on Component-Based
Software Engineering (CBSE)}, author={Heinzemann, Christian and Becker, Steffen},
year={2013}, pages={3–12} }'
chicago: Heinzemann, Christian, and Steffen Becker. “Executing Reconfigurations
in Hierarchical Component Architectures.” In Proceedings of the 16th International
ACM SigSoft Symposium on Component-Based Software Engineering (CBSE), 3–12,
2013. https://doi.org/10.1145/2465449.2465452.
ieee: C. Heinzemann and S. Becker, “Executing Reconfigurations in Hierarchical Component
Architectures,” in Proceedings of the 16th International ACM SigSoft Symposium
on Component-Based Software Engineering (CBSE), 2013, pp. 3–12.
mla: Heinzemann, Christian, and Steffen Becker. “Executing Reconfigurations in Hierarchical
Component Architectures.” Proceedings of the 16th International ACM SigSoft
Symposium on Component-Based Software Engineering (CBSE), 2013, pp. 3–12,
doi:10.1145/2465449.2465452.
short: 'C. Heinzemann, S. Becker, in: Proceedings of the 16th International ACM
SigSoft Symposium on Component-Based Software Engineering (CBSE), 2013, pp. 3–12.'
date_created: 2017-10-17T12:42:35Z
date_updated: 2022-01-06T07:01:49Z
ddc:
- '040'
doi: 10.1145/2465449.2465452
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:35:39Z
date_updated: 2018-03-15T10:35:39Z
file_id: '1293'
file_name: 529-p3-heinzemann.pdf
file_size: 541849
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:35:39Z
has_accepted_license: '1'
page: 3-12
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 16th International ACM SigSoft Symposium on Component-Based
Software Engineering (CBSE)
status: public
title: Executing Reconfigurations in Hierarchical Component Architectures
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '530'
author:
- first_name: Dominik
full_name: Buse, Dominik
last_name: Buse
citation:
ama: Buse D. Entwurf Kooperativer Verhaltensweisen Heterogener Roboter. Universität
Paderborn; 2013.
apa: Buse, D. (2013). Entwurf kooperativer Verhaltensweisen heterogener Roboter.
Universität Paderborn.
bibtex: '@book{Buse_2013, title={Entwurf kooperativer Verhaltensweisen heterogener
Roboter}, publisher={Universität Paderborn}, author={Buse, Dominik}, year={2013}
}'
chicago: Buse, Dominik. Entwurf Kooperativer Verhaltensweisen Heterogener Roboter.
Universität Paderborn, 2013.
ieee: D. Buse, Entwurf kooperativer Verhaltensweisen heterogener Roboter.
Universität Paderborn, 2013.
mla: Buse, Dominik. Entwurf Kooperativer Verhaltensweisen Heterogener Roboter.
Universität Paderborn, 2013.
short: D. Buse, Entwurf Kooperativer Verhaltensweisen Heterogener Roboter, Universität
Paderborn, 2013.
date_created: 2017-10-17T12:42:35Z
date_updated: 2022-01-06T07:01:49Z
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Entwurf kooperativer Verhaltensweisen heterogener Roboter
type: bachelorsthesis
user_id: '15504'
year: '2013'
...
---
_id: '531'
author:
- first_name: Sascha
full_name: Lutters, Sascha
last_name: Lutters
citation:
ama: Lutters S. Entwurf eines datenschutzgerechten Reputationssystems. Universität
Paderborn; 2013.
apa: Lutters, S. (2013). Entwurf eines datenschutzgerechten Reputationssystems.
Universität Paderborn.
bibtex: '@book{Lutters_2013, title={Entwurf eines datenschutzgerechten Reputationssystems},
publisher={Universität Paderborn}, author={Lutters, Sascha}, year={2013} }'
chicago: Lutters, Sascha. Entwurf eines datenschutzgerechten Reputationssystems.
Universität Paderborn, 2013.
ieee: S. Lutters, Entwurf eines datenschutzgerechten Reputationssystems.
Universität Paderborn, 2013.
mla: Lutters, Sascha. Entwurf eines datenschutzgerechten Reputationssystems.
Universität Paderborn, 2013.
short: S. Lutters, Entwurf eines datenschutzgerechten Reputationssystems, Universität
Paderborn, 2013.
date_created: 2017-10-17T12:42:35Z
date_updated: 2022-01-06T07:01:49Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Entwurf eines datenschutzgerechten Reputationssystems
type: mastersthesis
user_id: '477'
year: '2013'
...
---
_id: '532'
author:
- first_name: Hendrik
full_name: Hilleckes, Hendrik
last_name: Hilleckes
citation:
ama: Hilleckes H. Entwicklung und Analyse einer verteilten Speicherverwaltung
für dynamische heterogene Speichersysteme. Universität Paderborn; 2013.
apa: Hilleckes, H. (2013). Entwicklung und Analyse einer verteilten Speicherverwaltung
für dynamische heterogene Speichersysteme. Universität Paderborn.
bibtex: '@book{Hilleckes_2013, title={Entwicklung und Analyse einer verteilten Speicherverwaltung
für dynamische heterogene Speichersysteme}, publisher={Universität Paderborn},
author={Hilleckes, Hendrik}, year={2013} }'
chicago: Hilleckes, Hendrik. Entwicklung und Analyse einer verteilten Speicherverwaltung
für dynamische heterogene Speichersysteme. Universität Paderborn, 2013.
ieee: H. Hilleckes, Entwicklung und Analyse einer verteilten Speicherverwaltung
für dynamische heterogene Speichersysteme. Universität Paderborn, 2013.
mla: Hilleckes, Hendrik. Entwicklung und Analyse einer verteilten Speicherverwaltung
für dynamische heterogene Speichersysteme. Universität Paderborn, 2013.
short: H. Hilleckes, Entwicklung und Analyse einer verteilten Speicherverwaltung
für dynamische heterogene Speichersysteme, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:36Z
date_updated: 2022-01-06T07:01:49Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische
heterogene Speichersysteme
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '533'
author:
- first_name: Richard
full_name: Borkowski, Richard
last_name: Borkowski
citation:
ama: Borkowski R. Entwicklung eines Hybriden Planers zur verhaltensorientierten
Selbstoptimierung. Universität Paderborn; 2013.
apa: Borkowski, R. (2013). Entwicklung eines Hybriden Planers zur verhaltensorientierten
Selbstoptimierung. Universität Paderborn.
bibtex: '@book{Borkowski_2013, title={Entwicklung eines Hybriden Planers zur verhaltensorientierten
Selbstoptimierung}, publisher={Universität Paderborn}, author={Borkowski, Richard},
year={2013} }'
chicago: Borkowski, Richard. Entwicklung eines Hybriden Planers zur verhaltensorientierten
Selbstoptimierung. Universität Paderborn, 2013.
ieee: R. Borkowski, Entwicklung eines Hybriden Planers zur verhaltensorientierten
Selbstoptimierung. Universität Paderborn, 2013.
mla: Borkowski, Richard. Entwicklung eines Hybriden Planers zur verhaltensorientierten
Selbstoptimierung. Universität Paderborn, 2013.
short: R. Borkowski, Entwicklung eines Hybriden Planers zur verhaltensorientierten
Selbstoptimierung, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:36Z
date_updated: 2022-01-06T07:01:49Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '534'
author:
- first_name: Suhas
full_name: Satya, Suhas
last_name: Satya
citation:
ama: Satya S. Emulating Wavelength Division Multiplexing Using Openflow.
Universität Paderborn; 2013.
apa: Satya, S. (2013). Emulating Wavelength Division Multiplexing using Openflow.
Universität Paderborn.
bibtex: '@book{Satya_2013, title={Emulating Wavelength Division Multiplexing using
Openflow}, publisher={Universität Paderborn}, author={Satya, Suhas}, year={2013}
}'
chicago: Satya, Suhas. Emulating Wavelength Division Multiplexing Using Openflow.
Universität Paderborn, 2013.
ieee: S. Satya, Emulating Wavelength Division Multiplexing using Openflow.
Universität Paderborn, 2013.
mla: Satya, Suhas. Emulating Wavelength Division Multiplexing Using Openflow.
Universität Paderborn, 2013.
short: S. Satya, Emulating Wavelength Division Multiplexing Using Openflow, Universität
Paderborn, 2013.
date_created: 2017-10-17T12:42:36Z
date_updated: 2022-01-06T07:01:50Z
department:
- _id: '75'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Emulating Wavelength Division Multiplexing using Openflow
type: mastersthesis
user_id: '15504'
year: '2013'
...