---
_id: '2533'
author:
- first_name: Vlado
  full_name: ' Handziski, Vlado'
  last_name: ' Handziski'
- first_name: Andreas
  full_name: Köpke, Andreas
  last_name: Köpke
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
- first_name: Adam
  full_name: Wolisz, Adam
  last_name: Wolisz
citation:
  ama: Handziski V, Köpke A, Karl H, Wolisz A. <i>A Common Wireless Sensor Network
    Architecture?</i> Berlin; 2003.
  apa: Handziski, V., Köpke, A., Karl, H., &#38; Wolisz, A. (2003). <i>A common wireless
    sensor network architecture?</i> Berlin.
  bibtex: '@book{ Handziski_Köpke_Karl_Wolisz_2003, place={Berlin}, title={A common
    wireless sensor network architecture?}, author={ Handziski, Vlado and Köpke, Andreas
    and Karl, Holger and Wolisz, Adam}, year={2003} }'
  chicago: Handziski, Vlado, Andreas Köpke, Holger Karl, and Adam Wolisz. <i>A Common
    Wireless Sensor Network Architecture?</i> Berlin, 2003.
  ieee: V.  Handziski, A. Köpke, H. Karl, and A. Wolisz, <i>A common wireless sensor
    network architecture?</i> Berlin, 2003.
  mla: Handziski, Vlado, et al. <i>A Common Wireless Sensor Network Architecture?</i>
    2003.
  short: V.  Handziski, A. Köpke, H. Karl, A. Wolisz, A Common Wireless Sensor Network
    Architecture?, Berlin, 2003.
date_created: 2018-04-26T11:19:04Z
date_updated: 2022-01-06T06:57:01Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: closed
  content_type: application/pdf
  creator: tabu
  date_created: 2018-04-26T11:18:38Z
  date_updated: 2018-04-26T11:18:38Z
  file_id: '2534'
  file_name: sensornetz_architecture.pdf
  file_size: 137677
  relation: main_file
  success: 1
file_date_updated: 2018-04-26T11:18:38Z
has_accepted_license: '1'
place: Berlin
status: public
title: A common wireless sensor network architecture?
type: report
user_id: '15572'
year: '2003'
...
---
_id: '2535'
author:
- first_name: 'Witold '
  full_name: 'Drytkiewicz, Witold '
  last_name: Drytkiewicz
- first_name: Steffen
  full_name: Sroka, Steffen
  last_name: Sroka
- first_name: 'Vlado '
  full_name: 'Handzisk, Vlado '
  last_name: Handzisk
- first_name: Andreas
  full_name: Köpke, Andreas
  last_name: Köpke
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Drytkiewicz W, Sroka S, Handzisk V, Köpke A, Karl H. A Mobility Frame work
    for OMNeT++. In: <i>Proc. of 3rd International OMNeT++ Workshop at Budapest University
    of Technology and Economics</i>. ; 2003.'
  apa: Drytkiewicz, W., Sroka, S., Handzisk, V., Köpke, A., &#38; Karl, H. (2003).
    A Mobility Frame work for OMNeT++. In <i>Proc. of 3rd International OMNeT++ Workshop
    at Budapest University of Technology and Economics</i>.
  bibtex: '@inproceedings{Drytkiewicz_Sroka_Handzisk_Köpke_Karl_2003, title={A Mobility
    Frame work for OMNeT++}, booktitle={Proc. of 3rd International OMNeT++ Workshop
    at Budapest University of Technology and Economics}, author={Drytkiewicz, Witold  and
    Sroka, Steffen and Handzisk, Vlado  and Köpke, Andreas and Karl, Holger}, year={2003}
    }'
  chicago: Drytkiewicz, Witold , Steffen Sroka, Vlado  Handzisk, Andreas Köpke, and
    Holger Karl. “A Mobility Frame Work for OMNeT++.” In <i>Proc. of 3rd International
    OMNeT++ Workshop at Budapest University of Technology and Economics</i>, 2003.
  ieee: W. Drytkiewicz, S. Sroka, V. Handzisk, A. Köpke, and H. Karl, “A Mobility
    Frame work for OMNeT++,” in <i>Proc. of 3rd International OMNeT++ Workshop at
    Budapest University of Technology and Economics</i>, 2003.
  mla: Drytkiewicz, Witold, et al. “A Mobility Frame Work for OMNeT++.” <i>Proc. of
    3rd International OMNeT++ Workshop at Budapest University of Technology and Economics</i>,
    2003.
  short: 'W. Drytkiewicz, S. Sroka, V. Handzisk, A. Köpke, H. Karl, in: Proc. of 3rd
    International OMNeT++ Workshop at Budapest University of Technology and Economics,
    2003.'
date_created: 2018-04-26T11:23:18Z
date_updated: 2022-01-06T06:57:01Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: closed
  content_type: application/pdf
  creator: tabu
  date_created: 2018-04-26T11:23:10Z
  date_updated: 2018-04-26T11:23:10Z
  file_id: '2536'
  file_name: mobility_framework.pdf
  file_size: 60304
  relation: main_file
  success: 1
file_date_updated: 2018-04-26T11:23:10Z
has_accepted_license: '1'
publication: Proc. of 3rd International OMNeT++ Workshop at Budapest University of
  Technology and Economics
status: public
title: A Mobility Frame work for OMNeT++
type: conference
user_id: '15572'
year: '2003'
...
---
_id: '19463'
author:
- first_name: Eva- Maria
  full_name: Seng, Eva- Maria
  id: '499'
  last_name: Seng
citation:
  ama: Seng E-M. Christof Thoenes, Opus incertum. Italienische Studien aus drei Jahrzehnten,
    München, Berlin 2002. <i>Kunstform 4, 2003, Nr 9 und Sehepunkte 3, 2003, Nr 9</i>.
    2003;(Nr. 9).
  apa: Seng, E.-M. (2003). Christof Thoenes, Opus incertum. Italienische Studien aus
    drei Jahrzehnten, München, Berlin 2002. <i>Kunstform 4, 2003, Nr. 9 und Sehepunkte
    3, 2003, Nr. 9</i>.
  bibtex: '@article{Seng_2003, title={Christof Thoenes, Opus incertum. Italienische
    Studien aus drei Jahrzehnten, München, Berlin 2002}, number={Nr. 9}, journal={Kunstform
    4, 2003, Nr. 9 und Sehepunkte 3, 2003, Nr. 9}, author={Seng, Eva- Maria}, year={2003}
    }'
  chicago: Seng, Eva- Maria. “Christof Thoenes, Opus incertum. Italienische Studien
    aus drei Jahrzehnten, München, Berlin 2002.” <i>Kunstform 4, 2003, Nr. 9 und Sehepunkte
    3, 2003, Nr. 9</i>, 2003.
  ieee: E.-M. Seng, “Christof Thoenes, Opus incertum. Italienische Studien aus drei
    Jahrzehnten, München, Berlin 2002,” <i>Kunstform 4, 2003, Nr. 9 und Sehepunkte
    3, 2003, Nr. 9</i>, no. Nr. 9. 2003.
  mla: Seng, Eva-Maria. “Christof Thoenes, Opus incertum. Italienische Studien aus
    drei Jahrzehnten, München, Berlin 2002.” <i>Kunstform 4, 2003, Nr. 9 und Sehepunkte
    3, 2003, Nr. 9</i>, no. Nr. 9, 2003.
  short: E.-M. Seng, Kunstform 4, 2003, Nr. 9 und Sehepunkte 3, 2003, Nr. 9 (2003).
date_created: 2020-09-16T10:16:59Z
date_updated: 2022-01-06T06:54:05Z
department:
- _id: '443'
extern: '1'
issue: Nr. 9
language:
- iso: ger
publication: Kunstform 4, 2003, Nr. 9 und Sehepunkte 3, 2003, Nr. 9
status: public
title: Christof Thoenes, Opus incertum. Italienische Studien aus drei Jahrzehnten,
  München, Berlin 2002
