---
_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'
...