We introduce a theoretical online model to analyse these problems in theory using competitive analysis. For different cost measures addressed we invent the first competitive algorithms for online occlusion culling. Our implementation shows that these algorithms outperform known ones for real 3D scenes as well.}, author = {Frahling, Gereon and Krokowski, Jens}, booktitle = {Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)}, isbn = {9783540291183}, issn = {0302-9743}, pages = {758--769}, publisher = {Springer}, title = {{Online Occlusion Culling}}, doi = {10.1007/11561071_67}, volume = {3669}, year = {2005}, } @inproceedings{18925, abstract = {The dynamic page migration problem citedynamic-page-migration is defined in

a distributed network of $n$ mobile nodes sharing one indivisible memory page

of size $D$. During runtime, the nodes can both access a unit of data from

the page and move with a constant speed, thus changing the costs of communication.

The problem is to compute

to minimize the total communication cost.

In this paper we construct and analyze the first deterministic algorithm for this problem.

We prove that it achieves an (up to a constant factor) optimal competitive ratio

$O(n cdot sqrtD)$. We show that the randomization of this algorithm

improves this ratio to $O(sqrtD cdot log n)$ (against an oblivious adversary).

This substantially improves an $O(n cdot sqrtD)$ upper bound from citedynamic-page-migration.

We also give an almost matching lower bound of $Omega(sqrtD cdot sqrtlog n)$ for this problem.}, author = {Bienkowski, Marcin and Dynia, Miroslaw and Korzeniowski, Miroslaw}, booktitle = {Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)}, isbn = {9783540249986}, issn = {0302-9743}, pages = {365--376}, title = {{Improved Algorithms for Dynamic Page Migration}}, doi = {10.1007/978-3-540-31856-9_30}, year = {2005}, } @inbook{18608, author = {Schindlmayr, Arno}, booktitle = {Magnetism goes Nano}, editor = {Blügel, Stefan and Brückel, Thomas and Schneider, Claus Michael}, isbn = {3-89336-381-5}, issn = {1433-5506}, location = {Jülich}, pages = {D1.1--D1.20}, publisher = {Forschungszentrum Jülich}, title = {{Magnetic excitations}}, volume = {26}, year = {2005}, } @inbook{19346, author = {Eke, Norbert Otto}, booktitle = {Vormärz und Exil – Vormärz im Exil. Forum Vormärz Forschung. Jahrbuch 2004}, editor = {Eke, Norbert Otto and Wahrenburg, Fritz}, pages = {13--30}, publisher = {Aisthesis}, title = {{„Wie fern der Heimath! Mein Herz wie schwer!“ Vormärz und Exil – Vormärz im Exil}}, year = {2005}, } @misc{19531, author = {Eke, Norbert Otto}, booktitle = {IASLonline}, title = {{„Gesucht die Lücke im Ablauf“ – nicht gerichtete Utopiekonzepte. (zu: Corinna Mieth: Das Utopische in Literatur und Philosophie. Zur Ästhetik Heiner Müllers und Alexander Kluges. Tübingen: A. Francke 2003)}}, year = {2005}, } @misc{19529, author = {Eke, Norbert Otto}, booktitle = {IASLonline}, title = {{Totgesagte leben länger. (zu: Ingo Breuer: Theatralität und Gedächtnis. Deutschsprachiges Geschichtsdrama seit Brecht. Köln: Böhlau 2004)}}, year = {2005}, } @inproceedings{19827, abstract = {We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k+2 edges it interchanges the end vertices of the path. By definition this operation preserves regularity and connectivity. We show that every regular connected graph can be reached by a series of these operations for all k ¡Ý 1. We use a randomized version, called Random k-Flipper, in order to create random regular connected undirected graphs that may serve as a backbone for peer-to-peer networks. We prove for degree d¡Ê ¦¸(log n) that a series of O(dn) Random k-Flipper operations with k ∈ ¦¨(d2n2 log 1/¦Å) transforms any graph into an expander graph with high probability, i.e. 1-n-¦¨(1). The Random 1-Flipper is symmetric, i.e. the transformation probability from any labeled

The cell structure has two advantages for applying position-based routing: It helps to determine local minima for greedy forwarding and improves recovery from such minima, because for recovery all edges can be used in contrast to other topology-based rules that can be appliedonly on a planar subgraph.

For the analysis of position-based routing algorithms the measures time and traffic are based on the cell structure. The difficulty of exploring the network is expressed by the size of the barriers (i.e. the number of cells in the perimeters). Exploration can be done in parallel, but with increasing traffic. We propose a comparative measure to assess both time and traffic, the combined comparative ratio, which is the maximum of the ratio of routing time and optimal time and the ratio of the traffic and the minimum exploration costs.

While flooding and common single-path strategies have a linear ratio, we present a simple algorithm that has a sub-linear

combined comparative ratio of O(sqrt(h)), where h is the minimal hop distance between source and target.}, author = {Rührup, S. and Schindelhauer, C.}, booktitle = {19th IEEE International Parallel and Distributed Processing Symposium}, isbn = {0769523129}, pages = {248}, title = {{Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure}}, doi = {10.1109/ipdps.2005.147}, year = {2005}, } @inproceedings{19872, abstract = {Recent developments both in the business and the technological domain have led to a significant increase in demand for Business Intelligence (BI) infrastructures that can handle huge amounts of data in small time frames. BI applications are increasingly used by large user bases on all management levels; support tasks spanning the complete value chain are based on transactional data and are directly coupled with operational systems in closed loop approaches.

To effectively handle the resulting data volume turns out to be an extremely challenging task which encompasses a variety of issues on different levels. We propose an integrated multi layer tool for monitoring, benchmarking, analyzing, and optimizing the performance of such BI infrastructures.

Inside this paper we give a coarse outline of the tools architecture and demonstrate the value of distinct measurement points at operating system layer. For that purpose we introduce a kernel based benchmark environment and present first measurement results. The gathered data clearly indicates that a meaningful analysis of performance benchmarks without kernel trace points is of limited value - which shows the necessity to consider a separate component within the tools architecture.}, author = {Brinkmann, André and Effert, Sascha and Heidebuer, Michael and Vodisek, Mario and Baars, Henning}, booktitle = {In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os}, pages = {1--8}, title = {{An integrated Architecture for Business Intelligence support from Application down to Storage}}, year = {2005}, } @article{21219, author = {Meschut, Gerson}, issn = {ISSN 0947-9333}, journal = {Konstruktion}, pages = {92--93}, title = {{Mischbauweise sorgt für frischen Wind}}, volume = {04}, year = {2005}, }