type: review
user_id: '21240'
year: '2003'
...
---
_id: '19539'
author:
- first_name: Norbert Otto
  full_name: Eke, Norbert Otto
  id: '104'
  last_name: Eke
citation:
  ama: 'Eke NO. Nikolaus Müller-Schöll: Das Theater des „konstruktiven Defaitismus“.
    Lektüren zur Theorie eines Theaters der A-Identität bei Walter Benjamin, Bertolt
    Brecht und Heiner Müller. Frankfurt/Main u.a.: Stroemfeld, 2002. <i>Germanistik</i>.
    2003;44(H. 3/4):1033f.'
  apa: 'Eke, N. O. (2003). Nikolaus Müller-Schöll: Das Theater des „konstruktiven
    Defaitismus“. Lektüren zur Theorie eines Theaters der A-Identität bei Walter Benjamin,
    Bertolt Brecht und Heiner Müller. Frankfurt/Main u.a.: Stroemfeld, 2002. <i>Germanistik</i>.'
  bibtex: '@article{Eke_2003, title={Nikolaus Müller-Schöll: Das Theater des „konstruktiven
    Defaitismus“. Lektüren zur Theorie eines Theaters der A-Identität bei Walter Benjamin,
    Bertolt Brecht und Heiner Müller. Frankfurt/Main u.a.: Stroemfeld, 2002}, volume={44},
    number={H. 3/4}, journal={Germanistik}, author={Eke, Norbert Otto}, year={2003},
    pages={1033f.} }'
  chicago: 'Eke, Norbert Otto. “Nikolaus Müller-Schöll: Das Theater des „konstruktiven
    Defaitismus“. Lektüren zur Theorie eines Theaters der A-Identität bei Walter Benjamin,
    Bertolt Brecht und Heiner Müller. Frankfurt/Main u.a.: Stroemfeld, 2002.” <i>Germanistik</i>,
    2003.'
  ieee: 'N. O. Eke, “Nikolaus Müller-Schöll: Das Theater des „konstruktiven Defaitismus“.
    Lektüren zur Theorie eines Theaters der A-Identität bei Walter Benjamin, Bertolt
    Brecht und Heiner Müller. Frankfurt/Main u.a.: Stroemfeld, 2002,” <i>Germanistik</i>,
    vol. 44, no. H. 3/4. p. 1033f., 2003.'
  mla: 'Eke, Norbert Otto. “Nikolaus Müller-Schöll: Das Theater des „konstruktiven
    Defaitismus“. Lektüren zur Theorie eines Theaters der A-Identität bei Walter Benjamin,
    Bertolt Brecht und Heiner Müller. Frankfurt/Main u.a.: Stroemfeld, 2002.” <i>Germanistik</i>,
    vol. 44, no. H. 3/4, 2003, p. 1033f.'
  short: N.O. Eke, Germanistik 44 (2003) 1033f.
date_created: 2020-09-18T05:26:02Z
date_updated: 2022-01-06T06:54:07Z
department:
- _id: '465'
extern: '1'
intvolume: '        44'
issue: H. 3/4
language:
- iso: ger
page: 1033f.
publication: Germanistik
status: public
title: 'Nikolaus Müller-Schöll: Das Theater des „konstruktiven Defaitismus“. Lektüren
  zur Theorie eines Theaters der A-Identität bei Walter Benjamin, Bertolt Brecht und
  Heiner Müller. Frankfurt/Main u.a.: Stroemfeld, 2002'
type: review
user_id: '14932'
volume: 44
year: '2003'
...
---
_id: '19540'
author:
- first_name: Norbert Otto
  full_name: Eke, Norbert Otto
  id: '104'
  last_name: Eke
citation:
  ama: 'Eke NO. Marcus Kreikebaum: Heiner Müllers Gedichte. Bielefeld: Aisthesis,
    2003. <i>Germanistik</i>. 2003;44(H. 3/4):1009.'
  apa: 'Eke, N. O. (2003). Marcus Kreikebaum: Heiner Müllers Gedichte. Bielefeld:
    Aisthesis, 2003. <i>Germanistik</i>.'
  bibtex: '@article{Eke_2003, title={Marcus Kreikebaum: Heiner Müllers Gedichte. Bielefeld:
    Aisthesis, 2003}, volume={44}, number={H. 3/4}, journal={Germanistik}, author={Eke,
    Norbert Otto}, year={2003}, pages={1009} }'
  chicago: 'Eke, Norbert Otto. “Marcus Kreikebaum: Heiner Müllers Gedichte. Bielefeld:
    Aisthesis, 2003.” <i>Germanistik</i>, 2003.'
  ieee: 'N. O. Eke, “Marcus Kreikebaum: Heiner Müllers Gedichte. Bielefeld: Aisthesis,
    2003,” <i>Germanistik</i>, vol. 44, no. H. 3/4. p. 1009, 2003.'
  mla: 'Eke, Norbert Otto. “Marcus Kreikebaum: Heiner Müllers Gedichte. Bielefeld:
    Aisthesis, 2003.” <i>Germanistik</i>, vol. 44, no. H. 3/4, 2003, p. 1009.'
  short: N.O. Eke, Germanistik 44 (2003) 1009.
date_created: 2020-09-18T05:27:58Z
date_updated: 2022-01-06T06:54:07Z
department:
- _id: '465'
extern: '1'
intvolume: '        44'
issue: H. 3/4
language:
- iso: ger
page: '1009'
publication: Germanistik
status: public
title: 'Marcus Kreikebaum: Heiner Müllers Gedichte. Bielefeld: Aisthesis, 2003'
type: review
user_id: '14932'
volume: 44
year: '2003'
...
---
_id: '19541'
author:
- first_name: Norbert Otto
  full_name: Eke, Norbert Otto
  id: '104'
  last_name: Eke
citation:
  ama: 'Eke NO. Katharina Ebrecht: Heiner Müllers Lyrik. Quellen und Vorbilder. Würzburg:
    Königshausen &#38; Neumann, 2001. <i>Germanistik</i>. 2003;44(H. 3/4):1008f.'
  apa: 'Eke, N. O. (2003). Katharina Ebrecht: Heiner Müllers Lyrik. Quellen und Vorbilder.
    Würzburg: Königshausen &#38; Neumann, 2001. <i>Germanistik</i>.'
  bibtex: '@article{Eke_2003, title={Katharina Ebrecht: Heiner Müllers Lyrik. Quellen
    und Vorbilder. Würzburg: Königshausen &#38; Neumann, 2001}, volume={44}, number={H.
    3/4}, journal={Germanistik}, author={Eke, Norbert Otto}, year={2003}, pages={1008f.}
    }'
  chicago: 'Eke, Norbert Otto. “Katharina Ebrecht: Heiner Müllers Lyrik. Quellen und
    Vorbilder. Würzburg: Königshausen &#38; Neumann, 2001.” <i>Germanistik</i>, 2003.'
  ieee: 'N. O. Eke, “Katharina Ebrecht: Heiner Müllers Lyrik. Quellen und Vorbilder.
    Würzburg: Königshausen &#38; Neumann, 2001,” <i>Germanistik</i>, vol. 44, no.
    H. 3/4. p. 1008f., 2003.'
  mla: 'Eke, Norbert Otto. “Katharina Ebrecht: Heiner Müllers Lyrik. Quellen und Vorbilder.
    Würzburg: Königshausen &#38; Neumann, 2001.” <i>Germanistik</i>, vol. 44, no.
    H. 3/4, 2003, p. 1008f.'
  short: N.O. Eke, Germanistik 44 (2003) 1008f.
