@inproceedings{609,
  abstract     = {{Today's design and operation principles and methods do not scale well with future reconfigurable computing systems due to an increased complexity in system architectures and applications, run-time dynamics and corresponding requirements. Hence, novel design and operation principles and methods are needed that possibly break drastically with the static ones we have built into our systems and the fixed abstraction layers we have cherished over the last decades. Thus, we propose a HW/SW platform that collects and maintains information about its state and progress which enables the system to reason about its behavior (self-awareness) and utilizes its knowledge to effectively and autonomously adapt its behavior to changing requirements (self-expression).To enable self-awareness, our compute nodes collect information using a variety of sensors, i.e. performance counters and thermal diodes, and use internal self-awareness models that process these information. For self-awareness, on-line learning is crucial such that the node learns and continuously updates its models at run-time to react to changing conditions. To enable self-expression, we break with the classic design-time abstraction layers of hardware, operating system and software. In contrast, our system is able to vertically migrate functionalities between the layers at run-time to exploit trade-offs between abstraction and optimization.This paper presents a heterogeneous multi-core architecture, that enables self-awareness and self-expression, an operating system for our proposed hardware/software platform and a novel self-expression method.}},
  author       = {{Happe, Markus and Agne, Andreas and Plessl, Christian and Platzner, Marco}},
  booktitle    = {{Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing Systems (SRCS)}},
  pages        = {{8--9}},
  title        = {{{Hardware/Software Platform for Self-aware Compute Nodes}}},
  year         = {{2012}},
}

@inproceedings{567,
  abstract     = {{Heterogeneous machines are gaining momentum in the High Performance Computing field, due to the theoretical speedups and power consumption. In practice, while some applications meet the performance expectations, heterogeneous architectures still require a tremendous effort from the application developers. This work presents a code generation method to port codes into heterogeneous platforms, based on transformations of the control flow into function calls. The results show that the cost of the function-call mechanism is affordable for the tested HPC kernels. The complete toolchain, based on the LLVM compiler infrastructure, is fully automated once the sequential specification is provided.}},
  author       = {{Barrio, Pablo and Carreras, Carlos and Sierra, Roberto and Kenter, Tobias and Plessl, Christian}},
  booktitle    = {{Proceedings of the International Conference on High Performance Computing and Simulation (HPCS)}},
  pages        = {{559--565}},
  publisher    = {{IEEE}},
  title        = {{{Turning control flow graphs into function calls: Code generation for heterogeneous architectures}}},
  doi          = {{10.1109/HPCSim.2012.6266973}},
  year         = {{2012}},
}

@inproceedings{612,
  abstract     = {{While numerous publications have presented ring oscillator designs for temperature measurements a detailed study of the ring oscillator's design space is still missing. In this work, we introduce metrics for comparing the performance and area efficiency of ring oscillators and a methodology for determining these metrics. As a result, we present a systematic study of the design space for ring oscillators for a Xilinx Virtex-5 platform FPGA.}},
  author       = {{Rüthing, Christoph and Happe, Markus and Agne, Andreas and Plessl, Christian}},
  booktitle    = {{Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)}},
  pages        = {{559--562}},
  publisher    = {{IEEE}},
  title        = {{{Exploration of Ring Oscillator Design Space for Temperature Measurements on FPGAs}}},
  doi          = {{10.1109/FPL.2012.6339370}},
  year         = {{2012}},
}

@inproceedings{2180,
  author       = {{Beisel, Tobias and Wiersema, Tobias and Plessl, Christian and Brinkmann, André}},
  booktitle    = {{Proc. Workshop on Computer Architecture and Operating System Co-design (CAOS)}},
  keywords     = {{funding-enhance}},
  title        = {{{Programming and Scheduling Model for Supporting Heterogeneous Accelerators in Linux}}},
  year         = {{2012}},
}

@article{2177,
  author       = {{Grad, Mariusz and Plessl, Christian}},
  journal      = {{Int. Journal of Reconfigurable Computing (IJRC)}},
  publisher    = {{Hindawi Publishing Corp.}},
  title        = {{{On the Feasibility and Limitations of Just-In-Time Instruction Set Extension for FPGA-based Reconfigurable Processors}}},
  doi          = {{10.1155/2012/418315}},
  year         = {{2012}},
}

@inproceedings{27191,
  author       = {{Keil, Reinhard  and Metternich, Hans-Jürgen and Ritzenhoff, Steffan}},
  editor       = {{Keil, Reinhard  and Metternich, Hans-Jürgen and Ritzenhoff, Steffan}},
  pages        = {{15--17}},
  title        = {{{Passability in education - a challenge for the future}}},
  year         = {{2012}},
}

@inproceedings{27188,
  author       = {{Keil, Reinhard  and Metternich, Hans-Jürgen and Ritzenhoff,  Steffan}},
  editor       = {{Keil, Reinhard and Metternich, Hans-Jürgen and Ritzenhoff, Steffan}},
  pages        = {{112--115}},
  title        = {{{Summary and Outlook}}},
  year         = {{2012}},
}

@article{60456,
  abstract     = {{<jats:p>We present a theoretical framework and practical method for the automatic construction of simple, all-quadrilateral patch layouts on manifold surfaces. The resulting layouts are coarse, surface-embedded cell complexes well adapted to the geometric structure, hence they are ideally suited as domains and base complexes for surface parameterization, spline fitting, or subdivision surfaces and can be used to generate quad meshes with a high-level patch structure that are advantageous in many application scenarios. Our approach is based on the careful construction of the layout graph's combinatorial dual. In contrast to the primal this dual perspective provides direct control over the globally interdependent structural constraints inherent to quad layouts. The dual layout is built from curvature-guided, crossing loops on the surface. A novel method to construct these efficiently in a geometry- and structure-aware manner constitutes the core of our approach.</jats:p>}},
  author       = {{Campen, Marcel and Bommes, David and Kobbelt, Leif}},
  issn         = {{0730-0301}},
  journal      = {{ACM Transactions on Graphics}},
  number       = {{4}},
  pages        = {{1--11}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Dual loops meshing}}},
  doi          = {{10.1145/2185520.2185606}},
  volume       = {{31}},
  year         = {{2012}},
}

@inproceedings{60457,
  author       = {{Zimmer, Henrik and Campen, Marcel and Herkrath, Ralf and Kobbelt, Leif}},
  booktitle    = {{Advances in Architectural Geometry, AAG 2012, Paris, France, September 27-28, 2012}},
  editor       = {{Hesselgren, Lars and Sharma, Shrikant and Wallner, Johannes and Baldassini, Niccolo and Bompas, Philippe and Raynaud, Jacques}},
  pages        = {{319–332}},
  publisher    = {{Springer}},
  title        = {{{Variational Tangent Plane Intersection for Planar Polygonal Meshing}}},
  doi          = {{10.1007/978-3-7091-1251-9_26}},
  year         = {{2012}},
}

@article{60455,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>In mechanical engineering and architecture, structural elements with low material consumption and high load‐bearing capabilities are essential for light‐weight and even self‐supporting constructions. This paper deals with so called point‐folding elements – non‐planar, pyramidal panels, usually formed from thin metal sheets, which exploit the increased structural capabilities emerging from folds or creases. Given a triangulated free‐form surface, a corresponding point‐folding structure is a collection of pyramidal elements basing on the triangles. User‐specified or material‐induced geometric constraints often imply that each individual folding element has a different shape, leading to immense fabrication costs. We present a rationalization method for such structures which respects the prescribed aesthetic and production constraints and finds a minimal set of molds for the production process, leading to drastically reduced costs. For each base triangle we compute and parametrize the range of feasible folding elements that satisfy the given constraints within the allowed tolerances. Then we pose the rationalization task as a geometric intersection problem, which we solve so as to maximize the re‐use of mold dies. Major challenges arise from the high precision requirements and the non‐trivial parametrization of the search space. We evaluate our method on a number of practical examples where we achieve rationalization gains of more than 90%.</jats:p>}},
  author       = {{Zimmer, Henrik and Campen, Marcel and Bommes, David and Kobbelt, Leif}},
  issn         = {{0167-7055}},
  journal      = {{Computer Graphics Forum}},
  number       = {{2pt3}},
  pages        = {{611--620}},
  publisher    = {{Wiley}},
  title        = {{{Rationalization of Triangle‐Based Point‐Folding Structures}}},
  doi          = {{10.1111/j.1467-8659.2012.03040.x}},
  volume       = {{31}},
  year         = {{2012}},
}

@article{52868,
  author       = {{Grimme, Britta and Lipinski, John and Schöner, Gregor}},
  journal      = {{Experimental brain research}},
  pages        = {{185–200}},
  publisher    = {{Springer}},
  title        = {{{Naturalistic arm movements during obstacle avoidance in 3D and the identification of movement primitives}}},
  volume       = {{222}},
  year         = {{2012}},
}

@phdthesis{19619,
  author       = {{Korzeniowski, Miroslaw}},
  isbn         = {{978-3-942647-08-3}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Dynamic Load Balancing in Peer-to-Peer Networks}}},
  volume       = {{289}},
  year         = {{2011}},
}

