[{"date_created":"2019-06-07T09:20:45Z","type":"book_chapter","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"publication":"Combining Experimentation and Theory","citation":{"mla":"Hüllermeier, Eyke. “Fuzzy Rules in Data Mining: From Fuzzy Associations to Gradual Dependencies.” <i>Combining Experimentation and Theory</i>, edited by E. Trillas et al., vol. 271, Springer, 2012, pp. 123–35.","bibtex":"@inbook{Hüllermeier_2012, series={Studies in Fuzziness and Soft Computing}, title={Fuzzy rules in data mining: From fuzzy associations to gradual dependencies}, volume={271}, booktitle={Combining Experimentation and Theory}, publisher={Springer}, author={Hüllermeier, Eyke}, editor={Trillas, E. and Bonissone, P.P. and Magdalena, L. and Kacprzyk, J.Editors}, year={2012}, pages={123–135}, collection={Studies in Fuzziness and Soft Computing} }","ama":"Hüllermeier E. Fuzzy rules in data mining: From fuzzy associations to gradual dependencies. In: Trillas E, Bonissone PP, Magdalena L, Kacprzyk J, eds. <i>Combining Experimentation and Theory</i>. Vol 271. Studies in Fuzziness and Soft Computing. Springer; 2012:123-135.","ieee":"E. Hüllermeier, “Fuzzy rules in data mining: From fuzzy associations to gradual dependencies,” in <i>Combining Experimentation and Theory</i>, vol. 271, E. Trillas, P. P. Bonissone, L. Magdalena, and J. Kacprzyk, Eds. Springer, 2012, pp. 123–135.","apa":"Hüllermeier, E. (2012). Fuzzy rules in data mining: From fuzzy associations to gradual dependencies. In E. Trillas, P. P. Bonissone, L. Magdalena, &#38; J. Kacprzyk (Eds.), <i>Combining Experimentation and Theory</i> (Vol. 271, pp. 123–135). Springer.","chicago":"Hüllermeier, Eyke. “Fuzzy Rules in Data Mining: From Fuzzy Associations to Gradual Dependencies.” In <i>Combining Experimentation and Theory</i>, edited by E. Trillas, P.P. Bonissone, L. Magdalena, and J. Kacprzyk, 271:123–35. Studies in Fuzziness and Soft Computing. Springer, 2012.","short":"E. Hüllermeier, in: E. Trillas, P.P. Bonissone, L. Magdalena, J. Kacprzyk (Eds.), Combining Experimentation and Theory, Springer, 2012, pp. 123–135."},"page":"123-135","_id":"10153","publisher":"Springer","series_title":"Studies in Fuzziness and Soft Computing","language":[{"iso":"eng"}],"user_id":"49109","editor":[{"last_name":"Trillas","first_name":"E.","full_name":"Trillas, E."},{"full_name":"Bonissone, P.P.","last_name":"Bonissone","first_name":"P.P."},{"full_name":"Magdalena, L.","last_name":"Magdalena","first_name":"L."},{"full_name":"Kacprzyk, J.","first_name":"J.","last_name":"Kacprzyk"}],"volume":271,"year":"2012","title":"Fuzzy rules in data mining: From fuzzy associations to gradual dependencies","status":"public","author":[{"id":"48129","first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke"}],"date_updated":"2022-01-06T06:50:31Z","intvolume":"       271"},{"abstract":[{"text":"The Unified Modeling Language (UML) is now widely accepted by the software community. More recently, UML has attracted attention as a unification language for systems description combining both hardware and software components. First, it has been recognized that electronic systems design can no longer be seen as an isolated hardware design activity. In addition, recent advances in tools supporting high level hardware synthesis from electronic system level languages, which are predominantly based on C/C++, open new perspectives for automatic code generation from UML models and opportunities to enhance the link between a high level specification and a concrete hardware/software implementation. Finally, UML has become a general purpose language which can be customized for specific purposes, such as the modelization of electronic systems. This chapter presents recent advances of the UML language applied to System-on-Chip (SoC) and hardware-related embedded systems design. In particular, several examples of specific UML customizations (UML profiles) relevant for SoC design are summarized. Various approaches associating UML with existing hardware/software design languages are presented. The question of tool support and association with well-known simulation environments, such as MATLAB/Simulink, is addressed as well. A concrete example of a UML profile for hardware/software co-modeling and code generation for hardware/software co-simulation is presented in more details for illustration purposes.","lang":"eng"}],"publication":"Design Technology for Heterogeneous Embedded Systems","citation":{"apa":"Vanderperren, Y., Müller, W., He, D., Mischkalla, F., &#38; Dahaene, W. (2012). Extending UML for Electronic Systems Design: A Code Generation Perspective. In G. Nicolescu, I. O’Connor, &#38; C. Piguet (Eds.), <i>Design Technology for Heterogeneous Embedded Systems</i> (1st Edition. Auflage, pp. 13–39). Springer Verlag.","mla":"Vanderperren, Yves, et al. “Extending UML for Electronic Systems Design: A Code Generation Perspective.” <i>Design Technology for Heterogeneous Embedded Systems</i>, edited by Gabriela Nicolescu et al., 1st Edition. Auflage, Springer Verlag, 2012, pp. 13–39.","ieee":"Y. Vanderperren, W. Müller, D. He, F. Mischkalla, and W. Dahaene, “Extending UML for Electronic Systems Design: A Code Generation Perspective,” in <i>Design Technology for Heterogeneous Embedded Systems</i>, 1st Edition. Auflage., G. Nicolescu, I. O’Connor, and C. Piguet, Eds. Springer Verlag, 2012, pp. 13–39.","chicago":"Vanderperren, Yves, Wolfgang Müller, Da He, Fabian Mischkalla, and Wim Dahaene. “Extending UML for Electronic Systems Design: A Code Generation Perspective.” In <i>Design Technology for Heterogeneous Embedded Systems</i>, edited by Gabriela Nicolescu, Ian O’Connor, and Christian Piguet, 1st Edition. Auflage., 13–39. Springer Verlag, 2012.","ama":"Vanderperren Y, Müller W, He D, Mischkalla F, Dahaene W. Extending UML for Electronic Systems Design: A Code Generation Perspective. In: Nicolescu G, O’Connor I, Piguet C, eds. <i>Design Technology for Heterogeneous Embedded Systems</i>. 1st Edition. Auflage. Springer Verlag; 2012:13-39.","short":"Y. Vanderperren, W. Müller, D. He, F. Mischkalla, W. Dahaene, in: G. Nicolescu, I. O’Connor, C. Piguet (Eds.), Design Technology for Heterogeneous Embedded Systems, 1st Edition. Auflage, Springer Verlag, 2012, pp. 13–39.","bibtex":"@inbook{Vanderperren_Müller_He_Mischkalla_Dahaene_2012, edition={1st Edition. Auflage}, title={Extending UML for Electronic Systems Design: A Code Generation Perspective}, booktitle={Design Technology for Heterogeneous Embedded Systems}, publisher={Springer Verlag}, author={Vanderperren, Yves and Müller, Wolfgang and He, Da and Mischkalla, Fabian and Dahaene, Wim}, editor={Nicolescu, Gabriela and O’Connor, Ian and Piguet, Christian}, year={2012}, pages={13–39} }"},"type":"book_chapter","department":[{"_id":"672"}],"date_created":"2021-10-21T12:14:17Z","date_updated":"2022-10-18T09:53:40Z","year":"2012","status":"public","title":"Extending UML for Electronic Systems Design: A Code Generation Perspective","author":[{"full_name":"Vanderperren, Yves","first_name":"Yves","last_name":"Vanderperren"},{"last_name":"Müller","first_name":"Wolfgang","full_name":"Müller, Wolfgang","id":"16243"},{"full_name":"He, Da","last_name":"He","first_name":"Da"},{"full_name":"Mischkalla, Fabian","last_name":"Mischkalla","first_name":"Fabian"},{"full_name":"Dahaene, Wim","last_name":"Dahaene","first_name":"Wim"}],"publication_identifier":{"isbn":["978-94-007-1125-9"]},"user_id":"5786","editor":[{"full_name":"Nicolescu, Gabriela","first_name":"Gabriela","last_name":"Nicolescu"},{"first_name":"Ian","last_name":"O'Connor","full_name":"O'Connor, Ian"},{"full_name":"Piguet, Christian","first_name":"Christian","last_name":"Piguet"}],"page":"13-39","_id":"26695","language":[{"iso":"eng"}],"edition":"1st Edition. Auflage","publisher":"Springer Verlag"},{"publication":"Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation","abstract":[{"text":"In multiobjective optimization, set-based performance indicators are commonly used to assess the quality of a Pareto front approximation. Based on the scalarization obtained by these indicators, a performance comparison of multiobjective optimization algorithms becomes possible. The R2 and the Hypervolume (HV) indicator represent two recommended approaches which have shown a correlated behavior in recent empirical studies. Whereas the HV indicator has been comprehensively analyzed in the last years, almost no studies on the R2 indicator exist. In this paper, we thus perform a comprehensive investigation of the properties of the R2 indicator in a theoretical and empirical way. The influence of the number and distribution of the weight vectors on the optimal distribution of μ solutions is analyzed. Based on a comparative analysis, specific characteristics and differences of the R2 and HV indicator are presented.","lang":"eng"}],"date_created":"2023-08-04T15:52:42Z","keyword":["hypervolume indicator","multiobjective optimization","performance assessment","r2 indicator"],"type":"conference","department":[{"_id":"34"},{"_id":"819"}],"year":"2012","title":"On the Properties of the R2 Indicator","author":[{"first_name":"Dimo","last_name":"Brockhoff","full_name":"Brockhoff, Dimo"},{"full_name":"Wagner, Tobias","first_name":"Tobias","last_name":"Wagner"},{"full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike","id":"100740"}],"publication_identifier":{"isbn":["9781450311779"]},"date_updated":"2023-10-16T13:47:23Z","series_title":"GECCO ’12","language":[{"iso":"eng"}],"doi":"10.1145/2330163.2330230","citation":{"bibtex":"@inproceedings{Brockhoff_Wagner_Trautmann_2012, place={New York, NY, USA}, series={GECCO ’12}, title={On the Properties of the R2 Indicator}, DOI={<a href=\"https://doi.org/10.1145/2330163.2330230\">10.1145/2330163.2330230</a>}, booktitle={Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation}, publisher={Association for Computing Machinery}, author={Brockhoff, Dimo and Wagner, Tobias and Trautmann, Heike}, year={2012}, pages={465–472}, collection={GECCO ’12} }","ama":"Brockhoff D, Wagner T, Trautmann H. On the Properties of the R2 Indicator. In: <i>Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation</i>. GECCO ’12. Association for Computing Machinery; 2012:465–472. doi:<a href=\"https://doi.org/10.1145/2330163.2330230\">10.1145/2330163.2330230</a>","mla":"Brockhoff, Dimo, et al. “On the Properties of the R2 Indicator.” <i>Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation</i>, Association for Computing Machinery, 2012, pp. 465–472, doi:<a href=\"https://doi.org/10.1145/2330163.2330230\">10.1145/2330163.2330230</a>.","short":"D. Brockhoff, T. Wagner, H. Trautmann, in: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, Association for Computing Machinery, New York, NY, USA, 2012, pp. 465–472.","chicago":"Brockhoff, Dimo, Tobias Wagner, and Heike Trautmann. “On the Properties of the R2 Indicator.” In <i>Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation</i>, 465–472. GECCO ’12. New York, NY, USA: Association for Computing Machinery, 2012. <a href=\"https://doi.org/10.1145/2330163.2330230\">https://doi.org/10.1145/2330163.2330230</a>.","ieee":"D. Brockhoff, T. Wagner, and H. Trautmann, “On the Properties of the R2 Indicator,” in <i>Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation</i>, 2012, pp. 465–472, doi: <a href=\"https://doi.org/10.1145/2330163.2330230\">10.1145/2330163.2330230</a>.","apa":"Brockhoff, D., Wagner, T., &#38; Trautmann, H. (2012). On the Properties of the R2 Indicator. <i>Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation</i>, 465–472. <a href=\"https://doi.org/10.1145/2330163.2330230\">https://doi.org/10.1145/2330163.2330230</a>"},"place":"New York, NY, USA","status":"public","page":"465–472","_id":"46397","publisher":"Association for Computing Machinery","user_id":"15504"},{"citation":{"short":"B. Bischl, O. Mersmann, H. Trautmann, M. Preuß, in: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, Association for Computing Machinery, New York, NY, USA, 2012, pp. 313–320.","chicago":"Bischl, Bernd, Olaf Mersmann, Heike Trautmann, and Mike Preuß. “Algorithm Selection Based on Exploratory Landscape Analysis and Cost-Sensitive Learning.” In <i>Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation</i>, 313–320. GECCO ’12. New York, NY, USA: Association for Computing Machinery, 2012. <a href=\"https://doi.org/10.1145/2330163.2330209\">https://doi.org/10.1145/2330163.2330209</a>.","ieee":"B. Bischl, O. Mersmann, H. Trautmann, and M. Preuß, “Algorithm Selection Based on Exploratory Landscape Analysis and Cost-Sensitive Learning,” in <i>Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation</i>, 2012, pp. 313–320, doi: <a href=\"https://doi.org/10.1145/2330163.2330209\">10.1145/2330163.2330209</a>.","apa":"Bischl, B., Mersmann, O., Trautmann, H., &#38; Preuß, M. (2012). Algorithm Selection Based on Exploratory Landscape Analysis and Cost-Sensitive Learning. <i>Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation</i>, 313–320. <a href=\"https://doi.org/10.1145/2330163.2330209\">https://doi.org/10.1145/2330163.2330209</a>","bibtex":"@inproceedings{Bischl_Mersmann_Trautmann_Preuß_2012, place={New York, NY, USA}, series={GECCO ’12}, title={Algorithm Selection Based on Exploratory Landscape Analysis and Cost-Sensitive Learning}, DOI={<a href=\"https://doi.org/10.1145/2330163.2330209\">10.1145/2330163.2330209</a>}, booktitle={Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation}, publisher={Association for Computing Machinery}, author={Bischl, Bernd and Mersmann, Olaf and Trautmann, Heike and Preuß, Mike}, year={2012}, pages={313–320}, collection={GECCO ’12} }","ama":"Bischl B, Mersmann O, Trautmann H, Preuß M. Algorithm Selection Based on Exploratory Landscape Analysis and Cost-Sensitive Learning. In: <i>Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation</i>. GECCO ’12. Association for Computing Machinery; 2012:313–320. doi:<a href=\"https://doi.org/10.1145/2330163.2330209\">10.1145/2330163.2330209</a>","mla":"Bischl, Bernd, et al. “Algorithm Selection Based on Exploratory Landscape Analysis and Cost-Sensitive Learning.” <i>Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation</i>, Association for Computing Machinery, 2012, pp. 313–320, doi:<a href=\"https://doi.org/10.1145/2330163.2330209\">10.1145/2330163.2330209</a>."},"place":"New York, NY, USA","status":"public","user_id":"15504","page":"313–320","_id":"46396","publisher":"Association for Computing Machinery","abstract":[{"lang":"eng","text":"The steady supply of new optimization methods makes the algorithm selection problem (ASP) an increasingly pressing and challenging task, specially for real-world black-box optimization problems. The introduced approach considers the ASP as a cost-sensitive classification task which is based on Exploratory Landscape Analysis. Low-level features gathered by systematic sampling of the function on the feasible set are used to predict a well-performing algorithm out of a given portfolio. Example-specific label costs are defined by the expected runtime of each candidate algorithm. We use one-sided support vector regression to solve this learning problem. The approach is illustrated by means of the optimization problems and algorithms of the BBOB’09/10 workshop."}],"publication":"Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation","type":"conference","keyword":["machine learning","exploratory landscape analysis","fitness landscape","benchmarking","evolutionary optimization","bbob test set","algorithm selection"],"department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T15:51:56Z","date_updated":"2023-10-16T13:48:48Z","title":"Algorithm Selection Based on Exploratory Landscape Analysis and Cost-Sensitive Learning","year":"2012","author":[{"last_name":"Bischl","first_name":"Bernd","full_name":"Bischl, Bernd"},{"full_name":"Mersmann, Olaf","last_name":"Mersmann","first_name":"Olaf"},{"full_name":"Trautmann, Heike","first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","id":"100740"},{"full_name":"Preuß, Mike","last_name":"Preuß","first_name":"Mike"}],"publication_identifier":{"isbn":["9781450311779"]},"doi":"10.1145/2330163.2330209","series_title":"GECCO ’12","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"_id":"46399","page":"249–275","volume":20,"doi":"10.1162/EVCO_a_00069","user_id":"15504","author":[{"full_name":"Bischl, B","first_name":"B","last_name":"Bischl"},{"first_name":"O","last_name":"Mersmann","full_name":"Mersmann, O"},{"first_name":"Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","full_name":"Trautmann, Heike","id":"100740"},{"last_name":"Weihs","first_name":"C","full_name":"Weihs, C"}],"title":"Resampling Methods in Model Validation","year":"2012","status":"public","intvolume":"        20","date_updated":"2023-10-16T13:53:58Z","date_created":"2023-08-04T15:54:41Z","department":[{"_id":"34"},{"_id":"819"}],"type":"journal_article","citation":{"mla":"Bischl, B., et al. “Resampling Methods in Model Validation.” <i>Evolutionary Computation Journal</i>, vol. 20, no. 2, 2012, pp. 249–275, doi:<a href=\"https://doi.org/10.1162/EVCO_a_00069\">10.1162/EVCO_a_00069</a>.","bibtex":"@article{Bischl_Mersmann_Trautmann_Weihs_2012, title={Resampling Methods in Model Validation}, volume={20}, DOI={<a href=\"https://doi.org/10.1162/EVCO_a_00069\">10.1162/EVCO_a_00069</a>}, number={2}, journal={Evolutionary Computation Journal}, author={Bischl, B and Mersmann, O and Trautmann, Heike and Weihs, C}, year={2012}, pages={249–275} }","ama":"Bischl B, Mersmann O, Trautmann H, Weihs C. Resampling Methods in Model Validation. <i>Evolutionary Computation Journal</i>. 2012;20(2):249–275. doi:<a href=\"https://doi.org/10.1162/EVCO_a_00069\">10.1162/EVCO_a_00069</a>","ieee":"B. Bischl, O. Mersmann, H. Trautmann, and C. Weihs, “Resampling Methods in Model Validation,” <i>Evolutionary Computation Journal</i>, vol. 20, no. 2, pp. 249–275, 2012, doi: <a href=\"https://doi.org/10.1162/EVCO_a_00069\">10.1162/EVCO_a_00069</a>.","apa":"Bischl, B., Mersmann, O., Trautmann, H., &#38; Weihs, C. (2012). Resampling Methods in Model Validation. <i>Evolutionary Computation Journal</i>, <i>20</i>(2), 249–275. <a href=\"https://doi.org/10.1162/EVCO_a_00069\">https://doi.org/10.1162/EVCO_a_00069</a>","chicago":"Bischl, B, O Mersmann, Heike Trautmann, and C Weihs. “Resampling Methods in Model Validation.” <i>Evolutionary Computation Journal</i> 20, no. 2 (2012): 249–275. <a href=\"https://doi.org/10.1162/EVCO_a_00069\">https://doi.org/10.1162/EVCO_a_00069</a>.","short":"B. Bischl, O. Mersmann, H. Trautmann, C. Weihs, Evolutionary Computation Journal 20 (2012) 249–275."},"publication":"Evolutionary Computation Journal","issue":"2","abstract":[{"text":"Meta-modeling has become a crucial tool in solving expensive optimization problems. Much of the work in the past has focused on finding a good regression method to model the fitness function. Examples include classical linear regression, splines, neural networks, Kriging and support vector regression. This paper specifically draws attention to the fact that assessing model accuracy is a crucial aspect in the meta-modeling framework. Resampling strategies such as cross-validation, subsampling, bootstrapping, and nested resampling are prominent methods for model validation and are systematically discussed with respect to possible pitfalls, shortcomings, and specific features. A survey of meta-modeling techniques within evolutionary optimization is provided. In addition, practical examples illustrating some of the pitfalls associated with model selection and performance assessment are presented. Finally, recommendations are given for choosing a model validation technique for a particular setting.","lang":"eng"}]},{"_id":"46400","language":[{"iso":"eng"}],"page":"610–621","volume":60,"doi":"10.1524/auto.2012.1033","user_id":"15504","author":[{"full_name":"Rudolph, G","first_name":"G","last_name":"Rudolph"},{"first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","full_name":"Trautmann, Heike","id":"100740"},{"first_name":"O","last_name":"Schütze","full_name":"Schütze, O"}],"year":"2012","title":"Homogene Approximation der Paretofront bei mehrkriteriellen Kontrollproblemen","status":"public","intvolume":"        60","date_updated":"2023-10-16T13:54:17Z","date_created":"2023-08-04T15:55:34Z","department":[{"_id":"34"},{"_id":"819"}],"type":"journal_article","citation":{"mla":"Rudolph, G., et al. “Homogene Approximation Der Paretofront Bei Mehrkriteriellen Kontrollproblemen.” <i>At-Automatisierungstechnik</i>, vol. 60, 2012, pp. 610–621, doi:<a href=\"https://doi.org/10.1524/auto.2012.1033\">10.1524/auto.2012.1033</a>.","ama":"Rudolph G, Trautmann H, Schütze O. Homogene Approximation der Paretofront bei mehrkriteriellen Kontrollproblemen. <i>at-Automatisierungstechnik</i>. 2012;60:610–621. doi:<a href=\"https://doi.org/10.1524/auto.2012.1033\">10.1524/auto.2012.1033</a>","bibtex":"@article{Rudolph_Trautmann_Schütze_2012, title={Homogene Approximation der Paretofront bei mehrkriteriellen Kontrollproblemen}, volume={60}, DOI={<a href=\"https://doi.org/10.1524/auto.2012.1033\">10.1524/auto.2012.1033</a>}, journal={at-Automatisierungstechnik}, author={Rudolph, G and Trautmann, Heike and Schütze, O}, year={2012}, pages={610–621} }","apa":"Rudolph, G., Trautmann, H., &#38; Schütze, O. (2012). Homogene Approximation der Paretofront bei mehrkriteriellen Kontrollproblemen. <i>At-Automatisierungstechnik</i>, <i>60</i>, 610–621. <a href=\"https://doi.org/10.1524/auto.2012.1033\">https://doi.org/10.1524/auto.2012.1033</a>","ieee":"G. Rudolph, H. Trautmann, and O. Schütze, “Homogene Approximation der Paretofront bei mehrkriteriellen Kontrollproblemen,” <i>at-Automatisierungstechnik</i>, vol. 60, pp. 610–621, 2012, doi: <a href=\"https://doi.org/10.1524/auto.2012.1033\">10.1524/auto.2012.1033</a>.","short":"G. Rudolph, H. Trautmann, O. Schütze, At-Automatisierungstechnik 60 (2012) 610–621.","chicago":"Rudolph, G, Heike Trautmann, and O Schütze. “Homogene Approximation Der Paretofront Bei Mehrkriteriellen Kontrollproblemen.” <i>At-Automatisierungstechnik</i> 60 (2012): 610–621. <a href=\"https://doi.org/10.1524/auto.2012.1033\">https://doi.org/10.1524/auto.2012.1033</a>."},"publication":"at-Automatisierungstechnik","abstract":[{"text":"Es   werden   mehrkriterielle   evolutio-näre   Algorithmen   (EMOA)   für   zwei-   und   höherdimensio-nale   Probleme   vorgestellt,   die   gleichmäßig   verteilte   Lö-sungen   entlang   der   wahren   Paretofront   generieren.   Diesist   insbesondere   wichtig   im   Kontext   mehrkriterieller   Kon-trollprobleme.   Die   Methodik   beruht   auf   der   Minimierungdes   gemittelten   Hausdorff-Abstandes in   Bezug   aufdie  Paretofront.  Die  EMOA-Varianten  werden  vergleichendzu  aktuellen   Verfahren  auf  Benchmarkproblemen   getestet.","lang":"ger"}]},{"publication":"Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219","extern":"1","abstract":[{"lang":"eng","text":"With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesman problem TSP. Although 2-opt is widely used in practice, it is hard to understand its success from a theoretical perspective. We take a statistical approach and examine the features of TSP instances that make the problem either hard or easy to solve. As a measure of problem difficulty for 2-opt we use the approximation ratio that it achieves on a given instance. Our investigations point out important features that make TSP instances hard or easy to be approximated by 2-opt."}],"date_created":"2023-11-14T15:58:59Z","keyword":["2-opt","Classification","Feature Selection","MARS","TSP"],"type":"conference","department":[{"_id":"819"}],"year":"2012","title":"Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness","publication_identifier":{"isbn":["978-3-642-34412-1"]},"author":[{"full_name":"Mersmann, Olaf","last_name":"Mersmann","first_name":"Olaf"},{"full_name":"Bischl, Bernd","last_name":"Bischl","first_name":"Bernd"},{"id":"102979","full_name":"Bossek, Jakob","first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","first_name":"Heike"},{"full_name":"Wagner, Markus","last_name":"Wagner","first_name":"Markus"},{"full_name":"Neumann, Frank","last_name":"Neumann","first_name":"Frank"}],"date_updated":"2023-12-13T10:48:58Z","language":[{"iso":"eng"}],"series_title":"LION 6","citation":{"bibtex":"@inproceedings{Mersmann_Bischl_Bossek_Trautmann_Wagner_Neumann_2012, place={Berlin, Heidelberg}, series={LION 6}, title={Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness}, booktitle={Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219}, publisher={Springer-Verlag}, author={Mersmann, Olaf and Bischl, Bernd and Bossek, Jakob and Trautmann, Heike and Wagner, Markus and Neumann, Frank}, year={2012}, pages={115–129}, collection={LION 6} }","ama":"Mersmann O, Bischl B, Bossek J, Trautmann H, Wagner M, Neumann F. Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. In: <i>Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219</i>. LION 6. Springer-Verlag; 2012:115–129.","short":"O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, F. Neumann, in: Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219, Springer-Verlag, Berlin, Heidelberg, 2012, pp. 115–129.","chicago":"Mersmann, Olaf, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner, and Frank Neumann. “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness.” In <i>Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219</i>, 115–129. LION 6. Berlin, Heidelberg: Springer-Verlag, 2012.","ieee":"O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, and F. Neumann, “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness,” in <i>Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219</i>, 2012, pp. 115–129.","mla":"Mersmann, Olaf, et al. “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness.” <i>Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219</i>, Springer-Verlag, 2012, pp. 115–129.","apa":"Mersmann, O., Bischl, B., Bossek, J., Trautmann, H., Wagner, M., &#38; Neumann, F. (2012). Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. <i>Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219</i>, 115–129."},"place":"Berlin, Heidelberg","status":"public","page":"115–129","_id":"48890","publisher":"Springer-Verlag","user_id":"102979"},{"date_created":"2023-11-14T15:58:59Z","type":"book_chapter","department":[{"_id":"819"}],"publication":"Learning and Intelligent Optimization","abstract":[{"lang":"eng","text":"With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesman problem (TSP). Although 2-opt is widely used in practice, it is hard to understand its success from a theoretical perspective. We take a statistical approach and examine the features of TSP instances that make the problem either hard or easy to solve. As a measure of problem difficulty for 2-opt we use the approximation ratio that it achieves on a given instance. Our investigations point out important features that make TSP instances hard or easy to be approximated by 2-opt."}],"extern":"1","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-34413-8_9","year":"2012","title":"Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness","author":[{"full_name":"Mersmann, Olaf","first_name":"Olaf","last_name":"Mersmann"},{"full_name":"Bischl, Bernd","last_name":"Bischl","first_name":"Bernd"},{"orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob","full_name":"Bossek, Jakob","id":"102979"},{"full_name":"Trautmann, Heike","first_name":"Heike","last_name":"Trautmann"},{"last_name":"Wagner","first_name":"Markus","full_name":"Wagner, Markus"},{"full_name":"Neumann, Frank","first_name":"Frank","last_name":"Neumann"}],"publication_identifier":{"isbn":["978-3-642-34412-1 978-3-642-34413-8"]},"date_updated":"2023-12-13T10:49:15Z","intvolume":"      7219","place":"Berlin, Heidelberg","citation":{"ama":"Mersmann O, Bischl B, Bossek J, Trautmann H, Wagner M, Neumann F. Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. In: <i>Learning and Intelligent Optimization</i>. Vol 7219. Springer Berlin Heidelberg; 2012:115–129. doi:<a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">10.1007/978-3-642-34413-8_9</a>","short":"O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, F. Neumann, in: Learning and Intelligent Optimization, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 115–129.","chicago":"Mersmann, Olaf, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner, and Frank Neumann. “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness.” In <i>Learning and Intelligent Optimization</i>, 7219:115–129. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">https://doi.org/10.1007/978-3-642-34413-8_9</a>.","bibtex":"@inbook{Mersmann_Bischl_Bossek_Trautmann_Wagner_Neumann_2012, place={Berlin, Heidelberg}, title={Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness}, volume={7219}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">10.1007/978-3-642-34413-8_9</a>}, booktitle={Learning and Intelligent Optimization}, publisher={Springer Berlin Heidelberg}, author={Mersmann, Olaf and Bischl, Bernd and Bossek, Jakob and Trautmann, Heike and Wagner, Markus and Neumann, Frank}, year={2012}, pages={115–129} }","mla":"Mersmann, Olaf, et al. “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness.” <i>Learning and Intelligent Optimization</i>, vol. 7219, Springer Berlin Heidelberg, 2012, pp. 115–129, doi:<a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">10.1007/978-3-642-34413-8_9</a>.","apa":"Mersmann, O., Bischl, B., Bossek, J., Trautmann, H., Wagner, M., &#38; Neumann, F. (2012). Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. In <i>Learning and Intelligent Optimization</i> (Vol. 7219, pp. 115–129). Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">https://doi.org/10.1007/978-3-642-34413-8_9</a>","ieee":"O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, and F. Neumann, “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness,” in <i>Learning and Intelligent Optimization</i>, vol. 7219, Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 115–129."},"page":"115–129","_id":"48888","publisher":"Springer Berlin Heidelberg","user_id":"102979","volume":7219,"status":"public"},{"publication":"Design, Automation and Test in Europe DATE","citation":{"mla":"Kuznik, Christoph, et al. “SYSTEMC UVM VERIFICATION COMPONENTS.” <i>Design, Automation and Test in Europe DATE</i>, 2012.","ama":"Kuznik C, Oliveira MF, Müller W. SYSTEMC UVM VERIFICATION COMPONENTS. <i>Design, Automation and Test in Europe DATE</i>. Published online 2012.","bibtex":"@article{Kuznik_Oliveira_Müller_2012, title={SYSTEMC UVM VERIFICATION COMPONENTS}, journal={Design, Automation and Test in Europe DATE}, author={Kuznik, Christoph and Oliveira, Marcio F. and Müller, Wolfgang}, year={2012} }","apa":"Kuznik, C., Oliveira, M. F., &#38; Müller, W. (2012). SYSTEMC UVM VERIFICATION COMPONENTS. <i>Design, Automation and Test in Europe DATE</i>.","ieee":"C. Kuznik, M. F. Oliveira, and W. Müller, “SYSTEMC UVM VERIFICATION COMPONENTS,” <i>Design, Automation and Test in Europe DATE</i>, 2012.","short":"C. Kuznik, M.F. Oliveira, W. Müller, Design, Automation and Test in Europe DATE (2012).","chicago":"Kuznik, Christoph, Marcio F. Oliveira, and Wolfgang Müller. “SYSTEMC UVM VERIFICATION COMPONENTS.” <i>Design, Automation and Test in Europe DATE</i>, 2012."},"abstract":[{"lang":"eng","text":"We present an enhanced UVM for SystemC library which incorporates verification best practices from OVM-ML and UVM as well as project partner implementations. Moreover, we extended functionality and implemented missing features, such as domain specific components, stimuli sequence generation and management, call-back facilities, response to request routing, transaction recording and many more. Apart from that, we added crucial verification components, such as functional coverage."}],"date_created":"2021-10-11T12:48:21Z","type":"journal_article","department":[{"_id":"672"}],"year":"2012","status":"public","title":"SYSTEMC UVM VERIFICATION COMPONENTS","author":[{"full_name":"Kuznik, Christoph","last_name":"Kuznik","first_name":"Christoph"},{"full_name":"Oliveira, Marcio F.","last_name":"Oliveira","first_name":"Marcio F."},{"full_name":"Müller, Wolfgang","first_name":"Wolfgang","last_name":"Müller","id":"16243"}],"conference":{"location":" University Booth, Dresden , Mrz. 2012"},"date_updated":"2024-04-18T21:07:25Z","_id":"26038","language":[{"iso":"eng"}],"user_id":"5786"},{"status":"public","title":"Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness","year":"2012","author":[{"last_name":"Mersmann","first_name":"Olaf","full_name":"Mersmann, Olaf"},{"last_name":"Bischl","first_name":"Bernd","full_name":"Bischl, Bernd"},{"full_name":"Bossek, Jakob","first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","id":"102979"},{"full_name":"Trautmann, Heike","first_name":"Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","id":"100740"},{"last_name":"Wagner","first_name":"Markus","full_name":"Wagner, Markus"},{"last_name":"Neumann","first_name":"Frank","full_name":"Neumann, Frank"}],"publication_identifier":{"isbn":["978-3-642-34413-8"]},"date_updated":"2024-06-10T11:57:32Z","page":"115–129","language":[{"iso":"eng"}],"_id":"46398","publisher":"Springer Berlin Heidelberg","user_id":"15504","doi":"https://doi.org/10.1007/978-3-642-34413-8_9","editor":[{"last_name":"Hamadi","first_name":"Youssef","full_name":"Hamadi, Youssef"},{"full_name":"Schoenauer, Marc","last_name":"Schoenauer","first_name":"Marc"}],"publication":"Learning and Intelligent Optimization","citation":{"ieee":"O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, and F. Neumann, “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness,” in <i>Learning and Intelligent Optimization</i>, 2012, pp. 115–129, doi: <a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">https://doi.org/10.1007/978-3-642-34413-8_9</a>.","apa":"Mersmann, O., Bischl, B., Bossek, J., Trautmann, H., Wagner, M., &#38; Neumann, F. (2012). Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. In Y. Hamadi &#38; M. Schoenauer (Eds.), <i>Learning and Intelligent Optimization</i> (pp. 115–129). Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">https://doi.org/10.1007/978-3-642-34413-8_9</a>","short":"O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, F. Neumann, in: Y. Hamadi, M. Schoenauer (Eds.), Learning and Intelligent Optimization, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 115–129.","chicago":"Mersmann, Olaf, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner, and Frank Neumann. “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness.” In <i>Learning and Intelligent Optimization</i>, edited by Youssef Hamadi and Marc Schoenauer, 115–129. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">https://doi.org/10.1007/978-3-642-34413-8_9</a>.","mla":"Mersmann, Olaf, et al. “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness.” <i>Learning and Intelligent Optimization</i>, edited by Youssef Hamadi and Marc Schoenauer, Springer Berlin Heidelberg, 2012, pp. 115–129, doi:<a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">https://doi.org/10.1007/978-3-642-34413-8_9</a>.","bibtex":"@inproceedings{Mersmann_Bischl_Bossek_Trautmann_Wagner_Neumann_2012, place={Berlin, Heidelberg}, title={Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">https://doi.org/10.1007/978-3-642-34413-8_9</a>}, booktitle={Learning and Intelligent Optimization}, publisher={Springer Berlin Heidelberg}, author={Mersmann, Olaf and Bischl, Bernd and Bossek, Jakob and Trautmann, Heike and Wagner, Markus and Neumann, Frank}, editor={Hamadi, Youssef and Schoenauer, Marc}, year={2012}, pages={115–129} }","ama":"Mersmann O, Bischl B, Bossek J, Trautmann H, Wagner M, Neumann F. Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. In: Hamadi Y, Schoenauer M, eds. <i>Learning and Intelligent Optimization</i>. Springer Berlin Heidelberg; 2012:115–129. doi:<a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">https://doi.org/10.1007/978-3-642-34413-8_9</a>"},"abstract":[{"lang":"eng","text":"With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesman problem (TSP). Although 2-opt is widely used in practice, it is hard to understand its success from a theoretical perspective. We take a statistical approach and examine the features of TSP instances that make the problem either hard or easy to solve. As a measure of problem difficulty for 2-opt we use the approximation ratio that it achieves on a given instance. Our investigations point out important features that make TSP instances hard or easy to be approximated by 2-opt."}],"date_created":"2023-08-04T15:53:33Z","place":"Berlin, Heidelberg","type":"conference","department":[{"_id":"34"},{"_id":"819"}]},{"citation":{"bibtex":"@inproceedings{Klobedanz_Müller_Rettberg_2012, place={Shenzhen, China }, title={An Approach for Self-Reconfiguring and Fault-Tolerant Distributed Real-Time Systems}, DOI={<a href=\"https://doi.org/10.1109/ISORCW.2012.41\">10.1109/ISORCW.2012.41</a>}, publisher={IEEE}, author={Klobedanz, Kay and Müller, Wolfgang and Rettberg, Achim}, year={2012} }","chicago":"Klobedanz, Kay, Wolfgang Müller, and Achim Rettberg. “An Approach for Self-Reconfiguring and Fault-Tolerant Distributed Real-Time Systems.” Shenzhen, China : IEEE, 2012. <a href=\"https://doi.org/10.1109/ISORCW.2012.41\">https://doi.org/10.1109/ISORCW.2012.41</a>.","ama":"Klobedanz K, Müller W, Rettberg A. An Approach for Self-Reconfiguring and Fault-Tolerant Distributed Real-Time Systems. In: IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/ISORCW.2012.41\">10.1109/ISORCW.2012.41</a>","short":"K. Klobedanz, W. Müller, A. Rettberg, in: IEEE, Shenzhen, China , 2012.","ieee":"K. Klobedanz, W. Müller, and A. Rettberg, “An Approach for Self-Reconfiguring and Fault-Tolerant Distributed Real-Time Systems,” presented at the IEEE 15th International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops, 2012, doi: <a href=\"https://doi.org/10.1109/ISORCW.2012.41\">10.1109/ISORCW.2012.41</a>.","apa":"Klobedanz, K., Müller, W., &#38; Rettberg, A. (2012). <i>An Approach for Self-Reconfiguring and Fault-Tolerant Distributed Real-Time Systems</i>. IEEE 15th International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops. <a href=\"https://doi.org/10.1109/ISORCW.2012.41\">https://doi.org/10.1109/ISORCW.2012.41</a>","mla":"Klobedanz, Kay, et al. <i>An Approach for Self-Reconfiguring and Fault-Tolerant Distributed Real-Time Systems</i>. IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/ISORCW.2012.41\">10.1109/ISORCW.2012.41</a>."},"abstract":[{"lang":"eng","text":"In this paper we present an approach for the self reconfiguration of distributed micro-controllers for increased fault tolerance. Based on a modified distributed system topology utilizing a time division multiple access (TDMA) protocol, i.e., Flex Ray, we present a self-organized distributed coordinator concept which performs the self-reconfiguration in the case of node failures. We introduce a distributed coordinator, which utilizes redundant slots in the Flex Ray communication schedule and combines messages in configured protocol frames and slots to avoid a complete bus restart. As such, the self-reconfiguration is realized by means of predetermined information about resulting changes in the communication dependencies and (re-)assignments determined in the design phase. To retrieve the necessary information, we present an analytical approach, which determines a combined solution for the initial configuration and all possible reconfigurations for the remaining nodes of the Flex Ray network in case of node failures. Hence, through this method we can design self-reconfiguring network-based systems enabling the handling of node failures for an increased fault tolerance."}],"place":"Shenzhen, China ","date_created":"2023-01-16T12:23:50Z","department":[{"_id":"672"}],"keyword":["Real time systems","Fault tolerant systems","Schedules","Protocols","Redundancy","Delay"],"type":"conference","conference":{"name":"IEEE 15th International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops"},"publication_identifier":{"eisbn":["978-0-7695-4669-8"]},"author":[{"first_name":"Kay","last_name":"Klobedanz","full_name":"Klobedanz, Kay"},{"last_name":"Müller","first_name":"Wolfgang","full_name":"Müller, Wolfgang","id":"16243"},{"last_name":"Rettberg","first_name":"Achim","full_name":"Rettberg, Achim"}],"year":"2012","title":"An Approach for Self-Reconfiguring and Fault-Tolerant Distributed Real-Time Systems","status":"public","date_updated":"2023-01-16T12:25:33Z","publisher":"IEEE","_id":"36922","language":[{"iso":"eng"}],"doi":"10.1109/ISORCW.2012.41","user_id":"5786"},{"place":"San Jose","date_created":"2023-01-16T12:19:39Z","department":[{"_id":"672"}],"type":"conference","citation":{"bibtex":"@inproceedings{Oliveira_Kuznik_Müller_Esen_Ecker_2012, place={San Jose}, title={Towards an Enhanced UVM for SystemC}, booktitle={Proceedings of the Design &#38; Verification Conference (DVCon)}, author={Oliveira, M. F. and Kuznik, Christoph and Müller, Wolfgang and Esen, V. and Ecker, W.}, year={2012} }","ama":"Oliveira MF, Kuznik C, Müller W, Esen V, Ecker W. Towards an Enhanced UVM for SystemC. In: <i>Proceedings of the Design &#38; Verification Conference (DVCon)</i>. ; 2012.","mla":"Oliveira, M. F., et al. “Towards an Enhanced UVM for SystemC.” <i>Proceedings of the Design &#38; Verification Conference (DVCon)</i>, 2012.","short":"M.F. Oliveira, C. Kuznik, W. Müller, V. Esen, W. Ecker, in: Proceedings of the Design &#38; Verification Conference (DVCon), San Jose, 2012.","chicago":"Oliveira, M. F., Christoph Kuznik, Wolfgang Müller, V. Esen, and W. Ecker. “Towards an Enhanced UVM for SystemC.” In <i>Proceedings of the Design &#38; Verification Conference (DVCon)</i>. San Jose, 2012.","ieee":"M. F. Oliveira, C. Kuznik, W. Müller, V. Esen, and W. Ecker, “Towards an Enhanced UVM for SystemC,” 2012.","apa":"Oliveira, M. F., Kuznik, C., Müller, W., Esen, V., &#38; Ecker, W. (2012). Towards an Enhanced UVM for SystemC. <i>Proceedings of the Design &#38; Verification Conference (DVCon)</i>."},"publication":"Proceedings of the Design & Verification Conference (DVCon)","language":[{"iso":"eng"}],"_id":"36921","user_id":"5786","author":[{"first_name":"M. F.","last_name":"Oliveira","full_name":"Oliveira, M. F."},{"first_name":"Christoph","last_name":"Kuznik","full_name":"Kuznik, Christoph"},{"full_name":"Müller, Wolfgang","last_name":"Müller","first_name":"Wolfgang","id":"16243"},{"full_name":"Esen, V.","first_name":"V.","last_name":"Esen"},{"first_name":"W.","last_name":"Ecker","full_name":"Ecker, W."}],"title":"Towards an Enhanced UVM for SystemC","year":"2012","status":"public","date_updated":"2023-01-16T12:21:17Z"},{"department":[{"_id":"672"}],"keyword":["Analytical models","Hardware design languages","Microprocessors","Cost function","Data models","Search problems","IP networks"],"type":"conference","date_created":"2023-01-17T08:46:14Z","place":" Niagara Falls, NY, USA ","abstract":[{"text":"This paper proposes a quality driven, simulation based approach to functional design verification, which applies mainly to IP-level HDL designs with well specified test instruction format and is evaluated on a soft microprocessor core MB-LITE [5]. The approach utilizes mutation analysis as the quality metric to steer an automated simulation data generation process. It leads to a simulation flow with two phases towards an enhanced mutation analysis result. First in a random simulation phase, an in-loop heuristics is deployed and adjusts dynamically the test probability distribution so as to improve the coverage efficiency. Next, for each remaining hard-to-kill mutant, a search heuristics on test input space is developed to iteratively locate a target test, using a specific objective cost function for the goal of killing HDL mutant. The effectiveness of this integrated two-phase simulation flow is demonstrated by the results with the MB-LITE microprocessor IP.","lang":"eng"}],"citation":{"short":"T. Xie, W. Müller, F. Letombe, in: Proceedings of SOCC2012, IEEE,  Niagara Falls, NY, USA , 2012.","chicago":"Xie, Tao , Wolfgang Müller, and Florian Letombe. “Mutation-Analysis Driven Functional Verification of a Soft Microprocessor.” In <i>Proceedings of SOCC2012</i>.  Niagara Falls, NY, USA : IEEE, 2012. <a href=\"https://doi.org/10.1109/SOCC.2012.6398362\">https://doi.org/10.1109/SOCC.2012.6398362</a>.","apa":"Xie, T., Müller, W., &#38; Letombe, F. (2012). Mutation-Analysis Driven Functional Verification of a Soft Microprocessor. <i>Proceedings of SOCC2012</i>. <a href=\"https://doi.org/10.1109/SOCC.2012.6398362\">https://doi.org/10.1109/SOCC.2012.6398362</a>","ieee":"T. Xie, W. Müller, and F. Letombe, “Mutation-Analysis Driven Functional Verification of a Soft Microprocessor,” 2012, doi: <a href=\"https://doi.org/10.1109/SOCC.2012.6398362\">10.1109/SOCC.2012.6398362</a>.","ama":"Xie T, Müller W, Letombe F. Mutation-Analysis Driven Functional Verification of a Soft Microprocessor. In: <i>Proceedings of SOCC2012</i>. IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/SOCC.2012.6398362\">10.1109/SOCC.2012.6398362</a>","bibtex":"@inproceedings{Xie_Müller_Letombe_2012, place={ Niagara Falls, NY, USA }, title={Mutation-Analysis Driven Functional Verification of a Soft Microprocessor}, DOI={<a href=\"https://doi.org/10.1109/SOCC.2012.6398362\">10.1109/SOCC.2012.6398362</a>}, booktitle={Proceedings of SOCC2012}, publisher={IEEE}, author={Xie, Tao  and Müller, Wolfgang and Letombe, Florian}, year={2012} }","mla":"Xie, Tao, et al. “Mutation-Analysis Driven Functional Verification of a Soft Microprocessor.” <i>Proceedings of SOCC2012</i>, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/SOCC.2012.6398362\">10.1109/SOCC.2012.6398362</a>."},"publication":"Proceedings of SOCC2012","user_id":"5786","doi":"10.1109/SOCC.2012.6398362","language":[{"iso":"eng"}],"_id":"36994","publisher":"IEEE","date_updated":"2023-01-17T08:46:29Z","author":[{"first_name":"Tao ","last_name":"Xie","full_name":"Xie, Tao "},{"id":"16243","last_name":"Müller","first_name":"Wolfgang","full_name":"Müller, Wolfgang"},{"full_name":"Letombe, Florian","first_name":"Florian","last_name":"Letombe"}],"publication_identifier":{"eisbn":["978-1-4673-1295-0"]},"year":"2012","status":"public","title":"Mutation-Analysis Driven Functional Verification of a Soft Microprocessor"},{"department":[{"_id":"672"}],"type":"conference","place":"Tampere, Finnland","date_created":"2023-01-17T08:52:59Z","citation":{"ieee":"T. Xie and W. Müller, “An IP-XACT-TO-SystemC Model Generator for Mutation Analysis,” 2012.","apa":"Xie, T., &#38; Müller, W. (2012). An IP-XACT-TO-SystemC Model Generator for Mutation Analysis. <i>Proceedings of the MeCoES’12</i>.","chicago":"Xie, Tao, and Wolfgang Müller. “An IP-XACT-TO-SystemC Model Generator for Mutation Analysis.” In <i>Proceedings of the MeCoES’12</i>. Tampere, Finnland, 2012.","short":"T. Xie, W. Müller, in: Proceedings of the MeCoES’12, Tampere, Finnland, 2012.","mla":"Xie, Tao, and Wolfgang Müller. “An IP-XACT-TO-SystemC Model Generator for Mutation Analysis.” <i>Proceedings of the MeCoES’12</i>, 2012.","bibtex":"@inproceedings{Xie_Müller_2012, place={Tampere, Finnland}, title={An IP-XACT-TO-SystemC Model Generator for Mutation Analysis}, booktitle={Proceedings of the MeCoES’12}, author={Xie, Tao and Müller, Wolfgang}, year={2012} }","ama":"Xie T, Müller W. An IP-XACT-TO-SystemC Model Generator for Mutation Analysis. In: <i>Proceedings of the MeCoES’12</i>. ; 2012."},"publication":"Proceedings of the MeCoES’12","user_id":"5786","language":[{"iso":"eng"}],"_id":"36997","date_updated":"2023-01-17T08:53:54Z","author":[{"full_name":"Xie, Tao","last_name":"Xie","first_name":"Tao"},{"first_name":"Wolfgang","last_name":"Müller","full_name":"Müller, Wolfgang","id":"16243"}],"status":"public","year":"2012","title":"An IP-XACT-TO-SystemC Model Generator for Mutation Analysis"},{"oa":"1","place":"Berlin, Heidelberg","external_id":{"arxiv":["1209.1055"]},"citation":{"ama":"Gharibian S, Kempe J. Hardness of Approximation for Quantum Problems. In: Czumaj A, Mehlhorn K, Pitts A, Wattenhofer R, eds. <i>International Colloquium on Automata, Languages, and Programming (ICALP 2012)</i>. Springer Berlin Heidelberg; 2012:387-398. doi:<a href=\"https://doi.org/10.1007/978-3-642-31594-7_33\">10.1007/978-3-642-31594-7_33</a>","bibtex":"@inproceedings{Gharibian_Kempe_2012, place={Berlin, Heidelberg}, title={Hardness of Approximation for Quantum Problems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-31594-7_33\">10.1007/978-3-642-31594-7_33</a>}, booktitle={International Colloquium on Automata, Languages, and Programming (ICALP 2012)}, publisher={Springer Berlin Heidelberg}, author={Gharibian, Sevag and Kempe, Julia}, editor={Czumaj, Artur and Mehlhorn, Kurt and Pitts, Andrew and Wattenhofer, Roger}, year={2012}, pages={387–398} }","mla":"Gharibian, Sevag, and Julia Kempe. “Hardness of Approximation for Quantum Problems.” <i>International Colloquium on Automata, Languages, and Programming (ICALP 2012)</i>, edited by Artur Czumaj et al., Springer Berlin Heidelberg, 2012, pp. 387–98, doi:<a href=\"https://doi.org/10.1007/978-3-642-31594-7_33\">10.1007/978-3-642-31594-7_33</a>.","chicago":"Gharibian, Sevag, and Julia Kempe. “Hardness of Approximation for Quantum Problems.” In <i>International Colloquium on Automata, Languages, and Programming (ICALP 2012)</i>, edited by Artur Czumaj, Kurt Mehlhorn, Andrew Pitts, and Roger Wattenhofer, 387–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-31594-7_33\">https://doi.org/10.1007/978-3-642-31594-7_33</a>.","short":"S. Gharibian, J. Kempe, in: A. Czumaj, K. Mehlhorn, A. Pitts, R. Wattenhofer (Eds.), International Colloquium on Automata, Languages, and Programming (ICALP 2012), Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 387–398.","apa":"Gharibian, S., &#38; Kempe, J. (2012). Hardness of Approximation for Quantum Problems. In A. Czumaj, K. Mehlhorn, A. Pitts, &#38; R. Wattenhofer (Eds.), <i>International Colloquium on Automata, Languages, and Programming (ICALP 2012)</i> (pp. 387–398). Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-31594-7_33\">https://doi.org/10.1007/978-3-642-31594-7_33</a>","ieee":"S. Gharibian and J. Kempe, “Hardness of Approximation for Quantum Problems,” in <i>International Colloquium on Automata, Languages, and Programming (ICALP 2012)</i>, Warwick, UK, 2012, pp. 387–398, doi: <a href=\"https://doi.org/10.1007/978-3-642-31594-7_33\">10.1007/978-3-642-31594-7_33</a>."},"editor":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"last_name":"Mehlhorn","first_name":"Kurt","full_name":"Mehlhorn, Kurt"},{"first_name":"Andrew","last_name":"Pitts","full_name":"Pitts, Andrew"},{"full_name":"Wattenhofer, Roger","last_name":"Wattenhofer","first_name":"Roger"}],"user_id":"71541","publisher":"Springer Berlin Heidelberg","_id":"8169","page":"387-398","conference":{"name":"International Colloquium on Automata, Languages, and Programming (ICALP)","location":"Warwick, UK"},"status":"public","department":[{"_id":"623"},{"_id":"7"}],"type":"conference","date_created":"2019-03-01T11:55:18Z","abstract":[{"text":"The polynomial hierarchy plays a central role in classical complexity theory. Here, we define a quantum generalization of the polynomial hierarchy, and initiate its study. We show that not only are there natural complete problems for the second level of this quantum hierarchy, but that these problems are in fact hard to approximate. Our work thus yields the first known hardness of approximation results for a quantum complexity class. Using these techniques, we also obtain hardness of approximation for the class QCMA. Our approach is based on the use of dispersers, and is inspired by the classical results of Umans regarding hardness of approximation for the second level of the classical polynomial hierarchy (Umans 1999). We close by showing that a variant of the local Hamiltonian problem with hybrid classical-quantum ground states is complete for the second level of our quantum hierarchy.","lang":"eng"}],"extern":"1","publication":"International Colloquium on Automata, Languages, and Programming (ICALP 2012)","doi":"10.1007/978-3-642-31594-7_33","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1209.1055"}],"date_updated":"2023-02-28T11:03:26Z","publication_status":"published","author":[{"full_name":"Gharibian, Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian","first_name":"Sevag","id":"71541"},{"full_name":"Kempe, Julia","first_name":"Julia","last_name":"Kempe"}],"publication_identifier":{"isbn":["978-3-642-31594-7"]},"year":"2012","title":"Hardness of Approximation for Quantum Problems"},{"status":"public","user_id":"71541","volume":41,"page":"1028-1050","publisher":"Society for Industrial & Applied Mathematics (SIAM)","_id":"8175","citation":{"ieee":"S. Gharibian and J. Kempe, “Approximation Algorithms for QMA-Complete Problems,” <i>SIAM Journal on Computing</i>, vol. 41, no. 4, pp. 1028–1050, 2012, doi: <a href=\"https://doi.org/10.1137/110842272\">10.1137/110842272</a>.","apa":"Gharibian, S., &#38; Kempe, J. (2012). Approximation Algorithms for QMA-Complete Problems. <i>SIAM Journal on Computing</i>, <i>41</i>(4), 1028–1050. <a href=\"https://doi.org/10.1137/110842272\">https://doi.org/10.1137/110842272</a>","mla":"Gharibian, Sevag, and Julia Kempe. “Approximation Algorithms for QMA-Complete Problems.” <i>SIAM Journal on Computing</i>, vol. 41, no. 4, Society for Industrial &#38; Applied Mathematics (SIAM), 2012, pp. 1028–50, doi:<a href=\"https://doi.org/10.1137/110842272\">10.1137/110842272</a>.","bibtex":"@article{Gharibian_Kempe_2012, title={Approximation Algorithms for QMA-Complete Problems}, volume={41}, DOI={<a href=\"https://doi.org/10.1137/110842272\">10.1137/110842272</a>}, number={4}, journal={SIAM Journal on Computing}, publisher={Society for Industrial &#38; Applied Mathematics (SIAM)}, author={Gharibian, Sevag and Kempe, Julia}, year={2012}, pages={1028–1050} }","short":"S. Gharibian, J. Kempe, SIAM Journal on Computing 41 (2012) 1028–1050.","ama":"Gharibian S, Kempe J. Approximation Algorithms for QMA-Complete Problems. <i>SIAM Journal on Computing</i>. 2012;41(4):1028-1050. doi:<a href=\"https://doi.org/10.1137/110842272\">10.1137/110842272</a>","chicago":"Gharibian, Sevag, and Julia Kempe. “Approximation Algorithms for QMA-Complete Problems.” <i>SIAM Journal on Computing</i> 41, no. 4 (2012): 1028–50. <a href=\"https://doi.org/10.1137/110842272\">https://doi.org/10.1137/110842272</a>."},"oa":"1","external_id":{"arxiv":["1101.3884"]},"date_updated":"2023-02-28T11:03:50Z","publication_status":"published","intvolume":"        41","article_type":"original","title":"Approximation Algorithms for QMA-Complete Problems","year":"2012","publication_identifier":{"issn":["0097-5397","1095-7111"]},"author":[{"id":"71541","full_name":"Gharibian, Sevag","first_name":"Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian"},{"full_name":"Kempe, Julia","first_name":"Julia","last_name":"Kempe"}],"doi":"10.1137/110842272","main_file_link":[{"url":"https://arxiv.org/abs/1101.3884","open_access":"1"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"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 (where QMA stands for Quantum Merlin Arthur) and initiate its study. We present two main results. The first shows that a nontrivial 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, Karger, and Karpinski [J. Comput. System Sci., 58 (1999), p. 193] to the quantum setting and might be of independent interest."}],"extern":"1","publication":"SIAM Journal on Computing","issue":"4","type":"journal_article","department":[{"_id":"623"},{"_id":"7"}],"date_created":"2019-03-01T12:04:03Z"},{"user_id":"71541","volume":86,"page":"042106","_id":"8174","publisher":"American Physical Society","status":"public","oa":"1","external_id":{"arxiv":["1202.1598"]},"citation":{"chicago":"Gharibian, Sevag. “Quantifying Nonclassicality with Local Unitary Operations.” <i>Physical Review A</i> 86 (2012): 042106. <a href=\"https://doi.org/10.1103/PhysRevA.86.042106\">https://doi.org/10.1103/PhysRevA.86.042106</a>.","short":"S. Gharibian, Physical Review A 86 (2012) 042106.","apa":"Gharibian, S. (2012). Quantifying nonclassicality with local unitary operations. <i>Physical Review A</i>, <i>86</i>, 042106. <a href=\"https://doi.org/10.1103/PhysRevA.86.042106\">https://doi.org/10.1103/PhysRevA.86.042106</a>","ieee":"S. Gharibian, “Quantifying nonclassicality with local unitary operations,” <i>Physical Review A</i>, vol. 86, p. 042106, 2012, doi: <a href=\"https://doi.org/10.1103/PhysRevA.86.042106\">10.1103/PhysRevA.86.042106</a>.","ama":"Gharibian S. Quantifying nonclassicality with local unitary operations. <i>Physical Review A</i>. 2012;86:042106. doi:<a href=\"https://doi.org/10.1103/PhysRevA.86.042106\">10.1103/PhysRevA.86.042106</a>","bibtex":"@article{Gharibian_2012, title={Quantifying nonclassicality with local unitary operations}, volume={86}, DOI={<a href=\"https://doi.org/10.1103/PhysRevA.86.042106\">10.1103/PhysRevA.86.042106</a>}, journal={Physical Review A}, publisher={American Physical Society}, author={Gharibian, Sevag}, year={2012}, pages={042106} }","mla":"Gharibian, Sevag. “Quantifying Nonclassicality with Local Unitary Operations.” <i>Physical Review A</i>, vol. 86, American Physical Society, 2012, p. 042106, doi:<a href=\"https://doi.org/10.1103/PhysRevA.86.042106\">10.1103/PhysRevA.86.042106</a>."},"doi":"10.1103/PhysRevA.86.042106","main_file_link":[{"url":"https://arxiv.org/abs/1202.1598","open_access":"1"}],"language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2023-02-28T11:03:38Z","article_type":"original","intvolume":"        86","year":"2012","title":"Quantifying nonclassicality with local unitary operations","author":[{"last_name":"Gharibian","orcid":"0000-0002-9992-3379","first_name":"Sevag","full_name":"Gharibian, Sevag","id":"71541"}],"type":"journal_article","department":[{"_id":"623"},{"_id":"7"}],"date_created":"2019-03-01T12:01:41Z","extern":"1","abstract":[{"text":"We propose a measure of non-classical correlations in bipartite quantum states based on local unitary operations. We prove the measure is non-zero if and only if the quantum discord is non-zero; this is achieved via a new characterization of zero discord states in terms of the state's correlation matrix. Moreover, our scheme can be extended to ensure the same relationship holds even with a generalized version of quantum discord in which higher-rank projective measurements are allowed. We next derive a closed form expression for our scheme in the cases of Werner states and (2 x N)-dimensional systems. The latter reveals that for (2 x N)-dimensional states, our measure reduces to the geometric discord [Dakic et al., PRL 105, 2010]. A connection to the CHSH inequality is shown. We close with a characterization of all maximally non-classical, yet separable, (2 x N)-dimensional states of rank at most two (with respect to our measure).","lang":"eng"}],"publication":"Physical Review A"},{"quality_controlled":"1","file_date_updated":"2019-02-13T09:04:46Z","citation":{"apa":"Meyer, B., Schumacher, J., Plessl, C., &#38; Förstner, J. (2012). Convey Vector Personalities – FPGA Acceleration with an OpenMP-like Effort? <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>, 189–196. <a href=\"https://doi.org/10.1109/FPL.2012.6339370\">https://doi.org/10.1109/FPL.2012.6339370</a>","mla":"Meyer, Björn, et al. “Convey Vector Personalities – FPGA Acceleration with an OpenMP-like Effort?” <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>, IEEE, 2012, pp. 189–96, doi:<a href=\"https://doi.org/10.1109/FPL.2012.6339370\">10.1109/FPL.2012.6339370</a>.","ieee":"B. Meyer, J. Schumacher, C. Plessl, and J. Förstner, “Convey Vector Personalities – FPGA Acceleration with an OpenMP-like Effort?,” in <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>, 2012, pp. 189–196, doi: <a href=\"https://doi.org/10.1109/FPL.2012.6339370\">10.1109/FPL.2012.6339370</a>.","chicago":"Meyer, Björn, Jörn Schumacher, Christian Plessl, and Jens Förstner. “Convey Vector Personalities – FPGA Acceleration with an OpenMP-like Effort?” In <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>, 189–96. IEEE, 2012. <a href=\"https://doi.org/10.1109/FPL.2012.6339370\">https://doi.org/10.1109/FPL.2012.6339370</a>.","short":"B. Meyer, J. Schumacher, C. Plessl, J. Förstner, in: Proc. Int. Conf. on Field Programmable Logic and Applications (FPL), IEEE, 2012, pp. 189–196.","ama":"Meyer B, Schumacher J, Plessl C, Förstner J. Convey Vector Personalities – FPGA Acceleration with an OpenMP-like Effort? In: <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>. IEEE; 2012:189-196. doi:<a href=\"https://doi.org/10.1109/FPL.2012.6339370\">10.1109/FPL.2012.6339370</a>","bibtex":"@inproceedings{Meyer_Schumacher_Plessl_Förstner_2012, title={Convey Vector Personalities – FPGA Acceleration with an OpenMP-like Effort?}, DOI={<a href=\"https://doi.org/10.1109/FPL.2012.6339370\">10.1109/FPL.2012.6339370</a>}, booktitle={Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)}, publisher={IEEE}, author={Meyer, Björn and Schumacher, Jörn and Plessl, Christian and Förstner, Jens}, year={2012}, pages={189–196} }"},"ddc":["000"],"user_id":"15278","page":"189-196","_id":"2106","publisher":"IEEE","has_accepted_license":"1","status":"public","conference":{"name":"22nd International Conference on Field Programmable Logic and Applicaitons (FPL)"},"type":"conference","keyword":["funding-upb-forschungspreis","funding-maxup","tet_topic_hpc"],"department":[{"_id":"27"},{"_id":"518"},{"_id":"15"},{"_id":"78"}],"file":[{"date_created":"2019-02-13T09:04:46Z","creator":"fossie","file_id":"7638","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2019-02-13T09:04:46Z","file_name":"2012-11 Meyer,Schumacher,Plessl,Förstner_Convey vector personalities-FPGA acceleratin with an openmp-like programming effort.pdf","access_level":"closed","file_size":2148787}],"date_created":"2018-03-29T15:04:25Z","abstract":[{"lang":"eng","text":"Although the benefits of FPGAs for accelerating scientific codes are widely acknowledged, the use of FPGA accelerators in scientific computing is not widespread because reaping these benefits requires knowledge of hardware design methods and tools that is typically not available with domain scientists. A promising but hardly investigated approach is to develop tool flows that keep the common languages for scientific code (C,C++, and Fortran) and allow the developer to augment the source code with OpenMPlike directives for instructing the compiler which parts of the application shall be offloaded the FPGA accelerator.\r\nIn this work we study whether the promise of effective FPGA acceleration with an OpenMP-like programming effort\r\ncan actually be held. Our target system is the Convey HC-1 reconfigurable computer for which an OpenMP-like\r\nprogramming environment exists. As case study we use an application from computational nanophotonics. Our results\r\nshow that a developer without previous FPGA experience could create an FPGA-accelerated application that is competitive to an optimized OpenMP-parallelized CPU version running on a two socket quad-core server. Finally, we discuss our experiences with this tool flow and the Convey HC-1 from a productivity and economic point of view."}],"publication":"Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)","doi":"10.1109/FPL.2012.6339370","language":[{"iso":"eng"}],"date_updated":"2023-09-26T13:39:13Z","title":"Convey Vector Personalities – FPGA Acceleration with an OpenMP-like Effort?","year":"2012","author":[{"full_name":"Meyer, Björn","last_name":"Meyer","first_name":"Björn"},{"last_name":"Schumacher","first_name":"Jörn","full_name":"Schumacher, Jörn"},{"full_name":"Plessl, Christian","first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","id":"16153"},{"full_name":"Förstner, Jens","last_name":"Förstner","first_name":"Jens","orcid":"0000-0001-7059-9862","id":"158"}]},{"citation":{"bibtex":"@article{Schumacher_Plessl_Platzner_2012, title={IMORC: An Infrastructure and Architecture Template for Implementing High-Performance Reconfigurable FPGA Accelerators}, volume={36}, DOI={<a href=\"https://doi.org/10.1016/j.micpro.2011.04.002\">10.1016/j.micpro.2011.04.002</a>}, number={2}, journal={Microprocessors and Microsystems}, author={Schumacher, Tobias and Plessl, Christian and Platzner, Marco}, year={2012}, pages={110–126} }","chicago":"Schumacher, Tobias, Christian Plessl, and Marco Platzner. “IMORC: An Infrastructure and Architecture Template for Implementing High-Performance Reconfigurable FPGA Accelerators.” <i>Microprocessors and Microsystems</i> 36, no. 2 (2012): 110–26. <a href=\"https://doi.org/10.1016/j.micpro.2011.04.002\">https://doi.org/10.1016/j.micpro.2011.04.002</a>.","ama":"Schumacher T, Plessl C, Platzner M. IMORC: An Infrastructure and Architecture Template for Implementing High-Performance Reconfigurable FPGA Accelerators. <i>Microprocessors and Microsystems</i>. 2012;36(2):110-126. doi:<a href=\"https://doi.org/10.1016/j.micpro.2011.04.002\">10.1016/j.micpro.2011.04.002</a>","short":"T. Schumacher, C. Plessl, M. Platzner, Microprocessors and Microsystems 36 (2012) 110–126.","ieee":"T. Schumacher, C. Plessl, and M. Platzner, “IMORC: An Infrastructure and Architecture Template for Implementing High-Performance Reconfigurable FPGA Accelerators,” <i>Microprocessors and Microsystems</i>, vol. 36, no. 2, pp. 110–126, 2012, doi: <a href=\"https://doi.org/10.1016/j.micpro.2011.04.002\">10.1016/j.micpro.2011.04.002</a>.","apa":"Schumacher, T., Plessl, C., &#38; Platzner, M. (2012). IMORC: An Infrastructure and Architecture Template for Implementing High-Performance Reconfigurable FPGA Accelerators. <i>Microprocessors and Microsystems</i>, <i>36</i>(2), 110–126. <a href=\"https://doi.org/10.1016/j.micpro.2011.04.002\">https://doi.org/10.1016/j.micpro.2011.04.002</a>","mla":"Schumacher, Tobias, et al. “IMORC: An Infrastructure and Architecture Template for Implementing High-Performance Reconfigurable FPGA Accelerators.” <i>Microprocessors and Microsystems</i>, vol. 36, no. 2, 2012, pp. 110–26, doi:<a href=\"https://doi.org/10.1016/j.micpro.2011.04.002\">10.1016/j.micpro.2011.04.002</a>."},"quality_controlled":"1","page":"110-126","_id":"2108","user_id":"15278","volume":36,"status":"public","date_created":"2018-03-29T15:12:38Z","keyword":["funding-altera"],"type":"journal_article","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"issue":"2","publication":"Microprocessors and Microsystems","language":[{"iso":"eng"}],"doi":"10.1016/j.micpro.2011.04.002","year":"2012","title":"IMORC: An Infrastructure and Architecture Template for Implementing High-Performance Reconfigurable FPGA Accelerators","author":[{"full_name":"Schumacher, Tobias","last_name":"Schumacher","first_name":"Tobias"},{"full_name":"Plessl, Christian","first_name":"Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","id":"16153"},{"id":"398","full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"}],"publication_identifier":{"issn":["0141-9331"]},"date_updated":"2023-09-26T13:39:30Z","intvolume":"        36"},{"author":[{"first_name":"Markus","last_name":"Happe","full_name":"Happe, Markus"},{"last_name":"Hangmann","first_name":"Hendrik","full_name":"Hangmann, Hendrik"},{"full_name":"Agne, Andreas","first_name":"Andreas","last_name":"Agne"},{"first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153"}],"title":"Eight Ways to put your FPGA on Fire – A Systematic Study of Heat Generators","year":"2012","date_updated":"2023-09-26T13:42:26Z","language":[{"iso":"eng"}],"doi":"10.1109/ReConFig.2012.6416745","publication":"Proceedings of the International Conference on Reconfigurable Computing and FPGAs (ReConFig)","abstract":[{"lang":"eng","text":"Due to the continuously shrinking device structures and increasing densities of FPGAs, thermal aspects have become the new focus for many research projects over the last years. Most researchers rely on temperature simulations to evaluate their novel thermal management techniques. However, the accuracy of the simulations is to some extent questionable and they require a high computational effort if a detailed thermal model is used.For experimental evaluation of real-world temperature management methods, often synthetic heat sources are employed. Therefore, in this paper we investigated the question if we can create significant rises in temperature on modern FPGAs to enable future evaluation of thermal management techniques based on experiments in contrast to simulations. Therefore, we have developed eight different heat-generating cores that use different subsets of the FPGA resources. Our experimental results show that, according to the built-in thermal diode of our Xilinx Virtex-5 FPGA, we can increase the chip temperature by 134 degree C in less than 12 minutes by only utilizing about 21% of the slices."}],"date_created":"2017-10-17T12:42:51Z","file":[{"file_name":"615-ReConFig12_01.pdf","file_size":730144,"access_level":"closed","relation":"main_file","date_updated":"2018-03-15T06:48:32Z","file_id":"1246","content_type":"application/pdf","success":1,"creator":"florida","date_created":"2018-03-15T06:48:32Z"}],"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"conference","status":"public","has_accepted_license":"1","publisher":"IEEE","_id":"615","page":"1-8","ddc":["040"],"user_id":"15278","citation":{"apa":"Happe, M., Hangmann, H., Agne, A., &#38; Plessl, C. (2012). Eight Ways to put your FPGA on Fire – A Systematic Study of Heat Generators. <i>Proceedings of the International Conference on Reconfigurable Computing and FPGAs (ReConFig)</i>, 1–8. <a href=\"https://doi.org/10.1109/ReConFig.2012.6416745\">https://doi.org/10.1109/ReConFig.2012.6416745</a>","mla":"Happe, Markus, et al. “Eight Ways to Put Your FPGA on Fire – A Systematic Study of Heat Generators.” <i>Proceedings of the International Conference on Reconfigurable Computing and FPGAs (ReConFig)</i>, IEEE, 2012, pp. 1–8, doi:<a href=\"https://doi.org/10.1109/ReConFig.2012.6416745\">10.1109/ReConFig.2012.6416745</a>.","ieee":"M. Happe, H. Hangmann, A. Agne, and C. Plessl, “Eight Ways to put your FPGA on Fire – A Systematic Study of Heat Generators,” in <i>Proceedings of the International Conference on Reconfigurable Computing and FPGAs (ReConFig)</i>, 2012, pp. 1–8, doi: <a href=\"https://doi.org/10.1109/ReConFig.2012.6416745\">10.1109/ReConFig.2012.6416745</a>.","chicago":"Happe, Markus, Hendrik Hangmann, Andreas Agne, and Christian Plessl. “Eight Ways to Put Your FPGA on Fire – A Systematic Study of Heat Generators.” In <i>Proceedings of the International Conference on Reconfigurable Computing and FPGAs (ReConFig)</i>, 1–8. IEEE, 2012. <a href=\"https://doi.org/10.1109/ReConFig.2012.6416745\">https://doi.org/10.1109/ReConFig.2012.6416745</a>.","short":"M. Happe, H. Hangmann, A. Agne, C. Plessl, in: Proceedings of the International Conference on Reconfigurable Computing and FPGAs (ReConFig), IEEE, 2012, pp. 1–8.","ama":"Happe M, Hangmann H, Agne A, Plessl C. Eight Ways to put your FPGA on Fire – A Systematic Study of Heat Generators. In: <i>Proceedings of the International Conference on Reconfigurable Computing and FPGAs (ReConFig)</i>. IEEE; 2012:1-8. doi:<a href=\"https://doi.org/10.1109/ReConFig.2012.6416745\">10.1109/ReConFig.2012.6416745</a>","bibtex":"@inproceedings{Happe_Hangmann_Agne_Plessl_2012, title={Eight Ways to put your FPGA on Fire – A Systematic Study of Heat Generators}, DOI={<a href=\"https://doi.org/10.1109/ReConFig.2012.6416745\">10.1109/ReConFig.2012.6416745</a>}, booktitle={Proceedings of the International Conference on Reconfigurable Computing and FPGAs (ReConFig)}, publisher={IEEE}, author={Happe, Markus and Hangmann, Hendrik and Agne, Andreas and Plessl, Christian}, year={2012}, pages={1–8} }"},"file_date_updated":"2018-03-15T06:48:32Z","project":[{"name":"SFB 901","_id":"1","grant_number":"160364472"},{"name":"SFB 901 - Subprojekt C2","grant_number":"160364472","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Engineering Proprioception in Computing Systems","_id":"31","grant_number":"257906"}],"quality_controlled":"1"}]