date_created: 2020-09-18T05:29:47Z
date_updated: 2022-01-06T06:54:07Z
department:
- _id: '465'
extern: '1'
intvolume: '        44'
issue: H. 3/4
language:
- iso: ger
page: 1008f.
publication: Germanistik
status: public
title: 'Katharina Ebrecht: Heiner Müllers Lyrik. Quellen und Vorbilder. Würzburg:
  Königshausen & Neumann, 2001'
type: review
user_id: '14932'
volume: 44
year: '2003'
...
---
_id: '1955'
author:
- first_name: Dieter
  full_name: Krimphove, Dieter
  id: '282'
  last_name: Krimphove
- first_name: Jürgen
  full_name: Welp, Jürgen
  last_name: Welp
citation:
  ama: 'Krimphove D, Welp J. Ökonomische/rechtliche Aspekte der Unternehmensübernahme.
    In: Schmeisser W, Krimphove D, Nathusius K, eds. <i>Handbuch Unternehmensnachfolge</i>.
    Stuttgart : Schäffer-Poeschel Verlag; 2003:151 – 186.'
  apa: 'Krimphove, D., &#38; Welp, J. (2003). Ökonomische/rechtliche Aspekte der Unternehmensübernahme.
    In W. Schmeisser, D. Krimphove, &#38; K. Nathusius (Eds.), <i>Handbuch Unternehmensnachfolge</i>
    (pp. 151 – 186). Stuttgart : Schäffer-Poeschel Verlag.'
  bibtex: '@inbook{Krimphove_Welp_2003, place={Stuttgart }, title={Ökonomische/rechtliche
    Aspekte der Unternehmensübernahme}, booktitle={Handbuch Unternehmensnachfolge},
    publisher={Schäffer-Poeschel Verlag}, author={Krimphove, Dieter and Welp, Jürgen},
    editor={Schmeisser, Wilhelm and Krimphove, Dieter and Nathusius, KlausEditors},
    year={2003}, pages={151 – 186} }'
  chicago: 'Krimphove, Dieter, and Jürgen Welp. “Ökonomische/Rechtliche Aspekte Der
    Unternehmensübernahme.” In <i>Handbuch Unternehmensnachfolge</i>, edited by Wilhelm
    Schmeisser, Dieter Krimphove, and Klaus Nathusius, 151 – 186. Stuttgart : Schäffer-Poeschel
    Verlag, 2003.'
  ieee: 'D. Krimphove and J. Welp, “Ökonomische/rechtliche Aspekte der Unternehmensübernahme,”
    in <i>Handbuch Unternehmensnachfolge</i>, W. Schmeisser, D. Krimphove, and K.
    Nathusius, Eds. Stuttgart : Schäffer-Poeschel Verlag, 2003, pp. 151 – 186.'
  mla: Krimphove, Dieter, and Jürgen Welp. “Ökonomische/Rechtliche Aspekte Der Unternehmensübernahme.”
    <i>Handbuch Unternehmensnachfolge</i>, edited by Wilhelm Schmeisser et al., Schäffer-Poeschel
    Verlag, 2003, pp. 151 – 186.
  short: 'D. Krimphove, J. Welp, in: W. Schmeisser, D. Krimphove, K. Nathusius (Eds.),
    Handbuch Unternehmensnachfolge, Schäffer-Poeschel Verlag, Stuttgart , 2003, pp.
    151 – 186.'
date_created: 2018-03-29T10:52:04Z
date_updated: 2022-01-06T06:54:07Z
editor:
- first_name: Wilhelm
  full_name: Schmeisser, Wilhelm
  last_name: Schmeisser
- first_name: Dieter
  full_name: Krimphove, Dieter
  last_name: Krimphove
- first_name: Klaus
  full_name: Nathusius, Klaus
  last_name: Nathusius
page: 151 – 186
place: 'Stuttgart '
publication: Handbuch Unternehmensnachfolge
publisher: Schäffer-Poeschel Verlag
status: public
title: Ökonomische/rechtliche Aspekte der Unternehmensübernahme
type: book_chapter
user_id: '282'
year: '2003'
...
---
_id: '19700'
author:
- first_name: Petra
  full_name: Büker, Petra
  id: '21978'
  last_name: Büker
citation:
  ama: 'Büker P. „Tut uns Leid, du bist nicht wie wir!“ – zum Umgang mit Differenz
    in Kathryn Caves und Chris Riddells „Irgendwie Anders“. In: Büker P, Kammler C,
    eds. <i>Das Fremde und das Andere – Interpretationen und didaktische Analysen
    zeitgenössischer Kinder- und Jugendbücher</i>. Weinheim: Juventa (Lesesozialisation
    und Medien); 2003:29-44.'
  apa: 'Büker, P. (2003). „Tut uns Leid, du bist nicht wie wir!“ – zum Umgang mit
    Differenz in Kathryn Caves und Chris Riddells „Irgendwie Anders“. In P. Büker
    &#38; C. Kammler (Eds.), <i>Das Fremde und das Andere – Interpretationen und didaktische
    Analysen zeitgenössischer Kinder- und Jugendbücher</i> (pp. 29–44). Weinheim:
    Juventa (Lesesozialisation und Medien).'
  bibtex: '@inbook{Büker_2003, place={Weinheim}, title={„Tut uns Leid, du bist nicht
    wie wir!“ – zum Umgang mit Differenz in Kathryn Caves und Chris Riddells „Irgendwie
    Anders“}, booktitle={Das Fremde und das Andere – Interpretationen und didaktische
    Analysen zeitgenössischer Kinder- und Jugendbücher}, publisher={Juventa (Lesesozialisation
    und Medien)}, author={Büker, Petra}, editor={Büker, Petra and Kammler, ClemensEditors},
    year={2003}, pages={29–44} }'
  chicago: 'Büker, Petra. “„Tut uns Leid, du bist nicht wie wir!“ – zum Umgang mit
    Differenz in Kathryn Caves und Chris Riddells „Irgendwie Anders“.” In <i>Das Fremde
    und das Andere – Interpretationen und didaktische Analysen zeitgenössischer Kinder-
    und Jugendbücher</i>, edited by Petra Büker and Clemens Kammler, 29–44. Weinheim:
    Juventa (Lesesozialisation und Medien), 2003.'
  ieee: 'P. Büker, “„Tut uns Leid, du bist nicht wie wir!“ – zum Umgang mit Differenz
    in Kathryn Caves und Chris Riddells „Irgendwie Anders“,” in <i>Das Fremde und
    das Andere – Interpretationen und didaktische Analysen zeitgenössischer Kinder-
    und Jugendbücher</i>, P. Büker and C. Kammler, Eds. Weinheim: Juventa (Lesesozialisation
    und Medien), 2003, pp. 29–44.'
  mla: Büker, Petra. “„Tut uns Leid, du bist nicht wie wir!“ – zum Umgang mit Differenz
    in Kathryn Caves und Chris Riddells „Irgendwie Anders“.” <i>Das Fremde und das
    Andere – Interpretationen und didaktische Analysen zeitgenössischer Kinder- und
    Jugendbücher</i>, edited by Petra Büker and Clemens Kammler, Juventa (Lesesozialisation
    und Medien), 2003, pp. 29–44.
  short: 'P. Büker, in: P. Büker, C. Kammler (Eds.), Das Fremde und das Andere – Interpretationen
    und didaktische Analysen zeitgenössischer Kinder- und Jugendbücher, Juventa (Lesesozialisation
    und Medien), Weinheim, 2003, pp. 29–44.'
date_created: 2020-09-28T07:01:35Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '458'
editor:
- first_name: Petra
  full_name: Büker, Petra
  last_name: Büker
- first_name: Clemens
  full_name: Kammler, Clemens
  last_name: Kammler
extern: '1'
language:
- iso: ger
page: 29-44
place: Weinheim
publication: Das Fremde und das Andere – Interpretationen und didaktische Analysen
  zeitgenössischer Kinder- und Jugendbücher
