---
_id: '451'
abstract:
- lang: eng
text: We introduce the concept of budget games. Players choose a set of tasks and
each task has a certain demand on every resource in the game. Each resource has
a budget. If the budget is not enough to satisfy the sum of all demands, it has
to be shared between the tasks. We study strategic budget games, where the budget
is shared proportionally. We also consider a variant in which the order of the
strategic decisions influences the distribution of the budgets. The complexity
of the optimal solution as well as existence, complexity and quality of equilibria
are analysed. Finally, we show that the time an ordered budget game needs to convergence
towards an equilibrium may be exponential.
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Drees M, Riechers S, Skopalik A. Budget-restricted utility games with ordered
strategic decisions. In: Lavi R, ed. Proceedings of the 7th International Symposium
on Algorithmic Game Theory (SAGT). Lecture Notes in Computer Science. ; 2014:110-121.
doi:10.1007/978-3-662-44803-8_10'
apa: Drees, M., Riechers, S., & Skopalik, A. (2014). Budget-restricted utility
games with ordered strategic decisions. In R. Lavi (Ed.), Proceedings of the
7th International Symposium on Algorithmic Game Theory (SAGT) (pp. 110–121).
https://doi.org/10.1007/978-3-662-44803-8_10
bibtex: '@inproceedings{Drees_Riechers_Skopalik_2014, series={Lecture Notes in Computer
Science}, title={Budget-restricted utility games with ordered strategic decisions},
DOI={10.1007/978-3-662-44803-8_10},
booktitle={Proceedings of the 7th International Symposium on Algorithmic Game
Theory (SAGT)}, author={Drees, Maximilian and Riechers, Sören and Skopalik, Alexander},
editor={Lavi, RonEditor}, year={2014}, pages={110–121}, collection={Lecture Notes
in Computer Science} }'
chicago: Drees, Maximilian, Sören Riechers, and Alexander Skopalik. “Budget-Restricted
Utility Games with Ordered Strategic Decisions.” In Proceedings of the 7th
International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi,
110–21. Lecture Notes in Computer Science, 2014. https://doi.org/10.1007/978-3-662-44803-8_10.
ieee: M. Drees, S. Riechers, and A. Skopalik, “Budget-restricted utility games with
ordered strategic decisions,” in Proceedings of the 7th International Symposium
on Algorithmic Game Theory (SAGT), 2014, pp. 110–121.
mla: Drees, Maximilian, et al. “Budget-Restricted Utility Games with Ordered Strategic
Decisions.” Proceedings of the 7th International Symposium on Algorithmic Game
Theory (SAGT), edited by Ron Lavi, 2014, pp. 110–21, doi:10.1007/978-3-662-44803-8_10.
short: 'M. Drees, S. Riechers, A. Skopalik, in: R. Lavi (Ed.), Proceedings of the
7th International Symposium on Algorithmic Game Theory (SAGT), 2014, pp. 110–121.'
date_created: 2017-10-17T12:42:20Z
date_updated: 2022-01-06T07:01:07Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-662-44803-8_10
editor:
- first_name: Ron
full_name: Lavi, Ron
last_name: Lavi
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:25:10Z
date_updated: 2018-03-16T11:25:10Z
file_id: '1344'
file_name: 451-DRS14.pdf
file_size: 283266
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:25:10Z
has_accepted_license: '1'
language:
- iso: eng
page: 110-121
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 7th International Symposium on Algorithmic Game Theory
(SAGT)
series_title: Lecture Notes in Computer Science
status: public
title: Budget-restricted utility games with ordered strategic decisions
type: conference
user_id: '477'
year: '2014'
...
---
_id: '452'
abstract:
- lang: eng
text: Today's networks, like the Internet, do not consist of one but a mixture of
several interconnected networks. Each has individual qualities and hence the performance
of a network node results from the networks' interplay.We introduce a new game
theoretic model capturing the interplay between a high-speed backbone network
and a low-speed general purpose network. In our model, n nodes are connected by
a static network and each node can decide individually to become a gateway node.
A gateway node pays a fixed price for its connection to the high-speed network,
but can utilize the high-speed network to gain communication distance 0 to all
other gateways. Communication distances in the low-speed network are given by
the hop distances. The effective communication distance between any two nodes
then is given by the shortest path, which is possibly improved by using gateways
as shortcuts.Every node v has the objective to minimize its communication costs,
given by the sum (SUM-game) or maximum (MAX-game) of the effective communication
distances from v to all other nodes plus a fixed price \alpha > 0, if it decides
to be a gateway. For both games and different ranges of \alpha, we study the existence
of equilibria, the price of anarchy, and convergence properties of best-response
dynamics.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Brief Announcement: A Model
for Multilevel Network Games. In: Lavi R, ed. Proceedings of the 7th International
Symposium on Algorithmic Game Theory (SAGT). LNCS. ; 2014:294.'
apa: 'Abshoff, S., Cord-Landwehr, A., Jung, D., & Skopalik, A. (2014). Brief
Announcement: A Model for Multilevel Network Games. In R. Lavi (Ed.), Proceedings
of the 7th International Symposium on Algorithmic Game Theory (SAGT) (p. 294).'
bibtex: '@inproceedings{Abshoff_Cord-Landwehr_Jung_Skopalik_2014, series={LNCS},
title={Brief Announcement: A Model for Multilevel Network Games}, booktitle={Proceedings
of the 7th International Symposium on Algorithmic Game Theory (SAGT)}, author={Abshoff,
Sebastian and Cord-Landwehr, Andreas and Jung, Daniel and Skopalik, Alexander},
editor={Lavi, RonEditor}, year={2014}, pages={294}, collection={LNCS} }'
chicago: 'Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander
Skopalik. “Brief Announcement: A Model for Multilevel Network Games.” In Proceedings
of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited
by Ron Lavi, 294. LNCS, 2014.'
ieee: 'S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Brief Announcement:
A Model for Multilevel Network Games,” in Proceedings of the 7th International
Symposium on Algorithmic Game Theory (SAGT), 2014, p. 294.'
mla: 'Abshoff, Sebastian, et al. “Brief Announcement: A Model for Multilevel Network
Games.” Proceedings of the 7th International Symposium on Algorithmic Game
Theory (SAGT), edited by Ron Lavi, 2014, p. 294.'
short: 'S. Abshoff, A. Cord-Landwehr, D. Jung, A. Skopalik, in: R. Lavi (Ed.), Proceedings
of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, p.
294.'
date_created: 2017-10-17T12:42:20Z
date_updated: 2022-01-06T07:01:08Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
editor:
- first_name: Ron
full_name: Lavi, Ron
last_name: Lavi
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:24:40Z
date_updated: 2018-03-16T11:24:40Z
file_id: '1343'
file_name: 452-title_multilevel-sagt.pdf
file_size: 84783
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:24:40Z
has_accepted_license: '1'
language:
- iso: eng
page: '294'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 7th International Symposium on Algorithmic Game Theory
(SAGT)
series_title: LNCS
status: public
title: 'Brief Announcement: A Model for Multilevel Network Games'
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '453'
abstract:
- lang: eng
text: In this paper we study the potential function in congestion games. We consider
both games with non-decreasing cost functions as well as games with non-increasing
utility functions. We show that the value of the potential function $\Phi(\sf
s)$ of any outcome $\sf s$ of a congestion game approximates the optimum potential
value $\Phi(\sf s^*)$ by a factor $\Psi_{\mathcal{F}}$ which only depends on the
set of cost/utility functions $\mathcal{F}$, and an additive term which is bounded
by the sum of the total possible improvements of the players in the outcome $\sf
s$. The significance of this result is twofold. On the one hand it provides \emph{Price-of-Anarchy}-like
results with respect to the potential function. On the other hand, we show that
these approximations can be used to compute $(1+\varepsilon)\cdot\Psi_{\mathcal{F}}$-approximate
pure Nash equilibria for congestion games with non-decreasing cost functions.
For the special case of polynomial cost functions, this significantly improves
the guarantees from Caragiannis et al. [FOCS 2011]. Moreover, our machinery provides
the first guarantees for general latency functions.
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Martin
full_name: Gairing, Martin
last_name: Gairing
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Feldotto M, Gairing M, Skopalik A. Bounding the Potential Function in Congestion
Games and Approximate Pure Nash Equilibria. In: Proceedings of the 10th International
Conference on Web and Internet Economics (WINE). LNCS. ; 2014:30-43. doi:10.1007/978-3-319-13129-0_3'
apa: Feldotto, M., Gairing, M., & Skopalik, A. (2014). Bounding the Potential
Function in Congestion Games and Approximate Pure Nash Equilibria. In Proceedings
of the 10th International Conference on Web and Internet Economics (WINE)
(pp. 30–43). https://doi.org/10.1007/978-3-319-13129-0_3
bibtex: '@inproceedings{Feldotto_Gairing_Skopalik_2014, series={LNCS}, title={Bounding
the Potential Function in Congestion Games and Approximate Pure Nash Equilibria},
DOI={10.1007/978-3-319-13129-0_3},
booktitle={Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)}, author={Feldotto, Matthias and Gairing, Martin and Skopalik,
Alexander}, year={2014}, pages={30–43}, collection={LNCS} }'
chicago: Feldotto, Matthias, Martin Gairing, and Alexander Skopalik. “Bounding the
Potential Function in Congestion Games and Approximate Pure Nash Equilibria.”
In Proceedings of the 10th International Conference on Web and Internet Economics
(WINE), 30–43. LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_3.
ieee: M. Feldotto, M. Gairing, and A. Skopalik, “Bounding the Potential Function
in Congestion Games and Approximate Pure Nash Equilibria,” in Proceedings of
the 10th International Conference on Web and Internet Economics (WINE), 2014,
pp. 30–43.
mla: Feldotto, Matthias, et al. “Bounding the Potential Function in Congestion Games
and Approximate Pure Nash Equilibria.” Proceedings of the 10th International
Conference on Web and Internet Economics (WINE), 2014, pp. 30–43, doi:10.1007/978-3-319-13129-0_3.
short: 'M. Feldotto, M. Gairing, A. Skopalik, in: Proceedings of the 10th International
Conference on Web and Internet Economics (WINE), 2014, pp. 30–43.'
date_created: 2017-10-17T12:42:20Z
date_updated: 2022-01-06T07:01:09Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-13129-0_3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:24:11Z
date_updated: 2018-03-16T11:24:11Z
file_id: '1342'
file_name: 453-WINE14FGS.pdf
file_size: 324307
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:24:11Z
has_accepted_license: '1'
page: 30-43
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Teilprojekt A
- _id: '7'
name: SFB 901 - Subprojekt A3
publication: Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)
series_title: LNCS
status: public
title: Bounding the Potential Function in Congestion Games and Approximate Pure Nash
Equilibria
type: conference
user_id: '14052'
year: '2014'
...
---
_id: '454'
author:
- first_name: Waleri
full_name: Heldt, Waleri
last_name: Heldt
citation:
ama: 'Heldt W. Automated Service Composition: Adaption of the ASTRO Approach.
Universität Paderborn; 2014.'
apa: 'Heldt, W. (2014). Automated Service Composition: Adaption of the ASTRO
Approach. Universität Paderborn.'
bibtex: '@book{Heldt_2014, title={Automated Service Composition: Adaption of the
ASTRO Approach}, publisher={Universität Paderborn}, author={Heldt, Waleri}, year={2014}
}'
chicago: 'Heldt, Waleri. Automated Service Composition: Adaption of the ASTRO
Approach. Universität Paderborn, 2014.'
ieee: 'W. Heldt, Automated Service Composition: Adaption of the ASTRO Approach.
Universität Paderborn, 2014.'
mla: 'Heldt, Waleri. Automated Service Composition: Adaption of the ASTRO Approach.
Universität Paderborn, 2014.'
short: 'W. Heldt, Automated Service Composition: Adaption of the ASTRO Approach,
Universität Paderborn, 2014.'
date_created: 2017-10-17T12:42:20Z
date_updated: 2022-01-06T07:01:09Z
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: 'Automated Service Composition: Adaption of the ASTRO Approach'
type: mastersthesis
user_id: '15504'
year: '2014'
...
---
_id: '455'
abstract:
- lang: eng
text: We study the existence of approximate pure Nash equilibria in weighted congestion
games and develop techniques to obtain approximate potential functions that prove
the existence of alpha-approximate pure Nash equilibria and the convergence of
alpha-improvement steps. Specifically, we show how to obtain upper bounds for
approximation factor alpha for a given class of cost functions. For example for
concave cost functions the factor is at most 3/2, for quadratic cost functions
it is at most 4/3, and for polynomial cost functions of maximal degree d it is
at at most d + 1. For games with two players we obtain tight bounds which are
as small as for example 1.054 in the case of quadratic cost functions.
author:
- first_name: Christoph
full_name: Hansknecht, Christoph
last_name: Hansknecht
- first_name: Max
full_name: Klimm, Max
last_name: Klimm
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Hansknecht C, Klimm M, Skopalik A. Approximate pure Nash equilibria in weighted
congestion games. In: Proceedings of the 17th. International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems (APPROX). LIPIcs. ; 2014:242-257.
doi:10.4230/LIPIcs.APPROX-RANDOM.2014.242'
apa: Hansknecht, C., Klimm, M., & Skopalik, A. (2014). Approximate pure Nash
equilibria in weighted congestion games. In Proceedings of the 17th. International
Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)
(pp. 242–257). https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242
bibtex: '@inproceedings{Hansknecht_Klimm_Skopalik_2014, series={LIPIcs}, title={Approximate
pure Nash equilibria in weighted congestion games}, DOI={10.4230/LIPIcs.APPROX-RANDOM.2014.242},
booktitle={Proceedings of the 17th. International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems (APPROX)}, author={Hansknecht, Christoph
and Klimm, Max and Skopalik, Alexander}, year={2014}, pages={242–257}, collection={LIPIcs}
}'
chicago: Hansknecht, Christoph, Max Klimm, and Alexander Skopalik. “Approximate
Pure Nash Equilibria in Weighted Congestion Games.” In Proceedings of the 17th.
International Workshop on Approximation Algorithms for Combinatorial Optimization
Problems (APPROX), 242–57. LIPIcs, 2014. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242.
ieee: C. Hansknecht, M. Klimm, and A. Skopalik, “Approximate pure Nash equilibria
in weighted congestion games,” in Proceedings of the 17th. International Workshop
on Approximation Algorithms for Combinatorial Optimization Problems (APPROX),
2014, pp. 242–257.
mla: Hansknecht, Christoph, et al. “Approximate Pure Nash Equilibria in Weighted
Congestion Games.” Proceedings of the 17th. International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems (APPROX), 2014, pp. 242–57,
doi:10.4230/LIPIcs.APPROX-RANDOM.2014.242.
short: 'C. Hansknecht, M. Klimm, A. Skopalik, in: Proceedings of the 17th. International
Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX),
2014, pp. 242–257.'
date_created: 2017-10-17T12:42:20Z
date_updated: 2022-01-06T07:01:09Z
ddc:
- '040'
department:
- _id: '541'
- _id: '63'
doi: 10.4230/LIPIcs.APPROX-RANDOM.2014.242
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:23:40Z
date_updated: 2018-03-16T11:23:40Z
file_id: '1341'
file_name: 455-HKS14.pdf
file_size: 512712
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:23:40Z
has_accepted_license: '1'
language:
- iso: eng
page: 242 - 257
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 17th. International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems (APPROX)
series_title: LIPIcs
status: public
title: Approximate pure Nash equilibria in weighted congestion games
type: conference
user_id: '477'
year: '2014'
...
---
_id: '456'
abstract:
- lang: eng
text: We study the existence of approximate pure Nash equilibriain social context
congestion games. For any given set of allowed costfunctions F, we provide a threshold
value μ(F), and show that for theclass of social context congestion games with
cost functions from F, α-Nash dynamics are guaranteed to converge to α-approximate
pure Nashequilibrium if and only if α > μ(F).Interestingly, μ(F) is related and
always upper bounded by Roughgarden’sanarchy value [19].
author:
- first_name: Martin
full_name: Gairing, Martin
last_name: Gairing
- first_name: Grammateia
full_name: Kotsialou, Grammateia
last_name: Kotsialou
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Gairing M, Kotsialou G, Skopalik A. Approximate pure Nash equilibria in Social
Context Congestion Games. In: Proceedings of the 10th International Conference
on Web and Internet Economics (WINE). LNCS. ; 2014:480-485. doi:10.1007/978-3-319-13129-0_43'
apa: Gairing, M., Kotsialou, G., & Skopalik, A. (2014). Approximate pure Nash
equilibria in Social Context Congestion Games. In Proceedings of the 10th International
Conference on Web and Internet Economics (WINE) (pp. 480–485). https://doi.org/10.1007/978-3-319-13129-0_43
bibtex: '@inproceedings{Gairing_Kotsialou_Skopalik_2014, series={LNCS}, title={Approximate
pure Nash equilibria in Social Context Congestion Games}, DOI={10.1007/978-3-319-13129-0_43},
booktitle={Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)}, author={Gairing, Martin and Kotsialou, Grammateia and Skopalik,
Alexander}, year={2014}, pages={480–485}, collection={LNCS} }'
chicago: Gairing, Martin, Grammateia Kotsialou, and Alexander Skopalik. “Approximate
Pure Nash Equilibria in Social Context Congestion Games.” In Proceedings of
the 10th International Conference on Web and Internet Economics (WINE), 480–85.
LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_43.
ieee: M. Gairing, G. Kotsialou, and A. Skopalik, “Approximate pure Nash equilibria
in Social Context Congestion Games,” in Proceedings of the 10th International
Conference on Web and Internet Economics (WINE), 2014, pp. 480–485.
mla: Gairing, Martin, et al. “Approximate Pure Nash Equilibria in Social Context
Congestion Games.” Proceedings of the 10th International Conference on Web
and Internet Economics (WINE), 2014, pp. 480–85, doi:10.1007/978-3-319-13129-0_43.
short: 'M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the 10th International
Conference on Web and Internet Economics (WINE), 2014, pp. 480–485.'
date_created: 2017-10-17T12:42:21Z
date_updated: 2022-01-06T07:01:10Z
ddc:
- '040'
department:
- _id: '541'
- _id: '63'
doi: 10.1007/978-3-319-13129-0_43
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:22:57Z
date_updated: 2018-03-16T11:22:57Z
file_id: '1340'
file_name: 456-WINE14final.pdf
file_size: 377378
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:22:57Z
has_accepted_license: '1'
language:
- iso: eng
page: 480 - 485
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)
series_title: LNCS
status: public
title: Approximate pure Nash equilibria in Social Context Congestion Games
type: conference
user_id: '477'
year: '2014'
...
---
_id: '457'
abstract:
- lang: eng
text: Automatically composing service-based software solutionsis still a challenging
task. Functional as well as nonfunctionalproperties have to be considered in order
to satisfyindividual user requests. Regarding non-functional properties,the composition
process can be modeled as optimization problemand solved accordingly. Functional
properties, in turn, can bedescribed by means of a formal specification language.
Statespacebased planning approaches can then be applied to solvethe underlying
composition problem. However, depending on theexpressiveness of the applied formalism
and the completenessof the functional descriptions, formally equivalent services
maystill differ with respect to their implemented functionality. As aconsequence,
the most appropriate solution for a desired functionalitycan hardly be determined
without considering additionalinformation. In this paper, we demonstrate how to
overcome thislack of information by means of Reinforcement Learning. Inorder to
resolve ambiguity, we expand state-space based servicecomposition by a recommendation
mechanism that supportsdecision-making beyond formal specifications. The recommendationmechanism
adjusts its recommendation strategy basedon feedback from previous composition
runs. Image processingserves as case study. Experimental results show the benefit
of ourproposed solution.
author:
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: 'Bernd '
full_name: 'Kleinjohann, Bernd '
last_name: Kleinjohann
citation:
ama: 'Jungmann A, Mohr F, Kleinjohann B. Applying Reinforcement Learning for Resolving
Ambiguity in Service Composition. In: Proceedings of the 7th International
Conference on Service Oriented Computing and Applications (SOCA). ; 2014:105-112.
doi:10.1109/SOCA.2014.48'
apa: Jungmann, A., Mohr, F., & Kleinjohann, B. (2014). Applying Reinforcement
Learning for Resolving Ambiguity in Service Composition. In Proceedings of
the 7th International Conference on Service Oriented Computing and Applications
(SOCA) (pp. 105–112). https://doi.org/10.1109/SOCA.2014.48
bibtex: '@inproceedings{Jungmann_Mohr_Kleinjohann_2014, title={Applying Reinforcement
Learning for Resolving Ambiguity in Service Composition}, DOI={10.1109/SOCA.2014.48},
booktitle={Proceedings of the 7th International Conference on Service Oriented
Computing and Applications (SOCA)}, author={Jungmann, Alexander and Mohr, Felix
and Kleinjohann, Bernd }, year={2014}, pages={105–112} }'
chicago: Jungmann, Alexander, Felix Mohr, and Bernd Kleinjohann. “Applying Reinforcement
Learning for Resolving Ambiguity in Service Composition.” In Proceedings of
the 7th International Conference on Service Oriented Computing and Applications
(SOCA), 105–12, 2014. https://doi.org/10.1109/SOCA.2014.48.
ieee: A. Jungmann, F. Mohr, and B. Kleinjohann, “Applying Reinforcement Learning
for Resolving Ambiguity in Service Composition,” in Proceedings of the 7th
International Conference on Service Oriented Computing and Applications (SOCA),
2014, pp. 105–112.
mla: Jungmann, Alexander, et al. “Applying Reinforcement Learning for Resolving
Ambiguity in Service Composition.” Proceedings of the 7th International Conference
on Service Oriented Computing and Applications (SOCA), 2014, pp. 105–12, doi:10.1109/SOCA.2014.48.
short: 'A. Jungmann, F. Mohr, B. Kleinjohann, in: Proceedings of the 7th International
Conference on Service Oriented Computing and Applications (SOCA), 2014, pp. 105–112.'
date_created: 2017-10-17T12:42:21Z
date_updated: 2022-01-06T07:01:12Z
ddc:
- '040'
department:
- _id: '355'
doi: 10.1109/SOCA.2014.48
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:22:26Z
date_updated: 2018-03-16T11:22:26Z
file_id: '1339'
file_name: 457-SOCA2014-Jungmann-Mohr.pdf
file_size: 1324374
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:22:26Z
has_accepted_license: '1'
language:
- iso: eng
page: 105-112
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 7th International Conference on Service Oriented Computing
and Applications (SOCA)
status: public
title: Applying Reinforcement Learning for Resolving Ambiguity in Service Composition
type: conference
user_id: '477'
year: '2014'
...
---
_id: '458'
author:
- first_name: Philipp
full_name: Dreimann, Philipp
last_name: Dreimann
citation:
ama: Dreimann P. Anticipatory Power Cycling of Mobile Network Equipment for High-Demand
Multimedia Traffic. Universität Paderborn; 2014.
apa: Dreimann, P. (2014). Anticipatory Power Cycling of Mobile Network Equipment
for High-Demand Multimedia Traffic. Universität Paderborn.
bibtex: '@book{Dreimann_2014, title={Anticipatory Power Cycling of Mobile Network
Equipment for High-Demand Multimedia Traffic}, publisher={Universität Paderborn},
author={Dreimann, Philipp}, year={2014} }'
chicago: Dreimann, Philipp. Anticipatory Power Cycling of Mobile Network Equipment
for High-Demand Multimedia Traffic. Universität Paderborn, 2014.
ieee: P. Dreimann, Anticipatory Power Cycling of Mobile Network Equipment for
High-Demand Multimedia Traffic. Universität Paderborn, 2014.
mla: Dreimann, Philipp. Anticipatory Power Cycling of Mobile Network Equipment
for High-Demand Multimedia Traffic. Universität Paderborn, 2014.
short: P. Dreimann, Anticipatory Power Cycling of Mobile Network Equipment for High-Demand
Multimedia Traffic, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:21Z
date_updated: 2022-01-06T07:01:13Z
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: Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia
Traffic
type: mastersthesis
user_id: '15504'
year: '2014'
...
---
_id: '459'
abstract:
- lang: eng
text: In this survey article, we discuss two algorithmic research areas that emerge
from problems that arise when resources are offered in the cloud. The first area,
online leasing, captures problems arising from the fact that resources in the
cloud are not bought, but leased by cloud vendors. The second area, Distributed
Storage Systems, deals with problems arising from so-called cloud federations,
i.e., when several cloud providers are needed to fulfill a given task.
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- 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: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Markarian C, Meyer auf der Heide F, Scheideler C. Algorithmic
Aspects of Resource Management in the Cloud. In: Proceedings of the 21st International
Colloquium on Structural Information and Communication Complexity (SIROCCO).
LNCS. ; 2014:1-13. doi:10.1007/978-3-319-09620-9_1'
apa: Kniesburges, S., Markarian, C., Meyer auf der Heide, F., & Scheideler,
C. (2014). Algorithmic Aspects of Resource Management in the Cloud. In Proceedings
of the 21st International Colloquium on Structural Information and Communication
Complexity (SIROCCO) (pp. 1–13). https://doi.org/10.1007/978-3-319-09620-9_1
bibtex: '@inproceedings{Kniesburges_Markarian_Meyer auf der Heide_Scheideler_2014,
series={LNCS}, title={Algorithmic Aspects of Resource Management in the Cloud},
DOI={10.1007/978-3-319-09620-9_1},
booktitle={Proceedings of the 21st International Colloquium on Structural Information
and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Markarian,
Christine and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2014},
pages={1–13}, collection={LNCS} }'
chicago: Kniesburges, Sebastian, Christine Markarian, Friedhelm Meyer auf der Heide,
and Christian Scheideler. “Algorithmic Aspects of Resource Management in the Cloud.”
In Proceedings of the 21st International Colloquium on Structural Information
and Communication Complexity (SIROCCO), 1–13. LNCS, 2014. https://doi.org/10.1007/978-3-319-09620-9_1.
ieee: S. Kniesburges, C. Markarian, F. Meyer auf der Heide, and C. Scheideler, “Algorithmic
Aspects of Resource Management in the Cloud,” in Proceedings of the 21st International
Colloquium on Structural Information and Communication Complexity (SIROCCO),
2014, pp. 1–13.
mla: Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management
in the Cloud.” Proceedings of the 21st International Colloquium on Structural
Information and Communication Complexity (SIROCCO), 2014, pp. 1–13, doi:10.1007/978-3-319-09620-9_1.
short: 'S. Kniesburges, C. Markarian, F. Meyer auf der Heide, C. Scheideler, in:
Proceedings of the 21st International Colloquium on Structural Information and
Communication Complexity (SIROCCO), 2014, pp. 1–13.'
date_created: 2017-10-17T12:42:21Z
date_updated: 2022-01-06T07:01:14Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1007/978-3-319-09620-9_1
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:21:54Z
date_updated: 2018-03-16T11:21:54Z
file_id: '1338'
file_name: 459-SIROCCO2014.pdf
file_size: 274496
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:21:54Z
has_accepted_license: '1'
page: 1-13
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 21st International Colloquium on Structural Information
and Communication Complexity (SIROCCO)
series_title: LNCS
status: public
title: Algorithmic Aspects of Resource Management in the Cloud
type: conference
user_id: '477'
year: '2014'
...
---
_id: '460'
author:
- first_name: Robert
full_name: Mittendorf, Robert
last_name: Mittendorf
citation:
ama: Mittendorf R. Advanced AES-Key Recovery from Decayed RAM-Dumps Using Multi-Threading
and FPGAs. Universität Paderborn; 2014.
apa: Mittendorf, R. (2014). Advanced AES-key recovery from decayed RAM-dumps
using multi-threading and FPGAs. Universität Paderborn.
bibtex: '@book{Mittendorf_2014, title={Advanced AES-key recovery from decayed RAM-dumps
using multi-threading and FPGAs}, publisher={Universität Paderborn}, author={Mittendorf,
Robert}, year={2014} }'
chicago: Mittendorf, Robert. Advanced AES-Key Recovery from Decayed RAM-Dumps
Using Multi-Threading and FPGAs. Universität Paderborn, 2014.
ieee: R. Mittendorf, Advanced AES-key recovery from decayed RAM-dumps using multi-threading
and FPGAs. Universität Paderborn, 2014.
mla: Mittendorf, Robert. Advanced AES-Key Recovery from Decayed RAM-Dumps Using
Multi-Threading and FPGAs. Universität Paderborn, 2014.
short: R. Mittendorf, Advanced AES-Key Recovery from Decayed RAM-Dumps Using Multi-Threading
and FPGAs, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:21Z
date_updated: 2022-01-06T07:01:14Z
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: Advanced AES-key recovery from decayed RAM-dumps using multi-threading and
FPGAs
type: mastersthesis
user_id: '15504'
year: '2014'
...
---
_id: '461'
author:
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
citation:
ama: Dräxler S. Adaptive Placement of Programmable Virtual Network Function Chains.
Universität Paderborn; 2014.
apa: Dräxler, S. (2014). Adaptive Placement of Programmable Virtual Network Function
Chains. Universität Paderborn.
bibtex: '@book{Dräxler_2014, title={Adaptive Placement of Programmable Virtual Network
Function Chains}, publisher={Universität Paderborn}, author={Dräxler, Sevil},
year={2014} }'
chicago: Dräxler, Sevil. Adaptive Placement of Programmable Virtual Network Function
Chains. Universität Paderborn, 2014.
ieee: S. Dräxler, Adaptive Placement of Programmable Virtual Network Function
Chains. Universität Paderborn, 2014.
mla: Dräxler, Sevil. Adaptive Placement of Programmable Virtual Network Function
Chains. Universität Paderborn, 2014.
short: S. Dräxler, Adaptive Placement of Programmable Virtual Network Function Chains,
Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:21Z
date_updated: 2022-01-06T07:01:14Z
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: Adaptive Placement of Programmable Virtual Network Function Chains
type: bachelorsthesis
user_id: '477'
year: '2014'
...
---
_id: '462'
abstract:
- lang: eng
text: We discuss a technique to analyze complex infinitely repeated games using
techniques from the fields of game theory and simulations. Our research is motivated
by the analysis of electronic markets with thousands of participants and possibly
complex strategic behavior. We consider an example of a global market of composed
IT services to demonstrate the use of our simulation technique. We present our
current work in this area and we want to discuss further approaches for the future.
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Feldotto M, Skopalik A. A Simulation Framework for Analyzing Complex Infinitely
Repeated Games. In: Proceedings of the 4th International Conference on Simulation
and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014).
; 2014:625-630. doi:10.5220/0005110406250630'
apa: Feldotto, M., & Skopalik, A. (2014). A Simulation Framework for Analyzing
Complex Infinitely Repeated Games. In Proceedings of the 4th International
Conference on Simulation and Modeling Methodologies, Technologies and Applications
(SIMULTECH 2014) (pp. 625–630). https://doi.org/10.5220/0005110406250630
bibtex: '@inproceedings{Feldotto_Skopalik_2014, title={A Simulation Framework for
Analyzing Complex Infinitely Repeated Games}, DOI={10.5220/0005110406250630},
booktitle={Proceedings of the 4th International Conference on Simulation and Modeling
Methodologies, Technologies and Applications (SIMULTECH 2014)}, author={Feldotto,
Matthias and Skopalik, Alexander}, year={2014}, pages={625–630} }'
chicago: Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for
Analyzing Complex Infinitely Repeated Games.” In Proceedings of the 4th International
Conference on Simulation and Modeling Methodologies, Technologies and Applications
(SIMULTECH 2014), 625–30, 2014. https://doi.org/10.5220/0005110406250630.
ieee: M. Feldotto and A. Skopalik, “A Simulation Framework for Analyzing Complex
Infinitely Repeated Games,” in Proceedings of the 4th International Conference
on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH
2014), 2014, pp. 625–630.
mla: Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for Analyzing
Complex Infinitely Repeated Games.” Proceedings of the 4th International Conference
on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH
2014), 2014, pp. 625–30, doi:10.5220/0005110406250630.
short: 'M. Feldotto, A. Skopalik, in: Proceedings of the 4th International Conference
on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH
2014), 2014, pp. 625–630.'
date_created: 2017-10-17T12:42:22Z
date_updated: 2022-01-06T07:01:15Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.5220/0005110406250630
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:21:24Z
date_updated: 2018-03-16T11:21:24Z
file_id: '1337'
file_name: 462-FS2014SIMULTECH.pdf
file_size: 993721
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:21:24Z
has_accepted_license: '1'
page: 625-630
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Teilprojekt A
- _id: '7'
name: SFB 901 - Subprojekt A3
publication: Proceedings of the 4th International Conference on Simulation and Modeling
Methodologies, Technologies and Applications (SIMULTECH 2014)
status: public
title: A Simulation Framework for Analyzing Complex Infinitely Repeated Games
type: conference
user_id: '14052'
year: '2014'
...
---
_id: '463'
abstract:
- lang: eng
text: Several fault attacks against pairing-based cryptography have been described
theoretically in recent years. Interestingly, none of these have been practically
evaluated. We accomplished this task and prove that fault attacks against pairing-based
cryptography are indeed possible and are even practical — thus posing a serious
threat. Moreover, we successfully conducted a second-order fault attack against
an open source implementation of the eta pairing on an AVR XMEGA A1. We injected
the first fault into the computation of the Miller Algorithm and applied the second
fault to skip the final exponentiation completely. We introduce a low-cost setup
that allowed us to generate multiple independent faults in one computation. The
setup implements these faults by clock glitches which induce instruction skips.
With this setup we conducted the first practical fault attack against a complete
pairing computation.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Ricardo
full_name: Gomes da Silva, Ricardo
last_name: Gomes da Silva
- first_name: Peter
full_name: Günther, Peter
last_name: Günther
- first_name: Juliane
full_name: Krämer, Juliane
last_name: Krämer
- first_name: Jean-Pierre
full_name: Seifert, Jean-Pierre
last_name: Seifert
citation:
ama: 'Blömer J, Gomes da Silva R, Günther P, Krämer J, Seifert J-P. A Practical
Second-Order Fault Attack against a Real-World Pairing Implementation. In: Proceedings
of Fault Tolerance and Diagnosis in Cryptography(FDTC). ; 2014:123--136. doi:10.1109/FDTC.2014.22'
apa: Blömer, J., Gomes da Silva, R., Günther, P., Krämer, J., & Seifert, J.-P.
(2014). A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.
In Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC) (pp.
123--136). https://doi.org/10.1109/FDTC.2014.22
bibtex: '@inproceedings{Blömer_Gomes da Silva_Günther_Krämer_Seifert_2014, title={A
Practical Second-Order Fault Attack against a Real-World Pairing Implementation},
DOI={10.1109/FDTC.2014.22},
booktitle={Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)},
author={Blömer, Johannes and Gomes da Silva, Ricardo and Günther, Peter and Krämer,
Juliane and Seifert, Jean-Pierre}, year={2014}, pages={123--136} }'
chicago: Blömer, Johannes, Ricardo Gomes da Silva, Peter Günther, Juliane Krämer,
and Jean-Pierre Seifert. “A Practical Second-Order Fault Attack against a Real-World
Pairing Implementation.” In Proceedings of Fault Tolerance and Diagnosis in
Cryptography(FDTC), 123--136, 2014. https://doi.org/10.1109/FDTC.2014.22.
ieee: J. Blömer, R. Gomes da Silva, P. Günther, J. Krämer, and J.-P. Seifert, “A
Practical Second-Order Fault Attack against a Real-World Pairing Implementation,”
in Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC),
2014, pp. 123--136.
mla: Blömer, Johannes, et al. “A Practical Second-Order Fault Attack against a Real-World
Pairing Implementation.” Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC),
2014, pp. 123--136, doi:10.1109/FDTC.2014.22.
short: 'J. Blömer, R. Gomes da Silva, P. Günther, J. Krämer, J.-P. Seifert, in:
Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp.
123--136.'
date_created: 2017-10-17T12:42:22Z
date_updated: 2022-01-06T07:01:16Z
ddc:
- '040'
department:
- _id: '64'
doi: 10.1109/FDTC.2014.22
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:20:54Z
date_updated: 2018-03-16T11:20:54Z
file_id: '1336'
file_name: 463-FDTC14.pdf
file_size: 437518
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:20:54Z
has_accepted_license: '1'
page: 123--136
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
publication: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)
status: public
title: A Practical Second-Order Fault Attack against a Real-World Pairing Implementation
type: conference
user_id: '25078'
year: '2014'
...
---
_id: '464'
abstract:
- lang: eng
text: Topological self-stabilization is an important concept to build robust open
distributed systems (such as peer-to-peer systems) where nodes can organize themselves
into meaningful network topologies. The goal is to devise distributed algorithms
where nodes forward, insert, and delete links to neighboring nodes, and that converge
quickly to such a desirable topology, independently of the initial network configuration.
This article proposes a new model to study the parallel convergence time. Our
model sheds light on the achievable parallelism by avoiding bottlenecks of existing
models that can yield a distorted picture. As a case study, we consider local
graph linearization—i.e., how to build a sorted list of the nodes of a connected
graph in a distributed and self-stabilizing manner. In order to study the main
structure and properties of our model, we propose two variants of a most simple
local linearization algorithm. For each of these variants, we present analyses
of the worst-case and bestcase parallel time complexities, as well as the performance
under a greedy selection of the actions to be executed. It turns out that the
analysis is non-trivial despite the simple setting, and to complement our formal
insights we report on our experiments which indicate that the runtimes may be
better in the average case.
author:
- first_name: Dominik
full_name: Gall, Dominik
last_name: Gall
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: 'Hanjo '
full_name: 'Täubig, Hanjo '
last_name: Täubig
citation:
ama: Gall D, Jacob R, Richa AW, Scheideler C, Schmid S, Täubig H. A Note on the
Parallel Runtime of Self-Stabilizing Graph Linearization. Theory of Computing
Systems. 2014;(1):110-135. doi:10.1007/s00224-013-9504-x
apa: Gall, D., Jacob, R., Richa, A. W., Scheideler, C., Schmid, S., & Täubig,
H. (2014). A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.
Theory of Computing Systems, (1), 110–135. https://doi.org/10.1007/s00224-013-9504-x
bibtex: '@article{Gall_Jacob_Richa_Scheideler_Schmid_Täubig_2014, title={A Note
on the Parallel Runtime of Self-Stabilizing Graph Linearization}, DOI={10.1007/s00224-013-9504-x},
number={1}, journal={Theory of Computing Systems}, publisher={Springer}, author={Gall,
Dominik and Jacob, Riko and Richa, Andrea W. and Scheideler, Christian and Schmid,
Stefan and Täubig, Hanjo }, year={2014}, pages={110–135} }'
chicago: 'Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan
Schmid, and Hanjo Täubig. “A Note on the Parallel Runtime of Self-Stabilizing
Graph Linearization.” Theory of Computing Systems, no. 1 (2014): 110–35.
https://doi.org/10.1007/s00224-013-9504-x.'
ieee: D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A
Note on the Parallel Runtime of Self-Stabilizing Graph Linearization,” Theory
of Computing Systems, no. 1, pp. 110–135, 2014.
mla: Gall, Dominik, et al. “A Note on the Parallel Runtime of Self-Stabilizing Graph
Linearization.” Theory of Computing Systems, no. 1, Springer, 2014, pp.
110–35, doi:10.1007/s00224-013-9504-x.
short: D. Gall, R. Jacob, A.W. Richa, C. Scheideler, S. Schmid, H. Täubig, Theory
of Computing Systems (2014) 110–135.
date_created: 2017-10-17T12:42:22Z
date_updated: 2022-01-06T07:01:16Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/s00224-013-9504-x
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:19:45Z
date_updated: 2018-03-16T11:19:45Z
file_id: '1334'
file_name: 464-GJRSST2014.pdf
file_size: 947484
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:19:45Z
has_accepted_license: '1'
issue: '1'
page: 110-135
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Theory of Computing Systems
publisher: Springer
status: public
title: A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '465'
abstract:
- lang: eng
text: This article presents a novel Mixed Integer Nonlinear Programming (MINLP)
approach for finding a renewal plan of pipes in a water distribution system. We
formulate a MINLP model for finding the times of renewal and suited measurements
of pipe dimensions in a multi-year planning horizon. The model includes a multi-period
hydraulic simulation of the distribution systems behaviour thereby respecting
the friction caused headloss as a nonlinear constraint. We apply the MINLP solver
Bonmin to a test network and present first numerical results. The models embedding
into a general solution framework for water network problems consisting of network
reduction and simulation steps in an interated way, is beign discussed. This latter
discussion corresponds well to the recent results by C. Hallmann for the problem
of tank planning within the mentioned solution framework that has been presented
there for the first time.
author:
- first_name: Florian
full_name: Stapel, Florian
last_name: Stapel
- first_name: Leena
full_name: Suhl, Leena
last_name: Suhl
citation:
ama: Stapel F, Suhl L. A MINLP Approach for Planning the Renewal of Pipes in
Drinking Water Networks. Universität Paderborn; 2014.
apa: Stapel, F., & Suhl, L. (2014). A MINLP Approach for Planning the Renewal
of Pipes in Drinking Water Networks. Universität Paderborn.
bibtex: '@book{Stapel_Suhl_2014, title={A MINLP Approach for Planning the Renewal
of Pipes in Drinking Water Networks}, publisher={Universität Paderborn}, author={Stapel,
Florian and Suhl, Leena}, year={2014} }'
chicago: Stapel, Florian, and Leena Suhl. A MINLP Approach for Planning the Renewal
of Pipes in Drinking Water Networks. Universität Paderborn, 2014.
ieee: F. Stapel and L. Suhl, A MINLP Approach for Planning the Renewal of Pipes
in Drinking Water Networks. Universität Paderborn, 2014.
mla: Stapel, Florian, and Leena Suhl. A MINLP Approach for Planning the Renewal
of Pipes in Drinking Water Networks. Universität Paderborn, 2014.
short: F. Stapel, L. Suhl, A MINLP Approach for Planning the Renewal of Pipes in
Drinking Water Networks, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:22Z
date_updated: 2022-01-06T07:01:16Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:20:22Z
date_updated: 2018-03-16T11:20:22Z
file_id: '1335'
file_name: 465-2014_-_Stapel__Suhl_-_TechReport_MINLP_Water.pdf
file_size: 435976
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:20:22Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '15'
name: SFB 901 - Subprojekt C3
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: A MINLP Approach for Planning the Renewal of Pipes in Drinking Water Networks
type: report
user_id: '15504'
year: '2014'
...
---
_id: '466'
author:
- first_name: Marcel
full_name: Brand, Marcel
last_name: Brand
citation:
ama: Brand M. A Generalized Loop Accelerator Implemented as a Coarse Grained
Array. Universität Paderborn; 2014.
apa: Brand, M. (2014). A generalized loop accelerator implemented as a coarse
grained array. Universität Paderborn.
bibtex: '@book{Brand_2014, title={A generalized loop accelerator implemented as
a coarse grained array}, publisher={Universität Paderborn}, author={Brand, Marcel},
year={2014} }'
chicago: Brand, Marcel. A Generalized Loop Accelerator Implemented as a Coarse
Grained Array. Universität Paderborn, 2014.
ieee: M. Brand, A generalized loop accelerator implemented as a coarse grained
array. Universität Paderborn, 2014.
mla: Brand, Marcel. A Generalized Loop Accelerator Implemented as a Coarse Grained
Array. Universität Paderborn, 2014.
short: M. Brand, A Generalized Loop Accelerator Implemented as a Coarse Grained
Array, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:22Z
date_updated: 2022-01-06T07:01:17Z
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: A generalized loop accelerator implemented as a coarse grained array
type: mastersthesis
user_id: '477'
year: '2014'
...
---
_id: '467'
abstract:
- lang: eng
text: Financial benefits are an important factor when cloud infrastructure is considered
to meet processing demand. The dynamics of on-demand pricing and service usage
are investigated in a two-stage game model for a monopoly Infrastructure-as-a-Service
(IaaS) market. The possibility of hybrid clouds (public clouds plus own infrastructure)
turns out to be essential in order that not only the provider but also the clients
have significant benefits from on-demand services. Even if the client meets all
demand in the public cloud, the threat of building a hybrid cloud keeps the instance
price low. This is not the case when reserved instances are offered as well. Parameters
like load profiles and economies of scale have a huge effect on likely future pricing
and on a cost-optimal split-up of client demand between either a client’s own
data center and a public cloud service or between reserved and on-demand cloud
instances.
author:
- first_name: Jörn
full_name: Künsemöller, Jörn
last_name: Künsemöller
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: Künsemöller J, Karl H. A Game-Theoretic Approach to the Financial Benefits
of Infrastructure-as-a-Service. Future Generation Computer Systems. 2014:44--52.
doi:10.1016/j.future.2014.03.005
apa: Künsemöller, J., & Karl, H. (2014). A Game-Theoretic Approach to the Financial
Benefits of Infrastructure-as-a-Service. Future Generation Computer Systems,
44--52. https://doi.org/10.1016/j.future.2014.03.005
bibtex: '@article{Künsemöller_Karl_2014, title={A Game-Theoretic Approach to the
Financial Benefits of Infrastructure-as-a-Service}, DOI={10.1016/j.future.2014.03.005},
journal={Future Generation Computer Systems}, publisher={Elsevier}, author={Künsemöller,
Jörn and Karl, Holger}, year={2014}, pages={44--52} }'
chicago: Künsemöller, Jörn, and Holger Karl. “A Game-Theoretic Approach to the Financial
Benefits of Infrastructure-as-a-Service.” Future Generation Computer Systems,
2014, 44--52. https://doi.org/10.1016/j.future.2014.03.005.
ieee: J. Künsemöller and H. Karl, “A Game-Theoretic Approach to the Financial Benefits
of Infrastructure-as-a-Service,” Future Generation Computer Systems, pp.
44--52, 2014.
mla: Künsemöller, Jörn, and Holger Karl. “A Game-Theoretic Approach to the Financial
Benefits of Infrastructure-as-a-Service.” Future Generation Computer Systems,
Elsevier, 2014, pp. 44--52, doi:10.1016/j.future.2014.03.005.
short: J. Künsemöller, H. Karl, Future Generation Computer Systems (2014) 44--52.
date_created: 2017-10-17T12:42:23Z
date_updated: 2022-01-06T07:01:17Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1016/j.future.2014.03.005
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:46:17Z
date_updated: 2018-11-02T15:46:17Z
file_id: '5312'
file_name: KünsemöllerKarl.pdf
file_size: 698992
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:46:17Z
has_accepted_license: '1'
language:
- iso: eng
page: 44--52
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publication: Future Generation Computer Systems
publisher: Elsevier
status: public
title: A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '479'
abstract:
- lang: eng
text: Identity-based cryptography has attracted attention in the cryptographic research
community in recent years. Despite the importance of cryptographic schemes for
applications in business and law, the legal implications of identity-based cryptography
have not yet been discussed. We investigate how identity-based signatures fit
into the legal framework. We focus on the European Signature Directive, but also
take the UNCITRAL Model Law on Electronic Signatures into account. In contrast
to previous assumptions, identity-based signature schemes can, in principle, be
used even for qualified electronic signatures, which can replace handwritten signatures
in the member states of the European Union. We derive requirements to be taken
into account in the development of future identity-based signature schemes.
author:
- first_name: Christoph
full_name: Sorge, Christoph
last_name: Sorge
citation:
ama: Sorge C. The Legal Classification of Identity-Based Signatures. Computer
Law & Security Review. 2014;30(2):126-136. doi:10.1016/j.clsr.2014.01.002
apa: Sorge, C. (2014). The Legal Classification of Identity-Based Signatures. Computer
Law & Security Review, 30(2), 126–136. https://doi.org/10.1016/j.clsr.2014.01.002
bibtex: '@article{Sorge_2014, title={The Legal Classification of Identity-Based
Signatures}, volume={30}, DOI={10.1016/j.clsr.2014.01.002},
number={2}, journal={Computer Law & Security Review}, publisher={Elsevier},
author={Sorge, Christoph}, year={2014}, pages={126–136} }'
chicago: 'Sorge, Christoph. “The Legal Classification of Identity-Based Signatures.”
Computer Law & Security Review 30, no. 2 (2014): 126–36. https://doi.org/10.1016/j.clsr.2014.01.002.'
ieee: C. Sorge, “The Legal Classification of Identity-Based Signatures,” Computer
Law & Security Review, vol. 30, no. 2, pp. 126–136, 2014.
mla: Sorge, Christoph. “The Legal Classification of Identity-Based Signatures.”
Computer Law & Security Review, vol. 30, no. 2, Elsevier, 2014, pp.
126–36, doi:10.1016/j.clsr.2014.01.002.
short: C. Sorge, Computer Law & Security Review 30 (2014) 126–136.
date_created: 2017-10-17T12:42:25Z
date_updated: 2022-01-06T07:01:22Z
ddc:
- '040'
doi: 10.1016/j.clsr.2014.01.002
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:03:20Z
date_updated: 2018-03-15T14:03:20Z
file_id: '1323'
file_name: 479-Sorge-Legal-Classification2013.pdf
file_size: 194634
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:03:20Z
has_accepted_license: '1'
intvolume: ' 30'
issue: '2'
page: 126-136
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Computer Law & Security Review
publisher: Elsevier
status: public
title: The Legal Classification of Identity-Based Signatures
type: journal_article
user_id: '477'
volume: 30
year: '2014'
...
---
_id: '762'
author:
- first_name: Arne
full_name: Schwabe, Arne
last_name: Schwabe
- first_name: Holger
full_name: Karl, Holger
last_name: Karl
citation:
ama: 'Schwabe A, Karl H. Using MAC addresses as efficient routing labels in data
centers. In: Proceedings of the Third Workshop on Hot Topics in Software Defined
Networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014. ; 2014:115--120.
doi:10.1145/2620728.2620730'
apa: Schwabe, A., & Karl, H. (2014). Using MAC addresses as efficient routing
labels in data centers. In Proceedings of the third workshop on Hot topics
in software defined networking, HotSDN ’14, Chicago, Illinois, USA, August 22,
2014 (pp. 115--120). https://doi.org/10.1145/2620728.2620730
bibtex: '@inproceedings{Schwabe_Karl_2014, title={Using MAC addresses as efficient
routing labels in data centers}, DOI={10.1145/2620728.2620730},
booktitle={Proceedings of the third workshop on Hot topics in software defined
networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014}, author={Schwabe,
Arne and Karl, Holger}, year={2014}, pages={115--120} }'
chicago: Schwabe, Arne, and Holger Karl. “Using MAC Addresses as Efficient Routing
Labels in Data Centers.” In Proceedings of the Third Workshop on Hot Topics
in Software Defined Networking, HotSDN ’14, Chicago, Illinois, USA, August 22,
2014, 115--120, 2014. https://doi.org/10.1145/2620728.2620730.
ieee: A. Schwabe and H. Karl, “Using MAC addresses as efficient routing labels in
data centers,” in Proceedings of the third workshop on Hot topics in software
defined networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014, 2014,
pp. 115--120.
mla: Schwabe, Arne, and Holger Karl. “Using MAC Addresses as Efficient Routing Labels
in Data Centers.” Proceedings of the Third Workshop on Hot Topics in Software
Defined Networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014, 2014,
pp. 115--120, doi:10.1145/2620728.2620730.
short: 'A. Schwabe, H. Karl, in: Proceedings of the Third Workshop on Hot Topics
in Software Defined Networking, HotSDN ’14, Chicago, Illinois, USA, August 22,
2014, 2014, pp. 115--120.'
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:41Z
ddc:
- '004'
department:
- _id: '75'
doi: 10.1145/2620728.2620730
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:32:48Z
date_updated: 2018-11-02T13:32:48Z
file_id: '5249'
file_name: p115-schwabe.pdf
file_size: 1349578
relation: main_file
file_date_updated: 2018-11-02T13:32:48Z
has_accepted_license: '1'
language:
- iso: eng
page: 115--120
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '6'
name: SFB 901 - Subproject A2
publication: Proceedings of the third workshop on Hot topics in software defined networking,
HotSDN '14, Chicago, Illinois, USA, August 22, 2014
status: public
title: Using MAC addresses as efficient routing labels in data centers
type: conference
user_id: '477'
year: '2014'
...
---
_id: '392'
author:
- first_name: NinaMadeleine
full_name: Brummel, NinaMadeleine
last_name: Brummel
citation:
ama: 'Brummel N. On the Relation between Innovation and Competion: The Case of
Energy Industry. Universität Paderborn; 2014.'
apa: 'Brummel, N. (2014). On the Relation between Innovation and Competion: The
Case of Energy Industry. Universität Paderborn.'
bibtex: '@book{Brummel_2014, title={On the Relation between Innovation and Competion:
The Case of Energy Industry}, publisher={Universität Paderborn}, author={Brummel,
NinaMadeleine}, year={2014} }'
chicago: 'Brummel, NinaMadeleine. On the Relation between Innovation and Competion:
The Case of Energy Industry. Universität Paderborn, 2014.'
ieee: 'N. Brummel, On the Relation between Innovation and Competion: The Case
of Energy Industry. Universität Paderborn, 2014.'
mla: 'Brummel, NinaMadeleine. On the Relation between Innovation and Competion:
The Case of Energy Industry. Universität Paderborn, 2014.'
short: 'N. Brummel, On the Relation between Innovation and Competion: The Case of
Energy Industry, Universität Paderborn, 2014.'
date_created: 2017-10-17T12:42:08Z
date_updated: 2022-01-06T06:59:54Z
department:
- _id: '280'
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: 'On the Relation between Innovation and Competion: The Case of Energy Industry'
type: mastersthesis
user_id: '42447'
year: '2014'
...