TY - CHAP AU - Oevel, Gudrun AU - Toschläger, M. ED - Degkwitz, A. ED - Klapper, F. ID - 17317 T2 - Prozessorientierte Hochschule TI - Einführung eines prozessorientierten Campusmanagement an der Universität Paderborn – ein Erfahrungsbericht ER - TY - CONF AU - Brennecke, Andreas AU - Oevel, Gudrun AU - Strothmann, A. ED - Müller, P. ED - Neumair, B. ED - Dreo Rodosek, G. ID - 17318 T2 - 4. DFN-Forum Kommunikationstechnologien – Beiträge der Fachtagung 20./21.6.2011 Bonn TI - Vom Studiolo zur virtuellen Forschungsumgebung VL - 187 ER - TY - CONF AB - Occlusion culling is a common approach to accelerate real-time rendering of polygonal 3D-scenes by reducing the rendering load. Especially for large scenes, it is necessary to remove occluded objects to achieve a frame rate that provides an interactive environment. In order to benefit from the culling properly, often hierarchical data structures are used. These data structures typically create a spatial subdivision of a given scene into axis-aligned bounding boxes. These boxes can be tested quickly, but they are not very precise. By using these boxes, the included objects are detected as visible, even if other objects occlude them (false-positives). To get perfect results, the models’ original geometry included in the box has to be tested, but this would require too much computational power. To overcome this problem, original objects’ approximations could be used, but typical methods for mesh simplification cannot be applied, because they do not create an outer hull for a given object. We present a model simplification algorithm, which generates simple outer hulls, consisting of only few more triangles than a box, while preserving an object’s shape better than a corresponding bounding box. This approach is then extended to a hierarchical data structure, the so-called hull tree, that can be generated for a given scene to improve the visibility tests. Next, we present an approximative rendering algorithm, which combines the features of the hull tree with the use of inner hulls for efficient occlusion detection and global state-sorting of the visible objects. AU - Suess, Tim AU - Koch, Clemens AU - Jähn, Claudius AU - Fischer, Matthias ED - Brooks, Stephen ED - Irani, Pourang ID - 17420 T2 - Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John's, Newfoundland, Canada TI - Approximative occlusion culling using the hull tree ER - TY - CONF AU - Klaas, Alexander AU - Laroque, Christoph AU - Dangelmaier, Wilhelm AU - Fischer, Matthias ID - 17421 SN - 9781457721090 T2 - Proceedings of the 2011 Winter Simulation Conference (WSC) TI - Simulation aided, knowledge based routing for AGVs in a distribution warehouse ER - TY - CONF AU - Suess, Tim AU - Jähn, Claudius AU - Fischer, Matthias AU - Meyer auf der Heide, Friedhelm AU - Koch, Clemens ID - 17450 T2 - Augmented & Virtual Reality in der Produktentstehung TI - Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze VL - 295 ER - TY - THES AU - Suess, Tim ID - 17454 TI - Parallel Real-Time Rendering using Heterogeneous PC Clusters ER - TY - BOOK AU - Mindt, Ilka ID - 17692 TI - Adjective complementation by that-clauses: An empirical study ER - TY - JOUR AU - Mindt, Ilka AU - Lindquist, Hans ID - 17891 JF - ICAME Journal 35 TI - Corpus Linguistics and the Description of English ER - TY - CHAP AU - Mindt, Ilka AU - Mukherjee, Joybrato ID - 17894 T2 - Anglistik. International Journal of English Studies, 22, 1 TI - Anglistische Korpuslinguistik. Eine Einführung. Grundlagen der Anglistik und Amerikanistik 33 ER - TY - CONF AU - W. Richa, Andrea AU - Scheideler, Christian AU - Schmid, Stefan AU - Zhang, Jin ID - 1891 SN - 978-0-7695-4364-2 T2 - 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011 TI - Competitive and Fair Medium Access Despite Reactive Jamming ER - TY - CONF AU - W. Richa, Andrea AU - Scheideler, Christian AU - Schmid, Stefan AU - Zhang, Jin ID - 1892 SN - 978-1-4503-0868-7 T2 - Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011 TI - Towards jamming-resistant and competitive medium access in the SINR model ER - TY - CONF AU - W. Richa, Andrea AU - Scheideler, Christian AU - Schmid, Stefan AU - Zhang, Jin ID - 1893 SN - 978-1-4503-0722-2 T2 - Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011 TI - Self-stabilizing leader election for single-hop wireless networks despite jamming ER - TY - CONF AU - Kniesburges, Sebastian AU - Koutsopoulos, Andreas AU - Scheideler, Christian ID - 1895 SN - 978-1-4503-0743-7 T2 - SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011) TI - Re-Chord: a self-stabilizing chord overlay network ER - TY - THES AU - Frahling, Gereon ID - 18973 SN - 978-3-942647-09-0 TI - Algorithms for Dynamic Geometric Data Streams VL - 290 ER - TY - THES AU - Mehler, Jan ID - 18974 SN - 978-3-942647-06-9 TI - Power-Aware Online File Allocation in Dynamic Networks VL - 287 ER - TY - THES AB - Web computing is a variant of parallel computing where the idle times of PCs donated by worldwide distributed users are employed to execute parallel programs. In this thesis we consider a web computing variant with two important properties: First, we support the execution of coupled, massively parallel algorithms (rather than distributed data processing). And second, we organize the system in peer-to-peer fashion. We present the Paderborn University BSP-based Web Computing (PUB-Web) library, which supports the execution of parallel programs in the bulk-synchronous style (BSP) in such a web computing setting. In this thesis, we focus on important technical and algorithmic aspects, in particular: In order to schedule processes with respect to the currently available computing power, which continually changes in an unpredictable fashion, we need intelligent load balancing algorithms and -- as a basic precondition -- the technical ability to migrate threads at runtime. To achieve the latter in a way suitable for production use, compatible with recent Java versions, available for all important platforms, and easy-to-use for developers, we develop the PadMig thread migration and checkpointing library. In order to tackle the distributed load balancing problem, we present an algorithm based on Distributed Heterogeneous Hash-Tables. In order to judge the quality of the schedules produced, we perform extensive experiments to compare several variants of the DHHT-based load balancer with the well- established Work Stealing algorithm, using realistic input data obtained by profiling the utilization of several hundred PCs for a period of several months. Beside the available computing power, we finally also consider the network bandwidth as a secondary criterion for load balancing. For this purpose, we cluster the PUB-Web network according to bandwidth, employing a novel, fault-tolerant, adaptive, and scaling distributed clustering algorithm called DiDiC. In order to judge the quality of the clusterings produces by DiDiC, we experimentally compare it to the well-established MCL algorithm using a simulator. AU - Gehweiler, Joachim ID - 18976 SN - 978-3-942647-17-5 TI - Peer-to-Peer Based Parallel Web Computing VL - 298 ER - TY - CONF AU - Kniesburges, Sebastian AU - Scheideler, Christian ID - 1899 SN - 978-3-642-19093-3 T2 - WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings TI - Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems VL - 6552 ER - TY - CHAP AU - Scheideler, Christian AU - Graffi, Kalman ID - 1900 SN - 978-1-4614-1167-3 T2 - Computer Science, The Hardware, Software and Heart of It TI - Programming for Distributed Computing: From Physical to Logical Networks ER - TY - CHAP AU - Seng, Eva- Maria ED - Menne, Mareike ED - Ströhmer, Michael ID - 19000 T2 - Total Regional. Studien zur frühneuzeitlichen Sozial- und Wirtschaftsgeschichte, FS für Frank Göttmann TI - Der Kanonenbischof Christoph Bernhard von Galen und seine retrospektiven Baumaßnahmen ER - TY - JOUR AU - Seng, Eva- Maria ID - 19002 JF - kunst und kirche. Ökumenische Zeitschrift für zeitgenössische Kunst und Architektur TI - Dekor und Kirchenbau VL - H.2 ER - TY - CHAP AU - Seng, Eva- Maria ED - Klevesath, Lino ID - 19005 T2 - Demokratie – Kultur – Moderne. Perspektiven der Politischen Theorie, FS für Walter Reese-Schäfer TI - Kulturlandschaften: Die Rückgewinnung des immateriellen Kulturerbes in die Landschaft ER - TY - BOOK AU - Eke, Norbert Otto AU - Olasz-Eke, Dagmar ID - 19006 TI - „Sprache, die so tröstlich zu mir kam“. Thomas Valentin in Briefen von und an Hermann Hesse ER - TY - CHAP AU - Scheideler, Christian ID - 1901 SN - 978-3-642-15327-3 T2 - Algorithms Unplugged TI - Broadcasting - How Can I Quickly Disseminate Information? ER - TY - BOOK AU - Vöcking, Berthold AU - Alt, Helmut AU - Dietzfelbinger, Martin AU - Reischuk, Rüdiger AU - Scheideler, Christian AU - Vollmer, Heribert AU - Wagner, Dorothea ID - 1902 SN - 978-3-642-15327-3 TI - Algorithms Unplugged ER - TY - JOUR AU - Seng, Eva- Maria ID - 19021 JF - UNESCO heute. ZS der Deutschen UNESCO-Kommission TI - UNESCO-Weltkulturerbe und der Gedanke der Nachhaltigkeit VL - H2 ER - TY - CHAP AU - Seng, Eva- Maria ED - Freitag, Werner ID - 19024 T2 - Die Pfarre in der Stadt. Siedlungskern – Bürgerkirche – Urbanes Zentrum (Reihe: Städteforschung, Veröffentlichungen des Instituts für vergleichende Städtegeschichte in Münster Bd. 82) TI - Stadterweiterungen, Kirchenneubau und Pfarrgründungen im 19. Jahrhundert VL - 82 ER - TY - CONF AU - Briest, Patrick AU - Raupach, Christoph ID - 19026 SN - 9781450307437 T2 - Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11 TI - The car sharing problem ER - TY - THES AU - Effert, Sascha ID - 19040 TI - Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen ER - TY - THES AU - Caylak, Ismail ID - 19187 SN - 978-3-8440-0084-9 TI - Stabilized Mixed Triangular and Tetrahedral Finite Elements with Volume and Area Bubble Functions VL - Band 4 ER - TY - CONF AU - Kolman, Petr AU - Scheideler, Christian ID - 1924 T2 - 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany TI - Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing ER - TY - JOUR AU - Eke, Norbert Otto ID - 19271 IS - 2 JF - literatur für leser TI - Von Taschentüchern und anderen Dingen, oder: Die “akute Einsamkeit des Menschen”. Herta Müller und der Widerspruch ER - TY - CHAP AU - Eke, Norbert Otto ED - Deiters, Franz-Josef ED - a., u. ID - 19273 T2 - Terror und Form (Limbus. Australisches Jahrbuch für germanistische Literatur- und Kulturwissenschaft. Band 4) TI - Spiegel/Bilder – Werner Fritschs Anatomie von Terror und Krieg ER - TY - CHAP AU - Eke, Norbert Otto ED - Lützeler, Paul Michael ED - McGlothlin, Erin ID - 19278 T2 - GegenwartsLiteratur. Ein germanistisches Jahrbuch/A German Studies Yearbook 10/2011 TI - “Gelber Mais, keine Zeit”. Herta Müllers Nach-Schrift Atemschaukel. Roman ER - TY - CHAP AU - Eke, Norbert Otto ED - Balogh, András F. ED - Varga, Péter ID - 19279 T2 - “Das Leben in der Poesie”. Festschrift für Magdolna Orosz zum 60. Geburtstag TI - Wahre, unzeitige und falsche Aufklärung. Fortschreibungen einer ‘alten’ Debatte im Kontext der Französischen Revolution ER - TY - JOUR AB - Angaben zur Herausgeberschaft: Hg. im Auftrag der Georg-Forster-Gesellschaft von Stefan Greif und Michael Ewert Angabe zum Ort: Kassel AU - Eke, Norbert Otto ID - 19280 JF - Georg-Forster-Studien TI - Dem “Haufen genügt die Täuschung”. Georg Forster und das Theater VL - XVI ER - TY - JOUR AU - Eke, Norbert Otto ID - 19281 JF - Der Deutschunterricht 63, H. 3: Literatur und Musik TI - “Blühe, deutsches Vaterland”. Hoffmann von Fallerslebens ‘volkstümliche’ Hymne und die ‘deutsche’ Hymnenpraxis ER - TY - JOUR AU - Eke, Norbert Otto ID - 19282 IS - März JF - Text + Kritik, H. 190 TI - Welt-Kunst-Beobachtung. Rainald Goetz und das Theater ER - TY - JOUR AB - This paper deals with the design of efficiently computable incentive-compatible mechanisms for combinatorial optimization problems with single-minded agents each possibly having multiple private parameters. We focus on approximation algorithms for NP-hard mechanism design problems. These algorithms need to satisfy certain monotonicity properties to ensure truthfulness. Since most of the known approximation techniques do not fulfill these properties, we study alternative techniques. Our first contribution is a quite general method to transform a pseudopolynomial algorithm into a monotone fully polynomial time approximation scheme (FPTAS). This can be applied to various problems like, e.g., knapsack, constrained shortest path, or job scheduling with deadlines. For example, the monotone FPTAS for the knapsack problem gives a very efficient, truthful mechanism for single-minded multiunit auctions. The best previous result for such auctions was a 2-appro-xi-ma-tion. In addition, we present a monotone PTAS for the generalized assignment problem with any constant number of private parameters per agent. The most efficient way to solve packing integer programs (PIPs) is linear programming–based randomized rounding, which also is in general not monotone. We show that primal-dual greedy algorithms achieve almost the same approximation ratios for PIPs as randomized rounding. The advantage is that these algorithms are inherently monotone. This way, we can significantly improve the approximation ratios of truthful mechanisms for various fundamental mechanism design problems like single-minded combinatorial auctions (CAs), unsplittable flow routing, and multicast routing. Our primal-dual approximation algorithms can also be used for the winner determination in CAs with general bidders specifying their bids through an oracle. AU - Briest, Patrick AU - Krysta, Piotr AU - Vöcking, Berthold ID - 23739 JF - SIAM Journal on Computing SN - 0097-5397 TI - Approximation Techniques for Utilitarian Mechanism Design ER - TY - JOUR AB - We investigate nonparametric multiproduct pricing problems, in which we want to find revenue maximizing prices for products $\mathcal{P}$ based on a set of customer samples $\mathcal{C}$. We mostly focus on the unit-demand case, in which products constitute strict substitutes and each customer aims to purchase a single product. In this setting a customer sample consists of a number of nonzero values for different products and possibly an additional product ranking. Once prices are fixed, each customer chooses to buy one of the products she can afford based on some predefined selection rule. We distinguish between the min-buying, max-buying, and rank-buying models. Some of our results also extend to single-minded pricing, in which case products are strict complements and every customer seeks to buy a single set of products, which she purchases if the sum of prices is below her valuation for that set. For the min-buying model we show that the revenue maximization problem is not approximable within factor $\mathcal{O}(\log^{\varepsilon}|\mathcal{C}|)$ for some constant $\varepsilon>0$, unless $\mathrm{NP}\subseteq\mathrm{DTIME}(n^{\mathcal{O}(\log\log n)})$, thereby almost closing the gap between the known algorithmic results and previous lower bounds. We also prove inapproximability within $\mathcal{O}(\ell^{\varepsilon})$, $\ell$ being an upper bound on the number of nonzero values per customer, and $\mathcal{O}(|\mathcal{P}|^{\varepsilon})$ under slightly stronger assumptions and provide matching upper bounds. Surprisingly, these hardness results hold even if a price ladder constraint, i.e., a predefined order on the prices of all products, is given. Without the price ladder constraint we obtain similar hardness results for the special case of uniform valuations, i.e., the case that every customer has identical values for all the products she is interested in, assuming specific hardness of the balanced bipartite independent set problem in constant degree graphs or hardness of refuting random 3CNF formulas. Introducing a slightly more general problem definition in which customers are given as an explicit probability distribution, we obtain inapproximability within $\mathcal{O}(|\mathcal{P}|^{\varepsilon})$ assuming $\mathrm{NP}\nsubseteq\bigcap_{\delta>0}\mathrm{BPTIME}(2^{\mathcal{O}(n^{\delta})})$. These results apply to single-minded pricing as well. For the max-buying model a polynomial-time approximation scheme exists if a price ladder is given. We give a matching lower bound by proving strong NP-hardness. Assuming limited product supply, we analyze a generic local search algorithm and prove that it is 2-approximate. Finally, we discuss implications for the rank-buying model. AU - Briest, Patrick AU - Krysta, Piotr ID - 23740 JF - SIAM Journal on Computing SN - 0097-5397 TI - Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems ER - TY - JOUR AU - Plattner, K AU - Baumeister, Jochen AU - Lamberts, RP AU - Lambert, MI ID - 20403 IS - 3 JF - J Electromyogr Kinesiol SN - 1050-6411 TI - Dissociation in changes in EMG activation during maximal isometric and submaximal low force dynamic contractions after exercise-induced muscle damage. VL - 21 ER - TY - JOUR AU - Reinecke, K AU - Cordes, M AU - Lerch, C AU - Schubert, M AU - Koutsandreou, F AU - Weiss, M AU - Baumeister, Jochen ID - 20464 IS - 4 JF - Appl Psychophysiol Biofeedback TI - From lab to field conditions: A pilot study on EEG methodology in applied sports sciences VL - 36 ER - TY - GEN AU - Lerch, C AU - Cordes, M AU - Baumeister, Jochen ID - 20603 IS - 4 TI - Effectiveness of injury prevention programs in female youth soccer: a systematic review VL - 45 ER - TY - GEN AU - Plattner, T AU - Baumeister, Jochen AU - Lamberts, RP AU - Lambert, MI ID - 20607 T2 - Abstract Book - 16th Annual Congress of the European College of Sports Science TI - Dissociation in changes in EMG Activation during maximal isometric and submaximal low force dynamic contractions after exercise induced muscle damage ER - TY - GEN AU - Reinecke, K AU - Schubert, M AU - Schade, J AU - Weiß, M AU - Baumeister, Jochen ID - 20609 T2 - Fatigue: An Interdisciplinary approach TI - Brain activity during motor control is not influenced after exhaustive strength training ER - TY - GEN AU - Von Detten, S AU - Boguslawaski, D AU - Hanschke, U AU - Weiß, M AU - Baumeister, Jochen ID - 20621 T2 - Fatigue: An Interdisciplinary approach TI - The influence of fatigue on landing strategies after a stop jump ER - TY - CHAP AU - Cord-Landwehr, Andreas AU - Degener, Bastian AU - Fischer, Matthias AU - Hüllmann, Martina AU - Kempkes, Barbara AU - Klaas, Alexander AU - Kling, Peter AU - Kurras, Sven AU - Märtens, Marcus AU - auf der Heide, Friedhelm Meyer AU - Raupach, Christoph AU - Swierkot, Kamil AU - Warner, Daniel AU - Weddemann, Christoph AU - Wonisch, Daniel ID - 20709 SN - 0302-9743 T2 - SOFSEM 2011: Theory and Practice of Computer Science TI - Collisionless Gathering of Robots with an Extent ER - TY - CHAP AU - Cord-Landwehr, Andreas AU - Degener, Bastian AU - Fischer, Matthias AU - Hüllmann, Martina AU - Kempkes, Barbara AU - Klaas, Alexander AU - Kling, Peter AU - Kurras, Sven AU - Märtens, Marcus AU - Meyer auf der Heide, Friedhelm AU - Raupach, Christoph AU - Swierkot, Kamil AU - Warner, Daniel AU - Weddemann, Christoph AU - Wonisch, Daniel ID - 20710 SN - 0302-9743 T2 - Automata, Languages and Programming TI - A New Approach for Analyzing Convergence Algorithms for Mobile Robots ER - TY - JOUR AU - Sievers, Sönke AU - Homburg, Carsten AU - Lorenz, Michael ID - 20877 JF - Controlling & Management Review (VHB-JOURQUAL 3 Ranking D) TI - Unternehmensbewertung in Deutschland:  Verfahren, Finanzplanung und Kapitalkostenermittlung ER - TY - CONF AB - Durch die immer kuerzer werdenden Entwicklungszyklen und den groeßer werdenden Druck bzgl. Time-to-Market fuer eingebettete Systeme im Automobilsektor steigt der Bedarf, die Systeme bereits zu fruehen Entwicklungszeitpunkten gegenueber den Qualitaetsanforderungen (z. B. Zeitanforderungen und Ressourcenauslastung) zu verifizieren. Wir stellen einen Ansatz vor, der eine formale Spezifikation von Zeitanforderungen und Wirkketten sowie deren fruehzeitige Analyse durch Simulation erlaubt. Verletzungen von Zeitanforderungen werden in den Simulationsergebnissen automatisch erkannt. AU - Meyer, Jan AU - Holtmann, Jörg AU - Meyer, Matthias ID - 20915 T2 - 8. Paderborner Workshop Entwurf mechatronischer Systeme TI - Formalisierung von Anforderungen und Betriebssystemeigenschaften zur fruehzeitigen Simulation von eingebetteten, automobilen Systemen VL - 294 ER - TY - CONF AB - Safety critical functions for embedded systems are increasingly realized with software. Current and future standards and maturity models impose high accuracy and quality for the development process of such software-intensive, embedded systems. But nowadays, there are process and tooling gaps between different modeling aspects for the system under development (SUD). Furthermore, the SUD is usually verified and validated not until it is completely implemented, which leads to expensive corrections. In this paper we present a seamless, model-based development process, which is intended for the automotive supplier domain and conforms to the process reference model of Automotive SPICE. The development process addresses the issues mentioned above by using systematic transitions between different modeling aspects and simulations in early development stages. AU - Holtmann, Jörg AU - Meyer, Jan AU - Meyer, Matthias ID - 20916 T2 - Software Engineering 2011 – Workshopband (inkl. Doktorandensymposium) TI - A Seamless Model-Based Development Process for Automotive Systems VL - P-184 ER -