publisher: Juventa (Lesesozialisation und Medien)
status: public
title: „Tut uns Leid, du bist nicht wie wir!“ – zum Umgang mit Differenz in Kathryn
  Caves und Chris Riddells „Irgendwie Anders“
type: book_chapter
user_id: '21240'
year: '2003'
...
---
_id: '19701'
author:
- first_name: Petra
  full_name: Büker, Petra
  id: '21978'
  last_name: Büker
- first_name: Stefanie
  full_name: Brennholt, Stefanie
  last_name: Brennholt
citation:
  ama: Büker P, Brennholt S. „Warum ist nur blau so richtig schlau?“ Die Schulhofgeschichte
    – ein Kindertheaterprojekt zum Thema „Anderssein“. <i>Praxis Deutsch </i>. 2003;30,
    H. 181:14-19.
  apa: Büker, P., &#38; Brennholt, S. (2003). „Warum ist nur blau so richtig schlau?“
    Die Schulhofgeschichte – ein Kindertheaterprojekt zum Thema „Anderssein“. <i>Praxis
    Deutsch </i>, <i>30</i>, <i>H. 181</i>, 14–19.
  bibtex: '@article{Büker_Brennholt_2003, title={„Warum ist nur blau so richtig schlau?“
    Die Schulhofgeschichte – ein Kindertheaterprojekt zum Thema „Anderssein“}, volume={30,
    H. 181}, journal={Praxis Deutsch }, author={Büker, Petra and Brennholt, Stefanie},
    year={2003}, pages={14–19} }'
  chicago: 'Büker, Petra, and Stefanie Brennholt. “„Warum ist nur blau so richtig
    schlau?“ Die Schulhofgeschichte – ein Kindertheaterprojekt zum Thema „Anderssein“.”
    <i>Praxis Deutsch </i> 30, H. 181 (2003): 14–19.'
  ieee: P. Büker and S. Brennholt, “„Warum ist nur blau so richtig schlau?“ Die Schulhofgeschichte
    – ein Kindertheaterprojekt zum Thema „Anderssein“,” <i>Praxis Deutsch </i>, vol.
    30, H. 181, pp. 14–19, 2003.
  mla: Büker, Petra, and Stefanie Brennholt. “„Warum ist nur blau so richtig schlau?“
    Die Schulhofgeschichte – ein Kindertheaterprojekt zum Thema „Anderssein“.” <i>Praxis
    Deutsch </i>, vol. 30, H. 181, 2003, pp. 14–19.
  short: P. Büker, S. Brennholt, Praxis Deutsch  30, H. 181 (2003) 14–19.
date_created: 2020-09-28T07:04:01Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '458'
extern: '1'
language:
- iso: ger
page: 14-19
publication: 'Praxis Deutsch '
status: public
title: „Warum ist nur blau so richtig schlau?“ Die Schulhofgeschichte – ein Kindertheaterprojekt
  zum Thema „Anderssein“
type: journal_article
user_id: '21240'
volume: 30, H. 181
year: '2003'
...
---
_id: '19726'
abstract:
- lang: eng
  text: The Paderborn University BSP (PUB) library is a C communication library based
    on the BSP model. The basic library supports buffered as well as unbuffered non-blocking
    communication between any pair of processors and a mechanism for synchronizing
    the processors in a barrier style. In addition, PUB provides non-blocking collective
    communication operations on arbitrary subsets of processors, the ability to partition
    the processors into independent groups that execute asynchronously from each other,
    and a zero-cost synchronization mechanism. Furthermore, some techniques used in
    the implementation of the PUB library deviate significantly from the techniques
    used in other BSP libraries.
author:
- first_name: Olaf
  full_name: Bonorden, Olaf
  last_name: Bonorden
- first_name: Bernhardus
  full_name: Juurlink, Bernhardus
  last_name: Juurlink
- first_name: Ingo
  full_name: von Otte, Ingo
  last_name: von Otte
- first_name: Ingo
  full_name: Rieping, Ingo
  last_name: Rieping
citation:
  ama: Bonorden O, Juurlink B, von Otte I, Rieping I. The Paderborn University BSP
    (PUB) library. <i>Parallel Computing</i>. 2003:187-207. doi:<a href="https://doi.org/10.1016/s0167-8191(02)00218-1">10.1016/s0167-8191(02)00218-1</a>
  apa: Bonorden, O., Juurlink, B., von Otte, I., &#38; Rieping, I. (2003). The Paderborn
    University BSP (PUB) library. <i>Parallel Computing</i>, 187–207. <a href="https://doi.org/10.1016/s0167-8191(02)00218-1">https://doi.org/10.1016/s0167-8191(02)00218-1</a>
  bibtex: '@article{Bonorden_Juurlink_von Otte_Rieping_2003, title={The Paderborn
    University BSP (PUB) library}, DOI={<a href="https://doi.org/10.1016/s0167-8191(02)00218-1">10.1016/s0167-8191(02)00218-1</a>},
    journal={Parallel Computing}, author={Bonorden, Olaf and Juurlink, Bernhardus
    and von Otte, Ingo and Rieping, Ingo}, year={2003}, pages={187–207} }'
  chicago: Bonorden, Olaf, Bernhardus Juurlink, Ingo von Otte, and Ingo Rieping. “The
    Paderborn University BSP (PUB) Library.” <i>Parallel Computing</i>, 2003, 187–207.
    <a href="https://doi.org/10.1016/s0167-8191(02)00218-1">https://doi.org/10.1016/s0167-8191(02)00218-1</a>.
  ieee: O. Bonorden, B. Juurlink, I. von Otte, and I. Rieping, “The Paderborn University
    BSP (PUB) library,” <i>Parallel Computing</i>, pp. 187–207, 2003.
  mla: Bonorden, Olaf, et al. “The Paderborn University BSP (PUB) Library.” <i>Parallel
    Computing</i>, 2003, pp. 187–207, doi:<a href="https://doi.org/10.1016/s0167-8191(02)00218-1">10.1016/s0167-8191(02)00218-1</a>.
  short: O. Bonorden, B. Juurlink, I. von Otte, I. Rieping, Parallel Computing (2003)
    187–207.
date_created: 2020-09-28T10:39:53Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: 10.1016/s0167-8191(02)00218-1
language:
- iso: eng
page: 187-207
publication: Parallel Computing
publication_identifier:
  issn:
  - 0167-8191
publication_status: published
status: public
title: The Paderborn University BSP (PUB) library
type: journal_article
user_id: '15415'
year: '2003'
...
---
_id: '19785'
author:
- first_name: Kay A.
  full_name: Salzwedel, Kay A.
  last_name: Salzwedel
citation:
  ama: Salzwedel KA. Algorithmic Approaches for Storage Networks. <i>Algorithms for
    Memory Hierarchies</i>. 2003;2625. doi:<a href="https://doi.org/10.1007/3-540-36574-5_12">10.1007/3-540-36574-5_12</a>
  apa: Salzwedel, K. A. (2003). Algorithmic Approaches for Storage Networks. <i>Algorithms
    for Memory Hierarchies</i>, <i>2625</i>. <a href="https://doi.org/10.1007/3-540-36574-5_12">https://doi.org/10.1007/3-540-36574-5_12</a>
  bibtex: '@article{Salzwedel_2003, title={Algorithmic Approaches for Storage Networks},
    volume={2625}, DOI={<a href="https://doi.org/10.1007/3-540-36574-5_12">10.1007/3-540-36574-5_12</a>},
    journal={Algorithms for Memory Hierarchies}, author={Salzwedel, Kay A.}, year={2003}
    }'
  chicago: Salzwedel, Kay A. “Algorithmic Approaches for Storage Networks.” <i>Algorithms
    for Memory Hierarchies</i> 2625 (2003). <a href="https://doi.org/10.1007/3-540-36574-5_12">https://doi.org/10.1007/3-540-36574-5_12</a>.
  ieee: K. A. Salzwedel, “Algorithmic Approaches for Storage Networks,” <i>Algorithms
    for Memory Hierarchies</i>, vol. 2625, 2003.
  mla: Salzwedel, Kay A. “Algorithmic Approaches for Storage Networks.” <i>Algorithms
    for Memory Hierarchies</i>, vol. 2625, 2003, doi:<a href="https://doi.org/10.1007/3-540-36574-5_12">10.1007/3-540-36574-5_12</a>.
  short: K.A. Salzwedel, Algorithms for Memory Hierarchies 2625 (2003).
