---
_id: '20262'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: Hamann H. Space-Time Continuous Models of Swarm Robotic Systems.; 2008.
doi:10.1007/978-3-642-13377-0
apa: Hamann, H. (2008). Space-Time Continuous Models of Swarm Robotic Systems.
https://doi.org/10.1007/978-3-642-13377-0
bibtex: '@book{Hamann_2008, title={Space-Time Continuous Models of Swarm Robotic
Systems}, DOI={10.1007/978-3-642-13377-0},
author={Hamann, Heiko}, year={2008} }'
chicago: Hamann, Heiko. Space-Time Continuous Models of Swarm Robotic Systems,
2008. https://doi.org/10.1007/978-3-642-13377-0.
ieee: H. Hamann, Space-Time Continuous Models of Swarm Robotic Systems. 2008.
mla: Hamann, Heiko. Space-Time Continuous Models of Swarm Robotic Systems.
2008, doi:10.1007/978-3-642-13377-0.
short: H. Hamann, Space-Time Continuous Models of Swarm Robotic Systems, 2008.
date_created: 2020-11-02T14:23:36Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-642-13377-0
language:
- iso: eng
publication_identifier:
isbn:
- '9783642133763'
- '9783642133770'
issn:
- 1867-4925
- 1867-4933
publication_status: published
status: public
title: Space-Time Continuous Models of Swarm Robotic Systems
type: dissertation
user_id: '15415'
year: '2008'
...
---
_id: '26235'
abstract:
- lang: eng
text: "Kolmogorov Complexity constitutes an integral part of computability theory,\r\ninformation
theory, and computational complexity theory -- in the discrete\r\nsetting of bits
and Turing machines. Over real numbers, on the other hand, the\r\nBSS-machine
(aka real-RAM) has been established as a major model of\r\ncomputation. This real
realm has turned out to exhibit natural counterparts to\r\nmany notions and results
in classical complexity and recursion theory; although\r\nusually with considerably
different proofs. The present work investigates\r\nsimilarities and differences
between discrete and real Kolmogorov Complexity as\r\nintroduced by Montana and
Pardo (1998)."
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
- first_name: Wouter M.
full_name: Koolen, Wouter M.
last_name: Koolen
citation:
ama: Ziegler M, Koolen WM. Kolmogorov Complexity Theory over the Reals. arXiv:08022027.
Published online 2008.
apa: Ziegler, M., & Koolen, W. M. (2008). Kolmogorov Complexity Theory over
the Reals. In arXiv:0802.2027.
bibtex: '@article{Ziegler_Koolen_2008, title={Kolmogorov Complexity Theory over
the Reals}, journal={arXiv:0802.2027}, author={Ziegler, Martin and Koolen, Wouter
M.}, year={2008} }'
chicago: Ziegler, Martin, and Wouter M. Koolen. “Kolmogorov Complexity Theory over
the Reals.” ArXiv:0802.2027, 2008.
ieee: M. Ziegler and W. M. Koolen, “Kolmogorov Complexity Theory over the Reals,”
arXiv:0802.2027. 2008.
mla: Ziegler, Martin, and Wouter M. Koolen. “Kolmogorov Complexity Theory over the
Reals.” ArXiv:0802.2027, 2008.
short: M. Ziegler, W.M. Koolen, ArXiv:0802.2027 (2008).
date_created: 2021-10-15T09:34:19Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
language:
- iso: eng
publication: arXiv:0802.2027
status: public
title: Kolmogorov Complexity Theory over the Reals
type: preprint
user_id: '15415'
year: '2008'
...
---
_id: '26243'
abstract:
- lang: eng
text: "Operations on univariate dense polynomials—multiplication, division with
remainder, multipoint\r\nevaluation—constitute central primitives entering as
build-up blocks into many higher applications and\r\nalgorithms. Fast Fourier
Transform permits to accelerate them from naive quadratic to running time\r\nO(n·polylogn),
that is softly linear in the degree n of the input. This is routinely employed
in complexity\r\ntheoretic considerations and, over integers and finite fields,
in practical number theoretic calculations.\r\nThe present work explores the benefit
of fast polynomial arithmetic over the field of real numbers\r\nwhere the precision
of approximation becomes crucial. To this end, we study the computability of the\r\nabove
operations in the sense of Recursive Analysis as an effective refinement of continuity.
This theo-\r\nretical worst-case stability analysis is then complemented by an
empirical evaluation: We use GMP and\r\nthe iRRAM to find the precision required
for the intermediate calculations in order to achieve a desired\r\noutput accuracy."
author:
- first_name: Sven
full_name: Köhler, Sven
last_name: Köhler
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Köhler S, Ziegler M. On the Stability of Fast Polynomial Arithmetic. In: Proc.
8th Conference on Real Numbers and Computers. ; 2008:147-156.'
apa: Köhler, S., & Ziegler, M. (2008). On the Stability of Fast Polynomial Arithmetic.
Proc. 8th Conference on Real Numbers and Computers, 147–156.
bibtex: '@inproceedings{Köhler_Ziegler_2008, title={On the Stability of Fast Polynomial
Arithmetic}, booktitle={Proc. 8th Conference on Real Numbers and Computers}, author={Köhler,
Sven and Ziegler, Martin}, year={2008}, pages={147–156} }'
chicago: Köhler, Sven, and Martin Ziegler. “On the Stability of Fast Polynomial
Arithmetic.” In Proc. 8th Conference on Real Numbers and Computers, 147–56,
2008.
ieee: S. Köhler and M. Ziegler, “On the Stability of Fast Polynomial Arithmetic,”
in Proc. 8th Conference on Real Numbers and Computers, 2008, pp. 147–156.
mla: Köhler, Sven, and Martin Ziegler. “On the Stability of Fast Polynomial Arithmetic.”
Proc. 8th Conference on Real Numbers and Computers, 2008, pp. 147–56.
short: 'S. Köhler, M. Ziegler, in: Proc. 8th Conference on Real Numbers and Computers,
2008, pp. 147–156.'
date_created: 2021-10-15T09:57:36Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
language:
- iso: eng
page: 147-156
publication: Proc. 8th Conference on Real Numbers and Computers
status: public
title: On the Stability of Fast Polynomial Arithmetic
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '26255'
abstract:
- lang: eng
text: "We turn the physical Church-Turing Hypothesis from an ambiguous source of
sensational\r\nspeculations into a (collection of) sound and well-defined scientific
problem(s):\r\nExamining recent controversies and causes for misunderstanding
concerning the state of the Church-\r\nTuring Hypothesis (CTH), it is suggested
to study the CTH ‘sharpened’ relative to an arbitrary but\r\nspecific physical
theory—rather than vaguely referring to “nature” in general. For this purpose
we\r\ncombine physical structuralism with computational complexity theory. The
benefits of this approach\r\nare illustrated by some exemplary results on computability
and complexity in computational physics."
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Ziegler M. Physically-Relativized Church-Turing Hypotheses. Applied Mathematics
and Computation. Published online 2008.
apa: Ziegler, M. (2008). Physically-Relativized Church-Turing Hypotheses. Applied
Mathematics and Computation.
bibtex: '@article{Ziegler_2008, title={Physically-Relativized Church-Turing Hypotheses},
journal={Applied Mathematics and Computation}, author={Ziegler, Martin}, year={2008}
}'
chicago: Ziegler, Martin. “Physically-Relativized Church-Turing Hypotheses.” Applied
Mathematics and Computation, 2008.
ieee: M. Ziegler, “Physically-Relativized Church-Turing Hypotheses,” Applied
Mathematics and Computation, 2008.
mla: Ziegler, Martin. “Physically-Relativized Church-Turing Hypotheses.” Applied
Mathematics and Computation, 2008.
short: M. Ziegler, Applied Mathematics and Computation (2008).
date_created: 2021-10-15T10:10:04Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
- _id: '26'
external_id:
arxiv:
- '0805.1292'
language:
- iso: eng
publication: Applied Mathematics and Computation
status: public
title: Physically-Relativized Church-Turing Hypotheses
type: journal_article
user_id: '15415'
year: '2008'
...
---
_id: '26262'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Ziegler M. A Meta-Theory of Physics and Computation. In: Verhandlungen
Der Deutschen Physikalischen Gesellschaft. Deutsche Physikalische Gesellschaft
(DPG); 2008:145.'
apa: Ziegler, M. (2008). A Meta-Theory of Physics and Computation. In Verhandlungen
der Deutschen Physikalischen Gesellschaft (p. 145). Deutsche Physikalische
Gesellschaft (DPG).
bibtex: '@inbook{Ziegler_2008, title={A Meta-Theory of Physics and Computation},
booktitle={Verhandlungen der Deutschen Physikalischen Gesellschaft}, publisher={Deutsche
Physikalische Gesellschaft (DPG)}, author={Ziegler, Martin}, year={2008}, pages={145}
}'
chicago: Ziegler, Martin. “A Meta-Theory of Physics and Computation.” In Verhandlungen
Der Deutschen Physikalischen Gesellschaft, 145. Deutsche Physikalische Gesellschaft
(DPG), 2008.
ieee: M. Ziegler, “A Meta-Theory of Physics and Computation,” in Verhandlungen
der Deutschen Physikalischen Gesellschaft, Deutsche Physikalische Gesellschaft
(DPG), 2008, p. 145.
mla: Ziegler, Martin. “A Meta-Theory of Physics and Computation.” Verhandlungen
Der Deutschen Physikalischen Gesellschaft, Deutsche Physikalische Gesellschaft
(DPG), 2008, p. 145.
short: 'M. Ziegler, in: Verhandlungen Der Deutschen Physikalischen Gesellschaft,
Deutsche Physikalische Gesellschaft (DPG), 2008, p. 145.'
date_created: 2021-10-15T10:35:55Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
- _id: '26'
language:
- iso: eng
page: '145'
publication: Verhandlungen der Deutschen Physikalischen Gesellschaft
publisher: Deutsche Physikalische Gesellschaft (DPG)
status: public
title: A Meta-Theory of Physics and Computation
type: book_chapter
user_id: '15415'
year: '2008'
...
---
_id: '26280'
author:
- first_name: Klaus
full_name: Meer, Klaus
last_name: Meer
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Meer K, Ziegler M. An explicit solution to Post’s Problem over the reals. Journal
of Complexity. Published online 2008:3-15. doi:10.1016/j.jco.2006.09.004
apa: Meer, K., & Ziegler, M. (2008). An explicit solution to Post’s Problem
over the reals. Journal of Complexity, 3–15. https://doi.org/10.1016/j.jco.2006.09.004
bibtex: '@article{Meer_Ziegler_2008, title={An explicit solution to Post’s Problem
over the reals}, DOI={10.1016/j.jco.2006.09.004},
journal={Journal of Complexity}, author={Meer, Klaus and Ziegler, Martin}, year={2008},
pages={3–15} }'
chicago: Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem
over the Reals.” Journal of Complexity, 2008, 3–15. https://doi.org/10.1016/j.jco.2006.09.004.
ieee: 'K. Meer and M. Ziegler, “An explicit solution to Post’s Problem over the
reals,” Journal of Complexity, pp. 3–15, 2008, doi: 10.1016/j.jco.2006.09.004.'
mla: Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over
the Reals.” Journal of Complexity, 2008, pp. 3–15, doi:10.1016/j.jco.2006.09.004.
short: K. Meer, M. Ziegler, Journal of Complexity (2008) 3–15.
date_created: 2021-10-15T12:42:15Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
- _id: '26'
doi: 10.1016/j.jco.2006.09.004
language:
- iso: eng
page: 3-15
publication: Journal of Complexity
publication_identifier:
issn:
- 0885-064X
publication_status: published
status: public
title: An explicit solution to Post's Problem over the reals
type: journal_article
user_id: '15415'
year: '2008'
...
---
_id: '17416'
abstract:
- lang: eng
text: "In this paper we present a system for the simultaneous visualization of several
parallel executed simulation replications. By aggregating the scenes of multiple
similar simulations into one single scene it is possible to make a visual statistical
analysis of a set of discrete event simulations as well as to easily compare different
system parameterizations. The aim of our system is to enhance the model analysis,
verification and validation process in terms of speed and ease. The parallel execution
of several simulations of complex models and the visualization of these cannot
be done on one computer, thus a parallel approach is necessary. Our system uses
a thin-client and multiple processors on a PC-cluster. The rendering and the simulation
execution are done on processors of the cluster. The client is used only for the
visualization of the images transmitted by the cluster and for user interaction.\r\n"
author:
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
- first_name: Daniel
full_name: Huber, Daniel
last_name: Huber
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Christoph
full_name: Laroque, Christoph
last_name: Laroque
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
citation:
ama: 'Suess T, Huber D, Fischer M, Laroque C, Dangelmaier W. A System for Aggregated
Visualization of Multiple Parallel Discrete Event Simulations. In: IEEE International
Symposium on Parallel and Distributed Processing with Applications. ; 2008.
doi:10.1109/ispa.2008.30'
apa: Suess, T., Huber, D., Fischer, M., Laroque, C., & Dangelmaier, W. (2008).
A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations.
IEEE International Symposium on Parallel and Distributed Processing with Applications.
https://doi.org/10.1109/ispa.2008.30
bibtex: '@inproceedings{Suess_Huber_Fischer_Laroque_Dangelmaier_2008, title={A System
for Aggregated Visualization of Multiple Parallel Discrete Event Simulations},
DOI={10.1109/ispa.2008.30},
booktitle={IEEE International Symposium on Parallel and Distributed Processing
with Applications}, author={Suess, Tim and Huber, Daniel and Fischer, Matthias
and Laroque, Christoph and Dangelmaier, Wilhelm}, year={2008} }'
chicago: Suess, Tim, Daniel Huber, Matthias Fischer, Christoph Laroque, and Wilhelm
Dangelmaier. “A System for Aggregated Visualization of Multiple Parallel Discrete
Event Simulations.” In IEEE International Symposium on Parallel and Distributed
Processing with Applications, 2008. https://doi.org/10.1109/ispa.2008.30.
ieee: 'T. Suess, D. Huber, M. Fischer, C. Laroque, and W. Dangelmaier, “A System
for Aggregated Visualization of Multiple Parallel Discrete Event Simulations,”
2008, doi: 10.1109/ispa.2008.30.'
mla: Suess, Tim, et al. “A System for Aggregated Visualization of Multiple Parallel
Discrete Event Simulations.” IEEE International Symposium on Parallel and Distributed
Processing with Applications, 2008, doi:10.1109/ispa.2008.30.
short: 'T. Suess, D. Huber, M. Fischer, C. Laroque, W. Dangelmaier, in: IEEE International
Symposium on Parallel and Distributed Processing with Applications, 2008.'
date_created: 2020-07-27T12:56:15Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
doi: 10.1109/ispa.2008.30
language:
- iso: eng
publication: IEEE International Symposium on Parallel and Distributed Processing with
Applications
publication_identifier:
isbn:
- '9780769534718'
publication_status: published
status: public
title: A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '17566'
alternative_title:
- ' Proceedings of the Final Workshop, Barcelona, February 27-28, 2008'
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. The European Integrated Project "Dynamically Evolving,
Large Scale Information Systems (DELIS). Vol 222. Paderborn: Fakultät für
Elektrotechnik, Informatik und Mathematik, Universität Paderborn; 2008.'
apa: 'Meyer auf der Heide, F. (2008). The European Integrated Project "Dynamically
Evolving, Large Scale Information Systems (DELIS) (Vol. 222). Paderborn: Fakultät
für Elektrotechnik, Informatik und Mathematik, Universität Paderborn.'
bibtex: '@book{Meyer auf der Heide_2008, place={Paderborn}, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts}, title={The European Integrated Project "Dynamically
Evolving, Large Scale Information Systems (DELIS)}, volume={222}, publisher={Fakultät
für Elektrotechnik, Informatik und Mathematik, Universität Paderborn}, author={Meyer
auf der Heide, Friedhelm}, year={2008}, collection={Verlagsschriftenreihe des
Heinz Nixdorf Instituts} }'
chicago: 'Meyer auf der Heide, Friedhelm. The European Integrated Project "Dynamically
Evolving, Large Scale Information Systems (DELIS). Vol. 222. Verlagsschriftenreihe
Des Heinz Nixdorf Instituts. Paderborn: Fakultät für Elektrotechnik, Informatik
und Mathematik, Universität Paderborn, 2008.'
ieee: 'F. Meyer auf der Heide, The European Integrated Project "Dynamically Evolving,
Large Scale Information Systems (DELIS), vol. 222. Paderborn: Fakultät für
Elektrotechnik, Informatik und Mathematik, Universität Paderborn, 2008.'
mla: Meyer auf der Heide, Friedhelm. The European Integrated Project "Dynamically
Evolving, Large Scale Information Systems (DELIS). Vol. 222, Fakultät für
Elektrotechnik, Informatik und Mathematik, Universität Paderborn, 2008.
short: F. Meyer auf der Heide, The European Integrated Project "Dynamically Evolving,
Large Scale Information Systems (DELIS), Fakultät für Elektrotechnik, Informatik
und Mathematik, Universität Paderborn, Paderborn, 2008.
date_created: 2020-08-03T14:19:28Z
date_updated: 2022-01-06T06:53:15Z
department:
- _id: '63'
intvolume: ' 222'
language:
- iso: eng
place: Paderborn
publication_identifier:
isbn:
- ISBN 978-3-939350-41-5
publisher: Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: The European Integrated Project "Dynamically Evolving, Large Scale Information
Systems (DELIS)
type: book
user_id: '15415'
volume: 222
year: '2008'
...
---
_id: '17868'
abstract:
- lang: eng
text: 'The paper describes an approach for an aggregated animation of a simulation
experiment in an interactive 3D environment, visualizing multiple, distributed
simulation runs. Although the general approach of a 3-dimensional visualization
of material flow simulation helps to understand the dynamic behavior of a system
better as well as faster, it remains unclear, how typical the animated simulation
represents the model, if there is a stochastic influence for even some parameters.
By the integrated visualization of multiple distributed simulation runs, this
uncertainty can be solved, which will be shown in this paper for a typical simulation
study of a queuing system. '
author:
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Daniel
full_name: Huber, Daniel
last_name: Huber
- first_name: Christoph
full_name: Laroque, Christoph
last_name: Laroque
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
citation:
ama: 'Dangelmaier W, Fischer M, Huber D, Laroque C, Suess T. Aggregated 3D-visualization
of a distributed simulation experiment of a queuing system. In: 2008 Winter
Simulation Conference. ; 2008:2012-2020. doi:10.1109/wsc.2008.4736296'
apa: Dangelmaier, W., Fischer, M., Huber, D., Laroque, C., & Suess, T. (2008).
Aggregated 3D-visualization of a distributed simulation experiment of a queuing
system. 2008 Winter Simulation Conference, 2012–2020. https://doi.org/10.1109/wsc.2008.4736296
bibtex: '@inproceedings{Dangelmaier_Fischer_Huber_Laroque_Suess_2008, place={Miami,
FL., USA}, title={Aggregated 3D-visualization of a distributed simulation experiment
of a queuing system}, DOI={10.1109/wsc.2008.4736296},
booktitle={2008 Winter Simulation Conference}, author={Dangelmaier, Wilhelm and
Fischer, Matthias and Huber, Daniel and Laroque, Christoph and Suess, Tim}, year={2008},
pages={2012–2020} }'
chicago: Dangelmaier, Wilhelm, Matthias Fischer, Daniel Huber, Christoph Laroque,
and Tim Suess. “Aggregated 3D-Visualization of a Distributed Simulation Experiment
of a Queuing System.” In 2008 Winter Simulation Conference, 2012–20. Miami,
FL., USA, 2008. https://doi.org/10.1109/wsc.2008.4736296.
ieee: 'W. Dangelmaier, M. Fischer, D. Huber, C. Laroque, and T. Suess, “Aggregated
3D-visualization of a distributed simulation experiment of a queuing system,”
in 2008 Winter Simulation Conference, 2008, pp. 2012–2020, doi: 10.1109/wsc.2008.4736296.'
mla: Dangelmaier, Wilhelm, et al. “Aggregated 3D-Visualization of a Distributed
Simulation Experiment of a Queuing System.” 2008 Winter Simulation Conference,
2008, pp. 2012–20, doi:10.1109/wsc.2008.4736296.
short: 'W. Dangelmaier, M. Fischer, D. Huber, C. Laroque, T. Suess, in: 2008 Winter
Simulation Conference, Miami, FL., USA, 2008, pp. 2012–2020.'
date_created: 2020-08-12T13:39:37Z
date_updated: 2022-01-06T06:53:22Z
department:
- _id: '63'
doi: 10.1109/wsc.2008.4736296
language:
- iso: eng
page: 2012-2020
place: Miami, FL., USA
publication: 2008 Winter Simulation Conference
publication_identifier:
isbn:
- '9781424427079'
publication_status: published
status: public
title: Aggregated 3D-visualization of a distributed simulation experiment of a queuing
system
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19003'
author:
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Christiane
full_name: Lammersen, Christiane
last_name: Lammersen
citation:
ama: 'Degener B, Gehweiler J, Lammersen C. The Kinetic Facility Location Problem.
In: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT).
; 2008:378-389. doi:10.1007/978-3-540-69903-3_34'
apa: Degener, B., Gehweiler, J., & Lammersen, C. (2008). The Kinetic Facility
Location Problem. In Proceedings of the 11th Scandinavian Workshop on Algorithm
Theory (SWAT) (pp. 378–389). https://doi.org/10.1007/978-3-540-69903-3_34
bibtex: '@inproceedings{Degener_Gehweiler_Lammersen_2008, title={The Kinetic Facility
Location Problem}, DOI={10.1007/978-3-540-69903-3_34},
booktitle={Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)},
author={Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane}, year={2008},
pages={378–389} }'
chicago: Degener, Bastian, Joachim Gehweiler, and Christiane Lammersen. “The Kinetic
Facility Location Problem.” In Proceedings of the 11th Scandinavian Workshop
on Algorithm Theory (SWAT), 378–89, 2008. https://doi.org/10.1007/978-3-540-69903-3_34.
ieee: B. Degener, J. Gehweiler, and C. Lammersen, “The Kinetic Facility Location
Problem,” in Proceedings of the 11th Scandinavian Workshop on Algorithm Theory
(SWAT), 2008, pp. 378–389.
mla: Degener, Bastian, et al. “The Kinetic Facility Location Problem.” Proceedings
of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–89,
doi:10.1007/978-3-540-69903-3_34.
short: 'B. Degener, J. Gehweiler, C. Lammersen, in: Proceedings of the 11th Scandinavian
Workshop on Algorithm Theory (SWAT), 2008, pp. 378–389.'
date_created: 2020-09-04T10:04:49Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1007/978-3-540-69903-3_34
language:
- iso: eng
page: 378-389
publication: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)
publication_identifier:
isbn:
- '9783540699002'
- '9783540699033'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: The Kinetic Facility Location Problem
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19004'
abstract:
- lang: eng
text: "We present a deterministic kinetic data structure for the facility location
problem that maintains a subset of the moving points as facilities such that,
at any point of time, the sum of the maintenance cost for the facilities and the
connection cost for the clients is at most a constant factor larger than the current
optimal cost. In our scenario, each point can open a facility and moves continuously
along a known trajectory in a d-dimensional Euclidean space where d is a constant.\r\n\r\nOur
kinetic data structure has a storage requirement of O(n (log^d(n)+log(nR))), where
n is the number of points and R is the ratio of the product of the maximum maintenance
cost and demand to the product of their corresponding minimum values. In the case
that each trajectory can be described by a bounded degree polynomial, the data
structure processes O(n^2 log^2(nR)) events, each requiring only O(log(nR)) facility
changes and O(log^(d+1)(n) log(nR)) time. This results in a total processing time
of O(n^2 log^(d+1)(n) log^3(nR)). To the best of our knowledge, this is the first
kinetic data structure for the facility location problem."
author:
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Christiane
full_name: Lammersen, Christiane
last_name: Lammersen
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
citation:
ama: 'Gehweiler J, Lammersen C, Degener B. The Kinetic Facility Location Problem.
In: Proceedings of the 24th European Workshop on Computational Geometry.
; 2008:251-254.'
apa: Gehweiler, J., Lammersen, C., & Degener, B. (2008). The Kinetic Facility
Location Problem. In Proceedings of the 24th European Workshop on Computational
Geometry (pp. 251–254).
bibtex: '@inproceedings{Gehweiler_Lammersen_Degener_2008, title={The Kinetic Facility
Location Problem}, booktitle={Proceedings of the 24th European Workshop on Computational
Geometry}, author={Gehweiler, Joachim and Lammersen, Christiane and Degener, Bastian},
year={2008}, pages={251–254} }'
chicago: Gehweiler, Joachim, Christiane Lammersen, and Bastian Degener. “The Kinetic
Facility Location Problem.” In Proceedings of the 24th European Workshop on
Computational Geometry, 251–54, 2008.
ieee: J. Gehweiler, C. Lammersen, and B. Degener, “The Kinetic Facility Location
Problem,” in Proceedings of the 24th European Workshop on Computational Geometry,
2008, pp. 251–254.
mla: Gehweiler, Joachim, et al. “The Kinetic Facility Location Problem.” Proceedings
of the 24th European Workshop on Computational Geometry, 2008, pp. 251–54.
short: 'J. Gehweiler, C. Lammersen, B. Degener, in: Proceedings of the 24th European
Workshop on Computational Geometry, 2008, pp. 251–254.'
date_created: 2020-09-04T10:11:39Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
language:
- iso: eng
page: 251-254
publication: Proceedings of the 24th European Workshop on Computational Geometry
status: public
title: The Kinetic Facility Location Problem
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '1940'
author:
- first_name: Mario
full_name: Mense, Mario
last_name: Mense
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Mense M, Scheideler C. SPREAD: an adaptive scheme for redundant and fair storage
in dynamic heterogeneous storage systems. In: Proceedings of the Nineteenth
Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California,
USA, January 20-22, 2008. SIAM; 2008:1135--1144.'
apa: 'Mense, M., & Scheideler, C. (2008). SPREAD: an adaptive scheme for redundant
and fair storage in dynamic heterogeneous storage systems. In Proceedings of
the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San
Francisco, California, USA, January 20-22, 2008 (pp. 1135--1144). SIAM.'
bibtex: '@inproceedings{Mense_Scheideler_2008, title={SPREAD: an adaptive scheme
for redundant and fair storage in dynamic heterogeneous storage systems}, booktitle={Proceedings
of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008,
San Francisco, California, USA, January 20-22, 2008}, publisher={SIAM}, author={Mense,
Mario and Scheideler, Christian}, year={2008}, pages={1135--1144} }'
chicago: 'Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for
Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems.” In Proceedings
of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008,
San Francisco, California, USA, January 20-22, 2008, 1135--1144. SIAM, 2008.'
ieee: 'M. Mense and C. Scheideler, “SPREAD: an adaptive scheme for redundant and
fair storage in dynamic heterogeneous storage systems,” in Proceedings of the
Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco,
California, USA, January 20-22, 2008, 2008, pp. 1135--1144.'
mla: 'Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for Redundant
and Fair Storage in Dynamic Heterogeneous Storage Systems.” Proceedings of
the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San
Francisco, California, USA, January 20-22, 2008, SIAM, 2008, pp. 1135--1144.'
short: 'M. Mense, C. Scheideler, in: Proceedings of the Nineteenth Annual ACM-SIAM
Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January
20-22, 2008, SIAM, 2008, pp. 1135--1144.'
date_created: 2018-03-29T09:30:18Z
date_updated: 2022-01-06T06:54:03Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:03:13Z
date_updated: 2018-04-13T10:03:13Z
file_id: '2341'
file_name: SODA08.pdf
file_size: 211264
relation: main_file
file_date_updated: 2018-04-13T10:03:13Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 1135--1144
publication: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms,
SODA 2008, San Francisco, California, USA, January 20-22, 2008
publisher: SIAM
status: public
title: 'SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous
storage systems'
type: conference
urn: '19408'
user_id: '14955'
year: '2008'
...
---
_id: '20367'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Heinz
full_name: Wörn, Heinz
last_name: Wörn
citation:
ama: 'Hamann H, Wörn H. Aggregating Robots Compute: An Adaptive Heuristic for the
Euclidean Steiner Tree Problem. In: The Tenth International Conference on Simulation
of Adaptive Behavior (SAB’08). Vol 5040. ; 2008:447--456. doi:10.1007/978-3-540-69134-1_44'
apa: 'Hamann, H., & Wörn, H. (2008). Aggregating Robots Compute: An Adaptive
Heuristic for the Euclidean Steiner Tree Problem. In The tenth International
Conference on Simulation of Adaptive Behavior (SAB’08) (Vol. 5040, pp. 447--456).
https://doi.org/10.1007/978-3-540-69134-1_44'
bibtex: '@inproceedings{Hamann_Wörn_2008, title={Aggregating Robots Compute: An
Adaptive Heuristic for the Euclidean Steiner Tree Problem}, volume={5040}, DOI={10.1007/978-3-540-69134-1_44},
booktitle={The tenth International Conference on Simulation of Adaptive Behavior
(SAB’08)}, author={Hamann, Heiko and Wörn, Heinz}, year={2008}, pages={447--456}
}'
chicago: 'Hamann, Heiko, and Heinz Wörn. “Aggregating Robots Compute: An Adaptive
Heuristic for the Euclidean Steiner Tree Problem.” In The Tenth International
Conference on Simulation of Adaptive Behavior (SAB’08), 5040:447--456, 2008.
https://doi.org/10.1007/978-3-540-69134-1_44.'
ieee: 'H. Hamann and H. Wörn, “Aggregating Robots Compute: An Adaptive Heuristic
for the Euclidean Steiner Tree Problem,” in The tenth International Conference
on Simulation of Adaptive Behavior (SAB’08), 2008, vol. 5040, pp. 447--456.'
mla: 'Hamann, Heiko, and Heinz Wörn. “Aggregating Robots Compute: An Adaptive Heuristic
for the Euclidean Steiner Tree Problem.” The Tenth International Conference
on Simulation of Adaptive Behavior (SAB’08), vol. 5040, 2008, pp. 447--456,
doi:10.1007/978-3-540-69134-1_44.'
short: 'H. Hamann, H. Wörn, in: The Tenth International Conference on Simulation
of Adaptive Behavior (SAB’08), 2008, pp. 447--456.'
date_created: 2020-11-16T13:55:39Z
date_updated: 2022-01-06T06:54:26Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-540-69134-1_44
intvolume: ' 5040'
language:
- iso: eng
page: 447--456
publication: The tenth International Conference on Simulation of Adaptive Behavior
(SAB'08)
publication_identifier:
isbn:
- '9783540691334'
- '9783540691341'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner
Tree Problem'
type: conference
user_id: '15415'
volume: 5040
year: '2008'
...
---
_id: '20368'
abstract:
- lang: eng
text: 'We present a comparative study of two spatially resolved macroscopic models
of an autonomous robotic swarm. In previous experiments, the collective behavior
of 15 autonomous swarm robots, driven by a simple bio-inspired control algorithm,
was investigated: in two different environmental conditions, the ability of the
robots to aggregate below a light source was tested. Distinct approaches to predict
the dynamics of the spatial distribution were made by two different modeling approaches:
one model was constructed in a compartmental manner (ODEs). In parallel, a space-continuous
model (PDEs) was constructed. Both models show a high degree of similarity concerning
the modeling of concrete environmental factors (light), but due to their different
basic approaches, show also significant differences in their implementation. However,
the predictions of both models compare well to the observed behavior of the robotic
swarm, thus both models can be used to develop further extensions of the algorithm
as well as different experimental setups without the need to run extensive real
robotic preliminary experiments.'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Heinz
full_name: Wörn, Heinz
last_name: Wörn
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
citation:
ama: 'Hamann H, Schmickl T, Wörn H, Crailsheim K. Spatial Macroscopic Models of
a Bio-Inspired Robotic Swarm Algorithm. In: IEEE/RSJ 2008 International Conference
on Intelligent Robots and Systems (IROS’08). IEEE Press; 2008:1415--1420.
doi:10.1109/IROS.2008.4651038'
apa: Hamann, H., Schmickl, T., Wörn, H., & Crailsheim, K. (2008). Spatial Macroscopic
Models of a Bio-Inspired Robotic Swarm Algorithm. In IEEE/RSJ 2008 International
Conference on Intelligent Robots and Systems (IROS’08) (pp. 1415--1420). IEEE
Press. https://doi.org/10.1109/IROS.2008.4651038
bibtex: '@inproceedings{Hamann_Schmickl_Wörn_Crailsheim_2008, title={Spatial Macroscopic
Models of a Bio-Inspired Robotic Swarm Algorithm}, DOI={10.1109/IROS.2008.4651038},
booktitle={IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems
(IROS’08)}, publisher={IEEE Press}, author={Hamann, Heiko and Schmickl, Thomas
and Wörn, Heinz and Crailsheim, Karl}, year={2008}, pages={1415--1420} }'
chicago: Hamann, Heiko, Thomas Schmickl, Heinz Wörn, and Karl Crailsheim. “Spatial
Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm.” In IEEE/RSJ
2008 International Conference on Intelligent Robots and Systems (IROS’08),
1415--1420. IEEE Press, 2008. https://doi.org/10.1109/IROS.2008.4651038.
ieee: H. Hamann, T. Schmickl, H. Wörn, and K. Crailsheim, “Spatial Macroscopic Models
of a Bio-Inspired Robotic Swarm Algorithm,” in IEEE/RSJ 2008 International
Conference on Intelligent Robots and Systems (IROS’08), 2008, pp. 1415--1420.
mla: Hamann, Heiko, et al. “Spatial Macroscopic Models of a Bio-Inspired Robotic
Swarm Algorithm.” IEEE/RSJ 2008 International Conference on Intelligent Robots
and Systems (IROS’08), IEEE Press, 2008, pp. 1415--1420, doi:10.1109/IROS.2008.4651038.
short: 'H. Hamann, T. Schmickl, H. Wörn, K. Crailsheim, in: IEEE/RSJ 2008 International
Conference on Intelligent Robots and Systems (IROS’08), IEEE Press, 2008, pp.
1415--1420.'
date_created: 2020-11-16T14:03:10Z
date_updated: 2022-01-06T06:54:26Z
department:
- _id: '63'
- _id: '238'
doi: 10.1109/IROS.2008.4651038
language:
- iso: eng
page: 1415--1420
publication: IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems
(IROS'08)
publisher: IEEE Press
status: public
title: Spatial Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '20369'
abstract:
- lang: eng
text: Designing and analyzing self-organizing systems such as robotic swarms is
a challenging task even though we have complete knowledge about the robot’s interior.
It is difficult to determine the individual robot’s behavior based on the swarm
behavior and vice versa due to the high number of agent–agent interactions. A
step towards a solution of this problem is the development of appropriate models
which accurately predict the swarm behavior based on a specified control algorithm.
Such models would reduce the necessary number of time-consuming simulations and
experiments during the design process of an algorithm. In this paper we propose
a model with focus on an explicit representation of space because the effectiveness
of many swarm robotic scenarios depends on spatial inhomogeneity. We use methods
of statistical physics to address spatiality. Starting from a description of a
single robot we derive an abstract model of swarm motion. The model is then extended
to a generic model framework of communicating robots. In two examples we validate
models against simulation results. Our experience shows that qualitative correctness
is easily achieved, while quantitative correctness is disproportionately more
difficult but still possible.
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Heinz
full_name: Wörn, Heinz
last_name: Wörn
citation:
ama: Hamann H, Wörn H. A framework of space–time continuous models for algorithm
design in swarm robotics. Swarm Intelligence. 2008;2(2-4):209-239. doi:10.1007/s11721-008-0015-3
apa: Hamann, H., & Wörn, H. (2008). A framework of space–time continuous models
for algorithm design in swarm robotics. Swarm Intelligence, 2(2–4),
209–239. https://doi.org/10.1007/s11721-008-0015-3
bibtex: '@article{Hamann_Wörn_2008, title={A framework of space–time continuous
models for algorithm design in swarm robotics}, volume={2}, DOI={10.1007/s11721-008-0015-3},
number={2–4}, journal={Swarm Intelligence}, author={Hamann, Heiko and Wörn, Heinz},
year={2008}, pages={209–239} }'
chicago: 'Hamann, Heiko, and Heinz Wörn. “A Framework of Space–Time Continuous Models
for Algorithm Design in Swarm Robotics.” Swarm Intelligence 2, no. 2–4
(2008): 209–39. https://doi.org/10.1007/s11721-008-0015-3.'
ieee: H. Hamann and H. Wörn, “A framework of space–time continuous models for algorithm
design in swarm robotics,” Swarm Intelligence, vol. 2, no. 2–4, pp. 209–239,
2008.
mla: Hamann, Heiko, and Heinz Wörn. “A Framework of Space–Time Continuous Models
for Algorithm Design in Swarm Robotics.” Swarm Intelligence, vol. 2, no.
2–4, 2008, pp. 209–39, doi:10.1007/s11721-008-0015-3.
short: H. Hamann, H. Wörn, Swarm Intelligence 2 (2008) 209–239.
date_created: 2020-11-16T14:05:49Z
date_updated: 2022-01-06T06:54:26Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/s11721-008-0015-3
intvolume: ' 2'
issue: 2-4
language:
- iso: eng
page: 209-239
publication: Swarm Intelligence
publication_identifier:
issn:
- 1935-3812
- 1935-3820
publication_status: published
status: public
title: A framework of space–time continuous models for algorithm design in swarm robotics
type: journal_article
user_id: '15415'
volume: 2
year: '2008'
...
---
_id: '17978'
author:
- first_name: Katharina
full_name: Lürwer-Brüggemeier, Katharina
last_name: Lürwer-Brüggemeier
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Lürwer-Brüggemeier K, Ziegler M. On Faster Integer Calculations Using Non-arithmetic
Primitives. In: Unconventional Computing. Berlin, Heidelberg; 2008. doi:10.1007/978-3-540-85194-3_11'
apa: Lürwer-Brüggemeier, K., & Ziegler, M. (2008). On Faster Integer Calculations
Using Non-arithmetic Primitives. In Unconventional Computing. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-540-85194-3_11
bibtex: '@inbook{Lürwer-Brüggemeier_Ziegler_2008, place={Berlin, Heidelberg}, title={On
Faster Integer Calculations Using Non-arithmetic Primitives}, DOI={10.1007/978-3-540-85194-3_11},
booktitle={Unconventional Computing}, author={Lürwer-Brüggemeier, Katharina and
Ziegler, Martin}, year={2008} }'
chicago: Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations
Using Non-Arithmetic Primitives.” In Unconventional Computing. Berlin,
Heidelberg, 2008. https://doi.org/10.1007/978-3-540-85194-3_11.
ieee: K. Lürwer-Brüggemeier and M. Ziegler, “On Faster Integer Calculations Using
Non-arithmetic Primitives,” in Unconventional Computing, Berlin, Heidelberg,
2008.
mla: Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations
Using Non-Arithmetic Primitives.” Unconventional Computing, 2008, doi:10.1007/978-3-540-85194-3_11.
short: 'K. Lürwer-Brüggemeier, M. Ziegler, in: Unconventional Computing, Berlin,
Heidelberg, 2008.'
date_created: 2020-08-14T13:19:24Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1007/978-3-540-85194-3_11
language:
- iso: eng
place: Berlin, Heidelberg
publication: Unconventional Computing
publication_identifier:
isbn:
- '9783540851936'
- '9783540851943'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: On Faster Integer Calculations Using Non-arithmetic Primitives
type: book_chapter
user_id: '15415'
year: '2008'
...
---
_id: '18139'
abstract:
- lang: eng
text: 'This paper describes a method for the animation of a large number of objects
within a dynamic 3D visualization of a material flow simulation model. It uses
key-frame based animation. The number of animated objects may grow constantly
in complex simulation models, which might lead to an amount of animations that
is too big to be computed in real-time. By the use of a dynamic adjustment, the
presented algorithm prefers important animations. Less relevant animations are
updated rarely, whereby the selection itself is taken by multiple indicators,
e.g. the visible size of the animated object on the screen, in order to keep a
good optical impression. Dependent on the computing power of the computer, the
algorithm controls the animations in such a way, that the fluid visualization
of a large number of objects is still possible. Though the algorithm is to be
used within a material flow simulator, it is moreover implemented in a specific
animation editor, which allows the design and control of animation schemes. It
supports the use of grouping to allow the creation of hierarchical structures
for complex animations in a fast and easy manner. The evaluation of the algorithm
is proven by a test scene, consisting of tens of thousands animated objects. '
author:
- first_name: Christoph
full_name: Laroque, Christoph
last_name: Laroque
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
- first_name: Benjamin
full_name: Eikel, Benjamin
last_name: Eikel
citation:
ama: 'Laroque C, Fischer M, Dangelmaier W, Eikel B. Dynamic Control of Animation
Schemes for the Efficient 3D-Visualization of Material Flow Simulations. In: Industrial
Simulation Conference (ISC 2008). EUROSIS-ETI; 2008:306-310.'
apa: Laroque, C., Fischer, M., Dangelmaier, W., & Eikel, B. (2008). Dynamic
Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow
Simulations. In Industrial Simulation Conference (ISC 2008) (pp. 306–310).
EUROSIS-ETI.
bibtex: '@inproceedings{Laroque_Fischer_Dangelmaier_Eikel_2008, title={Dynamic Control
of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations},
booktitle={Industrial Simulation Conference (ISC 2008)}, publisher={EUROSIS-ETI},
author={Laroque, Christoph and Fischer, Matthias and Dangelmaier, Wilhelm and
Eikel, Benjamin}, year={2008}, pages={306–310} }'
chicago: Laroque, Christoph, Matthias Fischer, Wilhelm Dangelmaier, and Benjamin
Eikel. “Dynamic Control of Animation Schemes for the Efficient 3D-Visualization
of Material Flow Simulations.” In Industrial Simulation Conference (ISC 2008),
306–10. EUROSIS-ETI, 2008.
ieee: C. Laroque, M. Fischer, W. Dangelmaier, and B. Eikel, “Dynamic Control of
Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations,”
in Industrial Simulation Conference (ISC 2008), 2008, pp. 306–310.
mla: Laroque, Christoph, et al. “Dynamic Control of Animation Schemes for the Efficient
3D-Visualization of Material Flow Simulations.” Industrial Simulation Conference
(ISC 2008), EUROSIS-ETI, 2008, pp. 306–10.
short: 'C. Laroque, M. Fischer, W. Dangelmaier, B. Eikel, in: Industrial Simulation
Conference (ISC 2008), EUROSIS-ETI, 2008, pp. 306–310.'
date_created: 2020-08-24T07:49:59Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
language:
- iso: eng
page: 306-310
publication: Industrial Simulation Conference (ISC 2008)
publisher: EUROSIS-ETI
status: public
title: Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of
Material Flow Simulations
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '18141'
abstract:
- lang: ger
text: Dieser Artikel beschreibt eine Methode zur Animation einer großen Anzahl von
Objekten zur dynamischen 3D-Visualisierung eines Simulationsmodells mittels der
Materialflusssimulation auf Basis von Schlüsselbildern. Die Anzahl zu animierender
Objekte ist in komplexen Modellen zu groß, um alle Animationen flüssig darzustellen.
Dynamisch abgestuft wählt das entwickelte Verfahren gezielt wichtige Animationen
aus, weniger relevante Animationen werden entsprechend seltener animiert. Die
Selektion der Animationen erfolgt nach der projizierten Größe der Objekte auf
das Ausgabegerät, um einen guten optischen Eindruck beizubehalten. Angepasst an
die Leistungsfähigkeit des Rechners wird das Verfahren so geregelt, dass die Visualisierung
einer hohen Anzahl von Objekten in Echtzeit möglich bleibt. Das Verfahren ist
in einem Editor prototypisch implementiert, mit dem Schlüsselbilder für Objekte
erzeugt werden können. Das Gruppieren von Objekten wird erlaubt, so dass eine
Hierarchie von Bewegungspfaden definierbar ist. Die Evaluierung der Methode wird
mittels Testszenen durchgeführt, die aus mehreren zehntausend animierten Objekten
bestehen.
author:
- first_name: Christoph
full_name: Laroque, Christoph
last_name: Laroque
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Benjamin
full_name: Eikel, Benjamin
last_name: Eikel
citation:
ama: 'Laroque C, Fischer M, Eikel B. Regelung von Animationen in Simulationen von
hochdynamischen Fabrikszenen . In: Augmented & Virtual Reality in Der Produktentstehung.
Vol 232. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2008:193--206.'
apa: Laroque, C., Fischer, M., & Eikel, B. (2008). Regelung von Animationen
in Simulationen von hochdynamischen Fabrikszenen . Augmented & Virtual
Reality in Der Produktentstehung, 232, 193--206.
bibtex: '@inproceedings{Laroque_Fischer_Eikel_2008, title={Regelung von Animationen
in Simulationen von hochdynamischen Fabrikszenen }, volume={232}, booktitle={Augmented
& Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Laroque, Christoph and Fischer,
Matthias and Eikel, Benjamin}, year={2008}, pages={193--206} }'
chicago: Laroque, Christoph, Matthias Fischer, and Benjamin Eikel. “Regelung von
Animationen in Simulationen von Hochdynamischen Fabrikszenen .” In Augmented
& Virtual Reality in Der Produktentstehung, 232:193--206. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2008.
ieee: C. Laroque, M. Fischer, and B. Eikel, “Regelung von Animationen in Simulationen
von hochdynamischen Fabrikszenen ,” in Augmented & Virtual Reality in
der Produktentstehung, 2008, vol. 232, pp. 193--206.
mla: Laroque, Christoph, et al. “Regelung von Animationen in Simulationen von Hochdynamischen
Fabrikszenen .” Augmented & Virtual Reality in Der Produktentstehung,
vol. 232, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008,
pp. 193--206.
short: 'C. Laroque, M. Fischer, B. Eikel, in: Augmented & Virtual Reality in
Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2008, pp. 193--206.'
date_created: 2020-08-24T07:56:43Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 232'
language:
- iso: eng
page: 193--206
publication: Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: 'Regelung von Animationen in Simulationen von hochdynamischen Fabrikszenen '
type: conference
user_id: '5786'
volume: 232
year: '2008'
...
---
_id: '18143'
author:
- first_name: Stéphane
full_name: Le Roux, Stéphane
last_name: Le Roux
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Le Roux S, Ziegler M. Singular Coverings and Non-Uniform Notions of Closed
Set Computability. Electronic Notes in Theoretical Computer Science. Published
online 2008:73-88. doi:10.1016/j.entcs.2008.03.009
apa: Le Roux, S., & Ziegler, M. (2008). Singular Coverings and Non-Uniform Notions
of Closed Set Computability. Electronic Notes in Theoretical Computer Science,
73–88. https://doi.org/10.1016/j.entcs.2008.03.009
bibtex: '@article{Le Roux_Ziegler_2008, title={Singular Coverings and Non-Uniform
Notions of Closed Set Computability}, DOI={10.1016/j.entcs.2008.03.009},
journal={Electronic Notes in Theoretical Computer Science}, author={Le Roux, Stéphane
and Ziegler, Martin}, year={2008}, pages={73–88} }'
chicago: Le Roux, Stéphane, and Martin Ziegler. “Singular Coverings and Non-Uniform
Notions of Closed Set Computability.” Electronic Notes in Theoretical Computer
Science, 2008, 73–88. https://doi.org/10.1016/j.entcs.2008.03.009.
ieee: 'S. Le Roux and M. Ziegler, “Singular Coverings and Non-Uniform Notions of
Closed Set Computability,” Electronic Notes in Theoretical Computer Science,
pp. 73–88, 2008, doi: 10.1016/j.entcs.2008.03.009.'
mla: Le Roux, Stéphane, and Martin Ziegler. “Singular Coverings and Non-Uniform
Notions of Closed Set Computability.” Electronic Notes in Theoretical Computer
Science, 2008, pp. 73–88, doi:10.1016/j.entcs.2008.03.009.
short: S. Le Roux, M. Ziegler, Electronic Notes in Theoretical Computer Science
(2008) 73–88.
date_created: 2020-08-24T08:07:43Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
doi: 10.1016/j.entcs.2008.03.009
language:
- iso: eng
page: 73-88
publication: Electronic Notes in Theoretical Computer Science
publication_identifier:
issn:
- 1571-0661
publication_status: published
status: public
title: Singular Coverings and Non-Uniform Notions of Closed Set Computability
type: journal_article
user_id: '15415'
year: '2008'
...
---
_id: '18570'
abstract:
- lang: eng
text: "We present a game theoretic study of hybrid communication networks in which
mobile devices can connect in an ad hoc fashion to a base station, possibly via
a few hops using other mobile devices as intermediate nodes. The maximal number
of allowed hops might be bounded with the motivation to guarantee small latency.
We introduce hybrid connectivity games to study the impact of selfishness on this
kind of infrastructure.\r\n\r\nMobile devices are represented by selfish players,
each of which aims at establishing an uplink path to the base station minimizing
its individual cost. Our model assumes that intermediate nodes on an uplink path
are reimbursed for transmitting the packets of other devices. The reimbursements
can be paid either by a benevolent network operator or by the senders of the packets
using micropayments via a clearing agency that possibly collects a small percentage
as commission. These different ways to implement the payments lead to different
variants of the hybrid connectivity game. Our main findings are: (1) If there
is no constraint on the number of allowed hops on the path to the base station,
then the existence of equilibria is guaranteed regardless of whether the network
operator or the senders pay for forwarding packets. (2) If the network operator
pays, then the existence of equilibria is guaranteed only if at most one intermediate
node is allowed, i.e., for at most two hops on the uplink path of a device, but
not if the maximal number of allowed hops is three or larger. (3) In contrast,
if the senders pay for forwarding their packets, then equilibria are guaranteed
to exist given any bound on the number of allowed hops.\r\n\r\nThe equilibrium
analysis presented in this paper gives a first game theoretical motivation for
the implementation of micropayment schemes in which senders pay for forwarding
their packets. We further support this evidence by giving an upper bound on the
Price of Anarchy for this kind of hybrid connectivity games that is independent
of the number of nodes, but only depends on the number of hops and the power gradient."
author:
- first_name: Heiner
full_name: Ackermann, Heiner
last_name: Ackermann
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Alexander
full_name: Fanghänel, Alexander
last_name: Fanghänel
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: Ackermann H, Briest P, Fanghänel A, Vöcking B. Who Should Pay for Forwarding
Packets? Internet Mathematics. 2008;5(4):459-475. doi:10.1007/978-3-540-77105-0_21
apa: Ackermann, H., Briest, P., Fanghänel, A., & Vöcking, B. (2008). Who Should
Pay for Forwarding Packets? Internet Mathematics, 5(4), 459–475.
https://doi.org/10.1007/978-3-540-77105-0_21
bibtex: '@article{Ackermann_Briest_Fanghänel_Vöcking_2008, title={Who Should Pay
for Forwarding Packets?}, volume={5}, DOI={10.1007/978-3-540-77105-0_21},
number={4}, journal={Internet Mathematics}, publisher={Springer}, author={Ackermann,
Heiner and Briest, Patrick and Fanghänel, Alexander and Vöcking, Berthold}, year={2008},
pages={459–475} }'
chicago: 'Ackermann, Heiner, Patrick Briest, Alexander Fanghänel, and Berthold Vöcking.
“Who Should Pay for Forwarding Packets?” Internet Mathematics 5, no. 4
(2008): 459–75. https://doi.org/10.1007/978-3-540-77105-0_21.'
ieee: H. Ackermann, P. Briest, A. Fanghänel, and B. Vöcking, “Who Should Pay for
Forwarding Packets?,” Internet Mathematics, vol. 5, no. 4, pp. 459–475,
2008.
mla: Ackermann, Heiner, et al. “Who Should Pay for Forwarding Packets?” Internet
Mathematics, vol. 5, no. 4, Springer, 2008, pp. 459–75, doi:10.1007/978-3-540-77105-0_21.
short: H. Ackermann, P. Briest, A. Fanghänel, B. Vöcking, Internet Mathematics 5
(2008) 459–475.
date_created: 2020-08-28T12:29:59Z
date_updated: 2022-01-06T06:53:40Z
department:
- _id: '63'
doi: 10.1007/978-3-540-77105-0_21
intvolume: ' 5'
issue: '4'
language:
- iso: eng
page: 459-475
publication: Internet Mathematics
publication_identifier:
isbn:
- '9783540771043'
publication_status: published
publisher: Springer
status: public
title: Who Should Pay for Forwarding Packets?
type: journal_article
user_id: '15415'
volume: 5
year: '2008'
...
---
_id: '16463'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Barbara
full_name: Schneider, Barbara
last_name: Schneider
citation:
ama: 'Meyer auf der Heide F, Schneider B. Local Strategies for Connecting Stations
by Small Robotic Networks. In: Biologically-Inspired Collaborative Computing.
Boston, MA; 2008. doi:10.1007/978-0-387-09655-1_9'
apa: Meyer auf der Heide, F., & Schneider, B. (2008). Local Strategies for Connecting
Stations by Small Robotic Networks. In Biologically-Inspired Collaborative
Computing. Boston, MA. https://doi.org/10.1007/978-0-387-09655-1_9
bibtex: '@inbook{Meyer auf der Heide_Schneider_2008, place={Boston, MA}, title={Local
Strategies for Connecting Stations by Small Robotic Networks}, DOI={10.1007/978-0-387-09655-1_9},
booktitle={Biologically-Inspired Collaborative Computing}, author={Meyer auf der
Heide, Friedhelm and Schneider, Barbara}, year={2008} }'
chicago: Meyer auf der Heide, Friedhelm, and Barbara Schneider. “Local Strategies
for Connecting Stations by Small Robotic Networks.” In Biologically-Inspired
Collaborative Computing. Boston, MA, 2008. https://doi.org/10.1007/978-0-387-09655-1_9.
ieee: F. Meyer auf der Heide and B. Schneider, “Local Strategies for Connecting
Stations by Small Robotic Networks,” in Biologically-Inspired Collaborative
Computing, Boston, MA, 2008.
mla: Meyer auf der Heide, Friedhelm, and Barbara Schneider. “Local Strategies for
Connecting Stations by Small Robotic Networks.” Biologically-Inspired Collaborative
Computing, 2008, doi:10.1007/978-0-387-09655-1_9.
short: 'F. Meyer auf der Heide, B. Schneider, in: Biologically-Inspired Collaborative
Computing, Boston, MA, 2008.'
date_created: 2020-04-08T08:32:22Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-0-387-09655-1_9
language:
- iso: eng
place: Boston, MA
publication: Biologically-Inspired Collaborative Computing
publication_identifier:
isbn:
- '9780387096544'
- '9780387096551'
issn:
- 1571-5736
publication_status: published
status: public
title: Local Strategies for Connecting Stations by Small Robotic Networks
type: book_chapter
user_id: '15415'
year: '2008'
...
---
_id: '16464'
author:
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Gehweiler J, Meyer auf der Heide F. Bin Packing oder „Wie bekomme ich die
Klamotten in die Kisten?“. In: Taschenbuch Der Algorithmen. Berlin, Heidelberg;
2008. doi:10.1007/978-3-540-76394-9_40'
apa: Gehweiler, J., & Meyer auf der Heide, F. (2008). Bin Packing oder „Wie
bekomme ich die Klamotten in die Kisten?“. In Taschenbuch der Algorithmen.
Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76394-9_40
bibtex: '@inbook{Gehweiler_Meyer auf der Heide_2008, place={Berlin, Heidelberg},
title={Bin Packing oder „Wie bekomme ich die Klamotten in die Kisten?“}, DOI={10.1007/978-3-540-76394-9_40},
booktitle={Taschenbuch der Algorithmen}, author={Gehweiler, Joachim and Meyer
auf der Heide, Friedhelm}, year={2008} }'
chicago: Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing Oder
„Wie Bekomme Ich Die Klamotten in Die Kisten?“.” In Taschenbuch Der Algorithmen.
Berlin, Heidelberg, 2008. https://doi.org/10.1007/978-3-540-76394-9_40.
ieee: J. Gehweiler and F. Meyer auf der Heide, “Bin Packing oder „Wie bekomme ich
die Klamotten in die Kisten?“,” in Taschenbuch der Algorithmen, Berlin,
Heidelberg, 2008.
mla: Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing Oder „Wie
Bekomme Ich Die Klamotten in Die Kisten?“.” Taschenbuch Der Algorithmen,
2008, doi:10.1007/978-3-540-76394-9_40.
short: 'J. Gehweiler, F. Meyer auf der Heide, in: Taschenbuch Der Algorithmen, Berlin,
Heidelberg, 2008.'
date_created: 2020-04-08T08:39:36Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-540-76394-9_40
language:
- iso: eng
place: Berlin, Heidelberg
publication: Taschenbuch der Algorithmen
publication_identifier:
isbn:
- '9783540763932'
- '9783540763949'
publication_status: published
status: public
title: Bin Packing oder „Wie bekomme ich die Klamotten in die Kisten?“
type: book_chapter
user_id: '15415'
year: '2008'
...
---
_id: '16465'
abstract:
- lang: eng
text: "For a fixed virtual scene (=collection of simplices) S and given observer\r\nposition
p, how many elements of S are weakly visible (i.e. not fully occluded\r\nby others)
from p? The present work explores the trade-off between query time\r\nand preprocessing
space for these quantities in 2D: exactly, in the approximate\r\ndeterministic,
and in the probabilistic sense. We deduce the EXISTENCE of an\r\nO(m^2/n^2) space
data structure for S that, given p and time O(log n), allows\r\nto approximate
the ratio of occluded segments up to arbitrary constant absolute\r\nerror; here
m denotes the size of the Visibility Graph--which may be quadratic,\r\nbut typically
is just linear in the size n of the scene S. On the other hand,\r\nwe present
a data structure CONSTRUCTIBLE in O(n*log(n)+m^2*polylog(n)/k)\r\npreprocessing
time and space with similar approximation properties and query\r\ntime O(k*polylog
n), where karXiv:08100052. 2008.
apa: Fischer, M., Hilbig, M., Jähn, C., Meyer auf der Heide, F., & Ziegler,
M. (2008). Planar Visibility Counting. ArXiv:0810.0052.
bibtex: '@article{Fischer_Hilbig_Jähn_Meyer auf der Heide_Ziegler_2008, title={Planar
Visibility Counting}, journal={arXiv:0810.0052}, author={Fischer, Matthias and
Hilbig, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Ziegler,
Martin}, year={2008} }'
chicago: Fischer, Matthias, Matthias Hilbig, Claudius Jähn, Friedhelm Meyer auf
der Heide, and Martin Ziegler. “Planar Visibility Counting.” ArXiv:0810.0052,
2008.
ieee: M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, and M. Ziegler, “Planar
Visibility Counting,” arXiv:0810.0052. 2008.
mla: Fischer, Matthias, et al. “Planar Visibility Counting.” ArXiv:0810.0052,
2008.
short: M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, M. Ziegler, ArXiv:0810.0052
(2008).
date_created: 2020-04-08T08:41:52Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
external_id:
arxiv:
- '0810.0052'
language:
- iso: eng
publication: arXiv:0810.0052
status: public
title: Planar Visibility Counting
type: preprint
user_id: '15415'
year: '2008'
...
---
_id: '16466'
citation:
ama: Meyer auf der Heide F, Shavit N, eds. Proceedings of the Twentieth Annual
Symposium on Parallelism in Algorithms and Architectures - SPAA ’08. ACM;
2008. doi:10.1145/1378533
apa: Meyer auf der Heide, F., & Shavit, N. (Eds.). (2008). Proceedings of
the twentieth annual symposium on Parallelism in algorithms and architectures
- SPAA ’08. ACM. https://doi.org/10.1145/1378533
bibtex: '@book{Meyer auf der Heide_Shavit_2008, title={Proceedings of the twentieth
annual symposium on Parallelism in algorithms and architectures - SPAA ’08}, DOI={10.1145/1378533}, publisher={ACM},
year={2008} }'
chicago: Meyer auf der Heide, Friedhelm, and Nir Shavit, eds. Proceedings of
the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures
- SPAA ’08. ACM, 2008. https://doi.org/10.1145/1378533.
ieee: F. Meyer auf der Heide and N. Shavit, Eds., Proceedings of the twentieth
annual symposium on Parallelism in algorithms and architectures - SPAA ’08.
ACM, 2008.
mla: Meyer auf der Heide, Friedhelm, and Nir Shavit, editors. Proceedings of
the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures
- SPAA ’08. ACM, 2008, doi:10.1145/1378533.
short: F. Meyer auf der Heide, N. Shavit, eds., Proceedings of the Twentieth Annual
Symposium on Parallelism in Algorithms and Architectures - SPAA ’08, ACM, 2008.
date_created: 2020-04-08T08:46:08Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1378533
editor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
language:
- iso: eng
publication_identifier:
isbn:
- 978-1-59593-973-9
publication_status: published
publisher: ACM
status: public
title: Proceedings of the twentieth annual symposium on Parallelism in algorithms
and architectures - SPAA '08
type: conference_editor
user_id: '15415'
year: '2008'
...
---
_id: '19689'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Piotr
full_name: Krysta, Piotr
last_name: Krysta
citation:
ama: 'Briest P, Krysta P. Buying Cheap is Expensive: Hardness of Non-Parametric
Multi-Product Pricing. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete
Algorithms (SODA). ; 2007.'
apa: 'Briest, P., & Krysta, P. (2007). Buying Cheap is Expensive: Hardness of
Non-Parametric Multi-Product Pricing. In Proceedings of the 18th ACM-SIAM Symposium
on Discrete Algorithms (SODA).'
bibtex: '@inproceedings{Briest_Krysta_2007, title={Buying Cheap is Expensive: Hardness
of Non-Parametric Multi-Product Pricing}, booktitle={Proceedings of the 18th ACM-SIAM
Symposium on Discrete Algorithms (SODA)}, author={Briest, Patrick and Krysta,
Piotr}, year={2007} }'
chicago: 'Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Hardness
of Non-Parametric Multi-Product Pricing.” In Proceedings of the 18th ACM-SIAM
Symposium on Discrete Algorithms (SODA), 2007.'
ieee: 'P. Briest and P. Krysta, “Buying Cheap is Expensive: Hardness of Non-Parametric
Multi-Product Pricing,” in Proceedings of the 18th ACM-SIAM Symposium on Discrete
Algorithms (SODA), 2007.'
mla: 'Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Hardness of
Non-Parametric Multi-Product Pricing.” Proceedings of the 18th ACM-SIAM Symposium
on Discrete Algorithms (SODA), 2007.'
short: 'P. Briest, P. Krysta, in: Proceedings of the 18th ACM-SIAM Symposium on
Discrete Algorithms (SODA), 2007.'
date_created: 2020-09-25T10:19:13Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
language:
- iso: eng
publication: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA)
status: public
title: 'Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing'
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '19725'
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
citation:
ama: 'Bonorden O. Load Balancing in the Bulk-Synchronous-Parallel Setting using
Process Migrations. In: 2007 IEEE International Parallel and Distributed Processing
Symposium. ; 2007. doi:10.1109/ipdps.2007.370330'
apa: Bonorden, O. (2007). Load Balancing in the Bulk-Synchronous-Parallel Setting
using Process Migrations. In 2007 IEEE International Parallel and Distributed
Processing Symposium. https://doi.org/10.1109/ipdps.2007.370330
bibtex: '@inproceedings{Bonorden_2007, title={Load Balancing in the Bulk-Synchronous-Parallel
Setting using Process Migrations}, DOI={10.1109/ipdps.2007.370330},
booktitle={2007 IEEE International Parallel and Distributed Processing Symposium},
author={Bonorden, Olaf}, year={2007} }'
chicago: Bonorden, Olaf. “Load Balancing in the Bulk-Synchronous-Parallel Setting
Using Process Migrations.” In 2007 IEEE International Parallel and Distributed
Processing Symposium, 2007. https://doi.org/10.1109/ipdps.2007.370330.
ieee: O. Bonorden, “Load Balancing in the Bulk-Synchronous-Parallel Setting using
Process Migrations,” in 2007 IEEE International Parallel and Distributed Processing
Symposium, 2007.
mla: Bonorden, Olaf. “Load Balancing in the Bulk-Synchronous-Parallel Setting Using
Process Migrations.” 2007 IEEE International Parallel and Distributed Processing
Symposium, 2007, doi:10.1109/ipdps.2007.370330.
short: 'O. Bonorden, in: 2007 IEEE International Parallel and Distributed Processing
Symposium, 2007.'
date_created: 2020-09-28T10:34:50Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: 10.1109/ipdps.2007.370330
language:
- iso: eng
publication: 2007 IEEE International Parallel and Distributed Processing Symposium
publication_identifier:
isbn:
- '1424409098'
publication_status: published
status: public
title: Load Balancing in the Bulk-Synchronous-Parallel Setting using Process Migrations
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '19809'
abstract:
- lang: eng
text: "For the first time, the problem of optimizing energy for communication and
motion is investigated. We consider a single mobile robot with continuous high
bandwidth wireless communication, e.g. caused by a multimedia application like
video surveillance. This robot is connected to a radio base station and moves
with constant speed from a given starting point on the plane to a target point.
The task is to find the best path such that the energy consumption for mobility
and the communication is optimized. This is motivated by the fact that the energy\r\nconsumption
of radio devices increases polynomially (at least to\r\nthe power of two) with
the transmission distance. We introduce efficient approximation algorithms finding
the optimal path given the starting point, the target point and the position of
the radio stations. We exemplify the influence of the communication cost by a
starting scenario with one radio station. We study the performance of the proposed
algorithm in simulation, compare it with the scenario without applying our approach,
and present the results."
author:
- first_name: Chia Ching
full_name: Ooi, Chia Ching
last_name: Ooi
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Ooi CC, Schindelhauer C. Minimal Energy Path Planning for Wireless Robots.
In: ROBOCOMM’07: Proc. of the 1st International Conference on Robot Communication
and Coordination. ; 2007:309-321. doi:10.1007/s11036-008-0150-5'
apa: 'Ooi, C. C., & Schindelhauer, C. (2007). Minimal Energy Path Planning for
Wireless Robots. In ROBOCOMM’07: Proc. of the 1st International Conference
on Robot Communication and Coordination (pp. 309–321). https://doi.org/10.1007/s11036-008-0150-5'
bibtex: '@inproceedings{Ooi_Schindelhauer_2007, title={Minimal Energy Path Planning
for Wireless Robots}, DOI={10.1007/s11036-008-0150-5},
booktitle={ROBOCOMM’07: Proc. of the 1st International Conference on Robot Communication
and Coordination}, author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2007},
pages={309–321} }'
chicago: 'Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning
for Wireless Robots.” In ROBOCOMM’07: Proc. of the 1st International Conference
on Robot Communication and Coordination, 309–21, 2007. https://doi.org/10.1007/s11036-008-0150-5.'
ieee: 'C. C. Ooi and C. Schindelhauer, “Minimal Energy Path Planning for Wireless
Robots,” in ROBOCOMM’07: Proc. of the 1st International Conference on Robot
Communication and Coordination, 2007, pp. 309–321.'
mla: 'Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning
for Wireless Robots.” ROBOCOMM’07: Proc. of the 1st International Conference
on Robot Communication and Coordination, 2007, pp. 309–21, doi:10.1007/s11036-008-0150-5.'
short: 'C.C. Ooi, C. Schindelhauer, in: ROBOCOMM’07: Proc. of the 1st International
Conference on Robot Communication and Coordination, 2007, pp. 309–321.'
date_created: 2020-09-30T13:15:46Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/s11036-008-0150-5
language:
- iso: eng
page: 309-321
publication: 'ROBOCOMM''07: Proc. of the 1st International Conference on Robot Communication
and Coordination'
publication_identifier:
issn:
- 1383-469X
- 1572-8153
publication_status: published
status: public
title: Minimal Energy Path Planning for Wireless Robots
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '19853'
author:
- first_name: Gunnar
full_name: Schomaker, Gunnar
last_name: Schomaker
citation:
ama: 'Schomaker G. DHHT-RAID: A Distributed Heterogeneous Scalable Architecture
for Dynamic Storage Environments. In: Advanced Information Networking and Applications
(AINA-07). Vol 21. ; 2007:331-339. doi:10.1109/aina.2007.59'
apa: 'Schomaker, G. (2007). DHHT-RAID: A Distributed Heterogeneous Scalable Architecture
for Dynamic Storage Environments. In Advanced Information Networking and Applications
(AINA-07) (Vol. 21, pp. 331–339). https://doi.org/10.1109/aina.2007.59'
bibtex: '@inproceedings{Schomaker_2007, title={DHHT-RAID: A Distributed Heterogeneous
Scalable Architecture for Dynamic Storage Environments}, volume={21}, DOI={10.1109/aina.2007.59}, booktitle={Advanced
Information Networking and Applications (AINA-07)}, author={Schomaker, Gunnar},
year={2007}, pages={331–339} }'
chicago: 'Schomaker, Gunnar. “DHHT-RAID: A Distributed Heterogeneous Scalable Architecture
for Dynamic Storage Environments.” In Advanced Information Networking and Applications
(AINA-07), 21:331–39, 2007. https://doi.org/10.1109/aina.2007.59.'
ieee: 'G. Schomaker, “DHHT-RAID: A Distributed Heterogeneous Scalable Architecture
for Dynamic Storage Environments,” in Advanced Information Networking and Applications
(AINA-07), 2007, vol. 21, pp. 331–339.'
mla: 'Schomaker, Gunnar. “DHHT-RAID: A Distributed Heterogeneous Scalable Architecture
for Dynamic Storage Environments.” Advanced Information Networking and Applications
(AINA-07), vol. 21, 2007, pp. 331–39, doi:10.1109/aina.2007.59.'
short: 'G. Schomaker, in: Advanced Information Networking and Applications (AINA-07),
2007, pp. 331–339.'
date_created: 2020-10-02T11:49:58Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1109/aina.2007.59
intvolume: ' 21'
language:
- iso: eng
page: 331-339
publication: Advanced Information Networking and Applications (AINA-07)
publication_identifier:
isbn:
- '0769528465'
issn:
- 1550-445X
publication_status: published
status: public
title: 'DHHT-RAID: A Distributed Heterogeneous Scalable Architecture for Dynamic Storage
Environments'
type: conference
user_id: '15415'
volume: 21
year: '2007'
...
---
_id: '24276'
abstract:
- lang: eng
text: "We define a natural generalization of the prominent k-server problem, the
k-resource problem. It occurs in metric spaces with some demands and resources
given at its points. The demands may vary with time, but the total demand may
never exceed k. The goal of an online algorithm is to satisfy demands by moving
resources, while minimizing the cost for transporting resources. We give an asymptotically
optimal O(log(min {n,k}))-competitive randomized algorithm and an O(min {k,n})-competitive
deterministic one for the k-resource problem on uniform metric spaces consisting
of n points. This extends known results for paging to the more general setting
of k-resource.\r\nBasing on the results for uniform metric spaces, we develop
a randomized algorithm solving the k-resource and the k-server problem on metric
spaces which can be decomposed into components far away from each other. The algorithm
achieves a competitive ratio of O(log(min {n,k})), provided that it has some extra
resources more than the optimal algorithm.\r\n"
author:
- first_name: Marcin
full_name: Bienkowski, Marcin
last_name: Bienkowski
- first_name: Jarosław
full_name: Kutyłowski, Jarosław
last_name: Kutyłowski
citation:
ama: 'Bienkowski M, Kutyłowski J. The k-Resource Problem on Uniform and on Uniformly
Decomposable Metric Spaces. In: Lecture Notes in Computer Science. ; 2007.
doi:10.1007/978-3-540-73951-7_30'
apa: Bienkowski, M., & Kutyłowski, J. (2007). The k-Resource Problem on Uniform
and on Uniformly Decomposable Metric Spaces. Lecture Notes in Computer Science.
https://doi.org/10.1007/978-3-540-73951-7_30
bibtex: '@inproceedings{Bienkowski_Kutyłowski_2007, place={Berlin, Heidelberg},
title={The k-Resource Problem on Uniform and on Uniformly Decomposable Metric
Spaces}, DOI={10.1007/978-3-540-73951-7_30},
booktitle={Lecture Notes in Computer Science}, author={Bienkowski, Marcin and
Kutyłowski, Jarosław}, year={2007} }'
chicago: Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on
Uniform and on Uniformly Decomposable Metric Spaces.” In Lecture Notes in Computer
Science. Berlin, Heidelberg, 2007. https://doi.org/10.1007/978-3-540-73951-7_30.
ieee: 'M. Bienkowski and J. Kutyłowski, “The k-Resource Problem on Uniform and on
Uniformly Decomposable Metric Spaces,” 2007, doi: 10.1007/978-3-540-73951-7_30.'
mla: Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on Uniform
and on Uniformly Decomposable Metric Spaces.” Lecture Notes in Computer Science,
2007, doi:10.1007/978-3-540-73951-7_30.
short: 'M. Bienkowski, J. Kutyłowski, in: Lecture Notes in Computer Science, Berlin,
Heidelberg, 2007.'
date_created: 2021-09-13T13:07:57Z
date_updated: 2022-01-06T06:56:13Z
department:
- _id: '63'
doi: 10.1007/978-3-540-73951-7_30
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '24366'
abstract:
- lang: eng
text: "Dieses Buch beschäftigt sich mit Algorithmen und Methoden der Peer-to-Peer-Netzwerke
und gibt einen Einblick in die aktuelle Forschung.\r\n\r\nUrsprünglich waren Peer-to-Peer-Netzwerke
nur für File-Sharing konzipiert. Mittlerweile hat sich Peer-to-Peer zum Paradigma
für Rechnernetzwerke entwickelt. Ziel dieses Buches ist es, dem Leser ein grundlegendes
Verständnis der Techniken hinter den aktuellen Peer-to-Peer-Netzwerken aufzuzeigen
und im nächsten Schritt Algorithmen vorzustellen, die vielleicht erst in einigen
Jahren umgesetzt werden.\r\n\r\nDas Buch richtet sich in erster Linie an Informatiker
(Studenten ab dem 5. Semester). Aber auch interessierte Nichtinformatiker können
von diesem Buch profitieren, wobei grundlegende Kenntnisse aus den Bereichen der
Mathematik und Informatik vorausgesetzt werden. Die Ziele, Kernaussagen und Ergebnisse
sollten jedoch auch ohne akademischen Hintergrund klar werden."
author:
- first_name: Peter
full_name: Mahlmann, Peter
last_name: Mahlmann
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: Mahlmann P, Schindelhauer C. Peer-to-Peer-Netzwerke. Springer; 2007.
doi:10.1007/978-3-540-33992-2
apa: Mahlmann, P., & Schindelhauer, C. (2007). Peer-to-Peer-Netzwerke.
Springer. https://doi.org/10.1007/978-3-540-33992-2
bibtex: '@book{Mahlmann_Schindelhauer_2007, place={Berlin}, title={Peer-to-Peer-Netzwerke},
DOI={10.1007/978-3-540-33992-2},
publisher={Springer}, author={Mahlmann, Peter and Schindelhauer, Christian}, year={2007}
}'
chicago: 'Mahlmann, Peter, and Christian Schindelhauer. Peer-to-Peer-Netzwerke.
Berlin: Springer, 2007. https://doi.org/10.1007/978-3-540-33992-2.'
ieee: 'P. Mahlmann and C. Schindelhauer, Peer-to-Peer-Netzwerke. Berlin:
Springer, 2007.'
mla: Mahlmann, Peter, and Christian Schindelhauer. Peer-to-Peer-Netzwerke.
Springer, 2007, doi:10.1007/978-3-540-33992-2.
short: P. Mahlmann, C. Schindelhauer, Peer-to-Peer-Netzwerke, Springer, Berlin,
2007.
date_created: 2021-09-14T10:29:29Z
date_updated: 2022-01-06T06:56:18Z
department:
- _id: '63'
doi: 10.1007/978-3-540-33992-2
language:
- iso: eng
place: Berlin
publication_identifier:
isbn:
- '9783540339915'
publication_status: published
publisher: Springer
status: public
title: Peer-to-Peer-Netzwerke
type: book
user_id: '15415'
year: '2007'
...
---
_id: '17567'
author:
- first_name: Stefano
full_name: Leonardi, Stefano
last_name: Leonardi
- first_name: Peter
full_name: Mahlmann, Peter
last_name: Mahlmann
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Paul G.
full_name: Spirakis, Paul G.
last_name: Spirakis
- first_name: Gerhard
full_name: Weikum, Gerhard
last_name: Weikum
citation:
ama: Leonardi S, Mahlmann P, Meyer auf der Heide F, Spirakis PG, Weikum G. Guarding
our digital society’s well-being. e-Strategies, www.britishpublishers.com.
2007;3-10-2007.
apa: Leonardi, S., Mahlmann, P., Meyer auf der Heide, F., Spirakis, P. G., &
Weikum, G. (2007). Guarding our digital society’s well-being. E-Strategies,
Www.Britishpublishers.Com, 3-10–2007.
bibtex: '@article{Leonardi_Mahlmann_Meyer auf der Heide_Spirakis_Weikum_2007, title={Guarding
our digital society’s well-being}, volume={3-10–2007}, journal={e-Strategies,
www.britishpublishers.com}, author={Leonardi, Stefano and Mahlmann, Peter and
Meyer auf der Heide, Friedhelm and Spirakis, Paul G. and Weikum, Gerhard}, year={2007}
}'
chicago: Leonardi, Stefano, Peter Mahlmann, Friedhelm Meyer auf der Heide, Paul
G. Spirakis, and Gerhard Weikum. “Guarding Our Digital Society’s Well-Being.”
E-Strategies, Www.Britishpublishers.Com 3-10–2007 (2007).
ieee: S. Leonardi, P. Mahlmann, F. Meyer auf der Heide, P. G. Spirakis, and G. Weikum,
“Guarding our digital society’s well-being,” e-Strategies, www.britishpublishers.com,
vol. 3-10–2007, 2007.
mla: Leonardi, Stefano, et al. “Guarding Our Digital Society’s Well-Being.” E-Strategies,
Www.Britishpublishers.Com, vol. 3-10–2007, 2007.
short: S. Leonardi, P. Mahlmann, F. Meyer auf der Heide, P.G. Spirakis, G. Weikum,
E-Strategies, Www.Britishpublishers.Com 3-10–2007 (2007).
date_created: 2020-08-03T14:26:31Z
date_updated: 2022-01-06T06:53:15Z
department:
- _id: '63'
language:
- iso: eng
publication: e-Strategies, www.britishpublishers.com
status: public
title: Guarding our digital society's well-being
type: journal_article
user_id: '15415'
volume: 3-10-2007
year: '2007'
...
---
_id: '18928'
author:
- first_name: Miroslaw
full_name: Dynia, Miroslaw
last_name: Dynia
- first_name: Jakub
full_name: Łopuszański, Jakub
last_name: Łopuszański
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Dynia M, Łopuszański J, Schindelhauer C. Why Robots Need Maps. In: Proc.
of the 14th Colloquium on Structural Information and Communication Complexity
(SIROCCO). ; 2007:37-- 46. doi:10.1007/978-3-540-72951-8_5'
apa: Dynia, M., Łopuszański, J., & Schindelhauer, C. (2007). Why Robots Need
Maps. In Proc. of the 14th Colloquium on Structural Information and Communication
Complexity (SIROCCO) (pp. 37-- 46). https://doi.org/10.1007/978-3-540-72951-8_5
bibtex: '@inproceedings{Dynia_Łopuszański_Schindelhauer_2007, title={Why Robots
Need Maps}, DOI={10.1007/978-3-540-72951-8_5},
booktitle={Proc. of the 14th Colloquium on Structural Information and Communication
Complexity (SIROCCO)}, author={Dynia, Miroslaw and Łopuszański, Jakub and Schindelhauer,
Christian}, year={2007}, pages={37-- 46} }'
chicago: Dynia, Miroslaw, Jakub Łopuszański, and Christian Schindelhauer. “Why Robots
Need Maps.” In Proc. of the 14th Colloquium on Structural Information and Communication
Complexity (SIROCCO), 37-- 46, 2007. https://doi.org/10.1007/978-3-540-72951-8_5.
ieee: M. Dynia, J. Łopuszański, and C. Schindelhauer, “Why Robots Need Maps,” in
Proc. of the 14th Colloquium on Structural Information and Communication Complexity
(SIROCCO), 2007, pp. 37-- 46.
mla: Dynia, Miroslaw, et al. “Why Robots Need Maps.” Proc. of the 14th Colloquium
on Structural Information and Communication Complexity (SIROCCO), 2007, pp.
37-- 46, doi:10.1007/978-3-540-72951-8_5.
short: 'M. Dynia, J. Łopuszański, C. Schindelhauer, in: Proc. of the 14th Colloquium
on Structural Information and Communication Complexity (SIROCCO), 2007, pp. 37--
46.'
date_created: 2020-09-03T10:24:29Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '63'
doi: 10.1007/978-3-540-72951-8_5
language:
- iso: eng
page: 37-- 46
publication: Proc. of the 14th Colloquium on Structural Information and Communication
Complexity (SIROCCO)
publication_identifier:
isbn:
- '9783540729181'
- '9783540729518'
publication_status: published
status: public
title: Why Robots Need Maps
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '18929'
author:
- first_name: Miroslaw
full_name: Dynia, Miroslaw
last_name: Dynia
- first_name: Miroslaw
full_name: Korzeniowski, Miroslaw
last_name: Korzeniowski
- first_name: Jarosław
full_name: Kutyłowski, Jarosław
last_name: Kutyłowski
citation:
ama: 'Dynia M, Korzeniowski M, Kutyłowski J. Competitive Maintenance of Minimum
Spanning Trees in Dynamic Graphs. In: Proc. of the 33rd International Conference
on Current Trends in Theory and Practice of Computer Science (SOFSEM’07).
Vol 4362. ; 2007:260--271. doi:10.1007/978-3-540-69507-3_21'
apa: Dynia, M., Korzeniowski, M., & Kutyłowski, J. (2007). Competitive Maintenance
of Minimum Spanning Trees in Dynamic Graphs. In Proc. of the 33rd International
Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07)
(Vol. 4362, pp. 260--271). https://doi.org/10.1007/978-3-540-69507-3_21
bibtex: '@inproceedings{Dynia_Korzeniowski_Kutyłowski_2007, title={Competitive Maintenance
of Minimum Spanning Trees in Dynamic Graphs}, volume={4362}, DOI={10.1007/978-3-540-69507-3_21},
booktitle={Proc. of the 33rd International Conference on Current Trends in Theory
and Practice of Computer Science (SOFSEM’07)}, author={Dynia, Miroslaw and Korzeniowski,
Miroslaw and Kutyłowski, Jarosław}, year={2007}, pages={260--271} }'
chicago: Dynia, Miroslaw, Miroslaw Korzeniowski, and Jarosław Kutyłowski. “Competitive
Maintenance of Minimum Spanning Trees in Dynamic Graphs.” In Proc. of the 33rd
International Conference on Current Trends in Theory and Practice of Computer
Science (SOFSEM’07), 4362:260--271, 2007. https://doi.org/10.1007/978-3-540-69507-3_21.
ieee: M. Dynia, M. Korzeniowski, and J. Kutyłowski, “Competitive Maintenance of
Minimum Spanning Trees in Dynamic Graphs,” in Proc. of the 33rd International
Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07),
2007, vol. 4362, pp. 260--271.
mla: Dynia, Miroslaw, et al. “Competitive Maintenance of Minimum Spanning Trees
in Dynamic Graphs.” Proc. of the 33rd International Conference on Current Trends
in Theory and Practice of Computer Science (SOFSEM’07), vol. 4362, 2007, pp.
260--271, doi:10.1007/978-3-540-69507-3_21.
short: 'M. Dynia, M. Korzeniowski, J. Kutyłowski, in: Proc. of the 33rd International
Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07),
2007, pp. 260--271.'
date_created: 2020-09-03T10:29:52Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '63'
doi: 10.1007/978-3-540-69507-3_21
intvolume: ' 4362'
language:
- iso: eng
page: 260--271
publication: Proc. of the 33rd International Conference on Current Trends in Theory
and Practice of Computer Science (SOFSEM'07)
publication_identifier:
isbn:
- '9783540695066'
- '9783540695073'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
type: conference
user_id: '15415'
volume: 4362
year: '2007'
...
---
_id: '18931'
author:
- first_name: Jaroslaw
full_name: Kutylowski, Jaroslaw
last_name: Kutylowski
citation:
ama: Kutylowski J. Using Mobile Relays for Ensuring Connectivity in Sparse Networks.;
2007.
apa: Kutylowski, J. (2007). Using Mobile Relays for Ensuring Connectivity in
Sparse Networks.
bibtex: '@book{Kutylowski_2007, place={Universität Paderborn}, title={Using Mobile
Relays for Ensuring Connectivity in Sparse Networks}, author={Kutylowski, Jaroslaw},
year={2007} }'
chicago: Kutylowski, Jaroslaw. Using Mobile Relays for Ensuring Connectivity
in Sparse Networks. Universität Paderborn, 2007.
ieee: J. Kutylowski, Using Mobile Relays for Ensuring Connectivity in Sparse
Networks. Universität Paderborn, 2007.
mla: Kutylowski, Jaroslaw. Using Mobile Relays for Ensuring Connectivity in Sparse
Networks. 2007.
short: J. Kutylowski, Using Mobile Relays for Ensuring Connectivity in Sparse Networks,
Universität Paderborn, 2007.
date_created: 2020-09-03T10:51:14Z
date_updated: 2022-01-06T06:53:54Z
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-20080225023
status: public
title: Using Mobile Relays for Ensuring Connectivity in Sparse Networks
type: dissertation
user_id: '15415'
year: '2007'
...
---
_id: '18933'
author:
- first_name: Jaroslaw
full_name: Kutylowski, Jaroslaw
last_name: Kutylowski
citation:
ama: Kutylowski J. Competitive Maintenance of Minimum Spanning Trees under Stochastic
Adversaries. 2007.
apa: Kutylowski, J. (2007). Competitive Maintenance of Minimum Spanning Trees under
Stochastic Adversaries.
bibtex: '@article{Kutylowski_2007, title={Competitive Maintenance of Minimum Spanning
Trees under Stochastic Adversaries}, author={Kutylowski, Jaroslaw}, year={2007}
}'
chicago: Kutylowski, Jaroslaw. “Competitive Maintenance of Minimum Spanning Trees
under Stochastic Adversaries,” 2007.
ieee: J. Kutylowski, “Competitive Maintenance of Minimum Spanning Trees under Stochastic
Adversaries.” 2007.
mla: Kutylowski, Jaroslaw. Competitive Maintenance of Minimum Spanning Trees
under Stochastic Adversaries. 2007.
short: J. Kutylowski, (2007).
date_created: 2020-09-03T10:59:51Z
date_updated: 2022-01-06T06:53:55Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-03T10:59:07Z
date_updated: 2020-09-03T10:59:07Z
file_id: '18934'
file_name: pub-hni-2854.pdf
file_size: 229166
relation: main_file
success: 1
file_date_updated: 2020-09-03T10:59:07Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: Competitive Maintenance of Minimum Spanning Trees under Stochastic Adversaries
type: preprint
user_id: '15415'
year: '2007'
...
---
_id: '20374'
author:
- first_name: Marco
full_name: Dorigo, Marco
last_name: Dorigo
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Marc
full_name: Szymanski, Marc
last_name: Szymanski
- first_name: Heinz
full_name: Wörn, Heinz
last_name: Wörn
- first_name: Yuhui
full_name: Shi, Yuhui
last_name: Shi
citation:
ama: 'Dorigo M, Hamann H, Szymanski M, Wörn H, Shi Y. Orientation in a Trail Network
by Exploiting its Geometry for Swarm Robotics. In: IEEE Swarm Intelligence
Symposium, Honolulu, USA, April 1-5. IEEE Press; 2007:310--315. doi:10.1109/SIS.2007.367953'
apa: Dorigo, M., Hamann, H., Szymanski, M., Wörn, H., & Shi, Y. (2007). Orientation
in a Trail Network by Exploiting its Geometry for Swarm Robotics. In IEEE Swarm
Intelligence Symposium, Honolulu, USA, April 1-5 (pp. 310--315). IEEE Press.
https://doi.org/10.1109/SIS.2007.367953
bibtex: '@inproceedings{Dorigo_Hamann_Szymanski_Wörn_Shi_2007, title={Orientation
in a Trail Network by Exploiting its Geometry for Swarm Robotics}, DOI={10.1109/SIS.2007.367953},
booktitle={IEEE Swarm Intelligence Symposium, Honolulu, USA, April 1-5}, publisher={IEEE
Press}, author={Dorigo, Marco and Hamann, Heiko and Szymanski, Marc and Wörn,
Heinz and Shi, Yuhui}, year={2007}, pages={310--315} }'
chicago: Dorigo, Marco, Heiko Hamann, Marc Szymanski, Heinz Wörn, and Yuhui Shi.
“Orientation in a Trail Network by Exploiting Its Geometry for Swarm Robotics.”
In IEEE Swarm Intelligence Symposium, Honolulu, USA, April 1-5, 310--315.
IEEE Press, 2007. https://doi.org/10.1109/SIS.2007.367953.
ieee: M. Dorigo, H. Hamann, M. Szymanski, H. Wörn, and Y. Shi, “Orientation in a
Trail Network by Exploiting its Geometry for Swarm Robotics,” in IEEE Swarm
Intelligence Symposium, Honolulu, USA, April 1-5, 2007, pp. 310--315.
mla: Dorigo, Marco, et al. “Orientation in a Trail Network by Exploiting Its Geometry
for Swarm Robotics.” IEEE Swarm Intelligence Symposium, Honolulu, USA, April
1-5, IEEE Press, 2007, pp. 310--315, doi:10.1109/SIS.2007.367953.
short: 'M. Dorigo, H. Hamann, M. Szymanski, H. Wörn, Y. Shi, in: IEEE Swarm Intelligence
Symposium, Honolulu, USA, April 1-5, IEEE Press, 2007, pp. 310--315.'
date_created: 2020-11-17T14:59:51Z
date_updated: 2022-01-06T06:54:26Z
department:
- _id: '63'
- _id: '238'
doi: 10.1109/SIS.2007.367953
language:
- iso: eng
page: 310--315
publication: IEEE Swarm Intelligence Symposium, Honolulu, USA, April 1-5
publisher: IEEE Press
status: public
title: Orientation in a Trail Network by Exploiting its Geometry for Swarm Robotics
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '20431'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Heinz
full_name: Wörn, Heinz
last_name: Wörn
- first_name: Erol
full_name: Sahin, Erol
last_name: Sahin
- first_name: Winfield
full_name: Spears, Winfield
last_name: Spears
- first_name: Winfield
full_name: Winfield, Winfield
last_name: Winfield
citation:
ama: 'Hamann H, Wörn H, Sahin E, Spears W, Winfield W. An analytical and spatial
model of foraging in a swarm of robots. In: Swarm Robotics - Second SAB 2006
International Workshop. Vol 4433. ; 2007:43--55. doi:10.1007/978-3-540-71541-2_4'
apa: Hamann, H., Wörn, H., Sahin, E., Spears, W., & Winfield, W. (2007). An
analytical and spatial model of foraging in a swarm of robots. In Swarm Robotics
- Second SAB 2006 International Workshop (Vol. 4433, pp. 43--55). https://doi.org/10.1007/978-3-540-71541-2_4
bibtex: '@inproceedings{Hamann_Wörn_Sahin_Spears_Winfield_2007, title={An analytical
and spatial model of foraging in a swarm of robots}, volume={4433}, DOI={10.1007/978-3-540-71541-2_4},
booktitle={Swarm Robotics - Second SAB 2006 International Workshop}, author={Hamann,
Heiko and Wörn, Heinz and Sahin, Erol and Spears, Winfield and Winfield, Winfield},
year={2007}, pages={43--55} }'
chicago: Hamann, Heiko, Heinz Wörn, Erol Sahin, Winfield Spears, and Winfield Winfield.
“An Analytical and Spatial Model of Foraging in a Swarm of Robots.” In Swarm
Robotics - Second SAB 2006 International Workshop, 4433:43--55, 2007. https://doi.org/10.1007/978-3-540-71541-2_4.
ieee: H. Hamann, H. Wörn, E. Sahin, W. Spears, and W. Winfield, “An analytical and
spatial model of foraging in a swarm of robots,” in Swarm Robotics - Second
SAB 2006 International Workshop, 2007, vol. 4433, pp. 43--55.
mla: Hamann, Heiko, et al. “An Analytical and Spatial Model of Foraging in a Swarm
of Robots.” Swarm Robotics - Second SAB 2006 International Workshop, vol.
4433, 2007, pp. 43--55, doi:10.1007/978-3-540-71541-2_4.
short: 'H. Hamann, H. Wörn, E. Sahin, W. Spears, W. Winfield, in: Swarm Robotics
- Second SAB 2006 International Workshop, 2007, pp. 43--55.'
date_created: 2020-11-19T11:22:26Z
date_updated: 2022-01-06T06:54:27Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-540-71541-2_4
intvolume: ' 4433'
language:
- iso: eng
page: 43--55
publication: Swarm Robotics - Second SAB 2006 International Workshop
status: public
title: An analytical and spatial model of foraging in a swarm of robots
type: conference
user_id: '15415'
volume: 4433
year: '2007'
...
---
_id: '20432'
abstract:
- lang: eng
text: Designing and implementing artificial self-organizing systems is a challenging
task since they typically behave non- intuitive and only little theoretical foundations
exist. Predicting a system of many components with a huge amount of interactions
is beyond human skills. The currently common use of simulations for design support
is not satisfying, as it is time-consuming and the results are most likely sub-
optimal. In this work, we present the derivation of an analytical, time-, and
space-continuous model for a swarm of autonomous robots based on the Fokker-Planck
equation. While the motion model is in most parts physically motivated, the communication
model is based on a heuristic approach. A showcase application to a recently proposed
scenario of collective perception in a huge swarm of robots with very limited
abilities is given and the simulation results are compared to the model. Despite
the high level of abstraction, the prediction discrepancies are small and the
parameters can be mapped one-to-one from the model to the control algorithm. Finally,
we give an outlook on the capabilities of the proposed model, discuss its limitations,
and suggest an improvement that could reduce the number of empirically determined
parameters.
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Heinz
full_name: Wörn, Heinz
last_name: Wörn
citation:
ama: 'Hamann H, Wörn H. A Space- and Time-Continuous Model of Self-Organizing Robot
Swarms for Design Support. In: First International Conference on Self-Adaptive
and Self-Organizing Systems (SASO 2007). ; 2007:23--31. doi:10.1109/saso.2007.3'
apa: Hamann, H., & Wörn, H. (2007). A Space- and Time-Continuous Model of Self-Organizing
Robot Swarms for Design Support. In First International Conference on Self-Adaptive
and Self-Organizing Systems (SASO 2007) (pp. 23--31). https://doi.org/10.1109/saso.2007.3
bibtex: '@inproceedings{Hamann_Wörn_2007, title={A Space- and Time-Continuous Model
of Self-Organizing Robot Swarms for Design Support}, DOI={10.1109/saso.2007.3},
booktitle={First International Conference on Self-Adaptive and Self-Organizing
Systems (SASO 2007)}, author={Hamann, Heiko and Wörn, Heinz}, year={2007}, pages={23--31}
}'
chicago: Hamann, Heiko, and Heinz Wörn. “A Space- and Time-Continuous Model of Self-Organizing
Robot Swarms for Design Support.” In First International Conference on Self-Adaptive
and Self-Organizing Systems (SASO 2007), 23--31, 2007. https://doi.org/10.1109/saso.2007.3.
ieee: H. Hamann and H. Wörn, “A Space- and Time-Continuous Model of Self-Organizing
Robot Swarms for Design Support,” in First International Conference on Self-Adaptive
and Self-Organizing Systems (SASO 2007), 2007, pp. 23--31.
mla: Hamann, Heiko, and Heinz Wörn. “A Space- and Time-Continuous Model of Self-Organizing
Robot Swarms for Design Support.” First International Conference on Self-Adaptive
and Self-Organizing Systems (SASO 2007), 2007, pp. 23--31, doi:10.1109/saso.2007.3.
short: 'H. Hamann, H. Wörn, in: First International Conference on Self-Adaptive
and Self-Organizing Systems (SASO 2007), 2007, pp. 23--31.'
date_created: 2020-11-19T11:24:11Z
date_updated: 2022-01-06T06:54:27Z
department:
- _id: '63'
- _id: '238'
doi: 10.1109/saso.2007.3
language:
- iso: eng
page: 23--31
publication: First International Conference on Self-Adaptive and Self-Organizing Systems
(SASO 2007)
publication_identifier:
isbn:
- '0769529062'
publication_status: published
status: public
title: A Space- and Time-Continuous Model of Self-Organizing Robot Swarms for Design
Support
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '20433'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Heinz
full_name: Wörn, Heinz
last_name: Wörn
- first_name: Marius
full_name: Nagy, Marius
last_name: Nagy
- first_name: Naya
full_name: Nagy, Naya
last_name: Nagy
citation:
ama: Hamann H, Wörn H, Nagy M, Nagy N. Embodied Computation. Parallel Processing
Letters. 2007;17(3):287--298.
apa: Hamann, H., Wörn, H., Nagy, M., & Nagy, N. (2007). Embodied Computation.
Parallel Processing Letters, 17(3), 287--298.
bibtex: '@article{Hamann_Wörn_Nagy_Nagy_2007, title={Embodied Computation}, volume={17},
number={3}, journal={Parallel Processing Letters}, author={Hamann, Heiko and Wörn,
Heinz and Nagy, Marius and Nagy, Naya}, year={2007}, pages={287--298} }'
chicago: 'Hamann, Heiko, Heinz Wörn, Marius Nagy, and Naya Nagy. “Embodied Computation.”
Parallel Processing Letters 17, no. 3 (2007): 287--298.'
ieee: H. Hamann, H. Wörn, M. Nagy, and N. Nagy, “Embodied Computation,” Parallel
Processing Letters, vol. 17, no. 3, pp. 287--298, 2007.
mla: Hamann, Heiko, et al. “Embodied Computation.” Parallel Processing Letters,
vol. 17, no. 3, 2007, pp. 287--298.
short: H. Hamann, H. Wörn, M. Nagy, N. Nagy, Parallel Processing Letters 17 (2007)
287--298.
date_created: 2020-11-19T11:32:32Z
date_updated: 2022-01-06T06:54:27Z
department:
- _id: '63'
- _id: '238'
intvolume: ' 17'
issue: '3'
language:
- iso: eng
page: 287--298
publication: Parallel Processing Letters
status: public
title: Embodied Computation
type: journal_article
user_id: '15415'
volume: 17
year: '2007'
...
---
_id: '20434'
abstract:
- lang: eng
text: 'Current research in Micro, Nano and Swarm Robots as results of the European
projects Miniman, MiCRoN and I-SWARM will be presented. First, the design and
the control of 5 to 10cm3 sized mobile micro robots with five degrees of freedom
will be shown. They can handle miniaturized parts as for example an optical component
or a biological cell with a size in the micrometre-area with an accuracy of 100nm
under a microscope or a raster-electron microscope. Second, the design and the
control of a 1cm3-sized mobile untethered micro robot will be demonstrated. Here,
the robot consists of five parts: the Piezzo locomotion module, the micro control
unit, the communication unit, the navigation system and the micro gripper. The
mobile robot can be guided and positioned in an arena with an accuracy of 5 micrometre
and can be programmed and controlled over the wireless communication unit. Third,
the design and the control of 3 × 3 × 3 mm3 sized micro-/nanorobots with 2 degrees
of freedom will be presented. The transmission of energy and the communication
between the robots is realized via infrared. The robot controller is fully integrated
and has limited functionalities. Via basic sensors communication functions and
elementary rules and behaviours the micro robot can act in a swarm consisting
of hundreds and thousands of robots. Future applications could be monitoring-,
inspection-, exploring-tasks etc. of big areas or objects.'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Marc
full_name: Szymanski, Marc
last_name: Szymanski
- first_name: Heinz
full_name: Wörn, Heinz
last_name: Wörn
- first_name: Ramon
full_name: Estana, Ramon
last_name: Estana
- first_name: Ming
full_name: Xie, Ming
last_name: Xie
- first_name: Steven
full_name: Dubowsky, Steven
last_name: Dubowsky
citation:
ama: 'Hamann H, Szymanski M, Wörn H, Estana R, Xie M, Dubowsky S. From Micro to
Nano and Swarm Robotics. In: Advances in Climbing and Walking Robots. Proceedings
of 10th International Conference (CLAWAR’07), Singapore, July 16-18. ; 2007:15--24.
doi:10.1142/9789812770189_0003'
apa: Hamann, H., Szymanski, M., Wörn, H., Estana, R., Xie, M., & Dubowsky, S.
(2007). From Micro to Nano and Swarm Robotics. In Advances in Climbing and
walking robots. Proceedings of 10th International Conference (CLAWAR’07), Singapore,
July 16-18 (pp. 15--24). https://doi.org/10.1142/9789812770189_0003
bibtex: '@inproceedings{Hamann_Szymanski_Wörn_Estana_Xie_Dubowsky_2007, title={From
Micro to Nano and Swarm Robotics}, DOI={10.1142/9789812770189_0003},
booktitle={Advances in Climbing and walking robots. Proceedings of 10th International
Conference (CLAWAR’07), Singapore, July 16-18}, author={Hamann, Heiko and Szymanski,
Marc and Wörn, Heinz and Estana, Ramon and Xie, Ming and Dubowsky, Steven}, year={2007},
pages={15--24} }'
chicago: Hamann, Heiko, Marc Szymanski, Heinz Wörn, Ramon Estana, Ming Xie, and
Steven Dubowsky. “From Micro to Nano and Swarm Robotics.” In Advances in Climbing
and Walking Robots. Proceedings of 10th International Conference (CLAWAR’07),
Singapore, July 16-18, 15--24, 2007. https://doi.org/10.1142/9789812770189_0003.
ieee: H. Hamann, M. Szymanski, H. Wörn, R. Estana, M. Xie, and S. Dubowsky, “From
Micro to Nano and Swarm Robotics,” in Advances in Climbing and walking robots.
Proceedings of 10th International Conference (CLAWAR’07), Singapore, July 16-18,
2007, pp. 15--24.
mla: Hamann, Heiko, et al. “From Micro to Nano and Swarm Robotics.” Advances
in Climbing and Walking Robots. Proceedings of 10th International Conference (CLAWAR’07),
Singapore, July 16-18, 2007, pp. 15--24, doi:10.1142/9789812770189_0003.
short: 'H. Hamann, M. Szymanski, H. Wörn, R. Estana, M. Xie, S. Dubowsky, in: Advances
in Climbing and Walking Robots. Proceedings of 10th International Conference (CLAWAR’07),
Singapore, July 16-18, 2007, pp. 15--24.'
date_created: 2020-11-19T11:37:49Z
date_updated: 2022-01-06T06:54:27Z
department:
- _id: '63'
- _id: '238'
doi: 10.1142/9789812770189_0003
language:
- iso: eng
page: 15--24
publication: Advances in Climbing and walking robots. Proceedings of 10th International
Conference (CLAWAR'07), Singapore, July 16-18
status: public
title: From Micro to Nano and Swarm Robotics
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '17980'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Ziegler M. Revising Type-2 Computation and Degrees of Discontinuity. Electronic
Notes in Theoretical Computer Science. 2007:255-274. doi:10.1016/j.entcs.2006.08.015
apa: Ziegler, M. (2007). Revising Type-2 Computation and Degrees of Discontinuity.
Electronic Notes in Theoretical Computer Science, 255–274. https://doi.org/10.1016/j.entcs.2006.08.015
bibtex: '@article{Ziegler_2007, title={Revising Type-2 Computation and Degrees of
Discontinuity}, DOI={10.1016/j.entcs.2006.08.015},
journal={Electronic Notes in Theoretical Computer Science}, author={Ziegler, Martin},
year={2007}, pages={255–274} }'
chicago: Ziegler, Martin. “Revising Type-2 Computation and Degrees of Discontinuity.”
Electronic Notes in Theoretical Computer Science, 2007, 255–74. https://doi.org/10.1016/j.entcs.2006.08.015.
ieee: M. Ziegler, “Revising Type-2 Computation and Degrees of Discontinuity,” Electronic
Notes in Theoretical Computer Science, pp. 255–274, 2007.
mla: Ziegler, Martin. “Revising Type-2 Computation and Degrees of Discontinuity.”
Electronic Notes in Theoretical Computer Science, 2007, pp. 255–74, doi:10.1016/j.entcs.2006.08.015.
short: M. Ziegler, Electronic Notes in Theoretical Computer Science (2007) 255–274.
date_created: 2020-08-14T13:30:00Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1016/j.entcs.2006.08.015
language:
- iso: eng
page: 255-274
publication: Electronic Notes in Theoretical Computer Science
publication_identifier:
issn:
- 1571-0661
publication_status: published
status: public
title: Revising Type-2 Computation and Degrees of Discontinuity
type: journal_article
user_id: '15415'
year: '2007'
...
---
_id: '17981'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Ziegler M. Real Hypercomputation and Continuity. Theory of Computing Systems.
2007:177-206. doi:10.1007/s00224-006-1343-6
apa: Ziegler, M. (2007). Real Hypercomputation and Continuity. Theory of Computing
Systems, 177–206. https://doi.org/10.1007/s00224-006-1343-6
bibtex: '@article{Ziegler_2007, title={Real Hypercomputation and Continuity}, DOI={10.1007/s00224-006-1343-6},
journal={Theory of Computing Systems}, author={Ziegler, Martin}, year={2007},
pages={177–206} }'
chicago: Ziegler, Martin. “Real Hypercomputation and Continuity.” Theory of Computing
Systems, 2007, 177–206. https://doi.org/10.1007/s00224-006-1343-6.
ieee: M. Ziegler, “Real Hypercomputation and Continuity,” Theory of Computing
Systems, pp. 177–206, 2007.
mla: Ziegler, Martin. “Real Hypercomputation and Continuity.” Theory of Computing
Systems, 2007, pp. 177–206, doi:10.1007/s00224-006-1343-6.
short: M. Ziegler, Theory of Computing Systems (2007) 177–206.
date_created: 2020-08-14T13:32:37Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1007/s00224-006-1343-6
language:
- iso: eng
page: 177-206
publication: Theory of Computing Systems
publication_identifier:
issn:
- 1432-4350
- 1433-0490
publication_status: published
status: public
title: Real Hypercomputation and Continuity
type: journal_article
user_id: '15415'
year: '2007'
...
---
_id: '17982'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Ziegler M. (Short) Survey of Real Hypercomputation. In: Lecture Notes in
Computer Science. Berlin, Heidelberg; 2007. doi:10.1007/978-3-540-73001-9_86'
apa: Ziegler, M. (2007). (Short) Survey of Real Hypercomputation. In Lecture
Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73001-9_86
bibtex: '@inbook{Ziegler_2007, place={Berlin, Heidelberg}, title={(Short) Survey
of Real Hypercomputation}, DOI={10.1007/978-3-540-73001-9_86},
booktitle={Lecture Notes in Computer Science}, author={Ziegler, Martin}, year={2007}
}'
chicago: Ziegler, Martin. “(Short) Survey of Real Hypercomputation.” In Lecture
Notes in Computer Science. Berlin, Heidelberg, 2007. https://doi.org/10.1007/978-3-540-73001-9_86.
ieee: M. Ziegler, “(Short) Survey of Real Hypercomputation,” in Lecture Notes
in Computer Science, Berlin, Heidelberg, 2007.
mla: Ziegler, Martin. “(Short) Survey of Real Hypercomputation.” Lecture Notes
in Computer Science, 2007, doi:10.1007/978-3-540-73001-9_86.
short: 'M. Ziegler, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.'
date_created: 2020-08-14T13:33:50Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1007/978-3-540-73001-9_86
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540730002'
- '9783540730019'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: (Short) Survey of Real Hypercomputation
type: book_chapter
user_id: '15415'
year: '2007'
...
---
_id: '17983'
author:
- first_name: Klaus
full_name: Meer, Klaus
last_name: Meer
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Meer K, Ziegler M. Real Computational Universality: The Word Problem for a
Class of Groups with Infinite Presentation. In: Mathematical Foundations of
Computer Science 2007. Berlin, Heidelberg; 2007. doi:10.1007/978-3-540-74456-6_64'
apa: 'Meer, K., & Ziegler, M. (2007). Real Computational Universality: The Word
Problem for a Class of Groups with Infinite Presentation. In Mathematical Foundations
of Computer Science 2007. Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74456-6_64'
bibtex: '@inbook{Meer_Ziegler_2007, place={Berlin, Heidelberg}, title={Real Computational
Universality: The Word Problem for a Class of Groups with Infinite Presentation},
DOI={10.1007/978-3-540-74456-6_64},
booktitle={Mathematical Foundations of Computer Science 2007}, author={Meer, Klaus
and Ziegler, Martin}, year={2007} }'
chicago: 'Meer, Klaus, and Martin Ziegler. “Real Computational Universality: The
Word Problem for a Class of Groups with Infinite Presentation.” In Mathematical
Foundations of Computer Science 2007. Berlin, Heidelberg, 2007. https://doi.org/10.1007/978-3-540-74456-6_64.'
ieee: 'K. Meer and M. Ziegler, “Real Computational Universality: The Word Problem
for a Class of Groups with Infinite Presentation,” in Mathematical Foundations
of Computer Science 2007, Berlin, Heidelberg, 2007.'
mla: 'Meer, Klaus, and Martin Ziegler. “Real Computational Universality: The Word
Problem for a Class of Groups with Infinite Presentation.” Mathematical Foundations
of Computer Science 2007, 2007, doi:10.1007/978-3-540-74456-6_64.'
short: 'K. Meer, M. Ziegler, in: Mathematical Foundations of Computer Science 2007,
Berlin, Heidelberg, 2007.'
date_created: 2020-08-14T13:35:56Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1007/978-3-540-74456-6_64
language:
- iso: eng
place: Berlin, Heidelberg
publication: Mathematical Foundations of Computer Science 2007
publication_identifier:
isbn:
- '9783540744559'
- '9783540744566'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Real Computational Universality: The Word Problem for a Class of Groups with
Infinite Presentation'
type: book_chapter
user_id: '15415'
year: '2007'
...
---
_id: '17984'
abstract:
- lang: eng
text: "The unit cost model is both convenient and largely realistic for describing\r\ninteger
decision algorithms over (+,*). Additional operations like division\r\nwith remainder
or bitwise conjunction, although equally supported by computing\r\nhardware, may
lead to a considerable drop in complexity. We show a variety of\r\nconcrete problems
to benefit from such NON-arithmetic primitives by presenting\r\nand analyzing
corresponding fast algorithms."
author:
- first_name: Katharina
full_name: Lürwer-Brüggemeier, Katharina
last_name: Lürwer-Brüggemeier
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Lürwer-Brüggemeier K, Ziegler M. On Faster Integer Calculations using Non-Arithmetic
Primitives. arXiv:07090624. 2007.
apa: Lürwer-Brüggemeier, K., & Ziegler, M. (2007). On Faster Integer Calculations
using Non-Arithmetic Primitives. ArXiv:0709.0624.
bibtex: '@article{Lürwer-Brüggemeier_Ziegler_2007, title={On Faster Integer Calculations
using Non-Arithmetic Primitives}, journal={arXiv:0709.0624}, author={Lürwer-Brüggemeier,
Katharina and Ziegler, Martin}, year={2007} }'
chicago: Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations
Using Non-Arithmetic Primitives.” ArXiv:0709.0624, 2007.
ieee: K. Lürwer-Brüggemeier and M. Ziegler, “On Faster Integer Calculations using
Non-Arithmetic Primitives,” arXiv:0709.0624. 2007.
mla: Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations
Using Non-Arithmetic Primitives.” ArXiv:0709.0624, 2007.
short: K. Lürwer-Brüggemeier, M. Ziegler, ArXiv:0709.0624 (2007).
date_created: 2020-08-14T13:36:55Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
language:
- iso: eng
publication: arXiv:0709.0624
status: public
title: On Faster Integer Calculations using Non-Arithmetic Primitives
type: preprint
user_id: '15415'
year: '2007'
...
---
_id: '18285'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Ziegler M. Real Computability and Hypercomputation.; 2007.
apa: Ziegler, M. (2007). Real Computability and Hypercomputation.
bibtex: '@book{Ziegler_2007, title={Real Computability and Hypercomputation}, author={Ziegler,
Martin}, year={2007} }'
chicago: Ziegler, Martin. Real Computability and Hypercomputation, 2007.
ieee: M. Ziegler, Real Computability and Hypercomputation. 2007.
mla: Ziegler, Martin. Real Computability and Hypercomputation. 2007.
short: M. Ziegler, Real Computability and Hypercomputation, 2007.
date_created: 2020-08-25T13:11:38Z
date_updated: 2022-01-06T06:53:28Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-25T13:11:15Z
date_updated: 2020-08-25T13:11:15Z
file_id: '18286'
file_name: real-comp-2007.pdf
file_size: 2157961
relation: main_file
success: 1
file_date_updated: 2020-08-25T13:11:15Z
has_accepted_license: '1'
language:
- iso: eng
report_number: ' tr-ri-07-285'
status: public
title: Real Computability and Hypercomputation
type: report
user_id: '15415'
year: '2007'
...
---
_id: '18347'
abstract:
- lang: eng
text: "The validation of material flow models as well as the selection of promising
strategies for the generation of a successful experiment plan is a time-consuming
process. A new approach is presented, which supports the simulation expert in
his working process by giving him the opportunity to modify the simulated simulation
run and afterwards compare the effects of his modification with the original setting,
online and in one user interface, implemented by switching the visualizations
between the simulation runs or opening up to 5 parallel 3D windows. The method
developed therefore clones existing simulation runs online and allows the navigation
within these existing simulation runs. The method has been implemented and is
validated by a test model, which describes in detail the new working process of
a modeler. New research questions are derived from this work, which will define
following working steps.\r\n"
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: 'Christoph '
full_name: 'Laroque, Christoph '
last_name: Laroque
- first_name: 'Daniel '
full_name: 'Huber, Daniel '
last_name: Huber
- first_name: 'Jens '
full_name: 'Krokowski, Jens '
last_name: Krokowski
- first_name: 'Bengt '
full_name: 'Mueck, Bengt '
last_name: Mueck
- first_name: 'Michael '
full_name: 'Kortenjan, Michael '
last_name: Kortenjan
- first_name: Mark
full_name: Aufenanger, Mark
last_name: Aufenanger
- first_name: Wilhelm
full_name: ' Dangelmaier, Wilhelm'
last_name: ' Dangelmaier'
citation:
ama: 'Fischer M, Laroque C, Huber D, et al. Interactive Refinement of a Material
Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment.
In: European Simulation and Modelling Conference (ESM 2007). ; 2007:499--505.'
apa: Fischer, M., Laroque, C., Huber, D., Krokowski, J., Mueck, B., Kortenjan, M.,
… Dangelmaier, W. (2007). Interactive Refinement of a Material Flow Simulation
Model by Comparing Multiple Simulation Runs in one 3D Environment. In European
Simulation and Modelling Conference (ESM 2007) (pp. 499--505).
bibtex: '@inproceedings{Fischer_Laroque_Huber_Krokowski_Mueck_Kortenjan_Aufenanger_
Dangelmaier_2007, title={Interactive Refinement of a Material Flow Simulation
Model by Comparing Multiple Simulation Runs in one 3D Environment}, booktitle={European
Simulation and Modelling Conference (ESM 2007)}, author={Fischer, Matthias and
Laroque, Christoph and Huber, Daniel and Krokowski, Jens and Mueck, Bengt and
Kortenjan, Michael and Aufenanger, Mark and Dangelmaier, Wilhelm}, year={2007},
pages={499--505} }'
chicago: Fischer, Matthias, Christoph Laroque, Daniel Huber, Jens Krokowski,
Bengt Mueck, Michael Kortenjan, Mark Aufenanger, and Wilhelm Dangelmaier. “Interactive
Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation
Runs in One 3D Environment.” In European Simulation and Modelling Conference
(ESM 2007), 499--505, 2007.
ieee: M. Fischer et al., “Interactive Refinement of a Material Flow Simulation
Model by Comparing Multiple Simulation Runs in one 3D Environment,” in European
Simulation and Modelling Conference (ESM 2007), 2007, pp. 499--505.
mla: Fischer, Matthias, et al. “Interactive Refinement of a Material Flow Simulation
Model by Comparing Multiple Simulation Runs in One 3D Environment.” European
Simulation and Modelling Conference (ESM 2007), 2007, pp. 499--505.
short: 'M. Fischer, C. Laroque, D. Huber, J. Krokowski, B. Mueck, M. Kortenjan,
M. Aufenanger, W. Dangelmaier, in: European Simulation and Modelling Conference
(ESM 2007), 2007, pp. 499--505.'
date_created: 2020-08-26T09:23:24Z
date_updated: 2022-01-06T06:53:29Z
ddc:
- '004'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-26T09:22:47Z
date_updated: 2020-08-26T09:22:47Z
file_id: '18348'
file_name: ESM07_final.pdf
file_size: 389588
relation: main_file
success: 1
file_date_updated: 2020-08-26T09:22:47Z
has_accepted_license: '1'
language:
- iso: eng
page: 499--505
publication: European Simulation and Modelling Conference (ESM 2007)
status: public
title: Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple
Simulation Runs in one 3D Environment
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '18349'
author:
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
- first_name: 'Christoph '
full_name: ' Laroque, Christoph '
last_name: ' Laroque'
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
citation:
ama: 'Dangelmaier W, Laroque C, Fischer M. Ein ganzheitlicher Ansatz zur immersiven
3D-Materialflusssimulation innerhalb der Digitalen Fabrik. In: Augmented &
Virtual Reality in Der Produktentstehung. Vol 209. Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn; 2007:95-110.'
apa: Dangelmaier, W., Laroque, C., & Fischer, M. (2007). Ein ganzheitlicher
Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik.
Augmented & Virtual Reality in Der Produktentstehung, 209, 95–110.
bibtex: '@inproceedings{Dangelmaier_ Laroque_Fischer_2007, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, title={Ein ganzheitlicher Ansatz zur
immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik}, volume={209},
booktitle={Augmented & Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Dangelmaier, Wilhelm and Laroque,
Christoph and Fischer, Matthias}, year={2007}, pages={95–110}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Dangelmaier, Wilhelm, Christoph Laroque, and Matthias Fischer. “Ein Ganzheitlicher
Ansatz Zur Immersiven 3D-Materialflusssimulation Innerhalb Der Digitalen Fabrik.”
In Augmented & Virtual Reality in Der Produktentstehung, 209:95–110.
Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2007.
ieee: W. Dangelmaier, C. Laroque, and M. Fischer, “Ein ganzheitlicher Ansatz zur
immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik,” in Augmented
& Virtual Reality in der Produktentstehung, 2007, vol. 209, pp. 95–110.
mla: Dangelmaier, Wilhelm, et al. “Ein Ganzheitlicher Ansatz Zur Immersiven 3D-Materialflusssimulation
Innerhalb Der Digitalen Fabrik.” Augmented & Virtual Reality in Der Produktentstehung,
vol. 209, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2007,
pp. 95–110.
short: 'W. Dangelmaier, C. Laroque, M. Fischer, in: Augmented & Virtual Reality
in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2007, pp. 95–110.'
date_created: 2020-08-26T09:30:58Z
date_updated: 2022-01-06T06:53:29Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 209'
language:
- iso: eng
page: 95-110
publication: Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb
der Digitalen Fabrik
type: conference
user_id: '5786'
volume: 209
year: '2007'
...
---
_id: '18572'
abstract:
- lang: eng
text: "We present random sampling algorithms that with probability at least 1 − δ
compute a (1 ±ε)-approximation of the clustering coefficient and of the number
of bipartite clique subgraphs of a graph given as an incidence stream of edges.
The space used by our algorithm to estimate the clustering coefficient is inversely
related to the clustering coefficient of the network itself. The space used by
our algorithm to compute the number K 3,3 of bipartite cliques is proportional
to the ratio between the number of K 1,3 and K 3,3 in the graph.\r\n\r\nSince
the space complexity depends only on the structure of the input graph and not
on the number of nodes, our algorithms scale very well with increasing graph size.
Therefore they provide a basic tool to analyze the structure of dense clusters
in large graphs and have many applications in the discovery of web communities,
the analysis of the structure of large social networks and the probing of frequent
patterns in large graphs.\r\n\r\nWe implemented both algorithms and evaluated
their performance on networks from different application domains and of different
size; The largest instance is a webgraph consisting of more than 135 million nodes
and 1 billion edges. Both algorithms compute accurate results in reasonable time
on the tested instances."
author:
- first_name: Luciana S.
full_name: Buriol, Luciana S.
last_name: Buriol
- first_name: Gereon
full_name: Frahling, Gereon
last_name: Frahling
- first_name: Stefano
full_name: Leonardi, Stefano
last_name: Leonardi
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: 'Buriol LS, Frahling G, Leonardi S, Sohler C. Estimating Clustering Indexes
in Data Streams. In: Proceedings of the 15th European Symposium on Algorithms
(ESA). Vol 4698. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer;
2007:618-632. doi:10.1007/978-3-540-75520-3_55'
apa: 'Buriol, L. S., Frahling, G., Leonardi, S., & Sohler, C. (2007). Estimating
Clustering Indexes in Data Streams. In Proceedings of the 15th European Symposium
on Algorithms (ESA) (Vol. 4698, pp. 618–632). Berlin, Heidelberg: Springer.
https://doi.org/10.1007/978-3-540-75520-3_55'
bibtex: '@inproceedings{Buriol_Frahling_Leonardi_Sohler_2007, place={Berlin, Heidelberg},
series={Lecture Notes in Computer Science}, title={Estimating Clustering Indexes
in Data Streams}, volume={4698}, DOI={10.1007/978-3-540-75520-3_55},
booktitle={Proceedings of the 15th European Symposium on Algorithms (ESA)}, publisher={Springer},
author={Buriol, Luciana S. and Frahling, Gereon and Leonardi, Stefano and Sohler,
Christian}, year={2007}, pages={618–632}, collection={Lecture Notes in Computer
Science} }'
chicago: 'Buriol, Luciana S., Gereon Frahling, Stefano Leonardi, and Christian Sohler.
“Estimating Clustering Indexes in Data Streams.” In Proceedings of the 15th
European Symposium on Algorithms (ESA), 4698:618–32. Lecture Notes in Computer
Science. Berlin, Heidelberg: Springer, 2007. https://doi.org/10.1007/978-3-540-75520-3_55.'
ieee: L. S. Buriol, G. Frahling, S. Leonardi, and C. Sohler, “Estimating Clustering
Indexes in Data Streams,” in Proceedings of the 15th European Symposium on
Algorithms (ESA), 2007, vol. 4698, pp. 618–632.
mla: Buriol, Luciana S., et al. “Estimating Clustering Indexes in Data Streams.”
Proceedings of the 15th European Symposium on Algorithms (ESA), vol. 4698,
Springer, 2007, pp. 618–32, doi:10.1007/978-3-540-75520-3_55.
short: 'L.S. Buriol, G. Frahling, S. Leonardi, C. Sohler, in: Proceedings of the
15th European Symposium on Algorithms (ESA), Springer, Berlin, Heidelberg, 2007,
pp. 618–632.'
date_created: 2020-08-28T12:46:05Z
date_updated: 2022-01-06T06:53:40Z
department:
- _id: '63'
doi: 10.1007/978-3-540-75520-3_55
intvolume: ' 4698'
language:
- iso: eng
page: 618-632
place: Berlin, Heidelberg
publication: Proceedings of the 15th European Symposium on Algorithms (ESA)
publication_identifier:
isbn:
- '9783540755197'
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Estimating Clustering Indexes in Data Streams
type: conference
user_id: '15415'
volume: 4698
year: '2007'
...
---
_id: '18655'
abstract:
- lang: eng
text: We study graph properties which are testable for bounded degree graphs in
time independent of the input size. Our goal is to distinguish between graphs
having a predetermined graph property and graphs that are far from every graph
having that property. It is believed that almost all, even very simple graph properties
require a large complexity to be tested for arbitrary (bounded degree) graphs.
Therefore in this paper we focus our attention on testing graph properties for
special classes of graphs. We call a graph family non-expanding if every graph
in this family is not a weak expander (its expansion is O(1/log2 n), where n is
the graph size). A graph family is hereditary if it is closed under vertex removal.
Similarly, a graph property is hereditary if it is closed under vertex removal.
Next, we call a graph property Π to be testable for a graph family F if for every
graph G ε F, in time independent of the size of G we can distinguish between the
case when G satisfies property Π and when it is far from every graph satisfying
property Π. In this paper we prove thatIn the bounded degree graph model, any
hereditary property is testable if the input graph belongs to a hereditary and
non-expanding family of graphs.As an application, our result implies that, for
example, any hereditary property (e.g., k-colorability, H-freeness, etc.) is testable
in the bounded degree graph model for planar graphs, graphs with bounded genus,
interval graphs, etc. No such results have been known before and prior to our
work, in the bounded degree graph model very few graph properties have been known
to be testable for any graph classes.
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
citation:
ama: 'Sohler C, Czumaj A. On Testable Properties in Bounded Degree Graphs. In: Proceedings
of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07). ; 2007:494-501.'
apa: Sohler, C., & Czumaj, A. (2007). On Testable Properties in Bounded Degree
Graphs. In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms
(SODA’07) (pp. 494–501).
bibtex: '@inproceedings{Sohler_Czumaj_2007, title={On Testable Properties in Bounded
Degree Graphs}, booktitle={Proceedings of the 17th ACM-SIAM Symposium on Discrete
Algorithms (SODA’07)}, author={Sohler, Christian and Czumaj, Artur}, year={2007},
pages={494–501} }'
chicago: Sohler, Christian, and Artur Czumaj. “On Testable Properties in Bounded
Degree Graphs.” In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms
(SODA’07), 494–501, 2007.
ieee: C. Sohler and A. Czumaj, “On Testable Properties in Bounded Degree Graphs,”
in Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07),
2007, pp. 494–501.
mla: Sohler, Christian, and Artur Czumaj. “On Testable Properties in Bounded Degree
Graphs.” Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms
(SODA’07), 2007, pp. 494–501.
short: 'C. Sohler, A. Czumaj, in: Proceedings of the 17th ACM-SIAM Symposium on
Discrete Algorithms (SODA’07), 2007, pp. 494–501.'
date_created: 2020-08-31T07:40:36Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
language:
- iso: eng
page: 494-501
publication: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA'07)
publication_identifier:
isbn:
- '9780898716245'
status: public
title: On Testable Properties in Bounded Degree Graphs
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '18656'
abstract:
- lang: eng
text: In the StrSort model [2], the input is given as a stream, e.g. a sequence
of points, and an algorithm can perform (a) streaming and (b) sorting passes to
process the stream. A streaming pass reads the input stream from left to right
and writes an output stream, which is the input of the next pass. A sorting pass
is a black box operation that sorts a stream according to some partial order.
In this paper, we develop algorithms for two basic geometric problems in the StrSort
model. At first, we propose a divide-and-conquer algorithm that computes the convex
hull of a point set in 2D in O(log2 n) passes using O(1) memory. Then we give
a StrSort algorithm to compute a (1+ε)-spanner for a point set in Rd for constant
d and constant epsilon that uses O(logd-1 n) passes and O(log n) space. This result
implies a (1+ε)-approximation of the Euclidean minimum spanning tree in Rd, for
constant d and ε.
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Christiane
full_name: Lammersen, Christiane
last_name: Lammersen
citation:
ama: 'Sohler C, Lammersen C. StrSort Algorithms for Geometric Problems. In: Proceedings
of the 23rd European Workshop on Computational Geometry (EWCG). ; 2007:69-72.'
apa: Sohler, C., & Lammersen, C. (2007). StrSort Algorithms for Geometric Problems.
In Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)
(pp. 69–72).
bibtex: '@inproceedings{Sohler_Lammersen_2007, title={StrSort Algorithms for Geometric
Problems}, booktitle={Proceedings of the 23rd European Workshop on Computational
Geometry (EWCG)}, author={Sohler, Christian and Lammersen, Christiane}, year={2007},
pages={69–72} }'
chicago: Sohler, Christian, and Christiane Lammersen. “StrSort Algorithms for Geometric
Problems.” In Proceedings of the 23rd European Workshop on Computational Geometry
(EWCG), 69–72, 2007.
ieee: C. Sohler and C. Lammersen, “StrSort Algorithms for Geometric Problems,” in
Proceedings of the 23rd European Workshop on Computational Geometry (EWCG),
2007, pp. 69–72.
mla: Sohler, Christian, and Christiane Lammersen. “StrSort Algorithms for Geometric
Problems.” Proceedings of the 23rd European Workshop on Computational Geometry
(EWCG), 2007, pp. 69–72.
short: 'C. Sohler, C. Lammersen, in: Proceedings of the 23rd European Workshop on
Computational Geometry (EWCG), 2007, pp. 69–72.'
date_created: 2020-08-31T07:49:02Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
language:
- iso: eng
page: 69-72
publication: Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)
status: public
title: StrSort Algorithms for Geometric Problems
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '18660'
author:
- first_name: 'Christian '
full_name: 'Sohler, Christian '
last_name: Sohler
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
citation:
ama: 'Sohler C, Czumaj A. Testing Expansion in Bounded-Degree Graphs. In: Proceedings
of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS).
; 2007:570-578.'
apa: Sohler, C., & Czumaj, A. (2007). Testing Expansion in Bounded-Degree Graphs.
In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer
Science (FOCS) (pp. 570–578).
bibtex: '@inproceedings{Sohler_Czumaj_2007, title={Testing Expansion in Bounded-Degree
Graphs}, booktitle={Proceedings of the 48th Annual IEEE Symposium on Foundations
of Computer Science (FOCS)}, author={Sohler, Christian and Czumaj, Artur}, year={2007},
pages={570–578} }'
chicago: Sohler, Christian , and Artur Czumaj. “Testing Expansion in Bounded-Degree
Graphs.” In Proceedings of the 48th Annual IEEE Symposium on Foundations of
Computer Science (FOCS), 570–78, 2007.
ieee: C. Sohler and A. Czumaj, “Testing Expansion in Bounded-Degree Graphs,” in
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
(FOCS), 2007, pp. 570–578.
mla: Sohler, Christian, and Artur Czumaj. “Testing Expansion in Bounded-Degree Graphs.”
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
(FOCS), 2007, pp. 570–78.
short: 'C. Sohler, A. Czumaj, in: Proceedings of the 48th Annual IEEE Symposium
on Foundations of Computer Science (FOCS), 2007, pp. 570–578.'
date_created: 2020-08-31T07:55:45Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
language:
- iso: eng
page: 570 - 578
publication: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer
Science (FOCS)
status: public
title: Testing Expansion in Bounded-Degree Graphs
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '18662'
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
citation:
ama: 'Sohler C, Czumaj A. Small Space Representations for Metric Min-Sum k-Clustering
and their Applications. In: Proceedings of the 24th International Symposium
on Theoretical Aspects of Computer Science (STACS’07). ; 2007:536-548.'
apa: Sohler, C., & Czumaj, A. (2007). Small Space Representations for Metric
Min-Sum k-Clustering and their Applications. In Proceedings of the 24th International
Symposium on Theoretical Aspects of Computer Science (STACS’07) (pp. 536–548).
bibtex: '@inproceedings{Sohler_Czumaj_2007, title={Small Space Representations for
Metric Min-Sum k-Clustering and their Applications}, booktitle={Proceedings of
the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07)},
author={Sohler, Christian and Czumaj, Artur}, year={2007}, pages={536–548} }'
chicago: Sohler, Christian, and Artur Czumaj. “Small Space Representations for Metric
Min-Sum k-Clustering and Their Applications.” In Proceedings of the 24th International
Symposium on Theoretical Aspects of Computer Science (STACS’07), 536–48, 2007.
ieee: C. Sohler and A. Czumaj, “Small Space Representations for Metric Min-Sum k-Clustering
and their Applications,” in Proceedings of the 24th International Symposium
on Theoretical Aspects of Computer Science (STACS’07), 2007, pp. 536–548.
mla: Sohler, Christian, and Artur Czumaj. “Small Space Representations for Metric
Min-Sum k-Clustering and Their Applications.” Proceedings of the 24th International
Symposium on Theoretical Aspects of Computer Science (STACS’07), 2007, pp.
536–48.
short: 'C. Sohler, A. Czumaj, in: Proceedings of the 24th International Symposium
on Theoretical Aspects of Computer Science (STACS’07), 2007, pp. 536–548.'
date_created: 2020-08-31T07:59:05Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
language:
- iso: eng
page: 536-548
publication: Proceedings of the 24th International Symposium on Theoretical Aspects
of Computer Science (STACS'07)
status: public
title: Small Space Representations for Metric Min-Sum k-Clustering and their Applications
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '18665'
abstract:
- lang: eng
text: 'We present a novel analysis of a random sampling approach for four clustering
problems in metric spaces: k-median, k-means, min-sum k-clustering, and balanced
k-median. For all these problems, we consider the following simple sampling scheme:
select a small sample set of input points uniformly at random and then run some
approximation algorithm on this sample set to compute an approximation of the
best possible clustering of this set. Our main technical contribution is a significantly
strengthened analysis of the approximation guarantee by this scheme for the clustering
problems.The main motivation behind our analyses was to design sublinear-time
algorithms for clustering problems. Our second contribution is the development
of new approximation algorithms for the aforementioned clustering problems. Using
our random sampling approach, we obtain for these problems the first time approximation
algorithms that have running time independent of the input size, and depending
on k and the diameter of the metric space only. © 2006 Wiley Periodicals, Inc.
Random Struct. Alg., 2007A preliminary extended abstract of this work appeared
in Proceedings of the 31st Annual International Colloquium on Automata, Languages
and Programming (ICALP), pp. 396407, 2004.'
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
citation:
ama: Sohler C, Czumaj A. Sublinear-time approximation algorithms for clustering
via random sampling. Random Structures & Algorithms. 2007;30(1-2):226--
256.
apa: Sohler, C., & Czumaj, A. (2007). Sublinear-time approximation algorithms
for clustering via random sampling. Random Structures & Algorithms,
30(1–2), 226-- 256.
bibtex: '@article{Sohler_Czumaj_2007, title={Sublinear-time approximation algorithms
for clustering via random sampling}, volume={30}, number={1–2}, journal={Random
Structures & Algorithms}, author={Sohler, Christian and Czumaj, Artur}, year={2007},
pages={226-- 256} }'
chicago: 'Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation Algorithms
for Clustering via Random Sampling.” Random Structures & Algorithms
30, no. 1–2 (2007): 226-- 256.'
ieee: C. Sohler and A. Czumaj, “Sublinear-time approximation algorithms for clustering
via random sampling,” Random Structures & Algorithms, vol. 30, no.
1–2, pp. 226-- 256, 2007.
mla: Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation Algorithms
for Clustering via Random Sampling.” Random Structures & Algorithms,
vol. 30, no. 1–2, 2007, pp. 226-- 256.
short: C. Sohler, A. Czumaj, Random Structures & Algorithms 30 (2007) 226--
256.
date_created: 2020-08-31T08:03:52Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
intvolume: ' 30'
issue: 1-2
language:
- iso: eng
page: 226 -- 256
publication: Random Structures & Algorithms
status: public
title: Sublinear-time approximation algorithms for clustering via random sampling
type: journal_article
user_id: '15415'
volume: 30
year: '2007'
...
---
_id: '18668'
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Morteza
full_name: Monemizahdeh, Morteza
last_name: Monemizahdeh
- first_name: Dan
full_name: Feldman, Dan
last_name: Feldman
citation:
ama: 'Sohler C, Monemizahdeh M, Feldman D. A PTAS for k-means clustering based on
weak coresets. In: Proceedings of the 23rd Annual Symposium on Computational
Geometry (SoCG’07). ; 2007:11-18.'
apa: Sohler, C., Monemizahdeh, M., & Feldman, D. (2007). A PTAS for k-means
clustering based on weak coresets. In Proceedings of the 23rd annual symposium
on computational geometry (SoCG’07) (pp. 11–18).
bibtex: '@inproceedings{Sohler_Monemizahdeh_Feldman_2007, title={A PTAS for k-means
clustering based on weak coresets}, booktitle={Proceedings of the 23rd annual
symposium on computational geometry (SoCG’07)}, author={Sohler, Christian and
Monemizahdeh, Morteza and Feldman, Dan}, year={2007}, pages={11–18} }'
chicago: Sohler, Christian, Morteza Monemizahdeh, and Dan Feldman. “A PTAS for K-Means
Clustering Based on Weak Coresets.” In Proceedings of the 23rd Annual Symposium
on Computational Geometry (SoCG’07), 11–18, 2007.
ieee: C. Sohler, M. Monemizahdeh, and D. Feldman, “A PTAS for k-means clustering
based on weak coresets,” in Proceedings of the 23rd annual symposium on computational
geometry (SoCG’07), 2007, pp. 11–18.
mla: Sohler, Christian, et al. “A PTAS for K-Means Clustering Based on Weak Coresets.”
Proceedings of the 23rd Annual Symposium on Computational Geometry (SoCG’07),
2007, pp. 11–18.
short: 'C. Sohler, M. Monemizahdeh, D. Feldman, in: Proceedings of the 23rd Annual
Symposium on Computational Geometry (SoCG’07), 2007, pp. 11–18.'
date_created: 2020-08-31T08:10:11Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
language:
- iso: eng
page: 11-18
publication: Proceedings of the 23rd annual symposium on computational geometry (SoCG'07)
status: public
title: A PTAS for k-means clustering based on weak coresets
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '18669'
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Gereon
full_name: Frahling, Gereon
last_name: Frahling
citation:
ama: 'Sohler C, Czumaj A, Frahling G. Efficient kinetic data structures for MaxCut.
In: Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG).
; 2007:157-160.'
apa: Sohler, C., Czumaj, A., & Frahling, G. (2007). Efficient kinetic data structures
for MaxCut. In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG) (pp. 157–160).
bibtex: '@inproceedings{Sohler_Czumaj_Frahling_2007, title={Efficient kinetic data
structures for MaxCut}, booktitle={Proceedings of the 19th Canadian Conference
on Computational Geometry (CCCG)}, author={Sohler, Christian and Czumaj, Artur
and Frahling, Gereon}, year={2007}, pages={157–160} }'
chicago: Sohler, Christian, Artur Czumaj, and Gereon Frahling. “Efficient Kinetic
Data Structures for MaxCut.” In Proceedings of the 19th Canadian Conference
on Computational Geometry (CCCG), 157–60, 2007.
ieee: C. Sohler, A. Czumaj, and G. Frahling, “Efficient kinetic data structures
for MaxCut,” in Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG), 2007, pp. 157–160.
mla: Sohler, Christian, et al. “Efficient Kinetic Data Structures for MaxCut.” Proceedings
of the 19th Canadian Conference on Computational Geometry (CCCG), 2007, pp.
157–60.
short: 'C. Sohler, A. Czumaj, G. Frahling, in: Proceedings of the 19th Canadian
Conference on Computational Geometry (CCCG), 2007, pp. 157–160.'
date_created: 2020-08-31T08:12:53Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
language:
- iso: eng
page: 157-160
publication: Proceedings of the 19th Canadian Conference on Computational Geometry
(CCCG)
status: public
title: Efficient kinetic data structures for MaxCut
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '2214'
abstract:
- lang: eng
text: We present a randomized block-level storage virtualization for arbitrary heterogeneous
storage systems that can distribute data in a fair and redundant way and can adapt
this distribution in an efficient way as storage devices enter or leave the system.
More precisely, our virtualization strategies can distribute a set of data blocks
among a set of storage devices of arbitrary non-uniform capacities so that a storage
device representing x% of the capacity in the system will get x% of the data (as
long as this is in principle possible) and the different copies of each data block
are stored so that no two copies of a data block are located in the same device.
Achieving these two properties is not easy, and no virtualization strategy has
been presented so far that has been formally shown to satisfy fairness and redundancy
while being time- and space-eflcient and allowing an efficient adaptation to a
changing set of devices.
author:
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Sascha
full_name: Effert, Sascha
last_name: Effert
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Brinkmann A, Effert S, Meyer auf der Heide F, Scheideler C. Dynamic and redundant
data placement. In: IEEE International Conference on Distributed Computing
Systems (ICDCS). ; 2007.'
apa: Brinkmann, A., Effert, S., Meyer auf der Heide, F., & Scheideler, C. (2007).
Dynamic and redundant data placement. IEEE International Conference on Distributed
Computing Systems (ICDCS).
bibtex: '@inproceedings{Brinkmann_Effert_Meyer auf der Heide_Scheideler_2007, title={Dynamic
and redundant data placement}, booktitle={IEEE International Conference on Distributed
Computing Systems (ICDCS)}, author={Brinkmann, André and Effert, Sascha and Meyer
auf der Heide, Friedhelm and Scheideler, Christian}, year={2007} }'
chicago: Brinkmann, André, Sascha Effert, Friedhelm Meyer auf der Heide, and Christian
Scheideler. “Dynamic and Redundant Data Placement.” In IEEE International Conference
on Distributed Computing Systems (ICDCS), 2007.
ieee: A. Brinkmann, S. Effert, F. Meyer auf der Heide, and C. Scheideler, “Dynamic
and redundant data placement,” 2007.
mla: Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” IEEE International
Conference on Distributed Computing Systems (ICDCS), 2007.
short: 'A. Brinkmann, S. Effert, F. Meyer auf der Heide, C. Scheideler, in: IEEE
International Conference on Distributed Computing Systems (ICDCS), 2007.'
date_created: 2018-04-05T07:08:35Z
date_updated: 2022-01-06T06:55:27Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:01:42Z
date_updated: 2018-04-13T10:01:42Z
file_id: '2339'
file_name: ICDCS07.pdf
file_size: 164121
relation: main_file
file_date_updated: 2018-04-13T10:01:42Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
publication: IEEE International Conference on Distributed Computing Systems (ICDCS)
status: public
title: Dynamic and redundant data placement
type: conference
urn: '22147'
user_id: '15415'
year: '2007'
...
---
_id: '7970'
abstract:
- lang: eng
text: We consider the problem of exploring an unknown environment using a swarm
of autonomous robots with collective behavior emerging from their local rules.
Each robot has only a very restricted view on the environment which makes cooperation
difficult. We introduce a software system which is capable of simulating a large
number of such robots (e.g. 1000) on highly complex terrains with millions of
obstacles. Its main purpose is to easily integrate and evaluate any kind of algorithm
for controlling the robot behavior. The simulation may be observed in real-time
via a visualization that displays both the individual and the collective progress
of the robots. We present the system design, its main features and underlying
concepts.
author:
- first_name: Stephan
full_name: Arens, Stephan
last_name: Arens
- first_name: Alexander
full_name: Buss, Alexander
last_name: Buss
- first_name: Helena
full_name: Deck, Helena
last_name: Deck
- first_name: Miroslaw
full_name: Dynia, Miroslaw
last_name: Dynia
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Holger
full_name: Hagedorn, Holger
last_name: Hagedorn
- first_name: Peter
full_name: Isaak, Peter
last_name: Isaak
- first_name: Jaroslaw
full_name: Kutylowski, Jaroslaw
last_name: Kutylowski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Viktor
full_name: Nesterow, Viktor
last_name: Nesterow
- first_name: Adrian
full_name: Ogiermann, Adrian
last_name: Ogiermann
- first_name: Boris
full_name: Stobbe, Boris
last_name: Stobbe
- first_name: Thomas
full_name: Storm, Thomas
last_name: Storm
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
citation:
ama: 'Arens S, Buss A, Deck H, et al. Smart Teams: Simulating Large Robotic Swarms
in Vast Environments. In: Proceedings of the 4th International Symposium on
Autonomous Minirobots for Research and Edutainment. Buenos Aires, Argentina:
Heinz Nixdorf Institut, University of Paderborn; 2007:215-222.'
apa: 'Arens, S., Buss, A., Deck, H., Dynia, M., Fischer, M., Hagedorn, H., … Wachsmuth,
H. (2007). Smart Teams: Simulating Large Robotic Swarms in Vast Environments.
In Proceedings of the 4th International Symposium on Autonomous Minirobots
for Research and Edutainment (pp. 215–222). Buenos Aires, Argentina: Heinz
Nixdorf Institut, University of Paderborn.'
bibtex: '@inproceedings{Arens_Buss_Deck_Dynia_Fischer_Hagedorn_Isaak_Kutylowski_Meyer
auf der Heide_Nesterow_et al._2007, place={Buenos Aires, Argentina}, title={Smart
Teams: Simulating Large Robotic Swarms in Vast Environments}, booktitle={Proceedings
of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment},
publisher={Heinz Nixdorf Institut, University of Paderborn}, author={Arens, Stephan
and Buss, Alexander and Deck, Helena and Dynia, Miroslaw and Fischer, Matthias
and Hagedorn, Holger and Isaak, Peter and Kutylowski, Jaroslaw and Meyer auf der
Heide, Friedhelm and Nesterow, Viktor and et al.}, year={2007}, pages={215–222}
}'
chicago: 'Arens, Stephan, Alexander Buss, Helena Deck, Miroslaw Dynia, Matthias
Fischer, Holger Hagedorn, Peter Isaak, et al. “Smart Teams: Simulating Large Robotic
Swarms in Vast Environments.” In Proceedings of the 4th International Symposium
on Autonomous Minirobots for Research and Edutainment, 215–22. Buenos Aires,
Argentina: Heinz Nixdorf Institut, University of Paderborn, 2007.'
ieee: 'S. Arens et al., “Smart Teams: Simulating Large Robotic Swarms in
Vast Environments,” in Proceedings of the 4th International Symposium on Autonomous
Minirobots for Research and Edutainment, 2007, pp. 215–222.'
mla: 'Arens, Stephan, et al. “Smart Teams: Simulating Large Robotic Swarms in Vast
Environments.” Proceedings of the 4th International Symposium on Autonomous
Minirobots for Research and Edutainment, Heinz Nixdorf Institut, University
of Paderborn, 2007, pp. 215–22.'
short: 'S. Arens, A. Buss, H. Deck, M. Dynia, M. Fischer, H. Hagedorn, P. Isaak,
J. Kutylowski, F. Meyer auf der Heide, V. Nesterow, A. Ogiermann, B. Stobbe, T.
Storm, H. Wachsmuth, in: Proceedings of the 4th International Symposium on Autonomous
Minirobots for Research and Edutainment, Heinz Nixdorf Institut, University of
Paderborn, Buenos Aires, Argentina, 2007, pp. 215–222.'
date_created: 2019-02-21T11:56:39Z
date_updated: 2022-01-06T07:03:48Z
department:
- _id: '66'
- _id: '600'
- _id: '63'
language:
- iso: eng
main_file_link:
- url: https://webis.de/downloads/publications/papers/arens_2007.pdf
page: 215-222
place: Buenos Aires, Argentina
publication: Proceedings of the 4th International Symposium on Autonomous Minirobots
for Research and Edutainment
publisher: Heinz Nixdorf Institut, University of Paderborn
status: public
title: 'Smart Teams: Simulating Large Robotic Swarms in Vast Environments'
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '16467'
author:
- first_name: Miroslaw
full_name: Dynia, Miroslaw
last_name: Dynia
- first_name: Jaroslaw
full_name: Kutylowski, Jaroslaw
last_name: Kutylowski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Jonas
full_name: Schrieb, Jonas
last_name: Schrieb
citation:
ama: 'Dynia M, Kutylowski J, Meyer auf der Heide F, Schrieb J. Local strategies
for maintaining a chain of relay stations between an explorer and a base station.
In: Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms
and Architectures - SPAA ’07. ; 2007. doi:10.1145/1248377.1248420'
apa: Dynia, M., Kutylowski, J., Meyer auf der Heide, F., & Schrieb, J. (2007).
Local strategies for maintaining a chain of relay stations between an explorer
and a base station. In Proceedings of the nineteenth annual ACM symposium on
Parallel algorithms and architectures - SPAA ’07. https://doi.org/10.1145/1248377.1248420
bibtex: '@inproceedings{Dynia_Kutylowski_Meyer auf der Heide_Schrieb_2007, title={Local
strategies for maintaining a chain of relay stations between an explorer and a
base station}, DOI={10.1145/1248377.1248420},
booktitle={Proceedings of the nineteenth annual ACM symposium on Parallel algorithms
and architectures - SPAA ’07}, author={Dynia, Miroslaw and Kutylowski, Jaroslaw
and Meyer auf der Heide, Friedhelm and Schrieb, Jonas}, year={2007} }'
chicago: Dynia, Miroslaw, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, and
Jonas Schrieb. “Local Strategies for Maintaining a Chain of Relay Stations between
an Explorer and a Base Station.” In Proceedings of the Nineteenth Annual ACM
Symposium on Parallel Algorithms and Architectures - SPAA ’07, 2007. https://doi.org/10.1145/1248377.1248420.
ieee: M. Dynia, J. Kutylowski, F. Meyer auf der Heide, and J. Schrieb, “Local strategies
for maintaining a chain of relay stations between an explorer and a base station,”
in Proceedings of the nineteenth annual ACM symposium on Parallel algorithms
and architectures - SPAA ’07, 2007.
mla: Dynia, Miroslaw, et al. “Local Strategies for Maintaining a Chain of Relay
Stations between an Explorer and a Base Station.” Proceedings of the Nineteenth
Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’07,
2007, doi:10.1145/1248377.1248420.
short: 'M. Dynia, J. Kutylowski, F. Meyer auf der Heide, J. Schrieb, in: Proceedings
of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures
- SPAA ’07, 2007.'
date_created: 2020-04-08T08:58:19Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1248377.1248420
language:
- iso: eng
publication: Proceedings of the nineteenth annual ACM symposium on Parallel algorithms
and architectures - SPAA '07
publication_identifier:
isbn:
- '9781595936677'
publication_status: published
status: public
title: Local strategies for maintaining a chain of relay stations between an explorer
and a base station
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '19612'
author:
- first_name: Jan
full_name: Klein, Jan
last_name: Klein
citation:
ama: Klein J. Efficient Collision Detection for Point and Polygon Based Models.
Vol 186. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006.
apa: Klein, J. (2006). Efficient Collision Detection for Point and Polygon Based
Models (Vol. 186). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Klein_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Efficient Collision Detection for Point and Polygon Based Models},
volume={186}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn},
author={Klein, Jan}, year={2006}, collection={Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn} }'
chicago: Klein, Jan. Efficient Collision Detection for Point and Polygon Based
Models. Vol. 186. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.
ieee: J. Klein, Efficient Collision Detection for Point and Polygon Based Models,
vol. 186. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.
mla: Klein, Jan. Efficient Collision Detection for Point and Polygon Based Models.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.
short: J. Klein, Efficient Collision Detection for Point and Polygon Based Models,
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.
date_created: 2020-09-22T07:48:45Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 186'
language:
- iso: eng
publication_identifier:
isbn:
- 3-939350-05-2
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20050101248
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Efficient Collision Detection for Point and Polygon Based Models
type: dissertation
user_id: '5786'
volume: 186
year: '2006'
...
---
_id: '19613'
author:
- first_name: Stefan
full_name: Rührup, Stefan
last_name: Rührup
citation:
ama: Rührup S. Position-Based Routing Strategies. Vol 203. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2006.
apa: Rührup, S. (2006). Position-based Routing Strategies (Vol. 203). Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Rührup_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Position-based Routing Strategies}, volume={203}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Rührup, Stefan}, year={2006},
collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Rührup, Stefan. Position-Based Routing Strategies. Vol. 203. Verlagsschriftenreihe
Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn, 2006.
ieee: S. Rührup, Position-based Routing Strategies, vol. 203. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2006.
mla: Rührup, Stefan. Position-Based Routing Strategies. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2006.
short: S. Rührup, Position-Based Routing Strategies, Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn, 2006.
date_created: 2020-09-22T07:51:17Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 203'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-939350-22-4
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20070301169
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Position-based Routing Strategies
type: dissertation
user_id: '5786'
volume: 203
year: '2006'
...
---
_id: '19690'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Piotr
full_name: Krysta, Piotr
last_name: Krysta
citation:
ama: 'Briest P, Krysta P. Single-Minded Unlimited Supply Pricing on Sparse Instances.
In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA).
; 2006.'
apa: Briest, P., & Krysta, P. (2006). Single-Minded Unlimited Supply Pricing
on Sparse Instances. In Proceedings of the 17th ACM-SIAM Symposium on Discrete
Algorithms (SODA).
bibtex: '@inproceedings{Briest_Krysta_2006, title={Single-Minded Unlimited Supply
Pricing on Sparse Instances}, booktitle={Proceedings of the 17th ACM-SIAM Symposium
on Discrete Algorithms (SODA)}, author={Briest, Patrick and Krysta, Piotr}, year={2006}
}'
chicago: Briest, Patrick, and Piotr Krysta. “Single-Minded Unlimited Supply Pricing
on Sparse Instances.” In Proceedings of the 17th ACM-SIAM Symposium on Discrete
Algorithms (SODA), 2006.
ieee: P. Briest and P. Krysta, “Single-Minded Unlimited Supply Pricing on Sparse
Instances,” in Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms
(SODA), 2006.
mla: Briest, Patrick, and Piotr Krysta. “Single-Minded Unlimited Supply Pricing
on Sparse Instances.” Proceedings of the 17th ACM-SIAM Symposium on Discrete
Algorithms (SODA), 2006.
short: 'P. Briest, P. Krysta, in: Proceedings of the 17th ACM-SIAM Symposium on
Discrete Algorithms (SODA), 2006.'
date_created: 2020-09-25T10:36:04Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
language:
- iso: eng
publication: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)
status: public
title: Single-Minded Unlimited Supply Pricing on Sparse Instances
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '19691'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Christian
full_name: Gunia, Christian
last_name: Gunia
citation:
ama: 'Briest P, Gunia C. Energy-Efficient Broadcast Scheduling for Speed-Controlled
Transmission Channels. In: Proceedings of the 17th International Symposium
on Algorithms and Computation (ISAAC). ; 2006.'
apa: Briest, P., & Gunia, C. (2006). Energy-Efficient Broadcast Scheduling for
Speed-Controlled Transmission Channels. In Proceedings of the 17th International
Symposium on Algorithms and Computation (ISAAC).
bibtex: '@inproceedings{Briest_Gunia_2006, title={Energy-Efficient Broadcast Scheduling
for Speed-Controlled Transmission Channels}, booktitle={Proceedings of the 17th
International Symposium on Algorithms and Computation (ISAAC)}, author={Briest,
Patrick and Gunia, Christian}, year={2006} }'
chicago: Briest, Patrick, and Christian Gunia. “Energy-Efficient Broadcast Scheduling
for Speed-Controlled Transmission Channels.” In Proceedings of the 17th International
Symposium on Algorithms and Computation (ISAAC), 2006.
ieee: P. Briest and C. Gunia, “Energy-Efficient Broadcast Scheduling for Speed-Controlled
Transmission Channels,” in Proceedings of the 17th International Symposium
on Algorithms and Computation (ISAAC), 2006.
mla: Briest, Patrick, and Christian Gunia. “Energy-Efficient Broadcast Scheduling
for Speed-Controlled Transmission Channels.” Proceedings of the 17th International
Symposium on Algorithms and Computation (ISAAC), 2006.
short: 'P. Briest, C. Gunia, in: Proceedings of the 17th International Symposium
on Algorithms and Computation (ISAAC), 2006.'
date_created: 2020-09-25T10:38:20Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
language:
- iso: eng
publication: Proceedings of the 17th International Symposium on Algorithms and Computation
(ISAAC)
status: public
title: Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '19718'
author:
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
citation:
ama: Degener B. Die Analyse von Estimation-of-Distribution-Algorithmen Auf Ausgewählten
Funktionen.; 2006.
apa: Degener, B. (2006). Die Analyse von Estimation-of-Distribution-Algorithmen
auf ausgewählten Funktionen.
bibtex: '@book{Degener_2006, title={Die Analyse von Estimation-of-Distribution-Algorithmen
auf ausgewählten Funktionen}, author={Degener, Bastian}, year={2006} }'
chicago: Degener, Bastian. Die Analyse von Estimation-of-Distribution-Algorithmen
Auf Ausgewählten Funktionen, 2006.
ieee: B. Degener, Die Analyse von Estimation-of-Distribution-Algorithmen auf
ausgewählten Funktionen. 2006.
mla: Degener, Bastian. Die Analyse von Estimation-of-Distribution-Algorithmen
Auf Ausgewählten Funktionen. 2006.
short: B. Degener, Die Analyse von Estimation-of-Distribution-Algorithmen Auf Ausgewählten
Funktionen, 2006.
date_created: 2020-09-28T10:01:34Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
language:
- iso: eng
status: public
title: Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen
type: mastersthesis
user_id: '15415'
year: '2006'
...
---
_id: '19808'
abstract:
- lang: eng
text: We study the problem of designing an adaptive hash table for redundant data
storage in a system of storage devices with arbitrary capacities. Ideally, such
a hash table should make sure that (a) a storage device with x% of the available
capacity should get x% of the data, (b) the copies of each data item are distributed
among the storage devices so that no two copies are stored at the same device,
and (c) only a near-minimum amount of data replacements is necessary to preserve
(a) and (b) under any change in the system. Hash tables satisfying (a) and (c)
are already known, and it is not difficult to construct hash tables satisfying
(a) and (b). However, no hash table is known so far that can satisfy all three
properties as long as this is in principle possible. We present a strategy called
SPREAD that solves this problem for the first time. As long as (a) and (b) can
in principle be satisfied, SPREAD preserves (a) for every storage device nearly
optimal, with high probability, guarantees (b) for every data item, and only needs
a constant factor more data replacements than minimum possible in order to preserve
(a) and (b).
author:
- first_name: Peter
full_name: Mahlmann, Peter
last_name: Mahlmann
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Mahlmann P, Schindelhauer C. Distributed random digraph transformations for
peer-to-peer networks. In: Proceedings of the Eighteenth Annual ACM Symposium
on Parallelism in Algorithms and Architectures - SPAA ’06. ; 2006:308--317.
doi:10.1145/1148109.1148162'
apa: Mahlmann, P., & Schindelhauer, C. (2006). Distributed random digraph transformations
for peer-to-peer networks. In Proceedings of the eighteenth annual ACM symposium
on Parallelism in algorithms and architectures - SPAA ’06 (pp. 308--317).
https://doi.org/10.1145/1148109.1148162
bibtex: '@inproceedings{Mahlmann_Schindelhauer_2006, title={Distributed random digraph
transformations for peer-to-peer networks}, DOI={10.1145/1148109.1148162},
booktitle={Proceedings of the eighteenth annual ACM symposium on Parallelism in
algorithms and architectures - SPAA ’06}, author={Mahlmann, Peter and Schindelhauer,
Christian}, year={2006}, pages={308--317} }'
chicago: Mahlmann, Peter, and Christian Schindelhauer. “Distributed Random Digraph
Transformations for Peer-to-Peer Networks.” In Proceedings of the Eighteenth
Annual ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’06,
308--317, 2006. https://doi.org/10.1145/1148109.1148162.
ieee: P. Mahlmann and C. Schindelhauer, “Distributed random digraph transformations
for peer-to-peer networks,” in Proceedings of the eighteenth annual ACM symposium
on Parallelism in algorithms and architectures - SPAA ’06, 2006, pp. 308--317.
mla: Mahlmann, Peter, and Christian Schindelhauer. “Distributed Random Digraph Transformations
for Peer-to-Peer Networks.” Proceedings of the Eighteenth Annual ACM Symposium
on Parallelism in Algorithms and Architectures - SPAA ’06, 2006, pp. 308--317,
doi:10.1145/1148109.1148162.
short: 'P. Mahlmann, C. Schindelhauer, in: Proceedings of the Eighteenth Annual
ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’06, 2006,
pp. 308--317.'
date_created: 2020-09-30T13:07:55Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1145/1148109.1148162
language:
- iso: eng
page: 308--317
publication: Proceedings of the eighteenth annual ACM symposium on Parallelism in
algorithms and architectures - SPAA '06
publication_identifier:
isbn:
- '1595934529'
publication_status: published
status: public
title: Distributed random digraph transformations for peer-to-peer networks
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '19838'
author:
- first_name: Stefan
full_name: Rührup, Stefan
last_name: Rührup
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Rührup S, Schindelhauer C. Online Multi-path Routing in a Maze. In: Proc.
of the 17th International Symposium on Algorithms and Computation (ISAAC 2006).
; 2006. doi:10.1007/11940128_65'
apa: Rührup, S., & Schindelhauer, C. (2006). Online Multi-path Routing in a
Maze. In Proc. of the 17th International Symposium on Algorithms and Computation
(ISAAC 2006). https://doi.org/10.1007/11940128_65
bibtex: '@inproceedings{Rührup_Schindelhauer_2006, title={Online Multi-path Routing
in a Maze}, DOI={10.1007/11940128_65},
booktitle={Proc. of the 17th International Symposium on Algorithms and Computation
(ISAAC 2006)}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2006}
}'
chicago: Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing
in a Maze.” In Proc. of the 17th International Symposium on Algorithms and
Computation (ISAAC 2006), 2006. https://doi.org/10.1007/11940128_65.
ieee: S. Rührup and C. Schindelhauer, “Online Multi-path Routing in a Maze,” in
Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC
2006), 2006.
mla: Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing in
a Maze.” Proc. of the 17th International Symposium on Algorithms and Computation
(ISAAC 2006), 2006, doi:10.1007/11940128_65.
short: 'S. Rührup, C. Schindelhauer, in: Proc. of the 17th International Symposium
on Algorithms and Computation (ISAAC 2006), 2006.'
date_created: 2020-10-01T11:51:15Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/11940128_65
language:
- iso: eng
publication: Proc. of the 17th International Symposium on Algorithms and Computation
(ISAAC 2006)
publication_identifier:
isbn:
- '9783540496946'
- '9783540496960'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Online Multi-path Routing in a Maze
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '19839'
abstract:
- lang: eng
text: Storage Area Networks commonly consist a more or less static set of n data
servers that handle a dynamic collection of m documents. Such SANs can minimize
the access time to documents by distributing each document among several servers,
allowing users to access documents in parallel. This paper describes an efficient
solution for providing parallel access to multiple hard disks for popular content.
In extension to previous approaches we provide an efficient and elegant hash table
data structure for utilizing the full capacity of each data server. Concerning
the dynamics, documents as well as server may be added or removed from the system
causing only local changes. We consider sequential and parallel access to data
in the average case. For the average time model we present a fast optimal algorithm.
author:
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Gunnar
full_name: Schomaker, Gunnar
last_name: Schomaker
citation:
ama: 'Schindelhauer C, Schomaker G. SAN Optimal Multi Parameter Access Scheme. In:
5th International Conference on Networking (ICN). ; 2006. doi:10.1109/icniconsmcl.2006.190'
apa: Schindelhauer, C., & Schomaker, G. (2006). SAN Optimal Multi Parameter
Access Scheme. 5th International Conference on Networking (ICN). https://doi.org/10.1109/icniconsmcl.2006.190
bibtex: '@inproceedings{Schindelhauer_Schomaker_2006, title={SAN Optimal Multi Parameter
Access Scheme}, DOI={10.1109/icniconsmcl.2006.190},
booktitle={5th International Conference on Networking (ICN)}, author={Schindelhauer,
Christian and Schomaker, Gunnar}, year={2006} }'
chicago: Schindelhauer, Christian, and Gunnar Schomaker. “SAN Optimal Multi Parameter
Access Scheme.” In 5th International Conference on Networking (ICN), 2006.
https://doi.org/10.1109/icniconsmcl.2006.190.
ieee: 'C. Schindelhauer and G. Schomaker, “SAN Optimal Multi Parameter Access Scheme,”
2006, doi: 10.1109/icniconsmcl.2006.190.'
mla: Schindelhauer, Christian, and Gunnar Schomaker. “SAN Optimal Multi Parameter
Access Scheme.” 5th International Conference on Networking (ICN), 2006,
doi:10.1109/icniconsmcl.2006.190.
short: 'C. Schindelhauer, G. Schomaker, in: 5th International Conference on Networking
(ICN), 2006.'
date_created: 2020-10-01T11:55:27Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1109/icniconsmcl.2006.190
language:
- iso: eng
publication: 5th International Conference on Networking (ICN)
publication_identifier:
isbn:
- '0769525520'
publication_status: published
status: public
title: SAN Optimal Multi Parameter Access Scheme
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '19840'
author:
- first_name: Stefan
full_name: Rührup, Stefan
last_name: Rührup
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: Rührup S, Schindelhauer C. Improved Bounds for Online Multi-Path Routing
in Faulty Mesh Networks. Universität Paderborn; 2006.
apa: Rührup, S., & Schindelhauer, C. (2006). Improved Bounds for Online Multi-Path
Routing in Faulty Mesh Networks. Universität Paderborn.
bibtex: '@book{Rührup_Schindelhauer_2006, place={Universität Paderborn}, title={Improved
Bounds for Online Multi-Path Routing in Faulty Mesh Networks}, author={Rührup,
Stefan and Schindelhauer, Christian}, year={2006} }'
chicago: Rührup, Stefan, and Christian Schindelhauer. Improved Bounds for Online
Multi-Path Routing in Faulty Mesh Networks. Universität Paderborn, 2006.
ieee: S. Rührup and C. Schindelhauer, Improved Bounds for Online Multi-Path Routing
in Faulty Mesh Networks. Universität Paderborn, 2006.
mla: Rührup, Stefan, and Christian Schindelhauer. Improved Bounds for Online
Multi-Path Routing in Faulty Mesh Networks. 2006.
short: S. Rührup, C. Schindelhauer, Improved Bounds for Online Multi-Path Routing
in Faulty Mesh Networks, Universität Paderborn, 2006.
date_created: 2020-10-01T12:01:15Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
language:
- iso: eng
place: Universität Paderborn
status: public
title: Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks
type: report
user_id: '15415'
year: '2006'
...
---
_id: '19854'
abstract:
- lang: eng
text: In previous publications there have been several proposals
regarding replica
generation and placement of movie content in
content-distribution-networks
or P2P overlays. Within this paper
we extend approaches for heterogeneous placement
scenarios
described in prior publications. Therefor we presume heterogeneous
server
peers' bandwidth, HD capacity, and movie popularities.
Movie documents are
replicated and placed onto server peers with
respect to the predicted popularity
values. Thus each document
aims to gain fair networks resources according to
its popularity.
We present simulation results of heuristics of different placement
strategies
and compare them with a near optimal technique.
author:
- first_name: Gunnar
full_name: Schomaker, Gunnar
last_name: Schomaker
- first_name: Christoph
full_name: Loeser, Christoph
last_name: Loeser
- first_name: Matthias
full_name: Schubert, Matthias
last_name: Schubert
citation:
ama: 'Schomaker G, Loeser C, Schubert M. Predictive Replication and Placement Strategies
for Movie Documents in heterogeneous Content Delivery Networks. In: 5th International
Conference on Networking (ICN). ; 2006.'
apa: Schomaker, G., Loeser, C., & Schubert, M. (2006). Predictive Replication
and Placement Strategies for Movie Documents in heterogeneous Content Delivery
Networks. In 5th International Conference on Networking (ICN).
bibtex: '@inproceedings{Schomaker_Loeser_Schubert_2006, title={Predictive Replication
and Placement Strategies for Movie Documents in heterogeneous Content Delivery
Networks}, booktitle={5th International Conference on Networking (ICN).}, author={Schomaker,
Gunnar and Loeser, Christoph and Schubert, Matthias}, year={2006} }'
chicago: Schomaker, Gunnar, Christoph Loeser, and Matthias Schubert. “Predictive
Replication and Placement Strategies for Movie Documents in Heterogeneous Content
Delivery Networks.” In 5th International Conference on Networking (ICN).,
2006.
ieee: G. Schomaker, C. Loeser, and M. Schubert, “Predictive Replication and Placement
Strategies for Movie Documents in heterogeneous Content Delivery Networks,” in
5th International Conference on Networking (ICN)., 2006.
mla: Schomaker, Gunnar, et al. “Predictive Replication and Placement Strategies
for Movie Documents in Heterogeneous Content Delivery Networks.” 5th International
Conference on Networking (ICN)., 2006.
short: 'G. Schomaker, C. Loeser, M. Schubert, in: 5th International Conference on
Networking (ICN)., 2006.'
date_created: 2020-10-02T11:57:06Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
language:
- iso: eng
publication: 5th International Conference on Networking (ICN).
status: public
title: Predictive Replication and Placement Strategies for Movie Documents in heterogeneous
Content Delivery Networks
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '19870'
author:
- first_name: Andre
full_name: Brinkmann, Andre
last_name: Brinkmann
- first_name: Sascha
full_name: Effert, Sascha
last_name: Effert
- first_name: Michael
full_name: Heidebuer, Michael
last_name: Heidebuer
- first_name: Mario
full_name: Vodisek, Mario
last_name: Vodisek
citation:
ama: 'Brinkmann A, Effert S, Heidebuer M, Vodisek M. Realizing Multilevel Snapshots
in Dynamically Changing Virtualized Storage Environments. In: 5th International
Conference on Networking (ICN). ; 2006. doi:10.1109/icniconsmcl.2006.182'
apa: Brinkmann, A., Effert, S., Heidebuer, M., & Vodisek, M. (2006). Realizing
Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments.
5th International Conference on Networking (ICN). https://doi.org/10.1109/icniconsmcl.2006.182
bibtex: '@inproceedings{Brinkmann_Effert_Heidebuer_Vodisek_2006, title={Realizing
Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments},
DOI={10.1109/icniconsmcl.2006.182},
booktitle={5th International Conference on Networking (ICN)}, author={Brinkmann,
Andre and Effert, Sascha and Heidebuer, Michael and Vodisek, Mario}, year={2006}
}'
chicago: Brinkmann, Andre, Sascha Effert, Michael Heidebuer, and Mario Vodisek.
“Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments.”
In 5th International Conference on Networking (ICN), 2006. https://doi.org/10.1109/icniconsmcl.2006.182.
ieee: 'A. Brinkmann, S. Effert, M. Heidebuer, and M. Vodisek, “Realizing Multilevel
Snapshots in Dynamically Changing Virtualized Storage Environments,” 2006, doi:
10.1109/icniconsmcl.2006.182.'
mla: Brinkmann, Andre, et al. “Realizing Multilevel Snapshots in Dynamically Changing
Virtualized Storage Environments.” 5th International Conference on Networking
(ICN), 2006, doi:10.1109/icniconsmcl.2006.182.
short: 'A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, in: 5th International
Conference on Networking (ICN), 2006.'
date_created: 2020-10-05T08:38:26Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
- _id: '58'
doi: 10.1109/icniconsmcl.2006.182
language:
- iso: eng
publication: 5th International Conference on Networking (ICN)
publication_identifier:
isbn:
- '0769525520'
publication_status: published
status: public
title: Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage
Environments
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '19932'
abstract:
- lang: eng
text: '#hniid 2484'
author:
- first_name: Michael
full_name: Kortenjan, Michael
last_name: Kortenjan
- first_name: Gunnar
full_name: Schomaker, Gunnar
last_name: Schomaker
citation:
ama: 'Kortenjan M, Schomaker G. Size equivalent cluster trees (SEC-Trees) realtime
rendering of large industrial scenes. In: 4th International Conference on Virtual
Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006).
; 2006. doi:10.1145/1108590.1108608'
apa: Kortenjan, M., & Schomaker, G. (2006). Size equivalent cluster trees (SEC-Trees)
realtime rendering of large industrial scenes. In 4th International Conference
on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph
2006). https://doi.org/10.1145/1108590.1108608
bibtex: '@inproceedings{Kortenjan_Schomaker_2006, title={Size equivalent cluster
trees (SEC-Trees) realtime rendering of large industrial scenes}, DOI={10.1145/1108590.1108608},
booktitle={4th International Conference on Virtual Reality, Computer Graphics,
Visualization and Interaction (Afrigraph 2006)}, author={Kortenjan, Michael and
Schomaker, Gunnar}, year={2006} }'
chicago: Kortenjan, Michael, and Gunnar Schomaker. “Size Equivalent Cluster Trees
(SEC-Trees) Realtime Rendering of Large Industrial Scenes.” In 4th International
Conference on Virtual Reality, Computer Graphics, Visualization and Interaction
(Afrigraph 2006), 2006. https://doi.org/10.1145/1108590.1108608.
ieee: M. Kortenjan and G. Schomaker, “Size equivalent cluster trees (SEC-Trees)
realtime rendering of large industrial scenes,” in 4th International Conference
on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph
2006), 2006.
mla: Kortenjan, Michael, and Gunnar Schomaker. “Size Equivalent Cluster Trees (SEC-Trees)
Realtime Rendering of Large Industrial Scenes.” 4th International Conference
on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph
2006), 2006, doi:10.1145/1108590.1108608.
short: 'M. Kortenjan, G. Schomaker, in: 4th International Conference on Virtual
Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006), 2006.'
date_created: 2020-10-06T13:32:47Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
doi: 10.1145/1108590.1108608
language:
- iso: eng
publication: 4th International Conference on Virtual Reality, Computer Graphics, Visualization
and Interaction (Afrigraph 2006)
status: public
title: Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial
scenes
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '24277'
abstract:
- lang: eng
text: "We propose a dynamic, ad-hoc communication network consisting of mobile units
that can warn about traffic jams on motorways.\r\n\r\nOur goal is to provide a
practical, low cost solution. Therefore we consider very simple wireless communication
hardware, without collision detection, with very small bandwidth and a probabilistic
model of link failure.\r\n\r\nWe provide a complete system architecture. For this
purpose we design and analyze solutions for size approximation, leader election
and broadcasting. Our algorithms are fine-tuned for fast operation in a practical
setting. We provide both a theoretical and experimental evaluation of our solutions.\r\n\r\nOur
contribution is much different from the previous work, where either pure theoretical
models with a pure theoretical analysis are provided or algorithms working in
practical models are evaluated only through simulations."
author:
- first_name: Jarosław
full_name: Kutyłowski, Jarosław
last_name: Kutyłowski
- first_name: Filip
full_name: Zagórski, Filip
last_name: Zagórski
citation:
ama: 'Kutyłowski J, Zagórski F. Reliable Broadcasting Without Collision Detection.
In: SOFSEM 2006: Theory and Practice of Computer Science. ; 2006. doi:10.1007/11611257_37'
apa: 'Kutyłowski, J., & Zagórski, F. (2006). Reliable Broadcasting Without Collision
Detection. SOFSEM 2006: Theory and Practice of Computer Science. https://doi.org/10.1007/11611257_37'
bibtex: '@inproceedings{Kutyłowski_Zagórski_2006, place={Berlin, Heidelberg}, title={Reliable
Broadcasting Without Collision Detection}, DOI={10.1007/11611257_37},
booktitle={SOFSEM 2006: Theory and Practice of Computer Science}, author={Kutyłowski,
Jarosław and Zagórski, Filip}, year={2006} }'
chicago: 'Kutyłowski, Jarosław, and Filip Zagórski. “Reliable Broadcasting Without
Collision Detection.” In SOFSEM 2006: Theory and Practice of Computer Science.
Berlin, Heidelberg, 2006. https://doi.org/10.1007/11611257_37.'
ieee: 'J. Kutyłowski and F. Zagórski, “Reliable Broadcasting Without Collision Detection,”
2006, doi: 10.1007/11611257_37.'
mla: 'Kutyłowski, Jarosław, and Filip Zagórski. “Reliable Broadcasting Without Collision
Detection.” SOFSEM 2006: Theory and Practice of Computer Science, 2006,
doi:10.1007/11611257_37.'
short: 'J. Kutyłowski, F. Zagórski, in: SOFSEM 2006: Theory and Practice of Computer
Science, Berlin, Heidelberg, 2006.'
date_created: 2021-09-13T13:28:29Z
date_updated: 2022-01-06T06:56:13Z
department:
- _id: '63'
doi: 10.1007/11611257_37
language:
- iso: eng
place: Berlin, Heidelberg
publication: 'SOFSEM 2006: Theory and Practice of Computer Science'
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Reliable Broadcasting Without Collision Detection
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '26988'
abstract:
- lang: eng
text: For most of today's IT environments, the tremendous need for storage capacity
in combination with a required minimum I/O performance has become highly critical.
In dynamically growing environments, a storage management solution's underlying
data distribution scheme has great impact to the overall system I/O performance.
The evaluation of a number of open system storage visualization solutions and
volume managers has shown that all of them lack the ability to automatically adapt
to changing access patterns and storage infrastructures; many of them require
an error prone manual re-layout of the data blocks, or rely on a very time consuming
re-striping of all available data. This paper evaluates the performance of conventional
data distribution approaches compared to the adaptive virtualization solution
V:DRIVE in dynamically changing storage environments. Changes of the storage infrastructure
are normally not considered in benchmark results, but can have a significant impact
on storage performance. Using synthetic benchmarks, V:DRIVE is compared in such
changing environments with the non-adaptive Linux logical volume manager (LVM).
The performance results of our tests clearly outline the necessity of adaptive
data distribution schemes.
author:
- first_name: Andre
full_name: Brinkmann, Andre
last_name: Brinkmann
- first_name: 'Sascha '
full_name: 'Effert, Sascha '
last_name: Effert
- first_name: Michael
full_name: Heidebuer, Michael
last_name: Heidebuer
- first_name: Mario
full_name: Vodisek, Mario
last_name: Vodisek
citation:
ama: 'Brinkmann A, Effert S, Heidebuer M, Vodisek M. Influence of adaptive data
layouts on performance in dynamically changing storage environments. In: 14th
Euromicro International Conference on Parallel, Distributed, and Network-Based
Processing (PDP’06). ; 2006. doi:10.1109/pdp.2006.44'
apa: Brinkmann, A., Effert, S., Heidebuer, M., & Vodisek, M. (2006). Influence
of adaptive data layouts on performance in dynamically changing storage environments.
14th Euromicro International Conference on Parallel, Distributed, and Network-Based
Processing (PDP’06). https://doi.org/10.1109/pdp.2006.44
bibtex: '@inproceedings{Brinkmann_Effert_Heidebuer_Vodisek_2006, title={Influence
of adaptive data layouts on performance in dynamically changing storage environments},
DOI={10.1109/pdp.2006.44}, booktitle={14th
Euromicro International Conference on Parallel, Distributed, and Network-Based
Processing (PDP’06)}, author={Brinkmann, Andre and Effert, Sascha and Heidebuer,
Michael and Vodisek, Mario}, year={2006} }'
chicago: Brinkmann, Andre, Sascha Effert, Michael Heidebuer, and Mario Vodisek.
“Influence of Adaptive Data Layouts on Performance in Dynamically Changing Storage
Environments.” In 14th Euromicro International Conference on Parallel, Distributed,
and Network-Based Processing (PDP’06), 2006. https://doi.org/10.1109/pdp.2006.44.
ieee: 'A. Brinkmann, S. Effert, M. Heidebuer, and M. Vodisek, “Influence of adaptive
data layouts on performance in dynamically changing storage environments,” 2006,
doi: 10.1109/pdp.2006.44.'
mla: Brinkmann, Andre, et al. “Influence of Adaptive Data Layouts on Performance
in Dynamically Changing Storage Environments.” 14th Euromicro International
Conference on Parallel, Distributed, and Network-Based Processing (PDP’06),
2006, doi:10.1109/pdp.2006.44.
short: 'A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, in: 14th Euromicro International
Conference on Parallel, Distributed, and Network-Based Processing (PDP’06), 2006.'
date_created: 2021-10-28T08:33:09Z
date_updated: 2022-01-06T06:57:31Z
department:
- _id: '63'
- _id: '26'
doi: 10.1109/pdp.2006.44
language:
- iso: eng
publication: 14th Euromicro International Conference on Parallel, Distributed, and
Network-Based Processing (PDP'06)
publication_status: published
status: public
title: Influence of adaptive data layouts on performance in dynamically changing storage
environments
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '17417'
abstract:
- lang: eng
text: We present a parallel algorithm for the rendering of complex three-dimensional
scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting
of a visualization-node, equipped with a powerful graphics adapter, and cluster
nodes requiring weaker graphics capabilities only. The visualization-node renders
a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes
assist the visualization-node by asynchronous computing of Reliefboards, which
are used to replace and render distant parts of the scene. Our algorithm is capable
of gaining significant speedups if the cluster's nodes provide weak graphics adapters
only. We trade the number of cluster nodes off the scene objects' image quality.
citation:
ama: 'Rammig F-J, Dangelmaier W, Karl H, Mertsching B, Meyer auf der Heide F, Trächtler
A, eds. Self-Coordinating Systems: The Next Challenge in Research on Distributed
Systems. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2006.'
apa: 'Rammig, F.-J., Dangelmaier, W., Karl, H., Mertsching, B., Meyer auf der Heide,
F., & Trächtler, A. (Eds.). (2006). Self-Coordinating Systems: The Next
Challenge in Research on Distributed Systems. Verlagsschriftenreihe des Heinz
Nixdorf Instituts.'
bibtex: '@book{Rammig_Dangelmaier_Karl_Mertsching_Meyer auf der Heide_Trächtler_2006,
place={Paderborn}, series={Proceedings of the 6th International Heinz Nixdorf
Symposium}, title={Self-Coordinating Systems: The Next Challenge in Research on
Distributed Systems}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts},
year={2006}, collection={Proceedings of the 6th International Heinz Nixdorf Symposium}
}'
chicago: 'Rammig, Franz-Josef, Wilhelm Dangelmaier, Holger Karl, Bärbel Mertsching,
Friedhelm Meyer auf der Heide, and Ansgar Trächtler, eds. Self-Coordinating
Systems: The Next Challenge in Research on Distributed Systems. Proceedings
of the 6th International Heinz Nixdorf Symposium. Paderborn: Verlagsschriftenreihe
des Heinz Nixdorf Instituts, 2006.'
ieee: 'F.-J. Rammig, W. Dangelmaier, H. Karl, B. Mertsching, F. Meyer auf der Heide,
and A. Trächtler, Eds., Self-Coordinating Systems: The Next Challenge in Research
on Distributed Systems. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf
Instituts, 2006.'
mla: 'Rammig, Franz-Josef, et al., editors. Self-Coordinating Systems: The Next
Challenge in Research on Distributed Systems. Verlagsschriftenreihe des Heinz
Nixdorf Instituts, 2006.'
short: 'F.-J. Rammig, W. Dangelmaier, H. Karl, B. Mertsching, F. Meyer auf der Heide,
A. Trächtler, eds., Self-Coordinating Systems: The Next Challenge in Research
on Distributed Systems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2006.'
date_created: 2020-07-27T13:00:52Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
- _id: '26'
editor:
- first_name: Franz-Josef
full_name: Rammig, Franz-Josef
last_name: Rammig
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Bärbel
full_name: Mertsching, Bärbel
last_name: Mertsching
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Ansgar
full_name: Trächtler, Ansgar
last_name: Trächtler
language:
- iso: eng
place: Paderborn
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts
series_title: Proceedings of the 6th International Heinz Nixdorf Symposium
status: public
title: 'Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems'
type: conference_editor
user_id: '15415'
year: '2006'
...
---
_id: '17475'
alternative_title:
- '6th international Heinz Nixdorf symposium, January 17 - 18, 2006, Heinz Nixdorf
MuseumsForum: within the scope of the {DFG} Collaborative Research Centre 376 Massively
Parallel Computing: algorithms, design, methods, applications'
author:
- first_name: Burkhard
full_name: Monien, Burkhard
last_name: Monien
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Monien B, Meyer auf der Heide F. New Trends in Parallel and Distributed
Computing. Vol 181. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn;
2006.
apa: Monien, B., & Meyer auf der Heide, F. (2006). New trends in parallel
and distributed computing (Vol. 181). Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn.
bibtex: '@book{Monien_Meyer auf der Heide_2006, series={Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn}, title={New trends in parallel and distributed
computing}, volume={181}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, author={Monien, Burkhard and Meyer auf der Heide, Friedhelm}, year={2006},
collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Monien, Burkhard, and Friedhelm Meyer auf der Heide. New Trends in Parallel
and Distributed Computing. Vol. 181. Verlagsschriftenreihe Des Heinz Nixdorf
Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2006.
ieee: B. Monien and F. Meyer auf der Heide, New trends in parallel and distributed
computing, vol. 181. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2006.
mla: Monien, Burkhard, and Friedhelm Meyer auf der Heide. New Trends in Parallel
and Distributed Computing. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn, 2006.
short: B. Monien, F. Meyer auf der Heide, New Trends in Parallel and Distributed
Computing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.
date_created: 2020-07-30T09:18:30Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 181'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-939350-00-2
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: New trends in parallel and distributed computing
type: book
user_id: '5786'
volume: 181
year: '2006'
...
---
_id: '17619'
author:
- first_name: Matthias
full_name: Grünewald, Matthias
last_name: Grünewald
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Stefan
full_name: Rührup, Stefan
last_name: Rührup
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
citation:
ama: 'Grünewald M, Meyer auf der Heide F, Rührup S, Schindelhauer C, Volbert K.
Directional Communication in Mobile Ad Hoc Networks. In: New Trends in Parallel
& Distributed Computing, 6th Int. Heinz Nixdorf Symposium. Verlagsschriftenreihe
des Heinz Nixdorf Instituts; 2006:225-234.'
apa: Grünewald, M., Meyer auf der Heide, F., Rührup, S., Schindelhauer, C., &
Volbert, K. (2006). Directional Communication in Mobile Ad Hoc Networks. New
Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf Symposium,
225–234.
bibtex: '@inproceedings{Grünewald_Meyer auf der Heide_Rührup_Schindelhauer_Volbert_2006,
place={Paderborn}, title={Directional Communication in Mobile Ad Hoc Networks},
booktitle={New Trends in Parallel & Distributed Computing, 6th Int. Heinz
Nixdorf Symposium}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts},
author={Grünewald, Matthias and Meyer auf der Heide, Friedhelm and Rührup, Stefan
and Schindelhauer, Christian and Volbert, Klaus}, year={2006}, pages={225–234}
}'
chicago: 'Grünewald, Matthias, Friedhelm Meyer auf der Heide, Stefan Rührup, Christian
Schindelhauer, and Klaus Volbert. “Directional Communication in Mobile Ad Hoc
Networks.” In New Trends in Parallel & Distributed Computing, 6th Int.
Heinz Nixdorf Symposium, 225–34. Paderborn: Verlagsschriftenreihe des Heinz
Nixdorf Instituts, 2006.'
ieee: M. Grünewald, F. Meyer auf der Heide, S. Rührup, C. Schindelhauer, and K.
Volbert, “Directional Communication in Mobile Ad Hoc Networks,” in New Trends
in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf Symposium,
2006, pp. 225–234.
mla: Grünewald, Matthias, et al. “Directional Communication in Mobile Ad Hoc Networks.”
New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf
Symposium, Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006, pp. 225–34.
short: 'M. Grünewald, F. Meyer auf der Heide, S. Rührup, C. Schindelhauer, K. Volbert,
in: New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf
Symposium, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006,
pp. 225–234.'
date_created: 2020-08-05T09:36:46Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '26'
language:
- iso: eng
page: 225-234
place: Paderborn
publication: New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf
Symposium
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Directional Communication in Mobile Ad Hoc Networks
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '18676'
abstract:
- lang: eng
text: We present random sampling algorithms that with probability at least 1 - δ
compute a (1 ± ǫ)- approximation of the clustering coefficient, the transitiv
ity coefficient, and of the number of bipartite cliques in a graph given as a
stream of edges. Our methods can be extended to approximately count the number
of occurences of fixed constant-size subgraphs. Our a lgorithms only require one
pass over the input stream and their storage space depends only on structural
parameters of the graphs, the approxi- mation guarantee, and the confidence probability.
For examp le, the algorithms to compute the clustering and transitivity coefficient
depend on that coefficient but n ot on the size of the graph. Since many large
social networks have small clustering and transitivity coe fficient, our algorithms
use space independent of the size of the input for these graphs. We implemented
our algorithms and evaluated their performance on networks from different appli-
cation domains. The sizes of the considered input graphs varied from about 8,
000 nodes and 40, 000 edges to about 135 million nodes and more than 1 billion
edges. For both algorithms we run experiments with a sample set size varying from
100, 000 to 1, 000, 000 to evaluate running time and approximation guarantee.
Our algorithms appear to be time efficient for the se sample sizes.
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Gereon
full_name: Frahling, Gereon
last_name: Frahling
- first_name: Alberto
full_name: Marchetti-Spaccamela, Alberto
last_name: Marchetti-Spaccamela
- first_name: Stefano
full_name: Leonardi, Stefano
last_name: Leonardi
- first_name: Luciana
full_name: Buriol, Luciana
last_name: Buriol
citation:
ama: 'Sohler C, Frahling G, Marchetti-Spaccamela A, Leonardi S, Buriol L. Computing
Clustering Coefficients in Data Streams. In: Proceedings of the European Conference
on Complex Systems (ECCS’06). ; 2006.'
apa: Sohler, C., Frahling, G., Marchetti-Spaccamela, A., Leonardi, S., & Buriol,
L. (2006). Computing Clustering Coefficients in Data Streams. In Proceedings
of the European Conference on Complex Systems (ECCS’06).
bibtex: '@inproceedings{Sohler_Frahling_Marchetti-Spaccamela_Leonardi_Buriol_2006,
title={Computing Clustering Coefficients in Data Streams}, booktitle={Proceedings
of the European Conference on Complex Systems (ECCS’06)}, author={Sohler, Christian
and Frahling, Gereon and Marchetti-Spaccamela, Alberto and Leonardi, Stefano and
Buriol, Luciana}, year={2006} }'
chicago: Sohler, Christian, Gereon Frahling, Alberto Marchetti-Spaccamela, Stefano
Leonardi, and Luciana Buriol. “Computing Clustering Coefficients in Data Streams.”
In Proceedings of the European Conference on Complex Systems (ECCS’06),
2006.
ieee: C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, and L. Buriol,
“Computing Clustering Coefficients in Data Streams,” in Proceedings of the
European Conference on Complex Systems (ECCS’06), 2006.
mla: Sohler, Christian, et al. “Computing Clustering Coefficients in Data Streams.”
Proceedings of the European Conference on Complex Systems (ECCS’06), 2006.
short: 'C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, L. Buriol,
in: Proceedings of the European Conference on Complex Systems (ECCS’06), 2006.'
date_created: 2020-08-31T08:25:01Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
language:
- iso: eng
publication: Proceedings of the European Conference on Complex Systems (ECCS'06)
status: public
title: Computing Clustering Coefficients in Data Streams
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '18745'
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Gereon
full_name: Frahling, Gereon
last_name: Frahling
- first_name: Alberto
full_name: Marchetti-Spaccamela, Alberto
last_name: Marchetti-Spaccamela
- first_name: Stefano
full_name: Leonardi, Stefano
last_name: Leonardi
- first_name: Luciana
full_name: Buriol, Luciana
last_name: Buriol
citation:
ama: 'Sohler C, Frahling G, Marchetti-Spaccamela A, Leonardi S, Buriol L. Counting
Triangles in Data Streams. In: Proceedings of the 25th ACM Symposium on Principles
of Database Systems (PODS), ed. ; 2006.'
apa: Sohler, C., Frahling, G., Marchetti-Spaccamela, A., Leonardi, S., & Buriol,
L. (2006). Counting Triangles in Data Streams. In Proceedings of the 25th ACM
Symposium on Principles of Database Systems (PODS) (Ed.).
bibtex: '@inproceedings{Sohler_Frahling_Marchetti-Spaccamela_Leonardi_Buriol_2006,
title={Counting Triangles in Data Streams}, author={Sohler, Christian and Frahling,
Gereon and Marchetti-Spaccamela, Alberto and Leonardi, Stefano and Buriol, Luciana},
editor={Proceedings of the 25th ACM Symposium on Principles of Database Systems
(PODS)Editor}, year={2006} }'
chicago: Sohler, Christian, Gereon Frahling, Alberto Marchetti-Spaccamela, Stefano
Leonardi, and Luciana Buriol. “Counting Triangles in Data Streams.” edited by
Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS),
2006.
ieee: C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, and L. Buriol,
“Counting Triangles in Data Streams,” 2006.
mla: Sohler, Christian, et al. Counting Triangles in Data Streams. Edited
by Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS),
2006.
short: 'C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, L. Buriol,
in: Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS)
(Ed.), 2006.'
corporate_editor:
- Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS)
date_created: 2020-09-01T10:34:00Z
date_updated: 2022-01-06T06:53:51Z
department:
- _id: '63'
language:
- iso: eng
status: public
title: Counting Triangles in Data Streams
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '18746'
abstract:
- lang: eng
text: "In this paper, we present a randomized constant factor approximation\r\nalgorithm
for the metric minimum facility location problem with uniform\r\ncosts and demands
in a distributed setting, in which every point can\r\nopen a facility. In particular,
our distributed algorithm uses three\r\ncommunication rounds with message sizes
bounded to O(log n) bits where\r\nn is the number of points. We also extend our
algorithm to constant\r\npowers of metric spaces, where we also obtain a randomized
constant\r\nfactor approximation algorithm."
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Christiane
full_name: Lammersen, Christiane
last_name: Lammersen
citation:
ama: 'Sohler C, Gehweiler J, Lammersen C. A Distributed O(1)-Approximation Algorithm
for the Uniform Facility Location Problem. In: Proceeedings of 18th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA). ; 2006.'
apa: Sohler, C., Gehweiler, J., & Lammersen, C. (2006). A Distributed O(1)-Approximation
Algorithm for the Uniform Facility Location Problem. In Proceeedings of 18th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).
bibtex: '@inproceedings{Sohler_Gehweiler_Lammersen_2006, title={A Distributed O(1)-Approximation
Algorithm for the Uniform Facility Location Problem}, booktitle={Proceeedings
of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
author={Sohler, Christian and Gehweiler, Joachim and Lammersen, Christiane}, year={2006}
}'
chicago: Sohler, Christian, Joachim Gehweiler, and Christiane Lammersen. “A Distributed
O(1)-Approximation Algorithm for the Uniform Facility Location Problem.” In Proceeedings
of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
2006.
ieee: C. Sohler, J. Gehweiler, and C. Lammersen, “A Distributed O(1)-Approximation
Algorithm for the Uniform Facility Location Problem,” in Proceeedings of 18th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2006.
mla: Sohler, Christian, et al. “A Distributed O(1)-Approximation Algorithm for the
Uniform Facility Location Problem.” Proceeedings of 18th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2006.
short: 'C. Sohler, J. Gehweiler, C. Lammersen, in: Proceeedings of 18th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2006.'
date_created: 2020-09-01T10:38:29Z
date_updated: 2022-01-06T06:53:51Z
department:
- _id: '63'
language:
- iso: eng
publication: Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA)
status: public
title: A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location
Problem
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '18926'
author:
- first_name: Miroslaw
full_name: Dynia, Miroslaw
last_name: Dynia
- first_name: Miroslaw
full_name: Korzeniowski, Miroslaw
last_name: Korzeniowski
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Dynia M, Korzeniowski M, Schindelhauer C. Power-Aware Collective Tree Exploration.
In: Architecture of Computing Systems - ARCS. ; 2006:341--351. doi:10.1007/11682127_24'
apa: Dynia, M., Korzeniowski, M., & Schindelhauer, C. (2006). Power-Aware Collective
Tree Exploration. In Architecture of Computing Systems - ARCS (pp. 341--351).
https://doi.org/10.1007/11682127_24
bibtex: '@inproceedings{Dynia_Korzeniowski_Schindelhauer_2006, title={Power-Aware
Collective Tree Exploration}, DOI={10.1007/11682127_24},
number={3894}, booktitle={Architecture of Computing Systems - ARCS}, author={Dynia,
Miroslaw and Korzeniowski, Miroslaw and Schindelhauer, Christian}, year={2006},
pages={341--351} }'
chicago: Dynia, Miroslaw, Miroslaw Korzeniowski, and Christian Schindelhauer. “Power-Aware
Collective Tree Exploration.” In Architecture of Computing Systems - ARCS,
341--351, 2006. https://doi.org/10.1007/11682127_24.
ieee: M. Dynia, M. Korzeniowski, and C. Schindelhauer, “Power-Aware Collective Tree
Exploration,” in Architecture of Computing Systems - ARCS, 2006, no. 3894,
pp. 341--351.
mla: Dynia, Miroslaw, et al. “Power-Aware Collective Tree Exploration.” Architecture
of Computing Systems - ARCS, no. 3894, 2006, pp. 341--351, doi:10.1007/11682127_24.
short: 'M. Dynia, M. Korzeniowski, C. Schindelhauer, in: Architecture of Computing
Systems - ARCS, 2006, pp. 341--351.'
date_created: 2020-09-03T10:13:56Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '63'
doi: 10.1007/11682127_24
issue: '3894'
language:
- iso: eng
page: 341--351
publication: Architecture of Computing Systems - ARCS
publication_identifier:
isbn:
- '9783540327653'
- '9783540327660'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Power-Aware Collective Tree Exploration
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '18972'
author:
- first_name: Valentina
full_name: Damerow, Valentina
last_name: Damerow
citation:
ama: Damerow V. Average and Smoothed Complexity of Geometric Structures.
Vol 190. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006.
apa: Damerow, V. (2006). Average and Smoothed Complexity of Geometric Structures
(Vol. 190). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Damerow_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Average and Smoothed Complexity of Geometric Structures}, volume={190},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Damerow,
Valentina}, year={2006}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Damerow, Valentina. Average and Smoothed Complexity of Geometric Structures.
Vol. 190. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2006.
ieee: V. Damerow, Average and Smoothed Complexity of Geometric Structures,
vol. 190. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.
mla: Damerow, Valentina. Average and Smoothed Complexity of Geometric Structures.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.
short: V. Damerow, Average and Smoothed Complexity of Geometric Structures, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2006.
date_created: 2020-09-04T06:47:03Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 190'
language:
- iso: eng
publication_identifier:
isbn:
- 3-939350-09-5
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-2007022210
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Average and Smoothed Complexity of Geometric Structures
type: dissertation
user_id: '5786'
volume: 190
year: '2006'
...
---
_id: '18999'
abstract:
- lang: eng
text: "We present a web computing library (PUBWCL) in Java that allows to execute
tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style
on PCs distributed over the internet whose owners are willing to donate their
unused computation power. PUBWCL is realized as a peer-to-peer system and features
migration and restoration of BSP processes executed on it. The use of Java guarantees
a high level of security and makes PUBWCL platform- independent. In order to estimate
the loss of efficiency inherent in such a Java-based system, we have compared
it to our C-based PUB-Library.\r\nAs the unused computation power of the participating
PCs is unpredictable, we need novel strategies for load balancing that have no
access to future changes of the computation power available for the application.
We develop, analyze, and compare different load balancing strategies for PUBWCL.
In order to handle the influence of the fluctuating available computation power,
we classify the external work load.\r\nDuring our evaluation of the load balancing
algorithms we simulated the external work load in order to have repeatable testing
conditions. With the best performing load balancing strategy we could save 39%
of the execution time on average and even up to 50% in particular cases, in our
test environment.\r\n"
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
citation:
ama: 'Bonorden O, Meyer auf der Heide F, Gehweiler J. A Web Computing Environment
for Parallel Algorithms in Java. In: Journal on Scalable Computing: Practice
and Experience. ; 2006:1-14.'
apa: 'Bonorden, O., Meyer auf der Heide, F., & Gehweiler, J. (2006). A Web Computing
Environment for Parallel Algorithms in Java. In Journal on Scalable Computing:
Practice and Experience (pp. 1–14).'
bibtex: '@inproceedings{Bonorden_Meyer auf der Heide_Gehweiler_2006, title={A Web
Computing Environment for Parallel Algorithms in Java}, booktitle={Journal on
Scalable Computing: Practice and Experience}, author={Bonorden, Olaf and Meyer
auf der Heide, Friedhelm and Gehweiler, Joachim}, year={2006}, pages={1–14} }'
chicago: 'Bonorden, Olaf, Friedhelm Meyer auf der Heide, and Joachim Gehweiler.
“A Web Computing Environment for Parallel Algorithms in Java.” In Journal on
Scalable Computing: Practice and Experience, 1–14, 2006.'
ieee: 'O. Bonorden, F. Meyer auf der Heide, and J. Gehweiler, “A Web Computing Environment
for Parallel Algorithms in Java,” in Journal on Scalable Computing: Practice
and Experience, 2006, pp. 1–14.'
mla: 'Bonorden, Olaf, et al. “A Web Computing Environment for Parallel Algorithms
in Java.” Journal on Scalable Computing: Practice and Experience, 2006,
pp. 1–14.'
short: 'O. Bonorden, F. Meyer auf der Heide, J. Gehweiler, in: Journal on Scalable
Computing: Practice and Experience, 2006, pp. 1–14.'
date_created: 2020-09-04T09:50:01Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '63'
language:
- iso: eng
page: 1-14
publication: 'Journal on Scalable Computing: Practice and Experience'
status: public
title: A Web Computing Environment for Parallel Algorithms in Java
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '19001'
abstract:
- lang: eng
text: "We present a novel architecture for distributed computing in a peer-to-peer
network. In particular, we realize the Paderborn University BSP-based Web Computing
Library (PUBWCL), which formerly used a centralized client-server architecture
for scheduling and load balancing, as a pure peer-to-peer system. Using distributed
heterogeneous hash tables (DHHT), our architecture features scheduling and load
balancing of tightly coupled, massively parallel algorithms in the bulk-synchronous
(BSP) style with a minimal number of migrations.\r\n"
author:
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Gunnar
full_name: Schomaker, Gunnar
last_name: Schomaker
citation:
ama: 'Gehweiler J, Schomaker G. Distributed Load Balancing in Heterogeneous Peer-to-Peer
Networks for Web Computing Libraries. In: Proceeedings of 10th IEEE/ACM International
Symposium on Distributed Simulation and Real Time Applications (DS-RT). ;
2006:51-58. doi:10.1109/ds-rt.2006.15'
apa: Gehweiler, J., & Schomaker, G. (2006). Distributed Load Balancing in Heterogeneous
Peer-to-Peer Networks for Web Computing Libraries. In Proceeedings of 10th
IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
(DS-RT) (pp. 51–58). https://doi.org/10.1109/ds-rt.2006.15
bibtex: '@inproceedings{Gehweiler_Schomaker_2006, title={Distributed Load Balancing
in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries}, DOI={10.1109/ds-rt.2006.15},
booktitle={Proceeedings of 10th IEEE/ACM International Symposium on Distributed
Simulation and Real Time Applications (DS-RT)}, author={Gehweiler, Joachim and
Schomaker, Gunnar}, year={2006}, pages={51–58} }'
chicago: Gehweiler, Joachim, and Gunnar Schomaker. “Distributed Load Balancing in
Heterogeneous Peer-to-Peer Networks for Web Computing Libraries.” In Proceeedings
of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time
Applications (DS-RT), 51–58, 2006. https://doi.org/10.1109/ds-rt.2006.15.
ieee: J. Gehweiler and G. Schomaker, “Distributed Load Balancing in Heterogeneous
Peer-to-Peer Networks for Web Computing Libraries,” in Proceeedings of 10th
IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
(DS-RT), 2006, pp. 51–58.
mla: Gehweiler, Joachim, and Gunnar Schomaker. “Distributed Load Balancing in Heterogeneous
Peer-to-Peer Networks for Web Computing Libraries.” Proceeedings of 10th IEEE/ACM
International Symposium on Distributed Simulation and Real Time Applications (DS-RT),
2006, pp. 51–58, doi:10.1109/ds-rt.2006.15.
short: 'J. Gehweiler, G. Schomaker, in: Proceeedings of 10th IEEE/ACM International
Symposium on Distributed Simulation and Real Time Applications (DS-RT), 2006,
pp. 51–58.'
date_created: 2020-09-04T09:56:41Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1109/ds-rt.2006.15
language:
- iso: eng
page: 51-58
publication: Proceeedings of 10th IEEE/ACM International Symposium on Distributed
Simulation and Real Time Applications (DS-RT)
publication_identifier:
isbn:
- '0769526977'
publication_status: published
status: public
title: Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing
Libraries
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '23881'
abstract:
- lang: eng
text: Computing a maximum weighted stable set in a bipartite graph is considered
well-solved and usually approached with preflow-push, Ford–Fulkerson or network
simplex algorithms. We present a combinatorial algorithm for the problem that
is not based on flows. Numerical tests suggest that this algorithm performs quite
well in practice and is competitive with flow based algorithms especially in the
case of dense graphs.
author:
- first_name: Ulrich
full_name: Faigle, Ulrich
last_name: Faigle
- first_name: Gereon
full_name: Frahling, Gereon
last_name: Frahling
citation:
ama: Faigle U, Frahling G. A combinatorial algorithm for weighted stable sets in
bipartite graphs. Discrete Applied Mathematics. 2006:1380-1391. doi:10.1016/j.dam.2005.05.037
apa: Faigle, U., & Frahling, G. (2006). A combinatorial algorithm for weighted
stable sets in bipartite graphs. Discrete Applied Mathematics, 1380–1391.
https://doi.org/10.1016/j.dam.2005.05.037
bibtex: '@article{Faigle_Frahling_2006, title={A combinatorial algorithm for weighted
stable sets in bipartite graphs}, DOI={10.1016/j.dam.2005.05.037},
journal={Discrete Applied Mathematics}, author={Faigle, Ulrich and Frahling, Gereon},
year={2006}, pages={1380–1391} }'
chicago: Faigle, Ulrich, and Gereon Frahling. “A Combinatorial Algorithm for Weighted
Stable Sets in Bipartite Graphs.” Discrete Applied Mathematics, 2006, 1380–91.
https://doi.org/10.1016/j.dam.2005.05.037.
ieee: U. Faigle and G. Frahling, “A combinatorial algorithm for weighted stable
sets in bipartite graphs,” Discrete Applied Mathematics, pp. 1380–1391,
2006.
mla: Faigle, Ulrich, and Gereon Frahling. “A Combinatorial Algorithm for Weighted
Stable Sets in Bipartite Graphs.” Discrete Applied Mathematics, 2006, pp.
1380–91, doi:10.1016/j.dam.2005.05.037.
short: U. Faigle, G. Frahling, Discrete Applied Mathematics (2006) 1380–1391.
date_created: 2021-09-07T12:54:05Z
date_updated: 2022-01-06T06:56:02Z
department:
- _id: '63'
doi: 10.1016/j.dam.2005.05.037
language:
- iso: eng
page: 1380-1391
publication: Discrete Applied Mathematics
publication_identifier:
issn:
- 0166-218X
publication_status: published
status: public
title: A combinatorial algorithm for weighted stable sets in bipartite graphs
type: journal_article
user_id: '15415'
year: '2006'
...
---
_id: '23882'
abstract:
- lang: eng
text: In this paper we develop an efficient implementation for a k-means clustering
algorithm. Our algorithm is a variant of KMHybrid [28, 20], i.e. it uses a combination
of Lloyd-steps and random swaps, but as a novel feature it uses coresets to speed
up the algorithm. A coreset is a small weighted set of points that approximates
the original point set with respect to the considered problem. The main strength
of the algorithm is that it can quickly determine clusterings of the same point
set for many values of k. This is necessary in many applications, since, typically,
one does not know a good value for k in advance. Once we have clusterings for
many different values of k we can determine a good choice of k using a quality
measure of clusterings that is independent of k, for example the average silhouette
coefficient. The average silhouette coefficient can be approximated using coresets.To
evaluate the performance of our algorithm we compare it with algorithm KMHybrid
[28] on typical 3D data sets for an image compression application and on artificially
created instances. Our data sets consist of 300,000 to 4.9 million points. We
show that our algorithm significantly outperforms KMHybrid on most of these input
instances. Additionally, the quality of the solutions computed by our algorithm
deviates less than that of KMHybrid.We also computed clusterings and approximate
average silhouette coefficient for k=1,…,100 for our input instances and discuss
the performance of our algorithm in detail.
author:
- first_name: Gereon
full_name: Frahling, Gereon
last_name: Frahling
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: 'Frahling G, Sohler C. A fast k-means implementation using coresets. In: Proceedings
of the Twenty-Second Annual Symposium on Computational Geometry - SCG ’06.
; 2006. doi:10.1145/1137856.1137879'
apa: Frahling, G., & Sohler, C. (2006). A fast k-means implementation using
coresets. In Proceedings of the twenty-second annual symposium on Computational
geometry - SCG ’06. https://doi.org/10.1145/1137856.1137879
bibtex: '@inproceedings{Frahling_Sohler_2006, title={A fast k-means implementation
using coresets}, DOI={10.1145/1137856.1137879},
booktitle={Proceedings of the twenty-second annual symposium on Computational
geometry - SCG ’06}, author={Frahling, Gereon and Sohler, Christian}, year={2006}
}'
chicago: Frahling, Gereon, and Christian Sohler. “A Fast K-Means Implementation
Using Coresets.” In Proceedings of the Twenty-Second Annual Symposium on Computational
Geometry - SCG ’06, 2006. https://doi.org/10.1145/1137856.1137879.
ieee: G. Frahling and C. Sohler, “A fast k-means implementation using coresets,”
in Proceedings of the twenty-second annual symposium on Computational geometry
- SCG ’06, 2006.
mla: Frahling, Gereon, and Christian Sohler. “A Fast K-Means Implementation Using
Coresets.” Proceedings of the Twenty-Second Annual Symposium on Computational
Geometry - SCG ’06, 2006, doi:10.1145/1137856.1137879.
short: 'G. Frahling, C. Sohler, in: Proceedings of the Twenty-Second Annual Symposium
on Computational Geometry - SCG ’06, 2006.'
date_created: 2021-09-07T13:03:31Z
date_updated: 2022-01-06T06:56:02Z
department:
- _id: '63'
doi: 10.1145/1137856.1137879
language:
- iso: eng
publication: Proceedings of the twenty-second annual symposium on Computational geometry -
SCG '06
publication_status: published
status: public
title: A fast k-means implementation using coresets
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '20436'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: Hamann H. Modeling and Investigation of Robot Swarms.; 2006.
apa: Hamann, H. (2006). Modeling and Investigation of Robot Swarms.
bibtex: '@book{Hamann_2006, title={Modeling and Investigation of Robot Swarms},
author={Hamann, Heiko}, year={2006} }'
chicago: Hamann, Heiko. Modeling and Investigation of Robot Swarms, 2006.
ieee: H. Hamann, Modeling and Investigation of Robot Swarms. 2006.
mla: Hamann, Heiko. Modeling and Investigation of Robot Swarms. 2006.
short: H. Hamann, Modeling and Investigation of Robot Swarms, 2006.
date_created: 2020-11-19T12:18:36Z
date_updated: 2022-01-06T06:54:27Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
status: public
title: Modeling and Investigation of Robot Swarms
type: mastersthesis
user_id: '15415'
year: '2006'
...
---
_id: '17979'
author:
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Schindelhauer C, Volbert K, Ziegler M. Geometric spanners with applications
in wireless networks. Computational Geometry. 2006:197-214. doi:10.1016/j.comgeo.2006.02.001
apa: Schindelhauer, C., Volbert, K., & Ziegler, M. (2006). Geometric spanners
with applications in wireless networks. Computational Geometry, 197–214.
https://doi.org/10.1016/j.comgeo.2006.02.001
bibtex: '@article{Schindelhauer_Volbert_Ziegler_2006, title={Geometric spanners
with applications in wireless networks}, DOI={10.1016/j.comgeo.2006.02.001},
journal={Computational Geometry}, author={Schindelhauer, Christian and Volbert,
Klaus and Ziegler, Martin}, year={2006}, pages={197–214} }'
chicago: Schindelhauer, Christian, Klaus Volbert, and Martin Ziegler. “Geometric
Spanners with Applications in Wireless Networks.” Computational Geometry,
2006, 197–214. https://doi.org/10.1016/j.comgeo.2006.02.001.
ieee: C. Schindelhauer, K. Volbert, and M. Ziegler, “Geometric spanners with applications
in wireless networks,” Computational Geometry, pp. 197–214, 2006.
mla: Schindelhauer, Christian, et al. “Geometric Spanners with Applications in Wireless
Networks.” Computational Geometry, 2006, pp. 197–214, doi:10.1016/j.comgeo.2006.02.001.
short: C. Schindelhauer, K. Volbert, M. Ziegler, Computational Geometry (2006) 197–214.
date_created: 2020-08-14T13:26:24Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1016/j.comgeo.2006.02.001
language:
- iso: eng
page: 197-214
publication: Computational Geometry
publication_identifier:
issn:
- 0925-7721
publication_status: published
status: public
title: Geometric spanners with applications in wireless networks
type: journal_article
user_id: '15415'
year: '2006'
...
---
_id: '17985'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Ziegler M. Effectively open real functions. Journal of Complexity. 2006:827-849.
doi:10.1016/j.jco.2006.05.002
apa: Ziegler, M. (2006). Effectively open real functions. Journal of Complexity,
827–849. https://doi.org/10.1016/j.jco.2006.05.002
bibtex: '@article{Ziegler_2006, title={Effectively open real functions}, DOI={10.1016/j.jco.2006.05.002},
journal={Journal of Complexity}, author={Ziegler, Martin}, year={2006}, pages={827–849}
}'
chicago: Ziegler, Martin. “Effectively Open Real Functions.” Journal of Complexity,
2006, 827–49. https://doi.org/10.1016/j.jco.2006.05.002.
ieee: M. Ziegler, “Effectively open real functions,” Journal of Complexity,
pp. 827–849, 2006.
mla: Ziegler, Martin. “Effectively Open Real Functions.” Journal of Complexity,
2006, pp. 827–49, doi:10.1016/j.jco.2006.05.002.
short: M. Ziegler, Journal of Complexity (2006) 827–849.
date_created: 2020-08-14T13:40:13Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1016/j.jco.2006.05.002
language:
- iso: eng
page: 827-849
publication: Journal of Complexity
publication_identifier:
issn:
- 0885-064X
publication_status: published
status: public
title: Effectively open real functions
type: journal_article
user_id: '15415'
year: '2006'
...
---
_id: '17987'
author:
- first_name: Klaus
full_name: Meer, Klaus
last_name: Meer
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Meer K, Ziegler M. Uncomputability Below the Real Halting Problem. In: Logical
Approaches to Computational Barriers. Berlin, Heidelberg; 2006. doi:10.1007/11780342_39'
apa: Meer, K., & Ziegler, M. (2006). Uncomputability Below the Real Halting
Problem. In Logical Approaches to Computational Barriers. Berlin, Heidelberg.
https://doi.org/10.1007/11780342_39
bibtex: '@inbook{Meer_Ziegler_2006, place={Berlin, Heidelberg}, title={Uncomputability
Below the Real Halting Problem}, DOI={10.1007/11780342_39},
booktitle={Logical Approaches to Computational Barriers}, author={Meer, Klaus
and Ziegler, Martin}, year={2006} }'
chicago: Meer, Klaus, and Martin Ziegler. “Uncomputability Below the Real Halting
Problem.” In Logical Approaches to Computational Barriers. Berlin, Heidelberg,
2006. https://doi.org/10.1007/11780342_39.
ieee: K. Meer and M. Ziegler, “Uncomputability Below the Real Halting Problem,”
in Logical Approaches to Computational Barriers, Berlin, Heidelberg, 2006.
mla: Meer, Klaus, and Martin Ziegler. “Uncomputability Below the Real Halting Problem.”
Logical Approaches to Computational Barriers, 2006, doi:10.1007/11780342_39.
short: 'K. Meer, M. Ziegler, in: Logical Approaches to Computational Barriers, Berlin,
Heidelberg, 2006.'
date_created: 2020-08-14T13:43:09Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1007/11780342_39
language:
- iso: eng
place: Berlin, Heidelberg
publication: Logical Approaches to Computational Barriers
publication_identifier:
isbn:
- '9783540354666'
- '9783540354680'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Uncomputability Below the Real Halting Problem
type: book_chapter
user_id: '15415'
year: '2006'
...
---
_id: '18351'
abstract:
- lang: eng
text: In this paper the ideas of a new research project are presented. The material
flow simu- lator d3FACT insight shall manage multiple parallel and time synchronous
simulations to grand the power of real-time visualization in combination with
statistical analysis. This research is issued to overcome the conflict of simulation
run repetition for a good statistical basis and real-time immersive visualization.
A side effect will be the reduc- tion of time needed for simulation experiments.
The planned simulation tool has the feature of triggered cloning, i.e., the user
can decide during runtime to clone a set of simulations after changing parameters
to preserve the original system. The simulations will be aggregated by visualization
and statistics. The rendering is planned to overlay several simulations using
effects like inking and transparency. Simulation data will be aggregated with
statistical functions and diagrams.
author:
- first_name: 'Wilhelm '
full_name: 'Dangelmaier, Wilhelm '
last_name: Dangelmaier
- first_name: 'Daniel '
full_name: 'Huber, Daniel '
last_name: Huber
- first_name: 'Christoph '
full_name: 'Laroque, Christoph '
last_name: Laroque
- first_name: Mark
full_name: Aufenanger, Mark
last_name: Aufenanger
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Jens
full_name: Krokowski, Jens
last_name: Krokowski
- first_name: Michael
full_name: Kortenjan, Michael
last_name: Kortenjan
citation:
ama: 'Dangelmaier W, Huber D, Laroque C, et al. d3FACT insight goes parallel
- Aggregation of multiple simulations. In: Simulation and Visualization 2006
(SimViS). SCS European Publishing House; 2006:79-88.'
apa: Dangelmaier, W., Huber, D., Laroque, C., Aufenanger, M., Fischer, M., Krokowski,
J., & Kortenjan, M. (2006). d3FACT insight goes parallel - Aggregation
of multiple simulations. In Simulation and Visualization 2006 (SimViS)
(pp. 79–88). SCS European Publishing House.
bibtex: '@inproceedings{Dangelmaier_Huber_Laroque_Aufenanger_Fischer_Krokowski_Kortenjan_2006,
title={d3FACT insight goes parallel - Aggregation of multiple simulations},
booktitle={Simulation and Visualization 2006 (SimViS)}, publisher={SCS European
Publishing House}, author={Dangelmaier, Wilhelm and Huber, Daniel and Laroque,
Christoph and Aufenanger, Mark and Fischer, Matthias and Krokowski, Jens and
Kortenjan, Michael}, year={2006}, pages={79–88} }'
chicago: Dangelmaier, Wilhelm , Daniel Huber, Christoph Laroque, Mark Aufenanger,
Matthias Fischer, Jens Krokowski, and Michael Kortenjan. “D3FACT Insight
Goes Parallel - Aggregation of Multiple Simulations.” In Simulation and Visualization
2006 (SimViS), 79–88. SCS European Publishing House, 2006.
ieee: W. Dangelmaier et al., “d3FACT insight goes parallel - Aggregation
of multiple simulations,” in Simulation and Visualization 2006 (SimViS),
2006, pp. 79–88.
mla: Dangelmaier, Wilhelm, et al. “D3FACT Insight Goes Parallel - Aggregation
of Multiple Simulations.” Simulation and Visualization 2006 (SimViS), SCS
European Publishing House, 2006, pp. 79–88.
short: 'W. Dangelmaier, D. Huber, C. Laroque, M. Aufenanger, M. Fischer, J. Krokowski,
M. Kortenjan, in: Simulation and Visualization 2006 (SimViS), SCS European Publishing
House, 2006, pp. 79–88.'
date_created: 2020-08-26T09:48:35Z
date_updated: 2022-01-06T06:53:29Z
department:
- _id: '63'
language:
- iso: eng
page: 79-88
publication: Simulation and Visualization 2006 (SimViS)
publisher: SCS European Publishing House
status: public
title: d³FACT insight goes parallel - Aggregation of multiple simulations
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '18672'
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
citation:
ama: Sohler C, Czumaj A. Sublinear-time Algorithms. EATCS Bulletin. 2006;(89):23--47.
apa: Sohler, C., & Czumaj, A. (2006). Sublinear-time Algorithms. EATCS Bulletin,
(89), 23--47.
bibtex: '@article{Sohler_Czumaj_2006, title={Sublinear-time Algorithms}, number={89},
journal={EATCS Bulletin}, author={Sohler, Christian and Czumaj, Artur}, year={2006},
pages={23--47} }'
chicago: 'Sohler, Christian, and Artur Czumaj. “Sublinear-Time Algorithms.” EATCS
Bulletin, no. 89 (2006): 23--47.'
ieee: C. Sohler and A. Czumaj, “Sublinear-time Algorithms,” EATCS Bulletin,
no. 89, pp. 23--47, 2006.
mla: Sohler, Christian, and Artur Czumaj. “Sublinear-Time Algorithms.” EATCS
Bulletin, no. 89, 2006, pp. 23--47.
short: C. Sohler, A. Czumaj, EATCS Bulletin (2006) 23--47.
date_created: 2020-08-31T08:18:02Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
issue: '89'
language:
- iso: eng
page: 23--47
publication: EATCS Bulletin
status: public
title: Sublinear-time Algorithms
type: journal_article
user_id: '15415'
year: '2006'
...
---
_id: '16462'
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Bettina
full_name: Rehberg, Bettina
last_name: Rehberg
citation:
ama: 'Bonorden O, Gehweiler J, Meyer auf der Heide F, Rehberg B. Efficient Parallel
Algorithms. In: Proceedings of 6th International Heinz Nixdorf Symposium: New
Trends in Parallel & Distributed Computing. Vol 181. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn; 2006:137-153.'
apa: 'Bonorden, O., Gehweiler, J., Meyer auf der Heide, F., & Rehberg, B. (2006).
Efficient Parallel Algorithms. Proceedings of 6th International Heinz Nixdorf
Symposium: New Trends in Parallel & Distributed Computing, 181,
137–153.'
bibtex: '@inproceedings{Bonorden_Gehweiler_Meyer auf der Heide_Rehberg_2006, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, title={Efficient Parallel Algorithms},
volume={181}, booktitle={Proceedings of 6th International Heinz Nixdorf Symposium:
New Trends in Parallel & Distributed Computing}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Bonorden, Olaf and Gehweiler,
Joachim and Meyer auf der Heide, Friedhelm and Rehberg, Bettina}, year={2006},
pages={137–153}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: 'Bonorden, Olaf, Joachim Gehweiler, Friedhelm Meyer auf der Heide, and
Bettina Rehberg. “Efficient Parallel Algorithms.” In Proceedings of 6th International
Heinz Nixdorf Symposium: New Trends in Parallel & Distributed Computing,
181:137–53. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2006.'
ieee: 'O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, and B. Rehberg, “Efficient
Parallel Algorithms,” in Proceedings of 6th International Heinz Nixdorf Symposium:
New Trends in Parallel & Distributed Computing, 2006, vol. 181, pp. 137–153.'
mla: 'Bonorden, Olaf, et al. “Efficient Parallel Algorithms.” Proceedings of
6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed
Computing, vol. 181, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2006, pp. 137–53.'
short: 'O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, B. Rehberg, in: Proceedings
of 6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed
Computing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006,
pp. 137–153.'
date_created: 2020-04-08T07:54:09Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 181'
language:
- iso: eng
page: 137-153
publication: 'Proceedings of 6th International Heinz Nixdorf Symposium: New Trends
in Parallel & Distributed Computing'
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Efficient Parallel Algorithms
type: conference
user_id: '5786'
volume: 181
year: '2006'
...
---
_id: '16472'
author:
- first_name: Erik D.
full_name: Demaine, Erik D.
last_name: Demaine
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Rasmus
full_name: Pagh, Rasmus
last_name: Pagh
- first_name: Mihai
full_name: Pǎtraşcu, Mihai
last_name: Pǎtraşcu
citation:
ama: 'Demaine ED, Meyer auf der Heide F, Pagh R, Pǎtraşcu M. De Dictionariis Dynamicis
Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space). In:
LATIN 2006: Theoretical Informatics. Berlin, Heidelberg; 2006. doi:10.1007/11682462_34'
apa: 'Demaine, E. D., Meyer auf der Heide, F., Pagh, R., & Pǎtraşcu, M. (2006).
De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries
Using Little Space). In LATIN 2006: Theoretical Informatics. Berlin, Heidelberg.
https://doi.org/10.1007/11682462_34'
bibtex: '@inbook{Demaine_Meyer auf der Heide_Pagh_Pǎtraşcu_2006, place={Berlin,
Heidelberg}, title={De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On
Dynamic Dictionaries Using Little Space)}, DOI={10.1007/11682462_34},
booktitle={LATIN 2006: Theoretical Informatics}, author={Demaine, Erik D. and
Meyer auf der Heide, Friedhelm and Pagh, Rasmus and Pǎtraşcu, Mihai}, year={2006}
}'
chicago: 'Demaine, Erik D., Friedhelm Meyer auf der Heide, Rasmus Pagh, and Mihai
Pǎtraşcu. “De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic
Dictionaries Using Little Space).” In LATIN 2006: Theoretical Informatics.
Berlin, Heidelberg, 2006. https://doi.org/10.1007/11682462_34.'
ieee: 'E. D. Demaine, F. Meyer auf der Heide, R. Pagh, and M. Pǎtraşcu, “De Dictionariis
Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little
Space),” in LATIN 2006: Theoretical Informatics, Berlin, Heidelberg, 2006.'
mla: 'Demaine, Erik D., et al. “De Dictionariis Dynamicis Pauco Spatio Utentibus
({lat.} On Dynamic Dictionaries Using Little Space).” LATIN 2006: Theoretical
Informatics, 2006, doi:10.1007/11682462_34.'
short: 'E.D. Demaine, F. Meyer auf der Heide, R. Pagh, M. Pǎtraşcu, in: LATIN 2006:
Theoretical Informatics, Berlin, Heidelberg, 2006.'
date_created: 2020-04-08T09:36:10Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/11682462_34
language:
- iso: eng
place: Berlin, Heidelberg
publication: 'LATIN 2006: Theoretical Informatics'
publication_identifier:
isbn:
- '9783540327554'
- '9783540327561'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries
Using Little Space)
type: book_chapter
user_id: '15415'
year: '2006'
...
---
_id: '16473'
author:
- first_name: M.
full_name: Dynia, M.
last_name: Dynia
- first_name: J.
full_name: Kutyłowski, J.
last_name: Kutyłowski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Dynia M, Kutyłowski J, Meyer auf der Heide F, Schindelhauer C. Smart Robot
Teams Exploring Sparse Trees. In: Lecture Notes in Computer Science. Berlin,
Heidelberg; 2006. doi:10.1007/11821069_29'
apa: Dynia, M., Kutyłowski, J., Meyer auf der Heide, F., & Schindelhauer, C.
(2006). Smart Robot Teams Exploring Sparse Trees. In Lecture Notes in Computer
Science. Berlin, Heidelberg. https://doi.org/10.1007/11821069_29
bibtex: '@inbook{Dynia_Kutyłowski_Meyer auf der Heide_Schindelhauer_2006, place={Berlin,
Heidelberg}, title={Smart Robot Teams Exploring Sparse Trees}, DOI={10.1007/11821069_29},
booktitle={Lecture Notes in Computer Science}, author={Dynia, M. and Kutyłowski,
J. and Meyer auf der Heide, Friedhelm and Schindelhauer, Christian}, year={2006}
}'
chicago: Dynia, M., J. Kutyłowski, Friedhelm Meyer auf der Heide, and Christian
Schindelhauer. “Smart Robot Teams Exploring Sparse Trees.” In Lecture Notes
in Computer Science. Berlin, Heidelberg, 2006. https://doi.org/10.1007/11821069_29.
ieee: M. Dynia, J. Kutyłowski, F. Meyer auf der Heide, and C. Schindelhauer, “Smart
Robot Teams Exploring Sparse Trees,” in Lecture Notes in Computer Science,
Berlin, Heidelberg, 2006.
mla: Dynia, M., et al. “Smart Robot Teams Exploring Sparse Trees.” Lecture Notes
in Computer Science, 2006, doi:10.1007/11821069_29.
short: 'M. Dynia, J. Kutyłowski, F. Meyer auf der Heide, C. Schindelhauer, in: Lecture
Notes in Computer Science, Berlin, Heidelberg, 2006.'
date_created: 2020-04-08T09:38:28Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/11821069_29
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540377917'
- '9783540377931'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Smart Robot Teams Exploring Sparse Trees
type: book_chapter
user_id: '15415'
year: '2006'
...
---
_id: '16476'
author:
- first_name: Miroslaw
full_name: Dynia, Miroslaw
last_name: Dynia
- first_name: Jarosław
full_name: Kutyłowski, Jarosław
last_name: Kutyłowski
- first_name: Paweł
full_name: Lorek, Paweł
last_name: Lorek
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Dynia M, Kutyłowski J, Lorek P, Meyer auf der Heide F. Maintaining Communication
Between an Explorer and a Base Station. In: IFIP International Federation for
Information Processing. Boston, MA; 2006. doi:10.1007/978-0-387-34733-2_14'
apa: Dynia, M., Kutyłowski, J., Lorek, P., & Meyer auf der Heide, F. (2006).
Maintaining Communication Between an Explorer and a Base Station. In IFIP International
Federation for Information Processing. Boston, MA. https://doi.org/10.1007/978-0-387-34733-2_14
bibtex: '@inbook{Dynia_Kutyłowski_Lorek_Meyer auf der Heide_2006, place={Boston,
MA}, title={Maintaining Communication Between an Explorer and a Base Station},
DOI={10.1007/978-0-387-34733-2_14},
booktitle={IFIP International Federation for Information Processing}, author={Dynia,
Miroslaw and Kutyłowski, Jarosław and Lorek, Paweł and Meyer auf der Heide, Friedhelm},
year={2006} }'
chicago: Dynia, Miroslaw, Jarosław Kutyłowski, Paweł Lorek, and Friedhelm Meyer
auf der Heide. “Maintaining Communication Between an Explorer and a Base Station.”
In IFIP International Federation for Information Processing. Boston, MA,
2006. https://doi.org/10.1007/978-0-387-34733-2_14.
ieee: M. Dynia, J. Kutyłowski, P. Lorek, and F. Meyer auf der Heide, “Maintaining
Communication Between an Explorer and a Base Station,” in IFIP International
Federation for Information Processing, Boston, MA, 2006.
mla: Dynia, Miroslaw, et al. “Maintaining Communication Between an Explorer and
a Base Station.” IFIP International Federation for Information Processing,
2006, doi:10.1007/978-0-387-34733-2_14.
short: 'M. Dynia, J. Kutyłowski, P. Lorek, F. Meyer auf der Heide, in: IFIP International
Federation for Information Processing, Boston, MA, 2006.'
date_created: 2020-04-08T11:13:52Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-0-387-34733-2_14
language:
- iso: eng
place: Boston, MA
publication: IFIP International Federation for Information Processing
publication_identifier:
isbn:
- '9780387346328'
- '9780387347332'
issn:
- 1571-5736
publication_status: published
status: public
title: Maintaining Communication Between an Explorer and a Base Station
type: book_chapter
user_id: '15415'
year: '2006'
...
---
_id: '17011'
author:
- first_name: Miroslaw
full_name: Dynia, Miroslaw
last_name: Dynia
- first_name: Andreas
full_name: Kuhmlehn, Andreas
last_name: Kuhmlehn
- first_name: Jaroslaw
full_name: Kutylowski, Jaroslaw
last_name: Kutylowski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: Dynia M, Kuhmlehn A, Kutylowski J, Meyer auf der Heide F, Schindelhauer C.
SmartS Simulator Design.; 2006.
apa: Dynia, M., Kuhmlehn, A., Kutylowski, J., Meyer auf der Heide, F., & Schindelhauer,
C. (2006). SmartS Simulator Design.
bibtex: '@book{Dynia_Kuhmlehn_Kutylowski_Meyer auf der Heide_Schindelhauer_2006,
title={SmartS Simulator Design}, author={Dynia, Miroslaw and Kuhmlehn, Andreas
and Kutylowski, Jaroslaw and Meyer auf der Heide, Friedhelm and Schindelhauer,
Christian}, year={2006} }'
chicago: Dynia, Miroslaw, Andreas Kuhmlehn, Jaroslaw Kutylowski, Friedhelm Meyer
auf der Heide, and Christian Schindelhauer. SmartS Simulator Design, 2006.
ieee: M. Dynia, A. Kuhmlehn, J. Kutylowski, F. Meyer auf der Heide, and C. Schindelhauer,
SmartS Simulator Design. 2006.
mla: Dynia, Miroslaw, et al. SmartS Simulator Design. 2006.
short: M. Dynia, A. Kuhmlehn, J. Kutylowski, F. Meyer auf der Heide, C. Schindelhauer,
SmartS Simulator Design, 2006.
date_created: 2020-05-18T13:52:43Z
date_updated: 2022-01-06T06:53:02Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-05T10:06:52Z
date_updated: 2020-08-05T10:06:52Z
file_id: '17620'
file_name: smarts-design.pdf
file_size: 147312
relation: main_file
success: 1
file_date_updated: 2020-08-05T10:06:52Z
has_accepted_license: '1'
language:
- iso: eng
publication_status: published
status: public
title: SmartS Simulator Design
type: report
user_id: '15415'
year: '2006'
...
---
_id: '19611'
author:
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
citation:
ama: Volbert K. Geometric Spanners for Topology Control in Wireless Networks.
Vol 168. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2005.
apa: Volbert, K. (2005). Geometric Spanners for Topology Control in Wireless
Networks (Vol. 168). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Volbert_2005, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Geometric Spanners for Topology Control in Wireless Networks},
volume={168}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn},
author={Volbert, Klaus}, year={2005}, collection={Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn} }'
chicago: Volbert, Klaus. Geometric Spanners for Topology Control in Wireless
Networks. Vol. 168. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.
ieee: K. Volbert, Geometric Spanners for Topology Control in Wireless Networks,
vol. 168. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.
mla: Volbert, Klaus. Geometric Spanners for Topology Control in Wireless Networks.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.
short: K. Volbert, Geometric Spanners for Topology Control in Wireless Networks,
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.
date_created: 2020-09-22T07:40:37Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 168'
language:
- iso: eng
publication_identifier:
isbn:
- 3-935433-77-8
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20050101556
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Geometric Spanners for Topology Control in Wireless Networks
type: dissertation
user_id: '5786'
volume: 168
year: '2005'
...
---
_id: '19827'
abstract:
- lang: eng
text: "We present k-Flipper, a graph transformation algorithm that transforms regular
undirected graphs. Given a path of k+2 edges it interchanges the end vertices
of the path. By definition this operation preserves regularity and connectivity.
We show that every regular connected graph can be reached by a series of these
operations for all k ¡Ý 1. We use a randomized version, called Random k-Flipper,
in order to create random regular connected undirected graphs that may serve as
a backbone for peer-to-peer networks. We prove for degree d¡Ê ¦¸(log n) that a
series of O(dn) Random k-Flipper operations with k ∈ ¦¨(d2n2 log 1/¦Å) transforms
any graph into an expander graph with high probability, i.e. 1-n-¦¨(1).\r\n\r\nThe
Random 1-Flipper is symmetric, i.e. the transformation probability from any labeled
d-regular graph G to G' is equal to those from G'
to G. From this and the reachability property we conclude that in the limit
a series of Random 1-Flipper operations converges against an uniform probability
distribution over all connected labeled d-regular graphs. For degree d
∈ ω(1) growing with the graph size this implies that iteratively applying Random
1-Flipper transforms any given graph into an expander asymptotically almost surely.\r\n\r\nWe
use these operations as a maintenance operation for a peer-to-peer network based
on random regular connected graphs that provides high robustness and recovers
from degenerate network structures by continuously applying these random graph
transformations. For this, we describe how network operations for joining and
leaving the network can be designed and how the concurrency of the graph transformations
can be handled."
author:
- first_name: Peter
full_name: Mahlmann, Peter
last_name: Mahlmann
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Mahlmann P, Schindelhauer C. Peer-to-peer networks based on random transformations
of connected regular undirected graphs. In: Proceedings of the 17th Annual
ACM Symposium on Parallelism in Algorithms and Architectures - SPAA’05. ;
2005. doi:10.1145/1073970.1073992'
apa: Mahlmann, P., & Schindelhauer, C. (2005). Peer-to-peer networks based on
random transformations of connected regular undirected graphs. In Proceedings
of the 17th annual ACM symposium on Parallelism in algorithms and architectures
- SPAA’05. https://doi.org/10.1145/1073970.1073992
bibtex: '@inproceedings{Mahlmann_Schindelhauer_2005, title={Peer-to-peer networks
based on random transformations of connected regular undirected graphs}, DOI={10.1145/1073970.1073992}, booktitle={Proceedings
of the 17th annual ACM symposium on Parallelism in algorithms and architectures
- SPAA’05}, author={Mahlmann, Peter and Schindelhauer, Christian}, year={2005}
}'
chicago: Mahlmann, Peter, and Christian Schindelhauer. “Peer-to-Peer Networks Based
on Random Transformations of Connected Regular Undirected Graphs.” In Proceedings
of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures
- SPAA’05, 2005. https://doi.org/10.1145/1073970.1073992.
ieee: P. Mahlmann and C. Schindelhauer, “Peer-to-peer networks based on random transformations
of connected regular undirected graphs,” in Proceedings of the 17th annual
ACM symposium on Parallelism in algorithms and architectures - SPAA’05, 2005.
mla: Mahlmann, Peter, and Christian Schindelhauer. “Peer-to-Peer Networks Based
on Random Transformations of Connected Regular Undirected Graphs.” Proceedings
of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures
- SPAA’05, 2005, doi:10.1145/1073970.1073992.
short: 'P. Mahlmann, C. Schindelhauer, in: Proceedings of the 17th Annual ACM Symposium
on Parallelism in Algorithms and Architectures - SPAA’05, 2005.'
date_created: 2020-10-01T09:50:59Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1145/1073970.1073992
language:
- iso: eng
publication: Proceedings of the 17th annual ACM symposium on Parallelism in algorithms
and architectures - SPAA'05
publication_identifier:
isbn:
- '1581139861'
publication_status: published
status: public
title: Peer-to-peer networks based on random transformations of connected regular
undirected graphs
type: conference
user_id: '15415'
year: '2005'
...
---
_id: '19834'
abstract:
- lang: eng
text: 'We present a strategy for organizing the communication in wireless ad hoc
networks based on a cell structure. We use the unit disk graph model and assume
positioning capabilities for all nodes. The cell structure is an abstract view
on the network and represents regions where nodes reside (node cells), regions
that can be used for the communication flow (link cells) and regions that cannot
be bridged due to the restricted transmission range (barrier cells). Each node
can establish a cell classification of its neighborhood based on the position
data which is announced by all nodes.
The cell structure has two advantages
for applying position-based routing: It helps to determine local minima for greedy
forwarding and improves recovery from such minima, because for recovery all edges
can be used in contrast to other topology-based rules that can be appliedonly
on a planar subgraph.
For the analysis of position-based routing algorithms
the measures time and traffic are based on the cell structure. The difficulty
of exploring the network is expressed by the size of the barriers (i.e. the number
of cells in the perimeters). Exploration can be done in parallel, but with increasing
traffic. We propose a comparative measure to assess both time and traffic, the
combined comparative ratio, which is the maximum of the ratio of routing time
and optimal time and the ratio of the traffic and the minimum exploration costs.
While flooding and common single-path strategies have a linear ratio, we present
a simple algorithm that has a sub-linear
combined comparative ratio of O(sqrt(h)),
where h is the minimal hop distance between source and target.'
author:
- first_name: Stefan
full_name: Rührup, Stefan
last_name: Rührup
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Rührup S, Schindelhauer C. Competitive Time and Traffic Analysis of Position-Based
Routing using a Cell Structure. In: 19th IEEE International Parallel and Distributed
Processing Symposium. ; 2005:248. doi:10.1109/ipdps.2005.147'
apa: Rührup, S., & Schindelhauer, C. (2005). Competitive Time and Traffic Analysis
of Position-Based Routing using a Cell Structure. 19th IEEE International Parallel
and Distributed Processing Symposium, 248. https://doi.org/10.1109/ipdps.2005.147
bibtex: '@inproceedings{Rührup_Schindelhauer_2005, title={Competitive Time and Traffic
Analysis of Position-Based Routing using a Cell Structure}, DOI={10.1109/ipdps.2005.147},
booktitle={19th IEEE International Parallel and Distributed Processing Symposium},
author={Rührup, Stefan and Schindelhauer, Christian}, year={2005}, pages={248}
}'
chicago: Rührup, Stefan, and Christian Schindelhauer. “Competitive Time and Traffic
Analysis of Position-Based Routing Using a Cell Structure.” In 19th IEEE International
Parallel and Distributed Processing Symposium, 248, 2005. https://doi.org/10.1109/ipdps.2005.147.
ieee: 'S. Rührup and C. Schindelhauer, “Competitive Time and Traffic Analysis of
Position-Based Routing using a Cell Structure,” in 19th IEEE International
Parallel and Distributed Processing Symposium, 2005, p. 248, doi: 10.1109/ipdps.2005.147.'
mla: Rührup, Stefan, and Christian Schindelhauer. “Competitive Time and Traffic
Analysis of Position-Based Routing Using a Cell Structure.” 19th IEEE International
Parallel and Distributed Processing Symposium, 2005, p. 248, doi:10.1109/ipdps.2005.147.
short: 'S. Rührup, C. Schindelhauer, in: 19th IEEE International Parallel and Distributed
Processing Symposium, 2005, p. 248.'
date_created: 2020-10-01T11:27:14Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1109/ipdps.2005.147
language:
- iso: eng
page: '248'
publication: 19th IEEE International Parallel and Distributed Processing Symposium
publication_identifier:
isbn:
- '0769523129'
publication_status: published
status: public
title: Competitive Time and Traffic Analysis of Position-Based Routing using a Cell
Structure
type: conference
user_id: '15415'
year: '2005'
...
---
_id: '19835'
abstract:
- lang: eng
text: The Hierarchical Layer Graph (HL graph) is a promising network topology for
wireless networks with
variable transmission ranges. It was introduced and
analyzed by Meyer auf der Heide et al. 2004.
In this paper we present a distributed,
localized and resource-efficient algorithm for constructing this graph. The qualtiy
of the HL graph depends on the domination radius and the publication radius, which
affect the amount of interference in the network. These parameters also determine
whether the HL graph is a c-spanner, which implies an energy-efficient topology.
We investigate the performance on randomly distributed node sets and show that
the restrictions on these parameters derived from a worst case analysis are not
so tight using realistic settings.
Here, we present the results of our
extensive experimental evaluation, measuring congestion, dilation and energy.
Congestion includes the load that is induced by interfering edges. We distinguish
between congestion and realistic congestion where we also take the signal-to-interference
ratio into account.
Our experiments show that the HL graph contains energy-efficient
paths as well as paths with a few number of hops while preserving a low congestion.
author:
- first_name: Stefan
full_name: Rührup, Stefan
last_name: Rührup
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
citation:
ama: 'Rührup S, Schindelhauer C, Volbert K. Performance Analysis of the Hierarchical
Layer Graph for Wireless Networks. In: Proc. of 4th International Conference
on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005). Vol 3738. ; 2005:244-257.
doi:10.1007/11561354_21'
apa: Rührup, S., Schindelhauer, C., & Volbert, K. (2005). Performance Analysis
of the Hierarchical Layer Graph for Wireless Networks. In Proc. of 4th International
Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005) (Vol.
3738, pp. 244–257). https://doi.org/10.1007/11561354_21
bibtex: '@inproceedings{Rührup_Schindelhauer_Volbert_2005, title={Performance Analysis
of the Hierarchical Layer Graph for Wireless Networks}, volume={3738}, DOI={10.1007/11561354_21}, booktitle={Proc.
of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW
2005)}, author={Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus},
year={2005}, pages={244–257} }'
chicago: Rührup, Stefan, Christian Schindelhauer, and Klaus Volbert. “Performance
Analysis of the Hierarchical Layer Graph for Wireless Networks.” In Proc. of
4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW
2005), 3738:244–57, 2005. https://doi.org/10.1007/11561354_21.
ieee: S. Rührup, C. Schindelhauer, and K. Volbert, “Performance Analysis of the
Hierarchical Layer Graph for Wireless Networks,” in Proc. of 4th International
Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), 2005,
vol. 3738, pp. 244–257.
mla: Rührup, Stefan, et al. “Performance Analysis of the Hierarchical Layer Graph
for Wireless Networks.” Proc. of 4th International Conference on Ad-Hoc, Mobile
& Wireless Networks (ADHOC-NOW 2005), vol. 3738, 2005, pp. 244–57, doi:10.1007/11561354_21.
short: 'S. Rührup, C. Schindelhauer, K. Volbert, in: Proc. of 4th International
Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), 2005, pp.
244–257.'
date_created: 2020-10-01T11:31:14Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/11561354_21
intvolume: ' 3738'
language:
- iso: eng
page: 244-257
publication: Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks
(ADHOC-NOW 2005)
publication_identifier:
isbn:
- '9783540291329'
- '9783540320869'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Performance Analysis of the Hierarchical Layer Graph for Wireless Networks
type: conference
user_id: '15415'
volume: 3738
year: '2005'
...