@article{19677,
  author       = {{Briest, Patrick and Krysta, Piotr and Hoefer, Martin}},
  journal      = {{Algorithmica}},
  pages        = {{733–753}},
  title        = {{{Stackelberg Network Pricing Games}}},
  doi          = {{10.1007/s00453-010-9480-3}},
  volume       = {{62}},
  year         = {{2011}},
}

@inproceedings{19845,
  abstract     = {{In dieser Arbeit stellen wir ein flexibles System zur Entwicklung und Evaluation von 3-D-Renderingalgorithmen vor, das die Visualisierung komplexer virtueller Szenen auf einem breiten Spektrum an Geräten erlaubt. Die Aufbereitung und Echtzeitdarstellung solcher virtueller Szenen, wie sie beispielsweise aus detaillierten CAD-Daten erzeugt werden, stellt in vielerlei Hinsicht eine algorithmische und technische Herausforderung dar. Die 3-D-Szenendaten können nach dem Dateiimport aus einem Austauschformat in eine Vielzahl unterschiedlicher Datenstrukturen überführt werden. Es muss ein geeignetes Renderingverfahren ausgewählt und eingestellt werden, welches sowohl die Eigenschaften der Szene (Zahl der Polygone, Grad der Verdeckung etc.) als auch die Fähigkeiten der Hardware berücksichtigt. Auf der einen Seite stellt die Darstellung auf mobilen Endgeräten wie Smartphones besonders hohe Anforderungen aufgrund der Speicherbeschränkung und der geringen Leistungsfähigkeit der Grafikhardware. Auf der anderen Seite stehen bei Großprojektionssystemen, wie beispielsweise dem HD-Visualisierungscenter des Heinz Nixdorf Instituts, die hohe Bildqualität bei stereoskopischer Darstellung und die Unterstützung von Trackingsystemen im Vordergrund.

Der Fokus des von uns entwickelten Systems PADrend liegt in der Bereitstellung einer flexiblen und leicht erweiterbaren Grundlage für die Entwicklung und Evaluation von 3-D-Renderingalgorithmen und räumlichen Datenstrukturen im Bereich der Forschung und der universitären Ausbildung. Durch den modularen Aufbau und die große Bandbreite an unterstützten Systemen wird gewährleistet, dass eine Vielzahl unterschiedlicher Entwicklungen und Anwendungen auf PADrend aufsetzen können. In diesem Artikel geben wir einen Überblick über den Aufbau und die Fähigkeiten des Systems. Des Weiteren geben wir ein Beispiel für ein Anwendungsszenario, in dem PADrend eingesetzt wird: die Visualisierung von architektonischen Modellen auf einem Multiprojektionssystem.}},
  author       = {{Jähn, Claudius and Petring, Ralf and Eikel, Benjamin}},
  booktitle    = {{Augmented & Virtual Reality in der Produktentstehung}},
  pages        = {{159----170}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{PADrend: Platform for Algorithm Development and Rendering}}},
  volume       = {{295}},
  year         = {{2011}},
}