date_created: 2020-09-30T10:27:11Z
date_updated: 2022-01-06T06:54:12Z
department:
- _id: '63'
doi: 10.1007/3-540-36574-5_12
intvolume: '      2625'
language:
- iso: eng
publication: Algorithms for Memory Hierarchies
publication_identifier:
  isbn:
  - '9783540008835'
  - '9783540365747'
  issn:
  - 0302-9743
publication_status: published
status: public
title: Algorithmic Approaches for Storage Networks
type: journal_article
user_id: '15415'
volume: 2625
year: '2003'
...
---
_id: '19790'
abstract:
- lang: eng
  text: The advances in Internet technology have led to tremendous improvements in
    business, education, and science and have changed the way we think, live, and
    communicate. Information exchange has become ubiquitous by the possibilities offered
    through modern technologies. We are able to offer information 24 hours a day through
    our web sites and can leave messages every time and from anywhere in the world.
    This change in communication has led to new challenges. Enterprises have to deal
    with an information amount that doubles every year. The technological foundation
    to cope with this information explosion is given by Storage Area Networks (SANs),
    which are able to connect a great number of storage systems over a fast interconnection
    network. However, to be able to use the benefits of a SAN, an easy-to-use and
    efficient management support has to be given to the storage administrator. In
    this paper, we will suggest new storage management concepts and we will introduce
    a new management environment that is able to significantly reduce management costs
    and increases the performance and resource utilization of the given SAN infrastructure.
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Kay
  full_name: Salzwedel, Kay
  last_name: Salzwedel
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: André
  full_name: Brinkmann, André
  last_name: Brinkmann
- first_name: Mario
  full_name: Vodisek, Mario
  last_name: Vodisek
- first_name: Ulrich
  full_name: Rückert, Ulrich
  last_name: Rückert
citation:
  ama: 'Scheideler C, Salzwedel K, Meyer auf der Heide F, Brinkmann A, Vodisek M,
    Rückert U. Storage Management as Means to cope with Exponential Information Growth.
    In: <i>Proceedings of SSGRR 2003</i>. ; 2003.'
  apa: Scheideler, C., Salzwedel, K., Meyer auf der Heide, F., Brinkmann, A., Vodisek,
    M., &#38; Rückert, U. (2003). Storage Management as Means to cope with Exponential
    Information Growth. In <i>Proceedings of SSGRR 2003</i>.
  bibtex: '@inproceedings{Scheideler_Salzwedel_Meyer auf der Heide_Brinkmann_Vodisek_Rückert_2003,
    title={Storage Management as Means to cope with Exponential Information Growth},
    booktitle={Proceedings of SSGRR 2003}, author={Scheideler, Christian and Salzwedel,
    Kay and Meyer auf der Heide, Friedhelm and Brinkmann, André and Vodisek, Mario
    and Rückert, Ulrich}, year={2003} }'
  chicago: Scheideler, Christian, Kay Salzwedel, Friedhelm Meyer auf der Heide, André
    Brinkmann, Mario Vodisek, and Ulrich Rückert. “Storage Management as Means to
    Cope with Exponential Information Growth.” In <i>Proceedings of SSGRR 2003</i>,
    2003.
  ieee: C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek,
    and U. Rückert, “Storage Management as Means to cope with Exponential Information
    Growth,” in <i>Proceedings of SSGRR 2003</i>, 2003.
  mla: Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential
    Information Growth.” <i>Proceedings of SSGRR 2003</i>, 2003.
  short: 'C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek,
    U. Rückert, in: Proceedings of SSGRR 2003, 2003.'
date_created: 2020-09-30T12:04:14Z
date_updated: 2022-01-06T06:54:12Z
ddc:
- '000'
department:
- _id: '63'
- _id: '58'
- _id: '79'
file:
- access_level: closed
  content_type: application/pdf
  creator: koala
  date_created: 2020-09-30T12:03:57Z
  date_updated: 2020-09-30T12:03:57Z
  file_id: '19793'
  file_name: pub-hni-908.pdf
  file_size: 499057
  relation: main_file
  success: 1
file_date_updated: 2020-09-30T12:03:57Z
has_accepted_license: '1'
language:
- iso: eng
publication: Proceedings of SSGRR 2003
status: public
title: Storage Management as Means to cope with Exponential Information Growth
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '19806'
abstract:
- lang: eng
  text: We try to close the gap between theoretical investigations of wireless network
    topologies and realistic wireless environments. For point-to-point communication,
    we examine theoretically well-analyzed sparse graphs, i.e. the Yao-graph, the
    SparsY-graph, and the SymmY-graph.  We present distributed algorithms that can
    be used to build up these graphs in time $O(log n)$ per node without the use of
    any geo-graphical positioning system. Our algorithms are based only on local knowledge
    and local decisions and make use of power control to establish communication links
    with low energy-cost.  We compare these algorithms with respect to congestion,
    dilation, and energy. For congestion we introduce different measures that allow
    us to investigate the difference between real-world wireless networks and models
    for wireless communication at a high level of abstraction. For more realistic
    simulations we extend our simulation  environment SAHNE. We use a realistic transmission
    model for directed communication that uses sector subdivision.  Finally, our experimental
    results show that our topologies and algorithms work well in a distributed environment
    and we give some recommendations for the topology control based on our simulations.
author:
- first_name: Stefan
  full_name: Rührup, Stefan
  last_name: Rührup
- first_name: 'Christian '
  full_name: 'Schindelhauer, Christian '
  last_name: Schindelhauer
- first_name: Klaus
  full_name: Volbert, Klaus
  last_name: Volbert
- first_name: M.
  full_name: Grünewald, M.
  last_name: Grünewald
citation:
  ama: 'Rührup S, Schindelhauer C, Volbert K, Grünewald M. Performance of distributed
    algorithms for topology control in wireless networks. In: <i>Proceedings of the
    International Parallel and Distributed Processing Symposium (IPDPS)</i>. ; 2003.
    doi:<a href="https://doi.org/10.1109/ipdps.2003.1213107">10.1109/ipdps.2003.1213107</a>'
  apa: Rührup, S., Schindelhauer, C., Volbert, K., &#38; Grünewald, M. (2003). Performance
    of distributed algorithms for topology control in wireless networks. <i>Proceedings
    of the International Parallel and Distributed Processing Symposium (IPDPS)</i>.
    <a href="https://doi.org/10.1109/ipdps.2003.1213107">https://doi.org/10.1109/ipdps.2003.1213107</a>
  bibtex: '@inproceedings{Rührup_Schindelhauer_Volbert_Grünewald_2003, title={Performance
    of distributed algorithms for topology control in wireless networks}, DOI={<a
    href="https://doi.org/10.1109/ipdps.2003.1213107">10.1109/ipdps.2003.1213107</a>},
    booktitle={Proceedings of the International Parallel and Distributed Processing
    Symposium (IPDPS)}, author={Rührup, Stefan and Schindelhauer, Christian  and Volbert,
    Klaus and Grünewald, M.}, year={2003} }'
  chicago: Rührup, Stefan, Christian  Schindelhauer, Klaus Volbert, and M. Grünewald.
    “Performance of Distributed Algorithms for Topology Control in Wireless Networks.”
    In <i>Proceedings of the International Parallel and Distributed Processing Symposium
    (IPDPS)</i>, 2003. <a href="https://doi.org/10.1109/ipdps.2003.1213107">https://doi.org/10.1109/ipdps.2003.1213107</a>.
  ieee: 'S. Rührup, C. Schindelhauer, K. Volbert, and M. Grünewald, “Performance of
    distributed algorithms for topology control in wireless networks,” 2003, doi:
    <a href="https://doi.org/10.1109/ipdps.2003.1213107">10.1109/ipdps.2003.1213107</a>.'
  mla: Rührup, Stefan, et al. “Performance of Distributed Algorithms for Topology
    Control in Wireless Networks.” <i>Proceedings of the International Parallel and
    Distributed Processing Symposium (IPDPS)</i>, 2003, doi:<a href="https://doi.org/10.1109/ipdps.2003.1213107">10.1109/ipdps.2003.1213107</a>.
  short: 'S. Rührup, C. Schindelhauer, K. Volbert, M. Grünewald, in: Proceedings of
    the International Parallel and Distributed Processing Symposium (IPDPS), 2003.'
