@inproceedings{2198,
  author       = {{Grad, Mariusz and Plessl, Christian}},
  booktitle    = {{Proc. Reconfigurable Architectures Workshop (RAW)}},
  pages        = {{278--285}},
  publisher    = {{IEEE Computer Society}},
  title        = {{{Just-in-time Instruction Set Extension – Feasibility and Limitations for an FPGA-based Reconfigurable ASIP Architecture}}},
  doi          = {{10.1109/IPDPS.2011.153}},
  year         = {{2011}},
}

@inproceedings{37002,
  abstract     = {{HDL-mutation based fault injection and analysis is considered as an important coverage metric for measuring the quality of design simulation processes [20, 3, 1, 2]. In this work, we try to solve the problem of automatic simulation data generation targeting HDL mutation faults. We follow a search based approach and eliminate the need for symbolic execution and mathematical constraint solving from existing work. An objective cost function is defined on the test input space and serves the guidance of search for fault-detecting test data. This is done by first mapping the simulation traces under a test onto a control and data flow graph structure which is extracted from the design. Then the progress of fault detection can be measured quantitatively on this graph to be the cost value. By minimizing this cost we approach the target test data. The effectiveness of the cost function is investigated under an example neighborhood search scheme. Case study with a floating point arithmetic IP design has shown that the cost function is able to guide effectively the search procedure towards a fault-detecting test. The cost calculation time as the search overhead was also observed to be minor compared to the actual design simulation time.}},
  author       = {{Xie, Tao and Müller, Wolfgang and Letombe, Florian}},
  booktitle    = {{Proceedings of Euromicro DSD 2011}},
  isbn         = {{978-1-4577-1048-3}},
  keywords     = {{Hardware design languages, Cost function, Computational modeling, Fault detection, Data models, Analytical models, Testing}},
  publisher    = {{IEEE}},
  title        = {{{HDL-Mutation Based Simulation Data Generation by Propagation Guided Search}}},
  doi          = {{10.1109/DSD.2011.83}},
  year         = {{2011}},
}

@article{60461,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshes are usually assumed to be well‐structured and manifold. In practice, however, they often contain defects like holes, gaps, degeneracies, non‐manifold configurations – or they might even be just a soup of polygons. The task of repairing these defects is computationally complex and in many cases exhibits various ambiguities demanding tedious manual efforts. We present a computational framework that enables the computation of meaningful approximate intrinsic distances and geodesic paths on raw meshes in a way which is tolerant to such defects. Holes and gaps are bridged up to a user‐specified tolerance threshold such that distances can be computed plausibly even across multiple connected components of inconsistent meshes. Further, we show ways to locally parameterize a surface based on geodesic distance fields, easily facilitating the application of textures and decals on raw meshes. We do all this without explicitly repairing the input, thereby avoiding the costly additional efforts. In order to enable broad applicability we provide details on two implementation variants, one optimized for performance, the other optimized for memory efficiency. Using the presented framework many applications can readily be extended to deal with imperfect meshes. Since we abstract from the input applicability is not even limited to meshes, other representations can be handled as well.</jats:p>}},
  author       = {{Campen, Marcel and Kobbelt, Leif}},
  issn         = {{0167-7055}},
  journal      = {{Computer Graphics Forum}},
  number       = {{2}},
  pages        = {{623--632}},
  publisher    = {{Wiley}},
  title        = {{{Walking On Broken Mesh: Defect‐Tolerant Geodesic Distances and Parameterizations}}},
  doi          = {{10.1111/j.1467-8659.2011.01896.x}},
  volume       = {{30}},
  year         = {{2011}},
}

@article{52867,
  author       = {{Grimme, Britta and Fuchs, Susanne and Perrier, Pascal and Schöner, Gregor}},
  journal      = {{Motor control}},
  number       = {{1}},
  pages        = {{5–33}},
  publisher    = {{Human Kinetics, Inc.}},
  title        = {{{Limb versus speech motor control: A conceptual review}}},
  volume       = {{15}},
  year         = {{2011}},
}

@inproceedings{19678,
  author       = {{Briest, Patrick and Röglin, Heiko}},
  booktitle    = {{Workshop on Approximation and Online Algorithms (WAOA)}},
  publisher    = {{Springer}},
  title        = {{{The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers}}},
  doi          = {{10.1007/978-3-642-18318-8_5}},
  volume       = {{6534}},
  year         = {{2010}},
}

@inproceedings{19711,
  author       = {{Degener, Bastian and Pietrzyk, Peter and Kempkes, Barbara}},
  booktitle    = {{International Parallel & Distributed Processing Symposium (IPDPS)}},
  title        = {{{A local, distributed constant-factor approximation algorithm for the dynamic facility location problem }}},
  doi          = {{10.1109/IPDPS.2010.5470349}},
  year         = {{2010}},
}

