@inbook{1966, author = {{Krimphove, Dieter}}, booktitle = {{Finanzwirtschaft Finanzdienstleistungen Empirische Wirtschaftsforschung}}, editor = {{Schmeisser, Wilhelm and Zündorf, Horst and Eckstein, Peter and Krimphove, Dieter}}, pages = {{111 – 138}}, publisher = {{Rainer Hampp Verlag}}, title = {{{Rechtsfragen des Personalcontrollings – Eine Übersicht}}}, year = {{2006}}, } @inproceedings{19690, author = {{Briest, Patrick and Krysta, Piotr}}, booktitle = {{Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)}}, title = {{{Single-Minded Unlimited Supply Pricing on Sparse Instances}}}, year = {{2006}}, } @inproceedings{19691, author = {{Briest, Patrick and Gunia, Christian}}, booktitle = {{Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC)}}, title = {{{Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels}}}, year = {{2006}}, } @inbook{19697, author = {{Büker, Petra}}, booktitle = {{Literarische Kompetenzen – Standards im Literaturunterricht. Modelle für die Primar- und Sekundarstufe}}, editor = {{Kammler, Clemens}}, pages = {{24--49}}, publisher = {{Klett/Kallmeyer}}, title = {{{Qualitätssicherung ästhetischen Lernens durch prozessorientierte Evaluation. Zu Mascha Kaléko „Der Frühling“ (2./3. Schuljahr)}}}, year = {{2006}}, } @article{19698, author = {{Büker, Petra}}, journal = {{Beiträge Jugendliteratur und Medien }}, number = {{H. 2}}, pages = {{104--111}}, title = {{{Hier kommt Lola! Die unkonventionelle bikulturelle Familie in Isabel Abedis neuer Kinderbuchreihe}}}, volume = {{58, H. 2}}, year = {{2006}}, } @article{19699, author = {{Büker, Petra}}, journal = {{Praxis Deutsch }}, pages = {{16--22}}, title = {{{„Alles ist gut, so lange du wild bist!“ – Fußball, Abenteuer und starke Kids in Joachim Massaneks Wilden Fußballkerlen}}}, volume = {{33, H.196}}, year = {{2006}}, } @misc{19718, author = {{Degener, Bastian}}, title = {{{Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen}}}, year = {{2006}}, } @inproceedings{19808, abstract = {{We study the problem of designing an adaptive hash table for redundant data storage in a system of storage devices with arbitrary capacities. Ideally, such a hash table should make sure that (a) a storage device with x% of the available capacity should get x% of the data, (b) the copies of each data item are distributed among the storage devices so that no two copies are stored at the same device, and (c) only a near-minimum amount of data replacements is necessary to preserve (a) and (b) under any change in the system. Hash tables satisfying (a) and (c) are already known, and it is not difficult to construct hash tables satisfying (a) and (b). However, no hash table is known so far that can satisfy all three properties as long as this is in principle possible. We present a strategy called SPREAD that solves this problem for the first time. As long as (a) and (b) can in principle be satisfied, SPREAD preserves (a) for every storage device nearly optimal, with high probability, guarantees (b) for every data item, and only needs a constant factor more data replacements than minimum possible in order to preserve (a) and (b).}}, author = {{Mahlmann, Peter and Schindelhauer, Christian}}, booktitle = {{Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '06}}, isbn = {{1595934529}}, pages = {{308----317}}, title = {{{Distributed random digraph transformations for peer-to-peer networks}}}, doi = {{10.1145/1148109.1148162}}, year = {{2006}}, } @inproceedings{19838, author = {{Rührup, Stefan and Schindelhauer, Christian}}, booktitle = {{Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)}}, isbn = {{9783540496946}}, issn = {{0302-9743}}, title = {{{Online Multi-path Routing in a Maze}}}, doi = {{10.1007/11940128_65}}, year = {{2006}}, } @inproceedings{19839, abstract = {{Storage Area Networks commonly consist a more or less static set of n data servers that handle a dynamic collection of m documents. Such SANs can minimize the access time to documents by distributing each document among several servers, allowing users to access documents in parallel. This paper describes an efficient solution for providing parallel access to multiple hard disks for popular content. In extension to previous approaches we provide an efficient and elegant hash table data structure for utilizing the full capacity of each data server. Concerning the dynamics, documents as well as server may be added or removed from the system causing only local changes. We consider sequential and parallel access to data in the average case. For the average time model we present a fast optimal algorithm.}}, author = {{Schindelhauer, Christian and Schomaker, Gunnar}}, booktitle = {{5th International Conference on Networking (ICN)}}, isbn = {{0769525520}}, title = {{{SAN Optimal Multi Parameter Access Scheme}}}, doi = {{10.1109/icniconsmcl.2006.190}}, year = {{2006}}, } @techreport{19840, author = {{Rührup, Stefan and Schindelhauer, Christian}}, title = {{{Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks}}}, year = {{2006}}, } @inproceedings{19854, abstract = {{In previous publications there have been several proposals
regarding replica generation and placement of movie content in
content-distribution-networks or P2P overlays. Within this paper
we extend approaches for heterogeneous placement scenarios
described in prior publications. Therefor we presume heterogeneous
server peers' bandwidth, HD capacity, and movie popularities.
Movie documents are replicated and placed onto server peers with
respect to the predicted popularity values. Thus each document
aims to gain fair networks resources according to its popularity.
We present simulation results of heuristics of different placement
strategies and compare them with a near optimal technique.}}, author = {{Schomaker, Gunnar and Loeser, Christoph and Schubert, Matthias}}, booktitle = {{5th International Conference on Networking (ICN).}}, title = {{{Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks}}}, year = {{2006}}, } @inproceedings{19870, author = {{Brinkmann, Andre and Effert, Sascha and Heidebuer, Michael and Vodisek, Mario}}, booktitle = {{5th International Conference on Networking (ICN)}}, isbn = {{0769525520}}, title = {{{Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments}}}, doi = {{10.1109/icniconsmcl.2006.182}}, year = {{2006}}, } @inbook{1989, author = {{Heine, Felix and Hovestadt, Matthias and Kao, Odej and Keller, Axel}}, booktitle = {{Parallel Computing: Current and Future Issues of High End Computing}}, editor = {{Jouberta, Gerhard R. and Nagel, Wolfgang E. and Peters, Frans J. and Plata, Oscar and Tirado, Francisco and Zapata, Emilio L.}}, pages = {{113--120}}, title = {{{Provision of Fault Tolerance with Grid-enabled and SLA-aware Resource Management Systems}}}, year = {{2006}}, } @inbook{1991, abstract = {{In this paper, we describe the architecture of the virtual resource manager VRM, a management system designed to reside on top of local resource management systems for cluster computers and other kinds of resources. The most important feature of the VRM is its capability to handle quality-of-service (QoS) guarantees and service-level agreements (SLAs). The particular emphasis of the paper is on the various opportunities to deal with local autonomy for resource management systems not supporting SLAs. As local administrators may not want to hand over complete control to the Grid management, it is necessary to define strategies that deal with this issue. Local autonomy should be retained as much as possible while providing reliability and QoS guarantees for Grid applications, e.g., specified as SLAs.}}, author = {{Burchard, Lars-Olof and Heine, Felix and Heiss, Hans-Ulrich and Hovestadt, Matthias and Kao, Odej and Keller, Axel and Linnert, Barry and Schneider, Jörg}}, booktitle = {{Future Generation Grids}}, editor = {{Getov, Vladimir and Laforenza, Domenico and Reinefeld, Alexander}}, pages = {{83--98}}, title = {{{The Virtual Resource Manager: Local Autonomy versus QoS Guarantees for Grid Applications}}}, doi = {{10.1007/978-0-387-29445-2_5}}, year = {{2006}}, } @inproceedings{19923, abstract = {{November 2006}}, author = {{Büker, Petra}}, title = {{{Qualitative Unterrichtsforschung als Beitrag zur Professionalisierung ästhetischen Lernens und Lehrens – am Beispiel des interkulturell orientierten Literaturunterrichts in der Grundschule. Vortrag im Forschungskolleg „Ästhetisches Lernen“ am PLAZ. Universität Paderborn}}}, year = {{2006}}, } @inproceedings{19932, abstract = {{#hniid 2484}}, author = {{Kortenjan, Michael and Schomaker, Gunnar}}, booktitle = {{4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)}}, title = {{{Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes}}}, doi = {{10.1145/1108590.1108608}}, year = {{2006}}, } @article{2029, author = {{Kolman, Petr and Scheideler, Christian}}, journal = {{J. Algorithms}}, number = {{1}}, pages = {{20----44}}, title = {{{Improved bounds for the unsplittable flow problem}}}, doi = {{10.1016/j.jalgor.2004.07.006}}, volume = {{61}}, year = {{2006}}, } @article{28176, author = {{Bloh, Bea}}, title = {{{Die Schulformentscheidung aus Elternsicht. Eine Untersuchung der zur Ablehnung der Schulformempfehlung am Ende der Grundschulzeit}}}, year = {{2006}}, } @inproceedings{2402, author = {{Djemame, Karim and Gourlay, Iain and Padgett, James and Birkenheuer, Georg and Hovestadt, Matthias and Kao, Odej and Voss, Kerstin}}, booktitle = {{Proc. Int. Conf. on e-Science and Grid Computing}}, isbn = {{0-7695-2734-5}}, pages = {{28}}, publisher = {{IEEE Computer Society}}, title = {{{Introducing Risk Management into the Grid}}}, doi = {{10.1109/E-SCIENCE.2006.261112}}, year = {{2006}}, }