date_created: 2020-09-30T12:51:22Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
- _id: '58'
doi: 10.1109/ipdps.2003.1213107
language:
- iso: eng
publication: Proceedings of the International Parallel and Distributed Processing
  Symposium (IPDPS)
publication_identifier:
  isbn:
  - '0769519261'
publication_status: published
status: public
title: Performance of distributed algorithms for topology control in wireless networks
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '19828'
author:
- first_name: Peter
  full_name: Mahlmann, Peter
  last_name: Mahlmann
citation:
  ama: Mahlmann P. <i>Implementierung Und Vergleich von Verfahren Zum Information
    Retrieval Im World Wide Web</i>.; 2003.
  apa: Mahlmann, P. (2003). <i>Implementierung und Vergleich von Verfahren zum Information
    Retrieval im World Wide Web</i>.
  bibtex: '@book{Mahlmann_2003, title={Implementierung und Vergleich von Verfahren
    zum Information Retrieval im World Wide Web}, author={Mahlmann, Peter}, year={2003}
    }'
  chicago: Mahlmann, Peter. <i>Implementierung Und Vergleich von Verfahren Zum Information
    Retrieval Im World Wide Web</i>, 2003.
  ieee: P. Mahlmann, <i>Implementierung und Vergleich von Verfahren zum Information
    Retrieval im World Wide Web</i>. 2003.
  mla: Mahlmann, Peter. <i>Implementierung Und Vergleich von Verfahren Zum Information
    Retrieval Im World Wide Web</i>. 2003.
  short: P. Mahlmann, Implementierung Und Vergleich von Verfahren Zum Information
    Retrieval Im World Wide Web, 2003.
date_created: 2020-10-01T09:55:38Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
language:
- iso: eng
status: public
title: Implementierung und Vergleich von Verfahren zum Information Retrieval im World
  Wide Web
type: mastersthesis
user_id: '15415'
year: '2003'
...
---
_id: '19833'
abstract:
- lang: eng
  text: Communication facilities are important in Robotics if several robots have
    to work together. In this paper, we describe problems and solutions encountered
    while designing an infrared-based communication device for the mini robot Khepera.
    In contrast to traditional omnidirectional systems, it features directed, power-variable
    transmission in eight directions at unit[23.4]kbps up to a range of unit[1m].
    It can differentiate incoming data signals from interference from adjacent sectors
    and can estimate their direction-of-arrival. We model the transmission over the
    infrared channel and show how interference influences the reception of the data
    signals. We also describe methods how to reduce these effects. We have tested
    the performance of the resulted signal processing in a worst case scenario by
    simulations and in experiments with a prototype implementation. The resulted module
    is  especially suited for experimental evaluation of ad hoc network protocols
    and for position estimation.
author:
- first_name: Klaus
  full_name: Volbert, Klaus
  last_name: Volbert
- first_name: Matthias
  full_name: Grünewald, Matthias
  last_name: Grünewald
- first_name: Christian
  full_name: Schindelhauer, Christian
  last_name: Schindelhauer
- first_name: Ulrich
  full_name: Rückert, Ulrich
  last_name: Rückert
citation:
  ama: 'Volbert K, Grünewald M, Schindelhauer C, Rückert U. Directed power-variable
    infrared communication for the mini robot Khepera. In: <i>Proceedings of the 2nd
    International Conference on Autonomous Minirobots for Research and Edutainment</i>.
    ; 2003:113-122.'
  apa: Volbert, K., Grünewald, M., Schindelhauer, C., &#38; Rückert, U. (2003). Directed
    power-variable infrared communication for the mini robot Khepera. In <i>Proceedings
    of the 2nd International Conference on Autonomous Minirobots for Research and
    Edutainment</i> (pp. 113–122).
  bibtex: '@inproceedings{Volbert_Grünewald_Schindelhauer_Rückert_2003, title={Directed
    power-variable infrared communication for the mini robot Khepera}, booktitle={Proceedings
    of the 2nd International Conference on Autonomous Minirobots for Research and
    Edutainment}, author={Volbert, Klaus and Grünewald, Matthias and Schindelhauer,
    Christian and Rückert, Ulrich}, year={2003}, pages={113–122} }'
  chicago: Volbert, Klaus, Matthias Grünewald, Christian Schindelhauer, and Ulrich
    Rückert. “Directed Power-Variable Infrared Communication for the Mini Robot Khepera.”
    In <i>Proceedings of the 2nd International Conference on Autonomous Minirobots
    for Research and Edutainment</i>, 113–22, 2003.
  ieee: K. Volbert, M. Grünewald, C. Schindelhauer, and U. Rückert, “Directed power-variable
    infrared communication for the mini robot Khepera,” in <i>Proceedings of the 2nd
    International Conference on Autonomous Minirobots for Research and Edutainment</i>,
    2003, pp. 113–122.
  mla: Volbert, Klaus, et al. “Directed Power-Variable Infrared Communication for
    the Mini Robot Khepera.” <i>Proceedings of the 2nd International Conference on
    Autonomous Minirobots for Research and Edutainment</i>, 2003, pp. 113–22.
  short: 'K. Volbert, M. Grünewald, C. Schindelhauer, U. Rückert, in: Proceedings
    of the 2nd International Conference on Autonomous Minirobots for Research and
    Edutainment, 2003, pp. 113–122.'
date_created: 2020-10-01T11:20:47Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
- _id: '58'
language:
- iso: eng
page: 113-122
publication: Proceedings of the 2nd International Conference on Autonomous Minirobots
  for Research and Edutainment