@inproceedings{19796,
  abstract     = {{We introduce the Read-Write-Coding-System (RWC) – a very flexible class of linear block codes that generate efficient and flexible erasure codes for storage networks. In particular, given a message x of k symbols and a codeword y of n symbols, an RW code defines additional parameters k \leq r,w \leq n that offer enhanced possibilities to adjust the fault-tolerance capability of the code. More precisely, an RWC provides linear $\left(n,k,d\right)$-codes that have (a) minimum distance d=n-r+1 for any two codewords, and (b) for each codeword there exists a codeword for each other message with distance of at most w. Furthermore, depending on the values r,w and the code alphabet, different block codes such as parity codes (e.g. RAID 4/5) or Reed-Solomon (RS) codes (if r=k and thus, w=n) can be generated. In storage networks in which I/O accesses are very costly and redundancy is crucial, this flexibility has considerable advantages as r and w can optimally be adapted to read or write intensive applications; only w symbols must be updated if the message x changes completely, what is different from other codes which always need to rewrite y completely as x changes. In this paper, we first state a tight lower bound and basic conditions for all RW codes. Furthermore, we introduce special RW codes in which all mentioned parameters are adjustable even online, that is, those RW codes are adaptive to changing demands. At last, we point out some useful properties regarding safety and security of the stored data.}},
  author       = {{Mense, Mario and Schindelhauer, Christian}},
  booktitle    = {{Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems}},
  isbn         = {{9783642051173}},
  issn         = {{0302-9743}},
  pages        = {{624----639}},
  title        = {{{Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks}}},
  doi          = {{10.1007/978-3-642-05118-0_43}},
  volume       = {{5873}},
  year         = {{2010}},
}

@inproceedings{19824,
  abstract     = {{We present 3nuts, a self-stabilizing peer-to-peer (p2p) network supporting range queries and adapting the overlay structure to the underlying physical network. 3nuts combines concepts of structured and unstructured p2p networks to overcome their individual shortcomings while keeping their strengths. This is achieved by combining self maintaining random networks for robustness, a search tree to allow range queries, and DHTs for load balancing. Simple handshake operations with provable guarantees are used for maintenance and self-stabilization. Efficiency of load balancing, fast data access, and robustness are proven by rigorous analysis.}},
  author       = {{Janson, Thomas and Mahlmann, Peter and Schindelhauer, Christian}},
  booktitle    = {{Proceedings of the 16th International Conference on Parallel and Distributed Systems}},
  isbn         = {{9781424497270}},
  title        = {{{A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs}}},
  doi          = {{10.1109/icpads.2010.42}},
  year         = {{2010}},
}

