@article{1754, author = {{Christ, A. and Zentgraf, Thomas and Tikhodeev, S. G. and Gippius, N. A. and Kuhl, J. and Giessen, H.}}, issn = {{1098-0121}}, journal = {{Physical Review B}}, number = {{15}}, publisher = {{American Physical Society (APS)}}, title = {{{Controlling the interaction between localized and delocalized surface plasmon modes: Experiment and numerical calculations}}}, doi = {{10.1103/physrevb.74.155435}}, volume = {{74}}, year = {{2006}}, } @inproceedings{17619, author = {{Grünewald, Matthias and Meyer auf der Heide, Friedhelm and Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus}}, booktitle = {{New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf Symposium}}, pages = {{225--234}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts}}, title = {{{Directional Communication in Mobile Ad Hoc Networks}}}, year = {{2006}}, } @article{17847, author = {{Mindt, Ilka}}, journal = {{Zeitschrift für Anglistik und Amerikanistik 54.2, Special issue on "The scope and Limits of Corpus Linguistics – Empiricism in the Description and Analysis of English}}, pages = {{149 -- 162}}, title = {{{Distributional data and grammatical structures: The case of so- called subject extraposition}}}, year = {{2006}}, } @inproceedings{18676, abstract = {{We present random sampling algorithms that with probability at least 1 - δ compute a (1 ± ǫ)- approximation of the clustering coefficient, the transitiv ity coefficient, and of the number of bipartite cliques in a graph given as a stream of edges. Our methods can be extended to approximately count the number of occurences of fixed constant-size subgraphs. Our a lgorithms only require one pass over the input stream and their storage space depends only on structural parameters of the graphs, the approxi- mation guarantee, and the confidence probability. For examp le, the algorithms to compute the clustering and transitivity coefficient depend on that coefficient but n ot on the size of the graph. Since many large social networks have small clustering and transitivity coe fficient, our algorithms use space independent of the size of the input for these graphs. We implemented our algorithms and evaluated their performance on networks from different appli- cation domains. The sizes of the considered input graphs varied from about 8, 000 nodes and 40, 000 edges to about 135 million nodes and more than 1 billion edges. For both algorithms we run experiments with a sample set size varying from 100, 000 to 1, 000, 000 to evaluate running time and approximation guarantee. Our algorithms appear to be time efficient for the se sample sizes.}}, author = {{Sohler, Christian and Frahling, Gereon and Marchetti-Spaccamela, Alberto and Leonardi, Stefano and Buriol, Luciana}}, booktitle = {{Proceedings of the European Conference on Complex Systems (ECCS'06)}}, title = {{{Computing Clustering Coefficients in Data Streams}}}, year = {{2006}}, } @inproceedings{18745, author = {{Sohler, Christian and Frahling, Gereon and Marchetti-Spaccamela, Alberto and Leonardi, Stefano and Buriol, Luciana}}, title = {{{Counting Triangles in Data Streams}}}, year = {{2006}}, } @inproceedings{18746, abstract = {{In this paper, we present a randomized constant factor approximation algorithm for the metric minimum facility location problem with uniform costs and demands in a distributed setting, in which every point can open a facility. In particular, our distributed algorithm uses three communication rounds with message sizes bounded to O(log n) bits where n is the number of points. We also extend our algorithm to constant powers of metric spaces, where we also obtain a randomized constant factor approximation algorithm.}}, author = {{Sohler, Christian and Gehweiler, Joachim and Lammersen, Christiane}}, booktitle = {{Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, title = {{{A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem}}}, year = {{2006}}, } @book{18769, editor = {{Rüdiger, Axel and Seng, Eva- Maria}}, publisher = {{Duncker & Humblot}}, title = {{{Dimensionen der Politik: Aufklärung, Utopie, Demokratie. Festschrift für Richard Saage zum 65. Geburtstag}}}, year = {{2006}}, } @inproceedings{18926, author = {{Dynia, Miroslaw and Korzeniowski, Miroslaw and Schindelhauer, Christian}}, booktitle = {{Architecture of Computing Systems - ARCS}}, isbn = {{9783540327653}}, issn = {{0302-9743}}, number = {{3894}}, pages = {{341----351}}, title = {{{Power-Aware Collective Tree Exploration}}}, doi = {{10.1007/11682127_24}}, year = {{2006}}, } @phdthesis{18972, author = {{Damerow, Valentina}}, isbn = {{3-939350-09-5}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Average and Smoothed Complexity of Geometric Structures}}}, volume = {{190}}, year = {{2006}}, } @inproceedings{18999, abstract = {{We present a web computing library (PUBWCL) in Java that allows to execute tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed over the internet whose owners are willing to donate their unused computation power. PUBWCL is realized as a peer-to-peer system and features migration and restoration of BSP processes executed on it. The use of Java guarantees a high level of security and makes PUBWCL platform- independent. In order to estimate the loss of efficiency inherent in such a Java-based system, we have compared it to our C-based PUB-Library. As the unused computation power of the participating PCs is unpredictable, we need novel strategies for load balancing that have no access to future changes of the computation power available for the application. We develop, analyze, and compare different load balancing strategies for PUBWCL. In order to handle the influence of the fluctuating available computation power, we classify the external work load. During our evaluation of the load balancing algorithms we simulated the external work load in order to have repeatable testing conditions. With the best performing load balancing strategy we could save 39% of the execution time on average and even up to 50% in particular cases, in our test environment. }}, author = {{Bonorden, Olaf and Meyer auf der Heide, Friedhelm and Gehweiler, Joachim}}, booktitle = {{Journal on Scalable Computing: Practice and Experience}}, pages = {{1--14}}, title = {{{A Web Computing Environment for Parallel Algorithms in Java}}}, year = {{2006}}, } @inproceedings{19001, abstract = {{We present a novel architecture for distributed computing in a peer-to-peer network. In particular, we realize the Paderborn University BSP-based Web Computing Library (PUBWCL), which formerly used a centralized client-server architecture for scheduling and load balancing, as a pure peer-to-peer system. Using distributed heterogeneous hash tables (DHHT), our architecture features scheduling and load balancing of tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style with a minimal number of migrations. }}, author = {{Gehweiler, Joachim and Schomaker, Gunnar}}, booktitle = {{Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT)}}, isbn = {{0769526977}}, pages = {{51--58}}, title = {{{Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries}}}, doi = {{10.1109/ds-rt.2006.15}}, year = {{2006}}, } @book{19081, editor = {{Allkemper, Alo and Eke, Norbert Otto}}, pages = {{197}}, publisher = {{Erich Schmidt}}, title = {{{Das Gedächtnis der Literatur. Konstitutionsformen des Vergangenen in der Literatur des 20. Jahrhunderts}}}, year = {{2006}}, } @book{19082, editor = {{Eke, Norbert Otto and Steinecke, Hartmut}}, pages = {{344}}, publisher = {{Erich Schmidt}}, title = {{{Shoah in der deutschsprachigen Literatur}}}, year = {{2006}}, } @inbook{19141, author = {{Seng, Eva- Maria}}, booktitle = {{Dimensionen der Politik: Aufklärung, Utopie, Demokratie. Festschrift für Richard Saage zum 65. Geburtstag}}, editor = {{Rüdiger, Axel and Seng, Eva-Maria}}, pages = {{273--304}}, title = {{{Der Kult der Arbeit als Ausgangspunkt für das neue menschliche Gemeinwesen der Zukunft. Émile Zolas „Le Travail“: Ein Urbild des Städtebaus im 20. Jahrhundert}}}, year = {{2006}}, } @article{19339, author = {{Eke, Norbert Otto}}, journal = {{Zeitschrift für deutsche Philologie 125, Sonderheft: Das Gedächtnis der Literatur. Konstitutionsformen des Vergangenen in der Literatur des 20. Jahrhunderts}}, pages = {{64--81}}, publisher = {{Erich Schmidt, Berlin}}, title = {{{„Im Kopf die Toten verwesen nicht“. Werner Fritschs „Theater des Todes“}}}, year = {{2006}}, } @article{19340, author = {{Eke, Norbert Otto and Allkemper, Alo}}, journal = {{Zeitschrift für deutsche Philologie 125, Sonderheft: Das Gedächtnis der Literatur. Konstitutionsformen des Vergangenen in der Literatur des 20. Jahrhunderts}}, pages = {{2--4}}, publisher = {{Erich Schmidt, Berlin}}, title = {{{Das Gedächtnis der Literatur. Zur Einführung}}}, year = {{2006}}, } @inbook{19341, author = {{Eke, Norbert Otto}}, booktitle = {{Deutsche Kurzprosa der Gegenwart}}, editor = {{Bellmann, Werner and Hummel, Christine}}, pages = {{131--139}}, publisher = {{Reclam}}, title = {{{Thomas Brasch: Fliegen im Gesicht}}}, year = {{2006}}, } @inbook{19342, author = {{Eke, Norbert Otto}}, booktitle = {{Deutsche Kurzprosa der Gegenwart}}, editor = {{Bellmann, Werner and Hummel, Christine}}, pages = {{160--168}}, publisher = {{Reclam}}, title = {{{Herta Müller: Drückender Tango}}}, year = {{2006}}, } @inbook{19343, author = {{Eke, Norbert Otto}}, booktitle = {{Shoah in der deutschsprachigen Literatur}}, editor = {{Eke, Norbert Otto and Steinecke, Hartmut}}, pages = {{85--106}}, publisher = {{Erich Schmidt}}, title = {{{Konfigurationen der Shoah in der Literatur der DDR}}}, year = {{2006}}, } @inbook{19344, author = {{Eke, Norbert Otto}}, booktitle = {{Shoah in der deutschsprachigen Literatur}}, editor = {{Eke, Norbert Otto and Steinecke, Hartmut}}, pages = {{7--18}}, publisher = {{Erich Schmidt}}, title = {{{Shoah in der deutschsprachigen Literatur}}}, year = {{2006}}, }