status: public
title: Directed power-variable infrared communication for the mini robot Khepera
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '19874'
abstract:
- lang: eng
  text: We present a novel framework for hierarchical collision detection that can
    be applied to virtually all bounding volume (BV) hierarchies. It allows an application
    to trade quality for speed. Our algorithm yields an estimation of the quality,
    so that applications can specify the desired quality. In a timecritical system,
    applications can specify the maximum time budget instead, and quantitatively assess
    the quality of the results returned by the collision detection afterwards.
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. ADB-Trees: Controlling the Error of Time-Critical Collision
    Detection. In: <i>Proc. 8th International Fall Workshop Vision, Modeling, and
    Visualization (VMV 2003)</i>. ; 2003:37-45.'
  apa: 'Klein, J., &#38; Zachmann, G. (2003). ADB-Trees: Controlling the Error of
    Time-Critical Collision Detection. In <i>Proc. 8th International Fall Workshop
    Vision, Modeling, and Visualization (VMV 2003)</i> (pp. 37–45).'
  bibtex: '@inproceedings{Klein_Zachmann_2003, title={ADB-Trees: Controlling the Error
    of Time-Critical Collision Detection}, booktitle={Proc. 8th International Fall
    Workshop Vision, Modeling, and Visualization (VMV 2003)}, author={Klein, Jan and
    Zachmann, Gabriel}, year={2003}, pages={37–45} }'
  chicago: 'Klein, Jan, and Gabriel Zachmann. “ADB-Trees: Controlling the Error of
    Time-Critical Collision Detection.” In <i>Proc. 8th International Fall Workshop
    Vision, Modeling, and Visualization (VMV 2003)</i>, 37–45, 2003.'
  ieee: 'J. Klein and G. Zachmann, “ADB-Trees: Controlling the Error of Time-Critical
    Collision Detection,” in <i>Proc. 8th International Fall Workshop Vision, Modeling,
    and Visualization (VMV 2003)</i>, 2003, pp. 37–45.'
  mla: 'Klein, Jan, and Gabriel Zachmann. “ADB-Trees: Controlling the Error of Time-Critical
    Collision Detection.” <i>Proc. 8th International Fall Workshop Vision, Modeling,
    and Visualization (VMV 2003)</i>, 2003, pp. 37–45.'
  short: 'J. Klein, G. Zachmann, in: Proc. 8th International Fall Workshop Vision,
    Modeling, and Visualization (VMV 2003), 2003, pp. 37–45.'
date_created: 2020-10-05T10:30:07Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
language:
- iso: eng
page: 37-45
publication: Proc. 8th International Fall Workshop Vision, Modeling, and Visualization
  (VMV 2003)
status: public
title: 'ADB-Trees: Controlling the Error of Time-Critical Collision Detection'
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '19900'
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. Time-Critical Collision Detection Using an Average-Case
    Approach. In: <i> Proc. ACM Symposium on Virtual Reality Software and Technology
    (VRST 2003)</i>. ; 2003:22-31. doi:<a href="https://doi.org/10.1145/1008653.1008660">10.1145/1008653.1008660</a>'
  apa: Klein, J., &#38;  Zachmann, G. (2003). Time-Critical Collision Detection Using
    an Average-Case Approach. In <i> Proc. ACM Symposium on Virtual Reality Software
    and Technology (VRST 2003)</i> (pp. 22–31). <a href="https://doi.org/10.1145/1008653.1008660">https://doi.org/10.1145/1008653.1008660</a>
  bibtex: '@inproceedings{Klein_ Zachmann_2003, title={Time-Critical Collision Detection
    Using an Average-Case Approach}, DOI={<a href="https://doi.org/10.1145/1008653.1008660">10.1145/1008653.1008660</a>},
    booktitle={ Proc. ACM Symposium on Virtual Reality Software and Technology (VRST
    2003)}, author={Klein, Jan and  Zachmann, Gabriel}, year={2003}, pages={22–31}
    }'
  chicago: Klein, Jan, and Gabriel  Zachmann. “Time-Critical Collision Detection Using
    an Average-Case Approach.” In <i> Proc. ACM Symposium on Virtual Reality Software
    and Technology (VRST 2003)</i>, 22–31, 2003. <a href="https://doi.org/10.1145/1008653.1008660">https://doi.org/10.1145/1008653.1008660</a>.
  ieee: J. Klein and G.  Zachmann, “Time-Critical Collision Detection Using an Average-Case
    Approach,” in <i> Proc. ACM Symposium on Virtual Reality Software and Technology
    (VRST 2003)</i>, 2003, pp. 22–31.
  mla: Klein, Jan, and Gabriel  Zachmann. “Time-Critical Collision Detection Using
    an Average-Case Approach.” <i> Proc. ACM Symposium on Virtual Reality Software
    and Technology (VRST 2003)</i>, 2003, pp. 22–31, doi:<a href="https://doi.org/10.1145/1008653.1008660">10.1145/1008653.1008660</a>.
  short: 'J. Klein, G.  Zachmann, in:  Proc. ACM Symposium on Virtual Reality Software
    and Technology (VRST 2003), 2003, pp. 22–31.'
date_created: 2020-10-06T08:31:35Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
doi: 10.1145/1008653.1008660
language:
- iso: eng
page: 22-31
publication: ' Proc. ACM Symposium on Virtual Reality Software and Technology (VRST
  2003)'
status: public
title: Time-Critical Collision Detection Using an Average-Case Approach
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '19925'
abstract:
- lang: eng
  text: Februar 2003
author:
- first_name: Petra
  full_name: Büker, Petra
  id: '21978'
  last_name: Büker
citation:
  ama: 'Büker P. “Irgendwie anders?!” Ein Kinderbuchprojekt zur Förderung der Selbst-
    und Fremdwahrnehmung. Arbeitsgruppe im Rahmen des 3. Paderborner Grundschultages
    mit dem Thema: Interkulturell lernen-erziehen-bilden. Universität Paderborn. In:
    ; 2003.'
  apa: 'Büker, P. (2003). “Irgendwie anders?!” Ein Kinderbuchprojekt zur Förderung
    der Selbst- und Fremdwahrnehmung. Arbeitsgruppe im Rahmen des 3. Paderborner Grundschultages
    mit dem Thema: Interkulturell lernen-erziehen-bilden. Universität Paderborn.'
  bibtex: '@inproceedings{Büker_2003, title={“Irgendwie anders?!” Ein Kinderbuchprojekt
    zur Förderung der Selbst- und Fremdwahrnehmung. Arbeitsgruppe im Rahmen des 3.
    Paderborner Grundschultages mit dem Thema: Interkulturell lernen-erziehen-bilden.
    Universität Paderborn}, author={Büker, Petra}, year={2003} }'
  chicago: 'Büker, Petra. “‘Irgendwie anders?!’ Ein Kinderbuchprojekt zur Förderung
    der Selbst- und Fremdwahrnehmung. Arbeitsgruppe im Rahmen des 3. Paderborner Grundschultages
    mit dem Thema: Interkulturell lernen-erziehen-bilden. Universität Paderborn,”
    2003.'
  ieee: 'P. Büker, “‘Irgendwie anders?!’ Ein Kinderbuchprojekt zur Förderung der Selbst-
    und Fremdwahrnehmung. Arbeitsgruppe im Rahmen des 3. Paderborner Grundschultages
    mit dem Thema: Interkulturell lernen-erziehen-bilden. Universität Paderborn,”
    2003.'
  mla: 'Büker, Petra. <i>“Irgendwie anders?!” Ein Kinderbuchprojekt zur Förderung
    der Selbst- und Fremdwahrnehmung. Arbeitsgruppe im Rahmen des 3. Paderborner Grundschultages
    mit dem Thema: Interkulturell lernen-erziehen-bilden. Universität Paderborn</i>.
    2003.'
  short: 'P. Büker, in: 2003.'
date_created: 2020-10-06T11:36:22Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '458'
extern: '1'
language:
- iso: ger
status: public
title: '"Irgendwie anders?!" Ein Kinderbuchprojekt zur Förderung der Selbst- und Fremdwahrnehmung.
  Arbeitsgruppe im Rahmen des 3. Paderborner Grundschultages mit dem Thema: Interkulturell
  lernen-erziehen-bilden. Universität Paderborn'
type: conference
user_id: '21240'
year: '2003'
...
---
_id: '19952'
abstract:
- lang: eng
  text: Graph minors theory, developed by Robertson & Seymour, provides a list of
    powerful theoretical results and tools. However, the wide spread opinion in Graph
    Algorithms community about this theory is that it is mainly of theoretical importance.
    The main purpose of this paper is to show how very deep min-max and duality theorems
    from Graph Minors can be used to obtain essential speed-up to many known algorithms
    on different domination problems.
author:
- first_name: Fedor V.
  full_name: Fomin, Fedor V.
  last_name: Fomin
