@misc{18690, author = {{Seng, Eva- Maria}}, pages = {{425}}, publisher = {{masch.}}, title = {{{Stadt und Planung. Neue Ansätze im Städtebau des 16. und 17. Jahrhunderts}}}, year = {{2003}}, } @book{18694, abstract = {{Rezensionen (Auswahl) in: - FAZ Nr. 299 vom 24.12.2003, S. 32 von Arnold Bartetzky - Francia 31. Jg. Bd. 2, 2004 von Jean Pierre Kintz - Journal für Kunstgeschichte 8. Jg. 2004, Heft 2 von Ernst Seidl - Vierteljahresschrift für Sozial- und Wirtschaftsgeschichte Bd. 92, Heft 2 2005, S. 195f. von Kersten Krüger - Památky Archeologické XCV 2004 von Rudolf Prochàzka - Zeitschrift für Geschichtswissenschaft 52 Jg. 2004, Heft 2, S. 132-137 von Richard Saage - Zeitschrift für Kunstgeschichte Bd. 69, Heft 1 2006, S. 121f. von Bernd Roeck}}, author = {{Seng, Eva- Maria}}, pages = {{267 S. Text zzgl. Anhang und 124 Abb.}}, publisher = {{Deutscher Kunstverlag}}, title = {{{Stadt – Idee und Planung. Neue Ansätze im Städtebau des 16. und 17. Jahrhunderts}}}, year = {{2003}}, } @inproceedings{18791, abstract = {{We consider the problem of finding the weight of a Euclidean minimum spanning tree for a set of n points in ℝd. We focus on the situation when the input point set is supported by certain basic (and commonly used) geometric data structures that can provide efficient access to the input in a structured way. We present an algorithm that estimates with high probability the weight of a Euclidean minimum spanning tree of a set of points to within 1 + ε using only \~{O}(√ poly(1/ε)) queries for constant d. The algorithm assumes that the input is supported by a minimal bounding cube enclosing it, by orthogonal range queries, and by cone approximate nearest neighbors queries.}}, author = {{Magen, Avner and Ergun, Funda and Sohler, Christian and Rubinfeld, Ronitt and Czumaj, Artur and Newman, Ilan and Fortnow, Lance}}, booktitle = {{Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)}}, isbn = {{0898715385}}, pages = {{813–822}}, title = {{{Sublinear Approximation of Euclidean Minimum Spanning Tree}}}, year = {{2003}}, } @book{18836, editor = {{Büker, Petra and Kammler, Clemens}}, publisher = {{Juventa}}, title = {{{Das Fremde und das Andere – Interpretationen und didaktische Analysen zeitgenössischer Kinder- und Jugendbücher}}}, year = {{2003}}, } @inproceedings{18907, abstract = {{In a (randomized) oblivious routing scheme the path chosen for a request
between a source $s$ and a target $t$ is independent from the current traffic
in the network. Hence, such a scheme consists of probability distributions
over $s-t$ paths for every source-target pair $s,t$ in the network.

In a recent result citeR02 it was shown that for any undirected network
there is an oblivious routing scheme that achieves a polylogarithmic
competitive ratio with respect to congestion. Subsequently, Azar et
al. citeACF+03 gave a polynomial time algorithm that for a given network
constructs the best oblivious routing scheme, i.e. the scheme that guarantees
the best possible competitive ratio.
Unfortunately, the latter result is based on the Ellipsoid algorithm; hence
it is unpractical for large networks.

In this paper we present a combinatorial algorithm for constructing an
oblivious routing scheme that guarantees a competitive ratio of $O(log^4n)$
for undirected networks. Furthermore, our approach yields a proof
for the existence of an oblivious routing scheme with competitive ratio
$O(log^3n)$, which is much simpler than the original proof from citeR02.}}, author = {{Bienkowski, Marcin and Korzeniowski, Miroslaw and Räcke, Harald}}, booktitle = {{Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '03}}, isbn = {{1581136617}}, title = {{{A practical algorithm for constructing oblivious routing schemes}}}, doi = {{10.1145/777412.777418}}, year = {{2003}}, } @inproceedings{18947, abstract = {{In this paper, we define a Petri net model for the network or routing layer of a mobile ad hoc network. Such networks require routing strategies substantially different from those used in static communication networks. The model pre- sented consists of two layers, a location service and a po- sition based routing. Both are described in detail. Our ap- proach considers a very strong definition of fault tolerance thereby improving state-of-the-art ad hoc routing protocols in several respects. Modeling of the communication archi- tecture for mobile ad hoc networks is part of our overall effort towards a design methodology for distributed embed- ded real-time systems including dynamically evolving com- ponents.}}, author = {{Rust, Carsten and Stappert, Friedhelm and Lukovszki, Tamás}}, booktitle = {{7th World Multiconference on Systemics, Cybernetics and Informatics}}, title = {{{A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture}}}, year = {{2003}}, } @inproceedings{18960, abstract = {{We investigate distributed algorithms for mobile ad hoc networks for moving radio stations with adjustable transmission power in a worst case scenario. We consider two models to find a reasonable restriction on the worst-case mobility. In the pedestrian model we assume a maximum speed $v_max$ of the radio stations, while in the vehicular model we assume a maximum acceleration $a_max$ of the points. Our goal is to maintain persistent routes with nice communication network properties like hop-distance, energy-consumption, congestion and number of interferences. A route is persistent, if we can guarantee that all edges of this route can be uphold for a given time span $Delta$, which is a parameter denoting the minimum time the mobile network needs to adopt changes, i.e. update routing tables, change directory entries, etc. This $Delta$ can be used as the length of an update interval for a proactive routing scheme. We extend some known notions such as transmission range, interferences, spanner, power spanner and congestion to both mobility models and introduce a new parameter called crowdedness that states a lower bound on the number of radio interferences. Then we prove that a mobile spanner hosts a path system that polylogarithmically approximates the optimal congestion. We present distributed algorithms based on a grid clustering technique and a high-dimensional representation of the dynamical start situation which construct mobile spanners with low congestion, low interference number, low energy-consumption, and low degree. We measure the optimality of the output of our algorithm by comparing it with the optimal choice of persistent routes under the same circumstances with respect to pedestrian or vehicular worst-case movements. Finally, we present solutions for dynamic position information management under our mobility models.}}, author = {{Schindelhauer, Christian and Lukovszki, Tamás and Rührup, Stefan and Volbert, Klaus}}, booktitle = {{Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)}}, isbn = {{1581136617}}, title = {{{Worst case mobility in ad hoc networks}}}, doi = {{10.1145/777412.777448}}, year = {{2003}}, } @inproceedings{18966, abstract = {{A recent seminal result of Räcke is that for any undirected network there is an oblivious routing algorithm with a polylogarithmic competitive ratio with respect to congestion. Unfortunately, Räcke's construction is not polynomial time. We give a polynomial time construction that guarantees Räcke's bounds, and more generally gives the true optimal ratio for any (undirected or directed) network.}}, author = {{Azar, Yossi and Cohen, Edith and Fiat, Amos and Kaplan, Haim and Racke, Harald}}, booktitle = {{Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03}}, isbn = {{1581136749}}, title = {{{Optimal oblivious routing in polynomial time}}}, doi = {{10.1145/780542.780599}}, year = {{2003}}, } @misc{18982, abstract = {{In dieser Studienarbeit wurde ein System entworfen und implementiert, das der Ausführung paralleler Algorithmen nach dem Bulk-Synchronous Parallel (BSP)-Modell dient. Von der Paderborn University BSP Library (PUB) unterscheidet es sich dadurch, dass es vom Einsatzgebiet her nicht für Parallelrechner konzipiert ist, sondern vielmehr für eine Ansammlung von PCs und Workstations, die über das gesamte Internet verteilt sind.
Gegenüber anderen bekannten Web-Computing Projekten wie z.B. SETI@home oder distributed.net zeichnet sich dieses System dadurch aus, dass nicht Clients von einem zentralen Server "häppchenweise" unabhängige Teilprobleme anfordern und lösen, sondern dass die Clients gemeinsam an einem Problem arbeiten, indem sie nach dem BSP-Modell miteinander kommunizieren und sich synchronisieren.}}, author = {{Gehweiler, Joachim}}, title = {{{Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java}}}, year = {{2003}}, } @inproceedings{1913, author = {{Fu, X. and Chen, T. and Festag, A. and Karl, Holger and Schäfer, G. and Fan, C.}}, booktitle = {{Proceedings IP Based Cellular Network Conference IPCN, Paris / France, Dezember }}, title = {{{Secure, QoS-Enabled Mobility Support for IP-based Networks}}}, year = {{2003}}, } @inproceedings{1914, author = {{Geerdes, Hans-Florian and Karl, Holger}}, booktitle = {{Proceedings of INOC 2003, Evry/Paris}}, title = {{{The Potential of Relaying in Cellular Networks }}}, year = {{2003}}, } @inbook{19144, author = {{Seng, Eva- Maria}}, booktitle = {{Denkfalle Zeitgeist. Eine Ermutigung zu Maß und Mitte in 40 Essays}}, editor = {{Wintzek, Bernhard C.}}, pages = {{325--336}}, title = {{{“Vom Kristallpalast zum gläsernen Menschen“}}}, year = {{2003}}, } @inproceedings{1917, author = {{Aguiar, Ana and Hoene, Christian and Klaue, Jirka and Karl, Holger and Miesmer, Horst and Wolisz, Adam}}, booktitle = {{Proc. of 8th Intl. Workshop on Mobile Multimedia Communications (MoMuC'03)}}, title = {{{Channel-aware Schedulers for VoIP and MPEG4 based on Channel Prediction}}}, year = {{2003}}, } @inbook{19350, abstract = {{Angaben zur Herausgeberschaft und zur Mitarbeit: Hg. von Hans-Thies Lehmann und Patrick Primavesi. Mitarbeit: Olaf Schmitt.}}, author = {{Eke, Norbert Otto}}, booktitle = {{Heiner Müller Handbuch. Leben – Werk – Wirkung}}, editor = {{Lehmann, Hans-Thies and Primavesi, Patrick and Schmitt, Olaf}}, pages = {{52--58}}, publisher = {{Metzler}}, title = {{{Geschichte und Gedächtnis im Drama}}}, year = {{2003}}, } @inbook{19351, abstract = {{Angaben zur Herausgeberschaft und zur Mitarbeit: Hg. von Hans-Thies Lehmann und Patrick Primavesi. Mitarbeit: Olaf Schmitt.}}, author = {{Eke, Norbert Otto}}, booktitle = {{Heiner Müller Handbuch. Leben – Werk – Wirkung}}, editor = {{Lehmann, Hans-Thies and Primavesi, Patrick and Schmitt, Olaf}}, pages = {{1--9}}, publisher = {{Metzler}}, title = {{{[Heiner Müller:] Frühe Biographie/Prägungen}}}, year = {{2003}}, } @inbook{19352, author = {{Eke, Norbert Otto}}, booktitle = {{Theater als Paradigma der Moderne? Positionen zwischen historischer Avantgarde und Medienzeitalter}}, editor = {{Balme, Christopher and Fischer-Lichte, Erika and Grätzel, Stephan}}, pages = {{243--255}}, publisher = {{Francke}}, title = {{{Text und/im Theater. Entgrenzungsstrategien im Drama der DDR-Dramatik seit den 70er Jahren. Eine Erinnerung und ein Plädoyer für einen Wechsel der Forschungsperspektive}}}, volume = {{28}}, year = {{2003}}, } @inbook{19354, author = {{Eke, Norbert Otto}}, booktitle = {{Romantik und Vormärz. Zur Archäologie literarischer Kommunikation in der ersten Hälfte des 19. Jahrhunderts}}, editor = {{Bunzel, Wolfgang and Stein, Peter and Vaßen, Florian}}, pages = {{163--183}}, publisher = {{Aisthesis}}, title = {{{Moderne Zeit(en). Der Kampf um die Zeit in Romantik und Vormärz}}}, year = {{2003}}, } @inbook{19355, author = {{Eke, Norbert Otto}}, booktitle = {{Der Dramatiker und Erzähler Hartmut Lange}}, editor = {{Durzak, Manfred}}, pages = {{90--114}}, publisher = {{Königshausen & Neumann}}, title = {{{„Optima philosophia mortis meditatio“ oder Der Weg des Dramatikers Hartmut Lange von der Geschichtsdialektik zur Endlichkeitsphilosophie}}}, year = {{2003}}, } @inbook{19356, author = {{Eke, Norbert Otto}}, booktitle = {{Holocaust Literature. An Encyclopedia of Writers and Their Work}}, editor = {{Kremer, Lillian}}, pages = {{155--158}}, publisher = {{Routledge}}, title = {{{Maxim Biller [and the Shoah]}}}, year = {{2003}}, } @inbook{19357, author = {{Eke, Norbert Otto}}, booktitle = {{Holocaust Literature. An Encyclopedia of Writers and Their Work}}, editor = {{Kremer, Lillian}}, pages = {{554--558}}, publisher = {{Routledge}}, title = {{{Edgar Hilsenrath [and the Shoah]}}}, volume = {{1}}, year = {{2003}}, }