@inproceedings{13198, author = {{Hüllermeier, Eyke and Schlegel, P.}}, booktitle = {{In Proceedings ICCBR-2011, 19th International Conference on Case-Based Reasoning, number 6880 in LNAI}}, editor = {{Ram, A. and Wiratunga, N.}}, pages = {{77--91}}, publisher = {{Springer}}, title = {{{Preference-based CBR: First steps toward a methodological framework}}}, year = {{2011}}, } @inproceedings{13588, author = {{Kotlowski, W. and Dembczynski, K. and Hüllermeier, Eyke}}, booktitle = {{in Proceedings ICML-2011, 28th International Conference on Machine Learning, Washington, USA}}, title = {{{Bipartite ranking through minimization of univariate loss}}}, year = {{2011}}, } @inproceedings{13643, author = {{Agne, Andreas and Platzner, Marco and Lübbers, Enno}}, booktitle = {{Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)}}, isbn = {{9781457714849}}, pages = {{185--188}}, publisher = {{IEEE}}, title = {{{Memory Virtualization for Multithreaded Reconfigurable Hardware}}}, doi = {{10.1109/fpl.2011.42}}, year = {{2011}}, } @inproceedings{13644, author = {{Henkel, Jörg and Hedrich, Lars and Herkersdorf, Andreas and Kapitza, Rüdiger and Lohmann, Daniel and Marwedel, Peter and Platzner, Marco and Rosenstiel, Wolfgang and Schlichtmann, Ulf and Spinczyk, Olaf and Tahoori, Mehdi and Bauer, Lars and Teich, Jürgen and Wehn, Norbert and Wunderlich, Hans-Joachim and Becker, Joachim and Bringmann, Oliver and Brinkschulte, Uwe and Chakraborty, Samarjit and Engel, Michael and Ernst, Rolf and Härtig, Hermann}}, booktitle = {{Proceedings of the seventh IEEE/ACM/IFIP International Conference on Hardware/software Codesign and system synthesis - CODES+ISSS '11}}, isbn = {{9781450307154}}, title = {{{Design and architectures for dependable embedded systems}}}, doi = {{10.1145/2039370.2039384}}, year = {{2011}}, } @article{1376, author = {{Dannewitz, Christian and Biermann, Thorsten and Dräxler, Martin and Karl, Holger}}, issn = {{1798-2340}}, journal = {{Journal of Advances in Information Technology}}, number = {{1}}, publisher = {{Engineering and Technology Publishing}}, title = {{{Complex Queries in P2P Networks with Resource-Constrained Devices}}}, doi = {{10.4304/jait.2.1.2-14}}, volume = {{2}}, year = {{2011}}, } @inproceedings{46401, abstract = {{Exploratory Landscape Analysis subsumes a number of techniques employed to obtain knowledge about the properties of an unknown optimization problem, especially insofar as these properties are important for the performance of optimization algorithms. Where in a first attempt, one could rely on high-level features designed by experts, we approach the problem from a different angle here, namely by using relatively cheap low-level computer generated features. Interestingly, very few features are needed to separate the BBOB problem groups and also for relating a problem to high-level, expert designed features, paving the way for automatic algorithm selection.}}, author = {{Mersmann, Olaf and Bischl, Bernd and Trautmann, Heike and Preuss, Mike and Weihs, Claus and Rudolph, Günter}}, booktitle = {{Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation}}, isbn = {{9781450305570}}, keywords = {{exploratory landscape analysis, evolutionary optimization, fitness landscape, benchmarking, BBOB test set}}, pages = {{829–836}}, publisher = {{Association for Computing Machinery}}, title = {{{Exploratory Landscape Analysis}}}, doi = {{10.1145/2001576.2001690}}, year = {{2011}}, } @inproceedings{46402, abstract = {{The use of multi-objective evolutionary algorithms for solving black-box problems with multiple conflicting objectives has become an important research area. However, when no gradient information is available, the examination of formal convergence or optimality criteria is often impossible. Thus, sophisticated heuristic online stopping criteria (OSC) have recently become subject of intensive research. In order to establish formal guidelines for a systematic research, we present a taxonomy of OSC in this paper. We integrate the known approaches within the taxonomy and discuss them by extracting their building blocks. The formal structure of the taxonomy is used as a basis for the implementation of a comprehensive MATLAB toolbox. Both contributions, the formal taxonomy and the MATLAB implementation, provide a framework for the analysis and evaluation of existing and new OSC approaches.}}, author = {{Wagner, Tobias and Trautmann, Heike and Martí, Luis}}, booktitle = {{Evolutionary Multi-Criterion Optimization}}, editor = {{Takahashi, Ricardo H. C. and Deb, Kalyanmoy and Wanner, Elizabeth F. and Greco, Salvatore}}, isbn = {{978-3-642-19893-9}}, pages = {{16–30}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{A Taxonomy of Online Stopping Criteria for Multi-Objective Evolutionary Algorithms}}}, doi = {{https://doi.org/10.1007/978-3-642-19893-9_2}}, year = {{2011}}, } @article{46403, abstract = {{ Evolutionary (multi-objective optimization) algorithms (EMOAs) are widely accepted to be competitive optimization methods in industry today. However, normally only standard techniques are employed by the engineering experts. Here, it is shown how these standard techniques can be completed and improved with respect to interactivity to other tools, runtime, and parameterization. The coupling with metamodels serves as an example for the interactivity to other tools, while the online convergence detection relates to runtime, i.e. stopping criteria. Finally, sequential parameter optimization improves results focussing on parameter tuning. We show that invoking all these methods on their own already enhances EMOAs for aerodynamic applications. It is concluded with an outlook on how these methods might come together to foster aerospace applications and, at a time, widen the application area to multi-disciplinary optimization tasks. }}, author = {{Naujoks, B and Trautmann, Heike and Wessing, S and Weihs, C}}, journal = {{Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering}}, number = {{10}}, pages = {{1081--1096}}, title = {{{Advanced concepts for multi-objective evolutionary optimization in aircraft industry}}}, doi = {{10.1177/0954410011414120}}, volume = {{225}}, year = {{2011}}, } @phdthesis{2910, author = {{ Naewe, Stefanie}}, publisher = {{Universität Paderborn}}, title = {{{Algorithms for lattice problems with respect to general norms}}}, year = {{2011}}, } @inproceedings{37001, author = {{Becker, Markus and Zabel, Henning and Müller, Wolfgang and Elfeky, Ahmed}}, title = {{{Virtual Prototyping software-intensiver mechatronischer Systeme - Eine Fallstudie}}}, year = {{2011}}, } @inproceedings{37005, author = {{Kuznik, Christoph and Müller, Wolfgang}}, location = {{San Jose, CA}}, title = {{{A SystemC Based Library for Functional Coverage}}}, year = {{2011}}, } @inproceedings{37006, abstract = {{In this paper we present an approach for the configuration and reconfiguration of FlexRay networks to increase their fault tolerance. To guarantee a correct and deterministic system behavior, the FlexRay specification does not allow a reconfiguration of the schedapproachule during run time. To avoid the necessity of a complete bus restart in case of a node failure, we propose a reconfiguration using redundant slots in the schedule and/or combine messages in existing frames and slots, to compensate node failures and increase robustness. Our approach supports the developer to increase the fault tolerance of the system during the design phase. It is a heuristic, which, additionally to a determined initial configuration, calculates possible reconfigurations for the remaining nodes of the FlexRay network in case of a node failure, to keep the system working properly. An evaluation by means of realistic safety-critical automotive real-time systems revealed that it determines valid reconfigurations for up to 80% of possible individual node failures. In summary, our approach offers major support for the developer of FlexRay networks since the results provide helpful feedback about reconfiguration capabilities. In an iterative design process these information can be used to determine and optimize valid reconfigurations.}}, author = {{Klobedanz, Kay and König, Andreas and Müller, Wolfgang}}, booktitle = {{Proceedings of DATE'11}}, keywords = {{Schedules, Fault tolerant systems, Redundancy, Protocols, Automotive engineering, Genetic algorithms}}, location = {{Grenoble, France}}, publisher = {{IEEE}}, title = {{{A Reconfiguration Approach for Faul-Tolerant FlexRay Networks}}}, doi = {{10.1109/DATE.2011.5763022}}, year = {{2011}}, } @article{8178, abstract = {{In [Piani et al., PRL106 (2011) 220403], an activation protocol was introduced which maps the general non-classical (multipartite) correlations between given systems into bipartite entanglement between the systems and local ancillae by means of a potentially highly entangling interaction. Here, we study how this activation protocol can be used to entangle the starting systems themselves via entanglement swapping through a measurement on the ancillae. Furthermore, we bound the relative entropy of quantumness (a naturally arising measure of non-classicality in the scheme of Piani et al. above) for a special class of separable states, the so-called classical–quantum states. In particular, we fully characterize the classical–quantum two-qubit states that are maximally non-classical.}}, author = {{Gharibian, Sevag and PIANI, MARCO and ADESSO, GERARDO and CALSAMIGLIA, JOHN and HORODECKI, PAWEŁ}}, issn = {{0219-7499}}, journal = {{International Journal of Quantum Information}}, number = {{07n08}}, pages = {{1701--1713}}, publisher = {{World Scientific Pub Co Pte Lt}}, title = {{{Characterizing Quantumness via Entanglement Creation}}}, doi = {{10.1142/s0219749911008258}}, volume = {{09}}, year = {{2011}}, } @inproceedings{8176, abstract = {{Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hamiltonian problem and initiate its study. We present two main results. The first shows that a non-trivial approximation ratio can be obtained in the class NP using product states. The second result (which builds on the first one), gives a polynomial time (classical) algorithm providing a similar approximation ratio for dense instances of the problem. The latter result is based on an adaptation of the "exhaustive sampling method" by Arora et al. [J. Comp. Sys. Sci. 58, p.193 (1999)] to the quantum setting, and might be of independent interest.}}, author = {{Gharibian, Sevag and Kempe, Julia}}, booktitle = {{IEEE Annual Conference on Computational Complexity (CCC 2011)}}, isbn = {{9781457701795}}, location = {{San Jose, USA}}, publisher = {{IEEE}}, title = {{{Approximation Algorithms for QMA-Complete Problems}}}, doi = {{10.1109/ccc.2011.15}}, year = {{2011}}, } @article{8177, abstract = {{We devise a protocol in which general nonclassical multipartite correlations produce a physically relevant effect, leading to the creation of bipartite entanglement. In particular, we show that the relative entropy of quantumness, which measures all nonclassical correlations among subsystems of a quantum system, is equivalent to and can be operationally interpreted as the minimum distillable entanglement generated between the system and local ancillae in our protocol. We emphasize the key role of state mixedness in maximizing nonclassicality: Mixed entangled states can be arbitrarily more nonclassical than separable and pure entangled states.}}, author = {{Piani, Marco and Gharibian, Sevag and Adesso, Gerardo and Calsamiglia, John and Horodecki, Paweł and Winter, Andreas}}, issn = {{0031-9007}}, journal = {{Physical Review Letters}}, number = {{22}}, publisher = {{American Physical Society (APS)}}, title = {{{All Nonclassical Correlations Can Be Activated into Distillable Entanglement}}}, doi = {{10.1103/physrevlett.106.220403}}, volume = {{106}}, year = {{2011}}, } @inproceedings{2194, author = {{Meyer, Björn and Plessl, Christian and Förstner, Jens}}, booktitle = {{Symp. on Application Accelerators in High Performance Computing (SAAHPC)}}, keywords = {{tet_topic_hpc}}, pages = {{60--63}}, publisher = {{IEEE Computer Society}}, title = {{{Transformation of scientific algorithms to parallel computing code: subdomain support in a MPI-multi-GPU backend}}}, doi = {{10.1109/SAAHPC.2011.12}}, year = {{2011}}, } @inproceedings{2193, author = {{Beisel, Tobias and Wiersema, Tobias and Plessl, Christian and Brinkmann, André}}, booktitle = {{Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)}}, pages = {{223--226}}, publisher = {{IEEE Computer Society}}, title = {{{Cooperative multitasking for heterogeneous accelerators in the Linux Completely Fair Scheduler}}}, doi = {{10.1109/ASAP.2011.6043273}}, year = {{2011}}, } @inproceedings{656, abstract = {{In the next decades, hybrid multi-cores will be the predominant architecture for reconfigurable FPGA-based systems. Temperature-aware thread mapping strategies are key for providing dependability in such systems. These strategies rely on measuring the temperature distribution and redicting the thermal behavior of the system when there are changes to the hardware and software running on the FPGA. While there are a number of tools that use thermal models to predict temperature distributions at design time, these tools lack the flexibility to autonomously adjust to changing FPGA configurations. To address this problem we propose a temperature-aware system that empowers FPGA-based reconfigurable multi-cores to autonomously predict the on-chip temperature distribution for pro-active thread remapping. Our system obtains temperature measurements through a self-calibrating grid of sensors and uses area constrained heat-generating circuits in order to generate spatial and temporal temperature gradients. The generated temperature variations are then used to learn the free parameters of the system's thermal model. The system thus acquires an understanding of its own thermal characteristics. We implemented an FPGA system containing a net of 144 temperature sensors on a Xilinx Virtex-6 LX240T FPGA that is aware of its thermal model. Finally, we show that the temperature predictions vary less than 0.72 degree C on average compared to the measured temperature distributions at run-time.}}, author = {{Happe, Markus and Agne, Andreas and Plessl, Christian}}, booktitle = {{Proceedings of the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig)}}, pages = {{55--60}}, publisher = {{IEEE}}, title = {{{Measuring and Predicting Temperature Distributions on FPGAs at Run-Time}}}, doi = {{10.1109/ReConFig.2011.59}}, year = {{2011}}, } @inproceedings{2200, author = {{Kenter, Tobias and Platzner, Marco and Plessl, Christian and Kauschke, Michael}}, booktitle = {{Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)}}, isbn = {{978-1-4503-0554-9}}, keywords = {{design space exploration, LLVM, partitioning, performance, estimation, funding-intel}}, pages = {{177--180}}, publisher = {{ACM}}, title = {{{Performance Estimation Framework for Automated Exploration of CPU-Accelerator Architectures}}}, doi = {{10.1145/1950413.1950448}}, year = {{2011}}, } @article{2201, author = {{Schumacher, Tobias and Süß, Tim and Plessl, Christian and Platzner, Marco}}, journal = {{Int. Journal of Recon- figurable Computing (IJRC)}}, keywords = {{funding-altera}}, publisher = {{Hindawi Publishing Corp.}}, title = {{{FPGA Acceleration of Communication-bound Streaming Applications: Architecture Modeling and a 3D Image Compositing Case Study}}}, doi = {{10.1155/2011/760954}}, year = {{2011}}, }