- first_name: Dimitrios M.
  full_name: Thilikos, Dimitrios M.
  last_name: Thilikos
citation:
  ama: 'Fomin FV, Thilikos DM. Dominating Sets in Planar Graphs: Branch-Width and
    Exponential Speed-Up. In: <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete
    Algorithms (SODA 2003)</i>. ; 2003. doi:<a href="https://doi.org/10.1137/s0097539702419649">10.1137/s0097539702419649</a>'
  apa: 'Fomin, F. V., &#38; Thilikos, D. M. (2003). Dominating Sets in Planar Graphs:
    Branch-Width and Exponential Speed-Up. In <i>Proceedings of the 14th ACM-SIAM
    Symposium on Discrete Algorithms (SODA 2003)</i>. <a href="https://doi.org/10.1137/s0097539702419649">https://doi.org/10.1137/s0097539702419649</a>'
  bibtex: '@inproceedings{Fomin_Thilikos_2003, title={Dominating Sets in Planar Graphs:
    Branch-Width and Exponential Speed-Up}, DOI={<a href="https://doi.org/10.1137/s0097539702419649">10.1137/s0097539702419649</a>},
    booktitle={Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA
    2003)}, author={Fomin, Fedor V. and Thilikos, Dimitrios M.}, year={2003} }'
  chicago: 'Fomin, Fedor V., and Dimitrios M. Thilikos. “Dominating Sets in Planar
    Graphs: Branch-Width and Exponential Speed-Up.” In <i>Proceedings of the 14th
    ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>, 2003. <a href="https://doi.org/10.1137/s0097539702419649">https://doi.org/10.1137/s0097539702419649</a>.'
  ieee: 'F. V. Fomin and D. M. Thilikos, “Dominating Sets in Planar Graphs: Branch-Width
    and Exponential Speed-Up,” in <i>Proceedings of the 14th ACM-SIAM Symposium on
    Discrete Algorithms (SODA 2003)</i>, 2003.'
  mla: 'Fomin, Fedor V., and Dimitrios M. Thilikos. “Dominating Sets in Planar Graphs:
    Branch-Width and Exponential Speed-Up.” <i>Proceedings of the 14th ACM-SIAM Symposium
    on Discrete Algorithms (SODA 2003)</i>, 2003, doi:<a href="https://doi.org/10.1137/s0097539702419649">10.1137/s0097539702419649</a>.'
  short: 'F.V. Fomin, D.M. Thilikos, in: Proceedings of the 14th ACM-SIAM Symposium
    on Discrete Algorithms (SODA 2003), 2003.'
date_created: 2020-10-08T10:31:48Z
date_updated: 2022-01-06T06:54:16Z
department:
- _id: '63'
doi: 10.1137/s0097539702419649
language:
- iso: eng
publication: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA
  2003)
publication_identifier:
  issn:
  - 0097-5397
  - 1095-7111
publication_status: published
status: public
title: 'Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up'
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '1998'
abstract:
- lang: eng
  text: "Nearly all existing HPC systems are operated by resource management systems
    based on the queuing approach. With the increasing acceptance of grid middleware
    like Globus, new requirements for the underlying local resource management systems
    arise. Features like advanced reservation or quality of service are needed to
    implement high level functions like co-allocation. However it is difficult to
    realize these features with a resource management system based on the queuing
    concept since it considers only the present resource usage.\r\n\r\nIn this paper
    we present an approach which closes this gap. By assigning start times to each
    resource request, a complete schedule is planned. Advanced reservations are now
    easily possible. Based on this planning approach functions like diffuse requests,
    automatic duration extension, or service level agreements are described. We think
    they are useful to increase the usability, acceptance and performance of HPC machines.
    In the second part of this paper we present a planning based resource management
    system which already covers some of the mentioned features."
author:
- first_name: Matthias
  full_name: Hovestadt, Matthias
  last_name: Hovestadt
- first_name: Odej
  full_name: Kao, Odej
  last_name: Kao
- first_name: Axel
  full_name: Keller, Axel
  id: '15274'
  last_name: Keller
- first_name: Achim
  full_name: Streit, Achim
  last_name: Streit
citation:
  ama: 'Hovestadt M, Kao O, Keller A, Streit A. Scheduling in HPC Resource Management
    Systems: Queuing vs. Planning. In: <i>Proc. Workshop on Job Scheduling Strategies
    for Parallel Processing (JSSPP)</i>. Vol 2862. Lecture Notes in Computer Science.
    Berlin / Heidelberg; 2003:1-20. doi:<a href="https://doi.org/10.1007/10968987_1">10.1007/10968987_1</a>'
  apa: 'Hovestadt, M., Kao, O., Keller, A., &#38; Streit, A. (2003). Scheduling in
    HPC Resource Management Systems: Queuing vs. Planning. In <i>Proc. Workshop on
    Job Scheduling Strategies for Parallel Processing (JSSPP)</i> (Vol. 2862, pp.
    1–20). Berlin / Heidelberg. <a href="https://doi.org/10.1007/10968987_1">https://doi.org/10.1007/10968987_1</a>'
  bibtex: '@inproceedings{Hovestadt_Kao_Keller_Streit_2003, place={Berlin / Heidelberg},
    series={Lecture Notes in Computer Science}, title={Scheduling in HPC Resource
    Management Systems: Queuing vs. Planning}, volume={2862}, DOI={<a href="https://doi.org/10.1007/10968987_1">10.1007/10968987_1</a>},
    booktitle={Proc. Workshop on Job Scheduling Strategies for Parallel Processing
    (JSSPP)}, author={Hovestadt, Matthias and Kao, Odej and Keller, Axel and Streit,
    Achim}, year={2003}, pages={1–20}, collection={Lecture Notes in Computer Science}
    }'
  chicago: 'Hovestadt, Matthias, Odej Kao, Axel Keller, and Achim Streit. “Scheduling
    in HPC Resource Management Systems: Queuing vs. Planning.” In <i>Proc. Workshop
    on Job Scheduling Strategies for Parallel Processing (JSSPP)</i>, 2862:1–20. Lecture
    Notes in Computer Science. Berlin / Heidelberg, 2003. <a href="https://doi.org/10.1007/10968987_1">https://doi.org/10.1007/10968987_1</a>.'
  ieee: 'M. Hovestadt, O. Kao, A. Keller, and A. Streit, “Scheduling in HPC Resource
    Management Systems: Queuing vs. Planning,” in <i>Proc. Workshop on Job Scheduling
    Strategies for Parallel Processing (JSSPP)</i>, 2003, vol. 2862, pp. 1–20.'
  mla: 'Hovestadt, Matthias, et al. “Scheduling in HPC Resource Management Systems:
    Queuing vs. Planning.” <i>Proc. Workshop on Job Scheduling Strategies for Parallel
    Processing (JSSPP)</i>, vol. 2862, 2003, pp. 1–20, doi:<a href="https://doi.org/10.1007/10968987_1">10.1007/10968987_1</a>.'
  short: 'M. Hovestadt, O. Kao, A. Keller, A. Streit, in: Proc. Workshop on Job Scheduling
    Strategies for Parallel Processing (JSSPP), Berlin / Heidelberg, 2003, pp. 1–20.'
date_created: 2018-03-29T11:37:24Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '27'
doi: 10.1007/10968987_1
intvolume: '      2862'
keyword:
- High Performance Computing
- Service Level Agreement
- Grid Resource
- Resource Management System
- Advance Reservation
language:
- iso: eng
page: 1-20
place: Berlin / Heidelberg
publication: Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP)
publication_status: published
series_title: Lecture Notes in Computer Science
status: public
title: 'Scheduling in HPC Resource Management Systems: Queuing vs. Planning'
type: conference
user_id: '15274'
volume: 2862
year: '2003'
...
