TY - JOUR AU - Oulton, Rupert F. AU - Sorger, Volker J. AU - Zentgraf, Thomas AU - Ma, Ren-Min AU - Gladden, Christopher AU - Dai, Lun AU - Bartal, Guy AU - Zhang, Xiang ID - 1735 IS - 7264 JF - Nature SN - 0028-0836 TI - Plasmon lasers at deep subwavelength scale VL - 461 ER - TY - JOUR AU - Valentine, Jason AU - Li, Jensen AU - Zentgraf, Thomas AU - Bartal, Guy AU - Zhang, Xiang ID - 1736 IS - 7 JF - Nature Materials SN - 1476-1122 TI - An optical cloak made of dielectrics VL - 8 ER - TY - JOUR AU - Meyer auf der Heide, Friedhelm AU - Rammig, Franz-Josef ID - 17453 JF - Public Service Review: Science and Technology TI - Self-Organisation and Self-Optimization VL - 04 ER - TY - CHAP AU - Peckhaus, Volker ED - Lapointe, Sandra ED - Eklund, Matti ED - Thomasson, Amie L. ID - 17610 T2 - The Baltic International Yearbook of Cognition, Logic and Communication, Bd. 4: 200 Years of Analytical Philosophy TI - Language and Logic in German Post-Hegelian Philosophy ER - TY - CHAP AU - Mindt, Ilka ID - 17710 T2 - Anglistik. International Journal of English Studies TI - Guest-editor des Focus On "Corpus Linguistics - Methods and Approaches" ER - TY - JOUR AU - Mindt, Ilka ID - 17770 JF - Anglistik. International Journal of English Studies TI - Corpus-based and corpus-driven approaches: An investigation of the verb do VL - 20:1 ER - TY - JOUR AU - Mindt, Ilka ID - 17771 JF - Anglistik. International Journal of English Studies TI - Corpus Linguistics: a discipline on the move VL - 20:1 ER - TY - JOUR AU - Briest, Patrick ID - 19031 IS - 1 JF - it - Information Technology SN - 1611-2776 TI - Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems) VL - 51 ER - TY - CONF AB - Demnächst in: ZS ejournal Kunstgeschichte, LMU München. Open Peer Reviewed Journal www.kunstgeschichte-ejournal.net AU - Seng, Eva- Maria ID - 19034 TI - Die Welterbeliste - zwischen Kanonbildung und Kanonverschiebung ER - TY - CHAP AU - Seng, Eva- Maria ED - Basse, Michael ED - Jähnichen, Traugott ED - Schroeter-Wittke, Harald ID - 19035 T2 - Protestantische Profile im Ruhrgebiet. 500 Lebensbilder aus 5 Jahrhunderten TI - Arno Eugen Fritsche ER - TY - JOUR AU - Seng, Eva- Maria ID - 19037 IS - Januar2009 JF - MUT. Forum für Kultur, Politik und Geschichte TI - Denkmalpflege und kulturelles Erbe VL - Nr.497 ER - TY - JOUR AU - Seng, Eva- Maria ID - 19038 JF - Killy-Literaturlexikon (Neuauftritt), München, Berlin TI - Elias Holl ER - TY - JOUR AU - Seng, Eva- Maria ID - 19059 JF - Blätter für württembergische Kirchengeschichte TI - „Aufgabe, Wirken, Möglichkeiten: 150 Jahre Kirche und Kunst in Württemberg“ ER - TY - CHAP AU - Seng, Eva- Maria ED - Freese, Peter ID - 19062 T2 - Ehrenpromotion Höppner (Paderborner Universitätsreden 113) TI - Laudatio auf Dr. Reinhard Höppner VL - 113 ER - TY - CHAP AU - Seng, Eva- Maria ED - Maaß, Kurt-Jürgen ED - Thum, Bernd ID - 19065 T2 - Deutsche Hochschulen im Dialog mit der arabischen Welt, TI - Gemeinsam lernen: Der Masterstudiengang „Kulturerbe/Studies in Cultural Heritage“ ER - TY - CHAP AU - Seng, Eva- Maria ED - Tudyka, Kurt P. ID - 19066 T2 - Ist eine andere Welt möglich? Utopische Zwischenrufe. Multidisziplinäre Analysen und Reflexionen des utopischen Denkens TI - „Phantasie oder Vernunft: Ästhetische und architektonische Visionen von Städten und Gärten“ ER - TY - BOOK ED - Eke, Norbert Otto ED - Schuster, Kurt G. P. ED - Tiggesbäumker, Günter ID - 19077 TI - Hoffmann von Fallersleben. Internationales Symposion Corvey/Höxter 2008 ER - TY - BOOK ED - Eke, Norbert Otto ED - Knapp, Gerhard P. ID - 19078 TI - Neulektüren – New Readings ER - TY - JOUR AU - D. Kleinberg, Robert AU - Scheideler, Christian ID - 1925 IS - 2 JF - Theory Comput. Syst. TI - Foreword ER - TY - JOUR AU - Awerbuch, Baruch AU - Scheideler, Christian ID - 1927 IS - 2 JF - Theory Comput. Syst. TI - Towards a Scalable and Robust DHT ER - TY - JOUR AU - Awerbuch, Baruch AU - Scheideler, Christian ID - 1928 IS - 6-7 JF - Theor. Comput. Sci. TI - Robust random number generation for peer-to-peer systems ER - TY - CONF AU - Scheideler, Christian AU - Schmid, Stefan ID - 1929 SN - 978-3-642-02929-5 T2 - Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II TI - A Distributed and Oblivious Heap VL - 5556 ER - TY - CHAP AU - Eke, Norbert Otto ED - Preußer, Heinz-Peter ED - Visser, Anthonya ID - 19290 T2 - Alltag als Genre TI - Epiphanische Augen-Blicke. Inszenierungen der Alltagswahrnehmung in der Prosa Wilhelm Genazinos und Angela Krauß’ VL - 4 ER - TY - CHAP AU - Eke, Norbert Otto ED - Keuchen, Marion ED - Müller, Stephan ED - Thiem, Annegret ID - 19291 T2 - Inszenierungen der Heiligen Schrift. Jüdische und christliche Bibeltransformation vom Mittelalter bis in die Moderne TI - „Gott will mich frei“. Richard Beer-Hofmanns „Historie von König David“ ER - TY - CHAP AU - Eke, Norbert Otto ED - Schößler, Franziska ED - Bähr, Christine ID - 19292 T2 - Ökonomie im Theater der Gegenwart. Ästhetik, Produktion, Institution TI - Störsignale. René Pollesch im Prater ER - TY - CHAP AU - Eke, Norbert Otto ED - Steinecke, Hartmut ED - Nölle-Hornkamp, Iris ID - 19293 T2 - Jüdisches Kulturerbe in Westfalen. Spurensuche zu jüdischer Kultur in Vergangenheit und Gegenwart TI - „Ich bin der vielversprechende Jüngling, der nichts gehalten hat.“ – Werner Vordtriedes Sehnsucht nach Sprache ER - TY - CHAP AU - Eke, Norbert Otto ED - Schmidt, Wolf Gerhard ED - Valk, Thorsten ID - 19294 T2 - Literatur intermedial – Paradigmenbildung zwischen 1918 und 1968 TI - Den „Nullpunkt“ des Theaters finden. Heiner Müllers Medientheorie und Praxis ER - TY - CHAP AU - Eke, Norbert Otto ED - Eke, Norbert Otto ED - Schuster, Kurt G. P. ED - Tiggesbäumker, Günter ID - 19295 T2 - Hoffmann von Fallersleben. Internationales Symposion Corvey/Höxter 2008 TI - Hoffmann von Fallersleben und der Vormärz ER - TY - CHAP AU - Eke, Norbert Otto ED - Reichel, Peter ED - Schmid, Harald ED - Steinbach, Peter ID - 19296 T2 - Der Nationalsozialismus – Die zweite Geschichte. Überwindung – Deutung – Erinnerung TI - Widersprüchliche Annäherungen – das deutschsprachige Drama ER - TY - CONF AU - Jacob, Riko AU - Ritscher, Stephan AU - Scheideler, Christian AU - Schmid, Stefan ID - 1930 T2 - Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings TI - A Self-stabilizing and Local Delaunay Graph Construction VL - 5878 ER - TY - CHAP AU - Eke, Norbert Otto ID - 19315 T2 - Neulektüren – New Readings. Festschrift für Gerd Labroisse zum 80. Geburtstag TI - Einsenkungen in Finsternisse oder: Flossenbürg liegt (nicht nur) in der Oberpfalz. Werner Fritschs Grabungen VL - 67 ER - TY - CONF AU - Jacob, Riko AU - W. Richa, Andrea AU - Scheideler, Christian AU - Schmid, Stefan AU - Täubig, Hanjo ID - 1932 SN - 978-1-60558-396-9 T2 - Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009 TI - A distributed polylogarithmic time algorithm for self-stabilizing skip graphs ER - TY - CONF AU - Baumgart, Matthias AU - Scheideler, Christian AU - Schmid, Stefan ID - 1933 SN - 978-1-60558-606-9 T2 - SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009 TI - A DoS-resilient information system for dynamic data management ER - TY - CONF AU - Gall, Dominik AU - Jacob, Riko AU - W. Richa, Andrea AU - Scheideler, Christian AU - Schmid, Stefan AU - Täubig, Hanjo ID - 1934 SN - 978-3-642-05117-3 T2 - Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings TI - Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization VL - 5873 ER - TY - CONF AU - Doerr, Benjamin AU - Ann Goldberg, Leslie AU - Minder, Lorenz AU - Sauerwald, Thomas AU - Scheideler, Christian ID - 1935 T2 - Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009 TI - Stabilizing Consensus with the Power of Two Choices VL - 09371 ER - TY - GEN AB - 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. AU - Woehrle, Matthias AU - Plessl, Christian AU - Thiele, Lothar ID - 2353 KW - Rupeas KW - DSL KW - WSN KW - testing TI - Rupeas: Ruby Powered Event Analysis DSL ER - TY - JOUR AU - Brinkmann, André AU - Eschweiler, Dominic ID - 2354 JF - Journal of Supercomputing TI - A Microdriver Architecture for Error Correcting Codes inside the Linux Kernel ER - TY - CHAP AB - 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. AU - Briest, Patrick AU - Hoefer, Martin AU - Gualà, Luciano AU - Ventre, Carmine ID - 23744 SN - 0302-9743 T2 - Lecture Notes in Computer Science TI - On Stackelberg Pricing with Computationally Bounded Consumers ER - TY - GEN AU - Fechner, Sabine AU - Treagust, David F. ID - 23771 IS - 4 T2 - International Journal of Science Education TI - Making it relevant: Context-based learning of science [Book review] VL - 31 ER - TY - CONF AB - 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. AU - Laroque, Christoph AU - Fischer, Matthias AU - Dangelmaier, Wilhelm ID - 18138 T2 - European Simulation and Modelling Conference (ESM 2009) TI - Concepts for Model Verification and Validation during Simulation Runtime ER - TY - CONF AU - Volkhausen, Tobias AU - Woldegebreal, Dereje H. AU - Karl, Holger ID - 1828 SN - 9781424439386 T2 - 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops TI - Improving Network Coded Cooperation by Soft Information ER - TY - CONF AU - Valentin, S. AU - Woldegebreal, D. H. AU - Volkhausen, T. AU - Karl, Holger ID - 1829 SN - 9781424434374 T2 - 2009 IEEE International Conference on Communications Workshops TI - Combining for Cooperative WLANs - A Reality Check Based on Prototype Measurements ER - TY - CHAP AU - Suess, Tim AU - Fischer, Matthias AU - Huber, Daniel AU - Laroque, Christoph AU - Dangelmaier, Wilhelm ID - 18291 T2 - Augmented & Virtual Reality in der Produktentstehung TI - Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen VL - 252 ER - TY - CHAP AU - Biermann, Thorsten AU - Schwabe, Arne AU - Karl, Holger ID - 1830 SN - 0302-9743 T2 - NETWORKING 2009 TI - Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE ER - TY - CONF AU - Lichte, Hermann S. AU - Weide, Jannis ID - 1832 SN - 9789639799455 T2 - Proceedings of the Second International ICST Conference on Simulation Tools and Techniques TI - Modeling obstacles in INET/Mobility framework: motivation, integration, and performance ER - TY - CONF AU - Ahlgren, Bengt AU - Vercellone, Vinicio AU - D'Ambrosio, Matteo AU - Marchisio, Marco AU - Marsh, Ian AU - Dannewitz, Christian AU - Ohlman, Börje AU - Pentikousis, Kostas AU - Strandberg, Ove AU - Rembarz, René ID - 1833 SN - 9781605582108 T2 - Proceedings of the 2008 ACM CoNEXT Conference on - CONEXT '08 TI - Design considerations for a network of information ER - TY - CONF AB - 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