---
_id: '319'
abstract:
- lang: eng
text: Services are self-contained and platform independent software components that
aim at maximizing software reuse. The automated composition of services to a target
software artifact has been tackled with many AI techniques, but existing approaches
make unreasonably strong assumptions such as a predefined data flow, are limited
to tiny problem sizes, ignore non-functional properties, or assume offline service
repositories. This paper presents an algorithm that automatically composes services
without making such assumptions. We employ a backward search algorithm that starts
from an empty composition and prepends service calls to already discovered candidates
until a solution is found. Available services are determined during the search
process. We implemented our algorithm, performed an experimental evaluation, and
compared it to other approaches.
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
- first_name: Hans
full_name: Kleine Büning, Hans
last_name: Kleine Büning
citation:
ama: 'Mohr F, Jungmann A, Kleine Büning H. Automated Online Service Composition.
In: Proceedings of the 12th IEEE International Conference on Services Computing
(SCC). ; 2015:57--64. doi:10.1109/SCC.2015.18'
apa: Mohr, F., Jungmann, A., & Kleine Büning, H. (2015). Automated Online Service
Composition. In Proceedings of the 12th IEEE International Conference on Services
Computing (SCC) (pp. 57--64). https://doi.org/10.1109/SCC.2015.18
bibtex: '@inproceedings{Mohr_Jungmann_Kleine Büning_2015, title={Automated Online
Service Composition}, DOI={10.1109/SCC.2015.18},
booktitle={Proceedings of the 12th IEEE International Conference on Services Computing
(SCC)}, author={Mohr, Felix and Jungmann, Alexander and Kleine Büning, Hans},
year={2015}, pages={57--64} }'
chicago: Mohr, Felix, Alexander Jungmann, and Hans Kleine Büning. “Automated Online
Service Composition.” In Proceedings of the 12th IEEE International Conference
on Services Computing (SCC), 57--64, 2015. https://doi.org/10.1109/SCC.2015.18.
ieee: F. Mohr, A. Jungmann, and H. Kleine Büning, “Automated Online Service Composition,”
in Proceedings of the 12th IEEE International Conference on Services Computing
(SCC), 2015, pp. 57--64.
mla: Mohr, Felix, et al. “Automated Online Service Composition.” Proceedings
of the 12th IEEE International Conference on Services Computing (SCC), 2015,
pp. 57--64, doi:10.1109/SCC.2015.18.
short: 'F. Mohr, A. Jungmann, H. Kleine Büning, in: Proceedings of the 12th IEEE
International Conference on Services Computing (SCC), 2015, pp. 57--64.'
date_created: 2017-10-17T12:41:54Z
date_updated: 2022-01-06T06:59:04Z
ddc:
- '040'
department:
- _id: '355'
doi: 10.1109/SCC.2015.18
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:42:03Z
date_updated: 2018-03-20T07:42:03Z
file_id: '1434'
file_name: 319-07207336.pdf
file_size: 345742
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:42:03Z
has_accepted_license: '1'
language:
- iso: eng
page: 57--64
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 12th IEEE International Conference on Services Computing
(SCC)
status: public
title: Automated Online Service Composition
type: conference
user_id: '477'
year: '2015'
...
---
_id: '270'
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
citation:
ama: Abshoff S. On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks.
Universität Paderborn; 2015.
apa: Abshoff, S. (2015). On the Complexity of Fundamental Problems in Dynamic
Ad-hoc Networks. Universität Paderborn.
bibtex: '@book{Abshoff_2015, title={On the Complexity of Fundamental Problems in
Dynamic Ad-hoc Networks}, publisher={Universität Paderborn}, author={Abshoff,
Sebastian}, year={2015} }'
chicago: Abshoff, Sebastian. On the Complexity of Fundamental Problems in Dynamic
Ad-Hoc Networks. Universität Paderborn, 2015.
ieee: S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-hoc
Networks. Universität Paderborn, 2015.
mla: Abshoff, Sebastian. On the Complexity of Fundamental Problems in Dynamic
Ad-Hoc Networks. Universität Paderborn, 2015.
short: S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:32Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:30:02Z
date_updated: 2018-03-21T09:30:02Z
file_id: '1476'
file_name: 270-Dissertation_-_Abshoff.pdf
file_size: 448614
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:30:02Z
has_accepted_license: '1'
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
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks
type: dissertation
user_id: '477'
year: '2015'
...
---
_id: '271'
abstract:
- lang: eng
text: In \emph{bandwidth allocation games} (BAGs), the strategy of a player consists
of various demands on different resources. The player's utility is at most the
sum of these demands, provided they are fully satisfied. Every resource has a
limited capacity and if it is exceeded by the total demand, it has to be split
between the players. Since these games generally do not have pure Nash equilibria,
we consider approximate pure Nash equilibria, in which no player can improve her
utility by more than some fixed factor $\alpha$ through unilateral strategy changes.
There is a threshold $\alpha_\delta$ (where $\delta$ is a parameter that limits
the demand of each player on a specific resource) such that $\alpha$-approximate
pure Nash equilibria always exist for $\alpha \geq \alpha_\delta$, but not for
$\alpha < \alpha_\delta$. We give both upper and lower bounds on this threshold
$\alpha_\delta$ and show that the corresponding decision problem is ${\sf NP}$-hard.
We also show that the $\alpha$-approximate price of anarchy for BAGs is $\alpha+1$.
For a restricted version of the game, where demands of players only differ slightly
from each other (e.g. symmetric games), we show that approximate Nash equilibria
can be reached (and thus also be computed) in polynomial time using the best-response
dynamic. Finally, we show that a broader class of utility-maximization games (which
includes BAGs) converges quickly towards states whose social welfare is close
to the optimum.
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- 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, Feldotto M, Riechers S, Skopalik A. On Existence and Properties of
Approximate Pure Nash Equilibria in Bandwidth Allocation Games. In: Proceedings
of the 8th International Symposium on Algorithmic Game Theory (SAGT). Lecture
Notes in Computer Science. ; 2015:178-189. doi:10.1007/978-3-662-48433-3_14'
apa: Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2015). On Existence
and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.
In Proceedings of the 8th International Symposium on Algorithmic Game Theory
(SAGT) (pp. 178–189). https://doi.org/10.1007/978-3-662-48433-3_14
bibtex: '@inproceedings{Drees_Feldotto_Riechers_Skopalik_2015, series={Lecture Notes
in Computer Science}, title={On Existence and Properties of Approximate Pure Nash
Equilibria in Bandwidth Allocation Games}, DOI={10.1007/978-3-662-48433-3_14},
booktitle={Proceedings of the 8th International Symposium on Algorithmic Game
Theory (SAGT)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers,
Sören and Skopalik, Alexander}, year={2015}, pages={178–189}, collection={Lecture
Notes in Computer Science} }'
chicago: Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik.
“On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth
Allocation Games.” In Proceedings of the 8th International Symposium on Algorithmic
Game Theory (SAGT), 178–89. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-662-48433-3_14.
ieee: M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “On Existence and Properties
of Approximate Pure Nash Equilibria in Bandwidth Allocation Games,” in Proceedings
of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015,
pp. 178–189.
mla: Drees, Maximilian, et al. “On Existence and Properties of Approximate Pure
Nash Equilibria in Bandwidth Allocation Games.” Proceedings of the 8th International
Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–89, doi:10.1007/978-3-662-48433-3_14.
short: 'M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the
8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–189.'
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:34Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-662-48433-3_14
external_id:
arxiv:
- '1507.02908'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:29:34Z
date_updated: 2018-03-21T09:29:34Z
file_id: '1475'
file_name: 271-chp_3A10.1007_2F978-3-662-48433-3_14.pdf
file_size: 256718
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:29:34Z
has_accepted_license: '1'
page: 178-189
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 8th International Symposium on Algorithmic Game Theory
(SAGT)
series_title: Lecture Notes in Computer Science
status: public
title: On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth
Allocation Games
type: conference
user_id: '14052'
year: '2015'
...
---
_id: '27163'
author:
- first_name: ' Reinhard '
full_name: 'Keil, Reinhard '
last_name: Keil
- first_name: Harald
full_name: Selke, Harald
id: '497'
last_name: Selke
citation:
ama: 'Keil Reinhard , Selke H. Virtual knowledge {\ “a} ume - From the presentation
of content to virtual learning {\” a} tten. In: Keil R, Selke Harald, eds. Vol
330. publishing series of the Heinz Nixdorf Institute, Paderborn; 2015:39-53.'
apa: Keil, Reinhard , & Selke, H. (2015). Virtual knowledge {\ “a} ume -
From the presentation of content to virtual learning {\” a} tten (R. Keil
& Harald Selke, Eds.; Vol. 330, pp. 39–53). publishing series of the Heinz
Nixdorf Institute, Paderborn.
bibtex: '@inproceedings{Keil_Selke_2015, title={Virtual knowledge {\ “a} ume - From
the presentation of content to virtual learning {\” a} tten}, volume={330}, publisher={publishing
series of the Heinz Nixdorf Institute, Paderborn}, author={Keil, Reinhard and
Selke, Harald}, editor={Keil, Reinhard and Selke, Harald}, year={2015}, pages={39–53}
}'
chicago: Keil, Reinhard , and Harald Selke. “Virtual Knowledge {\ ‘A} Ume - From
the Presentation of Content to Virtual Learning {\’ A} Tten.” edited by Reinhard Keil
and Harald Selke, 330:39–53. publishing series of the Heinz Nixdorf Institute,
Paderborn, 2015.
ieee: Reinhard Keil and H. Selke, “Virtual knowledge {\ ‘a} ume - From the presentation
of content to virtual learning {\’ a} tten,” 2015, vol. 330, pp. 39–53.
mla: Keil, Reinhard , and Harald Selke. Virtual Knowledge {\ “A} Ume - From
the Presentation of Content to Virtual Learning {\” A} Tten. Edited by Reinhard Keil
and Harald Selke, vol. 330, publishing series of the Heinz Nixdorf Institute,
Paderborn, 2015, pp. 39–53.
short: 'Reinhard Keil, H. Selke, in: R. Keil, Harald Selke (Eds.), publishing
series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 39–53.'
date_created: 2021-11-05T22:48:51Z
date_updated: 2022-01-06T06:57:35Z
department:
- _id: '71'
editor:
- first_name: 'Reinhard '
full_name: 'Keil, Reinhard '
last_name: Keil
- first_name: ' Harald'
full_name: Selke, Harald
last_name: Selke
intvolume: ' 330'
language:
- iso: eng
page: 39-53
publication_status: published
publisher: publishing series of the Heinz Nixdorf Institute, Paderborn
status: public
title: Virtual knowledge {\ "a} ume - From the presentation of content to virtual
learning {\" a} tten
type: conference
user_id: '71124'
volume: 330
year: '2015'
...
---
_id: '27164'
author:
- first_name: Florian
full_name: Klompmaker, Florian
last_name: Klompmaker
citation:
ama: Klompmaker F. Development of a Structured Process of Interaction Design
for {\ “U} r Nat {\” U} Local User Interfaces. Universitaetsbibliothek Paderborn;
2015.
apa: Klompmaker, F. (2015). Development of a structured process of interaction
design for {\ “u} r nat {\” u} local user interfaces. Universitaetsbibliothek
Paderborn.
bibtex: '@book{Klompmaker_2015, place={Universit {\ "a} t Paderborn, Heinz Nixdorf
Institute, Contextual Computer Science}, title={Development of a structured process
of interaction design for {\ “u} r nat {\” u} local user interfaces}, publisher={Universitaetsbibliothek
Paderborn}, author={Klompmaker, Florian}, year={2015} }'
chicago: 'Klompmaker, Florian. Development of a Structured Process of Interaction
Design for {\ “U} r Nat {\” U} Local User Interfaces. Universit {\ "a} t Paderborn,
Heinz Nixdorf Institute, Contextual Computer Science: Universitaetsbibliothek
Paderborn, 2015.'
ieee: 'F. Klompmaker, Development of a structured process of interaction design
for {\ “u} r nat {\” u} local user interfaces. Universit {\ "a} t Paderborn,
Heinz Nixdorf Institute, Contextual Computer Science: Universitaetsbibliothek
Paderborn, 2015.'
mla: Klompmaker, Florian. Development of a Structured Process of Interaction
Design for {\ “U} r Nat {\” U} Local User Interfaces. Universitaetsbibliothek
Paderborn, 2015.
short: F. Klompmaker, Development of a Structured Process of Interaction Design
for {\ “U} r Nat {\” U} Local User Interfaces, Universitaetsbibliothek Paderborn,
Universit {\ "a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science,
2015.
date_created: 2021-11-05T22:52:55Z
date_updated: 2022-01-06T06:57:35Z
department:
- _id: '71'
language:
- iso: eng
place: Universit {\ "a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer
Science
publisher: Universitaetsbibliothek Paderborn
status: public
title: Development of a structured process of interaction design for {\ "u} r nat
{\" u} local user interfaces
type: dissertation
user_id: '71124'
year: '2015'
...
---
_id: '27165'
abstract:
- lang: eng
text: Patterns serve to codify design knowledge. By embedding them in a hypothesis-driven
design, it is possible to develop them further into sample languages. For this
it is necessary to resolve the underlying conflicts in the form of design hypotheses
and to validate them empirically in order to enable further use and generalization.
In this article, an experiment is presented that describes this procedure and
demonstrates the interplay between theory formation and codification of design
knowledge using two examples.
author:
- first_name: ' Christian'
full_name: Schild, Christian
last_name: Schild
- first_name: Vanessa
full_name: ' Petrausch, Vanessa'
last_name: ' Petrausch'
citation:
ama: 'Schild Christian, Petrausch V. Empirical validation of design patterns .
In: De Gruyter Oldenbourg; 2015:173-182.'
apa: Schild, Christian, & Petrausch, V. (2015). Empirical validation of
design patterns . 173–182.
bibtex: '@inproceedings{Schild_ Petrausch_2015, place={Berlin}, title={Empirical
validation of design patterns }, publisher={De Gruyter Oldenbourg}, author={Schild, Christian
and Petrausch, Vanessa}, year={2015}, pages={173–182} }'
chicago: 'Schild, Christian, and Vanessa Petrausch. “Empirical Validation of Design
Patterns ,” 173–82. Berlin: De Gruyter Oldenbourg, 2015.'
ieee: Christian Schild and V. Petrausch, “Empirical validation of design patterns
,” 2015, pp. 173–182.
mla: Schild, Christian, and Vanessa Petrausch. Empirical Validation of Design
Patterns . De Gruyter Oldenbourg, 2015, pp. 173–82.
short: 'Christian Schild, V. Petrausch, in: De Gruyter Oldenbourg, Berlin, 2015,
pp. 173–182.'
date_created: 2021-11-05T22:57:59Z
date_updated: 2022-01-06T06:57:35Z
department:
- _id: '71'
language:
- iso: eng
page: 173-182
place: Berlin
publication_status: published
publisher: De Gruyter Oldenbourg
status: public
title: 'Empirical validation of design patterns '
type: conference
user_id: '71124'
year: '2015'
...
---
_id: '273'
author:
- first_name: Kathlén
full_name: Kohn, Kathlén
last_name: Kohn
citation:
ama: Kohn K. Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary
Norms. Universität Paderborn; 2015.
apa: Kohn, K. (2015). Number of Voronoi-relevant vectors in lattices with respect
to arbitrary norms. Universität Paderborn.
bibtex: '@book{Kohn_2015, title={Number of Voronoi-relevant vectors in lattices
with respect to arbitrary norms}, publisher={Universität Paderborn}, author={Kohn,
Kathlén}, year={2015} }'
chicago: Kohn, Kathlén. Number of Voronoi-Relevant Vectors in Lattices with Respect
to Arbitrary Norms. Universität Paderborn, 2015.
ieee: K. Kohn, Number of Voronoi-relevant vectors in lattices with respect to
arbitrary norms. Universität Paderborn, 2015.
mla: Kohn, Kathlén. Number of Voronoi-Relevant Vectors in Lattices with Respect
to Arbitrary Norms. Universität Paderborn, 2015.
short: K. Kohn, Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary
Norms, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:37Z
department:
- _id: '64'
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
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '274'
abstract:
- lang: eng
text: Consider the problem in which n jobs that are classified into k types are
to be scheduled on m identical machines without preemption. A machine requires
a proper setup taking s time units before processing jobs of a given type. The
objective is to minimize the makespan of the resulting schedule. We design and
analyze an approximation algorithm that runs in time polynomial in n,m and k and
computes a solution with an approximation factor that can be made arbitrarily
close to 3/2.
author:
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: 'Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-preemptive Scheduling
on Machines with Setup Times. In: Dehne F, Sack JR, Stege U, eds. Algorithms
and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada,
August 5-7, 2015. Proceedings. Lecture Notes in Computer Science. ; 2015:542--553.
doi:10.1007/978-3-319-21840-3_45'
apa: 'Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2015).
Non-preemptive Scheduling on Machines with Setup Times. In F. Dehne, J. R. Sack,
& U. Stege (Eds.), Algorithms and Data Structures: 14th International Symposium,
WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings (pp. 542--553).
https://doi.org/10.1007/978-3-319-21840-3_45'
bibtex: '@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2015, series={Lecture
Notes in Computer Science}, title={Non-preemptive Scheduling on Machines with
Setup Times}, DOI={10.1007/978-3-319-21840-3_45},
booktitle={Algorithms and Data Structures: 14th International Symposium, WADS
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings}, author={Mäcker, Alexander
and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören},
editor={Dehne, Frank and Sack, Jörg Rüdiger and Stege, UlrikeEditors}, year={2015},
pages={542--553}, collection={Lecture Notes in Computer Science} }'
chicago: 'Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
Sören Riechers. “Non-Preemptive Scheduling on Machines with Setup Times.” In Algorithms
and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada,
August 5-7, 2015. Proceedings, edited by Frank Dehne, Jörg Rüdiger Sack, and
Ulrike Stege, 542--553. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-21840-3_45.'
ieee: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-preemptive
Scheduling on Machines with Setup Times,” in Algorithms and Data Structures:
14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015.
Proceedings, 2015, pp. 542--553.'
mla: 'Mäcker, Alexander, et al. “Non-Preemptive Scheduling on Machines with Setup
Times.” Algorithms and Data Structures: 14th International Symposium, WADS
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, edited by Frank
Dehne et al., 2015, pp. 542--553, doi:10.1007/978-3-319-21840-3_45.'
short: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: F. Dehne,
J.R. Sack, U. Stege (Eds.), Algorithms and Data Structures: 14th International
Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, 2015,
pp. 542--553.'
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:39Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-21840-3_45
editor:
- first_name: Frank
full_name: Dehne, Frank
last_name: Dehne
- first_name: Jörg Rüdiger
full_name: Sack, Jörg Rüdiger
last_name: Sack
- first_name: Ulrike
full_name: Stege, Ulrike
last_name: Stege
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:28:34Z
date_updated: 2018-03-21T09:28:34Z
file_id: '1473'
file_name: 274-chp_3A10.1007_2F978-3-319-21840-3_45.pdf
file_size: 215498
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:28:34Z
has_accepted_license: '1'
page: 542--553
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: 'Algorithms and Data Structures: 14th International Symposium, WADS 2015,
Victoria, BC, Canada, August 5-7, 2015. Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: Non-preemptive Scheduling on Machines with Setup Times
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '275'
abstract:
- lang: eng
text: 'We investigate a non-cooperative game-theoretic model for the formation of
communication networks by selfish agents. Each agent aims for a central position
at minimum cost for creating edges. In particular, the general model (Fabrikant
et al., PODC''03) became popular for studying the structure of the Internet or
social networks. Despite its significance, locality in this game was first studied
only recently (Bilò et al., SPAA''14), where a worst case locality model was presented,
which came with a high efficiency loss in terms of quality of equilibria. Our
main contribution is a new and more optimistic view on locality: agents are limited
in their knowledge and actions to their local view ranges, but can probe different
strategies and finally choose the best. We study the influence of our locality
notion on the hardness of computing best responses, convergence to equilibria,
and quality of equilibria. Moreover, we compare the strength of local versus non-local
strategy changes. Our results address the gap between the original model and the
worst case locality variant. On the bright side, our efficiency results are in
line with observations from the original model, yet we have a non-constant lower
bound on the Price of Anarchy.'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Pascal
full_name: Lenzner, Pascal
last_name: Lenzner
citation:
ama: 'Cord-Landwehr A, Lenzner P. Network Creation Games: Think Global - Act Local.
In: Proceedings of the 40th Conference on Mathematical Foundations of Computer
Science (MFCS). LNCS. ; 2015:248--260. doi:10.1007/978-3-662-48054-0_21'
apa: 'Cord-Landwehr, A., & Lenzner, P. (2015). Network Creation Games: Think
Global - Act Local. In Proceedings of the 40th Conference on Mathematical Foundations
of Computer Science (MFCS) (pp. 248--260). https://doi.org/10.1007/978-3-662-48054-0_21'
bibtex: '@inproceedings{Cord-Landwehr_Lenzner_2015, series={LNCS}, title={Network
Creation Games: Think Global - Act Local}, DOI={10.1007/978-3-662-48054-0_21},
booktitle={Proceedings of the 40th Conference on Mathematical Foundations of Computer
Science (MFCS)}, author={Cord-Landwehr, Andreas and Lenzner, Pascal}, year={2015},
pages={248--260}, collection={LNCS} }'
chicago: 'Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think
Global - Act Local.” In Proceedings of the 40th Conference on Mathematical
Foundations of Computer Science (MFCS), 248--260. LNCS, 2015. https://doi.org/10.1007/978-3-662-48054-0_21.'
ieee: 'A. Cord-Landwehr and P. Lenzner, “Network Creation Games: Think Global -
Act Local,” in Proceedings of the 40th Conference on Mathematical Foundations
of Computer Science (MFCS), 2015, pp. 248--260.'
mla: 'Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think
Global - Act Local.” Proceedings of the 40th Conference on Mathematical Foundations
of Computer Science (MFCS), 2015, pp. 248--260, doi:10.1007/978-3-662-48054-0_21.'
short: 'A. Cord-Landwehr, P. Lenzner, in: Proceedings of the 40th Conference on
Mathematical Foundations of Computer Science (MFCS), 2015, pp. 248--260.'
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:40Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-662-48054-0_21
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:27:12Z
date_updated: 2018-03-21T09:27:12Z
file_id: '1472'
file_name: 275-978-3-662-48054-0_21.pdf
file_size: 279995
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:27:12Z
has_accepted_license: '1'
language:
- iso: eng
page: 248--260
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 40th Conference on Mathematical Foundations of Computer
Science (MFCS)
series_title: LNCS
status: public
title: 'Network Creation Games: Think Global - Act Local'
type: conference
user_id: '477'
year: '2015'
...
---
_id: '277'
author:
- first_name: Nils
full_name: Kothe, Nils
last_name: Kothe
citation:
ama: Kothe N. Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk.
Universität Paderborn; 2015.
apa: Kothe, N. (2015). Multilevel Netzwerk Spiele mit konstanten Entfernungen
im Highspeed-Netzwerk. Universität Paderborn.
bibtex: '@book{Kothe_2015, title={Multilevel Netzwerk Spiele mit konstanten Entfernungen
im Highspeed-Netzwerk}, publisher={Universität Paderborn}, author={Kothe, Nils},
year={2015} }'
chicago: Kothe, Nils. Multilevel Netzwerk Spiele mit konstanten Entfernungen
im Highspeed-Netzwerk. Universität Paderborn, 2015.
ieee: N. Kothe, Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk.
Universität Paderborn, 2015.
mla: Kothe, Nils. Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk.
Universität Paderborn, 2015.
short: N. Kothe, Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:46Z
date_updated: 2022-01-06T06:57:44Z
department:
- _id: '63'
- _id: '541'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk
type: bachelorsthesis
user_id: '14052'
year: '2015'
...
---
_id: '278'
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
citation:
ama: Feldmann M. Monotonic Searchability for Distributed Sorted Lists and De
Bruijn Graphs. Universität Paderborn; 2015.
apa: Feldmann, M. (2015). Monotonic Searchability for distributed sorted Lists
and De Bruijn Graphs. Universität Paderborn.
bibtex: '@book{Feldmann_2015, title={Monotonic Searchability for distributed sorted
Lists and De Bruijn Graphs}, publisher={Universität Paderborn}, author={Feldmann,
Michael}, year={2015} }'
chicago: Feldmann, Michael. Monotonic Searchability for Distributed Sorted Lists
and De Bruijn Graphs. Universität Paderborn, 2015.
ieee: M. Feldmann, Monotonic Searchability for distributed sorted Lists and De
Bruijn Graphs. Universität Paderborn, 2015.
mla: Feldmann, Michael. Monotonic Searchability for Distributed Sorted Lists
and De Bruijn Graphs. Universität Paderborn, 2015.
short: M. Feldmann, Monotonic Searchability for Distributed Sorted Lists and De
Bruijn Graphs, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:46Z
date_updated: 2022-01-06T06:57:45Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '279'
abstract:
- lang: eng
text: Service discovery in global software markets is performed by brokers who act
as intermediaries between service consumers and service providers.In order to
discover services, brokers apply service matching for determining whether the
specification of a provided service satisfies the consumer's requirements.Brokers
can already choose between a lot of different service matching approaches considering
different service properties (structural, behavioral, and non-functional properties).Different
matching approaches can be combined into configurable matching processes leading
to a high matching quality (e.g., accurate matching results). However, this combination
and configuration is a manual procedure and has to be repeated for different consumers'
or market requirements regarding matching quality. In this paper, we propose our
framework MatchBox, which supports a broker in reusing existing matching approaches
and combining them in a model-driven way based on a reconfigurable model of the
matching process.Using this reconfigurable model, MatchBox takes care of control
and data flow between matching approaches and executes the modeled processes automatically.As
a case study, we integrated eleven matchers into MatchBox to demonstrate that
it remains flexibility and reduces effort for a broker at the same time.
author:
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Svetlana
full_name: Arifulina, Svetlana
last_name: Arifulina
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
citation:
ama: 'Platenius MC, Arifulina S, Schäfer W. MatchBox: A Framework for Dynamic Configuration
of Service Matching Processes. In: Proceedings of the 18th International ACM
Sigsoft Symposium on Component-Based Software Engineering (CBSE’15). ; 2015:75-84.
doi:10.1145/2737166.2737174'
apa: 'Platenius, M. C., Arifulina, S., & Schäfer, W. (2015). MatchBox: A Framework
for Dynamic Configuration of Service Matching Processes. In Proceedings of
the 18th International ACM Sigsoft Symposium on Component-Based Software Engineering
(CBSE’15) (pp. 75–84). https://doi.org/10.1145/2737166.2737174'
bibtex: '@inproceedings{Platenius_Arifulina_Schäfer_2015, title={MatchBox: A Framework
for Dynamic Configuration of Service Matching Processes}, DOI={10.1145/2737166.2737174},
booktitle={Proceedings of the 18th International ACM Sigsoft Symposium on Component-Based
Software Engineering (CBSE’15)}, author={Platenius, Marie Christin and Arifulina,
Svetlana and Schäfer, Wilhelm}, year={2015}, pages={75–84} }'
chicago: 'Platenius, Marie Christin, Svetlana Arifulina, and Wilhelm Schäfer. “MatchBox:
A Framework for Dynamic Configuration of Service Matching Processes.” In Proceedings
of the 18th International ACM Sigsoft Symposium on Component-Based Software Engineering
(CBSE’15), 75–84, 2015. https://doi.org/10.1145/2737166.2737174.'
ieee: 'M. C. Platenius, S. Arifulina, and W. Schäfer, “MatchBox: A Framework for
Dynamic Configuration of Service Matching Processes,” in Proceedings of the
18th International ACM Sigsoft Symposium on Component-Based Software Engineering
(CBSE’15), 2015, pp. 75–84.'
mla: 'Platenius, Marie Christin, et al. “MatchBox: A Framework for Dynamic Configuration
of Service Matching Processes.” Proceedings of the 18th International ACM Sigsoft
Symposium on Component-Based Software Engineering (CBSE’15), 2015, pp. 75–84,
doi:10.1145/2737166.2737174.'
short: 'M.C. Platenius, S. Arifulina, W. Schäfer, in: Proceedings of the 18th International
ACM Sigsoft Symposium on Component-Based Software Engineering (CBSE’15), 2015,
pp. 75–84.'
date_created: 2017-10-17T12:41:46Z
date_updated: 2022-01-06T06:57:48Z
ddc:
- '040'
department:
- _id: '76'
- _id: '66'
doi: 10.1145/2737166.2737174
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:26:40Z
date_updated: 2018-03-21T09:26:40Z
file_id: '1471'
file_name: 279-p75-platenius.pdf
file_size: 2090964
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:26:40Z
has_accepted_license: '1'
language:
- iso: eng
page: 75-84
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publication: Proceedings of the 18th International ACM Sigsoft Symposium on Component-Based
Software Engineering (CBSE'15)
status: public
title: 'MatchBox: A Framework for Dynamic Configuration of Service Matching Processes'
type: conference
user_id: '477'
year: '2015'
...
---
_id: '20977'
author:
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
- first_name: Stefan
full_name: Dziwok, Stefan
id: '3901'
last_name: Dziwok
orcid: http://orcid.org/0000-0002-8679-6673
- first_name: Uwe
full_name: Pohlmann, Uwe
last_name: Pohlmann
- first_name: Jan
full_name: Bobolz, Jan
last_name: Bobolz
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
- first_name: Andreas Peter
full_name: Dann, Andreas Peter
last_name: Dann
- first_name: Johannes
full_name: Geismann, Johannes
last_name: Geismann
- first_name: Marcus
full_name: Hüwe, Marcus
id: '13606'
last_name: Hüwe
- first_name: Arthur
full_name: Krieger, Arthur
last_name: Krieger
- first_name: Goran
full_name: Piskachev, Goran
last_name: Piskachev
- first_name: David
full_name: Schubert, David
id: '9106'
last_name: Schubert
- first_name: Rebekka
full_name: Wohlrab, Rebekka
last_name: Wohlrab
citation:
ama: Schäfer W, Dziwok S, Pohlmann U, et al. Seminar Theses of the Project Group
Cybertron.; 2015.
apa: Schäfer, W., Dziwok, S., Pohlmann, U., Bobolz, J., Czech, M., Dann, A. P.,
Geismann, J., Hüwe, M., Krieger, A., Piskachev, G., Schubert, D., & Wohlrab,
R. (2015). Seminar Theses of the Project Group Cybertron.
bibtex: '@book{Schäfer_Dziwok_Pohlmann_Bobolz_Czech_Dann_Geismann_Hüwe_Krieger_Piskachev_et
al._2015, title={Seminar Theses of the Project Group Cybertron}, author={Schäfer,
Wilhelm and Dziwok, Stefan and Pohlmann, Uwe and Bobolz, Jan and Czech, Mike and
Dann, Andreas Peter and Geismann, Johannes and Hüwe, Marcus and Krieger, Arthur
and Piskachev, Goran and et al.}, year={2015} }'
chicago: Schäfer, Wilhelm, Stefan Dziwok, Uwe Pohlmann, Jan Bobolz, Mike Czech,
Andreas Peter Dann, Johannes Geismann, et al. Seminar Theses of the Project
Group Cybertron, 2015.
ieee: W. Schäfer et al., Seminar Theses of the Project Group Cybertron.
2015.
mla: Schäfer, Wilhelm, et al. Seminar Theses of the Project Group Cybertron.
2015.
short: W. Schäfer, S. Dziwok, U. Pohlmann, J. Bobolz, M. Czech, A.P. Dann, J. Geismann,
M. Hüwe, A. Krieger, G. Piskachev, D. Schubert, R. Wohlrab, Seminar Theses of
the Project Group Cybertron, 2015.
date_created: 2021-01-13T13:21:34Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '76'
language:
- iso: eng
status: public
title: Seminar Theses of the Project Group Cybertron
type: report
user_id: '5786'
year: '2015'
...
---
_id: '20979'
author:
- first_name: Lars
full_name: Stockmann, Lars
id: '48144'
last_name: Stockmann
citation:
ama: 'Stockmann L. Debugging Models in the Context of Automotive Software Development.
In: Chechik M, Kolovos D, eds. Proceedings of the Doctoral Symposium of the
ACM/IEEE 18th International Conference on Model Driven Engineering Languages and
Systems. ; 2015.'
apa: Stockmann, L. (2015). Debugging Models in the Context of Automotive Software
Development. In M. Chechik & D. Kolovos (Eds.), Proceedings of the Doctoral
Symposium of the ACM/IEEE 18th International Conference on Model Driven Engineering
Languages and Systems.
bibtex: '@inproceedings{Stockmann_2015, title={Debugging Models in the Context of
Automotive Software Development}, booktitle={Proceedings of the Doctoral Symposium
of the ACM/IEEE 18th International Conference on Model Driven Engineering Languages
and Systems}, author={Stockmann, Lars}, editor={Chechik, Marsha and Kolovos, Dimitris},
year={2015} }'
chicago: Stockmann, Lars. “Debugging Models in the Context of Automotive Software
Development.” In Proceedings of the Doctoral Symposium of the ACM/IEEE 18th
International Conference on Model Driven Engineering Languages and Systems,
edited by Marsha Chechik and Dimitris Kolovos, 2015.
ieee: L. Stockmann, “Debugging Models in the Context of Automotive Software Development,”
in Proceedings of the Doctoral Symposium of the ACM/IEEE 18th International
Conference on Model Driven Engineering Languages and Systems, 2015.
mla: Stockmann, Lars. “Debugging Models in the Context of Automotive Software Development.”
Proceedings of the Doctoral Symposium of the ACM/IEEE 18th International Conference
on Model Driven Engineering Languages and Systems, edited by Marsha Chechik
and Dimitris Kolovos, 2015.
short: 'L. Stockmann, in: M. Chechik, D. Kolovos (Eds.), Proceedings of the Doctoral
Symposium of the ACM/IEEE 18th International Conference on Model Driven Engineering
Languages and Systems, 2015.'
date_created: 2021-01-13T13:27:27Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '76'
editor:
- first_name: Marsha
full_name: Chechik, Marsha
last_name: Chechik
- first_name: Dimitris
full_name: Kolovos, Dimitris
last_name: Kolovos
language:
- iso: eng
publication: Proceedings of the Doctoral Symposium of the ACM/IEEE 18th International
Conference on Model Driven Engineering Languages and Systems
status: public
title: Debugging Models in the Context of Automotive Software Development
type: conference
user_id: '5786'
year: '2015'
...
---
_id: '17425'
author:
- first_name: 'Jan '
full_name: 'Berssenbrügge, Jan '
last_name: Berssenbrügge
- first_name: Olga
full_name: Wiederkehr, Olga
last_name: Wiederkehr
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
citation:
ama: 'Berssenbrügge J, Wiederkehr O, Jähn C, Fischer M. Anbindung des Virtuellen
Prototypen an die Partialmodelle intelligenter technischer Systeme. In: 12.
Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung.
Vol 343. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015:65-78.'
apa: Berssenbrügge, J., Wiederkehr, O., Jähn, C., & Fischer, M. (2015). Anbindung
des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme.
12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung,
343, 65–78.
bibtex: '@inproceedings{Berssenbrügge_Wiederkehr_Jähn_Fischer_2015, place={Paderborn},
title={Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter
technischer Systeme}, volume={343}, booktitle={12. Paderborner Workshop Augmented
& Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts}, author={Berssenbrügge, Jan and Wiederkehr, Olga
and Jähn, Claudius and Fischer, Matthias}, year={2015}, pages={65–78} }'
chicago: 'Berssenbrügge, Jan , Olga Wiederkehr, Claudius Jähn, and Matthias Fischer.
“Anbindung Des Virtuellen Prototypen an Die Partialmodelle Intelligenter Technischer
Systeme.” In 12. Paderborner Workshop Augmented & Virtual Reality in Der
Produktentstehung, 343:65–78. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf
Instituts, 2015.'
ieee: J. Berssenbrügge, O. Wiederkehr, C. Jähn, and M. Fischer, “Anbindung des Virtuellen
Prototypen an die Partialmodelle intelligenter technischer Systeme,” in 12.
Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung,
2015, vol. 343, pp. 65–78.
mla: Berssenbrügge, Jan, et al. “Anbindung Des Virtuellen Prototypen an Die Partialmodelle
Intelligenter Technischer Systeme.” 12. Paderborner Workshop Augmented &
Virtual Reality in Der Produktentstehung, vol. 343, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, 2015, pp. 65–78.
short: 'J. Berssenbrügge, O. Wiederkehr, C. Jähn, M. Fischer, in: 12. Paderborner
Workshop Augmented & Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2015, pp. 65–78.'
date_created: 2020-07-28T09:49:42Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 343'
language:
- iso: eng
page: 65-78
place: Paderborn
publication: 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer
Systeme
type: conference
user_id: '15415'
volume: 343
year: '2015'
...
---
_id: '17427'
author:
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Maria
full_name: Gerges, Maria
last_name: Gerges
- first_name: Jan
full_name: Berssenbrügge, Jan
last_name: Berssenbrügge
citation:
ama: 'Jähn C, Fischer M, Gerges M, Berssenbrügge J. Automatische Ableitung geometrischer
Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell. In: 12. Paderborner
Workshop Augmented & Virtual Reality in Der Produktentstehung. Vol 342.
Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015:107-120.'
apa: Jähn, C., Fischer, M., Gerges, M., & Berssenbrügge, J. (2015). Automatische
Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell.
12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung,
342, 107–120.
bibtex: '@inproceedings{Jähn_Fischer_Gerges_Berssenbrügge_2015, place={Paderborn},
title={Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem
3-D-Polygonmodell}, volume={342}, booktitle={12. Paderborner Workshop Augmented
& Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts}, author={Jähn, Claudius and Fischer, Matthias and
Gerges, Maria and Berssenbrügge, Jan}, year={2015}, pages={107–120} }'
chicago: 'Jähn, Claudius, Matthias Fischer, Maria Gerges, and Jan Berssenbrügge.
“Automatische Ableitung Geometrischer Eigenschaften von Bauteilen Aus Dem 3-D-Polygonmodell.”
In 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung,
342:107–20. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015.'
ieee: C. Jähn, M. Fischer, M. Gerges, and J. Berssenbrügge, “Automatische Ableitung
geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell,” in 12.
Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung,
2015, vol. 342, pp. 107–120.
mla: Jähn, Claudius, et al. “Automatische Ableitung Geometrischer Eigenschaften
von Bauteilen Aus Dem 3-D-Polygonmodell.” 12. Paderborner Workshop Augmented
& Virtual Reality in Der Produktentstehung, vol. 342, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, 2015, pp. 107–20.
short: 'C. Jähn, M. Fischer, M. Gerges, J. Berssenbrügge, in: 12. Paderborner Workshop
Augmented & Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2015, pp. 107–120.'
date_created: 2020-07-28T10:23:18Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 342'
language:
- iso: eng
page: 107-120
place: Paderborn
publication: 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell
type: conference
user_id: '15415'
volume: 342
year: '2015'
...
---
_id: '17431'
citation:
ama: 'Gausemeier J, Grafe M, Meyer auf der Heide F, eds. Augmented & Virtual
Reality in Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions-
Und Visualisierungstechniken, Virtual Prototyping Intelligenter Technischer Systeme
Mit AR/VR. Vol 342. 12. Paderborner Workshop Augmented & Virtual Reality
in der Produktentstehung. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015.'
apa: 'Gausemeier, J., Grafe, M., & Meyer auf der Heide, F. (Eds.). (2015). Augmented
& Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge;
Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter
technischer Systeme mit AR/VR (12. Paderborner Workshop Augmented & Virtual
Reality in der Produktentstehung, Vol. 342). Verlagsschriftenreihe des Heinz Nixdorf
Instituts.'
bibtex: '@book{Gausemeier_Grafe_Meyer auf der Heide_2015, place={Paderborn}, edition={12.
Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung},
title={Augmented & Virtual Reality in der Produktentstehung: Grundlagen, Methoden
und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping
intelligenter technischer Systeme mit AR/VR}, volume={342}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts}, year={2015} }'
chicago: 'Gausemeier, Jürgen, Michael Grafe, and Friedhelm Meyer auf der Heide,
eds. Augmented & Virtual Reality in Der Produktentstehung: Grundlagen,
Methoden Und Werkzeuge; Interaktions- Und Visualisierungstechniken, Virtual Prototyping
Intelligenter Technischer Systeme Mit AR/VR. 12. Paderborner Workshop Augmented
& Virtual Reality in der Produktentstehung. Vol. 342. Paderborn: Verlagsschriftenreihe
des Heinz Nixdorf Instituts, 2015.'
ieee: 'J. Gausemeier, M. Grafe, and F. Meyer auf der Heide, Eds., Augmented &
Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge;
Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter
technischer Systeme mit AR/VR, 12. Paderborner Workshop Augmented & Virtual
Reality in der Produktentstehung., vol. 342. Paderborn: Verlagsschriftenreihe
des Heinz Nixdorf Instituts, 2015.'
mla: 'Gausemeier, Jürgen, et al., editors. Augmented & Virtual Reality in
Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions- Und Visualisierungstechniken,
Virtual Prototyping Intelligenter Technischer Systeme Mit AR/VR. 12. Paderborner
Workshop Augmented & Virtual Reality in der Produktentstehung, vol. 342, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, 2015.'
short: 'J. Gausemeier, M. Grafe, F. Meyer auf der Heide, eds., Augmented & Virtual
Reality in Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions-
Und Visualisierungstechniken, Virtual Prototyping Intelligenter Technischer Systeme
Mit AR/VR, 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung,
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015.'
date_created: 2020-07-28T13:39:25Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
- _id: '26'
edition: 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
editor:
- first_name: Jürgen
full_name: Gausemeier, Jürgen
last_name: Gausemeier
- first_name: Michael
full_name: Grafe, Michael
last_name: Grafe
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
intvolume: ' 342'
language:
- iso: eng
place: Paderborn
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: 'Augmented & Virtual Reality in der Produktentstehung: Grundlagen, Methoden
und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter
technischer Systeme mit AR/VR'
type: book_editor
user_id: '15415'
volume: 342
year: '2015'
...
---
_id: '17657'
abstract:
- lang: eng
text: Inter-datacenter transfers of non-interactive but timely large flows over
a private (managed) network is an important problem faced by many cloud service
providers. The considered flows are non-interactive because they do not explicitly
target the end users. However, most of them must be performed on a timely basis
and are associated with a deadline. We propose to schedule these flows by a centralized
controller, which determines when to transmit each flow and which path to use.
Two scheduling models are presented in this paper. In the first, the controller
also determines the rate of each flow, while in the second bandwidth is assigned
by the network according to the TCP rules. We develop scheduling algorithms for
both models and compare their complexity and performance.
author:
- first_name: R.
full_name: Cohen, R.
last_name: Cohen
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
citation:
ama: Cohen R, Polevoy G. Inter-Datacenter Scheduling of Large Data Flows. Cloud
Computing, IEEE Transactions on. 2015;PP(99):1-1. doi:10.1109/TCC.2015.2487964
apa: Cohen, R., & Polevoy, G. (2015). Inter-Datacenter Scheduling of Large Data
Flows. Cloud Computing, IEEE Transactions On, PP(99), 1–1. https://doi.org/10.1109/TCC.2015.2487964
bibtex: '@article{Cohen_Polevoy_2015, title={Inter-Datacenter Scheduling of Large
Data Flows}, volume={PP}, DOI={10.1109/TCC.2015.2487964},
number={99}, journal={Cloud Computing, IEEE Transactions on}, author={Cohen, R.
and Polevoy, Gleb}, year={2015}, pages={1–1} }'
chicago: 'Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data
Flows.” Cloud Computing, IEEE Transactions On PP, no. 99 (2015): 1–1. https://doi.org/10.1109/TCC.2015.2487964.'
ieee: R. Cohen and G. Polevoy, “Inter-Datacenter Scheduling of Large Data Flows,”
Cloud Computing, IEEE Transactions on, vol. PP, no. 99, pp. 1–1, 2015.
mla: Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data Flows.”
Cloud Computing, IEEE Transactions On, vol. PP, no. 99, 2015, pp. 1–1,
doi:10.1109/TCC.2015.2487964.
short: R. Cohen, G. Polevoy, Cloud Computing, IEEE Transactions On PP (2015) 1–1.
date_created: 2020-08-06T15:20:58Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TCC.2015.2487964
extern: '1'
issue: '99'
keyword:
- Approximation algorithms
- Approximation methods
- Bandwidth
- Cloud computing
- Routing
- Schedules
- Scheduling
language:
- iso: eng
page: 1-1
publication: Cloud Computing, IEEE Transactions on
publication_identifier:
issn:
- 2168-7161
status: public
title: Inter-Datacenter Scheduling of Large Data Flows
type: journal_article
user_id: '83983'
volume: PP
year: '2015'
...
---
_id: '17658'
abstract:
- lang: eng
text: 'Abstract We study the problem of bandwidth allocation with multiple interferences.
In this problem the input consists of a set of users and a set of base stations.
Each user has a list of requests, each consisting of a base station, a frequency
demand, and a profit that may be gained by scheduling this request. The goal is
to find a maximum profit set of user requests S that satisfies the following conditions:
(i) S contains at most one request per user, (ii) the frequency sets allotted
to requests in S that correspond to the same base station are pairwise non-intersecting,
and (iii) the QoS received by any user at any frequency is reasonable according
to an interference model. In this paper we consider two variants of bandwidth
allocation with multiple interferences. In the first each request specifies a
demand that can be satisfied by any subset of frequencies that is large enough.
In the second each request specifies a specific frequency interval. Furthermore,
we consider two interference models, multiplicative and additive. We show that
these problems are extremely hard to approximate if the interferences depend on
both the interfered and the interfering base stations. On the other hand, we provide
constant factor approximation algorithms for both variants of bandwidth allocation
with multiple interferences for the case where the interferences depend only on
the interfering base stations. We also consider a restrictive special case that
is closely related to the Knapsack problem. We show that this special case is
NP-hard and that it admits an FPTAS. '
author:
- first_name: Reuven
full_name: Bar-Yehuda, Reuven
last_name: Bar-Yehuda
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Dror
full_name: Rawitz, Dror
last_name: Rawitz
citation:
ama: Bar-Yehuda R, Polevoy G, Rawitz D. Bandwidth allocation in cellular networks
with multiple interferences. Discrete Applied Mathematics . 2015;194:23-36.
doi:http://dx.doi.org/10.1016/j.dam.2015.05.013
apa: Bar-Yehuda, R., Polevoy, G., & Rawitz, D. (2015). Bandwidth allocation
in cellular networks with multiple interferences. Discrete Applied Mathematics
, 194, 23–36. http://dx.doi.org/10.1016/j.dam.2015.05.013
bibtex: '@article{Bar-Yehuda_Polevoy_Rawitz_2015, title={Bandwidth allocation in
cellular networks with multiple interferences}, volume={194}, DOI={http://dx.doi.org/10.1016/j.dam.2015.05.013},
journal={Discrete Applied Mathematics }, publisher={Elsevier}, author={Bar-Yehuda,
Reuven and Polevoy, Gleb and Rawitz, Dror}, year={2015}, pages={23–36} }'
chicago: 'Bar-Yehuda, Reuven, Gleb Polevoy, and Dror Rawitz. “Bandwidth Allocation
in Cellular Networks with Multiple Interferences.” Discrete Applied Mathematics
194 (2015): 23–36. http://dx.doi.org/10.1016/j.dam.2015.05.013.'
ieee: R. Bar-Yehuda, G. Polevoy, and D. Rawitz, “Bandwidth allocation in cellular
networks with multiple interferences,” Discrete Applied Mathematics , vol.
194, pp. 23–36, 2015.
mla: Bar-Yehuda, Reuven, et al. “Bandwidth Allocation in Cellular Networks with
Multiple Interferences.” Discrete Applied Mathematics , vol. 194, Elsevier,
2015, pp. 23–36, doi:http://dx.doi.org/10.1016/j.dam.2015.05.013.
short: R. Bar-Yehuda, G. Polevoy, D. Rawitz, Discrete Applied Mathematics 194 (2015)
23–36.
date_created: 2020-08-06T15:21:15Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: http://dx.doi.org/10.1016/j.dam.2015.05.013
extern: '1'
intvolume: ' 194'
keyword:
- Local ratio
language:
- iso: eng
page: 23 - 36
publication: 'Discrete Applied Mathematics '
publication_identifier:
issn:
- 0166-218X
publisher: Elsevier
status: public
title: Bandwidth allocation in cellular networks with multiple interferences
type: journal_article
user_id: '83983'
volume: 194
year: '2015'
...
---
_id: '1769'
abstract:
- lang: eng
text: 'Große zylindrische Stahlprüflinge werden mittels der Methode der finiten
Differenzen im Zeitbereich (engl. finite differences in time domain, FDTD) simulativ
untersucht. Dabei werden Pitch-Catch-Messanordnungen verwendet. Es werden zwei
Bildgebungsansätze vorgestellt: ersterer basiert auf dem Imaging Principle nach
Claerbout, letzterer basiert auf gradientenbasierter Optimierung eines Zielfunktionals.'
author:
- first_name: Sebastian
full_name: Hegler, Sebastian
last_name: Hegler
- first_name: Christoph
full_name: Statz, Christoph
last_name: Statz
- first_name: Marco
full_name: Mütze, Marco
last_name: Mütze
- first_name: Hubert
full_name: Mooshofer, Hubert
last_name: Mooshofer
- first_name: Matthias
full_name: Goldammer, Matthias
last_name: Goldammer
- first_name: Karl
full_name: Fendt, Karl
last_name: Fendt
- first_name: Stefan
full_name: Schwarzer, Stefan
last_name: Schwarzer
- first_name: Kim
full_name: Feldhoff, Kim
last_name: Feldhoff
- first_name: Martin
full_name: Flehmig, Martin
last_name: Flehmig
- first_name: Ulf
full_name: Markwardt, Ulf
last_name: Markwardt
- first_name: Wolfgang
full_name: E. Nagel, Wolfgang
last_name: E. Nagel
- first_name: Maria
full_name: Schütte, Maria
last_name: Schütte
- first_name: Andrea
full_name: Walther, Andrea
last_name: Walther
- first_name: Michael
full_name: Meinel, Michael
last_name: Meinel
- first_name: Achim
full_name: Basermann, Achim
last_name: Basermann
- first_name: Dirk
full_name: Plettemeier, Dirk
last_name: Plettemeier
citation:
ama: Hegler S, Statz C, Mütze M, et al. Simulative Ultraschall-Untersuchung von
Pitch-Catch-Messanordnungen für große zylindrische Stahl-Prüflinge und gradientenbasierte
Bildgebung. tm - Technisches Messen. 2015;82(9):440-450. doi:doi:10.1515/teme-2015-0031
apa: Hegler, S., Statz, C., Mütze, M., Mooshofer, H., Goldammer, M., Fendt, K.,
… Plettemeier, D. (2015). Simulative Ultraschall-Untersuchung von Pitch-Catch-Messanordnungen
für große zylindrische Stahl-Prüflinge und gradientenbasierte Bildgebung. Tm
- Technisches Messen, 82(9), 440–450. https://doi.org/doi:10.1515/teme-2015-0031
bibtex: '@article{Hegler_Statz_Mütze_Mooshofer_Goldammer_Fendt_Schwarzer_Feldhoff_Flehmig_Markwardt_et
al._2015, title={Simulative Ultraschall-Untersuchung von Pitch-Catch-Messanordnungen
für große zylindrische Stahl-Prüflinge und gradientenbasierte Bildgebung}, volume={82},
DOI={doi:10.1515/teme-2015-0031},
number={9}, journal={tm - Technisches Messen}, publisher={Walter de Gruyter},
author={Hegler, Sebastian and Statz, Christoph and Mütze, Marco and Mooshofer,
Hubert and Goldammer, Matthias and Fendt, Karl and Schwarzer, Stefan and Feldhoff,
Kim and Flehmig, Martin and Markwardt, Ulf and et al.}, year={2015}, pages={440–450}
}'
chicago: 'Hegler, Sebastian, Christoph Statz, Marco Mütze, Hubert Mooshofer, Matthias
Goldammer, Karl Fendt, Stefan Schwarzer, et al. “Simulative Ultraschall-Untersuchung
von Pitch-Catch-Messanordnungen Für Große Zylindrische Stahl-Prüflinge Und Gradientenbasierte
Bildgebung.” Tm - Technisches Messen 82, no. 9 (2015): 440–50. https://doi.org/doi:10.1515/teme-2015-0031.'
ieee: S. Hegler et al., “Simulative Ultraschall-Untersuchung von Pitch-Catch-Messanordnungen
für große zylindrische Stahl-Prüflinge und gradientenbasierte Bildgebung,” tm
- Technisches Messen, vol. 82, no. 9, pp. 440–450, 2015.
mla: Hegler, Sebastian, et al. “Simulative Ultraschall-Untersuchung von Pitch-Catch-Messanordnungen
Für Große Zylindrische Stahl-Prüflinge Und Gradientenbasierte Bildgebung.” Tm
- Technisches Messen, vol. 82, no. 9, Walter de Gruyter, 2015, pp. 440–50,
doi:doi:10.1515/teme-2015-0031.
short: S. Hegler, C. Statz, M. Mütze, H. Mooshofer, M. Goldammer, K. Fendt, S. Schwarzer,
K. Feldhoff, M. Flehmig, U. Markwardt, W. E. Nagel, M. Schütte, A. Walther, M.
Meinel, A. Basermann, D. Plettemeier, Tm - Technisches Messen 82 (2015) 440–450.
date_created: 2018-03-23T14:01:39Z
date_updated: 2022-01-06T06:53:17Z
department:
- _id: '27'
- _id: '104'
doi: doi:10.1515/teme-2015-0031
intvolume: ' 82'
issue: '9'
page: 440-450
publication: tm - Technisches Messen
publisher: Walter de Gruyter
status: public
title: Simulative Ultraschall-Untersuchung von Pitch-Catch-Messanordnungen für große
zylindrische Stahl-Prüflinge und gradientenbasierte Bildgebung
type: journal_article
user_id: '24135'
volume: 82
year: '2015'
...