@inproceedings{16621,
author = {Junge, O. and Marsden, J.E. and Ober-Blobaum, S.},
booktitle = {Proceedings of the 45th IEEE Conference on Decision and Control},
isbn = {1424401712},
title = {{Optimal Reconfiguration of Formation Flying Spacecraft ---a Decentralized Approach}},
doi = {10.1109/cdc.2006.376977},
year = {2006},
}
@techreport{17011,
author = {Dynia, Miroslaw and Kuhmlehn, Andreas and Kutylowski, Jaroslaw and Meyer auf der Heide, Friedhelm and Schindelhauer, Christian},
title = {{SmartS Simulator Design}},
year = {2006},
}
@inbook{17580,
author = {Peckhaus, Volker},
booktitle = {Revisiting Discovery and Justification. Historical and Philosophical Perspectives on the Context Distinction},
editor = {Schickore, Jutta and Steinle, Friedrich},
pages = {99--116},
publisher = {Springer},
title = {{Psychologismus and the Distinction Between Discovery and Justification}},
volume = {14},
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},
}
@inproceedings{17287,
author = {Muhl, Claudia and Wrede, Britta and Rohlfing, Katharina},
booktitle = {Proceedings of the Workshop on How people talk to computers, robots, and other artificial communication partners},
editor = {Fischer, Kerstin},
title = {{Factors influencing feedback}},
year = {2006},
}
@misc{18521,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 1073.01026]},
title = {{Husserl, Edmund, Philosophy of Arithmetik. Psychological and Logical Investigations with Supplementary Texts from 1887-1901, übers. u. hg. v. Dallas Willard, Kluwer: Dordrecht 2003 (Collected Works, Bd. 10)}},
year = {2006},
}
@misc{18545,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 1089.00005]},
title = {{Lacki, Jan, “Styles of Physical Thinking Versus Mathematical Ones”, Synthese 134 (2003), 273-288}},
year = {2006},
}
@misc{18552,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 1096.00001]},
title = {{Stöltzner, Michael, “On Optimism and Opportunism in Applied Mathematics. Mark Wilson meets John von Neumann on Mathematical Ontology”, Erkenntnis 69 (2004), 121–143}},
year = {2006},
}
@article{18672,
author = {Sohler, Christian and Czumaj, Artur},
journal = {EATCS Bulletin},
number = {89},
pages = {23----47},
title = {{Sublinear-time Algorithms}},
year = {2006},
}
@misc{18817,
author = {Peckhaus, Volker},
booktitle = {Mathematical Reviews [MR 2006d:03005; MathSciNet MR2143880]},
title = {{Ewald, William, “Hilbert’s Wide Program”, in: Logic Colloquium 2000, Association for Symbolic Logic: Urbana 2005 (Lect. Notes Logic; 19), 228–251}},
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},
}
@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},
}
@inbook{18603,
author = {Schindlmayr, Arno},
booktitle = {Computational Condensed Matter Physics},
editor = {Blügel, Stefan and Gompper, Gerhard and Koch, Erik and Müller-Krumbhaar, Heiner and Spatschek, Robert and Winkler, Roland G.},
isbn = {3-89336-430-7},
issn = {1433-5506},
location = {Jülich},
pages = {A4.1--A4.19},
publisher = {Forschungszentrum Jülich},
title = {{Time-dependent density-functional theory}},
volume = {32},
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},
}
@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},
}
@article{19699,
author = {Büker, Petra},
journal = {Praxis Deutsch },
pages = {16--22},
title = {{„Alles ist gut, so lange du wild bist!“ – Fußball, Abenteuer und starke Kids in Joachim Massaneks Wilden Fußballkerlen}},
volume = {33, H.196},
year = {2006},
}
@inproceedings{19808,
abstract = {We study the problem of designing an adaptive hash table for redundant data storage in a system of storage devices with arbitrary capacities. Ideally, such a hash table should make sure that (a) a storage device with x% of the available capacity should get x% of the data, (b) the copies of each data item are distributed among the storage devices so that no two copies are stored at the same device, and (c) only a near-minimum amount of data replacements is necessary to preserve (a) and (b) under any change in the system. Hash tables satisfying (a) and (c) are already known, and it is not difficult to construct hash tables satisfying (a) and (b). However, no hash table is known so far that can satisfy all three properties as long as this is in principle possible. We present a strategy called SPREAD that solves this problem for the first time. As long as (a) and (b) can in principle be satisfied, SPREAD preserves (a) for every storage device nearly optimal, with high probability, guarantees (b) for every data item, and only needs a constant factor more data replacements than minimum possible in order to preserve (a) and (b).},
author = {Mahlmann, Peter and Schindelhauer, Christian},
booktitle = {Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '06},
isbn = {1595934529},
pages = {308----317},
title = {{Distributed random digraph transformations for peer-to-peer networks}},
doi = {10.1145/1148109.1148162},
year = {2006},
}
@inproceedings{3327,
author = {Stein, Benno and Niggemann, Oliver and Lettmann, Theodor},
booktitle = {AIA '06: Proceedings of the 24th IASTED International Conference on Artificial Intelligence and Applications},
pages = {273----278},
title = {{Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT}},
year = {2006},
}
@inproceedings{19839,
abstract = {Storage Area Networks commonly consist a more or less static set of n data servers that handle a dynamic collection of m documents. Such SANs can minimize the access time to documents by distributing each document among several servers, allowing users to access documents in parallel. This paper describes an efficient solution for providing parallel access to multiple hard disks for popular content. In extension to previous approaches we provide an efficient and elegant hash table data structure for utilizing the full capacity of each data server. Concerning the dynamics, documents as well as server may be added or removed from the system causing only local changes. We consider sequential and parallel access to data in the average case. For the average time model we present a fast optimal algorithm.},
author = {Schindelhauer, C. and Schomaker, G.},
booktitle = {5th International Conference on Networking (ICN)},
isbn = {0769525520},
title = {{SAN Optimal Multi Parameter Access Scheme}},
doi = {10.1109/icniconsmcl.2006.190},
year = {2006},
}
@inproceedings{19923,
abstract = {November 2006},
author = {Büker, Petra},
title = {{Qualitative Unterrichtsforschung als Beitrag zur Professionalisierung ästhetischen Lernens und Lehrens – am Beispiel des interkulturell orientierten Literaturunterrichts in der Grundschule. Vortrag im Forschungskolleg „Ästhetisches Lernen“ am PLAZ. Universität Paderborn}},
year = {2006},
}