@inbook{19245, author = {{Eke, Norbert Otto}}, booktitle = {{„Zuckererbsen für Jedermann“. Literatur und Utopie. Heine und Bloch heute}}, editor = {{Eke, Norbert Otto and Füllner, Karin and Vidal, Francesca}}, pages = {{45--62}}, publisher = {{Aisthesis}}, title = {{{„Die römische Kurie hat den großen Priester nicht verstanden“. Hugues-Félicité-Robert de Lamennais und das Kommen des irdischen Gottesreichs}}}, year = {{2014}}, } @inbook{19246, author = {{Eke, Norbert Otto}}, booktitle = {{Das ungeliebte Frühwerk. Richard Wagners Oper „Das Liebesverbot“}}, editor = {{Lütteken, Laurenz}}, pages = {{45--72}}, publisher = {{Königshausen & Neumann}}, title = {{{„Besser als die Engländer haben die Deutschen den Shakspear begriffen.“ Shakespeare im Vormärz und Richard Wagners Oper „Das Liebesverbot oder Die Novize von Palermo“ (1836)}}}, volume = {{12}}, year = {{2014}}, } @inbook{19247, author = {{Eke, Norbert Otto and Brauerhoch, Annette and Wieser, Renate and Zechner, Anke}}, booktitle = {{Entautomatisierung}}, editor = {{Brauerhoch, Annette and Eke, Norbert Otto and Wieser, Renate and Zechner, Anke}}, pages = {{9--16}}, publisher = {{Fink}}, title = {{{Entautomatisierung. Zur Einleitung}}}, year = {{2014}}, } @inbook{19248, author = {{Eke, Norbert Otto}}, booktitle = {{Entautomatisierung}}, editor = {{Brauerhoch, Annette and Eke, Norbert Otto and Wieser, Renate and Zechner, Anke}}, pages = {{265--279}}, publisher = {{Fink}}, title = {{{„Was ist. Spielen wir weiter?“ Praktiken der Entautomatisierung im Theater Heiner Müllers}}}, year = {{2014}}, } @inbook{19249, author = {{Eke, Norbert Otto}}, booktitle = {{Der Nationalsozialismus und die Shoah in der deutschsprachigen Gegenwartsliteratur}}, editor = {{Fischer, Torben and Hammermeister, Philipp and Kramer, Sven}}, pages = {{27--49}}, publisher = {{Rodopi}}, title = {{{„Was ist wahr? Woher haben Sie denn Ihre Bilder?“ Shoah-Erinnerungen in neueren Theater-Texten (Robert Menasse, Werner Fritsch, Robert Schindel, Mieczysław Weinberg)}}}, year = {{2014}}, } @inbook{19250, author = {{Eke, Norbert Otto}}, booktitle = {{Bühne. Raumbildende Prozesse im Theater}}, editor = {{Eke, Norbert Otto and Haß, Ulrike and Kaldrack, Irina}}, pages = {{29--46}}, publisher = {{Fink}}, title = {{{Bühne als Wahrnehmungsraum. Stimme, Klang und Präsenz}}}, year = {{2014}}, } @inbook{19251, author = {{Eke, Norbert Otto and Haß, Ulrike and Kaldrack, Irina}}, booktitle = {{Bühne. Raumbildende Prozesse im Theater}}, editor = {{Eke, Norbert Otto and Haß, Ulrike and Kaldrack, Irina}}, pages = {{9--12}}, publisher = {{Fink}}, title = {{{Bühne: Raumbildende Prozesse im Theater}}}, year = {{2014}}, } @inbook{19252, author = {{Eke, Norbert Otto}}, booktitle = {{Agenten der Öffentlichkeit. Theater und Medien im frühen 19. Jahrhundert}}, editor = {{Wagner, Meike}}, pages = {{29--59}}, publisher = {{Aisthesis}}, title = {{{„Man kann auch auf die Deutschen nicht wirken, wenn sie in Schauspielhäusern sitzen.“ Mediale Konstellierungen von Öffentlichkeit im Zeitalter der Revolutionen}}}, year = {{2014}}, } @inbook{19253, author = {{Eke, Norbert Otto}}, booktitle = {{Morgenland und Moderne. Orient-Diskurse in der deutschsprachigen Literatur von 1890 bis zur Gegenwart}}, editor = {{Dunker, Axel and Hofmann, Michael}}, pages = {{205--220}}, publisher = {{Lang}}, title = {{{„Es gibt keinen Sieger außer Gott“. Dialog im Raum der Schrift: Thomas Lehrs Roman September. Fata Morgana}}}, year = {{2014}}, } @inproceedings{22387, author = {{Lessmeier, Christian and Enge-Rosenblatt, Olaf and Bayer, Christian and Zimmer, Detmar}}, booktitle = {{European Conference of the PHM Society 2014 (EPHM14)}}, isbn = {{978-1-936263-16-5}}, publisher = {{Prognostics and Health Management Society }}, title = {{{Data Acquisition and Signal Analysis from Measured Motor Currents for Defect Detection in Electromechanical Drive Systems}}}, year = {{2014}}, } @inproceedings{22389, author = {{Strop, Malte and Hölscher, Christian and Zimmer, Detmar}}, booktitle = {{OPT-i 2014. 1st International Conference on Engineering and Applied Sciences Optimization}}, isbn = {{978-960-99994-6-5}}, pages = {{626--663}}, publisher = {{Institute of Structural Analyses and Antiseismic Research}}, title = {{{Intelligent Operating Strategies for Multi-Motor Drive Systems}}}, volume = {{1}}, year = {{2014}}, } @inproceedings{452, abstract = {{Today's networks, like the Internet, do not consist of one but a mixture of several interconnected networks. Each has individual qualities and hence the performance of a network node results from the networks' interplay.We introduce a new game theoretic model capturing the interplay between a high-speed backbone network and a low-speed general purpose network. In our model, n nodes are connected by a static network and each node can decide individually to become a gateway node. A gateway node pays a fixed price for its connection to the high-speed network, but can utilize the high-speed network to gain communication distance 0 to all other gateways. Communication distances in the low-speed network are given by the hop distances. The effective communication distance between any two nodes then is given by the shortest path, which is possibly improved by using gateways as shortcuts.Every node v has the objective to minimize its communication costs, given by the sum (SUM-game) or maximum (MAX-game) of the effective communication distances from v to all other nodes plus a fixed price \alpha > 0, if it decides to be a gateway. For both games and different ranges of \alpha, we study the existence of equilibria, the price of anarchy, and convergence properties of best-response dynamics.}}, author = {{Abshoff, Sebastian and Cord-Landwehr, Andreas and Jung, Daniel and Skopalik, Alexander}}, booktitle = {{Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)}}, editor = {{Lavi, Ron}}, pages = {{294}}, title = {{{Brief Announcement: A Model for Multilevel Network Games}}}, year = {{2014}}, } @inproceedings{459, abstract = {{In this survey article, we discuss two algorithmic research areas that emerge from problems that arise when resources are offered in the cloud. The first area, online leasing, captures problems arising from the fact that resources in the cloud are not bought, but leased by cloud vendors. The second area, Distributed Storage Systems, deals with problems arising from so-called cloud federations, i.e., when several cloud providers are needed to fulfill a given task.}}, author = {{Kniesburges, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm and Scheideler, Christian}}, booktitle = {{Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)}}, pages = {{1--13}}, title = {{{Algorithmic Aspects of Resource Management in the Cloud}}}, doi = {{10.1007/978-3-319-09620-9_1}}, year = {{2014}}, } @article{464, abstract = {{Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful network topologies. The goal is to devise distributed algorithms where nodes forward, insert, and delete links to neighboring nodes, and that converge quickly to such a desirable topology, independently of the initial network configuration. This article proposes a new model to study the parallel convergence time. Our model sheds light on the achievable parallelism by avoiding bottlenecks of existing models that can yield a distorted picture. As a case study, we consider local graph linearization—i.e., how to build a sorted list of the nodes of a connected graph in a distributed and self-stabilizing manner. In order to study the main structure and properties of our model, we propose two variants of a most simple local linearization algorithm. For each of these variants, we present analyses of the worst-case and bestcase parallel time complexities, as well as the performance under a greedy selection of the actions to be executed. It turns out that the analysis is non-trivial despite the simple setting, and to complement our formal insights we report on our experiments which indicate that the runtimes may be better in the average case.}}, author = {{Gall, Dominik and Jacob, Riko and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo }}, journal = {{Theory of Computing Systems}}, number = {{1}}, pages = {{110--135}}, publisher = {{Springer}}, title = {{{A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization}}}, doi = {{10.1007/s00224-013-9504-x}}, year = {{2014}}, } @inproceedings{760, author = {{Auroux, Sebastien and Karl, Holger}}, booktitle = {{25th IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communication, {PIMRC} 2014, Washington DC, USA, September 2-5, 2014}}, pages = {{1294----1299}}, title = {{{Flow processing-aware controller placement in wireless DenseNets}}}, doi = {{10.1109/PIMRC.2014.7136368}}, year = {{2014}}, } @inproceedings{9879, abstract = {{Application of prognostics and health management (PHM) in the field of Proton Exchange Membrane (PEM) fuel cells is emerging as an important tool in increasing the reliability and availability of these systems. Though a lot of work is currently being conducted to develop PHM systems for fuel cells, various challenges have been encountered including the self-healing effect after characterization as well as accelerated degradation due to dynamic loading, all which make RUL predictions a difficult task. In this study, a prognostic approach based on adaptive particle filter algorithm is proposed. The novelty of the proposed method lies in the introduction of a self-healing factor after each characterization and the adaption of the degradation model parameters to fit to the changing degradation trend. An ensemble of five different state models based on weighted mean is then developed. The results show that the method is effective in estimating the remaining useful life of PEM fuel cells, with majority of the predictions falling within 5\% error. The method was employed in the IEEE 2014 PHM Data Challenge and led to our team emerging the winner of the RUL category of the challenge.}}, author = {{Kimotho, James Kuria and Meyer, Tobias and Sextro, Walter}}, booktitle = {{Prognostics and Health Management (PHM), 2014 IEEE Conference on}}, keywords = {{ageing, particle filtering (numerical methods), proton exchange membrane fuel cells, remaining life assessment, PEM fuel cell prognostics, PHM, RUL predictions, accelerated degradation, adaptive particle filter algorithm, dynamic loading, model parameter adaptation, prognostics and health management, proton exchange membrane fuel cells, remaining useful life estimation, self-healing effect, Adaptation models, Data models, Degradation, Estimation, Fuel cells, Mathematical model, Prognostics and health management}}, pages = {{1--6}}, title = {{{PEM fuel cell prognostics using particle filter with model parameter adaptation}}}, doi = {{10.1109/ICPHM.2014.7036406}}, year = {{2014}}, } @inproceedings{393, abstract = {{A fundamental problem for peer-to-peer systems is to maintain connectivity while nodes are leaving, i.e., the nodes requesting to leave the peer-to-peer system are excluded from the overlay network without affecting its connectivity. There are a number of studies for safe node exclusion if the overlay is in a well-defined state initially. Surprisingly, the problem is not formally studied yet for the case in which the overlay network is in an arbitrary initial state, i.e., when looking for a self-stabilizing solution for excluding leaving nodes. We study this problem in two variants: the Finite Departure Problem (FDP) ) and the Finite Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when it is safe to leave the network, whereas in the FSP, this leaving decision does not have to be final: the nodes may resume computation if necessary. We show that there is no self-stabilizing distributed algorithm for the FDP, even in a synchronous message passing model. To allow a solution, we introduce an oracle called NIDEC and show that it is sufficient even for the asynchronous message passing model by proposing an algorithm that can solve the FDP using NIDEC. We also show that a solution to the FSP does not require an oracle.}}, author = {{Foreback, Dianne and Koutsopoulos, Andreas and Nesterenko, Mikhail and Scheideler, Christian and Strothmann, Thim Frederik}}, booktitle = {{Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems}}, pages = {{48----62}}, title = {{{On Stabilizing Departures in Overlay Networks}}}, doi = {{10.1007/978-3-319-11764-5_4}}, year = {{2014}}, } @inproceedings{395, abstract = {{We consider a multilevel network game, where nodes can improvetheir communication costs by connecting to a high-speed network.The n nodes are connected by a static network and each node can decideindividually to become a gateway to the high-speed network. The goalof a node v is to minimize its private costs, i.e., the sum (SUM-game) ormaximum (MAX-game) of communication distances from v to all othernodes plus a fixed price α > 0 if it decides to be a gateway. Between gatewaysthe communication distance is 0, and gateways also improve othernodes’ distances by behaving as shortcuts. For the SUM-game, we showthat for α ≤ n − 1, the price of anarchy is Θ (n/√α) and in this rangeequilibria always exist. In range α ∈ (n−1, n(n−1)) the price of anarchyis Θ(√α), and for α ≥ n(n − 1) it is constant. For the MAX-game, weshow that the price of anarchy is either Θ (1 + n/√α), for α ≥ 1, orelse 1. Given a graph with girth of at least 4α, equilibria always exist.Concerning the dynamics, both games are not potential games. For theSUM-game, we even show that it is not weakly acyclic.}}, author = {{Abshoff, Sebastian and Cord-Landwehr, Andreas and Jung, Daniel and Skopalik, Alexander}}, booktitle = {{Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}}, pages = {{435--440}}, title = {{{Multilevel Network Games}}}, doi = {{10.1007/978-3-319-13129-0_36}}, year = {{2014}}, } @inproceedings{397, abstract = {{We present a factor $14D^2$ approximation algorithm for the minimum linear arrangement problem on series-parallel graphs, where $D$ is the maximum degree in the graph. Given a suitable decomposition of the graph, our algorithm runs in time $O(|E|)$ and is very easy to implement. Its divide-and-conquer approach allows for an effective parallelization. Note that a suitable decomposition can also be computed in time $O(|E|\log{|E|})$ (or even $O(\log{|E|}\log^*{|E|})$ on an EREW PRAM using $O(|E|)$ processors). For the proof of the approximation ratio, we use a sophisticated charging method that uses techniques similar to amortized analysis in advanced data structures. On general graphs, the minimum linear arrangement problem is known to be NP-hard. To the best of our knowledge, the minimum linear arrangement problem on series-parallel graphs has not been studied before.}}, author = {{Scheideler, Christian and Eikel, Martina and Setzer, Alexander}}, booktitle = {{Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)}}, pages = {{168----180}}, title = {{{Minimum Linear Arrangement of Series-Parallel Graphs}}}, year = {{2014}}, } @inproceedings{412, abstract = {{In this paper we present and analyze HSkip+, a self-stabilizing overlay network for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology as the Skip+ graph proposed by Jacob et al. [PODC 2009] but its self-stabilization mechanism significantly outperforms the self-stabilization mechanism proposed for Skip+. Also, the nodes are now ordered according to their bandwidths and not according to their identifiers. Various other solutions have already been proposed for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing. In addition to HSkip+ being self-stabilizing, its performance is on par with the best previous bounds on the time and work for joining or leaving a network of peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation and congestion for routing messages is on par with the best previous bounds for such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical investigations are backed by simulations demonstrating that HSkip+ is indeed performing much better than Skip+ and working correctly under high churn rates.}}, author = {{Feldotto, Matthias and Scheideler, Christian and Graffi, Kalman}}, booktitle = {{Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)}}, pages = {{1--10}}, title = {{{HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}}}, doi = {{10.1109/P2P.2014.6934300}}, year = {{2014}}, }