---
_id: '18366'
author:
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
- first_name: Bengt
full_name: Mueck, Bengt
last_name: Mueck
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Kiran
full_name: Mahajan, Kiran
last_name: Mahajan
- first_name: Christoph
full_name: ' Laroque, Christoph'
last_name: ' Laroque'
citation:
ama: 'Dangelmaier W, Mueck B, Fischer M, Mahajan K, Laroque C. Methods to lead
the user to significant processes in a 3D material flow simulation. In: Simulation
in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005.
; 2005:267-270.'
apa: Dangelmaier, W., Mueck, B., Fischer, M., Mahajan, K., & Laroque, C. (2005).
Methods to lead the user to significant processes in a 3D material flow simulation.
In Simulation in wider Europe - 19th European Conference on Modelling and Simulation
ECMS 2005 (pp. 267–270).
bibtex: '@inproceedings{Dangelmaier_Mueck_Fischer_Mahajan_ Laroque_2005, title={Methods
to lead the user to significant processes in a 3D material flow simulation}, booktitle={Simulation
in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005},
author={Dangelmaier, Wilhelm and Mueck, Bengt and Fischer, Matthias and Mahajan,
Kiran and Laroque, Christoph}, year={2005}, pages={267–270} }'
chicago: Dangelmaier, Wilhelm, Bengt Mueck, Matthias Fischer, Kiran Mahajan, and
Christoph Laroque. “Methods to Lead the User to Significant Processes in a 3D
Material Flow Simulation.” In Simulation in Wider Europe - 19th European Conference
on Modelling and Simulation ECMS 2005, 267–70, 2005.
ieee: W. Dangelmaier, B. Mueck, M. Fischer, K. Mahajan, and C. Laroque, “Methods
to lead the user to significant processes in a 3D material flow simulation,” in
Simulation in wider Europe - 19th European Conference on Modelling and Simulation
ECMS 2005, 2005, pp. 267–270.
mla: Dangelmaier, Wilhelm, et al. “Methods to Lead the User to Significant Processes
in a 3D Material Flow Simulation.” Simulation in Wider Europe - 19th European
Conference on Modelling and Simulation ECMS 2005, 2005, pp. 267–70.
short: 'W. Dangelmaier, B. Mueck, M. Fischer, K. Mahajan, C. Laroque, in: Simulation
in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005,
2005, pp. 267–270.'
date_created: 2020-08-26T12:36:33Z
date_updated: 2022-01-06T06:53:30Z
department:
- _id: '63'
language:
- iso: eng
page: 267-270
publication: Simulation in wider Europe - 19th European Conference on Modelling and
Simulation ECMS 2005
status: public
title: Methods to lead the user to significant processes in a 3D material flow simulation
type: conference
user_id: '15415'
year: '2005'
...
---
_id: '18449'
author:
- first_name: Christoph
full_name: Loeser, Christoph
last_name: Loeser
- first_name: Isabell
full_name: Drüke, Isabell
last_name: Drüke
- first_name: Brigitte
full_name: Oesterdiekhoff, Brigitte
last_name: Oesterdiekhoff
citation:
ama: 'Loeser C, Drüke I, Oesterdiekhoff B. Glaschick, Rainer: Integrative Approach
of Web Services and Universal Plug and Play within an AV Scenario. In: IEEE
International Conference on Industrial Informatics (INDIN). ; 2005.'
apa: 'Loeser, C., Drüke, I., & Oesterdiekhoff, B. (2005). Glaschick, Rainer:
Integrative Approach of Web Services and Universal Plug and Play within an AV
Scenario. In IEEE International Conference on Industrial Informatics (INDIN).'
bibtex: '@inproceedings{Loeser_Drüke_Oesterdiekhoff_2005, title={ Glaschick, Rainer:
Integrative Approach of Web Services and Universal Plug and Play within an AV
Scenario}, booktitle={IEEE International Conference on Industrial Informatics
(INDIN)}, author={Loeser, Christoph and Drüke, Isabell and Oesterdiekhoff, Brigitte},
year={2005} }'
chicago: 'Loeser, Christoph, Isabell Drüke, and Brigitte Oesterdiekhoff. “ Glaschick,
Rainer: Integrative Approach of Web Services and Universal Plug and Play within
an AV Scenario.” In IEEE International Conference on Industrial Informatics
(INDIN), 2005.'
ieee: 'C. Loeser, I. Drüke, and B. Oesterdiekhoff, “ Glaschick, Rainer: Integrative
Approach of Web Services and Universal Plug and Play within an AV Scenario,” in
IEEE International Conference on Industrial Informatics (INDIN), 2005.'
mla: 'Loeser, Christoph, et al. “ Glaschick, Rainer: Integrative Approach of Web
Services and Universal Plug and Play within an AV Scenario.” IEEE International
Conference on Industrial Informatics (INDIN), 2005.'
short: 'C. Loeser, I. Drüke, B. Oesterdiekhoff, in: IEEE International Conference
on Industrial Informatics (INDIN), 2005.'
date_created: 2020-08-27T12:04:12Z
date_updated: 2022-01-06T06:53:32Z
department:
- _id: '63'
language:
- iso: eng
publication: IEEE International Conference on Industrial Informatics (INDIN)
status: public
title: ' Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug
and Play within an AV Scenario'
type: conference
user_id: '15415'
year: '2005'
...
---
_id: '18450'
author:
- first_name: Brigitte
full_name: Oesterdiekhoff, Brigitte
last_name: Oesterdiekhoff
citation:
ama: 'Oesterdiekhoff B. Glaschick, Rainer; Service Oriented Interface Design for
Embedded Devices. In: IEEE International Conference on Emerging Technologies
and Factory Automation (ETFA). ; 2005.'
apa: Oesterdiekhoff, B. (2005). Glaschick, Rainer; Service Oriented Interface Design
for Embedded Devices. In IEEE International Conference on Emerging Technologies
and Factory Automation (ETFA).
bibtex: '@inproceedings{Oesterdiekhoff_2005, title={Glaschick, Rainer; Service Oriented
Interface Design for Embedded Devices}, booktitle={IEEE International Conference
on Emerging Technologies and Factory Automation (ETFA)}, author={Oesterdiekhoff,
Brigitte}, year={2005} }'
chicago: Oesterdiekhoff, Brigitte. “Glaschick, Rainer; Service Oriented Interface
Design for Embedded Devices.” In IEEE International Conference on Emerging
Technologies and Factory Automation (ETFA), 2005.
ieee: B. Oesterdiekhoff, “Glaschick, Rainer; Service Oriented Interface Design for
Embedded Devices,” in IEEE International Conference on Emerging Technologies
and Factory Automation (ETFA), 2005.
mla: Oesterdiekhoff, Brigitte. “Glaschick, Rainer; Service Oriented Interface Design
for Embedded Devices.” IEEE International Conference on Emerging Technologies
and Factory Automation (ETFA), 2005.
short: 'B. Oesterdiekhoff, in: IEEE International Conference on Emerging Technologies
and Factory Automation (ETFA), 2005.'
date_created: 2020-08-27T12:06:59Z
date_updated: 2022-01-06T06:53:32Z
department:
- _id: '63'
language:
- iso: eng
publication: IEEE International Conference on Emerging Technologies and Factory Automation
(ETFA)
status: public
title: Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices
type: conference
user_id: '15415'
year: '2005'
...
---
_id: '16468'
author:
- first_name: Marcin
full_name: Bienkowski, Marcin
last_name: Bienkowski
- first_name: Miroslaw
full_name: Korzeniowski, Miroslaw
last_name: Korzeniowski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Bienkowski M, Korzeniowski M, Meyer auf der Heide F. Dynamic Load Balancing
in Distributed Hash Tables. In: Peer-to-Peer Systems IV. Berlin, Heidelberg;
2005. doi:10.1007/11558989_20'
apa: Bienkowski, M., Korzeniowski, M., & Meyer auf der Heide, F. (2005). Dynamic
Load Balancing in Distributed Hash Tables. In Peer-to-Peer Systems IV.
Berlin, Heidelberg. https://doi.org/10.1007/11558989_20
bibtex: '@inbook{Bienkowski_Korzeniowski_Meyer auf der Heide_2005, place={Berlin,
Heidelberg}, title={Dynamic Load Balancing in Distributed Hash Tables}, DOI={10.1007/11558989_20}, booktitle={Peer-to-Peer
Systems IV}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw and Meyer auf
der Heide, Friedhelm}, year={2005} }'
chicago: Bienkowski, Marcin, Miroslaw Korzeniowski, and Friedhelm Meyer auf der
Heide. “Dynamic Load Balancing in Distributed Hash Tables.” In Peer-to-Peer
Systems IV. Berlin, Heidelberg, 2005. https://doi.org/10.1007/11558989_20.
ieee: M. Bienkowski, M. Korzeniowski, and F. Meyer auf der Heide, “Dynamic Load
Balancing in Distributed Hash Tables,” in Peer-to-Peer Systems IV, Berlin,
Heidelberg, 2005.
mla: Bienkowski, Marcin, et al. “Dynamic Load Balancing in Distributed Hash Tables.”
Peer-to-Peer Systems IV, 2005, doi:10.1007/11558989_20.
short: 'M. Bienkowski, M. Korzeniowski, F. Meyer auf der Heide, in: Peer-to-Peer
Systems IV, Berlin, Heidelberg, 2005.'
date_created: 2020-04-08T09:18:56Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/11558989_20
language:
- iso: eng
place: Berlin, Heidelberg
publication: Peer-to-Peer Systems IV
publication_identifier:
isbn:
- '9783540290681'
- '9783540319061'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Dynamic Load Balancing in Distributed Hash Tables
type: book_chapter
user_id: '15415'
year: '2005'
...
---
_id: '16469'
author:
- first_name: Marcin
full_name: Bienkowski, Marcin
last_name: Bienkowski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Bienkowski M, Meyer auf der Heide F. Page Migration in Dynamic Networks. In:
Mathematical Foundations of Computer Science 2005. Berlin, Heidelberg;
2005. doi:10.1007/11549345_1'
apa: Bienkowski, M., & Meyer auf der Heide, F. (2005). Page Migration in Dynamic
Networks. In Mathematical Foundations of Computer Science 2005. Berlin,
Heidelberg. https://doi.org/10.1007/11549345_1
bibtex: '@inbook{Bienkowski_Meyer auf der Heide_2005, place={Berlin, Heidelberg},
title={Page Migration in Dynamic Networks}, DOI={10.1007/11549345_1},
booktitle={Mathematical Foundations of Computer Science 2005}, author={Bienkowski,
Marcin and Meyer auf der Heide, Friedhelm}, year={2005} }'
chicago: Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration
in Dynamic Networks.” In Mathematical Foundations of Computer Science 2005.
Berlin, Heidelberg, 2005. https://doi.org/10.1007/11549345_1.
ieee: M. Bienkowski and F. Meyer auf der Heide, “Page Migration in Dynamic Networks,”
in Mathematical Foundations of Computer Science 2005, Berlin, Heidelberg,
2005.
mla: Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic
Networks.” Mathematical Foundations of Computer Science 2005, 2005, doi:10.1007/11549345_1.
short: 'M. Bienkowski, F. Meyer auf der Heide, in: Mathematical Foundations of Computer
Science 2005, Berlin, Heidelberg, 2005.'
date_created: 2020-04-08T09:23:36Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/11549345_1
language:
- iso: eng
place: Berlin, Heidelberg
publication: Mathematical Foundations of Computer Science 2005
publication_identifier:
isbn:
- '9783540287025'
- '9783540318675'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Page Migration in Dynamic Networks
type: book_chapter
user_id: '15415'
year: '2005'
...
---
_id: '16470'
abstract:
- lang: eng
text: "We present a web computing library (PUBWCL) in Java that allows to execute
strongly 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.\r\nPUBWCL is realized as a peer-to-peer system
and features migration and restoration of BSP processes executed on it.\r\nThe
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\n"
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
citation:
ama: 'Bonorden O, Gehweiler J, Meyer auf der Heide F. A Web Computing Environment
for Parallel Algorithms in Java. In: Proceeedings of 6th International Conference
on Parallel Processing and Applied Mathematics (PPAM). ; 2005:801-808. doi:10.1007/11752578_96'
apa: Bonorden, O., Gehweiler, J., & Meyer auf der Heide, F. (2005). A Web Computing
Environment for Parallel Algorithms in Java. In Proceeedings of 6th International
Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 801–808).
https://doi.org/10.1007/11752578_96
bibtex: '@inproceedings{Bonorden_Gehweiler_Meyer auf der Heide_2005, title={A Web
Computing Environment for Parallel Algorithms in Java}, DOI={10.1007/11752578_96},
booktitle={Proceeedings of 6th International Conference on Parallel Processing
and Applied Mathematics (PPAM)}, author={Bonorden, Olaf and Gehweiler, Joachim
and Meyer auf der Heide, Friedhelm}, year={2005}, pages={801–808} }'
chicago: Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “A
Web Computing Environment for Parallel Algorithms in Java.” In Proceeedings
of 6th International Conference on Parallel Processing and Applied Mathematics
(PPAM), 801–8, 2005. https://doi.org/10.1007/11752578_96.
ieee: O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “A Web Computing Environment
for Parallel Algorithms in Java,” in Proceeedings of 6th International Conference
on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 801–808.
mla: Bonorden, Olaf, et al. “A Web Computing Environment for Parallel Algorithms
in Java.” Proceeedings of 6th International Conference on Parallel Processing
and Applied Mathematics (PPAM), 2005, pp. 801–08, doi:10.1007/11752578_96.
short: 'O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, in: Proceeedings of 6th
International Conference on Parallel Processing and Applied Mathematics (PPAM),
2005, pp. 801–808.'
date_created: 2020-04-08T09:25:44Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/11752578_96
language:
- iso: eng
page: 801-808
publication: Proceeedings of 6th International Conference on Parallel Processing and
Applied Mathematics (PPAM)
publication_identifier:
isbn:
- '9783540341413'
- '9783540341420'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: A Web Computing Environment for Parallel Algorithms in Java
type: conference
user_id: '15415'
year: '2005'
...
---
_id: '16471'
abstract:
- lang: eng
text: "We compare different load balancing strategies for Bulk-Synchronous Parallel
(BSP) programs in a web computing environment. In order to handle the influence
of the fluctuating available computation power, we classify the external work
load.\r\n\r\nWe evaluate the load balancing algorithms using our web computing
library for BSP programs in Java (PUBWCL). Thereby we simulated the external work
load in order to have repeatable testing conditions.\r\n\r\nWith the best performing
load balancing strategy we could save 39% of the execution time averaged and even
up to 50% in particular cases."
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
citation:
ama: 'Bonorden O, Gehweiler J, Meyer auf der Heide F. Load Balancing Strategies
in a Web Computing Environment. In: Proceeedings of 6th International Conference
on Parallel Processing and Applied Mathematics (PPAM). ; 2005:839-846. doi:10.1007/11752578_101'
apa: Bonorden, O., Gehweiler, J., & Meyer auf der Heide, F. (2005). Load Balancing
Strategies in a Web Computing Environment. In Proceeedings of 6th International
Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 839–846).
https://doi.org/10.1007/11752578_101
bibtex: '@inproceedings{Bonorden_Gehweiler_Meyer auf der Heide_2005, title={Load
Balancing Strategies in a Web Computing Environment}, DOI={10.1007/11752578_101},
booktitle={Proceeedings of 6th International Conference on Parallel Processing
and Applied Mathematics (PPAM)}, author={Bonorden, Olaf and Gehweiler, Joachim
and Meyer auf der Heide, Friedhelm}, year={2005}, pages={839–846} }'
chicago: Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “Load
Balancing Strategies in a Web Computing Environment.” In Proceeedings of 6th
International Conference on Parallel Processing and Applied Mathematics (PPAM),
839–46, 2005. https://doi.org/10.1007/11752578_101.
ieee: O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “Load Balancing Strategies
in a Web Computing Environment,” in Proceeedings of 6th International Conference
on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 839–846.
mla: Bonorden, Olaf, et al. “Load Balancing Strategies in a Web Computing Environment.”
Proceeedings of 6th International Conference on Parallel Processing and Applied
Mathematics (PPAM), 2005, pp. 839–46, doi:10.1007/11752578_101.
short: 'O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, in: Proceeedings of 6th
International Conference on Parallel Processing and Applied Mathematics (PPAM),
2005, pp. 839–846.'
date_created: 2020-04-08T09:30:12Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/11752578_101
language:
- iso: eng
page: 839-846
publication: Proceeedings of 6th International Conference on Parallel Processing and
Applied Mathematics (PPAM)
publication_identifier:
isbn:
- '9783540341413'
- '9783540341420'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Load Balancing Strategies in a Web Computing Environment
type: conference
user_id: '15415'
year: '2005'
...
---
_id: '17112'
author:
- first_name: Marcin
full_name: Bienkowski, Marcin
last_name: Bienkowski
- first_name: Valentina
full_name: Damerow, Valentina
last_name: Damerow
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: 'Bienkowski M, Damerow V, Meyer auf der Heide F, Sohler C. Average case complexity
of Voronoi diagrams of n sites from the unit cube. In: Proceedings of the 21st
European Workshop on Computational Geometry, Eindhoven, The Netherlands, March
9-11, 2005. Technische Universiteit Eindhoven; 2005.'
apa: Bienkowski, M., Damerow, V., Meyer auf der Heide, F., & Sohler, C. (2005).
Average case complexity of Voronoi diagrams of n sites from the unit cube. In
Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven,
The Netherlands, March 9-11, 2005. Technische Universiteit Eindhoven.
bibtex: '@inproceedings{Bienkowski_Damerow_Meyer auf der Heide_Sohler_2005, title={Average
case complexity of Voronoi diagrams of n sites from the unit cube}, booktitle={Proceedings
of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands,
March 9-11, 2005}, publisher={Technische Universiteit Eindhoven}, author={Bienkowski,
Marcin and Damerow, Valentina and Meyer auf der Heide, Friedhelm and Sohler, Christian},
year={2005} }'
chicago: Bienkowski, Marcin, Valentina Damerow, Friedhelm Meyer auf der Heide, and
Christian Sohler. “Average Case Complexity of Voronoi Diagrams of n Sites from
the Unit Cube.” In Proceedings of the 21st European Workshop on Computational
Geometry, Eindhoven, The Netherlands, March 9-11, 2005. Technische Universiteit
Eindhoven, 2005.
ieee: M. Bienkowski, V. Damerow, F. Meyer auf der Heide, and C. Sohler, “Average
case complexity of Voronoi diagrams of n sites from the unit cube,” in Proceedings
of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands,
March 9-11, 2005, 2005.
mla: Bienkowski, Marcin, et al. “Average Case Complexity of Voronoi Diagrams of
n Sites from the Unit Cube.” Proceedings of the 21st European Workshop on Computational
Geometry, Eindhoven, The Netherlands, March 9-11, 2005, Technische Universiteit
Eindhoven, 2005.
short: 'M. Bienkowski, V. Damerow, F. Meyer auf der Heide, C. Sohler, in: Proceedings
of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands,
March 9-11, 2005, Technische Universiteit Eindhoven, 2005.'
date_created: 2020-06-22T13:22:22Z
date_updated: 2022-01-06T06:53:05Z
department:
- _id: '63'
language:
- iso: eng
publication: Proceedings of the 21st European Workshop on Computational Geometry,
Eindhoven, The Netherlands, March 9-11, 2005
publisher: Technische Universiteit Eindhoven
related_material:
link:
- relation: confirmation
url: http://www.win.tue.nl/EWCG2005/Proceedings/43.pdf
status: public
title: Average case complexity of Voronoi diagrams of n sites from the unit cube
type: conference
user_id: '15415'
year: '2005'
...
---
_id: '17113'
citation:
ama: Leonardi S, Meyer auf der Heide F, Wagner D, eds. Abstracts Collection --
Algorithmic Aspects of Large and Complex Networks. Vol 05361.; 2005.
apa: Leonardi, S., Meyer auf der Heide, F., & Wagner, D. (Eds.). (2005). Abstracts
Collection -- Algorithmic Aspects of Large and Complex Networks (Vol. 05361).
Presented at the Dagstuhl Seminar Proceedings, Schloss Dagstuhl, Germany.
bibtex: '@book{Leonardi_Meyer auf der Heide_Wagner_2005, series={Dagstuhl Seminar
Proceedings}, title={Abstracts Collection -- Algorithmic Aspects of Large and
Complex Networks}, volume={05361}, year={2005}, collection={Dagstuhl Seminar Proceedings}
}'
chicago: Leonardi, Stefano, Friedhelm Meyer auf der Heide, and Dorothea Wagner,
eds. Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks.
Vol. 05361. Dagstuhl Seminar Proceedings, 2005.
ieee: S. Leonardi, F. Meyer auf der Heide, and D. Wagner, Eds., Abstracts Collection
-- Algorithmic Aspects of Large and Complex Networks, vol. 05361. 2005.
mla: Leonardi, Stefano, et al., editors. Abstracts Collection -- Algorithmic
Aspects of Large and Complex Networks. Vol. 05361, 2005.
short: S. Leonardi, F. Meyer auf der Heide, D. Wagner, eds., Abstracts Collection
-- Algorithmic Aspects of Large and Complex Networks, 2005.
conference:
end_date: 2005-09-09
location: Schloss Dagstuhl, Germany
name: Dagstuhl Seminar Proceedings
start_date: 2005-09-04
date_created: 2020-06-22T13:52:52Z
date_updated: 2022-01-06T06:53:05Z
department:
- _id: '63'
editor:
- first_name: Stefano
full_name: Leonardi, Stefano
last_name: Leonardi
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Dorothea
full_name: Wagner, Dorothea
last_name: Wagner
intvolume: ' 5361'
language:
- iso: eng
related_material:
link:
- relation: confirmation
url: https://drops.dagstuhl.de/opus/volltexte/2006/570/
series_title: Dagstuhl Seminar Proceedings
status: public
title: Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks
type: conference_editor
user_id: '15415'
volume: '05361'
year: '2005'
...
---
_id: '15058'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Ziegler M. Stability versus speed in a computable algebraic model. Theoretical
Computer Science. 2005:14-26. doi:10.1016/j.tcs.2005.09.053
apa: Ziegler, M. (2005). Stability versus speed in a computable algebraic model.
Theoretical Computer Science, 14–26. https://doi.org/10.1016/j.tcs.2005.09.053
bibtex: '@article{Ziegler_2005, title={Stability versus speed in a computable algebraic
model}, DOI={10.1016/j.tcs.2005.09.053},
journal={Theoretical Computer Science}, author={Ziegler, Martin}, year={2005},
pages={14–26} }'
chicago: Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.”
Theoretical Computer Science, 2005, 14–26. https://doi.org/10.1016/j.tcs.2005.09.053.
ieee: M. Ziegler, “Stability versus speed in a computable algebraic model,” Theoretical
Computer Science, pp. 14–26, 2005.
mla: Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.”
Theoretical Computer Science, 2005, pp. 14–26, doi:10.1016/j.tcs.2005.09.053.
short: M. Ziegler, Theoretical Computer Science (2005) 14–26.
date_created: 2019-11-20T13:22:22Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2005.09.053
language:
- iso: eng
page: 14-26
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
status: public
title: Stability versus speed in a computable algebraic model
type: journal_article
user_id: '15415'
year: '2005'
...
---
_id: '19616'
author:
- first_name: Kay
full_name: Salzwedel, Kay
last_name: Salzwedel
citation:
ama: Salzwedel K. Data Distribution Algorithms for Storage Networks. Vol
153. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2004.
apa: Salzwedel, K. (2004). Data Distribution Algorithms for Storage Networks
(Vol. 153). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Salzwedel_2004, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Data Distribution Algorithms for Storage Networks}, volume={153},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Salzwedel,
Kay}, year={2004}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Salzwedel, Kay. Data Distribution Algorithms for Storage Networks.
Vol. 153. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2004.
ieee: K. Salzwedel, Data Distribution Algorithms for Storage Networks, vol.
153. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2004.
mla: Salzwedel, Kay. Data Distribution Algorithms for Storage Networks. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2004.
short: K. Salzwedel, Data Distribution Algorithms for Storage Networks, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2004.
date_created: 2020-09-22T08:37:39Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '26'
- _id: '63'
intvolume: ' 153'
language:
- iso: eng
publication_identifier:
isbn:
- 3-935433-62-X
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-20040101385
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: Data Distribution Algorithms for Storage Networks
type: dissertation
user_id: '5786'
volume: 153
year: '2004'
...
---
_id: '19692'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Dimo
full_name: Brockhoff, Dimo
last_name: Brockhoff
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Matthias
full_name: Englert, Matthias
last_name: Englert
- first_name: Christian
full_name: Gunia, Christian
last_name: Gunia
- first_name: Oliver
full_name: Heering, Oliver
last_name: Heering
- first_name: Thomas
full_name: Jansen, Thomas
last_name: Jansen
- first_name: Michael
full_name: Leifhelm, Michael
last_name: Leifhelm
- first_name: Kai
full_name: Plociennik, Kai
last_name: Plociennik
- first_name: Heiko
full_name: Röglin, Heiko
last_name: Röglin
- first_name: Andrea
full_name: Schweer, Andrea
last_name: Schweer
- first_name: Dirk
full_name: Sudholt, Dirk
last_name: Sudholt
- first_name: Stefan
full_name: Tannenbaum, Stefan
last_name: Tannenbaum
- first_name: Ingo
full_name: Wegener, Ingo
last_name: Wegener
citation:
ama: 'Briest P, Brockhoff D, Degener B, et al. The Ising Model: Simple Evolutionary
Algorithms as Adaptation Schemes. In: Parallel Problem Solving from Nature
- PPSN VIII. Berlin, Heidelberg; 2004. doi:10.1007/978-3-540-30217-9_4'
apa: 'Briest, P., Brockhoff, D., Degener, B., Englert, M., Gunia, C., Heering, O.,
… Wegener, I. (2004). The Ising Model: Simple Evolutionary Algorithms as Adaptation
Schemes. In Parallel Problem Solving from Nature - PPSN VIII. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-540-30217-9_4'
bibtex: '@inproceedings{Briest_Brockhoff_Degener_Englert_Gunia_Heering_Jansen_Leifhelm_Plociennik_Röglin_et
al._2004, place={Berlin, Heidelberg}, title={The Ising Model: Simple Evolutionary
Algorithms as Adaptation Schemes}, DOI={10.1007/978-3-540-30217-9_4},
booktitle={Parallel Problem Solving from Nature - PPSN VIII}, author={Briest,
Patrick and Brockhoff, Dimo and Degener, Bastian and Englert, Matthias and Gunia,
Christian and Heering, Oliver and Jansen, Thomas and Leifhelm, Michael and Plociennik,
Kai and Röglin, Heiko and et al.}, year={2004} }'
chicago: 'Briest, Patrick, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian
Gunia, Oliver Heering, Thomas Jansen, et al. “The Ising Model: Simple Evolutionary
Algorithms as Adaptation Schemes.” In Parallel Problem Solving from Nature
- PPSN VIII. Berlin, Heidelberg, 2004. https://doi.org/10.1007/978-3-540-30217-9_4.'
ieee: 'P. Briest et al., “The Ising Model: Simple Evolutionary Algorithms
as Adaptation Schemes,” in Parallel Problem Solving from Nature - PPSN VIII,
2004.'
mla: 'Briest, Patrick, et al. “The Ising Model: Simple Evolutionary Algorithms as
Adaptation Schemes.” Parallel Problem Solving from Nature - PPSN VIII,
2004, doi:10.1007/978-3-540-30217-9_4.'
short: 'P. Briest, D. Brockhoff, B. Degener, M. Englert, C. Gunia, O. Heering, T.
Jansen, M. Leifhelm, K. Plociennik, H. Röglin, A. Schweer, D. Sudholt, S. Tannenbaum,
I. Wegener, in: Parallel Problem Solving from Nature - PPSN VIII, Berlin, Heidelberg,
2004.'
date_created: 2020-09-25T10:41:37Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: 10.1007/978-3-540-30217-9_4
language:
- iso: eng
place: Berlin, Heidelberg
publication: Parallel Problem Solving from Nature - PPSN VIII
publication_identifier:
isbn:
- '9783540230922'
- '9783540302179'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes'
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '19693'
author:
- first_name: Andrea
full_name: Schweer, Andrea
last_name: Schweer
- first_name: Michael
full_name: Leifhelm, Michael
last_name: Leifhelm
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Oliver
full_name: Heering, Oliver
last_name: Heering
- first_name: Stefan
full_name: Tannenbaum, Stefan
last_name: Tannenbaum
- first_name: Heiko
full_name: Röglin, Heiko
last_name: Röglin
- first_name: Christian
full_name: Gunia, Christian
last_name: Gunia
- first_name: Matthias
full_name: Englert, Matthias
last_name: Englert
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Dirk
full_name: Sudholt, Dirk
last_name: Sudholt
- first_name: Dimo
full_name: Brockhoff, Dimo
last_name: Brockhoff
- first_name: Ingo
full_name: Wegener, Ingo
last_name: Wegener
- first_name: Thomas
full_name: Jansen, Thomas
last_name: Jansen
- first_name: Kai
full_name: Plociennik, Kai
last_name: Plociennik
citation:
ama: 'Schweer A, Leifhelm M, Degener B, et al. Experimental Supplements to the Theoretical
Analysis of EAs on Problems from Combinatorial Optimization. In: Parallel Problem
Solving from Nature - PPSN VIII. ; 2004.'
apa: Schweer, A., Leifhelm, M., Degener, B., Heering, O., Tannenbaum, S., Röglin,
H., … Plociennik, K. (2004). Experimental Supplements to the Theoretical Analysis
of EAs on Problems from Combinatorial Optimization. In Parallel Problem Solving
from Nature - PPSN VIII.
bibtex: '@inproceedings{Schweer_Leifhelm_Degener_Heering_Tannenbaum_Röglin_Gunia_Englert_Briest_Sudholt_et
al._2004, title={Experimental Supplements to the Theoretical Analysis of EAs on
Problems from Combinatorial Optimization}, booktitle={Parallel Problem Solving
from Nature - PPSN VIII}, author={Schweer, Andrea and Leifhelm, Michael and Degener,
Bastian and Heering, Oliver and Tannenbaum, Stefan and Röglin, Heiko and Gunia,
Christian and Englert, Matthias and Briest, Patrick and Sudholt, Dirk and et al.},
year={2004} }'
chicago: Schweer, Andrea, Michael Leifhelm, Bastian Degener, Oliver Heering, Stefan
Tannenbaum, Heiko Röglin, Christian Gunia, et al. “Experimental Supplements to
the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.”
In Parallel Problem Solving from Nature - PPSN VIII, 2004.
ieee: A. Schweer et al., “Experimental Supplements to the Theoretical Analysis
of EAs on Problems from Combinatorial Optimization,” in Parallel Problem Solving
from Nature - PPSN VIII, 2004.
mla: Schweer, Andrea, et al. “Experimental Supplements to the Theoretical Analysis
of EAs on Problems from Combinatorial Optimization.” Parallel Problem Solving
from Nature - PPSN VIII, 2004.
short: 'A. Schweer, M. Leifhelm, B. Degener, O. Heering, S. Tannenbaum, H. Röglin,
C. Gunia, M. Englert, P. Briest, D. Sudholt, D. Brockhoff, I. Wegener, T. Jansen,
K. Plociennik, in: Parallel Problem Solving from Nature - PPSN VIII, 2004.'
date_created: 2020-09-25T10:45:22Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
language:
- iso: eng
publication: Parallel Problem Solving from Nature - PPSN VIII
publication_status: published
status: public
title: Experimental Supplements to the Theoretical Analysis of EAs on Problems from
Combinatorial Optimization
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '19800'
abstract:
- lang: eng
text: Redundant arrays of independent disks, also called RAID arrays, have gained
a wide popularity in the last twenty years. Most of the disks used in the server
market are currently based on RAID technology. The primary reason for introducing
RAID technology in 1988 has been the fact that large disk systems have become
much slower and more expensive than the connection of a large number of inexpensive
disks and the use of them as an array. The times seem to repeat themselves. Today,
large scale RAID arrays have become incredible big and expensive. It seems that
it makes sense to replace them by a collection of smaller and inexpensive arrays
of JBODs or mid-ranged RAID arrays. In this paper we will show that combining
these systems with state-of-the-art virtualization technology can lead to a system
that is faster and less expensive than an enterprise storage system, while being
as easy to manage and as reliable. Therefore we will outline the most important
features of storage management and compare there realization in enterprise class
storage systems and in current and future virtualization environments.
author:
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Kay
full_name: Salzwedel, Kay
last_name: Salzwedel
- first_name: Mario
full_name: Vodisek, Mario
last_name: Vodisek
citation:
ama: 'Brinkmann A, Salzwedel K, Vodisek M. A case for virtualized arrays of RAID.
In: Proceedings of the International Workshop on Storage Network Architecture
and Parallel I/Os - SNAPI ’04. ; 2004:9-16. doi:10.1145/1162628.1162630'
apa: Brinkmann, A., Salzwedel, K., & Vodisek, M. (2004). A case for virtualized
arrays of RAID. In Proceedings of the international workshop on Storage network
architecture and parallel I/Os - SNAPI ’04 (pp. 9–16). https://doi.org/10.1145/1162628.1162630
bibtex: '@inproceedings{Brinkmann_Salzwedel_Vodisek_2004, title={A case for virtualized
arrays of RAID}, DOI={10.1145/1162628.1162630},
booktitle={Proceedings of the international workshop on Storage network architecture
and parallel I/Os - SNAPI ’04}, author={Brinkmann, André and Salzwedel, Kay and
Vodisek, Mario}, year={2004}, pages={9–16} }'
chicago: Brinkmann, André, Kay Salzwedel, and Mario Vodisek. “A Case for Virtualized
Arrays of RAID.” In Proceedings of the International Workshop on Storage Network
Architecture and Parallel I/Os - SNAPI ’04, 9–16, 2004. https://doi.org/10.1145/1162628.1162630.
ieee: A. Brinkmann, K. Salzwedel, and M. Vodisek, “A case for virtualized arrays
of RAID,” in Proceedings of the international workshop on Storage network architecture
and parallel I/Os - SNAPI ’04, 2004, pp. 9–16.
mla: Brinkmann, André, et al. “A Case for Virtualized Arrays of RAID.” Proceedings
of the International Workshop on Storage Network Architecture and Parallel I/Os
- SNAPI ’04, 2004, pp. 9–16, doi:10.1145/1162628.1162630.
short: 'A. Brinkmann, K. Salzwedel, M. Vodisek, in: Proceedings of the International
Workshop on Storage Network Architecture and Parallel I/Os - SNAPI ’04, 2004,
pp. 9–16.'
date_created: 2020-09-30T12:39:30Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1145/1162628.1162630
language:
- iso: eng
page: 9-16
publication: Proceedings of the international workshop on Storage network architecture
and parallel I/Os - SNAPI '04
publication_status: published
status: public
title: A case for virtualized arrays of RAID
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '19807'
abstract:
- lang: eng
text: 'Wireless connectivity is state of the art for local area networks. Currently,
most W-LAN networks rely on a centralized design with access points routing all
inner and outbound traffic. These access points are intrinsic communication bottlenecks.
Mobile Ad Hoc Networks (MANET) overcome this problem, because every participant
works as well as a simple node and as a router. Current MANETs are restricted
in scalability, because they rely on flooding mechanisms or complete routing tables.
Other approaches, providing better scalability use clustering, yet network performance
deteriorates in case of high node mobility. We describe the design of a PAMANET,
the Paderborn Mobile Ad Hoc Network, a MANET overcoming these problems providing
scalability and reliability in a mobile scenario. When implemented, PAMANET works
with standard W-LAN IEEE 802.11 radio devices, provides IPv6 communication interfaces
and works on personal computers under a standard Linux distribution. First, we
present current routing protocols and classify them with respect to scalability
and stability in dynamically evolving MANETs. Then, we discuss related research
in the area of distributed hash tables and consistent hashing, used for relieving
hot spots in the Web, storage area networks and peerto-peer networks, which inspires
the design of PAMANET. PAMANET consists of three main components: First, the embedding
of the routing layer into IEEE 802.11 and IPv6 by using techniques used at the
ad hoc support library (aslib) by Gupta et al. Second, the routing layer which
combines a landmark routing, hierarchical clustering, consistent hashing for providing
location dependent addresses and lookup-service for the location of nodes. Third,
a peerto-peer data storage system based on egoistic distributed caches enabling
hop and traffic efficient data access on replicated data partitions.
The routing
layer incorporates a variety of new approaches. Link distances reflect the failure
probability of links, which is estimated by the reciprocal age of the link. Then,
we combine a landmarking system on this metric with the hierarchical layer graph
yielding small landmark addresses and small routing tables. To balance the load
of the distributed lookup-service for landmark addresses, a hierarchical weighted
consistent hashing scheme is used. This ensures that each node receives an equal
part of all landmark addresses. Using these mechanisms (regularly and on demand)
PAMANET adjusts IPv6 routing tables such that short stable routes are preferred.
For the distribution of control data like landmark information PAMANET uses a
message box system interface to provide fast one-hop communication. On top of
this system, PAMANET provides a peer-to-peer data storage and lookup system that
realizes time, traffic, and load efficient access using egoistic caches and data
segmentation strategies.'
author:
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Stefan
full_name: Böttcher, Stefan
last_name: Böttcher
- first_name: Franz
full_name: Rammig, Franz
last_name: Rammig
citation:
ama: 'Schindelhauer C, Böttcher S, Rammig F. The design of PaMaNet the Paderborn
mobile ad-hoc network. In: Proceedings of the Second International Workshop
on Mobility Management & Wireless Access Protocols. ; 2004. doi:10.1145/1023783.1023807'
apa: Schindelhauer, C., Böttcher, S., & Rammig, F. (2004). The design of PaMaNet
the Paderborn mobile ad-hoc network. In Proceedings of the second international
workshop on Mobility management & wireless access protocols. https://doi.org/10.1145/1023783.1023807
bibtex: '@inproceedings{Schindelhauer_Böttcher_Rammig_2004, title={The design of
PaMaNet the Paderborn mobile ad-hoc network}, DOI={10.1145/1023783.1023807},
booktitle={Proceedings of the second international workshop on Mobility management
& wireless access protocols}, author={Schindelhauer, Christian and Böttcher,
Stefan and Rammig, Franz}, year={2004} }'
chicago: Schindelhauer, Christian, Stefan Böttcher, and Franz Rammig. “The Design
of PaMaNet the Paderborn Mobile Ad-Hoc Network.” In Proceedings of the Second
International Workshop on Mobility Management & Wireless Access Protocols,
2004. https://doi.org/10.1145/1023783.1023807.
ieee: C. Schindelhauer, S. Böttcher, and F. Rammig, “The design of PaMaNet the Paderborn
mobile ad-hoc network,” in Proceedings of the second international workshop
on Mobility management & wireless access protocols, 2004.
mla: Schindelhauer, Christian, et al. “The Design of PaMaNet the Paderborn Mobile
Ad-Hoc Network.” Proceedings of the Second International Workshop on Mobility
Management & Wireless Access Protocols, 2004, doi:10.1145/1023783.1023807.
short: 'C. Schindelhauer, S. Böttcher, F. Rammig, in: Proceedings of the Second
International Workshop on Mobility Management & Wireless Access Protocols,
2004.'
date_created: 2020-09-30T12:58:55Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1145/1023783.1023807
language:
- iso: eng
publication: Proceedings of the second international workshop on Mobility management
& wireless access protocols
publication_identifier:
isbn:
- '1581139209'
publication_status: published
status: public
title: The design of PaMaNet the Paderborn mobile ad-hoc network
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '19851'
abstract:
- lang: eng
text: The Internet-SCSI protocol [iSCSI] allows a client to interact with a remote
SCSI-capable target by means of block-oriented commands encapsulated within TCP/IP
packets. Thereby, iSCSI greatly simplifies storage virtualization, since clients
can access storage in a unified manner, no matter whether the I/O-path is short
or long distance. Intermediate devices located on the path between a client and
a target can easily intercept iSCSI sessions and rewrite packets for the sake
of load balancing, prefetching, or redundancy, to mention just a few beneficial
applications. Within this paper we describe the design and implementation of such
an iSCSI capable intermediate device that deploys prefetching strategies in combination
with redundant disks to reduce average I/O-latency. Depending on its location
within the network, this virtualization and prefetching device can hide wide area
access latency and reduce network contention targeting remote SCSI-devices to
a large extent.
author:
- first_name: Peter
full_name: Bleckmann, Peter
last_name: Bleckmann
- first_name: Gunnar
full_name: Schomaker, Gunnar
last_name: Schomaker
- first_name: Adrian
full_name: Slowik, Adrian
last_name: Slowik
citation:
ama: 'Bleckmann P, Schomaker G, Slowik A. Virtualization with prefetching abilities
based on iSCSI. In: Proceeding of International Workshop on Storage Network
Architecture and Parallel I/O. ; 2004:40-47. doi:10.1145/1162628.1162634'
apa: Bleckmann, P., Schomaker, G., & Slowik, A. (2004). Virtualization with
prefetching abilities based on iSCSI. Proceeding of International Workshop
on Storage Network Architecture and Parallel I/O, 2, 40–47. https://doi.org/10.1145/1162628.1162634
bibtex: '@inproceedings{Bleckmann_Schomaker_Slowik_2004, title={Virtualization with
prefetching abilities based on iSCSI}, DOI={10.1145/1162628.1162634},
number={2}, booktitle={Proceeding of International Workshop on Storage Network
Architecture and Parallel I/O}, author={Bleckmann, Peter and Schomaker, Gunnar
and Slowik, Adrian}, year={2004}, pages={40–47} }'
chicago: Bleckmann, Peter, Gunnar Schomaker, and Adrian Slowik. “Virtualization
with Prefetching Abilities Based on ISCSI.” In Proceeding of International
Workshop on Storage Network Architecture and Parallel I/O, 40–47, 2004. https://doi.org/10.1145/1162628.1162634.
ieee: 'P. Bleckmann, G. Schomaker, and A. Slowik, “Virtualization with prefetching
abilities based on iSCSI,” in Proceeding of International Workshop on Storage
Network Architecture and Parallel I/O, 2004, no. 2, pp. 40–47, doi: 10.1145/1162628.1162634.'
mla: Bleckmann, Peter, et al. “Virtualization with Prefetching Abilities Based on
ISCSI.” Proceeding of International Workshop on Storage Network Architecture
and Parallel I/O, no. 2, 2004, pp. 40–47, doi:10.1145/1162628.1162634.
short: 'P. Bleckmann, G. Schomaker, A. Slowik, in: Proceeding of International Workshop
on Storage Network Architecture and Parallel I/O, 2004, pp. 40–47.'
date_created: 2020-10-02T11:40:12Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1145/1162628.1162634
issue: '2'
language:
- iso: eng
page: 40-47
publication: Proceeding of International Workshop on Storage Network Architecture
and Parallel I/O
publication_status: published
status: public
title: Virtualization with prefetching abilities based on iSCSI
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '19879'
author:
- first_name: Jan
full_name: Klein, Jan
last_name: Klein
- first_name: Gabriel
full_name: Zachmann, Gabriel
last_name: Zachmann
citation:
ama: Klein J, Zachmann G. Point Cloud Surfaces using Geometric Proximity Graphs.
Computers and Graphics. 2004;28(6):839-850. doi:10.1016/j.cag.2004.08.012
apa: Klein, J., & Zachmann, G. (2004). Point Cloud Surfaces using Geometric
Proximity Graphs. Computers and Graphics, 28(6), 839–850. https://doi.org/10.1016/j.cag.2004.08.012
bibtex: '@article{Klein_Zachmann_2004, title={Point Cloud Surfaces using Geometric
Proximity Graphs}, volume={28}, DOI={10.1016/j.cag.2004.08.012},
number={6}, journal={Computers and Graphics}, author={Klein, Jan and Zachmann,
Gabriel}, year={2004}, pages={839–850} }'
chicago: 'Klein, Jan, and Gabriel Zachmann. “Point Cloud Surfaces Using Geometric
Proximity Graphs.” Computers and Graphics 28, no. 6 (2004): 839–50. https://doi.org/10.1016/j.cag.2004.08.012.'
ieee: J. Klein and G. Zachmann, “Point Cloud Surfaces using Geometric Proximity
Graphs,” Computers and Graphics, vol. 28, no. 6, pp. 839–850, 2004.
mla: Klein, Jan, and Gabriel Zachmann. “Point Cloud Surfaces Using Geometric Proximity
Graphs.” Computers and Graphics, vol. 28, no. 6, 2004, pp. 839–50, doi:10.1016/j.cag.2004.08.012.
short: J. Klein, G. Zachmann, Computers and Graphics 28 (2004) 839–850.
date_created: 2020-10-05T12:57:39Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
doi: 10.1016/j.cag.2004.08.012
intvolume: ' 28'
issue: '6'
language:
- iso: eng
page: 839-850
publication: Computers and Graphics
status: public
title: Point Cloud Surfaces using Geometric Proximity Graphs
type: journal_article
user_id: '15415'
volume: 28
year: '2004'
...
---
_id: '19883'
author:
- first_name: Jan
full_name: Klein, Jan
last_name: Klein
- first_name: Gabriel
full_name: Zachmann, Gabriel
last_name: Zachmann
citation:
ama: 'Klein J, Zachmann G. Proximity Graphs for Defining Surfaces over Point Clouds.
In: Eurographics Symposium on Point-Based Grahics (SPBG’04). ; 2004:131-138.'
apa: Klein, J., & Zachmann, G. (2004). Proximity Graphs for Defining Surfaces
over Point Clouds. In Eurographics Symposium on Point-Based Grahics (SPBG’04)
(pp. 131–138).
bibtex: '@inproceedings{Klein_Zachmann_2004, title={Proximity Graphs for Defining
Surfaces over Point Clouds}, booktitle={Eurographics Symposium on Point-Based
Grahics (SPBG’04)}, author={Klein, Jan and Zachmann, Gabriel}, year={2004}, pages={131–138}
}'
chicago: Klein, Jan, and Gabriel Zachmann. “Proximity Graphs for Defining Surfaces
over Point Clouds.” In Eurographics Symposium on Point-Based Grahics (SPBG’04),
131–38, 2004.
ieee: J. Klein and G. Zachmann, “Proximity Graphs for Defining Surfaces over Point
Clouds,” in Eurographics Symposium on Point-Based Grahics (SPBG’04), 2004,
pp. 131–138.
mla: Klein, Jan, and Gabriel Zachmann. “Proximity Graphs for Defining Surfaces over
Point Clouds.” Eurographics Symposium on Point-Based Grahics (SPBG’04),
2004, pp. 131–38.
short: 'J. Klein, G. Zachmann, in: Eurographics Symposium on Point-Based Grahics
(SPBG’04), 2004, pp. 131–138.'
date_created: 2020-10-05T13:03:44Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
language:
- iso: eng
page: 131-138
publication: Eurographics Symposium on Point-Based Grahics (SPBG'04)
status: public
title: Proximity Graphs for Defining Surfaces over Point Clouds
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '19889'
author:
- first_name: Jan
full_name: Klein, Jan
last_name: Klein
- first_name: Gabriel
full_name: Zachmann, Gabriel
last_name: Zachmann
citation:
ama: 'Klein J, Zachmann G. Nice and Fast Implicit Surfaces over Noisy Point Clouds.
In: SIGGRAPH 2004, Sketches. ; 2004.'
apa: Klein, J., & Zachmann, G. (2004). Nice and Fast Implicit Surfaces over
Noisy Point Clouds. In SIGGRAPH 2004, Sketches.
bibtex: '@inproceedings{Klein_Zachmann_2004, title={Nice and Fast Implicit Surfaces
over Noisy Point Clouds}, booktitle={SIGGRAPH 2004, Sketches}, author={Klein,
Jan and Zachmann, Gabriel}, year={2004} }'
chicago: Klein, Jan, and Gabriel Zachmann. “Nice and Fast Implicit Surfaces over
Noisy Point Clouds.” In SIGGRAPH 2004, Sketches, 2004.
ieee: J. Klein and G. Zachmann, “Nice and Fast Implicit Surfaces over Noisy Point
Clouds,” in SIGGRAPH 2004, Sketches, 2004.
mla: Klein, Jan, and Gabriel Zachmann. “Nice and Fast Implicit Surfaces over Noisy
Point Clouds.” SIGGRAPH 2004, Sketches, 2004.
short: 'J. Klein, G. Zachmann, in: SIGGRAPH 2004, Sketches, 2004.'
date_created: 2020-10-05T13:31:16Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
language:
- iso: eng
publication: SIGGRAPH 2004, Sketches
status: public
title: Nice and Fast Implicit Surfaces over Noisy Point Clouds
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '19891'
author:
- first_name: Jan
full_name: Klein, Jan
last_name: Klein
- first_name: Gabriel
full_name: Zachmann, Gabriel
last_name: Zachmann
citation:
ama: 'Klein J, Zachmann G. Point Cloud Collision Detection. In: Computer Graphics
Forum (Proceedings of EUROGRAPHICS 2004). ; 2004:567-576.'
apa: Klein, J., & Zachmann, G. (2004). Point Cloud Collision Detection. In Computer
Graphics Forum (Proceedings of EUROGRAPHICS 2004) (pp. 567–576).
bibtex: '@inproceedings{Klein_Zachmann_2004, title={Point Cloud Collision Detection},
booktitle={Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)}, author={Klein,
Jan and Zachmann, Gabriel}, year={2004}, pages={567–576} }'
chicago: Klein, Jan, and Gabriel Zachmann. “Point Cloud Collision Detection.” In
Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004), 567–76, 2004.
ieee: J. Klein and G. Zachmann, “Point Cloud Collision Detection,” in Computer
Graphics Forum (Proceedings of EUROGRAPHICS 2004), 2004, pp. 567–576.
mla: Klein, Jan, and Gabriel Zachmann. “Point Cloud Collision Detection.” Computer
Graphics Forum (Proceedings of EUROGRAPHICS 2004), 2004, pp. 567–76.
short: 'J. Klein, G. Zachmann, in: Computer Graphics Forum (Proceedings of EUROGRAPHICS
2004), 2004, pp. 567–576.'
date_created: 2020-10-05T13:49:10Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
language:
- iso: eng
page: 567-576
publication: Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)
status: public
title: Point Cloud Collision Detection
type: conference
user_id: '15415'
year: '2004'
...