@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 *d*-regular graph *G* to *G'* is equal to those from *G'* to *G*. From this and the reachability property we conclude that in the limit a series of Random 1-Flipper operations converges against an uniform probability distribution over all connected labeled *d*-regular graphs. For degree *d* ∈ ω(1) growing with the graph size this implies that iteratively applying Random 1-Flipper transforms any given graph into an expander asymptotically almost surely.
We use these operations as a maintenance operation for a peer-to-peer network based on random regular connected graphs that provides high robustness and recovers from degenerate network structures by continuously applying these random graph transformations. For this, we describe how network operations for joining and leaving the network can be designed and how the concurrency of the graph transformations can be handled.},
author = {Mahlmann, Peter and Schindelhauer, Christian},
booktitle = {Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures - SPAA'05},
isbn = {1581139861},
title = {{Peer-to-peer networks based on random transformations of connected regular undirected graphs}},
doi = {10.1145/1073970.1073992},
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},
}
@inproceedings{16885,
author = {Redmer, B. and Goetz, F. and Domik, Gitta},
location = {Aachen},
title = {{ARIDA - Eine Abstraktion von Eingabegeräten zur Verwendung in augmented Reality Anwendungen, Virtuelle und Erweiterte Realität}},
year = {2005},
}
@inproceedings{23323,
author = {Rustemeier, Carsten and Liu-Henke, Xiaobo and Goldau, Arne and Jäker, Karl-Peter},
booktitle = {6. VDI-Mechatronik-Tagung},
title = {{Simulationsumgebung zur Modellkopplung von Black-Box-Modellen mechatronischer Funktionsmodule und MKS-Fahrzeugmodellen}},
year = {2005},
}
@article{23316,
author = {Münch, Eckehard and Voecking, Henner and Hestermeyer, Thorsten},
journal = {International Conference on Informatics in Control, Automation and Robotics},
title = {{Self-Learning Disturbance Compensation for Active Suspension Systems}},
year = {2005},
}
@article{23328,
author = {Francisco, André},
journal = {VLSI 2005-IFIP},
title = {{Resource-Efficient FPGA-Based Priority Queues}},
year = {2005},
}