@misc{19509, author = {{Eke, Norbert Otto}}, booktitle = {{Germanistik}}, number = {{H. 1/2}}, pages = {{501}}, title = {{{Stefan Hulfeld: Theatergeschichtsschreibung als kulturelle Praxis. Wie Wissen über Theater entsteht. Zürich: Chronos, 2007}}}, volume = {{49}}, year = {{2008}}, } @misc{19510, author = {{Eke, Norbert Otto}}, booktitle = {{Germanistik}}, number = {{H. 1/2}}, pages = {{452f.}}, title = {{{Lisa Marie Küssner: Sprach-Bilder versus Theater-Bilder. Möglichkeiten eines szenischen Umgangs mit den „Bilderwelten“ von Werner Fritsch. Marburg: Tectum, 2006}}}, volume = {{49}}, year = {{2008}}, } @misc{19512, author = {{Eke, Norbert Otto}}, booktitle = {{Germanistik}}, number = {{H. 1/2}}, pages = {{511}}, title = {{{Stefanie Watzka: Verborgene Vermittler. Ansätze zu einer Historie der Theateragenten und -verleger. Marburg: Tectum, 2006}}}, volume = {{49}}, year = {{2008}}, } @misc{19517, author = {{Eke, Norbert Otto}}, booktitle = {{Übersetzen im Vormärz. Hg. von Bernd Kortländer und Hans T. Siepe (Forum Vormärz Forschung. Jahrbuch 2007)}}, pages = {{212--216}}, publisher = {{Aisthesis}}, title = {{{Olaf Briese: Angst in den Zeiten der Cholera. 4 Bde. Berlin: Akademie Verlag, 2003}}}, year = {{2008}}, } @phdthesis{19615, author = {{Schomaker, Gunnar}}, isbn = {{978-3-939350-78-1}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Distributed Resource Allocation and Management in Heterogeneous Networks}}}, volume = {{259}}, year = {{2008}}, } @inproceedings{19686, author = {{Briest, Patrick}}, booktitle = {{Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)}}, isbn = {{9783540705741}}, issn = {{0302-9743}}, title = {{{Uniform Budgets and the Envy-Free Pricing Problem}}}, doi = {{10.1007/978-3-540-70575-8_66}}, year = {{2008}}, } @inproceedings{19687, author = {{Briest, Patrick and Krysta, Piotr and Babaioff, Moshe}}, booktitle = {{Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT)}}, title = {{{On the Approximability of Combinatorial Exchange Problems}}}, doi = {{https://doi.org/10.1007/978-3-540-79309-0_9}}, year = {{2008}}, } @techreport{19688, abstract = {{We study the problem of computing approximate Nash equilibria (epsilon-Nash equilibria) in normal form games, where the number of players is a small constant. We consider the approach of looking for solutions with constant support size. It is known from recent work that in the 2-player case, a 1/2-Nash equilibrium can be easily found, but in general one cannot achieve a smaller value of epsilon than 1/2. In this paper we extend those results to the k-player case, and find that epsilon = 1-1/k is feasible, but cannot be improved upon. We show how stronger results for the 2-player case may be used in order to slightly improve upon the epsilon = 1-1/k obtained in the k-player case.}}, author = {{Briest, Patrick and Goldberg, Paul W. and Roeglin, Heiko}}, title = {{{Approximate Equilibria in Games with Few Players}}}, year = {{2008}}, } @inproceedings{1974, author = {{Battré, Dominic and Hovestadt, Matthias and Kao, Odej and Keller, Axel and Voss, Kerstin}}, booktitle = {{Proc. Int. Conf. on Risks and Security of Internet and Systems}}, title = {{{Quality Assurance of Grid Service Provisioning by Risk Aware Managing of Resource Failures}}}, year = {{2008}}, } @inproceedings{1975, abstract = {{Service Level Agreements (SLAs) have focal importance if the commercial customer should be attracted to the Grid. An SLA-aware resource management system has already been realize, able to fulfill the SLA of jobs even in the case of resource failures. For this, it is able to migrate checkpointed jobs over the Grid. At this, virtual execution environments allow to increase the number of potential migration targets significantly. In this paper we outline the concept of such virtual execution environments and focus on the SLA negotiation aspects.}}, author = {{Battré, Dominic and Hovestadt, Matthias and Kao, Odej and Keller, Axel and Voss, Kerstin}}, booktitle = {{Proc. Int. DMTF Academic Alliance Workshop on Systems and Virtualization Management: Standards and New Technologies}}, title = {{{Virtual Execution Environments and the Negotiation of Service Level Agreements in Grid Systems}}}, doi = {{10.1007/978-3-540-88708-9_1}}, year = {{2008}}, } @inproceedings{1976, abstract = {{Abstract: Commercial Grid users demand for contractually fixed QoS levels. Service Level Agreements (SLAs) are powerful instruments for describing such contracts. SLA-aware resource management is the foundation for realizing SLA contracts within the Grid. OpenCCS is such an SLA-aware RMS, using transparent checkpointing to cope with resource outages. It generates a compatibility profile for each checkpoint dataset, so that the job can be resumed even on resources within the Grid. However, only a small number of Grid resources comply to such a profile. This paper describes the concept of virtual execution environments and how they increase the number of potential migration targets.The paper also describes how these virtual execution environments have been implemented within the OpenCCS resource management system.}}, author = {{Battré, Dominic and Hovestadt, Matthias and Kao, Odej and Keller, Axel and Voss, Kerstin}}, booktitle = {{Proc. Int. Workshop on Scheduling and Resource Management for Parallel and Distributed Systems}}, title = {{{Implementation of Virtual Execution Environments for improving SLA-compliant Job Migration in Grids}}}, doi = {{10.1109/ICPP-W.2008.40}}, year = {{2008}}, } @article{1977, author = {{Krimphove, Dieter}}, journal = {{Kirche & Recht, Zeitschrift für die kirchliche und staatliche Praxis}}, number = {{Heft 1}}, pages = {{89 – 126}}, publisher = {{BWV Berliner Wissenschaftsverlag }}, title = {{{Europa und die Religionen}}}, year = {{2008}}, } @inproceedings{1978, author = {{Battré, Dominic and Hovestadt, Matthias and Kao, Odej and Keller, Axel and Voss, Kerstin}}, booktitle = {{Proc. Int. Conf. on Grid Computing and Applications (GCA)}}, title = {{{Germany, Belgium, France, and Back Again: Job Migration using Globus}}}, year = {{2008}}, } @article{1979, author = {{Krimphove, Dieter}}, journal = {{Contratto e impresa / Europea Pubblicazione semestrale }}, number = {{N. 1 Gennaio }}, pages = {{199 – 229}}, publisher = {{CEDAM}}, title = {{{Diritto bancario europeo e tecniche del legislatore comunitario}}}, year = {{2008}}, } @inproceedings{1980, abstract = {{OpenCCS is an SLA-aware resource management system which uses transparent checkpointing of applications and migration of checkpoint datasets for ensuring SLA-compliance also in case of resource outages. Migration of checkpoints presumes a high grade of compatibility between source and target resource. Hence, even in large Grid systems only a small number of resources are eligible migration targets. This short paper describes the concept of virtual execution environments and how they increase the number of potential migration targets. It will also outline an implementation within OpenCCS.}}, author = {{Battré, Dominic and Hovestadt, Matthias and Kao, Odej and Keller, Axel and Voss, Kerstin}}, booktitle = {{Proc. Int. Conf. on Services Computing (SCC)}}, title = {{{Virtual Execution Environments for ensuring SLA-compliant Job Migration in Grids}}}, doi = {{10.1109/SCC.2008.106}}, year = {{2008}}, } @inproceedings{1981, abstract = {{Contractually fixed service quality levels are mandatory prerequisites for attracting the commercial user to Grid environments. Service Level Agreements (SLAs) are powerful instruments for describing obligations and expectations in such a business relationship. At the level of local resource management systems, checkpointing and restart is an important instrument for realizing fault tolerance and SLA awareness. This paper highlights the concepts of migrating such checkpoint datasets to achieve the goal of SLA compliant job execution.}}, author = {{Battré, Dominic and Hovestadt, Matthias and Kao, Odej and Keller, Axel and Voss, Kerstin}}, booktitle = {{Proc. Int. Conf. on Grid and Pervasive Computing (GPC)}}, isbn = {{978-0-7695-3177-9}}, pages = {{43--48}}, title = {{{Job Migration and Fault Tolerance in SLA-aware Resource Management Systems}}}, doi = {{10.1109/GPC.WORKSHOPS.2008.71}}, year = {{2008}}, } @inproceedings{19812, abstract = {{Modern peer-to-peer networks consist of several network layers and distributed algorithms providing features like indexing, resource balancing, entry protocols, security, anonymity, and cryptography. Since peer-to-peer networks are highly dynamic, a fundamental task in the design of these networks is to provide high connectivity. We propose a solution by distributed random link exchange algorithms such that the overlay network can be a connected random graph or use a random graph as backbone. Random graphs are expander graphs have logarithmic diameter, high node connectivity, excellent communication properties, and are expander graphs with high probability. In summary: they are an excellent choice to improve the stability and robustness of a dynamic network.}}, author = {{Schindelhauer, Christian and Mahlmann, Peter}}, booktitle = {{The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop}}, number = {{222}}, pages = {{1--22}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Random Graphs for Peer-to-Peer Overlays}}}, year = {{2008}}, } @inproceedings{19813, abstract = {{Autonomous robotic systems have been gaining the attention of research community in mobile ad hoc network since the past few years. While motion cost and communications cost constitute the primary energy consumers, each of them is investigated independently. By taking into account the power consumption of both entities, the overall energy efficiency of a system can be further improved. In this paper, the energy optimization problem of radio communication and motion is examined. We consider a hybrid wireless network that consists of a single autonomous mobile node and multiple relay nodes. The mobile node interacts with the relays within its vicinity by continuously communicating high-bandwidth data, e.g. triggered by a multimedia application like video surveillance. The goal is to find the best path such that the energy consumption for both mobility and communications is minimized. We introduce the Radio-Energy-Aware (REA) path computation strategy by utilizing node mobility. Given the starting point, the target point and the position of the relays, our simulation results show that the proposed strategy improves the energy efficiency of mobile node compared to the Motion-Energy-Aware (MEA) path constructed based only on the mobility cost. }}, author = {{Ooi, Chia Ching and Schindelhauer, Christian}}, booktitle = {{MWCN'08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)}}, isbn = {{9780387848389}}, issn = {{1571-5736}}, publisher = {{Springer}}, title = {{{Detours Save Energy in Mobile Wireless Networks}}}, doi = {{10.1007/978-0-387-84839-6_6}}, year = {{2008}}, } @inproceedings{1983, author = {{Battré, Dominic and Hovestadt, Matthias and Kao, Odej and Keller, Axel and Voss, Kerstin}}, booktitle = {{Proc. Int. Conf. on Parallel and Distributed Computing and Systems (PDCS)}}, editor = {{Gonzalez, T. F.}}, isbn = {{978-0-88986-773-4}}, pages = {{212--218}}, title = {{{Enhancing SLA Provisioning by Utilizing Profit-Oriented Fault Tolerance}}}, year = {{2008}}, } @inproceedings{19832, author = {{Ooi, Chia Ching and Schindelhauer, Christian}}, booktitle = {{ARS'08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008)}}, isbn = {{9783642006432}}, title = {{{Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots}}}, doi = {{10.1007/978-3-642-00644-9_4}}, year = {{2008}}, }