@inproceedings{20180,
  abstract     = {{The challenging scientific field of self-reconfiguring modular robotics (i.e., decentrally controlled 'super-robots' based on autonomous, interacting robot modules with variable morphologies) calls for novel paradigms of designing robot controllers. One option is the approach of evolutionary robotics. In this approach, the challenge is to achieve high evaluation numbers with the available resources which may even affect the feasibility of this approach. Simulations are usually applied at least in a preliminary stage of research to support controller design. However, even simulations are computationally expensive which gets even more burdensome once comprehensive studies and comparisons between different controller designs and approaches have to be done. Hence, a benchmark with low computational cost is needed that still contains the typical challenges of decentral control, is comparable, and easily manageable. We propose such a benchmark and report an empirical study of its characteristics including the transition from the single-robot setting to the multi-robot setting, typical local optima, and properties of adaptive walks through the fitness landscape.}},
  author       = {{Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl and Krasnogor, Natalio and Luca Lanzi, Pier}},
  booktitle    = {{Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, GECCO 2011}},
  pages        = {{195----202}},
  title        = {{{Coupled inverted pendulums: A benchmark for evolving decentral controllers in modular robotics}}},
  doi          = {{10.1145/2001576.2001604}},
  year         = {{2011}},
}

@inproceedings{20181,
  abstract     = {{The current definitions of emergence have no effects in the context of artificial life that could convincingly be called `constructive'. They are rather descriptive labels or tests. In order to get towards recipes of generating emergence we need to know systemic characteristics that help during the design phase of artificial life systems and worlds. In this paper, we develop and discuss five hypotheses that are not meant to be irrevocable but rather thought-provoking. We introduce two modeling approaches for Langton's ant to clarify these hypotheses. Then we discuss general properties of systems, such as (ir-)reversibility, dependence on initial states, computation, discreetness, and undecidable properties of system states.}},
  author       = {{Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl}},
  booktitle    = {{IEEE Symposium on Artificial Life (IEEE ALIFE 2011)}},
  pages        = {{62----69}},
  title        = {{{Thermodynamics of Emergence: Langton's Ant Meets Boltzmann}}},
  doi          = {{10.1109/ALIFE.2011.5954660}},
  year         = {{2011}},
}

@inproceedings{20183,
  author       = {{Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl}},
  booktitle    = {{10th European Conference on Artificial Life (ECAL'09)}},
  isbn         = {{9783642212826}},
  issn         = {{0302-9743}},
  pages        = {{442----449}},
  title        = {{{Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System}}},
  doi          = {{10.1007/978-3-642-21283-3_55}},
  volume       = {{5777}},
  year         = {{2011}},
}

@inproceedings{20184,
  author       = {{Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen and Crailsheim, Karl and Thenius, Rona and Fitch, Robert}},
  booktitle    = {{Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples}},
  title        = {{{Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples for Adaptive Reaction-Diffusion Controllers}}},
  year         = {{2011}},
}

@inbook{20193,
  author       = {{Hamann, Heiko and Schmickl, Thomas}},
  booktitle    = {{Bio-inspired Computing and Communication Networks}},
  editor       = {{Xiao, Yang}},
  publisher    = {{CRC Press}},
  title        = {{{{BEECLUST}: {A} Swarm Algorithm Derived from Honeybees}}},
  year         = {{2011}},
}

@inproceedings{20194,
  author       = {{Hamann, Heiko and Karsai, Istvan and Schmickl, Thomas and Stradner, Jürgen and Crailsheim, Karl and Thenius, Ronald and Kampis, Gyoergy and Szathmary, Eoers}},
  booktitle    = {{Advances in Artificial Life, 10th European Conference, ECAL 2009}},
  pages        = {{132----139}},
  title        = {{{Evolving a novel bio-inspired controller in reconfigurable robots}}},
  year         = {{2011}},
}