@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},
}
@phdthesis{19613,
author = {Rührup, Stefan},
isbn = {978-3-939350-22-4},
title = {{Position-based Routing Strategies}},
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},
}
@inproceedings{20951,
author = {Giese, Holger and Meyer, Matthias and Wagner, Robert},
booktitle = {Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany},
pages = {56--60},
publisher = {University of Paderborn},
title = {{A Prototype for Guideline Checking and Model Transformation in Matlab/Simulink}},
volume = {tr-ri-06-275},
year = {2006},
}
@inbook{21221,
author = {Meschut, Gerson},
booktitle = {Magnesium Technology},
editor = {Friedrich, Horst E. and Mordike, Barry Leslie},
isbn = {ISBN 3-540-20599-3},
pages = {374--397},
publisher = {Springerverlag},
title = {{Mechanical and Hybrid Joining}},
year = {2006},
}
@inproceedings{16878,
author = {Domik, Gitta},
location = {Vienna},
title = {{A Computer Graphics Curriculum at the University of Paderborn }},
year = {2006},
}
@article{23304,
author = {De Freitas Francisco, Andre L.},
journal = {36th Annual IEEE/IFIP International Conference on Dependable System and Networks},
title = {{Towards Dynamically Reconfigurable Hard-Real-Time Communication for Embedded Mechatronic Systems}},
year = {2006},
}
@article{23311,
author = {Bruns, Torsten and Münch, Eckehard},
journal = {6. Internationales Heinz Nixdorf Symposium},
title = {{Intersection Management as Self-Organisation of Mechatronic Systems}},
year = {2006},
}
@article{23309,
author = {Trächtler, Ansgar},
journal = {VDE Kongress},
title = {{Railcab - mit innovativer Mechatronik zum Schienenverkehrssystem der Zukunft}},
year = {2006},
}
@article{23296,
author = {Wielenberg, Andreas and Schäfer, Erika},
journal = {Konstruktion 3/2006},
pages = {67--70},
title = {{Reversible Flügelzellenpumpe für aktive Fahrwerkssysteme}},
year = {2006},
}
@article{23493,
author = {Golde, Daniel and Meier, Torsten and Koch, Stephan W.},
issn = {0740-3224},
journal = {Journal of the Optical Society of America B},
title = {{Microscopic analysis of extreme nonlinear optics in semiconductor nanostructures}},
doi = {10.1364/josab.23.002559},
year = {2006},
}
@inproceedings{11824,
abstract = {Soft-feature based speech recognition, which is an example of uncertainty decoding, has been proven to be a robust error mitigation method for distributed speech recognition over wireless channels exhibiting bit errors. In this paper we extend this concept to packet-oriented transmissions. The a posteriori probability density function of the lost feature vector, given the closest received neighbours, is computed. In the experiments, the nearest frame repetition, which is shown to be equivalent to the MAP estimate, outperforms the MMSE estimate for long bursts. Taking the variance into account at the speech recognition stage results in superior performance compared to classical schemes using point estimates. A computationally and memory efficient implementation of the proposed packet loss compensation scheme based on table lookup is presented},
author = {Ion, Valentin and Haeb-Umbach, Reinhold},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2006)},
keyword = {distributed speech recognition, least mean squares methods, MAP estimate, maximum likelihood estimation, MMSE estimate, packet loss compensation scheme, packet switched communication, posteriori probability density function, robust error mitigation method, soft-features, speech recognition, table lookup, voice communication, wireless channels},
pages = {I},
title = {{An Inexpensive Packet Loss Compensation Scheme for Distributed Speech Recognition Based on Soft-Features}},
doi = {10.1109/ICASSP.2006.1659984},
volume = {1},
year = {2006},
}
@article{13313,
author = {Herzog, Michael A. and Trier, Matthias and Sieck, Jürgen},
journal = {Proceedings of UNESCO International Centre for Engineering Education (UICEE) 10th Baltic Seminar on Engineering Education},
title = {{Production engineering for video based e- and m-learning content}},
year = {2006},
}