@misc{21222, author = {{Meschut, Gerson}}, pages = {{42--43}}, title = {{{„Wir wollen die Fügeprozesskosten ganzheitlich reduzieren“}}}, volume = {{128}}, year = {{2006}}, } @inproceedings{21223, author = {{Meschut, Gerson and Timm, M. and Draht, T.}}, location = {{Düsseldorf}}, title = {{{Mechanisches Fügen höherfester Stähle im Fahrzeugbau}}}, year = {{2006}}, } @proceedings{17417, abstract = {{We present a parallel algorithm for the rendering of complex three-dimensional scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting of a visualization-node, equipped with a powerful graphics adapter, and cluster nodes requiring weaker graphics capabilities only. The visualization-node renders a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes assist the visualization-node by asynchronous computing of Reliefboards, which are used to replace and render distant parts of the scene. Our algorithm is capable of gaining significant speedups if the cluster's nodes provide weak graphics adapters only. We trade the number of cluster nodes off the scene objects' image quality.}}, editor = {{Rammig, Franz-Josef and Dangelmaier, Wilhelm and Karl, Holger and Mertsching, Bärbel and Meyer auf der Heide, Friedhelm and Trächtler, Ansgar}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts}}, title = {{{Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems}}}, year = {{2006}}, } @book{17460, editor = {{Peckhaus, Volker and Löwe, Benedikt and Räsch, Thoralf}}, isbn = {{1-904987-29-X}}, pages = {{xiv + 282}}, publisher = {{College Publications}}, title = {{{Foundations of Formal Sciences IV. The History of the Concept of Formal Sciences}}}, volume = {{3}}, year = {{2006}}, } @book{17475, author = {{Monien, Burkhard and Meyer auf der Heide, Friedhelm}}, isbn = {{978-3-939350-00-2}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{New trends in parallel and distributed computing}}}, volume = {{181}}, year = {{2006}}, } @article{1749, author = {{Nau, D. and Bertram, R.P. and Buse, K. and Zentgraf, Thomas and Kuhl, J. and Tikhodeev, S.G. and Gippius, N.A. and Giessen, H.}}, issn = {{0946-2171}}, journal = {{Applied Physics B}}, number = {{4}}, pages = {{543--547}}, publisher = {{Springer Nature}}, title = {{{Optical switching in metallic photonic crystal slabs with photoaddressable polymers}}}, doi = {{10.1007/s00340-005-2103-z}}, volume = {{82}}, year = {{2006}}, } @article{1750, author = {{Zentgraf, Thomas and Christ, A. and Kuhl, J. and Gippius, N. A. and Tikhodeev, S. G. and Nau, D. and Giessen, H.}}, issn = {{1098-0121}}, journal = {{Physical Review B}}, number = {{11}}, publisher = {{American Physical Society (APS)}}, title = {{{Metallodielectric photonic crystal superlattices: Influence of periodic defects on transmission properties}}}, doi = {{10.1103/physrevb.73.115103}}, volume = {{73}}, year = {{2006}}, } @article{1751, author = {{Rockstuhl, C. and Zentgraf, Thomas and Guo, H. and Liu, N. and Etrich, C. and Loa, I. and Syassen, K. and Kuhl, J. and Lederer, F. and Giessen, H.}}, issn = {{0946-2171}}, journal = {{Applied Physics B}}, number = {{1-2}}, pages = {{219--227}}, publisher = {{Springer Nature}}, title = {{{Resonances of split-ring resonator metamaterials in the near infrared}}}, doi = {{10.1007/s00340-006-2205-2}}, volume = {{84}}, year = {{2006}}, } @article{1752, author = {{Nau, D. and Schönhardt, A. and Bauer, C. and Christ, A. and Zentgraf, Thomas and Kuhl, J. and Giessen, H.}}, issn = {{0370-1972}}, journal = {{physica status solidi (b)}}, number = {{10}}, pages = {{2331--2343}}, publisher = {{Wiley-Blackwell}}, title = {{{Disorder issues in metallic photonic crystals}}}, doi = {{10.1002/pssb.200668054}}, volume = {{243}}, year = {{2006}}, } @article{1753, author = {{Christ, A. and Zentgraf, Thomas and Tikhodeev, S. G. and Gippius, N. A. and Martin, O. J. F. and Kuhl, J. and Giessen, H.}}, issn = {{0370-1972}}, journal = {{physica status solidi (b)}}, number = {{10}}, pages = {{2344--2348}}, publisher = {{Wiley-Blackwell}}, title = {{{Interaction between localized and delocalized surface plasmon polariton modes in a metallic photonic crystal}}}, doi = {{10.1002/pssb.200668055}}, volume = {{243}}, year = {{2006}}, } @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}}, }