---
_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'
...
---
_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: '1774'
abstract:
- lang: eng
text: In this article an efficient numerical method to solve multiobjective optimization
problems for fluid flow governed by the Navier Stokes equations is presented.
In order to decrease the computational effort, a reduced order model is introduced
using Proper Orthogonal Decomposition and a corresponding Galerkin Projection.
A global, derivative free multiobjective optimization algorithm is applied to
compute the Pareto set (i.e. the set of optimal compromises) for the concurrent
objectives minimization of flow field fluctuations and control cost. The method
is illustrated for a 2D flow around a cylinder at Re = 100.
author:
- first_name: Sebastian
full_name: Peitz, Sebastian
last_name: Peitz
- first_name: Michael
full_name: Dellnitz, Michael
last_name: Dellnitz
citation:
ama: Peitz S, Dellnitz M. Multiobjective Optimization of the Flow Around a Cylinder
Using Model Order Reduction. PAMM. 2015;15(1):613-614. doi:10.1002/pamm.201510296
apa: Peitz, S., & Dellnitz, M. (2015). Multiobjective Optimization of the Flow
Around a Cylinder Using Model Order Reduction. PAMM, 15(1), 613–614.
https://doi.org/10.1002/pamm.201510296
bibtex: '@article{Peitz_Dellnitz_2015, title={Multiobjective Optimization of the
Flow Around a Cylinder Using Model Order Reduction}, volume={15}, DOI={10.1002/pamm.201510296},
number={1}, journal={PAMM}, publisher={WILEY-VCH Verlag}, author={Peitz, Sebastian
and Dellnitz, Michael}, year={2015}, pages={613–614} }'
chicago: 'Peitz, Sebastian, and Michael Dellnitz. “Multiobjective Optimization of
the Flow Around a Cylinder Using Model Order Reduction.” PAMM 15, no. 1
(2015): 613–14. https://doi.org/10.1002/pamm.201510296.'
ieee: S. Peitz and M. Dellnitz, “Multiobjective Optimization of the Flow Around
a Cylinder Using Model Order Reduction,” PAMM, vol. 15, no. 1, pp. 613–614,
2015.
mla: Peitz, Sebastian, and Michael Dellnitz. “Multiobjective Optimization of the
Flow Around a Cylinder Using Model Order Reduction.” PAMM, vol. 15, no.
1, WILEY-VCH Verlag, 2015, pp. 613–14, doi:10.1002/pamm.201510296.
short: S. Peitz, M. Dellnitz, PAMM 15 (2015) 613–614.
date_created: 2018-03-23T14:14:24Z
date_updated: 2022-01-06T06:53:19Z
department:
- _id: '27'
- _id: '101'
doi: 10.1002/pamm.201510296
intvolume: ' 15'
issue: '1'
page: 613-614
publication: PAMM
publication_identifier:
issn:
- 1617-7061
publisher: WILEY-VCH Verlag
status: public
title: Multiobjective Optimization of the Flow Around a Cylinder Using Model Order
Reduction
type: journal_article
user_id: '24135'
volume: 15
year: '2015'
...
---
_id: '1794'
abstract:
- lang: eng
text: Demands for computational power and energy efficiency of computing devices
are steadily increasing. At the same time, following classic methods to increase
speed and reduce energy consumption of these devices becomes increasingly difficult,
bringing alternative methods into focus. One of these methods is approximate computing
which utilizes the fact that small errors in computations are acceptable in many
applications in order to allow acceleration of these computations or to increase
energy efficiency. This thesis develops elements of a workflow that can be followed
to apply approximate computing to existing applications. It proposes a novel heuristic
approach to the localization of code paths that are suitable to approximate computing
based on findings in recent research. Additionally, an approach to identification
of approximable instructions within these code paths is proposed and used to implement
simulation of approximation. The parts of the workflow are implemented with the
goal to lay the foundation for a partly automated toolflow. Evaluation of the
developed techniques shows that the proposed methods can help providing a convenient
workflow, facilitating the first steps into the application of approximate computing.
author:
- first_name: Michael
full_name: Lass, Michael
id: '24135'
last_name: Lass
orcid: 0000-0002-5708-7632
citation:
ama: 'Lass M. Localization and Analysis of Code Paths Suitable for Acceleration
Using Approximate Computing. Paderborn: Paderborn University; 2015.'
apa: 'Lass, M. (2015). Localization and Analysis of Code Paths Suitable for Acceleration
using Approximate Computing. Paderborn: Paderborn University.'
bibtex: '@book{Lass_2015, place={Paderborn}, title={Localization and Analysis of
Code Paths Suitable for Acceleration using Approximate Computing}, publisher={Paderborn
University}, author={Lass, Michael}, year={2015} }'
chicago: 'Lass, Michael. Localization and Analysis of Code Paths Suitable for
Acceleration Using Approximate Computing. Paderborn: Paderborn University,
2015.'
ieee: 'M. Lass, Localization and Analysis of Code Paths Suitable for Acceleration
using Approximate Computing. Paderborn: Paderborn University, 2015.'
mla: Lass, Michael. Localization and Analysis of Code Paths Suitable for Acceleration
Using Approximate Computing. Paderborn University, 2015.
short: M. Lass, Localization and Analysis of Code Paths Suitable for Acceleration
Using Approximate Computing, Paderborn University, Paderborn, 2015.
date_created: 2018-03-26T15:24:10Z
date_updated: 2022-01-06T06:53:23Z
department:
- _id: '27'
- _id: '518'
place: Paderborn
publisher: Paderborn University
status: public
supervisor:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
title: Localization and Analysis of Code Paths Suitable for Acceleration using Approximate
Computing
type: mastersthesis
user_id: '24135'
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: '20832'
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
id: '27207'
last_name: Bobolz
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
- first_name: Andreas Peter
full_name: Dann, Andreas Peter
id: '26886'
last_name: Dann
- first_name: Johannes
full_name: Geismann, Johannes
id: '20063'
last_name: Geismann
orcid: https://orcid.org/0000-0003-2015-2047
- 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
id: '41936'
last_name: Piskachev
orcid: 0000-0003-4424-5838
- 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: 2020-12-22T10:03:05Z
date_updated: 2022-01-06T06:54:40Z
department:
- _id: '76'
language:
- iso: eng
status: public
title: Seminar Theses of the Project Group Cybertron
type: report
user_id: '5786'
year: '2015'
...
---
_id: '20833'
author:
- first_name: Johannes
full_name: Geismann, Johannes
id: '20063'
last_name: Geismann
orcid: https://orcid.org/0000-0003-2015-2047
citation:
ama: Geismann J. Multi-Core Execution of Safety-Critical Component-Based Software.
Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik; 2015.
apa: Geismann, J. (2015). Multi-Core Execution of Safety-Critical Component-Based
Software. Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik.
bibtex: '@book{Geismann_2015, title={Multi-Core Execution of Safety-Critical Component-Based
Software}, publisher={Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik},
author={Geismann, Johannes}, year={2015} }'
chicago: Geismann, Johannes. Multi-Core Execution of Safety-Critical Component-Based
Software. Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik,
2015.
ieee: J. Geismann, Multi-Core Execution of Safety-Critical Component-Based Software.
Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik, 2015.
mla: Geismann, Johannes. Multi-Core Execution of Safety-Critical Component-Based
Software. Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik,
2015.
short: J. Geismann, Multi-Core Execution of Safety-Critical Component-Based Software,
Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik, 2015.
date_created: 2020-12-22T10:04:54Z
date_updated: 2022-01-06T06:54:40Z
department:
- _id: '76'
language:
- iso: eng
publisher: Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik
status: public
title: Multi-Core Execution of Safety-Critical Component-Based Software
type: mastersthesis
user_id: '5786'
year: '2015'
...
---
_id: '20902'
abstract:
- lang: ger
text: Die Komplexität moderner Fahrzeuge steigt aufgrund der zunehmenden Anzahl
von Funktionen, die durch elektronische Systeme umgesetzt werden. Insbesondere
nehmen die Abhängigkeiten zwischen den an der Entwicklung beteiligten Fachdisziplinen
und der Softwareanteil massiv zu. Wir haben einen für die Automobilindustrie angepassten,
zum Reifegradmodell Automotive SPICE konformen Prozess für die Entwicklung von
Steuergeräten konzipiert, der ein fachdisziplinübergreifendes Systems Engineering
und einen systematischen Übergang in die Softwareentwicklung unterstützt. Im Kontext
dieses Entwicklungsprozess beschreiben wir in diesem Beitrag den Übergang vom
UML-basierten Softwareentwurf zum in der Automobilindustrie etablierten AUTOSAR-Standard
mit Hilfe einer automatischen Modelltransformation. So werden fehleranfällige
und zeitaufwändige manuelle Tätigkeiten reduziert. Wir haben die Generierung von
AUTOSAR-Modellen gemeinsam mit dem international tätigen Automobilzulieferer Hella
KGaA Hueck & Co. in seriennahen Entwicklungsprojekten praktisch erprobt und Zeit-
und Kostenersparnisse festgestellt.
author:
- first_name: Jan
full_name: Meyer, Jan
last_name: Meyer
- first_name: Jörg
full_name: Holtmann, Jörg
id: '3875'
last_name: Holtmann
orcid: 0000-0001-6141-4571
- first_name: Thorsten
full_name: Koch, Thorsten
id: '13616'
last_name: Koch
- first_name: Matthias
full_name: Meyer, Matthias
id: '683'
last_name: Meyer
citation:
ama: 'Meyer J, Holtmann J, Koch T, Meyer M. Generierung von AUTOSAR-Modellen aus
UML-Spezifikationen. In: Gausemeier J, Dumitrescu R, Rammig F-J, Schäfer W, Trächtler
A, eds. 10. Paderborner Workshop Entwurf Mechatronischer Systeme. Vol 343.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Heinz Nixdorf Institut;
2015:159–172.'
apa: Meyer, J., Holtmann, J., Koch, T., & Meyer, M. (2015). Generierung von
AUTOSAR-Modellen aus UML-Spezifikationen. In J. Gausemeier, R. Dumitrescu, F.-J.
Rammig, W. Schäfer, & A. Trächtler (Eds.), 10. Paderborner Workshop Entwurf
mechatronischer Systeme (Vol. 343, pp. 159–172). Heinz Nixdorf Institut.
bibtex: '@inproceedings{Meyer_Holtmann_Koch_Meyer_2015, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, title={Generierung von AUTOSAR-Modellen
aus UML-Spezifikationen}, volume={343}, booktitle={10. Paderborner Workshop Entwurf
mechatronischer Systeme}, publisher={Heinz Nixdorf Institut}, author={Meyer, Jan
and Holtmann, Jörg and Koch, Thorsten and Meyer, Matthias}, editor={Gausemeier,
Jürgen and Dumitrescu, Roman and Rammig, Franz-Josef and Schäfer, Wilhelm and
Trächtler, Ansgar}, year={2015}, pages={159–172}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Meyer, Jan, Jörg Holtmann, Thorsten Koch, and Matthias Meyer. “Generierung
von AUTOSAR-Modellen Aus UML-Spezifikationen.” In 10. Paderborner Workshop
Entwurf Mechatronischer Systeme, edited by Jürgen Gausemeier, Roman Dumitrescu,
Franz-Josef Rammig, Wilhelm Schäfer, and Ansgar Trächtler, 343:159–172. Verlagsschriftenreihe
Des Heinz Nixdorf Instituts, Paderborn. Heinz Nixdorf Institut, 2015.
ieee: J. Meyer, J. Holtmann, T. Koch, and M. Meyer, “Generierung von AUTOSAR-Modellen
aus UML-Spezifikationen,” in 10. Paderborner Workshop Entwurf mechatronischer
Systeme, 2015, vol. 343, pp. 159–172.
mla: Meyer, Jan, et al. “Generierung von AUTOSAR-Modellen Aus UML-Spezifikationen.”
10. Paderborner Workshop Entwurf Mechatronischer Systeme, edited by Jürgen
Gausemeier et al., vol. 343, Heinz Nixdorf Institut, 2015, pp. 159–172.
short: 'J. Meyer, J. Holtmann, T. Koch, M. Meyer, in: J. Gausemeier, R. Dumitrescu,
F.-J. Rammig, W. Schäfer, A. Trächtler (Eds.), 10. Paderborner Workshop Entwurf
Mechatronischer Systeme, Heinz Nixdorf Institut, 2015, pp. 159–172.'
date_created: 2021-01-12T13:56:52Z
date_updated: 2022-01-06T06:54:41Z
department:
- _id: '76'
- _id: '241'
- _id: '662'
editor:
- first_name: Jürgen
full_name: Gausemeier, Jürgen
last_name: Gausemeier
- first_name: Roman
full_name: Dumitrescu, Roman
last_name: Dumitrescu
- first_name: Franz-Josef
full_name: Rammig, Franz-Josef
last_name: Rammig
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
- first_name: Ansgar
full_name: Trächtler, Ansgar
last_name: Trächtler
intvolume: ' 343'
language:
- iso: eng
page: 159–172
publication: 10. Paderborner Workshop Entwurf mechatronischer Systeme
publisher: Heinz Nixdorf Institut
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Generierung von AUTOSAR-Modellen aus UML-Spezifikationen
type: conference
user_id: '5786'
volume: 343
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: '18004'
author:
- first_name: Daniel
full_name: Isenberg, Daniel
last_name: Isenberg
citation:
ama: Isenberg D. 3D-Nesting in Der SLM-Technologie.; 2015.
apa: Isenberg, D. (2015). 3D-Nesting in der SLM-Technologie.
bibtex: '@book{Isenberg_2015, title={3D-Nesting in der SLM-Technologie}, author={Isenberg,
Daniel}, year={2015} }'
chicago: Isenberg, Daniel. 3D-Nesting in Der SLM-Technologie, 2015.
ieee: D. Isenberg, 3D-Nesting in der SLM-Technologie. 2015.
mla: Isenberg, Daniel. 3D-Nesting in Der SLM-Technologie. 2015.
short: D. Isenberg, 3D-Nesting in Der SLM-Technologie, 2015.
date_created: 2020-08-17T08:18:44Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: 3D-Nesting in der SLM-Technologie
type: bachelorsthesis
user_id: '15504'
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'
...
---
_id: '18006'
author:
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: Sundermeier J. Implementierung Eines Selbststabilisierenden Verteilten Stacks.
Universität Paderborn; 2015.
apa: Sundermeier, J. (2015). Implementierung eines selbststabilisierenden verteilten
Stacks. Universität Paderborn.
bibtex: '@book{Sundermeier_2015, title={Implementierung eines selbststabilisierenden
verteilten Stacks}, publisher={Universität Paderborn}, author={Sundermeier, Jannik},
year={2015} }'
chicago: Sundermeier, Jannik. Implementierung Eines Selbststabilisierenden Verteilten
Stacks. Universität Paderborn, 2015.
ieee: J. Sundermeier, Implementierung eines selbststabilisierenden verteilten
Stacks. Universität Paderborn, 2015.
mla: Sundermeier, Jannik. Implementierung Eines Selbststabilisierenden Verteilten
Stacks. Universität Paderborn, 2015.
short: J. Sundermeier, Implementierung Eines Selbststabilisierenden Verteilten Stacks,
Universität Paderborn, 2015.
date_created: 2020-08-17T08:20:59Z
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 eines selbststabilisierenden verteilten Stacks
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '18024'
author:
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
citation:
ama: Knollmann T. Implementierung Einer Selbststabilisierenden Datenstruktur
Für Das Längste Gemeinsame Präfix. Universität Paderborn; 2015.
apa: Knollmann, T. (2015). Implementierung einer selbststabilisierenden Datenstruktur
für das längste gemeinsame Präfix. Universität Paderborn.
bibtex: '@book{Knollmann_2015, title={Implementierung einer selbststabilisierenden
Datenstruktur für das längste gemeinsame Präfix}, publisher={Universität Paderborn},
author={Knollmann, Till}, year={2015} }'
chicago: Knollmann, Till. Implementierung Einer Selbststabilisierenden Datenstruktur
Für Das Längste Gemeinsame Präfix. Universität Paderborn, 2015.
ieee: T. Knollmann, Implementierung einer selbststabilisierenden Datenstruktur
für das längste gemeinsame Präfix. Universität Paderborn, 2015.
mla: Knollmann, Till. Implementierung Einer Selbststabilisierenden Datenstruktur
Für Das Längste Gemeinsame Präfix. Universität Paderborn, 2015.
short: T. Knollmann, Implementierung Einer Selbststabilisierenden Datenstruktur
Für Das Längste Gemeinsame Präfix, Universität Paderborn, 2015.
date_created: 2020-08-18T08:37:33Z
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 einer selbststabilisierenden Datenstruktur für das längste
gemeinsame Präfix
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '1850'
author:
- first_name: Zahra
full_name: Derakhshandeh, Zahra
last_name: Derakhshandeh
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
- first_name: Rida
full_name: A. Bazzi, Rida
last_name: A. Bazzi
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Derakhshandeh Z, Gmyr R, Strothmann TF, A. Bazzi R, W. Richa A, Scheideler
C. Leader Election and Shape Formation with Self-organizing Programmable Matter.
In: DNA Computing and Molecular Programming - 21st International Conference,
DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings. Vol
9211. Lecture Notes in Computer Science. ; 2015:117--132. doi:10.1007/978-3-319-21999-8_8'
apa: Derakhshandeh, Z., Gmyr, R., Strothmann, T. F., A. Bazzi, R., W. Richa, A.,
& Scheideler, C. (2015). Leader Election and Shape Formation with Self-organizing
Programmable Matter. In DNA Computing and Molecular Programming - 21st International
Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings
(Vol. 9211, pp. 117--132). https://doi.org/10.1007/978-3-319-21999-8_8
bibtex: '@inproceedings{Derakhshandeh_Gmyr_Strothmann_A. Bazzi_W. Richa_Scheideler_2015,
series={Lecture Notes in Computer Science}, title={Leader Election and Shape Formation
with Self-organizing Programmable Matter}, volume={9211}, DOI={10.1007/978-3-319-21999-8_8},
booktitle={DNA Computing and Molecular Programming - 21st International Conference,
DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings}, author={Derakhshandeh,
Zahra and Gmyr, Robert and Strothmann, Thim Frederik and A. Bazzi, Rida and W.
Richa, Andrea and Scheideler, Christian}, year={2015}, pages={117--132}, collection={Lecture
Notes in Computer Science} }'
chicago: Derakhshandeh, Zahra, Robert Gmyr, Thim Frederik Strothmann, Rida A. Bazzi,
Andrea W. Richa, and Christian Scheideler. “Leader Election and Shape Formation
with Self-Organizing Programmable Matter.” In DNA Computing and Molecular Programming
- 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August
17-21, 2015. Proceedings, 9211:117--132. Lecture Notes in Computer Science,
2015. https://doi.org/10.1007/978-3-319-21999-8_8.
ieee: Z. Derakhshandeh, R. Gmyr, T. F. Strothmann, R. A. Bazzi, A. W. Richa, and
C. Scheideler, “Leader Election and Shape Formation with Self-organizing Programmable
Matter,” in DNA Computing and Molecular Programming - 21st International Conference,
DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings, 2015,
vol. 9211, pp. 117--132.
mla: Derakhshandeh, Zahra, et al. “Leader Election and Shape Formation with Self-Organizing
Programmable Matter.” DNA Computing and Molecular Programming - 21st International
Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings,
vol. 9211, 2015, pp. 117--132, doi:10.1007/978-3-319-21999-8_8.
short: 'Z. Derakhshandeh, R. Gmyr, T.F. Strothmann, R. A. Bazzi, A. W. Richa, C.
Scheideler, in: DNA Computing and Molecular Programming - 21st International Conference,
DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings, 2015,
pp. 117--132.'
date_created: 2018-03-28T05:49:12Z
date_updated: 2022-01-06T06:53:36Z
department:
- _id: '79'
doi: 10.1007/978-3-319-21999-8_8
intvolume: ' 9211'
language:
- iso: eng
page: 117--132
publication: DNA Computing and Molecular Programming - 21st International Conference,
DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings
publication_identifier:
isbn:
- 978-3-319-21998-1
series_title: Lecture Notes in Computer Science
status: public
title: Leader Election and Shape Formation with Self-organizing Programmable Matter
type: conference
user_id: '15504'
volume: 9211
year: '2015'
...
---
_id: '1851'
author:
- first_name: Zahra
full_name: Derakhshandeh, Zahra
last_name: Derakhshandeh
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Derakhshandeh Z, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. An Algorithmic
Framework for Shape Formation Problems in Self-Organizing Particle Systems. In:
Proceedings of the Second Annual International Conference on Nanoscale Computing
and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015. ACM;
2015:21:1--21:2. doi:10.1145/2800795.2800829'
apa: Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann,
T. F. (2015). An Algorithmic Framework for Shape Formation Problems in Self-Organizing
Particle Systems. In Proceedings of the Second Annual International Conference
on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September
21-22, 2015 (pp. 21:1--21:2). ACM. https://doi.org/10.1145/2800795.2800829
bibtex: '@inproceedings{Derakhshandeh_Gmyr_W. Richa_Scheideler_Strothmann_2015,
title={An Algorithmic Framework for Shape Formation Problems in Self-Organizing
Particle Systems}, DOI={10.1145/2800795.2800829},
booktitle={Proceedings of the Second Annual International Conference on Nanoscale
Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015},
publisher={ACM}, author={Derakhshandeh, Zahra and Gmyr, Robert and W. Richa, Andrea
and Scheideler, Christian and Strothmann, Thim Frederik}, year={2015}, pages={21:1--21:2}
}'
chicago: Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler,
and Thim Frederik Strothmann. “An Algorithmic Framework for Shape Formation Problems
in Self-Organizing Particle Systems.” In Proceedings of the Second Annual International
Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA,
USA, September 21-22, 2015, 21:1--21:2. ACM, 2015. https://doi.org/10.1145/2800795.2800829.
ieee: Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann,
“An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle
Systems,” in Proceedings of the Second Annual International Conference on Nanoscale
Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015,
2015, pp. 21:1--21:2.
mla: Derakhshandeh, Zahra, et al. “An Algorithmic Framework for Shape Formation
Problems in Self-Organizing Particle Systems.” Proceedings of the Second Annual
International Conference on Nanoscale Computing and Communication, NANOCOM’ 15,
Boston, MA, USA, September 21-22, 2015, ACM, 2015, pp. 21:1--21:2, doi:10.1145/2800795.2800829.
short: 'Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann,
in: Proceedings of the Second Annual International Conference on Nanoscale Computing
and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015, ACM, 2015,
pp. 21:1--21:2.'
date_created: 2018-03-28T05:50:25Z
date_updated: 2022-01-06T06:53:36Z
department:
- _id: '79'
doi: 10.1145/2800795.2800829
language:
- iso: eng
page: 21:1--21:2
publication: Proceedings of the Second Annual International Conference on Nanoscale
Computing and Communication, NANOCOM' 15, Boston, MA, USA, September 21-22, 2015
publication_identifier:
isbn:
- 978-1-4503-3674-1
publisher: ACM
status: public
title: An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle
Systems
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '1852'
author:
- first_name: Zahra
full_name: Derakhshandeh, Zahra
last_name: Derakhshandeh
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
- first_name: Rida
full_name: A. Bazzi, Rida
last_name: A. Bazzi
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Derakhshandeh Z, Gmyr R, Strothmann TF, A. Bazzi R, W. Richa A, Scheideler
C. Brief Announcement: On the Feasibility of Leader Election and Shape Formation
with Self-Organizing Programmable Matter. In: Proceedings of the 2015 ACM Symposium
on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\’{a}}n,
Spain, July 21 - 23, 2015. ACM; 2015:67--69. doi:10.1145/2767386.2767451'
apa: 'Derakhshandeh, Z., Gmyr, R., Strothmann, T. F., A. Bazzi, R., W. Richa, A.,
& Scheideler, C. (2015). Brief Announcement: On the Feasibility of Leader
Election and Shape Formation with Self-Organizing Programmable Matter. In Proceedings
of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San
Sebasti{\’{a}}n, Spain, July 21 - 23, 2015 (pp. 67--69). ACM. https://doi.org/10.1145/2767386.2767451'
bibtex: '@inproceedings{Derakhshandeh_Gmyr_Strothmann_A. Bazzi_W. Richa_Scheideler_2015,
title={Brief Announcement: On the Feasibility of Leader Election and Shape Formation
with Self-Organizing Programmable Matter}, DOI={10.1145/2767386.2767451},
booktitle={Proceedings of the 2015 ACM Symposium on Principles of Distributed
Computing, PODC 2015, Donostia-San Sebasti{\’{a}}n, Spain, July 21 - 23, 2015},
publisher={ACM}, author={Derakhshandeh, Zahra and Gmyr, Robert and Strothmann,
Thim Frederik and A. Bazzi, Rida and W. Richa, Andrea and Scheideler, Christian},
year={2015}, pages={67--69} }'
chicago: 'Derakhshandeh, Zahra, Robert Gmyr, Thim Frederik Strothmann, Rida A. Bazzi,
Andrea W. Richa, and Christian Scheideler. “Brief Announcement: On the Feasibility
of Leader Election and Shape Formation with Self-Organizing Programmable Matter.”
In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing,
PODC 2015, Donostia-San Sebasti{\’{a}}n, Spain, July 21 - 23, 2015, 67--69.
ACM, 2015. https://doi.org/10.1145/2767386.2767451.'
ieee: 'Z. Derakhshandeh, R. Gmyr, T. F. Strothmann, R. A. Bazzi, A. W. Richa, and
C. Scheideler, “Brief Announcement: On the Feasibility of Leader Election and
Shape Formation with Self-Organizing Programmable Matter,” in Proceedings of
the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San
Sebasti{\’{a}}n, Spain, July 21 - 23, 2015, 2015, pp. 67--69.'
mla: 'Derakhshandeh, Zahra, et al. “Brief Announcement: On the Feasibility of Leader
Election and Shape Formation with Self-Organizing Programmable Matter.” Proceedings
of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San
Sebasti{\’{a}}n, Spain, July 21 - 23, 2015, ACM, 2015, pp. 67--69, doi:10.1145/2767386.2767451.'
short: 'Z. Derakhshandeh, R. Gmyr, T.F. Strothmann, R. A. Bazzi, A. W. Richa, C.
Scheideler, in: Proceedings of the 2015 ACM Symposium on Principles of Distributed
Computing, PODC 2015, Donostia-San Sebasti{\’{a}}n, Spain, July 21 - 23, 2015,
ACM, 2015, pp. 67--69.'
date_created: 2018-03-28T05:52:44Z
date_updated: 2022-01-06T06:53:36Z
department:
- _id: '79'
doi: 10.1145/2767386.2767451
language:
- iso: eng
page: 67--69
publication: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing,
PODC 2015, Donostia-San Sebasti{\'{a}}n, Spain, July 21 - 23, 2015
publication_identifier:
isbn:
- 978-1-4503-3617-8
publisher: ACM
status: public
title: 'Brief Announcement: On the Feasibility of Leader Election and Shape Formation
with Self-Organizing Programmable Matter'
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '1853'
author:
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Koutsopoulos A, Scheideler C, Strothmann TF. Brief Announcement: Towards a
Universal Approach for the Finite Departure Problem in Overlay Networks. In: Proceedings
of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA
2015, Portland, OR, USA, June 13-15, 2015. ACM; 2015:77--79. doi:10.1145/2755573.2755614'
apa: 'Koutsopoulos, A., Scheideler, C., & Strothmann, T. F. (2015). Brief Announcement:
Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.
In Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and
Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015 (pp. 77--79).
ACM. https://doi.org/10.1145/2755573.2755614'
bibtex: '@inproceedings{Koutsopoulos_Scheideler_Strothmann_2015, title={Brief Announcement:
Towards a Universal Approach for the Finite Departure Problem in Overlay Networks},
DOI={10.1145/2755573.2755614},
booktitle={Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms
and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015}, publisher={ACM},
author={Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik},
year={2015}, pages={77--79} }'
chicago: 'Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann.
“Brief Announcement: Towards a Universal Approach for the Finite Departure Problem
in Overlay Networks.” In Proceedings of the 27th ACM on Symposium on Parallelism
in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015,
77--79. ACM, 2015. https://doi.org/10.1145/2755573.2755614.'
ieee: 'A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Brief Announcement:
Towards a Universal Approach for the Finite Departure Problem in Overlay Networks,”
in Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and
Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015, 2015, pp. 77--79.'
mla: 'Koutsopoulos, Andreas, et al. “Brief Announcement: Towards a Universal Approach
for the Finite Departure Problem in Overlay Networks.” Proceedings of the 27th
ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland,
OR, USA, June 13-15, 2015, ACM, 2015, pp. 77--79, doi:10.1145/2755573.2755614.'
short: 'A. Koutsopoulos, C. Scheideler, T.F. Strothmann, in: Proceedings of the
27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015,
Portland, OR, USA, June 13-15, 2015, ACM, 2015, pp. 77--79.'
date_created: 2018-03-28T05:57:20Z
date_updated: 2022-01-06T06:53:36Z
department:
- _id: '79'
doi: 10.1145/2755573.2755614
language:
- iso: eng
page: 77--79
publication: Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms
and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015
publication_identifier:
isbn:
- 978-1-4503-3588-1
publisher: ACM
status: public
title: 'Brief Announcement: Towards a Universal Approach for the Finite Departure
Problem in Overlay Networks'
type: conference
user_id: '15504'
year: '2015'
...