---
_id: '412'
abstract:
- lang: eng
text: In this paper we present and analyze HSkip+, a self-stabilizing overlay network
for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology
as the Skip+ graph proposed by Jacob et al. [PODC 2009] but its self-stabilization
mechanism significantly outperforms the self-stabilization mechanism proposed
for Skip+. Also, the nodes are now ordered according to their bandwidths and not
according to their identifiers. Various other solutions have already been proposed
for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing.
In addition to HSkip+ being self-stabilizing, its performance is on par with the
best previous bounds on the time and work for joining or leaving a network of
peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation
and congestion for routing messages is on par with the best previous bounds for
such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical
investigations are backed by simulations demonstrating that HSkip+ is indeed performing
much better than Skip+ and working correctly under high churn rates.
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Feldotto M, Scheideler C, Graffi K. HSkip+: A Self-Stabilizing Overlay Network
for Nodes with Heterogeneous Bandwidths. In: Proceedings of the 14th IEEE International
Conference on Peer-to-Peer Computing (P2P). ; 2014:1-10. doi:10.1109/P2P.2014.6934300'
apa: 'Feldotto, M., Scheideler, C., & Graffi, K. (2014). HSkip+: A Self-Stabilizing
Overlay Network for Nodes with Heterogeneous Bandwidths. In Proceedings of
the 14th IEEE International Conference on Peer-to-Peer Computing (P2P) (pp.
1–10). https://doi.org/10.1109/P2P.2014.6934300'
bibtex: '@inproceedings{Feldotto_Scheideler_Graffi_2014, title={HSkip+: A Self-Stabilizing
Overlay Network for Nodes with Heterogeneous Bandwidths}, DOI={10.1109/P2P.2014.6934300},
booktitle={Proceedings of the 14th IEEE International Conference on Peer-to-Peer
Computing (P2P)}, author={Feldotto, Matthias and Scheideler, Christian and Graffi,
Kalman}, year={2014}, pages={1–10} }'
chicago: 'Feldotto, Matthias, Christian Scheideler, and Kalman Graffi. “HSkip+:
A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” In
Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing
(P2P), 1–10, 2014. https://doi.org/10.1109/P2P.2014.6934300.'
ieee: 'M. Feldotto, C. Scheideler, and K. Graffi, “HSkip+: A Self-Stabilizing Overlay
Network for Nodes with Heterogeneous Bandwidths,” in Proceedings of the 14th
IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.'
mla: 'Feldotto, Matthias, et al. “HSkip+: A Self-Stabilizing Overlay Network for
Nodes with Heterogeneous Bandwidths.” Proceedings of the 14th IEEE International
Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10, doi:10.1109/P2P.2014.6934300.'
short: 'M. Feldotto, C. Scheideler, K. Graffi, in: Proceedings of the 14th IEEE
International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.'
date_created: 2017-10-17T12:42:12Z
date_updated: 2022-01-06T07:00:20Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
- _id: '541'
doi: 10.1109/P2P.2014.6934300
external_id:
arxiv:
- '1408.0395'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:34:00Z
date_updated: 2018-03-16T11:34:00Z
file_id: '1361'
file_name: 412-FSG2014P2P.pdf
file_size: 472321
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:34:00Z
has_accepted_license: '1'
page: 1-10
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 14th IEEE International Conference on Peer-to-Peer
Computing (P2P)
status: public
title: 'HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths'
type: conference
user_id: '14052'
year: '2014'
...
---
_id: '431'
abstract:
- lang: eng
text: In meiner Dissertation besch{\"a}ftige ich mich mit dem Entwurf und der Analyse
energieeffizienter Schedulingalgorithmen, insbesondere f{\"u}r sogenannte Speed-Scaling
Modelle. Diese stellen das theoretische Pendant von Techniken wie AMDs PowerNOW!
und Intels SpeedStep dar, welche es erlauben die Geschwindigkeit von Prozessoren
zur Laufzeit an die derzeitigen Bedingungen anzupassen. Theoretische Untersuchungen
solcher Modelle sind auf eine Arbeit von Yao, Demers und Shenker (FOCS'95) zur{\"u}ckzuf{\"u}hren.
Hier kombinieren die Autoren klassisches Deadline-Scheduling mit einem Prozessor
der Speed-Scaling beherrscht. Es gilt Jobs verschiedener Gr{\"o}ße fristgerecht
abzuarbeiten und die dabei verwendete Energie zu minimieren. Der Energieverbrauch
des Prozessors wird durch eine konvexe Funktion $\POW\colon\R_{\geq0}\to\R_{\geq0}$
modelliert, welche die Geschwindigkeit auf den Energieverbrauch abbildet.Meine
Dissertation betrachtet verschiedene Varianten des urspr{\"u}nglichen Speed-Scaling
Modells. Forschungsrelevante Ergebnisse sind in den Kapiteln 3 bis 6 zu finden
und erstrecken sich {\"u}ber die im Folgenden beschriebenen Aspekte:- Kapitel
3 und 4 betrachten verschiedene \emph{Price-Collecting} Varianten des Originalproblems.
Hier d{\"u}rfen einzelne Deadlines verfehlt werden, sofern eine jobabh{\"a}ngige
Strafe gezahlt wird. Ich entwerfe insbesondere Online-Algorithmen mit einer beweisbar
guten Competitiveness. Dabei liefern meine Ergebnisse substantielle Verbesserungen
bestehender Arbeiten und erweitern diese unter Anderem auf Szenarien mit mehreren
Prozessoren.- In Kapitel 5 wird statt des klassischen Deadline-Schedulings eine
Linearkombination der durchschnittlichen Antwortzeit und des Energieverbrauchs
betrachtet. Die Frage, ob dieses Problem NP-schwer ist, stellt eine der zentralen
Forschungsfragen in diesem Gebiet dar. F{\"u}r eine relaxierte Form dieser Frage
entwerfe ich einen effizienter Algorithmus und beweise seine Optimalit{\"a}t.-
Das letzte Kapitel betrachtet ein Modell, welches – auf den ersten Blick – nicht
direkt zur Speed-Scaling Literatur z{\"a}hlt. Hier geht es stattdessen um ein
allgemeines Resource-Constrained Scheduling, in dem sich die Prozessoren zusammen
eine gemeinsame, beliebig aufteilbare Ressource teilen. Ich untersuche die Komplexit{\"a}t
des Problems und entwerfe verschiedene Approximationsalgorithmen.
author:
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
citation:
ama: Kling P. Energy-Efficient Scheduling Algorithms. Universität Paderborn;
2014.
apa: Kling, P. (2014). Energy-efficient Scheduling Algorithms. Universität
Paderborn.
bibtex: '@book{Kling_2014, title={Energy-efficient Scheduling Algorithms}, publisher={Universität
Paderborn}, author={Kling, Peter}, year={2014} }'
chicago: Kling, Peter. Energy-Efficient Scheduling Algorithms. Universität
Paderborn, 2014.
ieee: P. Kling, Energy-efficient Scheduling Algorithms. Universität Paderborn,
2014.
mla: Kling, Peter. Energy-Efficient Scheduling Algorithms. Universität Paderborn,
2014.
short: P. Kling, Energy-Efficient Scheduling Algorithms, Universität Paderborn,
2014.
date_created: 2017-10-17T12:42:15Z
date_updated: 2022-01-06T07:00:52Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:31:29Z
date_updated: 2018-03-16T11:31:29Z
file_id: '1356'
file_name: 431-Peter_Kling_PhDThesis_01.pdf
file_size: 792106
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:31:29Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Energy-efficient Scheduling Algorithms
type: dissertation
user_id: '477'
year: '2014'
...
---
_id: '435'
abstract:
- lang: eng
text: We give a polynomial time algorithm to compute an optimal energy and fractional
weighted flow trade-off schedule for a speed-scalable processor with discrete
speeds.Our algorithm uses a geometric approach that is based on structural properties
obtained from a primal-dual formulation of the problem.
author:
- first_name: Antonios
full_name: Antoniadis, Antonios
last_name: Antoniadis
- first_name: Neal
full_name: Barcelo, Neal
last_name: Barcelo
- first_name: Mario
full_name: Consuegra, Mario
last_name: Consuegra
- first_name: Peer
full_name: Kling, Peer
last_name: Kling
- first_name: Michael
full_name: Nugent, Michael
last_name: Nugent
- first_name: Kirk
full_name: Pruhs, Kirk
last_name: Pruhs
- first_name: Michele
full_name: Scquizzato, Michele
last_name: Scquizzato
citation:
ama: 'Antoniadis A, Barcelo N, Consuegra M, et al. Efficient Computation of Optimal
Energy and Fractional Weighted Flow Trade-off Schedules. In: Proceedings of
the 31st Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs.
; 2014:63--74. doi:10.4230/LIPIcs.STACS.2014.63'
apa: Antoniadis, A., Barcelo, N., Consuegra, M., Kling, P., Nugent, M., Pruhs, K.,
& Scquizzato, M. (2014). Efficient Computation of Optimal Energy and Fractional
Weighted Flow Trade-off Schedules. In Proceedings of the 31st Symposium on
Theoretical Aspects of Computer Science (STACS) (pp. 63--74). https://doi.org/10.4230/LIPIcs.STACS.2014.63
bibtex: '@inproceedings{Antoniadis_Barcelo_Consuegra_Kling_Nugent_Pruhs_Scquizzato_2014,
series={LIPIcs}, title={Efficient Computation of Optimal Energy and Fractional
Weighted Flow Trade-off Schedules}, DOI={10.4230/LIPIcs.STACS.2014.63},
booktitle={Proceedings of the 31st Symposium on Theoretical Aspects of Computer
Science (STACS)}, author={Antoniadis, Antonios and Barcelo, Neal and Consuegra,
Mario and Kling, Peer and Nugent, Michael and Pruhs, Kirk and Scquizzato, Michele},
year={2014}, pages={63--74}, collection={LIPIcs} }'
chicago: Antoniadis, Antonios, Neal Barcelo, Mario Consuegra, Peer Kling, Michael
Nugent, Kirk Pruhs, and Michele Scquizzato. “Efficient Computation of Optimal
Energy and Fractional Weighted Flow Trade-off Schedules.” In Proceedings of
the 31st Symposium on Theoretical Aspects of Computer Science (STACS), 63--74.
LIPIcs, 2014. https://doi.org/10.4230/LIPIcs.STACS.2014.63.
ieee: A. Antoniadis et al., “Efficient Computation of Optimal Energy and
Fractional Weighted Flow Trade-off Schedules,” in Proceedings of the 31st Symposium
on Theoretical Aspects of Computer Science (STACS), 2014, pp. 63--74.
mla: Antoniadis, Antonios, et al. “Efficient Computation of Optimal Energy and Fractional
Weighted Flow Trade-off Schedules.” Proceedings of the 31st Symposium on Theoretical
Aspects of Computer Science (STACS), 2014, pp. 63--74, doi:10.4230/LIPIcs.STACS.2014.63.
short: 'A. Antoniadis, N. Barcelo, M. Consuegra, P. Kling, M. Nugent, K. Pruhs,
M. Scquizzato, in: Proceedings of the 31st Symposium on Theoretical Aspects of
Computer Science (STACS), 2014, pp. 63--74.'
date_created: 2017-10-17T12:42:16Z
date_updated: 2022-01-06T07:00:58Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.4230/LIPIcs.STACS.2014.63
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:30:23Z
date_updated: 2018-03-16T11:30:23Z
file_id: '1354'
file_name: 435-Kling_C2_STACS2014.pdf
file_size: 525851
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:30:23Z
has_accepted_license: '1'
language:
- iso: eng
page: 63--74
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 31st Symposium on Theoretical Aspects of Computer
Science (STACS)
series_title: LIPIcs
status: public
title: Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off
Schedules
type: conference
user_id: '477'
year: '2014'
...
---
_id: '16870'
citation:
ama: 'Flocchini P, Gao J, Kranakis E, Meyer auf der Heide F, eds. Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013. Vol 8243. Berlin, Heidelberg: Springer; 2014. doi:10.1007/978-3-642-45346-5'
apa: 'Flocchini, P., Gao, J., Kranakis, E., & Meyer auf der Heide, F. (Eds.).
(2014). Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013 (Vol. 8243). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-45346-5'
bibtex: '@book{Flocchini_Gao_Kranakis_Meyer auf der Heide_2014, place={Berlin, Heidelberg},
series={Lecture Notes in Computer Science}, title={Algorithms for Sensor Systems
- 9th International Symposium on Algorithms and Experiments for Sensor Systems,
Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013}, volume={8243},
DOI={10.1007/978-3-642-45346-5},
publisher={Springer}, year={2014}, collection={Lecture Notes in Computer Science}
}'
chicago: 'Flocchini, Paola, Jie Gao, Evangelos Kranakis, and Friedhelm Meyer auf
der Heide, eds. Algorithms for Sensor Systems - 9th International Symposium
on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed
Robotics, {ALGOSENSORS} 2013. Vol. 8243. Lecture Notes in Computer Science.
Berlin, Heidelberg: Springer, 2014. https://doi.org/10.1007/978-3-642-45346-5.'
ieee: 'P. Flocchini, J. Gao, E. Kranakis, and F. Meyer auf der Heide, Eds., Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, vol. 8243. Berlin, Heidelberg: Springer, 2014.'
mla: Flocchini, Paola, et al., editors. Algorithms for Sensor Systems - 9th International
Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks
and Distributed Robotics, {ALGOSENSORS} 2013. Vol. 8243, Springer, 2014, doi:10.1007/978-3-642-45346-5.
short: P. Flocchini, J. Gao, E. Kranakis, F. Meyer auf der Heide, eds., Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, Springer, Berlin, Heidelberg, 2014.
date_created: 2020-04-27T10:31:57Z
date_updated: 2022-01-06T06:52:58Z
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5
editor:
- first_name: Paola
full_name: Flocchini, Paola
last_name: Flocchini
- first_name: Jie
full_name: Gao, Jie
last_name: Gao
- first_name: Evangelos
full_name: Kranakis, Evangelos
last_name: Kranakis
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
intvolume: ' 8243'
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
isbn:
- '9783642453458'
- '9783642453465'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Algorithms for Sensor Systems - 9th International Symposium on Algorithms and
Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013
type: book_editor
user_id: '15415'
volume: 8243
year: '2014'
...
---
_id: '16394'
author:
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Lukovszki T, Meyer auf der Heide F. Fast Collisionless Pattern Formation by
Anonymous, Position-Aware Robots. In: Lecture Notes in Computer Science.
Cham; 2014. doi:10.1007/978-3-319-14472-6_17'
apa: Lukovszki, T., & Meyer auf der Heide, F. (2014). Fast Collisionless Pattern
Formation by Anonymous, Position-Aware Robots. In Lecture Notes in Computer
Science. Cham. https://doi.org/10.1007/978-3-319-14472-6_17
bibtex: '@inbook{Lukovszki_Meyer auf der Heide_2014, place={Cham}, title={Fast Collisionless
Pattern Formation by Anonymous, Position-Aware Robots}, DOI={10.1007/978-3-319-14472-6_17},
booktitle={Lecture Notes in Computer Science}, author={Lukovszki, Tamás and Meyer
auf der Heide, Friedhelm}, year={2014} }'
chicago: Lukovszki, Tamás, and Friedhelm Meyer auf der Heide. “Fast Collisionless
Pattern Formation by Anonymous, Position-Aware Robots.” In Lecture Notes in
Computer Science. Cham, 2014. https://doi.org/10.1007/978-3-319-14472-6_17.
ieee: T. Lukovszki and F. Meyer auf der Heide, “Fast Collisionless Pattern Formation
by Anonymous, Position-Aware Robots,” in Lecture Notes in Computer Science,
Cham, 2014.
mla: Lukovszki, Tamás, and Friedhelm Meyer auf der Heide. “Fast Collisionless Pattern
Formation by Anonymous, Position-Aware Robots.” Lecture Notes in Computer Science,
2014, doi:10.1007/978-3-319-14472-6_17.
short: 'T. Lukovszki, F. Meyer auf der Heide, in: Lecture Notes in Computer Science,
Cham, 2014.'
date_created: 2020-04-03T07:58:53Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-319-14472-6_17
language:
- iso: eng
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783319144719'
- '9783319144726'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots
type: book_chapter
user_id: '15415'
year: '2014'
...
---
_id: '16395'
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Meyer auf der Heide F. Continuous Aggregation in Dynamic Ad-Hoc
Networks. In: Structural Information and Communication Complexity. Cham;
2014. doi:10.1007/978-3-319-09620-9_16'
apa: Abshoff, S., & Meyer auf der Heide, F. (2014). Continuous Aggregation in
Dynamic Ad-Hoc Networks. In Structural Information and Communication Complexity.
Cham. https://doi.org/10.1007/978-3-319-09620-9_16
bibtex: '@inbook{Abshoff_Meyer auf der Heide_2014, place={Cham}, title={Continuous
Aggregation in Dynamic Ad-Hoc Networks}, DOI={10.1007/978-3-319-09620-9_16},
booktitle={Structural Information and Communication Complexity}, author={Abshoff,
Sebastian and Meyer auf der Heide, Friedhelm}, year={2014} }'
chicago: Abshoff, Sebastian, and Friedhelm Meyer auf der Heide. “Continuous Aggregation
in Dynamic Ad-Hoc Networks.” In Structural Information and Communication Complexity.
Cham, 2014. https://doi.org/10.1007/978-3-319-09620-9_16.
ieee: S. Abshoff and F. Meyer auf der Heide, “Continuous Aggregation in Dynamic
Ad-Hoc Networks,” in Structural Information and Communication Complexity,
Cham, 2014.
mla: Abshoff, Sebastian, and Friedhelm Meyer auf der Heide. “Continuous Aggregation
in Dynamic Ad-Hoc Networks.” Structural Information and Communication Complexity,
2014, doi:10.1007/978-3-319-09620-9_16.
short: 'S. Abshoff, F. Meyer auf der Heide, in: Structural Information and Communication
Complexity, Cham, 2014.'
date_created: 2020-04-03T09:00:16Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-319-09620-9_16
language:
- iso: eng
place: Cham
publication: Structural Information and Communication Complexity
publication_identifier:
isbn:
- '9783319096193'
- '9783319096209'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Continuous Aggregation in Dynamic Ad-Hoc Networks
type: book_chapter
user_id: '15415'
year: '2014'
...
---
_id: '19981'
author:
- first_name: Bärbel
full_name: Mertsching, Bärbel
last_name: Mertsching
- first_name: Mohammad
full_name: Divband Soorati, Mohammad
last_name: Divband Soorati
- first_name: Tobias
full_name: Kotthauser, Tobias
last_name: Kotthauser
citation:
ama: Mertsching B, Divband Soorati M, Kotthauser T. Automatic Reconstruction of
Polygonal Room Models from 3D Point Clouds. IEEE International Conference on
Robotics and Biomimetics (ROBIO). 2013:661-667.
apa: Mertsching, B., Divband Soorati, M., & Kotthauser, T. (2013). Automatic
Reconstruction of Polygonal Room Models from 3D Point Clouds. IEEE International
Conference on Robotics and Biomimetics (ROBIO), 661–667.
bibtex: '@article{Mertsching_Divband Soorati_Kotthauser_2013, title={Automatic Reconstruction
of Polygonal Room Models from 3D Point Clouds}, journal={IEEE International Conference
on Robotics and Biomimetics (ROBIO)}, author={Mertsching, Bärbel and Divband Soorati,
Mohammad and Kotthauser, Tobias}, year={2013}, pages={661–667} }'
chicago: Mertsching, Bärbel, Mohammad Divband Soorati, and Tobias Kotthauser. “Automatic
Reconstruction of Polygonal Room Models from 3D Point Clouds.” IEEE International
Conference on Robotics and Biomimetics (ROBIO), 2013, 661–67.
ieee: B. Mertsching, M. Divband Soorati, and T. Kotthauser, “Automatic Reconstruction
of Polygonal Room Models from 3D Point Clouds,” IEEE International Conference
on Robotics and Biomimetics (ROBIO), pp. 661–667, 2013.
mla: Mertsching, Bärbel, et al. “Automatic Reconstruction of Polygonal Room Models
from 3D Point Clouds.” IEEE International Conference on Robotics and Biomimetics
(ROBIO), 2013, pp. 661–67.
short: B. Mertsching, M. Divband Soorati, T. Kotthauser, IEEE International Conference
on Robotics and Biomimetics (ROBIO) (2013) 661–667.
date_created: 2020-10-12T13:21:53Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
page: 661-667
publication: IEEE International Conference on Robotics and Biomimetics (ROBIO)
status: public
title: Automatic Reconstruction of Polygonal Room Models from 3D Point Clouds
type: journal_article
user_id: '15415'
year: '2013'
...
---
_id: '20148'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Istvan
full_name: Karsai, Istvan
last_name: Karsai
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
citation:
ama: 'Hamann H, Karsai I, Schmickl T. Time delay implies cost on task switching:
A model to investigate the efficiency of task partitioning. Bulletin of Mathematical
Biology. 2013;75(7):1181-1206. doi:10.1007/s11538-013-9851-4 '
apa: 'Hamann, H., Karsai, I., & Schmickl, T. (2013). Time delay implies cost
on task switching: A model to investigate the efficiency of task partitioning.
Bulletin of Mathematical Biology, 75(7), 1181–1206. https://doi.org/10.1007/s11538-013-9851-4 '
bibtex: '@article{Hamann_Karsai_Schmickl_2013, title={Time delay implies cost on
task switching: A model to investigate the efficiency of task partitioning}, volume={75},
DOI={10.1007/s11538-013-9851-4
}, number={7}, journal={Bulletin of Mathematical Biology}, author={Hamann,
Heiko and Karsai, Istvan and Schmickl, Thomas}, year={2013}, pages={1181–1206}
}'
chicago: 'Hamann, Heiko, Istvan Karsai, and Thomas Schmickl. “Time Delay Implies
Cost on Task Switching: A Model to Investigate the Efficiency of Task Partitioning.”
Bulletin of Mathematical Biology 75, no. 7 (2013): 1181–1206. https://doi.org/10.1007/s11538-013-9851-4 .'
ieee: 'H. Hamann, I. Karsai, and T. Schmickl, “Time delay implies cost on task switching:
A model to investigate the efficiency of task partitioning,” Bulletin of Mathematical
Biology, vol. 75, no. 7, pp. 1181–1206, 2013.'
mla: 'Hamann, Heiko, et al. “Time Delay Implies Cost on Task Switching: A Model
to Investigate the Efficiency of Task Partitioning.” Bulletin of Mathematical
Biology, vol. 75, no. 7, 2013, pp. 1181–206, doi:10.1007/s11538-013-9851-4 .'
short: H. Hamann, I. Karsai, T. Schmickl, Bulletin of Mathematical Biology 75 (2013)
1181–1206.
date_created: 2020-10-21T08:41:17Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: '10.1007/s11538-013-9851-4 '
intvolume: ' 75'
issue: '7'
language:
- iso: eng
page: 1181-1206
publication: Bulletin of Mathematical Biology
status: public
title: 'Time delay implies cost on task switching: A model to investigate the efficiency
of task partitioning'
type: journal_article
user_id: '15415'
volume: 75
year: '2013'
...
---
_id: '20150'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Jürgen
full_name: Stradner, Jürgen
last_name: Stradner
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
- first_name: Ronald
full_name: Thenius, Ronald
last_name: Thenius
- first_name: Payam
full_name: Zahadat, Payam
last_name: Zahadat
citation:
ama: Hamann H, Schmickl T, Stradner J, Crailsheim K, Thenius R, Zahadat P. Algorithmic
Requirements for Swarm Intelligence in Differently Coupled Collective Systems.
Chaos, Solitons & Fractals. 2013;50:100-114. doi:10.1016/j.chaos.2013.01.011
apa: Hamann, H., Schmickl, T., Stradner, J., Crailsheim, K., Thenius, R., &
Zahadat, P. (2013). Algorithmic Requirements for Swarm Intelligence in Differently
Coupled Collective Systems. Chaos, Solitons & Fractals, 50,
100–114. https://doi.org/10.1016/j.chaos.2013.01.011
bibtex: '@article{Hamann_Schmickl_Stradner_Crailsheim_Thenius_Zahadat_2013, title={Algorithmic
Requirements for Swarm Intelligence in Differently Coupled Collective Systems},
volume={50}, DOI={10.1016/j.chaos.2013.01.011},
journal={Chaos, Solitons & Fractals}, author={Hamann, Heiko and Schmickl,
Thomas and Stradner, Jürgen and Crailsheim, Karl and Thenius, Ronald and Zahadat,
Payam}, year={2013}, pages={100–114} }'
chicago: 'Hamann, Heiko, Thomas Schmickl, Jürgen Stradner, Karl Crailsheim, Ronald
Thenius, and Payam Zahadat. “Algorithmic Requirements for Swarm Intelligence in
Differently Coupled Collective Systems.” Chaos, Solitons & Fractals
50 (2013): 100–114. https://doi.org/10.1016/j.chaos.2013.01.011.'
ieee: H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, R. Thenius, and P. Zahadat,
“Algorithmic Requirements for Swarm Intelligence in Differently Coupled Collective
Systems,” Chaos, Solitons & Fractals, vol. 50, pp. 100–114, 2013.
mla: Hamann, Heiko, et al. “Algorithmic Requirements for Swarm Intelligence in Differently
Coupled Collective Systems.” Chaos, Solitons & Fractals, vol. 50, 2013,
pp. 100–14, doi:10.1016/j.chaos.2013.01.011.
short: H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, R. Thenius, P. Zahadat,
Chaos, Solitons & Fractals 50 (2013) 100–114.
date_created: 2020-10-21T08:46:02Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: 10.1016/j.chaos.2013.01.011
intvolume: ' 50'
language:
- iso: eng
page: 100-114
publication: Chaos, Solitons & Fractals
status: public
title: Algorithmic Requirements for Swarm Intelligence in Differently Coupled Collective
Systems
type: journal_article
user_id: '15415'
volume: 50
year: '2013'
...
---
_id: '20151'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Jürgen
full_name: Stradner, Jürgen
last_name: Stradner
- first_name: Christopher
full_name: Schwarzer, Christopher
last_name: Schwarzer
- first_name: Nico K.
full_name: Michiels, Nico K.
last_name: Michiels
- first_name: Anna Isabel
full_name: Esparcia-Alcazar, Anna Isabel
last_name: Esparcia-Alcazar
citation:
ama: 'Hamann H, Schmickl T, Stradner J, Schwarzer C, Michiels NK, Esparcia-Alcazar
AI. Virtual Spatiality in Agent Controllers: Encoding Compartmentalization. In:
Applications of Evolutionary Computation - 16th European Conference (EvoApplications
2013). Vol 7835. ; 2013:579-588. doi:10.1007/978-3-642-37192-9_58'
apa: 'Hamann, H., Schmickl, T., Stradner, J., Schwarzer, C., Michiels, N. K., &
Esparcia-Alcazar, A. I. (2013). Virtual Spatiality in Agent Controllers: Encoding
Compartmentalization. In Applications of Evolutionary Computation - 16th European
Conference (EvoApplications 2013) (Vol. 7835, pp. 579–588). https://doi.org/10.1007/978-3-642-37192-9_58'
bibtex: '@inproceedings{Hamann_Schmickl_Stradner_Schwarzer_Michiels_Esparcia-Alcazar_2013,
title={Virtual Spatiality in Agent Controllers: Encoding Compartmentalization},
volume={7835}, DOI={10.1007/978-3-642-37192-9_58},
booktitle={Applications of Evolutionary Computation - 16th European Conference
(EvoApplications 2013)}, author={Hamann, Heiko and Schmickl, Thomas and Stradner,
Jürgen and Schwarzer, Christopher and Michiels, Nico K. and Esparcia-Alcazar,
Anna Isabel}, year={2013}, pages={579–588} }'
chicago: 'Hamann, Heiko, Thomas Schmickl, Jürgen Stradner, Christopher Schwarzer,
Nico K. Michiels, and Anna Isabel Esparcia-Alcazar. “Virtual Spatiality in Agent
Controllers: Encoding Compartmentalization.” In Applications of Evolutionary
Computation - 16th European Conference (EvoApplications 2013), 7835:579–88,
2013. https://doi.org/10.1007/978-3-642-37192-9_58.'
ieee: 'H. Hamann, T. Schmickl, J. Stradner, C. Schwarzer, N. K. Michiels, and A.
I. Esparcia-Alcazar, “Virtual Spatiality in Agent Controllers: Encoding Compartmentalization,”
in Applications of Evolutionary Computation - 16th European Conference (EvoApplications
2013), 2013, vol. 7835, pp. 579–588.'
mla: 'Hamann, Heiko, et al. “Virtual Spatiality in Agent Controllers: Encoding Compartmentalization.”
Applications of Evolutionary Computation - 16th European Conference (EvoApplications
2013), vol. 7835, 2013, pp. 579–88, doi:10.1007/978-3-642-37192-9_58.'
short: 'H. Hamann, T. Schmickl, J. Stradner, C. Schwarzer, N.K. Michiels, A.I. Esparcia-Alcazar,
in: Applications of Evolutionary Computation - 16th European Conference (EvoApplications
2013), 2013, pp. 579–588.'
date_created: 2020-10-21T08:53:30Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-642-37192-9_58
intvolume: ' 7835'
language:
- iso: eng
page: 579-588
publication: Applications of Evolutionary Computation - 16th European Conference (EvoApplications
2013)
status: public
title: 'Virtual Spatiality in Agent Controllers: Encoding Compartmentalization'
type: conference
user_id: '15415'
volume: 7835
year: '2013'
...
---
_id: '20160'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: 'Hamann H. A Reductionist Approach to Hypothesis-Catching for the Analysis
of Self-Organizing Decision-Making Systems. In: 7th IEEE Int. Conf. on Self-Adaptive
and Self-Organizing Systems (SASO 2013). IEEE Press; 2013:227-236. doi:10.1109/SASO.2013.10'
apa: Hamann, H. (2013). A Reductionist Approach to Hypothesis-Catching for the Analysis
of Self-Organizing Decision-Making Systems. In 7th IEEE Int. Conf. on Self-Adaptive
and Self-Organizing Systems (SASO 2013) (pp. 227–236). IEEE Press. https://doi.org/10.1109/SASO.2013.10
bibtex: '@inproceedings{Hamann_2013, title={A Reductionist Approach to Hypothesis-Catching
for the Analysis of Self-Organizing Decision-Making Systems}, DOI={10.1109/SASO.2013.10},
booktitle={7th IEEE Int. Conf. on Self-Adaptive and Self-Organizing Systems (SASO
2013)}, publisher={IEEE Press}, author={Hamann, Heiko}, year={2013}, pages={227–236}
}'
chicago: Hamann, Heiko. “A Reductionist Approach to Hypothesis-Catching for the
Analysis of Self-Organizing Decision-Making Systems.” In 7th IEEE Int. Conf.
on Self-Adaptive and Self-Organizing Systems (SASO 2013), 227–36. IEEE Press,
2013. https://doi.org/10.1109/SASO.2013.10.
ieee: H. Hamann, “A Reductionist Approach to Hypothesis-Catching for the Analysis
of Self-Organizing Decision-Making Systems,” in 7th IEEE Int. Conf. on Self-Adaptive
and Self-Organizing Systems (SASO 2013), 2013, pp. 227–236.
mla: Hamann, Heiko. “A Reductionist Approach to Hypothesis-Catching for the Analysis
of Self-Organizing Decision-Making Systems.” 7th IEEE Int. Conf. on Self-Adaptive
and Self-Organizing Systems (SASO 2013), IEEE Press, 2013, pp. 227–36, doi:10.1109/SASO.2013.10.
short: 'H. Hamann, in: 7th IEEE Int. Conf. on Self-Adaptive and Self-Organizing
Systems (SASO 2013), IEEE Press, 2013, pp. 227–236.'
date_created: 2020-10-21T13:48:26Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: 10.1109/SASO.2013.10
language:
- iso: eng
page: 227-236
publication: 7th IEEE Int. Conf. on Self-Adaptive and Self-Organizing Systems (SASO
2013)
publisher: IEEE Press
status: public
title: A Reductionist Approach to Hypothesis-Catching for the Analysis of Self-Organizing
Decision-Making Systems
type: conference
user_id: '15415'
year: '2013'
...
---
_id: '20161'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Pietro
full_name: Lio, Pietro
last_name: Lio
- first_name: Orazio
full_name: Miglino, Orazio
last_name: Miglino
- first_name: Giuseppe
full_name: Nicosia, Giuseppe
last_name: Nicosia
- first_name: Stefano
full_name: Nolfi, Stefano
last_name: Nolfi
- first_name: Mario
full_name: Pavone, Mario
last_name: Pavone
citation:
ama: 'Hamann H, Lio P, Miglino O, Nicosia G, Nolfi S, Pavone M. Speciation Dynamics:
Generating Selective Pressure Towards Diversity. In: 12th European Conference
on Artificial Life (ECAL 2013). MIT Press; 2013.'
apa: 'Hamann, H., Lio, P., Miglino, O., Nicosia, G., Nolfi, S., & Pavone, M.
(2013). Speciation Dynamics: Generating Selective Pressure Towards Diversity.
In 12th European Conference on Artificial Life (ECAL 2013). MIT Press.'
bibtex: '@inproceedings{Hamann_Lio_Miglino_Nicosia_Nolfi_Pavone_2013, title={Speciation
Dynamics: Generating Selective Pressure Towards Diversity}, booktitle={12th European
Conference on Artificial Life (ECAL 2013)}, publisher={MIT Press}, author={Hamann,
Heiko and Lio, Pietro and Miglino, Orazio and Nicosia, Giuseppe and Nolfi, Stefano
and Pavone, Mario}, year={2013} }'
chicago: 'Hamann, Heiko, Pietro Lio, Orazio Miglino, Giuseppe Nicosia, Stefano Nolfi,
and Mario Pavone. “Speciation Dynamics: Generating Selective Pressure Towards
Diversity.” In 12th European Conference on Artificial Life (ECAL 2013).
MIT Press, 2013.'
ieee: 'H. Hamann, P. Lio, O. Miglino, G. Nicosia, S. Nolfi, and M. Pavone, “Speciation
Dynamics: Generating Selective Pressure Towards Diversity,” in 12th European
Conference on Artificial Life (ECAL 2013), 2013.'
mla: 'Hamann, Heiko, et al. “Speciation Dynamics: Generating Selective Pressure
Towards Diversity.” 12th European Conference on Artificial Life (ECAL 2013),
MIT Press, 2013.'
short: 'H. Hamann, P. Lio, O. Miglino, G. Nicosia, S. Nolfi, M. Pavone, in: 12th
European Conference on Artificial Life (ECAL 2013), MIT Press, 2013.'
date_created: 2020-10-21T13:53:59Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
publication: 12th European Conference on Artificial Life (ECAL 2013)
publisher: MIT Press
status: public
title: 'Speciation Dynamics: Generating Selective Pressure Towards Diversity'
type: conference
user_id: '15415'
year: '2013'
...
---
_id: '20162'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: 'Hamann H. Towards Swarm Calculus: Urn Models of Collective Decisions and Universal
Properties of Swarm Performance. Swarm Intelligence. 2013;7(3):145-172.
doi:10.1007/s11721-013-0080-0'
apa: 'Hamann, H. (2013). Towards Swarm Calculus: Urn Models of Collective Decisions
and Universal Properties of Swarm Performance. Swarm Intelligence, 7(3),
145–172. https://doi.org/10.1007/s11721-013-0080-0'
bibtex: '@article{Hamann_2013, title={Towards Swarm Calculus: Urn Models of Collective
Decisions and Universal Properties of Swarm Performance}, volume={7}, DOI={10.1007/s11721-013-0080-0},
number={3}, journal={Swarm Intelligence}, author={Hamann, Heiko}, year={2013},
pages={145–172} }'
chicago: 'Hamann, Heiko. “Towards Swarm Calculus: Urn Models of Collective Decisions
and Universal Properties of Swarm Performance.” Swarm Intelligence 7, no.
3 (2013): 145–72. https://doi.org/10.1007/s11721-013-0080-0.'
ieee: 'H. Hamann, “Towards Swarm Calculus: Urn Models of Collective Decisions and
Universal Properties of Swarm Performance,” Swarm Intelligence, vol. 7,
no. 3, pp. 145–172, 2013.'
mla: 'Hamann, Heiko. “Towards Swarm Calculus: Urn Models of Collective Decisions
and Universal Properties of Swarm Performance.” Swarm Intelligence, vol.
7, no. 3, 2013, pp. 145–72, doi:10.1007/s11721-013-0080-0.'
short: H. Hamann, Swarm Intelligence 7 (2013) 145–172.
date_created: 2020-10-21T13:57:36Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/s11721-013-0080-0
intvolume: ' 7'
issue: '3'
language:
- iso: eng
page: 145-172
publication: Swarm Intelligence
status: public
title: 'Towards Swarm Calculus: Urn Models of Collective Decisions and Universal Properties
of Swarm Performance'
type: journal_article
user_id: '15415'
volume: 7
year: '2013'
...
---
_id: '17439'
abstract:
- lang: eng
text: Viele virtuelle 3-D-Szenen im industriellen Bereich sind nicht gleichmäßig
strukturiert, z.B. weil sie eine stark unterschiedliche Dichteverteilung der Polygone
aufweisen. Für solch heterogene Daten existiert kein Algorithmus, der die Gesamtheit
der Daten sowohl schnell als auch mit guter Qualität darstellen kann. Die Auswahl
der richtigen Algorithmen für einzelne Szenenteile durch einen Experten ist zeitintensiv
und in vielen Visualisierungssystemen nicht umzusetzen. Um dieses Problem zu lösen,
setzt das hier vorgestellte Multi-Algorithmen-Rendering verschiedene Renderingalgorithmen
gleichzeitig ein, um eine virtuelle 3-D-Szene darzustellen. Das Verfahren unterteilt
die Szene dafür in einem Vorverarbeitungsschritt automatisch in geeignete Teilregionen
und bestimmt deren Eigenschaften. Diese Daten werden zur Laufzeit dazu genutzt,
um ständig für den aktuellen Standpunkt des Betrachters eine Abschätzung der Qualität
und Laufzeit der zur Auswahl stehenden Renderingalgorithmen zu berechnen. Durch
die Lösung eines Optimierungsproblems kann so bei vorgegebener Bildrate durch
die passende Zuordnung der Algorithmen zu den Regionen die Bildqualität optimiert
werden – bei automatischer Anpassung an die Leistungsfähigkeit der eingesetzten
Hardware. In einer experimentellen Evaluierung vergleichen wir die Laufzeit und
Bildqualität des Verfahrens mit denen verbreiteter Standardrenderingverfahren.
author:
- first_name: Ralf
full_name: Petring, Ralf
last_name: Petring
- first_name: Benjamin
full_name: Eikel, Benjamin
last_name: Eikel
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Petring R, Eikel B, Jähn C, Fischer M, Meyer auf der Heide F. Darstellung
heterogener 3-D-Szenen in Echtzeit. In: 11. Paderborner Workshop Augmented
& Virtual Reality in Der Produktentstehung. Vol 311. Verlagsschriftenreihe
des Heinz Nixdorf Instituts. Paderborn; 2013:49--60.'
apa: Petring, R., Eikel, B., Jähn, C., Fischer, M., & Meyer auf der Heide, F.
(2013). Darstellung heterogener 3-D-Szenen in Echtzeit. In 11. Paderborner
Workshop Augmented & Virtual Reality in der Produktentstehung (Vol. 311,
pp. 49--60). Paderborn.
bibtex: '@inproceedings{Petring_Eikel_Jähn_Fischer_Meyer auf der Heide_2013, place={Paderborn},
series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Darstellung
heterogener 3-D-Szenen in Echtzeit}, volume={311}, booktitle={11. Paderborner
Workshop Augmented & Virtual Reality in der Produktentstehung}, author={Petring,
Ralf and Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias and Meyer auf
der Heide, Friedhelm}, year={2013}, pages={49--60}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts} }'
chicago: Petring, Ralf, Benjamin Eikel, Claudius Jähn, Matthias Fischer, and Friedhelm
Meyer auf der Heide. “Darstellung Heterogener 3-D-Szenen in Echtzeit.” In 11.
Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung,
311:49--60. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn, 2013.
ieee: R. Petring, B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Darstellung
heterogener 3-D-Szenen in Echtzeit,” in 11. Paderborner Workshop Augmented
& Virtual Reality in der Produktentstehung, 2013, vol. 311, pp. 49--60.
mla: Petring, Ralf, et al. “Darstellung Heterogener 3-D-Szenen in Echtzeit.” 11.
Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung,
vol. 311, 2013, pp. 49--60.
short: 'R. Petring, B. Eikel, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: 11.
Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung,
Paderborn, 2013, pp. 49--60.'
date_created: 2020-07-29T08:55:43Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
intvolume: ' 311'
language:
- iso: eng
page: 49--60
place: Paderborn
publication: 11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Darstellung heterogener 3-D-Szenen in Echtzeit
type: conference
user_id: '15415'
volume: 311
year: '2013'
...
---
_id: '17440'
author:
- first_name: Benjamin
full_name: Eikel, Benjamin
last_name: Eikel
citation:
ama: 'Eikel B. Spherical Visibility Sampling : Preprocessed Visibility for Occlusion
Culling in Complex 3D Scenes. Universität Paderborn; 2013.'
apa: 'Eikel, B. (2013). Spherical visibility sampling : preprocessed visibility
for occlusion culling in complex 3D scenes. Universität Paderborn.'
bibtex: '@book{Eikel_2013, place={Universität Paderborn}, title={Spherical visibility
sampling : preprocessed visibility for occlusion culling in complex 3D scenes},
author={Eikel, Benjamin}, year={2013} }'
chicago: 'Eikel, Benjamin. Spherical Visibility Sampling : Preprocessed Visibility
for Occlusion Culling in Complex 3D Scenes. Universität Paderborn, 2013.'
ieee: 'B. Eikel, Spherical visibility sampling : preprocessed visibility for
occlusion culling in complex 3D scenes. Universität Paderborn, 2013.'
mla: 'Eikel, Benjamin. Spherical Visibility Sampling : Preprocessed Visibility
for Occlusion Culling in Complex 3D Scenes. 2013.'
short: 'B. Eikel, Spherical Visibility Sampling : Preprocessed Visibility for Occlusion
Culling in Complex 3D Scenes, Universität Paderborn, 2013.'
date_created: 2020-07-29T09:11:23Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
language:
- iso: eng
place: Universität Paderborn
related_material:
link:
- relation: confirmation
url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12683
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: 'Spherical visibility sampling : preprocessed visibility for occlusion culling
in complex 3D scenes'
type: dissertation
user_id: '15415'
year: '2013'
...
---
_id: '17442'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Meyer auf der Heide F. Algorithmische Grundlagen für die Selbstorganisation
von Roboterschwärmen. In: 11. Paderborner Workshop Augmented & Virtual
Reality in Der Produktentstehung. Vol 311. Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn; 2013:7-16.'
apa: Meyer auf der Heide, F. (2013). Algorithmische Grundlagen für die Selbstorganisation
von Roboterschwärmen. 11. Paderborner Workshop Augmented & Virtual Reality
in Der Produktentstehung, 311, 7–16.
bibtex: '@inproceedings{Meyer auf der Heide_2013, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, title={Algorithmische Grundlagen für
die Selbstorganisation von Roboterschwärmen}, volume={311}, booktitle={11. Paderborner
Workshop Augmented & Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Meyer auf der Heide, Friedhelm},
year={2013}, pages={7–16}, collection={Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn} }'
chicago: Meyer auf der Heide, Friedhelm. “Algorithmische Grundlagen Für Die Selbstorganisation
von Roboterschwärmen.” In 11. Paderborner Workshop Augmented & Virtual
Reality in Der Produktentstehung, 311:7–16. Verlagsschriftenreihe Des Heinz
Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn, 2013.
ieee: F. Meyer auf der Heide, “Algorithmische Grundlagen für die Selbstorganisation
von Roboterschwärmen,” in 11. Paderborner Workshop Augmented & Virtual
Reality in der Produktentstehung, 2013, vol. 311, pp. 7–16.
mla: Meyer auf der Heide, Friedhelm. “Algorithmische Grundlagen Für Die Selbstorganisation
von Roboterschwärmen.” 11. Paderborner Workshop Augmented & Virtual Reality
in Der Produktentstehung, vol. 311, Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn, 2013, pp. 7–16.
short: 'F. Meyer auf der Heide, in: 11. Paderborner Workshop Augmented & Virtual
Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn, 2013, pp. 7–16.'
date_created: 2020-07-29T09:44:04Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 311'
language:
- iso: eng
page: 7-16
publication: 11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Algorithmische Grundlagen für die Selbstorganisation von Roboterschwärmen
type: conference
user_id: '5786'
volume: 311
year: '2013'
...
---
_id: '17443'
citation:
ama: Gausemeier J, Grafe M, Meyer auf der Heide F, eds. 11. Paderborner Workshop
Augmented & Virtual Reality in Der Produktentstehung. Vol 311. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2013.
apa: Gausemeier, J., Grafe, M., & Meyer auf der Heide, F. (Eds.). (2013). 11.
Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
(Vol. 311). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Gausemeier_Grafe_Meyer auf der Heide_2013, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, title={11. Paderborner Workshop Augmented
& Virtual Reality in der Produktentstehung}, volume={311}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, year={2013}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Gausemeier, Jürgen, Michael Grafe, and Friedhelm Meyer auf der Heide, eds.
11. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung.
Vol. 311. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2013.
ieee: J. Gausemeier, M. Grafe, and F. Meyer auf der Heide, Eds., 11. Paderborner
Workshop Augmented & Virtual Reality in der Produktentstehung, vol. 311.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2013.
mla: Gausemeier, Jürgen, et al., editors. 11. Paderborner Workshop Augmented
& Virtual Reality in Der Produktentstehung. Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn, 2013.
short: J. Gausemeier, M. Grafe, F. Meyer auf der Heide, eds., 11. Paderborner Workshop
Augmented & Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2013.
date_created: 2020-07-29T09:52:31Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
- _id: '26'
editor:
- first_name: Jürgen
full_name: Gausemeier, Jürgen
last_name: Gausemeier
- first_name: Michael
full_name: Grafe, Michael
last_name: Grafe
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
intvolume: ' 311'
language:
- iso: eng
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: 11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
type: conference_editor
user_id: '5786'
volume: 311
year: '2013'
...
---
_id: '17663'
abstract:
- lang: eng
text: 'In this paper, we define and study a new problem, referred to as the Dependent
Unsplittable Flow Problem (D-UFP). We present and discuss this problem in the
context of large-scale powerful (radar/camera) sensor networks, but we believe
it has important applications on the admission of large flows in other networks
as well. In order to optimize the selection of flows transmitted to the gateway,
D-UFP takes into account possible dependencies between flows. We show that D-UFP
is more difficult than NP-hard problems for which no good approximation is known.
Then, we address two special cases of this problem: the case where all the sensors
have a shared channel and the case where the sensors form a mesh and route to
the gateway over a spanning tree.'
author:
- first_name: R.
full_name: Cohen, R.
last_name: Cohen
- first_name: I.
full_name: Nudelman, I.
last_name: Nudelman
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
citation:
ama: Cohen R, Nudelman I, Polevoy G. On the Admission of Dependent Flows in Powerful
Sensor Networks. Networking, IEEE/ACM Transactions on. 2013;21(5):1461-1471.
doi:10.1109/TNET.2012.2227792
apa: Cohen, R., Nudelman, I., & Polevoy, G. (2013). On the Admission of Dependent
Flows in Powerful Sensor Networks. Networking, IEEE/ACM Transactions On,
21(5), 1461–1471. https://doi.org/10.1109/TNET.2012.2227792
bibtex: '@article{Cohen_Nudelman_Polevoy_2013, title={On the Admission of Dependent
Flows in Powerful Sensor Networks}, volume={21}, DOI={10.1109/TNET.2012.2227792},
number={5}, journal={Networking, IEEE/ACM Transactions on}, author={Cohen, R.
and Nudelman, I. and Polevoy, Gleb}, year={2013}, pages={1461–1471} }'
chicago: 'Cohen, R., I. Nudelman, and Gleb Polevoy. “On the Admission of Dependent
Flows in Powerful Sensor Networks.” Networking, IEEE/ACM Transactions On
21, no. 5 (2013): 1461–71. https://doi.org/10.1109/TNET.2012.2227792.'
ieee: R. Cohen, I. Nudelman, and G. Polevoy, “On the Admission of Dependent Flows
in Powerful Sensor Networks,” Networking, IEEE/ACM Transactions on, vol.
21, no. 5, pp. 1461–1471, 2013.
mla: Cohen, R., et al. “On the Admission of Dependent Flows in Powerful Sensor Networks.”
Networking, IEEE/ACM Transactions On, vol. 21, no. 5, 2013, pp. 1461–71,
doi:10.1109/TNET.2012.2227792.
short: R. Cohen, I. Nudelman, G. Polevoy, Networking, IEEE/ACM Transactions On 21
(2013) 1461–1471.
date_created: 2020-08-06T15:22:05Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TNET.2012.2227792
extern: '1'
intvolume: ' 21'
issue: '5'
keyword:
- Approximation algorithms
- Approximation methods
- Bandwidth
- Logic gates
- Radar
- Vectors
- Wireless sensor networks
- Dependent flow scheduling
- sensor networks
language:
- iso: eng
page: 1461-1471
publication: Networking, IEEE/ACM Transactions on
publication_identifier:
issn:
- 1063-6692
status: public
title: On the Admission of Dependent Flows in Powerful Sensor Networks
type: journal_article
user_id: '83983'
volume: 21
year: '2013'
...
---
_id: '477'
abstract:
- lang: eng
text: We consider the k-token dissemination problem, where k initially arbitrarily
distributed tokens have to be disseminated to all nodes in a dynamic network (as
introduced by Kuhn et al., STOC 2010). In contrast to general dynamic networks,
our dynamic networks are unit disk graphs, i.e., nodes are embedded into the Euclidean
plane and two nodes are connected if and only if their distance is at most R.
Our worst-case adversary is allowed to move the nodes on the plane, but the maximum
velocity v_max of each node is limited and the graph must be connected in each
round. For this model, we provide almost tight lower and upper bounds for k-token
dissemination if nodes are restricted to send only one token per round. It turns
out that the maximum velocity v_max is a meaningful parameter to characterize
dynamics in our model.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- 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
citation:
ama: 'Abshoff S, Benter M, Cord-Landwehr A, Malatyali M, Meyer auf der Heide F.
Token Dissemination in Geometric Dynamic Networks. In: Algorithms for Sensor
Systems - 9th International Symposium on Algorithms and Experiments for Sensor
Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia
Antipolis, France, September 5-6, 2013, Revised Selected Papers. Lecture Notes
in Computer Science. ; 2013:22-34. doi:10.1007/978-3-642-45346-5_3'
apa: Abshoff, S., Benter, M., Cord-Landwehr, A., Malatyali, M., & Meyer auf
der Heide, F. (2013). Token Dissemination in Geometric Dynamic Networks. In Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers
(pp. 22–34). https://doi.org/10.1007/978-3-642-45346-5_3
bibtex: '@inproceedings{Abshoff_Benter_Cord-Landwehr_Malatyali_Meyer auf der Heide_2013,
series={Lecture Notes in Computer Science}, title={Token Dissemination in Geometric
Dynamic Networks}, DOI={10.1007/978-3-642-45346-5_3},
booktitle={Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers}, author={Abshoff, Sebastian and Benter, Markus and Cord-Landwehr, Andreas
and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2013}, pages={22–34},
collection={Lecture Notes in Computer Science} }'
chicago: Abshoff, Sebastian, Markus Benter, Andreas Cord-Landwehr, Manuel Malatyali,
and Friedhelm Meyer auf der Heide. “Token Dissemination in Geometric Dynamic Networks.”
In Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers, 22–34. Lecture Notes in Computer Science, 2013. https://doi.org/10.1007/978-3-642-45346-5_3.
ieee: S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, and F. Meyer auf der
Heide, “Token Dissemination in Geometric Dynamic Networks,” in Algorithms for
Sensor Systems - 9th International Symposium on Algorithms and Experiments for
Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013,
Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers, 2013,
pp. 22–34.
mla: Abshoff, Sebastian, et al. “Token Dissemination in Geometric Dynamic Networks.”
Algorithms for Sensor Systems - 9th International Symposium on Algorithms and
Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers,
2013, pp. 22–34, doi:10.1007/978-3-642-45346-5_3.
short: 'S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, F. Meyer auf der
Heide, in: Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers, 2013, pp. 22–34.'
date_created: 2017-10-17T12:42:25Z
date_updated: 2022-01-06T07:01:21Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5_3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:06:38Z
date_updated: 2018-03-15T14:06:38Z
file_id: '1325'
file_name: 477-geometric-dynamic-networks_01.pdf
file_size: 193169
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:06:38Z
has_accepted_license: '1'
page: 22-34
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers
series_title: Lecture Notes in Computer Science
status: public
title: Token Dissemination in Geometric Dynamic Networks
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '499'
abstract:
- lang: eng
text: We present a new online algorithm for profit-oriented scheduling on multiple
speed-scalable processors.Moreover, we provide a tight analysis of the algorithm's
competitiveness.Our results generalize and improve upon work by \citet{Chan:2010},
which considers a single speed-scalable processor.Using significantly different
techniques, we can not only extend their model to multiprocessors but also prove
an enhanced and tight competitive ratio for our algorithm.In our scheduling problem,
jobs arrive over time and are preemptable.They have different workloads, values,
and deadlines.The scheduler may decide not to finish a job but instead to suffer
a loss equaling the job's value.However, to process a job's workload until its
deadline the scheduler must invest a certain amount of energy.The cost of a schedule
is the sum of lost values and invested energy.In order to finish a job the scheduler
has to determine which processors to use and set their speeds accordingly.A processor's
energy consumption is power $\Power{s}$ integrated over time, where $\Power{s}=s^{\alpha}$
is the power consumption when running at speed $s$.Since we consider the online
variant of the problem, the scheduler has no knowledge about future jobs.This
problem was introduced by~\citet{Chan:2010} for the case of a single processor.They
presented an online algorithm which is $\alpha^{\alpha}+2e\alpha$-competitive.We
provide an online algorithm for the case of multiple processors with an improved
competitive ratio of $\alpha^{\alpha}$.
author:
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Peter
full_name: Pietrzyk, Peter
last_name: Pietrzyk
citation:
ama: 'Kling P, Pietrzyk P. Profitable Scheduling on Multiple Speed-Scalable Processors.
In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA). ; 2013:251-260. doi:10.1145/2486159.2486183'
apa: Kling, P., & Pietrzyk, P. (2013). Profitable Scheduling on Multiple Speed-Scalable
Processors. In Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA) (pp. 251–260). https://doi.org/10.1145/2486159.2486183
bibtex: '@inproceedings{Kling_Pietrzyk_2013, title={Profitable Scheduling on Multiple
Speed-Scalable Processors}, DOI={10.1145/2486159.2486183},
booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Kling, Peter and Pietrzyk, Peter}, year={2013},
pages={251–260} }'
chicago: Kling, Peter, and Peter Pietrzyk. “Profitable Scheduling on Multiple Speed-Scalable
Processors.” In Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 251–60, 2013. https://doi.org/10.1145/2486159.2486183.
ieee: P. Kling and P. Pietrzyk, “Profitable Scheduling on Multiple Speed-Scalable
Processors,” in Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 2013, pp. 251–260.
mla: Kling, Peter, and Peter Pietrzyk. “Profitable Scheduling on Multiple Speed-Scalable
Processors.” Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 2013, pp. 251–60, doi:10.1145/2486159.2486183.
short: 'P. Kling, P. Pietrzyk, in: Proceedings of the 25th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2013, pp. 251–260.'
date_created: 2017-10-17T12:42:29Z
date_updated: 2022-01-06T07:01:34Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2486159.2486183
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:40:02Z
date_updated: 2018-03-15T13:40:02Z
file_id: '1310'
file_name: 499-P._Kling__P._Pietryzk_-_Profitable_Scheduling_on_Multiple_Speed-scalable_Processors__2013_.pdf
file_size: 558661
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:40:02Z
has_accepted_license: '1'
language:
- iso: eng
page: '251-260 '
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: Profitable Scheduling on Multiple Speed-Scalable Processors
type: conference
user_id: '477'
year: '2013'
...