@inbook{19263, author = {{Eke, Norbert Otto}}, booktitle = {{Poetologisch-poetische Interventionen: Gegenwartsliteratur schreiben}}, editor = {{Allkemper, Alo and Eke, Norbert Otto and Steinecke, Hartmut}}, pages = {{403--416}}, publisher = {{Fink}}, title = {{{Lea Singer: Nähe in der Distanz – Humilitas und Emphase}}}, year = {{2012}}, } @inbook{19264, author = {{Eke, Norbert Otto}}, booktitle = {{Doing Contemporary Literature. Praktiken, Wertungen, Automatismen}}, editor = {{Bierwirth, Maik and Johannsen, Anja and Zeman, Mirna}}, pages = {{23--40}}, publisher = {{Fink}}, title = {{{Beobachtungen beobachten. Beiläufiges aus germanistischer Sicht zum Umgang mit einer Literatur der Gegenwärtigkeit}}}, year = {{2012}}, } @inbook{19265, author = {{Eke, Norbert Otto}}, booktitle = {{Commitment and Compassion. Essays on Georg Büchner. Festschrift for Gerhard P. Knapp}}, pages = {{179--194}}, title = {{{“Komm Leonce, halte mir einen Monolog, ich will zuhören”. Büchners eingestandener Stillstand}}}, volume = {{81}}, year = {{2012}}, } @inbook{19266, author = {{Eke, Norbert Otto}}, booktitle = {{Politik und Ethik der Komik}}, editor = {{Kaul, Susanne and Kohns, Oliver}}, pages = {{55--68}}, publisher = {{Fink}}, title = {{{Schreckliche Witze – Geschmacklose Wahrheiten oder “Jeder wirkliche Humor ist schwarz”. George Tabori und der ‘schwarze Humor’}}}, year = {{2012}}, } @inbook{19267, author = {{Eke, Norbert Otto}}, booktitle = {{Handbuch Drama. Theorie, Analyse, Geschichte}}, editor = {{Marx, Peter W.}}, pages = {{310--322}}, publisher = {{Metzler}}, title = {{{Der Verlust der Gattungsmerkmale. Drama nach 1945}}}, year = {{2012}}, } @inbook{19268, author = {{Eke, Norbert Otto}}, booktitle = {{Fährmann sein. Robert Schindels Poetik des Übersetzens}}, editor = {{Hermann, Iris}}, pages = {{64--84}}, publisher = {{Wallstein}}, title = {{{“Ich hab mich schon in der Erd”. Robert Schindels Gegen-Sprechen}}}, year = {{2012}}, } @inbook{19269, author = {{Eke, Norbert Otto}}, booktitle = {{Georg Büchner und das 19. Jahrhundert}}, editor = {{Martin, Ariane and Stauffer, Isabelle}}, pages = {{11--28}}, publisher = {{Aisthesis}}, title = {{{Büchner und die Zeit}}}, year = {{2012}}, } @inbook{19270, author = {{Eke, Norbert Otto and Conradi, Tobias and Ecker, Gisela and Muhle, Florian}}, booktitle = {{Schemata und Praktiken}}, editor = {{Conradi, Tobias and Ecker, Gisela and Eke, Norbert Otto and Muhle, Florian}}, pages = {{9--13}}, publisher = {{Fink}}, title = {{{Schemata und Praktiken: Einleitung}}}, year = {{2012}}, } @book{22367, author = {{Lessmeier, Christian and Piantsop Mbo'o, Christelle and Coenen, Isabel and Zimmer, Detmar and Hameyer, Kay}}, isbn = {{978-3-941277-17-5}}, pages = {{509--521}}, publisher = {{Aachener Schriften zur Rohstoff- und Entsorgungstechnik des Instituts für Maschinentechnik der Rohstoffindustrie}}, title = {{{Untersuchung von Bauteilschäden elektrischer Antriebsstränge im Belastungsprüfstand mittels Statorstromanalyse}}}, volume = {{81}}, year = {{2012}}, } @inproceedings{22370, author = {{Hölscher, Christian and Zimmer, Detmar and Keßler, Jan Henning and Kruger, Martin and Trächtler, Ansgar}}, booktitle = {{IEEE International Conference on Industrial Informatics}}, isbn = {{978-1-467303-12-5}}, pages = {{1080--1085}}, publisher = {{Industrial Informatics (INDIN)}}, title = {{{Hierarchical optimization of coupled self-optimizing systems}}}, doi = {{10.1109/INDIN.2012.6301199}}, volume = {{10}}, year = {{2012}}, } @article{570, abstract = {{This article studies the construction of self-stabilizing topologies for distributed systems. While recent research has focused on chain topologies where nodes need to be linearized with respect to their identiers, we explore a natural and relevant 2-dimensional generalization. In particular, we present a local self-stabilizing algorithm DStab which is based on the concept of \local Delaunay graphs" and which forwards temporary edges in greedy fashion reminiscent of compass routing. DStab constructs a Delaunay graph from any initial connected topology and in a distributed manner in time O(n3) in the worst-case; if the initial network contains the Delaunay graph, the convergence time is only O(n) rounds. DStab also ensures that individual node joins and leaves aect a small part of the network only. Such self-stabilizing Delaunay networks have interesting applications and our construction gives insights into the necessary geometric reasoning that is required for higherdimensional linearization problems.Keywords: Distributed Algorithms, Topology Control, Social Networks}}, author = {{Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan}}, journal = {{Theoretical Computer Science}}, pages = {{137--148}}, publisher = {{Elsevier}}, title = {{{Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs}}}, doi = {{10.1016/j.tcs.2012.07.029}}, year = {{2012}}, } @article{574, abstract = {{We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph.Key words: Peer-to-peer networks, overlay networks, self-stabilization.}}, author = {{Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}}, journal = {{Theoretical Computer Science}}, pages = {{18--35}}, publisher = {{Elsevier}}, title = {{{Tiara: A self-stabilizing deterministic skip list and skip graph}}}, doi = {{10.1016/j.tcs.2011.12.079}}, year = {{2012}}, } @misc{575, author = {{Bremer, Lars}}, publisher = {{Universität Paderborn}}, title = {{{Symbiotic Coupling of Peer-to-Peer and Cloud Systems}}}, year = {{2012}}, } @proceedings{577, abstract = {{SSS is an international forum for researchers and practitioners in the design and development of distributed systems with self-properties: (classical) self-stabilizing, self-configuring, self-organizing, self-managing, self-repairing, self-healing, self-optimizing, self-adaptive, and self-protecting. Research in distributed systems is now at a crucialpoint in its evolution, marked by the importance of dynamic systems such as peer-to-peer networks, large-scale wireless sensor networks, mobile ad hoc networks, cloud computing, robotic networks, etc. Moreover, new applications such as grid and web services, banking and e-commerce, e-health and robotics, aerospace and avionics, automotive, industrial process control, etc. have joined the traditional applications of distributed systems. The theory of self-stabilization has been enriched in the last 30 years by high quality research contributions in the areas of algorithmic techniques, formal methodologies, model theoretic issues, and composition techniques. All these areas are essential to the understanding and maintenance of self-properties in fault-tolerant distributed systems.}}, editor = {{Richa, Andrea W. and Scheideler, Christian}}, location = {{Paderborn, Germany}}, title = {{{Stabilization, Safety, and Security of Distributed Systems}}}, doi = {{10.1007/978-3-642-33536-5}}, year = {{2012}}, } @article{579, abstract = {{A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number that is strictly larger than all preceding numbers. In this article we present a smoothed analysis of the number of left-to-right maxima in the presence of additive random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis of the smoothed height of binary search trees and the smoothed number of comparisons in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε + n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our results can also be applied to bound the smoothed number of points on a convex hull of points in the two-dimensional plane and to smoothed motion complexity, a concept we describe in this article. We bound how often one needs to update a data structure storing the smallest axis-aligned box enclosing a set of points moving in d-dimensional space.}}, author = {{Damerow, Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian and Tantau, Till}}, journal = {{Transactions on Algorithms}}, number = {{3}}, pages = {{30}}, publisher = {{ACM}}, title = {{{Smoothed analysis of left-to-right maxima with applications}}}, doi = {{10.1145/2229163.2229174}}, year = {{2012}}, } @misc{582, author = {{Strothmann, Thim Frederik}}, publisher = {{Universität Paderborn}}, title = {{{Self-Optimizing Binary Search Trees - A Game Theoretic Approach}}}, year = {{2012}}, } @misc{594, author = {{Klerx, Timo}}, publisher = {{Universität Paderborn}}, title = {{{Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen}}}, year = {{2012}}, } @misc{600, author = {{Feldkord, Björn}}, publisher = {{Universität Paderborn}}, title = {{{Lokale Swaps und überholte Informationen in Basic Network Creation Games}}}, year = {{2012}}, } @phdthesis{601, abstract = {{Wir betrachten eine Gruppe von mobilen, autonomen Robotern in einem ebenen Gel{\"a}nde. Es gibt keine zentrale Steuerung und die Roboter m{\"u}ssen sich selbst koordinieren. Zentrale Herausforderung dabei ist, dass jeder Roboter nur seine unmittelbare Nachbarschaft sieht und auch nur mit Robotern in seiner unmittelbaren Nachbarschaft kommunizieren kann. Daraus ergeben sich viele algorithmische Fragestellungen. In dieser Arbeit wird untersucht, unter welchen Voraussetzungen die Roboter sich auf einem Punkt versammeln bzw. eine Linie zwischen zwei festen Stationen bilden k{\"o}nnen. Daf{\"u}r werden mehrere Roboter-Strategien in verschiedenen Bewegungsmodellen vorgestellt. Diese Strategien werden auf ihre Effizienz hin untersucht. Es werden obere und untere Schranken f{\"u}r die ben{\"o}tigte Anzahl Runden und die Bewegungsdistanz gezeigt. In einigen F{\"a}llen wird außerdem die ben{\"o}tigte Bewegungsdistanz mit derjenigen Bewegungsdistanz verglichen, die eine optimale globale Strategie auf der gleichen Instanz ben{\"o}tigen w{\"u}rde. So werden kompetititve Faktoren hergeleitet.}}, author = {{Kempkes, Barbara}}, isbn = {{978-3-942647-21-2}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Local strategies for robot formation problems}}}, volume = {{302}}, year = {{2012}}, } @article{6055, author = {{Mehler, Alexander and Lücking, Andy and Menke, Peter}}, issn = {{0893-6080}}, journal = {{Neural Networks}}, pages = {{159--164}}, publisher = {{Elsevier BV}}, title = {{{Assessing cognitive alignment in different types of dialog by means of a network model}}}, doi = {{10.1016/j.neunet.2012.02.013}}, volume = {{32}}, year = {{2012}}, }