@inproceedings{19034, abstract = {{Demnächst in: ZS ejournal Kunstgeschichte, LMU München. Open Peer Reviewed Journal www.kunstgeschichte-ejournal.net}}, author = {{Seng, Eva- Maria}}, location = {{Marburg}}, title = {{{Die Welterbeliste - zwischen Kanonbildung und Kanonverschiebung}}}, year = {{2009}}, } @inbook{19035, author = {{Seng, Eva- Maria}}, booktitle = {{Protestantische Profile im Ruhrgebiet. 500 Lebensbilder aus 5 Jahrhunderten}}, editor = {{Basse, Michael and Jähnichen, Traugott and Schroeter-Wittke, Harald}}, pages = {{280f}}, title = {{{Arno Eugen Fritsche}}}, year = {{2009}}, } @article{19037, author = {{Seng, Eva- Maria}}, journal = {{MUT. Forum für Kultur, Politik und Geschichte}}, number = {{Januar2009}}, pages = {{68--84}}, title = {{{Denkmalpflege und kulturelles Erbe}}}, volume = {{Nr.497}}, year = {{2009}}, } @article{19038, author = {{Seng, Eva- Maria}}, journal = {{Killy-Literaturlexikon (Neuauftritt), München, Berlin}}, title = {{{Elias Holl}}}, year = {{2009}}, } @article{19059, author = {{Seng, Eva- Maria}}, journal = {{Blätter für württembergische Kirchengeschichte}}, title = {{{ „Aufgabe, Wirken, Möglichkeiten: 150 Jahre Kirche und Kunst in Württemberg“}}}, year = {{2009}}, } @inbook{19062, author = {{Seng, Eva- Maria}}, booktitle = {{Ehrenpromotion Höppner (Paderborner Universitätsreden 113)}}, editor = {{Freese, Peter}}, pages = {{5--12}}, title = {{{Laudatio auf Dr. Reinhard Höppner}}}, volume = {{113}}, year = {{2009}}, } @inbook{19065, author = {{Seng, Eva- Maria}}, booktitle = {{Deutsche Hochschulen im Dialog mit der arabischen Welt, }}, editor = {{Maaß, Kurt-Jürgen and Thum, Bernd}}, pages = {{121--127}}, title = {{{Gemeinsam lernen: Der Masterstudiengang „Kulturerbe/Studies in Cultural Heritage“ }}}, year = {{2009}}, } @inbook{19066, author = {{Seng, Eva- Maria}}, booktitle = {{Ist eine andere Welt möglich? Utopische Zwischenrufe. Multidisziplinäre Analysen und Reflexionen des utopischen Denkens}}, editor = {{Tudyka, Kurt P.}}, pages = {{49--67}}, title = {{{„Phantasie oder Vernunft: Ästhetische und architektonische Visionen von Städten und Gärten“}}}, year = {{2009}}, } @book{19077, editor = {{Eke, Norbert Otto and Schuster, Kurt G. P. and Tiggesbäumker, Günter}}, pages = {{400}}, publisher = {{vrg}}, title = {{{Hoffmann von Fallersleben. Internationales Symposion Corvey/Höxter 2008}}}, year = {{2009}}, } @book{19078, editor = {{Eke, Norbert Otto and Knapp, Gerhard P.}}, pages = {{389}}, publisher = {{Rodopi}}, title = {{{Neulektüren – New Readings}}}, year = {{2009}}, } @article{1925, author = {{D. Kleinberg, Robert and Scheideler, Christian}}, journal = {{Theory Comput. Syst.}}, number = {{2}}, pages = {{187}}, title = {{{Foreword}}}, doi = {{10.1007/s00224-009-9202-x}}, year = {{2009}}, } @article{1927, author = {{Awerbuch, Baruch and Scheideler, Christian}}, journal = {{Theory Comput. Syst.}}, number = {{2}}, pages = {{234----260}}, title = {{{Towards a Scalable and Robust DHT}}}, doi = {{10.1007/s00224-008-9099-9}}, year = {{2009}}, } @article{1928, author = {{Awerbuch, Baruch and Scheideler, Christian}}, journal = {{Theor. Comput. Sci.}}, number = {{6-7}}, pages = {{453----466}}, title = {{{Robust random number generation for peer-to-peer systems}}}, doi = {{10.1016/j.tcs.2008.10.003}}, year = {{2009}}, } @inproceedings{1929, author = {{Scheideler, Christian and Schmid, Stefan}}, booktitle = {{Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II}}, isbn = {{978-3-642-02929-5}}, pages = {{571----582}}, publisher = {{Springer}}, title = {{{A Distributed and Oblivious Heap}}}, doi = {{10.1007/978-3-642-02930-1_47}}, volume = {{5556}}, year = {{2009}}, } @inbook{19290, author = {{Eke, Norbert Otto}}, booktitle = {{Alltag als Genre}}, editor = {{Preußer, Heinz-Peter and Visser, Anthonya}}, pages = {{177--190}}, publisher = {{Universitätsverlag Winter}}, title = {{{Epiphanische Augen-Blicke. Inszenierungen der Alltagswahrnehmung in der Prosa Wilhelm Genazinos und Angela Krauß’}}}, volume = {{4}}, year = {{2009}}, } @inbook{19291, author = {{Eke, Norbert Otto}}, booktitle = {{Inszenierungen der Heiligen Schrift. Jüdische und christliche Bibeltransformation vom Mittelalter bis in die Moderne}}, editor = {{Keuchen, Marion and Müller, Stephan and Thiem, Annegret}}, pages = {{113--128}}, publisher = {{Fink}}, title = {{{„Gott will mich frei“. Richard Beer-Hofmanns „Historie von König David“}}}, year = {{2009}}, } @inbook{19292, author = {{Eke, Norbert Otto}}, booktitle = {{Ökonomie im Theater der Gegenwart. Ästhetik, Produktion, Institution}}, editor = {{Schößler, Franziska and Bähr, Christine}}, pages = {{175--191}}, publisher = {{transcript}}, title = {{{Störsignale. René Pollesch im Prater}}}, year = {{2009}}, } @inbook{19293, author = {{Eke, Norbert Otto}}, booktitle = {{Jüdisches Kulturerbe in Westfalen. Spurensuche zu jüdischer Kultur in Vergangenheit und Gegenwart}}, editor = {{Steinecke, Hartmut and Nölle-Hornkamp, Iris}}, pages = {{45--62}}, publisher = {{Aisthesis}}, title = {{{„Ich bin der vielversprechende Jüngling, der nichts gehalten hat.“ – Werner Vordtriedes Sehnsucht nach Sprache}}}, year = {{2009}}, } @inbook{19294, author = {{Eke, Norbert Otto}}, booktitle = {{Literatur intermedial – Paradigmenbildung zwischen 1918 und 1968}}, editor = {{Schmidt, Wolf Gerhard and Valk, Thorsten}}, pages = {{343--359}}, publisher = {{de Gruyter}}, title = {{{Den „Nullpunkt“ des Theaters finden. Heiner Müllers Medientheorie und Praxis}}}, year = {{2009}}, } @inbook{19295, author = {{Eke, Norbert Otto}}, booktitle = {{Hoffmann von Fallersleben. Internationales Symposion Corvey/Höxter 2008}}, editor = {{Eke, Norbert Otto and Schuster, Kurt G. P. and Tiggesbäumker, Günter}}, pages = {{295--313}}, publisher = {{vrg}}, title = {{{Hoffmann von Fallersleben und der Vormärz}}}, year = {{2009}}, } @inbook{19296, author = {{Eke, Norbert Otto}}, booktitle = {{Der Nationalsozialismus – Die zweite Geschichte. Überwindung – Deutung – Erinnerung}}, editor = {{Reichel, Peter and Schmid, Harald and Steinbach, Peter}}, pages = {{261--282 (444--446)}}, publisher = {{C. H. Beck}}, title = {{{Widersprüchliche Annäherungen – das deutschsprachige Drama}}}, year = {{2009}}, } @inproceedings{1930, author = {{Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan}}, booktitle = {{Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}}, pages = {{771----780}}, publisher = {{Springer}}, title = {{{A Self-stabilizing and Local Delaunay Graph Construction}}}, doi = {{10.1007/978-3-642-10631-6_78}}, volume = {{5878}}, year = {{2009}}, } @inbook{19315, author = {{Eke, Norbert Otto}}, booktitle = {{Neulektüren – New Readings. Festschrift für Gerd Labroisse zum 80. Geburtstag}}, pages = {{359--375}}, title = {{{Einsenkungen in Finsternisse oder: Flossenbürg liegt (nicht nur) in der Oberpfalz. Werner Fritschs Grabungen}}}, volume = {{67}}, year = {{2009}}, } @inproceedings{1932, author = {{Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}}, booktitle = {{Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009}}, isbn = {{978-1-60558-396-9}}, pages = {{131----140}}, title = {{{A distributed polylogarithmic time algorithm for self-stabilizing skip graphs}}}, doi = {{10.1145/1582716.1582741}}, year = {{2009}}, } @inproceedings{1933, author = {{Baumgart, Matthias and Scheideler, Christian and Schmid, Stefan}}, booktitle = {{SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009}}, isbn = {{978-1-60558-606-9}}, pages = {{300----309}}, title = {{{A DoS-resilient information system for dynamic data management}}}, doi = {{10.1145/1583991.1584064}}, year = {{2009}}, } @inproceedings{1934, author = {{Gall, Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}}, booktitle = {{Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings}}, isbn = {{978-3-642-05117-3}}, pages = {{781----782}}, publisher = {{Springer}}, title = {{{Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization}}}, doi = {{10.1007/978-3-642-05118-0_58}}, volume = {{5873}}, year = {{2009}}, } @inproceedings{1935, author = {{Doerr, Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}}, booktitle = {{Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009}}, publisher = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany}}, title = {{{Stabilizing Consensus with the Power of Two Choices}}}, doi = {{10.1145/1989493.1989516}}, volume = {{09371}}, year = {{2009}}, } @techreport{2353, abstract = {{Wireless Sensor Networks (WSNs) are unique embedded computation systems for distributed sensing of a dispersed phenomenon. While being a strongly concurrent distributed system, its embedded aspects with severe resource limitations and the wireless communication requires a fusion of technologies and methodologies from very different fields. As WSNs are deployed in remote locations for long-term unattended operation, assurance of correct functioning of the system is of prime concern. Thus, the design and development of WSNs requires specialized tools to allow for testing and debugging the system. To this end, we present a framework for analyzing and checking WSNs based on collected events during system operation. It allows for abstracting from the event trace by means of behavioral queries and uses assertions for checking the accordance of an execution to its specification. The framework is independent from WSN test platforms, applications and logging semantics and thus generally applicable for analyzing event logs of WSN test executions. }}, author = {{Woehrle, Matthias and Plessl, Christian and Thiele, Lothar}}, keywords = {{Rupeas, DSL, WSN, testing}}, title = {{{Rupeas: Ruby Powered Event Analysis DSL}}}, year = {{2009}}, } @article{2354, author = {{Brinkmann, André and Eschweiler, Dominic}}, journal = {{Journal of Supercomputing}}, pages = {{35:1--35:10}}, publisher = {{ACM}}, title = {{{A Microdriver Architecture for Error Correcting Codes inside the Linux Kernel}}}, doi = {{10.1145/1654059.1654095}}, year = {{2009}}, } @inbook{23744, abstract = {{In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset of the items. We focus on the case of computationally bounded followers who cannot optimize exactly over the range of all feasible subsets, but apply some publicly known algorithm to determine the set of items to purchase. This corresponds to general multi-dimensional pricing assuming that consumers cannot optimize over the full domain of their valuation functions but still aim to act rationally to the best of their ability. We consider two versions of this novel type of Stackelberg pricing games. Assuming that items are weighted objects and the follower seeks to purchase a min-cost selection of objects of some minimum weight (the Min-Knapsack problem) and uses a simple greedy 2-approximate algorithm, we show how an extension of the known single-price algorithm can be used to derive a polynomial-time (2 + ε)-approximation algorithm for the leader’s revenue maximization problem based on so-called near-uniform price assignments. We also prove the problem to be strongly NP-hard. Considering the case that items are subsets of some ground set which the follower seeks to cover (the Set-Cover problem) via a standard primal-dual approach, we prove that near-uniform price assignments fail to yield a good approximation guarantee. However, in the special case of elements with frequency 2 (the Vertex-Cover problem) it turns out that exact revenue maximization can be done in polynomial-time. This stands in sharp contrast to the fact that revenue maximization becomes APX-hard already for elements with frequency 3.}}, author = {{Briest, Patrick and Hoefer, Martin and Gualà, Luciano and Ventre, Carmine}}, booktitle = {{Lecture Notes in Computer Science}}, issn = {{0302-9743}}, title = {{{On Stackelberg Pricing with Computationally Bounded Consumers}}}, doi = {{10.1007/978-3-642-10841-9_6}}, year = {{2009}}, } @misc{23771, author = {{Fechner, Sabine and Treagust, David F.}}, booktitle = {{International Journal of Science Education}}, number = {{4}}, pages = {{596--601}}, title = {{{Making it relevant: Context-based learning of science [Book review]}}}, volume = {{31}}, year = {{2009}}, } @inproceedings{18138, abstract = {{Modern companies are nowadays confronted with an increasing demand of multiple products, where they need to perform more flexible every day. Cost-intensive decisions are to be confirmed in short times, in order to minimize risks and secure efficient production programs as well as material flows. Tools for this digital planning via simulation methods are one well established possibility to receive decision support. Nevertheless, the creation of the necessary simulation models is a complicated and error-prone process, where complexity of modeling, validation and verification depends on the used tool and its functionalities. This paper presents implemented concepts for an innovative user support in his tasks of verification and validation of simulation models during the execution of a simulation run. Time-intensive procedures like stopping simulation, parameterization and restarting within the problem analysis are simplified. So the user is able to focus on the real problem solving task.}}, author = {{Laroque, Christoph and Fischer, Matthias and Dangelmaier, Wilhelm}}, booktitle = {{European Simulation and Modelling Conference (ESM 2009)}}, publisher = {{EUROSIS-ETI}}, title = {{{Concepts for Model Verification and Validation during Simulation Runtime}}}, year = {{2009}}, } @inproceedings{1828, author = {{Volkhausen, Tobias and Woldegebreal, Dereje H. and Karl, Holger}}, booktitle = {{2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops}}, isbn = {{9781424439386}}, publisher = {{IEEE}}, title = {{{Improving Network Coded Cooperation by Soft Information}}}, doi = {{10.1109/sahcnw.2009.5172938}}, year = {{2009}}, } @inproceedings{1829, author = {{Valentin, S. and Woldegebreal, D. H. and Volkhausen, T. and Karl, Holger}}, booktitle = {{2009 IEEE International Conference on Communications Workshops}}, isbn = {{9781424434374}}, publisher = {{IEEE}}, title = {{{Combining for Cooperative WLANs - A Reality Check Based on Prototype Measurements}}}, doi = {{10.1109/iccw.2009.5208050}}, year = {{2009}}, } @inbook{18291, author = {{Suess, Tim and Fischer, Matthias and Huber, Daniel and Laroque, Christoph and Dangelmaier, Wilhelm}}, booktitle = {{Augmented & Virtual Reality in der Produktentstehung}}, pages = {{111----126}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen}}}, volume = {{252}}, year = {{2009}}, } @inbook{1830, author = {{Biermann, Thorsten and Schwabe, Arne and Karl, Holger}}, booktitle = {{NETWORKING 2009}}, isbn = {{9783642013980}}, issn = {{0302-9743}}, pages = {{883--894}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE}}}, doi = {{10.1007/978-3-642-01399-7_69}}, year = {{2009}}, } @inproceedings{1832, author = {{Lichte, Hermann S. and Weide, Jannis}}, booktitle = {{Proceedings of the Second International ICST Conference on Simulation Tools and Techniques}}, isbn = {{9789639799455}}, publisher = {{ICST}}, title = {{{Modeling obstacles in INET/Mobility framework: motivation, integration, and performance}}}, doi = {{10.4108/icst.simutools2009.5680}}, year = {{2009}}, } @inproceedings{1833, author = {{Ahlgren, Bengt and Vercellone, Vinicio and D'Ambrosio, Matteo and Marchisio, Marco and Marsh, Ian and Dannewitz, Christian and Ohlman, Börje and Pentikousis, Kostas and Strandberg, Ove and Rembarz, René}}, booktitle = {{Proceedings of the 2008 ACM CoNEXT Conference on - CONEXT '08}}, isbn = {{9781605582108}}, publisher = {{ACM Press}}, title = {{{Design considerations for a network of information}}}, doi = {{10.1145/1544012.1544078}}, year = {{2009}}, } @inproceedings{18346, abstract = {{For a fixed virtual scene (=collection of simplices) S and given observer position p, how many elements of S are weakly visible (i.e. not fully occluded by others) from p? The present work explores the trade-off between query time and preprocessing space for these quantities in 2D: exactly, in the approximate deterministic, and in the probabilistic sense. We deduce the EXISTENCE of an O(m^2/n^2) space data structure for S that, given p and time O(log n), allows to approximate the ratio of occluded segments up to arbitrary constant absolute error; here m denotes the size of the Visibility Graph--which may be quadratic, but typically is just linear in the size n of the scene S. On the other hand, we present a data structure CONSTRUCTIBLE in O(n*log(n)+m^2*polylog(n)/k) preprocessing time and space with similar approximation properties and query time O(k*polylog n), where k