---
_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: '272'
abstract:
- lang: eng
text: 'Automated service composition aims at automatically generating software solutions
based on services to provide more complex functionality. In this paper, we give
an initial overview about why adaptivity becomes increasingly important when aiming
for automated composition of service functionality in dynamic and freely accessible
environments such as service markets. We systematically derive dependencies among
crucial processes such as service composition and service execution in a holistic
view. Furthermore, we briefly discuss the influences and effects of changes in
the environment according to the derived dependencies, and derive possible future
research directions. '
author:
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
citation:
ama: 'Jungmann A. On Adaptivity for Automated Composition of Service Functionality.
In: Proceedings of the IEEE 11th World Congress on Services (SERVICES).
; 2015:329--332. doi:10.1109/SERVICES.2015.57'
apa: Jungmann, A. (2015). On Adaptivity for Automated Composition of Service Functionality.
In Proceedings of the IEEE 11th World Congress on Services (SERVICES) (pp.
329--332). https://doi.org/10.1109/SERVICES.2015.57
bibtex: '@inproceedings{Jungmann_2015, title={On Adaptivity for Automated Composition
of Service Functionality}, DOI={10.1109/SERVICES.2015.57},
booktitle={Proceedings of the IEEE 11th World Congress on Services (SERVICES)},
author={Jungmann, Alexander}, year={2015}, pages={329--332} }'
chicago: Jungmann, Alexander. “On Adaptivity for Automated Composition of Service
Functionality.” In Proceedings of the IEEE 11th World Congress on Services
(SERVICES), 329--332, 2015. https://doi.org/10.1109/SERVICES.2015.57.
ieee: A. Jungmann, “On Adaptivity for Automated Composition of Service Functionality,”
in Proceedings of the IEEE 11th World Congress on Services (SERVICES),
2015, pp. 329--332.
mla: Jungmann, Alexander. “On Adaptivity for Automated Composition of Service Functionality.”
Proceedings of the IEEE 11th World Congress on Services (SERVICES), 2015,
pp. 329--332, doi:10.1109/SERVICES.2015.57.
short: 'A. Jungmann, in: Proceedings of the IEEE 11th World Congress on Services
(SERVICES), 2015, pp. 329--332.'
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:36Z
ddc:
- '040'
doi: 10.1109/SERVICES.2015.57
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:29:05Z
date_updated: 2018-03-21T09:29:05Z
file_id: '1474'
file_name: 272-07196545.pdf
file_size: 163452
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:29:05Z
has_accepted_license: '1'
page: 329--332
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 IEEE 11th World Congress on Services (SERVICES)
status: public
title: On Adaptivity for Automated Composition of Service Functionality
type: conference
user_id: '15504'
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: '276'
author:
- first_name: Till
full_name: Hohenberger, Till
last_name: Hohenberger
citation:
ama: Hohenberger T. Network Creation Games with Interest Groups. Universität
Paderborn; 2015.
apa: Hohenberger, T. (2015). Network Creation Games with Interest Groups.
Universität Paderborn.
bibtex: '@book{Hohenberger_2015, title={Network Creation Games with Interest Groups},
publisher={Universität Paderborn}, author={Hohenberger, Till}, year={2015} }'
chicago: Hohenberger, Till. Network Creation Games with Interest Groups.
Universität Paderborn, 2015.
ieee: T. Hohenberger, Network Creation Games with Interest Groups. Universität
Paderborn, 2015.
mla: Hohenberger, Till. Network Creation Games with Interest Groups. Universität
Paderborn, 2015.
short: T. Hohenberger, Network Creation Games with Interest Groups, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:43Z
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Network Creation Games with Interest Groups
type: mastersthesis
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: '1772'
author:
- first_name: Jim
full_name: Torresen, Jim
last_name: Torresen
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Xin
full_name: Yao, Xin
last_name: Yao
citation:
ama: Torresen J, Plessl C, Yao X. Self-Aware and Self-Expressive Systems – Guest
Editor’s Introduction. IEEE Computer. 2015;48(7):18-20. doi:10.1109/MC.2015.205
apa: Torresen, J., Plessl, C., & Yao, X. (2015). Self-Aware and Self-Expressive
Systems – Guest Editor’s Introduction. IEEE Computer, 48(7), 18–20.
https://doi.org/10.1109/MC.2015.205
bibtex: '@article{Torresen_Plessl_Yao_2015, title={Self-Aware and Self-Expressive
Systems – Guest Editor’s Introduction}, volume={48}, DOI={10.1109/MC.2015.205},
number={7}, journal={IEEE Computer}, publisher={IEEE Computer Society}, author={Torresen,
Jim and Plessl, Christian and Yao, Xin}, year={2015}, pages={18–20} }'
chicago: 'Torresen, Jim, Christian Plessl, and Xin Yao. “Self-Aware and Self-Expressive
Systems – Guest Editor’s Introduction.” IEEE Computer 48, no. 7 (2015):
18–20. https://doi.org/10.1109/MC.2015.205.'
ieee: J. Torresen, C. Plessl, and X. Yao, “Self-Aware and Self-Expressive Systems
– Guest Editor’s Introduction,” IEEE Computer, vol. 48, no. 7, pp. 18–20,
2015.
mla: Torresen, Jim, et al. “Self-Aware and Self-Expressive Systems – Guest Editor’s
Introduction.” IEEE Computer, vol. 48, no. 7, IEEE Computer Society, 2015,
pp. 18–20, doi:10.1109/MC.2015.205.
short: J. Torresen, C. Plessl, X. Yao, IEEE Computer 48 (2015) 18–20.
date_created: 2018-03-23T14:06:12Z
date_updated: 2022-01-06T06:53:19Z
ddc:
- '000'
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/MC.2015.205
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:47:45Z
date_updated: 2018-11-02T15:47:45Z
file_id: '5313'
file_name: 07163237.pdf
file_size: 5605009
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:47:45Z
has_accepted_license: '1'
intvolume: ' 48'
issue: '7'
keyword:
- self-awareness
- self-expression
language:
- iso: eng
page: 18-20
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '34'
grant_number: '610996'
name: Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous
System Architectures
publication: IEEE Computer
publisher: IEEE Computer Society
status: public
title: Self-Aware and Self-Expressive Systems – Guest Editor's Introduction
type: journal_article
user_id: '16153'
volume: 48
year: '2015'
...
---
_id: '234'
author:
- first_name: Maria Reinhild
full_name: Menne, Maria Reinhild
last_name: Menne
citation:
ama: Menne MR. Verkaufsbeschränkungen auf Onlinemarktplätzen - Eine wettbewerbspolitische
Analyse am Fallbeispiel der Adidas AG. Universität Paderborn; 2015.
apa: Menne, M. R. (2015). Verkaufsbeschränkungen auf Onlinemarktplätzen - Eine
wettbewerbspolitische Analyse am Fallbeispiel der Adidas AG. Universität Paderborn.
bibtex: '@book{Menne_2015, title={Verkaufsbeschränkungen auf Onlinemarktplätzen
- Eine wettbewerbspolitische Analyse am Fallbeispiel der Adidas AG}, publisher={Universität
Paderborn}, author={Menne, Maria Reinhild}, year={2015} }'
chicago: Menne, Maria Reinhild. Verkaufsbeschränkungen auf Onlinemarktplätzen
- Eine wettbewerbspolitische Analyse am Fallbeispiel der Adidas AG. Universität
Paderborn, 2015.
ieee: M. R. Menne, Verkaufsbeschränkungen auf Onlinemarktplätzen - Eine wettbewerbspolitische
Analyse am Fallbeispiel der Adidas AG. Universität Paderborn, 2015.
mla: Menne, Maria Reinhild. Verkaufsbeschränkungen auf Onlinemarktplätzen - Eine
wettbewerbspolitische Analyse am Fallbeispiel der Adidas AG. Universität Paderborn,
2015.
short: M.R. Menne, Verkaufsbeschränkungen auf Onlinemarktplätzen - Eine wettbewerbspolitische
Analyse am Fallbeispiel der Adidas AG, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:37Z
date_updated: 2022-01-06T06:55:52Z
department:
- _id: '280'
language:
- iso: ger
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: Verkaufsbeschränkungen auf Onlinemarktplätzen - Eine wettbewerbspolitische
Analyse am Fallbeispiel der Adidas AG
type: bachelorsthesis
user_id: '42447'
year: '2015'
...
---
_id: '235'
author:
- first_name: Sebastian
full_name: Strotmeyer, Sebastian
last_name: Strotmeyer
citation:
ama: Strotmeyer S. Vergleichende Betrachtung von Software-Werkzeugen zur Geschäftsmodellentwicklung.
Universität Paderborn; 2015.
apa: Strotmeyer, S. (2015). Vergleichende Betrachtung von Software-Werkzeugen
zur Geschäftsmodellentwicklung. Universität Paderborn.
bibtex: '@book{Strotmeyer_2015, title={Vergleichende Betrachtung von Software-Werkzeugen
zur Geschäftsmodellentwicklung}, publisher={Universität Paderborn}, author={Strotmeyer,
Sebastian}, year={2015} }'
chicago: Strotmeyer, Sebastian. Vergleichende Betrachtung von Software-Werkzeugen
zur Geschäftsmodellentwicklung. Universität Paderborn, 2015.
ieee: S. Strotmeyer, Vergleichende Betrachtung von Software-Werkzeugen zur Geschäftsmodellentwicklung.
Universität Paderborn, 2015.
mla: Strotmeyer, Sebastian. Vergleichende Betrachtung von Software-Werkzeugen
zur Geschäftsmodellentwicklung. Universität Paderborn, 2015.
short: S. Strotmeyer, Vergleichende Betrachtung von Software-Werkzeugen zur Geschäftsmodellentwicklung,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:37Z
date_updated: 2022-01-06T06:55:56Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '17'
name: SFB 901 - Subprojekt C5
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Vergleichende Betrachtung von Software-Werkzeugen zur Geschäftsmodellentwicklung
type: bachelorsthesis
user_id: '16205'
year: '2015'
...
---
_id: '236'
author:
- first_name: Daniel
full_name: Neumann, Daniel
last_name: Neumann
citation:
ama: Neumann D. Vergleichende Betrachtung ausgewählter Ansätze zur Bewertung
von Innovation Performance im Kontext von IT-gestützten Geschäftsmodellinnovationen
im Automotive Bereich. Universität Paderborn; 2015.
apa: Neumann, D. (2015). Vergleichende Betrachtung ausgewählter Ansätze zur Bewertung
von Innovation Performance im Kontext von IT-gestützten Geschäftsmodellinnovationen
im Automotive Bereich. Universität Paderborn.
bibtex: '@book{Neumann_2015, title={Vergleichende Betrachtung ausgewählter Ansätze
zur Bewertung von Innovation Performance im Kontext von IT-gestützten Geschäftsmodellinnovationen
im Automotive Bereich}, publisher={Universität Paderborn}, author={Neumann, Daniel},
year={2015} }'
chicago: Neumann, Daniel. Vergleichende Betrachtung ausgewählter Ansätze zur
Bewertung von Innovation Performance im Kontext von IT-gestützten Geschäftsmodellinnovationen
im Automotive Bereich. Universität Paderborn, 2015.
ieee: D. Neumann, Vergleichende Betrachtung ausgewählter Ansätze zur Bewertung
von Innovation Performance im Kontext von IT-gestützten Geschäftsmodellinnovationen
im Automotive Bereich. Universität Paderborn, 2015.
mla: Neumann, Daniel. Vergleichende Betrachtung ausgewählter Ansätze zur Bewertung
von Innovation Performance im Kontext von IT-gestützten Geschäftsmodellinnovationen
im Automotive Bereich. Universität Paderborn, 2015.
short: D. Neumann, Vergleichende Betrachtung ausgewählter Ansätze zur Bewertung
von Innovation Performance im Kontext von IT-gestützten Geschäftsmodellinnovationen
im Automotive Bereich, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:38Z
date_updated: 2022-01-06T06:55:57Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '17'
name: SFB 901 - Subprojekt C5
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Vergleichende Betrachtung ausgewählter Ansätze zur Bewertung von Innovation
Performance im Kontext von IT-gestützten Geschäftsmodellinnovationen im Automotive
Bereich
type: mastersthesis
user_id: '16205'
year: '2015'
...
---
_id: '237'
author:
- first_name: Kerstin
full_name: Ochlast, Kerstin
last_name: Ochlast
citation:
ama: Ochlast K. Trust Me, I Am Certified - Wie Die Zertifizierung von Produkten
Und Verkäufern Das Vertrauen von Kunden Im Onlinehandel Beeinflussen. Universität
Paderborn; 2015.
apa: Ochlast, K. (2015). Trust Me, I am Certified - Wie die Zertifizierung von
Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen.
Universität Paderborn.
bibtex: '@book{Ochlast_2015, title={Trust Me, I am Certified - Wie die Zertifizierung
von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen},
publisher={Universität Paderborn}, author={Ochlast, Kerstin}, year={2015} }'
chicago: Ochlast, Kerstin. Trust Me, I Am Certified - Wie Die Zertifizierung
von Produkten Und Verkäufern Das Vertrauen von Kunden Im Onlinehandel Beeinflussen.
Universität Paderborn, 2015.
ieee: K. Ochlast, Trust Me, I am Certified - Wie die Zertifizierung von Produkten
und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen. Universität
Paderborn, 2015.
mla: Ochlast, Kerstin. Trust Me, I Am Certified - Wie Die Zertifizierung von
Produkten Und Verkäufern Das Vertrauen von Kunden Im Onlinehandel Beeinflussen.
Universität Paderborn, 2015.
short: K. Ochlast, Trust Me, I Am Certified - Wie Die Zertifizierung von Produkten
Und Verkäufern Das Vertrauen von Kunden Im Onlinehandel Beeinflussen, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:38Z
date_updated: 2022-01-06T06:55:58Z
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '8'
name: SFB 901 - Subprojekt A4
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Trust Me, I am Certified - Wie die Zertifizierung von Produkten und Verkäufern
das Vertrauen von Kunden im Onlinehandel beeinflussen
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '239'
abstract:
- lang: eng
text: We report on the construction of the Wikidata Vandalism Corpus WDVC-2015,
the first corpus for vandalism in knowledge bases. Our corpus is based on the
entire revision history of Wikidata, the knowledge base underlying Wikipedia.
Among Wikidata's 24 million manual revisions, we have identified more than 100,000
cases of vandalism. An in-depth corpus analysis lays the groundwork for research
and development on automatic vandalism detection in public knowledge bases. Our
analysis shows that 58% of the vandalism revisions can be found in the textual
portions of Wikidata, and the remainder in structural content, e.g., subject-predicate-object
triples. Moreover, we find that some vandals also target Wikidata content whose
manipulation may impact content displayed on Wikipedia, revealing potential vulnerabilities.
Given today's importance of knowledge bases for information systems, this shows
that public knowledge bases must be used with caution.
author:
- first_name: Stefan
full_name: Heindorf, Stefan
last_name: Heindorf
- first_name: Martin
full_name: Potthast, Martin
last_name: Potthast
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Heindorf S, Potthast M, Stein B, Engels G. Towards Vandalism Detection in
Knowledge Bases: Corpus Construction and Analysis. In: Proceedings of the 38th
International ACM Conference on Research and Development in Information Retrieval
(SIGIR 15). ; 2015:831--834. doi:10.1145/2766462.2767804'
apa: 'Heindorf, S., Potthast, M., Stein, B., & Engels, G. (2015). Towards Vandalism
Detection in Knowledge Bases: Corpus Construction and Analysis. In Proceedings
of the 38th International ACM Conference on Research and Development in Information
Retrieval (SIGIR 15) (pp. 831--834). https://doi.org/10.1145/2766462.2767804'
bibtex: '@inproceedings{Heindorf_Potthast_Stein_Engels_2015, title={Towards Vandalism
Detection in Knowledge Bases: Corpus Construction and Analysis}, DOI={10.1145/2766462.2767804},
booktitle={Proceedings of the 38th International ACM Conference on Research and
Development in Information Retrieval (SIGIR 15)}, author={Heindorf, Stefan and
Potthast, Martin and Stein, Benno and Engels, Gregor}, year={2015}, pages={831--834}
}'
chicago: 'Heindorf, Stefan, Martin Potthast, Benno Stein, and Gregor Engels. “Towards
Vandalism Detection in Knowledge Bases: Corpus Construction and Analysis.” In
Proceedings of the 38th International ACM Conference on Research and Development
in Information Retrieval (SIGIR 15), 831--834, 2015. https://doi.org/10.1145/2766462.2767804.'
ieee: 'S. Heindorf, M. Potthast, B. Stein, and G. Engels, “Towards Vandalism Detection
in Knowledge Bases: Corpus Construction and Analysis,” in Proceedings of the
38th International ACM Conference on Research and Development in Information Retrieval
(SIGIR 15), 2015, pp. 831--834.'
mla: 'Heindorf, Stefan, et al. “Towards Vandalism Detection in Knowledge Bases:
Corpus Construction and Analysis.” Proceedings of the 38th International ACM
Conference on Research and Development in Information Retrieval (SIGIR 15),
2015, pp. 831--834, doi:10.1145/2766462.2767804.'
short: 'S. Heindorf, M. Potthast, B. Stein, G. Engels, in: Proceedings of the 38th
International ACM Conference on Research and Development in Information Retrieval
(SIGIR 15), 2015, pp. 831--834.'
date_created: 2017-10-17T12:41:38Z
date_updated: 2022-01-06T06:56:04Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.1145/2766462.2767804
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:29:18Z
date_updated: 2018-03-21T10:29:18Z
file_id: '1499'
file_name: 239-p831-heindorf.pdf
file_size: 735898
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:29:18Z
has_accepted_license: '1'
language:
- iso: eng
page: 831--834
project:
- _id: '1'
name: SFB 901
- _id: '17'
name: SFB 901 - Subprojekt C5
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 38th International ACM Conference on Research and
Development in Information Retrieval (SIGIR 15)
status: public
title: 'Towards Vandalism Detection in Knowledge Bases: Corpus Construction and Analysis'
type: conference
user_id: '477'
year: '2015'
...
---
_id: '240'
abstract:
- lang: eng
text: We consider online leasing problems in which demands arrive over time and
need to be served by leasing resources. We introduce a new model for these problems
such that a resource can be leased for K different durations each incurring a
different cost (longer leases cost less per time unit). Each demand i can be served
anytime between its arrival ai and its deadline ai+di by a leased resource. The
objective is to meet all deadlines while minimizing the total leasing costs. This
model is a natural generalization of Meyerson’s ParkingPermitProblem (FOCS 2005)
in which di=0 for all i. We propose an online algorithm that is Θ(K+dmaxlmin)-competitive
where dmax and lmin denote the largest di and the shortest available lease length,
respectively. We also extend the SetCoverLeasing problem by deadlines and give
a competitive online algorithm which also improves on existing solutions for the
original SetCoverLeasing problem.
author:
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- 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: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: 'Li S, Mäcker A, Markarian C, Meyer auf der Heide F, Riechers S. Towards Flexible
Demands in Online Leasing Problems. In: Proceedings of the 21st Annual International
Computing and Combinatorics Conference (COCOON). Lecture Notes in Computer
Science. ; 2015:277--288. doi:10.1007/978-3-319-21398-9_22'
apa: Li, S., Mäcker, A., Markarian, C., Meyer auf der Heide, F., & Riechers,
S. (2015). Towards Flexible Demands in Online Leasing Problems. In Proceedings
of the 21st Annual International Computing and Combinatorics Conference (COCOON)
(pp. 277--288). https://doi.org/10.1007/978-3-319-21398-9_22
bibtex: '@inproceedings{Li_Mäcker_Markarian_Meyer auf der Heide_Riechers_2015, series={Lecture
Notes in Computer Science}, title={Towards Flexible Demands in Online Leasing
Problems}, DOI={10.1007/978-3-319-21398-9_22},
booktitle={Proceedings of the 21st Annual International Computing and Combinatorics
Conference (COCOON)}, author={Li, Shouwei and Mäcker, Alexander and Markarian,
Christine and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2015},
pages={277--288}, collection={Lecture Notes in Computer Science} }'
chicago: Li, Shouwei, Alexander Mäcker, Christine Markarian, Friedhelm Meyer auf
der Heide, and Sören Riechers. “Towards Flexible Demands in Online Leasing Problems.”
In Proceedings of the 21st Annual International Computing and Combinatorics
Conference (COCOON), 277--288. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-21398-9_22.
ieee: S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, and S. Riechers, “Towards
Flexible Demands in Online Leasing Problems,” in Proceedings of the 21st Annual
International Computing and Combinatorics Conference (COCOON), 2015, pp. 277--288.
mla: Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems.”
Proceedings of the 21st Annual International Computing and Combinatorics Conference
(COCOON), 2015, pp. 277--288, doi:10.1007/978-3-319-21398-9_22.
short: 'S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, S. Riechers, in:
Proceedings of the 21st Annual International Computing and Combinatorics Conference
(COCOON), 2015, pp. 277--288.'
date_created: 2017-10-17T12:41:38Z
date_updated: 2022-01-06T06:56:05Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-21398-9_22
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:28:50Z
date_updated: 2018-03-21T10:28:50Z
file_id: '1498'
file_name: 240-chp_3A10.1007_2F978-3-319-21398-9_22.pdf
file_size: 264482
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:28:50Z
has_accepted_license: '1'
page: 277--288
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 21st Annual International Computing and Combinatorics
Conference (COCOON)
series_title: Lecture Notes in Computer Science
status: public
title: Towards Flexible Demands in Online Leasing Problems
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '18003'
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
citation:
ama: Götte T. Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot.
Universität Paderborn; 2015.
apa: Götte, T. (2015). Covering and Bridging im selbstorganisierenden Partikelsystem
Amoebabot. Universität Paderborn.
bibtex: '@book{Götte_2015, title={Covering and Bridging im selbstorganisierenden
Partikelsystem Amoebabot}, publisher={Universität Paderborn}, author={Götte, Thorsten},
year={2015} }'
chicago: Götte, Thorsten. Covering and Bridging Im Selbstorganisierenden Partikelsystem
Amoebabot. Universität Paderborn, 2015.
ieee: T. Götte, Covering and Bridging im selbstorganisierenden Partikelsystem
Amoebabot. Universität Paderborn, 2015.
mla: Götte, Thorsten. Covering and Bridging Im Selbstorganisierenden Partikelsystem
Amoebabot. Universität Paderborn, 2015.
short: T. Götte, Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot,
Universität Paderborn, 2015.
date_created: 2020-08-17T08:18:04Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '18005'
author:
- first_name: Christian
full_name: Korfmacher, Christian
last_name: Korfmacher
citation:
ama: Korfmacher C. Implementierung Und Analyse von Cone-DHT. Universität
Paderborn; 2015.
apa: Korfmacher, C. (2015). Implementierung und Analyse von Cone-DHT. Universität
Paderborn.
bibtex: '@book{Korfmacher_2015, title={Implementierung und Analyse von Cone-DHT},
publisher={Universität Paderborn}, author={Korfmacher, Christian}, year={2015}
}'
chicago: Korfmacher, Christian. Implementierung Und Analyse von Cone-DHT.
Universität Paderborn, 2015.
ieee: C. Korfmacher, Implementierung und Analyse von Cone-DHT. Universität
Paderborn, 2015.
mla: Korfmacher, Christian. Implementierung Und Analyse von Cone-DHT. Universität
Paderborn, 2015.
short: C. Korfmacher, Implementierung Und Analyse von Cone-DHT, Universität Paderborn,
2015.
date_created: 2020-08-17T08:19:47Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Implementierung und Analyse von Cone-DHT
type: bachelorsthesis
user_id: '477'
year: '2015'
...