@inproceedings{19829,
  author       = {{Miao, Huawei and Ooi, Chia Ching and Wu, Xiaowen and Schindelhauer, Christian}},
  booktitle    = {{Proceedings of the 2010 ACM Symposium on Applied Computing - SAC '10}},
  isbn         = {{9781605586397}},
  pages        = {{1299--1304}},
  title        = {{{Coverage-hole trap model in target tracking using distributed relay-robot network}}},
  doi          = {{10.1145/1774088.1774365}},
  year         = {{2010}},
}

@inproceedings{19933,
  author       = {{Schomaker, Gunnar and Oberthur, Simon and Kortenjan, Michael}},
  booktitle    = {{8th IEEE International Conference on Industrial Informatics (INDIN'2010)}},
  isbn         = {{9781424472987}},
  title        = {{{Distributed and dynamic resource management for self-optimizing mechatronic systems}}},
  doi          = {{10.1109/indin.2010.5549647}},
  year         = {{2010}},
}

@book{20182,
  author       = {{Hamann, Heiko}},
  publisher    = {{Springer}},
  title        = {{{Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming}}},
  doi          = {{10.1007/978-3-642-13377-0}},
  year         = {{2010}},
}

@inproceedings{20220,
  author       = {{Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen and Crailsheim, Karl}},
  booktitle    = {{Proceedings of the IEEE Congress on Evolutionary Computation (CEC'10)}},
  pages        = {{244----251}},
  title        = {{{A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait Learning}}},
  doi          = {{10.1109/CEC.2010.5585994}},
  year         = {{2010}},
}

@inproceedings{20222,
  author       = {{Schmickl, Thomas and Hamann, Heiko and Stradner, Jürgen and Mayet, Ralf and Crailsheim, Karl}},
  booktitle    = {{Proc. of the ALife XII Conference}},
  pages        = {{648----655}},
  publisher    = {{MIT Press}},
  title        = {{{Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller}}},
  year         = {{2010}},
}

@inproceedings{20223,
  abstract     = {{The semi-automatic or automatic synthesis of robot controller software is
both desirable and challenging. Synthesis of rather simple behaviors such as
collision avoidance by applying artificial evolution has been shown multiple
times. However, the difficulty of this synthesis increases heavily with
increasing complexity of the task that should be performed by the robot. We try
to tackle this problem of complexity with Artificial Homeostatic Hormone
Systems (AHHS), which provide both intrinsic, homeostatic processes and
(transient) intrinsic, variant behavior. By using AHHS the need for pre-defined
controller topologies or information about the field of application is
minimized. We investigate how the principle design of the controller and the
hormone network size affects the overall performance of the artificial
evolution (i.e., evolvability). This is done by comparing two variants of AHHS
that show different effects when mutated. We evolve a controller for a robot
built from five autonomous, cooperating modules. The desired behavior is a form
of gait resulting in fast locomotion by using the modules' main hinges.}},
  author       = {{Hamann, Heiko and Stradner, Jürgen and Schmickl, Thomas and Crailsheim, Karl}},
  booktitle    = {{Artificial Life XII (ALife XII), Odense, Denmark}},
  pages        = {{773--780}},
  publisher    = {{MIT  Press}},
  title        = {{{Artificial Hormone Reaction Networks: Towards Higher Evolvability in  Evolutionary Multi-Modular Robotics}}},
  year         = {{2010}},
}

@inproceedings{20226,
  author       = {{Hamann, Heiko and Meyer, Bernd and Schmickl, Thomas and Crailsheim, Karl}},
  booktitle    = {{From Animals to Animats 11}},
  isbn         = {{9783642151927}},
  issn         = {{0302-9743}},
  pages        = {{639--648}},
  publisher    = {{Springer}},
  title        = {{{A Model of Symmetry Breaking in Collective Decision-Making}}},
  doi          = {{10.1007/978-3-642-15193-4_60}},
  volume       = {{6226}},
  year         = {{2010}},
}

@inproceedings{20258,
  abstract     = {{Self-organization in natural systems demonstrates very reliable and scalable collective behavior without using any central elements. When providing collective robotic systems with self-organizing principles, we are facing new problems of making self-organization purposeful, self-adapting to changing environments and faster, in order to meet requirements from a technical perspective. This paper describes on-going work of creating such an artificial self-organization within artificial robot organisms, performed in the framework of several European projects.}},
  author       = {{Kernbach, Serge and Hamann, Heiko and Stradner, Jürgen and Thenius, Ronald and Schmickl, Thomas and Crailsheim, Karl and Rossum, A.C. van and Sebag, Michele and Bredeche, Nicolas and Yao, Yao and Baele, Guy and Peer, Yves Van de and Timmis, Jon and Mohktar, Maizura and Tyrrell, Andy and Eiben, A.E. and McKibbin, S.P. and Liu, Wenguo and Winfield, Alan F.T.}},
  booktitle    = {{2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns}},
  isbn         = {{9781424451661}},
  title        = {{{On Adaptive Self-Organization in Artificial Robot Organisms}}},
  doi          = {{10.1109/computationworld.2009.9}},
  year         = {{2010}},
}

@article{24282,
  author       = {{Grza̧ślewicz, Ryszard and Kutyłowski, Jarosław and Kutyłowski, Mirosław and Pietkiewicz, Wojciech}},
  issn         = {{0302-9743}},
  journal      = {{ICCSA'05: Proceedings of the 2005 international conference on Computational Science and Its Applications}},
  title        = {{{Robust Undetectable Interference Watermarks}}},
  doi          = {{10.1007/11424826_55}},
  year         = {{2010}},
}

@inproceedings{3195,
  author       = {{Schneider, Steve and Treharne, Helen and Wehrheim, Heike}},
  booktitle    = {{Integrated Formal Methods - 8th International Conference, {IFM} 2010, Nancy, France, October 11-14, 2010. Proceedings}},
  editor       = {{M{\'{e}}ry, Dominique and Merz, Stephan}},
  pages        = {{260----274}},
  title        = {{{A {CSP} Approach to Control in Event-B}}},
  doi          = {{10.1007/978-3-642-16265-7_19}},
  year         = {{2010}},
}

@inproceedings{3196,
  author       = {{Dräger, Klaus and Kupriyanov, Andrey and Finkbeiner, Bernd and Wehrheim, Heike}},
  booktitle    = {{Tools and Algorithms for the Construction and Analysis of Systems, 16th International Conference, {TACAS} 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings}},
  editor       = {{Esparza, Javier and Majumdar, Rupak}},
  pages        = {{271----274}},
  title        = {{{{SLAB:} {A} Certifying Model Checker for Infinite-State Concurrent Systems}}},
  doi          = {{10.1007/978-3-642-12002-2_22}},
  year         = {{2010}},
}

@article{3198,
  author       = {{Steenken, Dominik and Wehrheim, Heike and Wonisch, Daniel}},
  journal      = {{CoRR}},
  title        = {{{Towards {A} Shape Analysis for Graph Transformation Systems}}},
  year         = {{2010}},
}