@inproceedings{19854,
  abstract     = {{In previous publications there have been several proposals<br>regarding replica generation and placement of movie content in<br>content-distribution-networks or P2P overlays. Within this paper<br>we extend approaches for heterogeneous placement scenarios<br>described in prior publications. Therefor we presume heterogeneous<br>server peers' bandwidth, HD capacity, and movie popularities.<br>Movie documents are replicated and placed onto server peers with<br>respect to the predicted popularity values. Thus each document<br>aims to gain fair networks resources according to its popularity.<br>We present simulation results of heuristics of different placement<br>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}},
}

@inproceedings{2403,
  author       = {{Hovestadt, Matthias and Kao, Odej and Voss, Kerstin}},
  booktitle    = {{Proc. Int. Conf. on Services Computing (SCC)}},
  isbn         = {{0-7695-2670-5}},
  pages        = {{36--43}},
  publisher    = {{IEEE Computer Society}},
  title        = {{{The First Step of Introducing Risk Management for Prepossessing SLAs}}},
  doi          = {{10.1109/SCC.2006.102}},
  year         = {{2006}},
}

@phdthesis{2404,
  abstract     = {{ In this thesis, we propose to use a reconfigurable processor as main computation element in embedded systems for applications from the multi-media and communications domain. A reconfigurable processor integrates an embedded CPU core with a Reconfigurable Processing Unit (RPU). Many of our target applications require real-time signal-processing of data streams and expose a high computational demand. The key challenge in designing embedded systems for these applications is to find an implementation that satisfies the performance goals and is adaptable to new applications, while the system cost is minimized. Implementations that solely use an embedded CPU are likely to miss the performance goals. Application-Specific Integrated Circuit (ASIC)-based coprocessors can be used for some high-volume products with fixed functions, but fall short for systems with varying applications. We argue that a reconfigurable processor with a coarse-grained, dynamically reconfigurable array of modest size provides an attractive implementation platform for our application domain. The computational intensive application kernels are executed on the RPU, while the remaining parts of the application are executed on the CPU. Reconfigurable hardware allows for implementing application specific coprocessors with a high performance, while the function of the coprocessor can still be adapted due to the programmability. So far, reconfigurable technology is used in embedded systems primarily with static configurations, e.g., for implementing glue-logic, replacing ASICs, and for implementing fixed-function coprocessors. Changing the configuration at runtime enables a number of interesting application modes, e.g., on-demand loading of coprocessors and time-multiplexed execution of coprocessors, which is commonly denoted as hardware virtualization. While the use of static configurations is well understood and supported by design-tools, the role of dynamic reconfiguration is not well investigated yet. Current application specification methods and design-tools do not provide an end-to-end tool-flow that considers dynamic reconfiguration. A key idea of our approach is to reduce system cost by keeping the size of the reconfigurable array small and to use hardware virtualization techniques to compensate for the limited hardware resources. The main contribution of this thesis is the codesign of a reconfigurable processor architecture named ZIPPY, the corresponding hardware and software implementation tools, and an application specification model which explicitly considers hardware virtualization. The ZIPPY architecture is widely parametrized and allows for specifying a whole family of processor architectures. The implementation tools are also parametrized and can target any architectural variant. We evaluate the performance of the architecture with a system-level, cycle-accurate cosimulation framework. This framework enables us to perform design-space exploration for a variety of reconfigurable processor architectures. With two case studies, we demonstrate, that hardware virtualization on the Zippy architecture is feasible and enables us to trade-off performance for area in embedded systems. Finally, we present a novel method for optimal temporal partitioning of sequential circuits, which is an important form of hardware virtualization. The method based on Slowdown and Retiming allows us to decompose any sequential circuit into a number of smaller, communicating subcircuits that can be executed on a dynamically reconfigurable architecture. }},
  author       = {{Plessl, Christian}},
  isbn         = {{978-3-8322-5561-3}},
  keywords     = {{Zippy}},
  publisher    = {{Shaker Verlag}},
  title        = {{{Hardware virtualization on a coarse-grained reconfigurable processor}}},
  doi          = {{10.2370/9783832255619}},
  year         = {{2006}},
}

@article{2405,
  author       = {{Groppe, Sven and Böttcher, Stefan and Birkenheuer, Georg and Höing, André}},
  journal      = {{Data & Knowledge Engineering}},
  number       = {{1}},
  pages        = {{64--110}},
  publisher    = {{Elsevier}},
  title        = {{{Reformulating XPath queries and XSLT queries on XSLT views}}},
  doi          = {{10.1016/j.datak.2005.04.002}},
  volume       = {{57}},
  year         = {{2006}},
}

@inproceedings{2406,
  author       = {{Voss, Kerstin}},
  booktitle    = {{Proc. Int. Conf. on Networking and Services (ICNS)}},
  isbn         = {{0-7695-2622-5}},
  pages        = {{68}},
  publisher    = {{IEEE Computer Society}},
  title        = {{{Risk Aware Migrations for Prepossessing SLAs}}},
  doi          = {{10.1109/ICNS.2006.94}},
  year         = {{2006}},
}

@inproceedings{2407,
  author       = {{Lietsch, Stefan and Zabel, Henning and Berssenbruegge, Jan and Wittenberg, Veit and Eikermann, Martin}},
  booktitle    = {{Proc. Int. Symp. on Visual Computing (ISVC)}},
  isbn         = {{3-540-48628-3}},
  pages        = {{343--353}},
  publisher    = {{Springer}},
  title        = {{{Light Simulation in a Distributed Driving Simulator}}},
  doi          = {{10.1007/11919476_35}},
  volume       = {{4291}},
  year         = {{2006}},
}

@inproceedings{2408,
  author       = {{Lerch, Nicolas and Nitsche, Holger and Voss, Kerstin and Hovestadt, Matthias}},
  booktitle    = {{Proc. Cracow Grid Workshop (CGW)}},
  pages        = {{216--223}},
  title        = {{{First Steps of a Monitoring Framework to Empower Risk Assessment on Grids}}},
  year         = {{2006}},
}

@inproceedings{2409,
  author       = {{Birkenheuer, Georg and Döhre, Sven and Hovestadt, Matthias and Kao, Odej and Voss, Kerstin}},
  booktitle    = {{Proc. Cracow Grid Workshop (CGW)}},
  title        = {{{On Similarities of Grid Resources for Identifying Potential Migration Targets}}},
  year         = {{2006}},
}

@inproceedings{2410,
  author       = {{Birkenheuer, Georg and Djemame, Karim and Gourlay, Iain and Kao, Odej and Padgett, James and Voß, Kerstin}},
  booktitle    = {{Proc. WS-Agreement Workshop (Open Grid Forum 18)}},
  title        = {{{Using WS-Agreement for Risk Management in the Grid}}},
  year         = {{2006}},
}

@inproceedings{24277,
  abstract     = {{We propose a dynamic, ad-hoc communication network consisting of mobile units that can warn about traffic jams on motorways.

Our goal is to provide a practical, low cost solution. Therefore we consider very simple wireless communication hardware, without collision detection, with very small bandwidth and a probabilistic model of link failure.

We provide a complete system architecture. For this purpose we design and analyze solutions for size approximation, leader election and broadcasting. Our algorithms are fine-tuned for fast operation in a practical setting. We provide both a theoretical and experimental evaluation of our solutions.

Our contribution is much different from the previous work, where either pure theoretical models with a pure theoretical analysis are provided or algorithms working in practical models are evaluated only through simulations.}},
  author       = {{Kutyłowski, Jarosław and Zagórski, Filip}},
  booktitle    = {{SOFSEM 2006: Theory and Practice of Computer Science}},
  issn         = {{0302-9743}},
  title        = {{{Reliable Broadcasting Without Collision Detection}}},
  doi          = {{10.1007/11611257_37}},
  year         = {{2006}},
}

@article{25932,
  author       = {{Buyken, Anette and Kellerhoff, Y and Hahn, S and Kroke, A and Remer, T}},
  issn         = {{0022-3166}},
  journal      = {{J Nutr}},
  number       = {{7}},
  pages        = {{1828--1833}},
  title        = {{{Urinary C-peptide excretion in free-living healthy children is related to dietary carbohydrate intake but not to the dietary glycemic index.}}},
  doi          = {{10.1093/jn/136.7.1828}},
  volume       = {{136}},
  year         = {{2006}},
}

@article{25933,
  author       = {{Karaolis-Danckert, N and Buyken, Anette and Bolzenius, K and Perim de Faria, C and Lentze, MJ and Kroke, A}},
  issn         = {{0002-9165}},
  journal      = {{Am J Clin Nutr}},
  number       = {{6}},
  pages        = {{1449--1455}},
  title        = {{{Rapid growth among term children whose birth weight was appropriate for gestational age has a longer lasting effect on body fat percentage than on body mass index.}}},
  doi          = {{10.1093/ajcn/84.6.1449}},
  volume       = {{84}},
  year         = {{2006}},
}