@inproceedings{20195, author = {{Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl and Thenius, Ronald and Kengyel, Daniela}}, booktitle = {{10th European Conference on Artificial Life (ECAL'09)}}, title = {{{Embodiment of Honeybee's Thermotaxis in a Mobile Robot Swarm}}}, doi = {{10.1007/978-3-642-21314-4_9}}, year = {{2011}}, } @inbook{20196, author = {{Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl}}, booktitle = {{Advances in Artificial Life, ECAL 2011: Proceedings of the 11th European Conference on the Synthesis and Simulation of Living Systems}}, editor = {{Lenaerts, Tom and Giacobini, Mario and Bersini, Hugues and Bourgine, Paul and Dorigo, Marco and Doursat, Rene}}, pages = {{302----309}}, publisher = {{MIT Press}}, title = {{{Explaining Emergent Behavior in a Swarm System Based on an Inversion of the Fluctuation Theorem}}}, year = {{2011}}, } @inbook{20214, author = {{Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen and Crailsheim, Karl and Winkler, Lutz}}, booktitle = {{New Horizons in Evolutionary Robotics}}, publisher = {{Springer}}, title = {{{Major Feedback Loops Supporting Artificial Evolution in Multi-modular Robotics}}}, doi = {{10.1007/978-3-642-18272-3_13}}, year = {{2011}}, } @article{20215, author = {{Schmickl, Thomas and Hamann, Heiko and Crailsheim, Karl}}, issn = {{1387-3954}}, journal = {{Mathematical and Computer Modelling of Dynamical Systems}}, number = {{3}}, pages = {{221--242}}, title = {{{Modelling a hormone-inspired controller for individual- and multi-modular robotic systems}}}, doi = {{10.1080/13873954.2011.557862}}, volume = {{17}}, year = {{2011}}, } @inproceedings{17420, abstract = {{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. }}, author = {{Suess, Tim and Koch, Clemens and Jähn, Claudius and Fischer, Matthias}}, booktitle = {{Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John's, Newfoundland, Canada}}, editor = {{Brooks, Stephen and Irani, Pourang}}, pages = {{79----86}}, publisher = {{Canadian Human-Computer Communications Society}}, title = {{{Approximative occlusion culling using the hull tree}}}, year = {{2011}}, } @inproceedings{17421, author = {{Klaas, Alexander and Laroque, Christoph and Dangelmaier, Wilhelm and Fischer, Matthias}}, booktitle = {{Proceedings of the 2011 Winter Simulation Conference (WSC)}}, isbn = {{9781457721090}}, title = {{{Simulation aided, knowledge based routing for AGVs in a distribution warehouse}}}, doi = {{10.1109/wsc.2011.6147883}}, year = {{2011}}, } @inproceedings{17450, author = {{Suess, Tim and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm and Koch, Clemens}}, booktitle = {{Augmented & Virtual Reality in der Produktentstehung}}, pages = {{185----197}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts}}, title = {{{Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze}}}, volume = {{295}}, year = {{2011}}, } @phdthesis{17454, author = {{Suess, Tim}}, title = {{{Parallel Real-Time Rendering using Heterogeneous PC Clusters}}}, year = {{2011}}, } @phdthesis{18973, author = {{Frahling, Gereon}}, isbn = {{978-3-942647-09-0}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Algorithms for Dynamic Geometric Data Streams}}}, volume = {{290}}, year = {{2011}}, } @phdthesis{18974, author = {{Mehler, Jan}}, isbn = {{978-3-942647-06-9}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Power-Aware Online File Allocation in Dynamic Networks}}}, volume = {{287}}, year = {{2011}}, } @phdthesis{18976, abstract = {{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.}}, author = {{Gehweiler, Joachim}}, isbn = {{978-3-942647-17-5}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Peer-to-Peer Based Parallel Web Computing}}}, volume = {{298}}, year = {{2011}}, } @inproceedings{19026, author = {{Briest, Patrick and Raupach, Christoph}}, booktitle = {{Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11}}, isbn = {{9781450307437}}, title = {{{The car sharing problem}}}, doi = {{10.1145/1989493.1989518}}, year = {{2011}}, } @phdthesis{19040, author = {{Effert, Sascha}}, title = {{{Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen}}}, year = {{2011}}, } @article{23739, abstract = {{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. }}, author = {{Briest, Patrick and Krysta, Piotr and Vöcking, Berthold}}, issn = {{0097-5397}}, journal = {{SIAM Journal on Computing}}, pages = {{1587--1622}}, title = {{{Approximation Techniques for Utilitarian Mechanism Design}}}, doi = {{10.1137/090772988}}, year = {{2011}}, } @article{23740, abstract = {{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. }}, author = {{Briest, Patrick and Krysta, Piotr}}, issn = {{0097-5397}}, journal = {{SIAM Journal on Computing}}, pages = {{1554--1586}}, title = {{{Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems}}}, doi = {{10.1137/090752353}}, year = {{2011}}, } @inbook{20709, author = {{Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and auf der Heide, Friedhelm Meyer and Raupach, Christoph and Swierkot, Kamil and Warner, Daniel and Weddemann, Christoph and Wonisch, Daniel}}, booktitle = {{SOFSEM 2011: Theory and Practice of Computer Science}}, isbn = {{9783642183805}}, issn = {{0302-9743}}, title = {{{Collisionless Gathering of Robots with an Extent}}}, doi = {{10.1007/978-3-642-18381-2_15}}, year = {{2011}}, } @inbook{20710, author = {{Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and Raupach, Christoph and Swierkot, Kamil and Warner, Daniel and Weddemann, Christoph and Wonisch, Daniel}}, booktitle = {{Automata, Languages and Programming}}, isbn = {{9783642220111}}, issn = {{0302-9743}}, title = {{{A New Approach for Analyzing Convergence Algorithms for Mobile Robots}}}, doi = {{10.1007/978-3-642-22012-8_52}}, year = {{2011}}, } @inproceedings{18193, author = {{Renken, Hendrik and Laroque, Christoph and Fischer, Matthias}}, booktitle = {{Proceedings of The 25th European Simulation and Modelling Conference - ESM2011}}, title = {{{An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization}}}, year = {{2011}}, } @unpublished{18194, abstract = {{We present a parallel rendering system for PC-Clusters to visualize large 3D scenes. One single visualization node, equipped with a high-end graphics adapter, is supported by a group of backend nodes with weak graphics performance. The objects of the scene are distributed among these backend nodes, they serve two purposes: First, they provide an out-of-core memory system for the visualization node. Second, they assist the visualization node's rendering by performing visibility calculations and only sending visible objects to the visualization node. In order to obtain fast rendering with our system, we have to distribute the objects among the backend nodes in a way that does not only guarantee an even distribution of the objects, but also an even distribution of the visibility calculations and the amount of data send to the visualization node. We identify necessary properties of the distribution and argue that a random distribution is a good candidate. Further, in order to reduce the number of objects sent to the visualization node per frame, we employ an approximate hierarchical occlusion culling in each backend node. For this, they are equipped, in addition to the objects assigned to them, with simplified versions of the other objects of the 3D scene. The visualization node is equipped with 512 MiB video memory and supported by 15 backend nodes. This system is able to render a approx. 350 million polygons (approx. 8.5 GiB) large aircraft model between 20 - 30 fps and thus allows a walkthrough in real-time.}}, author = {{Suess, Tim and Koch, Clemens and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}}, title = {{{Parallel Out-of-Core Occlusion Culling}}}, year = {{2011}}, } @inproceedings{18568, author = {{Vöcking, Berthold and Hoefer, Martin and Skopalik, Alexander and Penn, Michal and Polukarov, Maria}}, booktitle = {{{IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence,}}, pages = {{234----239}}, title = {{{Considerate Equilibrium}}}, year = {{2011}}, }