@article{1970, author = {{Krimphove, Dieter}}, journal = {{EuR Europarecht}}, number = {{Heft 5 (42. Jahrgang)}}, pages = {{597 – 621}}, publisher = {{Nomos Verlag}}, title = {{{Gesetzgebung im europäischen Bank- und Kapitalmarktrecht – eine ökonomisch-historische Betrachtung}}}, year = {{2007}}, } @inproceedings{19725, author = {{Bonorden, Olaf}}, booktitle = {{2007 IEEE International Parallel and Distributed Processing Symposium}}, isbn = {{1424409098}}, title = {{{Load Balancing in the Bulk-Synchronous-Parallel Setting using Process Migrations}}}, doi = {{10.1109/ipdps.2007.370330}}, year = {{2007}}, } @article{1973, author = {{Krimphove, Dieter}}, journal = {{KritV – Kritische Vierteljahreszeitschrift für Gesetzgebung und Rechtswissenschaft}}, number = {{Heft 4, Jg. 90}}, pages = {{425 – 442}}, publisher = {{Nomos Verlag}}, title = {{{Europäisierung des Bank- und Wertpapierstrafrechts }}}, year = {{2007}}, } @inproceedings{19809, abstract = {{For the first time, the problem of optimizing energy for communication and motion is investigated. We consider a single mobile robot with continuous high bandwidth wireless communication, e.g. caused by a multimedia application like video surveillance. This robot is connected to a radio base station and moves with constant speed from a given starting point on the plane to a target point. The task is to find the best path such that the energy consumption for mobility and the communication is optimized. This is motivated by the fact that the energy consumption of radio devices increases polynomially (at least to the power of two) with the transmission distance. We introduce efficient approximation algorithms finding the optimal path given the starting point, the target point and the position of the radio stations. We exemplify the influence of the communication cost by a starting scenario with one radio station. We study the performance of the proposed algorithm in simulation, compare it with the scenario without applying our approach, and present the results.}}, author = {{Ooi, Chia Ching and Schindelhauer, Christian}}, booktitle = {{ROBOCOMM'07: Proc. of the 1st International Conference on Robot Communication and Coordination}}, issn = {{1383-469X}}, pages = {{309--321}}, title = {{{Minimal Energy Path Planning for Wireless Robots}}}, doi = {{10.1007/s11036-008-0150-5}}, year = {{2007}}, } @inproceedings{19853, author = {{Schomaker, Gunnar}}, booktitle = {{Advanced Information Networking and Applications (AINA-07)}}, isbn = {{0769528465}}, issn = {{1550-445X}}, pages = {{331--339}}, title = {{{DHHT-RAID: A Distributed Heterogeneous Scalable Architecture for Dynamic Storage Environments}}}, doi = {{10.1109/aina.2007.59}}, volume = {{21}}, year = {{2007}}, } @inproceedings{1986, abstract = {{Service level agreements (SLAs) are powerful instruments for describing all obligations and expectations in a business relationship. It is of focal importance for deploying Grid technology to commercial applications. The EC-funded project HPC4U (Highly Predictable Clusters for Internet Grids) aimed at introducing SLA-awareness in local resource management systems, while the EC-funded project AssessGrid introduced the notion of risk, which is associated with every business contract. This paper highlights the concept of planning based resource management and describes the SLA-aware scheduler developed and used in these projects.}}, author = {{Battré, Dominic and Hovestadt, Matthias and Kao, Odej and Keller, Axel and Voss, Kerstin}}, booktitle = {{Proc. Workshop of the UK PLANNING AND SCHEDULING Special Interest Group (PlanSIG)}}, title = {{{Planning-based Scheduling for SLA-awareness and Grid Integration}}}, year = {{2007}}, } @inproceedings{1988, author = {{Battré, Dominic and Hovestadt, Matthias and Kao, Odej and Keller, Axel and Voss, Kerstin}}, booktitle = {{Proc. Cracow Grid Workshop, Academic Computer Center CYFRNET}}, pages = {{334--341}}, title = {{{Transparent Cross Border Migration of Parallel Multi Node Applications}}}, year = {{2007}}, } @inproceedings{19922, abstract = {{Dezember 2007}}, author = {{Büker, Petra}}, title = {{{Forschend-entdeckendes Lernen im neuen Lehrplan Sachunterricht. Eingangsreferat zur Fortbildungsveranstaltung: „Naturwissenschaftliches Experimentieren im neuen Forscherraum“ an der Kirchschule Hövelhof}}}, year = {{2007}}, } @article{2017, author = {{Bagchi, Amitabha and Chaudhary, Amitabh and Scheideler, Christian and Kolman, Petr}}, journal = {{SIAM J. Discrete Math.}}, number = {{1}}, pages = {{141----157}}, title = {{{Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks}}}, doi = {{10.1137/S0895480102419743}}, year = {{2007}}, } @inproceedings{2020, author = {{Onus, Melih and W. Richa, Andrea and Scheideler, Christian}}, booktitle = {{Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007}}, isbn = {{978-1-61197-287-0}}, title = {{{Linearization: Locally Self-Stabilizing Sorting in Graphs}}}, doi = {{10.1137/1.9781611972870.10}}, year = {{2007}}, } @inproceedings{2022, author = {{Awerbuch, Baruch and Scheideler, Christian}}, booktitle = {{6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007}}, title = {{{Towards Scalable and Robust Overlay Networks}}}, year = {{2007}}, } @inproceedings{2023, author = {{Awerbuch, Baruch and Scheideler, Christian}}, booktitle = {{Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007}}, isbn = {{978-1-59593-616-5}}, pages = {{370----371}}, publisher = {{ACM}}, title = {{{A denial-of-service resistant DHT}}}, doi = {{10.1145/1281100.1281178}}, year = {{2007}}, } @inproceedings{2024, author = {{Awerbuch, Baruch and Scheideler, Christian}}, booktitle = {{Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings}}, isbn = {{978-3-540-75141-0}}, pages = {{33----47}}, publisher = {{Springer}}, title = {{{A Denial-of-Service Resistant DHT}}}, doi = {{10.1007/978-3-540-75142-7_6}}, volume = {{4731}}, year = {{2007}}, } @proceedings{2025, editor = {{Aspnes, James and Scheideler, Christian and Arora, Anish and Madden, Samuel}}, isbn = {{978-3-540-73089-7}}, title = {{{Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings}}}, doi = {{10.1007/978-3-540-73090-3}}, volume = {{4549}}, year = {{2007}}, } @proceedings{2027, editor = {{B. Gibbons, Phillip and Scheideler, Christian}}, isbn = {{978-1-59593-667-7}}, publisher = {{ACM}}, title = {{{SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007}}}, year = {{2007}}, } @inbook{2028, author = {{W. Richa, Andrea and Scheideler, Christian}}, booktitle = {{Handbook of Approximation Algorithms and Metaheuristics.}}, isbn = {{978-1-58488-550-4}}, title = {{{Overlay Networks for Peer-to-Peer Networks}}}, doi = {{10.1201/9781420010749.ch72}}, year = {{2007}}, } @misc{28782, author = {{Müller, Mareike}}, booktitle = {{Electronic Journal of Foreign Language Teaching}}, number = {{2}}, pages = {{267--273}}, title = {{{Review of “studio d A1” and “Lagune 1” from a pronunciation perspective}}}, volume = {{4}}, year = {{2007}}, } @inproceedings{24276, abstract = {{We define a natural generalization of the prominent k-server problem, the k-resource problem. It occurs in metric spaces with some demands and resources given at its points. The demands may vary with time, but the total demand may never exceed k. The goal of an online algorithm is to satisfy demands by moving resources, while minimizing the cost for transporting resources. We give an asymptotically optimal O(log(min {n,k}))-competitive randomized algorithm and an O(min {k,n})-competitive deterministic one for the k-resource problem on uniform metric spaces consisting of n points. This extends known results for paging to the more general setting of k-resource. Basing on the results for uniform metric spaces, we develop a randomized algorithm solving the k-resource and the k-server problem on metric spaces which can be decomposed into components far away from each other. The algorithm achieves a competitive ratio of O(log(min {n,k})), provided that it has some extra resources more than the optimal algorithm. }}, author = {{Bienkowski, Marcin and Kutyłowski, Jarosław}}, booktitle = {{Lecture Notes in Computer Science}}, issn = {{0302-9743}}, title = {{{The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces}}}, doi = {{10.1007/978-3-540-73951-7_30}}, year = {{2007}}, } @book{24366, abstract = {{Dieses Buch beschäftigt sich mit Algorithmen und Methoden der Peer-to-Peer-Netzwerke und gibt einen Einblick in die aktuelle Forschung. Ursprünglich waren Peer-to-Peer-Netzwerke nur für File-Sharing konzipiert. Mittlerweile hat sich Peer-to-Peer zum Paradigma für Rechnernetzwerke entwickelt. Ziel dieses Buches ist es, dem Leser ein grundlegendes Verständnis der Techniken hinter den aktuellen Peer-to-Peer-Netzwerken aufzuzeigen und im nächsten Schritt Algorithmen vorzustellen, die vielleicht erst in einigen Jahren umgesetzt werden. Das Buch richtet sich in erster Linie an Informatiker (Studenten ab dem 5. Semester). Aber auch interessierte Nichtinformatiker können von diesem Buch profitieren, wobei grundlegende Kenntnisse aus den Bereichen der Mathematik und Informatik vorausgesetzt werden. Die Ziele, Kernaussagen und Ergebnisse sollten jedoch auch ohne akademischen Hintergrund klar werden.}}, author = {{Mahlmann, Peter and Schindelhauer, Christian}}, isbn = {{9783540339915}}, publisher = {{Springer}}, title = {{{Peer-to-Peer-Netzwerke}}}, doi = {{10.1007/978-3-540-33992-2}}, year = {{2007}}, } @article{25934, author = {{Günther, AL and Buyken, Anette and Kroke, A}}, issn = {{0002-9165}}, journal = {{Am J Clin Nutr}}, number = {{6}}, pages = {{1626--1633}}, title = {{{Protein intake during the period of complementary feeding and early childhood and the association with body mass index and percentage body fat at 7 y of age.}}}, doi = {{10.1093/ajcn/85.6.1626}}, volume = {{85}}, year = {{2007}}, }