[{"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-030-05348-2_17","author":[{"last_name":"Bossek","first_name":"Jakob","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob","id":"102979"},{"full_name":"Grimme, Christian","last_name":"Grimme","first_name":"Christian"}],"publication_identifier":{"isbn":["978-3-030-05348-2"]},"title":"Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems","year":"2019","date_updated":"2023-12-13T10:44:44Z","publication_status":"published","date_created":"2023-11-14T15:58:54Z","department":[{"_id":"819"}],"type":"conference","publication":"Learning and Intelligent Optimization","abstract":[{"lang":"eng","text":"The $$\\textbackslash mathcal NP$$-hard multi-criteria shortest path problem (mcSPP) is of utmost practical relevance, e.~g., in navigation system design and logistics. We address the problem of approximating the Pareto-front of the mcSPP with sum objectives. We do so by proposing a new mutation operator for multi-objective evolutionary algorithms that solves single-objective versions of the shortest path problem on subgraphs. A rigorous empirical benchmark on a diverse set of problem instances shows the effectiveness of the approach in comparison to a well-known mutation operator in terms of convergence speed and approximation quality. In addition, we glance at the neighbourhood structure and similarity of obtained Pareto-optimal solutions and derive promising directions for future work."}],"extern":"1","_id":"48858","publisher":"Springer International Publishing","page":"184–198","editor":[{"first_name":"Roberto","last_name":"Battiti","full_name":"Battiti, Roberto"},{"last_name":"Brunato","first_name":"Mauro","full_name":"Brunato, Mauro"},{"full_name":"Kotsireas, Ilias","last_name":"Kotsireas","first_name":"Ilias"},{"full_name":"Pardalos, Panos M.","last_name":"Pardalos","first_name":"Panos M."}],"user_id":"102979","status":"public","place":"Cham","citation":{"bibtex":"@inproceedings{Bossek_Grimme_2019, place={Cham}, series={Lecture Notes in Computer Science}, title={Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-05348-2_17\">10.1007/978-3-030-05348-2_17</a>}, booktitle={Learning and Intelligent Optimization}, publisher={Springer International Publishing}, author={Bossek, Jakob and Grimme, Christian}, editor={Battiti, Roberto and Brunato, Mauro and Kotsireas, Ilias and Pardalos, Panos M.}, year={2019}, pages={184–198}, collection={Lecture Notes in Computer Science} }","ama":"Bossek J, Grimme C. Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems. In: Battiti R, Brunato M, Kotsireas I, Pardalos PM, eds. <i>Learning and Intelligent Optimization</i>. Lecture Notes in Computer Science. Springer International Publishing; 2019:184–198. doi:<a href=\"https://doi.org/10.1007/978-3-030-05348-2_17\">10.1007/978-3-030-05348-2_17</a>","mla":"Bossek, Jakob, and Christian Grimme. “Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-Criteria Shortest Path Problems.” <i>Learning and Intelligent Optimization</i>, edited by Roberto Battiti et al., Springer International Publishing, 2019, pp. 184–198, doi:<a href=\"https://doi.org/10.1007/978-3-030-05348-2_17\">10.1007/978-3-030-05348-2_17</a>.","chicago":"Bossek, Jakob, and Christian Grimme. “Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-Criteria Shortest Path Problems.” In <i>Learning and Intelligent Optimization</i>, edited by Roberto Battiti, Mauro Brunato, Ilias Kotsireas, and Panos M. Pardalos, 184–198. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2019. <a href=\"https://doi.org/10.1007/978-3-030-05348-2_17\">https://doi.org/10.1007/978-3-030-05348-2_17</a>.","short":"J. Bossek, C. Grimme, in: R. Battiti, M. Brunato, I. Kotsireas, P.M. Pardalos (Eds.), Learning and Intelligent Optimization, Springer International Publishing, Cham, 2019, pp. 184–198.","ieee":"J. Bossek and C. Grimme, “Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems,” in <i>Learning and Intelligent Optimization</i>, 2019, pp. 184–198, doi: <a href=\"https://doi.org/10.1007/978-3-030-05348-2_17\">10.1007/978-3-030-05348-2_17</a>.","apa":"Bossek, J., &#38; Grimme, C. (2019). Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems. In R. Battiti, M. Brunato, I. Kotsireas, &#38; P. M. Pardalos (Eds.), <i>Learning and Intelligent Optimization</i> (pp. 184–198). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-05348-2_17\">https://doi.org/10.1007/978-3-030-05348-2_17</a>"}},{"department":[{"_id":"819"}],"type":"conference","keyword":["edge coloring problem","runtime analysis"],"date_created":"2023-11-14T15:58:56Z","abstract":[{"lang":"eng","text":"The edge coloring problem asks for an assignment of colors to edges of a graph such that no two incident edges share the same color and the number of colors is minimized. It is known that all graphs with maximum degree {$\\Delta$} can be colored with {$\\Delta$} or {$\\Delta$} + 1 colors, but it is NP-hard to determine whether {$\\Delta$} colors are sufficient. We present the first runtime analysis of evolutionary algorithms (EAs) for the edge coloring problem. Simple EAs such as RLS and (1+1) EA efficiently find (2{$\\Delta$} - 1)-colorings on arbitrary graphs and optimal colorings for even and odd cycles, paths, star graphs and arbitrary trees. A partial analysis for toroids also suggests efficient runtimes in bipartite graphs with many cycles. Experiments support these findings and investigate additional graph classes such as hypercubes, complete graphs and complete bipartite graphs. Theoretical and experimental results suggest that simple EAs find optimal colorings for all these graph classes in expected time O({$\\Delta\\mathscrl$}2m log m), where m is the number of edges and {$\\mathscrl$} is the length of the longest simple path in the graph."}],"extern":"1","publication":"Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","doi":"10.1145/3299904.3340311","language":[{"iso":"eng"}],"series_title":"FOGA ’19","date_updated":"2023-12-13T10:46:12Z","publication_status":"published","author":[{"full_name":"Bossek, Jakob","last_name":"Bossek","first_name":"Jakob","orcid":"0000-0002-4121-4668","id":"102979"},{"first_name":"Dirk","last_name":"Sudholt","full_name":"Sudholt, Dirk"}],"publication_identifier":{"isbn":["978-1-4503-6254-2"]},"title":"Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem","year":"2019","place":"New York, NY, USA","citation":{"mla":"Bossek, Jakob, and Dirk Sudholt. “Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem.” <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, Association for Computing Machinery, 2019, pp. 102–115, doi:<a href=\"https://doi.org/10.1145/3299904.3340311\">10.1145/3299904.3340311</a>.","bibtex":"@inproceedings{Bossek_Sudholt_2019, place={New York, NY, USA}, series={FOGA ’19}, title={Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem}, DOI={<a href=\"https://doi.org/10.1145/3299904.3340311\">10.1145/3299904.3340311</a>}, booktitle={Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Sudholt, Dirk}, year={2019}, pages={102–115}, collection={FOGA ’19} }","ama":"Bossek J, Sudholt D. Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem. In: <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>. FOGA ’19. Association for Computing Machinery; 2019:102–115. doi:<a href=\"https://doi.org/10.1145/3299904.3340311\">10.1145/3299904.3340311</a>","ieee":"J. Bossek and D. Sudholt, “Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem,” in <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, 2019, pp. 102–115, doi: <a href=\"https://doi.org/10.1145/3299904.3340311\">10.1145/3299904.3340311</a>.","apa":"Bossek, J., &#38; Sudholt, D. (2019). Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem. <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, 102–115. <a href=\"https://doi.org/10.1145/3299904.3340311\">https://doi.org/10.1145/3299904.3340311</a>","short":"J. Bossek, D. Sudholt, in: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, New York, NY, USA, 2019, pp. 102–115.","chicago":"Bossek, Jakob, and Dirk Sudholt. “Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem.” In <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, 102–115. FOGA ’19. New York, NY, USA: Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3299904.3340311\">https://doi.org/10.1145/3299904.3340311</a>."},"user_id":"102979","publisher":"Association for Computing Machinery","_id":"48870","page":"102–115","status":"public"},{"series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-05348-2_19","year":"2019","title":"Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time","publication_identifier":{"isbn":["978-3-030-05348-2"]},"author":[{"first_name":"Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek","full_name":"Bossek, Jakob","id":"102979"},{"full_name":"Trautmann, Heike","first_name":"Heike","last_name":"Trautmann"}],"date_updated":"2023-12-13T10:47:32Z","date_created":"2023-11-14T15:58:57Z","keyword":["Algorithm selection","Performance measurement"],"type":"conference","department":[{"_id":"819"}],"publication":"Learning and Intelligent Optimization","extern":"1","abstract":[{"lang":"eng","text":"A multiobjective perspective onto common performance measures such as the PAR10 score or the expected runtime of single-objective stochastic solvers is presented by directly investigating the tradeoff between the fraction of failed runs and the average runtime. Multi-objective indicators operating in the bi-objective space allow for an overall performance comparison on a set of instances paving the way for instance-based automated algorithm selection techniques."}],"page":"215–219","publisher":"Springer International Publishing","_id":"48875","user_id":"102979","editor":[{"first_name":"Roberto","last_name":"Battiti","full_name":"Battiti, Roberto"},{"first_name":"Mauro","last_name":"Brunato","full_name":"Brunato, Mauro"},{"first_name":"Ilias","last_name":"Kotsireas","full_name":"Kotsireas, Ilias"},{"first_name":"Panos M.","last_name":"Pardalos","full_name":"Pardalos, Panos M."}],"status":"public","place":"Cham","citation":{"bibtex":"@inproceedings{Bossek_Trautmann_2019, place={Cham}, series={Lecture Notes in Computer Science}, title={Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-05348-2_19\">10.1007/978-3-030-05348-2_19</a>}, booktitle={Learning and Intelligent Optimization}, publisher={Springer International Publishing}, author={Bossek, Jakob and Trautmann, Heike}, editor={Battiti, Roberto and Brunato, Mauro and Kotsireas, Ilias and Pardalos, Panos M.}, year={2019}, pages={215–219}, collection={Lecture Notes in Computer Science} }","chicago":"Bossek, Jakob, and Heike Trautmann. “Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time.” In <i>Learning and Intelligent Optimization</i>, edited by Roberto Battiti, Mauro Brunato, Ilias Kotsireas, and Panos M. Pardalos, 215–219. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2019. <a href=\"https://doi.org/10.1007/978-3-030-05348-2_19\">https://doi.org/10.1007/978-3-030-05348-2_19</a>.","short":"J. Bossek, H. Trautmann, in: R. Battiti, M. Brunato, I. Kotsireas, P.M. Pardalos (Eds.), Learning and Intelligent Optimization, Springer International Publishing, Cham, 2019, pp. 215–219.","ama":"Bossek J, Trautmann H. Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time. In: Battiti R, Brunato M, Kotsireas I, Pardalos PM, eds. <i>Learning and Intelligent Optimization</i>. Lecture Notes in Computer Science. Springer International Publishing; 2019:215–219. doi:<a href=\"https://doi.org/10.1007/978-3-030-05348-2_19\">10.1007/978-3-030-05348-2_19</a>","ieee":"J. Bossek and H. Trautmann, “Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time,” in <i>Learning and Intelligent Optimization</i>, 2019, pp. 215–219, doi: <a href=\"https://doi.org/10.1007/978-3-030-05348-2_19\">10.1007/978-3-030-05348-2_19</a>.","mla":"Bossek, Jakob, and Heike Trautmann. “Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time.” <i>Learning and Intelligent Optimization</i>, edited by Roberto Battiti et al., Springer International Publishing, 2019, pp. 215–219, doi:<a href=\"https://doi.org/10.1007/978-3-030-05348-2_19\">10.1007/978-3-030-05348-2_19</a>.","apa":"Bossek, J., &#38; Trautmann, H. (2019). Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time. In R. Battiti, M. Brunato, I. Kotsireas, &#38; P. M. Pardalos (Eds.), <i>Learning and Intelligent Optimization</i> (pp. 215–219). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-05348-2_19\">https://doi.org/10.1007/978-3-030-05348-2_19</a>"}},{"status":"public","page":"977–991","_id":"48877","user_id":"102979","volume":34,"citation":{"chicago":"Casalicchio, Giuseppe, Jakob Bossek, Michel Lang, Dominik Kirchhoff, Pascal Kerschke, Benjamin Hofner, Heidi Seibold, Joaquin Vanschoren, and Bernd Bischl. “OpenML: An R Package to Connect to the Machine Learning Platform OpenML.” <i>Computational Statistics</i> 34, no. 3 (2019): 977–991. <a href=\"https://doi.org/10.1007/s00180-017-0742-2\">https://doi.org/10.1007/s00180-017-0742-2</a>.","short":"G. Casalicchio, J. Bossek, M. Lang, D. Kirchhoff, P. Kerschke, B. Hofner, H. Seibold, J. Vanschoren, B. Bischl, Computational Statistics 34 (2019) 977–991.","apa":"Casalicchio, G., Bossek, J., Lang, M., Kirchhoff, D., Kerschke, P., Hofner, B., Seibold, H., Vanschoren, J., &#38; Bischl, B. (2019). OpenML: An R Package to Connect to the Machine Learning Platform OpenML. <i>Computational Statistics</i>, <i>34</i>(3), 977–991. <a href=\"https://doi.org/10.1007/s00180-017-0742-2\">https://doi.org/10.1007/s00180-017-0742-2</a>","ieee":"G. Casalicchio <i>et al.</i>, “OpenML: An R Package to Connect to the Machine Learning Platform OpenML,” <i>Computational Statistics</i>, vol. 34, no. 3, pp. 977–991, 2019, doi: <a href=\"https://doi.org/10.1007/s00180-017-0742-2\">10.1007/s00180-017-0742-2</a>.","ama":"Casalicchio G, Bossek J, Lang M, et al. OpenML: An R Package to Connect to the Machine Learning Platform OpenML. <i>Computational Statistics</i>. 2019;34(3):977–991. doi:<a href=\"https://doi.org/10.1007/s00180-017-0742-2\">10.1007/s00180-017-0742-2</a>","bibtex":"@article{Casalicchio_Bossek_Lang_Kirchhoff_Kerschke_Hofner_Seibold_Vanschoren_Bischl_2019, title={OpenML: An R Package to Connect to the Machine Learning Platform OpenML}, volume={34}, DOI={<a href=\"https://doi.org/10.1007/s00180-017-0742-2\">10.1007/s00180-017-0742-2</a>}, number={3}, journal={Computational Statistics}, author={Casalicchio, Giuseppe and Bossek, Jakob and Lang, Michel and Kirchhoff, Dominik and Kerschke, Pascal and Hofner, Benjamin and Seibold, Heidi and Vanschoren, Joaquin and Bischl, Bernd}, year={2019}, pages={977–991} }","mla":"Casalicchio, Giuseppe, et al. “OpenML: An R Package to Connect to the Machine Learning Platform OpenML.” <i>Computational Statistics</i>, vol. 34, no. 3, 2019, pp. 977–991, doi:<a href=\"https://doi.org/10.1007/s00180-017-0742-2\">10.1007/s00180-017-0742-2</a>."},"title":"OpenML: An R Package to Connect to the Machine Learning Platform OpenML","year":"2019","publication_identifier":{"issn":["0943-4062"]},"author":[{"full_name":"Casalicchio, Giuseppe","first_name":"Giuseppe","last_name":"Casalicchio"},{"id":"102979","full_name":"Bossek, Jakob","last_name":"Bossek","first_name":"Jakob","orcid":"0000-0002-4121-4668"},{"first_name":"Michel","last_name":"Lang","full_name":"Lang, Michel"},{"full_name":"Kirchhoff, Dominik","first_name":"Dominik","last_name":"Kirchhoff"},{"full_name":"Kerschke, Pascal","first_name":"Pascal","last_name":"Kerschke"},{"full_name":"Hofner, Benjamin","first_name":"Benjamin","last_name":"Hofner"},{"first_name":"Heidi","last_name":"Seibold","full_name":"Seibold, Heidi"},{"last_name":"Vanschoren","first_name":"Joaquin","full_name":"Vanschoren, Joaquin"},{"last_name":"Bischl","first_name":"Bernd","full_name":"Bischl, Bernd"}],"date_updated":"2023-12-13T10:51:17Z","intvolume":"        34","language":[{"iso":"eng"}],"doi":"10.1007/s00180-017-0742-2","publication":"Computational Statistics","issue":"3","abstract":[{"text":"OpenML is an online machine learning platform where researchers can easily share data, machine learning tasks and experiments as well as organize them online to work and collaborate more efficiently. In this paper, we present an R package to interface with the OpenML platform and illustrate its usage in combination with the machine learning R package mlr (Bischl et al. J Mach Learn Res 17(170):1—5, 2016). We show how the OpenML package allows R users to easily search, download and upload data sets and machine learning tasks. Furthermore, we also show how to upload results of experiments, share them with others and download results from other users. Beyond ensuring reproducibility of results, the OpenML platform automates much of the drudge work, speeds up research, facilitates collaboration and increases the users’ visibility online.","lang":"eng"}],"date_created":"2023-11-14T15:58:57Z","type":"journal_article","keyword":["Databases","Machine learning","R","Reproducible research"],"department":[{"_id":"819"}]},{"supervisor":[{"id":"74287","first_name":"Lennart","last_name":"Clausing","orcid":"0000-0003-3789-6034","full_name":"Clausing, Lennart"}],"citation":{"bibtex":"@book{Mehta_2019, title={Multithreaded Software/Hardware Programming with ReconOS/freeRTOS on a Reconfigurable System-on-Chip}, author={Mehta, Jinay D}, year={2019} }","ama":"Mehta JD. <i>Multithreaded Software/Hardware Programming with ReconOS/FreeRTOS on a Reconfigurable System-on-Chip</i>.; 2019.","mla":"Mehta, Jinay D. <i>Multithreaded Software/Hardware Programming with ReconOS/FreeRTOS on a Reconfigurable System-on-Chip</i>. 2019.","chicago":"Mehta, Jinay D. <i>Multithreaded Software/Hardware Programming with ReconOS/FreeRTOS on a Reconfigurable System-on-Chip</i>, 2019.","short":"J.D. Mehta, Multithreaded Software/Hardware Programming with ReconOS/FreeRTOS on a Reconfigurable System-on-Chip, 2019.","ieee":"J. D. Mehta, <i>Multithreaded Software/Hardware Programming with ReconOS/freeRTOS on a Reconfigurable System-on-Chip</i>. 2019.","apa":"Mehta, J. D. (2019). <i>Multithreaded Software/Hardware Programming with ReconOS/freeRTOS on a Reconfigurable System-on-Chip</i>."},"type":"mastersthesis","department":[{"_id":"78"}],"date_created":"2024-03-11T15:57:13Z","date_updated":"2024-03-11T15:57:39Z","status":"public","year":"2019","title":"Multithreaded Software/Hardware Programming with ReconOS/freeRTOS on a Reconfigurable System-on-Chip","author":[{"last_name":"Mehta","first_name":"Jinay D","full_name":"Mehta, Jinay D"}],"user_id":"74287","_id":"52478","language":[{"iso":"eng"}]},{"date_created":"2023-08-04T07:45:39Z","place":"Potsdam, Germany","type":"conference","department":[{"_id":"34"},{"_id":"819"}],"publication":"Proceedings of the 15$^th$ ACM/SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA XV)","citation":{"ieee":"J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, and H. Trautmann, “Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators,” in <i>Proceedings of the 15$^th$ ACM/SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA XV)</i>, 2019, pp. 58–71, doi: <a href=\"https://doi.org/10.1145/3299904.3340307\">10.1145/3299904.3340307</a>.","apa":"Bossek, J., Kerschke, P., Neumann, A., Wagner, M., Neumann, F., &#38; Trautmann, H. (2019). Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators. In T. Friedrich, C. Doerr, &#38; D. Arnold (Eds.), <i>Proceedings of the 15$^th$ ACM/SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA XV)</i> (pp. 58–71). <a href=\"https://doi.org/10.1145/3299904.3340307\">https://doi.org/10.1145/3299904.3340307</a>","short":"J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, H. Trautmann, in: T. Friedrich, C. Doerr, D. Arnold (Eds.), Proceedings of the 15$^th$ ACM/SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA XV), Potsdam, Germany, 2019, pp. 58–71.","chicago":"Bossek, Jakob, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann, and Heike Trautmann. “Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators.” In <i>Proceedings of the 15$^th$ ACM/SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA XV)</i>, edited by Tobias Friedrich, Carola Doerr, and Dirk Arnold, 58–71. Potsdam, Germany, 2019. <a href=\"https://doi.org/10.1145/3299904.3340307\">https://doi.org/10.1145/3299904.3340307</a>.","mla":"Bossek, Jakob, et al. “Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators.” <i>Proceedings of the 15$^th$ ACM/SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA XV)</i>, edited by Tobias Friedrich et al., 2019, pp. 58–71, doi:<a href=\"https://doi.org/10.1145/3299904.3340307\">10.1145/3299904.3340307</a>.","bibtex":"@inproceedings{Bossek_Kerschke_Neumann_Wagner_Neumann_Trautmann_2019, place={Potsdam, Germany}, title={Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators}, DOI={<a href=\"https://doi.org/10.1145/3299904.3340307\">10.1145/3299904.3340307</a>}, booktitle={Proceedings of the 15$^th$ ACM/SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA XV)}, author={Bossek, Jakob and Kerschke, Pascal and Neumann, Aneta and Wagner, Markus and Neumann, Frank and Trautmann, Heike}, editor={Friedrich, Tobias and Doerr, Carola and Arnold, Dirk}, year={2019}, pages={58–71} }","ama":"Bossek J, Kerschke P, Neumann A, Wagner M, Neumann F, Trautmann H. Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators. In: Friedrich T, Doerr C, Arnold D, eds. <i>Proceedings of the 15$^th$ ACM/SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA XV)</i>. ; 2019:58–71. doi:<a href=\"https://doi.org/10.1145/3299904.3340307\">10.1145/3299904.3340307</a>"},"abstract":[{"lang":"eng","text":"Evolutionary algorithms have successfully been applied to evolve problem instances that exhibit a significant difference in performance for a given algorithm or a pair of algorithms inter alia for the Traveling Salesperson Problem (TSP). Creating a large variety of instances is crucial for successful applications in the blooming field of algorithm selection. In this paper, we introduce new and creative mutation operators for evolving instances of the TSP. We show that adopting those operators in an evolutionary algorithm allows for the generation of benchmark sets with highly desirable properties: (1) novelty by clear visual distinction to established benchmark sets in the field, (2) visual and quantitative diversity in the space of TSP problem characteristics, and (3) significant performance differences with respect to the restart versions of heuristic state-of-the-art TSP solvers EAX and LKH. The important aspect of diversity is addressed and achieved solely by the proposed mutation operators and not enforced by explicit diversity preservation."}],"page":"58–71","_id":"46339","language":[{"iso":"eng"}],"user_id":"15504","doi":"10.1145/3299904.3340307","editor":[{"first_name":"Tobias","last_name":"Friedrich","full_name":"Friedrich, Tobias"},{"full_name":"Doerr, Carola","last_name":"Doerr","first_name":"Carola"},{"first_name":"Dirk","last_name":"Arnold","full_name":"Arnold, Dirk"}],"title":"Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators","year":"2019","status":"public","author":[{"full_name":"Bossek, Jakob","last_name":"Bossek","first_name":"Jakob","orcid":"0000-0002-4121-4668","id":"102979"},{"first_name":"Pascal","last_name":"Kerschke","full_name":"Kerschke, Pascal"},{"full_name":"Neumann, Aneta","first_name":"Aneta","last_name":"Neumann"},{"first_name":"Markus","last_name":"Wagner","full_name":"Wagner, Markus"},{"full_name":"Neumann, Frank","last_name":"Neumann","first_name":"Frank"},{"full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann","id":"100740"}],"date_updated":"2024-06-10T11:59:26Z"},{"place":"East Lansing, Michigan, USA","citation":{"bibtex":"@inproceedings{Bossek_Grimme_Meisel_Rudolph_Trautmann_2019, place={East Lansing, Michigan, USA}, series={Lecture Notes in Computer Science}, title={Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary Algorithm}, volume={11411}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">10.1007/978-3-030-12598-1_41</a>}, booktitle={Evolutionary Multi-Criterion Optimization (EMO)}, publisher={Springer International Publishing}, author={Bossek, Jakob and Grimme, Christian and Meisel, Stephan and Rudolph, Günter and Trautmann, Heike}, editor={Deb, Kalyanmoy and Goodman, Erik and Coello, Coello Carlos A. and Klamroth, Kathrin and Miettinen, Kaisa and Mostaghim, Sanaz and Reed, Patrick}, year={2019}, pages={516–528}, collection={Lecture Notes in Computer Science} }","ama":"Bossek J, Grimme C, Meisel S, Rudolph G, Trautmann H. Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary Algorithm. In: Deb K, Goodman E, Coello CCA, et al., eds. <i>Evolutionary Multi-Criterion Optimization (EMO)</i>. Vol 11411. Lecture Notes in Computer Science. Springer International Publishing; 2019:516–528. doi:<a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">10.1007/978-3-030-12598-1_41</a>","short":"J. Bossek, C. Grimme, S. Meisel, G. Rudolph, H. Trautmann, in: K. Deb, E. Goodman, C.C.A. Coello, K. Klamroth, K. Miettinen, S. Mostaghim, P. Reed (Eds.), Evolutionary Multi-Criterion Optimization (EMO), Springer International Publishing, East Lansing, Michigan, USA, 2019, pp. 516–528.","chicago":"Bossek, Jakob, Christian Grimme, Stephan Meisel, Günter Rudolph, and Heike Trautmann. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary Algorithm.” In <i>Evolutionary Multi-Criterion Optimization (EMO)</i>, edited by Kalyanmoy Deb, Erik Goodman, Coello Carlos A. Coello, Kathrin Klamroth, Kaisa Miettinen, Sanaz Mostaghim, and Patrick Reed, 11411:516–528. Lecture Notes in Computer Science. East Lansing, Michigan, USA: Springer International Publishing, 2019. <a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">https://doi.org/10.1007/978-3-030-12598-1_41</a>.","ieee":"J. Bossek, C. Grimme, S. Meisel, G. Rudolph, and H. Trautmann, “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary Algorithm,” in <i>Evolutionary Multi-Criterion Optimization (EMO)</i>, 2019, vol. 11411, pp. 516–528, doi: <a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">10.1007/978-3-030-12598-1_41</a>.","apa":"Bossek, J., Grimme, C., Meisel, S., Rudolph, G., &#38; Trautmann, H. (2019). Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary Algorithm. In K. Deb, E. Goodman, C. C. A. Coello, K. Klamroth, K. Miettinen, S. Mostaghim, &#38; P. Reed (Eds.), <i>Evolutionary Multi-Criterion Optimization (EMO)</i> (Vol. 11411, pp. 516–528). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">https://doi.org/10.1007/978-3-030-12598-1_41</a>","mla":"Bossek, Jakob, et al. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary Algorithm.” <i>Evolutionary Multi-Criterion Optimization (EMO)</i>, edited by Kalyanmoy Deb et al., vol. 11411, Springer International Publishing, 2019, pp. 516–528, doi:<a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">10.1007/978-3-030-12598-1_41</a>."},"publisher":"Springer International Publishing","_id":"46338","page":"516–528","editor":[{"first_name":"Kalyanmoy","last_name":"Deb","full_name":"Deb, Kalyanmoy"},{"full_name":"Goodman, Erik","last_name":"Goodman","first_name":"Erik"},{"last_name":"Coello","first_name":"Coello Carlos A.","full_name":"Coello, Coello Carlos A."},{"first_name":"Kathrin","last_name":"Klamroth","full_name":"Klamroth, Kathrin"},{"first_name":"Kaisa","last_name":"Miettinen","full_name":"Miettinen, Kaisa"},{"first_name":"Sanaz","last_name":"Mostaghim","full_name":"Mostaghim, Sanaz"},{"full_name":"Reed, Patrick","first_name":"Patrick","last_name":"Reed"}],"volume":11411,"user_id":"15504","status":"public","date_created":"2023-08-04T07:44:59Z","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","publication":"Evolutionary Multi-Criterion Optimization (EMO)","abstract":[{"text":"We tackle a bi-objective dynamic orienteering problem where customer requests arise as time passes by. The goal is to minimize the tour length traveled by a single delivery vehicle while simultaneously keeping the number of dismissed dynamic customers to a minimum. We propose a dynamic Evolutionary Multi-Objective Algorithm which is grounded on insights gained from a previous series of work on an a-posteriori version of the problem, where all request times are known in advance. In our experiments, we simulate different decision maker strategies and evaluate the development of the Pareto-front approximations on exemplary problem instances. It turns out, that despite severely reduced computational budget and no oracle-knowledge of request times the dynamic EMOA is capable of producing approximations which partially dominate the results of the a-posteriori EMOA and dynamic integer linear programming strategies.","lang":"eng"}],"series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-12598-1_41","publication_identifier":{"isbn":["978-3-030-12597-4"]},"author":[{"id":"102979","full_name":"Bossek, Jakob","last_name":"Bossek","first_name":"Jakob","orcid":"0000-0002-4121-4668"},{"first_name":"Christian","last_name":"Grimme","full_name":"Grimme, Christian"},{"last_name":"Meisel","first_name":"Stephan","full_name":"Meisel, Stephan"},{"first_name":"Günter","last_name":"Rudolph","full_name":"Rudolph, Günter"},{"id":"100740","full_name":"Trautmann, Heike","last_name":"Trautmann","first_name":"Heike","orcid":"0000-0002-9788-8282"}],"title":"Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary Algorithm","year":"2019","intvolume":"     11411","date_updated":"2024-06-10T12:00:05Z"},{"status":"public","_id":"46337","publisher":"Springer","page":"215–219","editor":[{"full_name":"Battiti, R","first_name":"R","last_name":"Battiti"},{"full_name":"Brunato, M","first_name":"M","last_name":"Brunato"},{"last_name":"Kotsireas","first_name":"I","full_name":"Kotsireas, I"},{"full_name":"Pardalos, P","first_name":"P","last_name":"Pardalos"}],"volume":11353,"user_id":"15504","citation":{"short":"J. Bossek, H. Trautmann, in: R. Battiti, M. Brunato, I. Kotsireas, P. Pardalos (Eds.), Learning and Intelligent Optimization, Springer, Cham, 2019, pp. 215–219.","ama":"Bossek J, Trautmann H. Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time. In: Battiti R, Brunato M, Kotsireas I, Pardalos P, eds. <i>Learning and Intelligent Optimization</i>. Vol 11353. Lecture Notes in Computer Science. Springer; 2019:215–219.","chicago":"Bossek, Jakob, and Heike Trautmann. “Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time.” In <i>Learning and Intelligent Optimization</i>, edited by R Battiti, M Brunato, I Kotsireas, and P Pardalos, 11353:215–219. Lecture Notes in Computer Science. Cham: Springer, 2019.","bibtex":"@inproceedings{Bossek_Trautmann_2019, place={Cham}, series={Lecture Notes in Computer Science}, title={Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time}, volume={11353}, booktitle={Learning and Intelligent Optimization}, publisher={Springer}, author={Bossek, Jakob and Trautmann, Heike}, editor={Battiti, R and Brunato, M and Kotsireas, I and Pardalos, P}, year={2019}, pages={215–219}, collection={Lecture Notes in Computer Science} }","apa":"Bossek, J., &#38; Trautmann, H. (2019). Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time. In R. Battiti, M. Brunato, I. Kotsireas, &#38; P. Pardalos (Eds.), <i>Learning and Intelligent Optimization</i> (Vol. 11353, pp. 215–219). Springer.","mla":"Bossek, Jakob, and Heike Trautmann. “Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time.” <i>Learning and Intelligent Optimization</i>, edited by R Battiti et al., vol. 11353, Springer, 2019, pp. 215–219.","ieee":"J. Bossek and H. Trautmann, “Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time,” in <i>Learning and Intelligent Optimization</i>, 2019, vol. 11353, pp. 215–219."},"place":"Cham","author":[{"full_name":"Bossek, Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","first_name":"Jakob","id":"102979"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","first_name":"Heike","orcid":"0000-0002-9788-8282","id":"100740"}],"publication_identifier":{"isbn":["978-3-030-05347-5"]},"title":"Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time","year":"2019","intvolume":"     11353","date_updated":"2024-06-10T12:00:23Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","publication":"Learning and Intelligent Optimization","abstract":[{"text":"A multiobjective perspective onto common performance measures such as the PAR10 score or the expected runtime of single-objective stochastic solvers is presented by directly investigating the tradeoff between the fraction of failed runs and the average runtime. Multi-objective indicators operating in the bi-objective space allow for an overall performance comparison on a set of instances paving the way for instance-based automated algorithm selection techniques.","lang":"eng"}],"date_created":"2023-08-04T07:44:10Z","department":[{"_id":"34"},{"_id":"819"}],"type":"conference"},{"publication":"Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering","abstract":[{"text":"Recent years have seen the development of numerous tools for the analysis of taint flows in Android apps. Taint analyses aim at detecting data leaks, accidentally or by purpose programmed into apps. Often, such tools specialize in the treatment of specific features impeding precise taint analysis (like reflection or inter-app communication). This multitude of tools, their specific applicability and their various combination options complicate the selection of a tool (or multiple tools) when faced with an analysis instance, even for knowledgeable users, and hence hinders the successful adoption of taint analyses.\r\n\r\nIn this work, we thus present CoDiDroid, a framework for cooperative Android app analysis. CoDiDroid (1) allows users to ask questions about flows in apps in varying degrees of detail, (2) automatically generates subtasks for answering such questions, (3) distributes tasks onto analysis tools (currently DroidRA, FlowDroid, HornDroid, IC3 and two novel tools) and (4) at the end merges tool answers on subtasks into an overall answer. Thereby, users are freed from having to learn about the use and functionality of all these tools while still being able to leverage their capabilities. Moreover, we experimentally show that cooperation among tools pays off with respect to effectiveness, precision and scalability.","lang":"eng"}],"date_created":"2019-06-04T11:15:25Z","file":[{"date_created":"2019-08-20T08:47:20Z","creator":"fpauck","content_type":"application/pdf","file_id":"12947","date_updated":"2019-08-20T08:47:20Z","relation":"main_file","file_size":442603,"access_level":"closed","file_name":"fse19main-id44-p-ef9ce42-41855-final.pdf"}],"department":[{"_id":"77"}],"type":"conference","keyword":["Android Taint Analysis","Cooperation","Precision","Tools"],"author":[{"first_name":"Felix","last_name":"Pauck","full_name":"Pauck, Felix","id":"22398"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"publication_identifier":{"isbn":["978-1-4503-5572-8"]},"title":"Together Strong: Cooperative Android App Analysis","year":"2019","publication_status":"published","date_updated":"2023-01-18T08:32:47Z","language":[{"iso":"eng"}],"doi":"10.1145/3338906.3338915","citation":{"apa":"Pauck, F., &#38; Wehrheim, H. (2019). Together Strong: Cooperative Android App Analysis. <i>Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering</i>, 374–384. <a href=\"https://doi.org/10.1145/3338906.3338915\">https://doi.org/10.1145/3338906.3338915</a>","ieee":"F. Pauck and H. Wehrheim, “Together Strong: Cooperative Android App Analysis,” in <i>Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering</i>, 2019, pp. 374–384, doi: <a href=\"https://doi.org/10.1145/3338906.3338915\">10.1145/3338906.3338915</a>.","short":"F. Pauck, H. Wehrheim, in: Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2019, pp. 374–384.","chicago":"Pauck, Felix, and Heike Wehrheim. “Together Strong: Cooperative Android App Analysis.” In <i>Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering</i>, 374–84, 2019. <a href=\"https://doi.org/10.1145/3338906.3338915\">https://doi.org/10.1145/3338906.3338915</a>.","mla":"Pauck, Felix, and Heike Wehrheim. “Together Strong: Cooperative Android App Analysis.” <i>Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering</i>, 2019, pp. 374–84, doi:<a href=\"https://doi.org/10.1145/3338906.3338915\">10.1145/3338906.3338915</a>.","ama":"Pauck F, Wehrheim H. Together Strong: Cooperative Android App Analysis. In: <i>Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering</i>. ; 2019:374-384. doi:<a href=\"https://doi.org/10.1145/3338906.3338915\">10.1145/3338906.3338915</a>","bibtex":"@inproceedings{Pauck_Wehrheim_2019, title={Together Strong: Cooperative Android App Analysis}, DOI={<a href=\"https://doi.org/10.1145/3338906.3338915\">10.1145/3338906.3338915</a>}, booktitle={Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering}, author={Pauck, Felix and Wehrheim, Heike}, year={2019}, pages={374–384} }"},"file_date_updated":"2019-08-20T08:47:20Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"status":"public","has_accepted_license":"1","_id":"10108","page":"374-384","user_id":"22398","ddc":["004"]},{"date_created":"2019-10-16T09:40:20Z","type":"conference","department":[{"_id":"77"}],"publication":"Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings","citation":{"bibtex":"@inproceedings{Isenberg_Jakobs_Pauck_Wehrheim_2019, title={When Are Software Verification Results Valid for Approximate Hardware?}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">10.1007/978-3-030-31157-5_1</a>}, booktitle={Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings}, author={Isenberg, Tobias and Jakobs, Marie-Christine and Pauck, Felix and Wehrheim, Heike}, year={2019}, pages={3–20} }","ama":"Isenberg T, Jakobs M-C, Pauck F, Wehrheim H. When Are Software Verification Results Valid for Approximate Hardware? In: <i>Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings</i>. ; 2019:3-20. doi:<a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">10.1007/978-3-030-31157-5_1</a>","mla":"Isenberg, Tobias, et al. “When Are Software Verification Results Valid for Approximate Hardware?” <i>Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings</i>, 2019, pp. 3–20, doi:<a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">10.1007/978-3-030-31157-5_1</a>.","short":"T. Isenberg, M.-C. Jakobs, F. Pauck, H. Wehrheim, in: Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings, 2019, pp. 3–20.","chicago":"Isenberg, Tobias, Marie-Christine Jakobs, Felix Pauck, and Heike Wehrheim. “When Are Software Verification Results Valid for Approximate Hardware?” In <i>Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings</i>, 3–20, 2019. <a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">https://doi.org/10.1007/978-3-030-31157-5_1</a>.","ieee":"T. Isenberg, M.-C. Jakobs, F. Pauck, and H. Wehrheim, “When Are Software Verification Results Valid for Approximate Hardware?,” in <i>Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings</i>, 2019, pp. 3–20, doi: <a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">10.1007/978-3-030-31157-5_1</a>.","apa":"Isenberg, T., Jakobs, M.-C., Pauck, F., &#38; Wehrheim, H. (2019). When Are Software Verification Results Valid for Approximate Hardware? <i>Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings</i>, 3–20. <a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">https://doi.org/10.1007/978-3-030-31157-5_1</a>"},"project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"1","name":"SFB 901"}],"page":"3-20","language":[{"iso":"eng"}],"_id":"13874","doi":"10.1007/978-3-030-31157-5_1","user_id":"22398","status":"public","title":"When Are Software Verification Results Valid for Approximate Hardware?","year":"2019","author":[{"last_name":"Isenberg","first_name":"Tobias","full_name":"Isenberg, Tobias"},{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"full_name":"Pauck, Felix","first_name":"Felix","last_name":"Pauck","id":"22398"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"date_updated":"2023-01-18T08:41:17Z","publication_status":"published"},{"publication":"IEEE Transactions on Cognitive and Developmental Systems","citation":{"ieee":"K. Rohlfing, G. Leonardi, I. Nomikou, J. Rączaszek-Leonardi, and E. Hüllermeier, “Multimodal Turn-Taking: Motivations, Methodological Challenges, and Novel Approaches,” <i>IEEE Transactions on Cognitive and Developmental Systems</i>, 2019, doi: <a href=\"https://doi.org/10.1109/TCDS.2019.2892991\">10.1109/TCDS.2019.2892991</a>.","apa":"Rohlfing, K., Leonardi, G., Nomikou, I., Rączaszek-Leonardi, J., &#38; Hüllermeier, E. (2019). Multimodal Turn-Taking: Motivations, Methodological Challenges, and Novel Approaches. <i>IEEE Transactions on Cognitive and Developmental Systems</i>. <a href=\"https://doi.org/10.1109/TCDS.2019.2892991\">https://doi.org/10.1109/TCDS.2019.2892991</a>","short":"K. Rohlfing, G. Leonardi, I. Nomikou, J. Rączaszek-Leonardi, E. Hüllermeier, IEEE Transactions on Cognitive and Developmental Systems (2019).","chicago":"Rohlfing, Katharina, Giuseppe Leonardi, Iris Nomikou, Joanna Rączaszek-Leonardi, and Eyke Hüllermeier. “Multimodal Turn-Taking: Motivations, Methodological Challenges, and Novel Approaches.” <i>IEEE Transactions on Cognitive and Developmental Systems</i>, 2019. <a href=\"https://doi.org/10.1109/TCDS.2019.2892991\">https://doi.org/10.1109/TCDS.2019.2892991</a>.","mla":"Rohlfing, Katharina, et al. “Multimodal Turn-Taking: Motivations, Methodological Challenges, and Novel Approaches.” <i>IEEE Transactions on Cognitive and Developmental Systems</i>, 2019, doi:<a href=\"https://doi.org/10.1109/TCDS.2019.2892991\">10.1109/TCDS.2019.2892991</a>.","bibtex":"@article{Rohlfing_Leonardi_Nomikou_Rączaszek-Leonardi_Hüllermeier_2019, title={Multimodal Turn-Taking: Motivations, Methodological Challenges, and Novel Approaches}, DOI={<a href=\"https://doi.org/10.1109/TCDS.2019.2892991\">10.1109/TCDS.2019.2892991</a>}, journal={IEEE Transactions on Cognitive and Developmental Systems}, author={Rohlfing, Katharina and Leonardi, Giuseppe and Nomikou, Iris and Rączaszek-Leonardi, Joanna and Hüllermeier, Eyke}, year={2019} }","ama":"Rohlfing K, Leonardi G, Nomikou I, Rączaszek-Leonardi J, Hüllermeier E. Multimodal Turn-Taking: Motivations, Methodological Challenges, and Novel Approaches. <i>IEEE Transactions on Cognitive and Developmental Systems</i>. Published online 2019. doi:<a href=\"https://doi.org/10.1109/TCDS.2019.2892991\">10.1109/TCDS.2019.2892991</a>"},"type":"journal_article","department":[{"_id":"749"},{"_id":"355"}],"date_created":"2020-11-02T13:25:49Z","date_updated":"2023-02-01T12:39:19Z","year":"2019","status":"public","title":"Multimodal Turn-Taking: Motivations, Methodological Challenges, and Novel Approaches","author":[{"last_name":"Rohlfing","first_name":"Katharina","full_name":"Rohlfing, Katharina","id":"50352"},{"full_name":"Leonardi, Giuseppe","first_name":"Giuseppe","last_name":"Leonardi"},{"full_name":"Nomikou, Iris","first_name":"Iris","last_name":"Nomikou"},{"full_name":"Rączaszek-Leonardi, Joanna","last_name":"Rączaszek-Leonardi","first_name":"Joanna"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"}],"user_id":"14931","doi":"10.1109/TCDS.2019.2892991","_id":"20243","language":[{"iso":"eng"}]},{"year":"2019","title":"Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut","author":[{"id":"71541","full_name":"Gharibian, Sevag","orcid":"0000-0002-9992-3379","first_name":"Sevag","last_name":"Gharibian"},{"last_name":"Parekh","first_name":"Ojas","full_name":"Parekh, Ojas"}],"publication_status":"published","date_updated":"2023-02-28T11:05:46Z","intvolume":"       145","main_file_link":[{"url":"http://drops.dagstuhl.de/opus/volltexte/2019/11246/","open_access":"1"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"doi":"10.4230/LIPICS.APPROX-RANDOM.2019.31","publication":"Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)","date_created":"2019-09-19T08:33:29Z","type":"conference","department":[{"_id":"623"},{"_id":"7"}],"status":"public","page":"31:1-31:17","_id":"13297","user_id":"71541","volume":145,"citation":{"mla":"Gharibian, Sevag, and Ojas Parekh. “Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut.” <i>Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>, vol. 145, 2019, p. 31:1-31:17, doi:<a href=\"https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31\">10.4230/LIPICS.APPROX-RANDOM.2019.31</a>.","bibtex":"@inproceedings{Gharibian_Parekh_2019, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut}, volume={145}, DOI={<a href=\"https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31\">10.4230/LIPICS.APPROX-RANDOM.2019.31</a>}, booktitle={Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)}, author={Gharibian, Sevag and Parekh, Ojas}, year={2019}, pages={31:1-31:17}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","ama":"Gharibian S, Parekh O. Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut. In: <i>Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>. Vol 145. Leibniz International Proceedings in Informatics (LIPIcs). ; 2019:31:1-31:17. doi:<a href=\"https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31\">10.4230/LIPICS.APPROX-RANDOM.2019.31</a>","ieee":"S. Gharibian and O. Parekh, “Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut,” in <i>Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>, 2019, vol. 145, p. 31:1-31:17, doi: <a href=\"https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31\">10.4230/LIPICS.APPROX-RANDOM.2019.31</a>.","apa":"Gharibian, S., &#38; Parekh, O. (2019). Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut. <i>Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>, <i>145</i>, 31:1-31:17. <a href=\"https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31\">https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31</a>","short":"S. Gharibian, O. Parekh, in: Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2019, p. 31:1-31:17.","chicago":"Gharibian, Sevag, and Ojas Parekh. “Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut.” In <i>Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>, 145:31:1-31:17. Leibniz International Proceedings in Informatics (LIPIcs), 2019. <a href=\"https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31\">https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31</a>."},"oa":"1"},{"date_created":"2019-10-01T08:25:27Z","oa":"1","department":[{"_id":"623"},{"_id":"7"}],"type":"journal_article","citation":{"ama":"Gharibian S, Yirka J. The complexity of simulating local measurements on quantum systems. <i>Quantum</i>. 2019;3:189. doi:<a href=\"https://doi.org/10.22331/q-2019-09-30-189\">10.22331/q-2019-09-30-189</a>","bibtex":"@article{Gharibian_Yirka_2019, title={The complexity of simulating local measurements on quantum systems}, volume={3}, DOI={<a href=\"https://doi.org/10.22331/q-2019-09-30-189\">10.22331/q-2019-09-30-189</a>}, journal={Quantum}, author={Gharibian, Sevag and Yirka, Justin }, year={2019}, pages={189} }","mla":"Gharibian, Sevag, and Justin Yirka. “The Complexity of Simulating Local Measurements on Quantum Systems.” <i>Quantum</i>, vol. 3, 2019, p. 189, doi:<a href=\"https://doi.org/10.22331/q-2019-09-30-189\">10.22331/q-2019-09-30-189</a>.","chicago":"Gharibian, Sevag, and Justin  Yirka. “The Complexity of Simulating Local Measurements on Quantum Systems.” <i>Quantum</i> 3 (2019): 189. <a href=\"https://doi.org/10.22331/q-2019-09-30-189\">https://doi.org/10.22331/q-2019-09-30-189</a>.","short":"S. Gharibian, J. Yirka, Quantum 3 (2019) 189.","apa":"Gharibian, S., &#38; Yirka, J. (2019). The complexity of simulating local measurements on quantum systems. <i>Quantum</i>, <i>3</i>, 189. <a href=\"https://doi.org/10.22331/q-2019-09-30-189\">https://doi.org/10.22331/q-2019-09-30-189</a>","ieee":"S. Gharibian and J. Yirka, “The complexity of simulating local measurements on quantum systems,” <i>Quantum</i>, vol. 3, p. 189, 2019, doi: <a href=\"https://doi.org/10.22331/q-2019-09-30-189\">10.22331/q-2019-09-30-189</a>."},"publication":"Quantum","_id":"13558","language":[{"iso":"eng"}],"page":"189","main_file_link":[{"open_access":"1","url":"https://quantum-journal.org/papers/q-2019-09-30-189/"}],"volume":3,"doi":"10.22331/q-2019-09-30-189","user_id":"71541","author":[{"first_name":"Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian","full_name":"Gharibian, Sevag","id":"71541"},{"last_name":"Yirka","first_name":"Justin ","full_name":"Yirka, Justin "}],"title":"The complexity of simulating local measurements on quantum systems","year":"2019","status":"public","intvolume":"         3","date_updated":"2023-02-28T11:05:35Z","publication_status":"published"},{"doi":"10.1007/978-3-030-17227-5_10","main_file_link":[{"open_access":"1"}],"series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"date_updated":"2023-05-15T08:13:37Z","publication_status":"published","intvolume":"     11444","year":"2019","title":"Proof-Carrying Hardware Versus the Stealthy Malicious LUT Hardware Trojan","author":[{"id":"72764","orcid":"0000-0002-1837-2254","last_name":"Ahmed","first_name":"Qazi Arbab","full_name":"Ahmed, Qazi Arbab"},{"first_name":"Tobias","last_name":"Wiersema","full_name":"Wiersema, Tobias","id":"3118"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco","id":"398"}],"publication_identifier":{"isbn":["978-3-030-17227-5"]},"type":"conference","department":[{"_id":"78"}],"file":[{"access_level":"closed","file_size":661354,"file_name":"978-3-030-17227-5_10.pdf","date_updated":"2023-05-11T09:12:33Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"44749","creator":"qazi","date_created":"2023-05-11T09:12:33Z"}],"date_created":"2019-05-22T07:36:05Z","abstract":[{"text":"Reconfigurable hardware has received considerable attention as a platform that enables dynamic hardware updates and thus is able to adapt new configurations at runtime. However, due to their dynamic nature, e.g., field-programmable gate arrays (FPGA) are subject to a constant possibility of attacks, since each new configuration might be compromised. Trojans for reconfigurable hardware that evade state-of-the-art detection techniques and even formal verification, are thus a large threat to these devices. One such stealthy hardware Trojan, that is inserted and activated in two stages by compromised electronic design automation (EDA) tools, has recently been presented and shown to evade all forms of classical pre-configuration detection techniques. This paper presents a successful pre-configuration countermeasure against this ``Malicious Look-up-table (LUT)''-hardware Trojan, by employing bitstream-level Proof-Carrying Hardware (PCH). We show that the method is able to alert innocent module creators to infected EDA tools, and to prohibit malicious ones to sell infected modules to unsuspecting customers.","lang":"eng"}],"publication":"Applied Reconfigurable Computing","ddc":["000"],"user_id":"72764","editor":[{"full_name":"Hochberger, Christian","last_name":"Hochberger","first_name":"Christian"},{"first_name":"Brent","last_name":"Nelson","full_name":"Nelson, Brent"},{"full_name":"Koch, Andreas","first_name":"Andreas","last_name":"Koch"},{"full_name":"Woods, Roger","last_name":"Woods","first_name":"Roger"},{"full_name":"Diniz, Pedro","first_name":"Pedro","last_name":"Diniz"}],"volume":11444,"page":"127-136","_id":"9913","publisher":"Springer International Publishing","has_accepted_license":"1","status":"public","conference":{"end_date":"2019-04-11","location":"Darmstadt, Germany","name":"15th International Symposium on Applied Reconfigurable Computing (ARC 2019)","start_date":"2019-04-09"},"oa":"1","place":"Cham","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"file_date_updated":"2023-05-11T09:12:33Z","citation":{"short":"Q.A. Ahmed, T. Wiersema, M. Platzner, in: C. Hochberger, B. Nelson, A. Koch, R. Woods, P. Diniz (Eds.), Applied Reconfigurable Computing, Springer International Publishing, Cham, 2019, pp. 127–136.","chicago":"Ahmed, Qazi Arbab, Tobias Wiersema, and Marco Platzner. “Proof-Carrying Hardware Versus the Stealthy Malicious LUT Hardware Trojan.” In <i>Applied Reconfigurable Computing</i>, edited by Christian Hochberger, Brent Nelson, Andreas Koch, Roger Woods, and Pedro Diniz, 11444:127–36. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2019. <a href=\"https://doi.org/10.1007/978-3-030-17227-5_10\">https://doi.org/10.1007/978-3-030-17227-5_10</a>.","apa":"Ahmed, Q. A., Wiersema, T., &#38; Platzner, M. (2019). Proof-Carrying Hardware Versus the Stealthy Malicious LUT Hardware Trojan. In C. Hochberger, B. Nelson, A. Koch, R. Woods, &#38; P. Diniz (Eds.), <i>Applied Reconfigurable Computing</i> (Vol. 11444, pp. 127–136). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-17227-5_10\">https://doi.org/10.1007/978-3-030-17227-5_10</a>","ieee":"Q. A. Ahmed, T. Wiersema, and M. Platzner, “Proof-Carrying Hardware Versus the Stealthy Malicious LUT Hardware Trojan,” in <i>Applied Reconfigurable Computing</i>, Darmstadt, Germany, 2019, vol. 11444, pp. 127–136, doi: <a href=\"https://doi.org/10.1007/978-3-030-17227-5_10\">10.1007/978-3-030-17227-5_10</a>.","ama":"Ahmed QA, Wiersema T, Platzner M. Proof-Carrying Hardware Versus the Stealthy Malicious LUT Hardware Trojan. In: Hochberger C, Nelson B, Koch A, Woods R, Diniz P, eds. <i>Applied Reconfigurable Computing</i>. Vol 11444. Lecture Notes in Computer Science. Springer International Publishing; 2019:127-136. doi:<a href=\"https://doi.org/10.1007/978-3-030-17227-5_10\">10.1007/978-3-030-17227-5_10</a>","bibtex":"@inproceedings{Ahmed_Wiersema_Platzner_2019, place={Cham}, series={Lecture Notes in Computer Science}, title={Proof-Carrying Hardware Versus the Stealthy Malicious LUT Hardware Trojan}, volume={11444}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-17227-5_10\">10.1007/978-3-030-17227-5_10</a>}, booktitle={Applied Reconfigurable Computing}, publisher={Springer International Publishing}, author={Ahmed, Qazi Arbab and Wiersema, Tobias and Platzner, Marco}, editor={Hochberger, Christian and Nelson, Brent and Koch, Andreas and Woods, Roger and Diniz, Pedro}, year={2019}, pages={127–136}, collection={Lecture Notes in Computer Science} }","mla":"Ahmed, Qazi Arbab, et al. “Proof-Carrying Hardware Versus the Stealthy Malicious LUT Hardware Trojan.” <i>Applied Reconfigurable Computing</i>, edited by Christian Hochberger et al., vol. 11444, Springer International Publishing, 2019, pp. 127–36, doi:<a href=\"https://doi.org/10.1007/978-3-030-17227-5_10\">10.1007/978-3-030-17227-5_10</a>."}},{"type":"bachelorsthesis","department":[{"_id":"66"}],"date_created":"2023-05-23T13:00:40Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C5: SFB 901 - Subproject C5","_id":"17"}],"supervisor":[{"id":"11319","last_name":"Strothmann","first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik"},{"id":"47208","full_name":"Gottschalk, Sebastian","first_name":"Sebastian","last_name":"Gottschalk"}],"citation":{"short":"N. N., Conception of a Digital Sales Bonus System Based on Blockchain Technology, 2019.","chicago":"N., N. <i>Conception of a Digital Sales Bonus System Based on Blockchain Technology</i>, 2019.","apa":"N., N. (2019). <i>Conception of a digital Sales Bonus System based on Blockchain Technology</i>.","ieee":"N. N., <i>Conception of a digital Sales Bonus System based on Blockchain Technology</i>. 2019.","ama":"N. N. <i>Conception of a Digital Sales Bonus System Based on Blockchain Technology</i>.; 2019.","bibtex":"@book{N._2019, title={Conception of a digital Sales Bonus System based on Blockchain Technology}, author={N., N.}, year={2019} }","mla":"N., N. <i>Conception of a Digital Sales Bonus System Based on Blockchain Technology</i>. 2019."},"user_id":"47208","language":[{"iso":"eng"}],"_id":"45231","date_updated":"2023-05-23T13:00:49Z","title":"Conception of a digital Sales Bonus System based on Blockchain Technology","status":"public","year":"2019","author":[{"full_name":"N., N.","first_name":"N.","last_name":"N."}]},{"doi":"10.1145/3315568.3329965","user_id":"15249","language":[{"iso":"eng"}],"_id":"14898","date_updated":"2023-06-15T08:52:37Z","publication_status":"published","year":"2019","status":"public","title":"Know your analysis: how instrumentation aids understanding static analysis","author":[{"id":"60543","full_name":"Schubert, Philipp","first_name":"Philipp","last_name":"Schubert","orcid":"0000-0002-8674-1859"},{"full_name":"Leer, Richard","last_name":"Leer","first_name":"Richard"},{"full_name":"Hermann, Ben","first_name":"Ben","last_name":"Hermann","orcid":"0000-0001-9848-2017","id":"66173"},{"orcid":"0000-0003-3470-3647","first_name":"Eric","last_name":"Bodden","full_name":"Bodden, Eric","id":"59256"}],"publication_identifier":{"isbn":["9781450367202"]},"type":"conference","department":[{"_id":"76"},{"_id":"34"},{"_id":"26"}],"date_created":"2019-11-12T12:22:16Z","project":[{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472","_id":"1"}],"publication":"Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019","citation":{"bibtex":"@inproceedings{Schubert_Leer_Hermann_Bodden_2019, title={Know your analysis: how instrumentation aids understanding static analysis}, DOI={<a href=\"https://doi.org/10.1145/3315568.3329965\">10.1145/3315568.3329965</a>}, booktitle={Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019}, author={Schubert, Philipp and Leer, Richard and Hermann, Ben and Bodden, Eric}, year={2019} }","ama":"Schubert P, Leer R, Hermann B, Bodden E. Know your analysis: how instrumentation aids understanding static analysis. In: <i>Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019</i>. ; 2019. doi:<a href=\"https://doi.org/10.1145/3315568.3329965\">10.1145/3315568.3329965</a>","short":"P. Schubert, R. Leer, B. Hermann, E. Bodden, in: Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019, 2019.","chicago":"Schubert, Philipp, Richard Leer, Ben Hermann, and Eric Bodden. “Know Your Analysis: How Instrumentation Aids Understanding Static Analysis.” In <i>Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019</i>, 2019. <a href=\"https://doi.org/10.1145/3315568.3329965\">https://doi.org/10.1145/3315568.3329965</a>.","ieee":"P. Schubert, R. Leer, B. Hermann, and E. Bodden, “Know your analysis: how instrumentation aids understanding static analysis,” 2019, doi: <a href=\"https://doi.org/10.1145/3315568.3329965\">10.1145/3315568.3329965</a>.","apa":"Schubert, P., Leer, R., Hermann, B., &#38; Bodden, E. (2019). Know your analysis: how instrumentation aids understanding static analysis. <i>Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019</i>. <a href=\"https://doi.org/10.1145/3315568.3329965\">https://doi.org/10.1145/3315568.3329965</a>","mla":"Schubert, Philipp, et al. “Know Your Analysis: How Instrumentation Aids Understanding Static Analysis.” <i>Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019</i>, 2019, doi:<a href=\"https://doi.org/10.1145/3315568.3329965\">10.1145/3315568.3329965</a>."}},{"oa":"1","file_date_updated":"2021-02-13T16:46:58Z","citation":{"mla":"Lienen, Christian. <i>Implementing a Real-Time System on a Platform FPGA Operated with ReconOS</i>. Universität Paderborn.","ama":"Lienen C. <i>Implementing a Real-Time System on a Platform FPGA Operated with ReconOS</i>. Universität Paderborn","bibtex":"@book{Lienen, title={Implementing a Real-time System on a Platform FPGA operated with ReconOS}, publisher={Universität Paderborn}, author={Lienen, Christian} }","apa":"Lienen, C. (n.d.). <i>Implementing a Real-time System on a Platform FPGA operated with ReconOS</i>. Universität Paderborn.","ieee":"C. Lienen, <i>Implementing a Real-time System on a Platform FPGA operated with ReconOS</i>. Universität Paderborn.","chicago":"Lienen, Christian. <i>Implementing a Real-Time System on a Platform FPGA Operated with ReconOS</i>. Universität Paderborn, n.d.","short":"C. Lienen, Implementing a Real-Time System on a Platform FPGA Operated with ReconOS, Universität Paderborn, n.d."},"supervisor":[{"full_name":"Clausing, Lennart","orcid":"0000-0003-3789-6034","last_name":"Clausing","first_name":"Lennart","id":"74287"},{"full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner","id":"398"},{"full_name":"Hellebrand, Sybille","last_name":"Hellebrand","orcid":"0000-0002-3717-3939","first_name":"Sybille","id":"209"}],"project":[{"name":"SFB 901 - T1: SFB 901 -Subproject T1","_id":"83"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"},{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "}],"publisher":"Universität Paderborn","_id":"15874","user_id":"60323","ddc":["004"],"status":"public","has_accepted_license":"1","file":[{"date_created":"2020-07-01T11:46:49Z","creator":"clienen","file_id":"17351","content_type":"application/pdf","relation":"main_file","date_updated":"2021-02-13T16:46:58Z","file_name":"thesis_main.pdf","file_size":5920668,"access_level":"open_access"}],"date_created":"2020-02-11T10:22:06Z","type":"mastersthesis","department":[{"_id":"78"}],"language":[{"iso":"eng"}],"year":"2019","title":"Implementing a Real-time System on a Platform FPGA operated with ReconOS","author":[{"full_name":"Lienen, Christian","first_name":"Christian","last_name":"Lienen","id":"60323"}],"publication_status":"submitted","date_updated":"2023-07-31T11:58:50Z"},{"status":"public","page":"564-585","_id":"21","publisher":"Global Science Press","user_id":"15278","volume":25,"citation":{"ieee":"D. Richters, M. Lass, A. Walther, C. Plessl, and T. Kühne, “A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices,” <i>Communications in Computational Physics</i>, vol. 25, no. 2, pp. 564–585, 2019, doi: <a href=\"https://doi.org/10.4208/cicp.OA-2018-0053\">10.4208/cicp.OA-2018-0053</a>.","apa":"Richters, D., Lass, M., Walther, A., Plessl, C., &#38; Kühne, T. (2019). A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices. <i>Communications in Computational Physics</i>, <i>25</i>(2), 564–585. <a href=\"https://doi.org/10.4208/cicp.OA-2018-0053\">https://doi.org/10.4208/cicp.OA-2018-0053</a>","short":"D. Richters, M. Lass, A. Walther, C. Plessl, T. Kühne, Communications in Computational Physics 25 (2019) 564–585.","chicago":"Richters, Dorothee, Michael Lass, Andrea Walther, Christian Plessl, and Thomas Kühne. “A General Algorithm to Calculate the Inverse Principal P-Th Root of Symmetric Positive Definite Matrices.” <i>Communications in Computational Physics</i> 25, no. 2 (2019): 564–85. <a href=\"https://doi.org/10.4208/cicp.OA-2018-0053\">https://doi.org/10.4208/cicp.OA-2018-0053</a>.","mla":"Richters, Dorothee, et al. “A General Algorithm to Calculate the Inverse Principal P-Th Root of Symmetric Positive Definite Matrices.” <i>Communications in Computational Physics</i>, vol. 25, no. 2, Global Science Press, 2019, pp. 564–85, doi:<a href=\"https://doi.org/10.4208/cicp.OA-2018-0053\">10.4208/cicp.OA-2018-0053</a>.","bibtex":"@article{Richters_Lass_Walther_Plessl_Kühne_2019, title={A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices}, volume={25}, DOI={<a href=\"https://doi.org/10.4208/cicp.OA-2018-0053\">10.4208/cicp.OA-2018-0053</a>}, number={2}, journal={Communications in Computational Physics}, publisher={Global Science Press}, author={Richters, Dorothee and Lass, Michael and Walther, Andrea and Plessl, Christian and Kühne, Thomas}, year={2019}, pages={564–585} }","ama":"Richters D, Lass M, Walther A, Plessl C, Kühne T. A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices. <i>Communications in Computational Physics</i>. 2019;25(2):564-585. doi:<a href=\"https://doi.org/10.4208/cicp.OA-2018-0053\">10.4208/cicp.OA-2018-0053</a>"},"quality_controlled":"1","project":[{"name":"Performance and Efficiency in HPC with Custom Computing","grant_number":"PL 595/2-1 / 320898746","_id":"32"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"external_id":{"arxiv":["1703.02456"]},"year":"2019","title":"A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices","author":[{"full_name":"Richters, Dorothee","first_name":"Dorothee","last_name":"Richters"},{"id":"24135","last_name":"Lass","first_name":"Michael","orcid":"0000-0002-5708-7632","full_name":"Lass, Michael"},{"last_name":"Walther","first_name":"Andrea","full_name":"Walther, Andrea"},{"id":"16153","first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian"},{"id":"49079","full_name":"Kühne, Thomas","last_name":"Kühne","first_name":"Thomas"}],"date_updated":"2023-09-26T11:45:02Z","intvolume":"        25","language":[{"iso":"eng"}],"doi":"10.4208/cicp.OA-2018-0053","publication":"Communications in Computational Physics","issue":"2","abstract":[{"text":"We address the general mathematical problem of computing the inverse p-th\r\nroot of a given matrix in an efficient way. A new method to construct iteration\r\nfunctions that allow calculating arbitrary p-th roots and their inverses of\r\nsymmetric positive definite matrices is presented. We show that the order of\r\nconvergence is at least quadratic and that adaptively adjusting a parameter q\r\nalways leads to an even faster convergence. In this way, a better performance\r\nthan with previously known iteration schemes is achieved. The efficiency of the\r\niterative functions is demonstrated for various matrices with different\r\ndensities, condition numbers and spectral radii.","lang":"eng"}],"date_created":"2017-07-25T14:48:26Z","type":"journal_article","department":[{"_id":"27"},{"_id":"518"},{"_id":"304"},{"_id":"104"}]},{"status":"public","has_accepted_license":"1","_id":"12871","ddc":["004"],"user_id":"15278","citation":{"chicago":"Platzner, Marco, and Christian Plessl. “FPGAs im Rechenzentrum.” <i>Informatik Spektrum</i>, 2019. <a href=\"https://doi.org/10.1007/s00287-019-01187-w\">https://doi.org/10.1007/s00287-019-01187-w</a>.","short":"M. Platzner, C. Plessl, Informatik Spektrum (2019).","ieee":"M. Platzner and C. Plessl, “FPGAs im Rechenzentrum,” <i>Informatik Spektrum</i>, 2019, doi: <a href=\"https://doi.org/10.1007/s00287-019-01187-w\">10.1007/s00287-019-01187-w</a>.","apa":"Platzner, M., &#38; Plessl, C. (2019). FPGAs im Rechenzentrum. <i>Informatik Spektrum</i>. <a href=\"https://doi.org/10.1007/s00287-019-01187-w\">https://doi.org/10.1007/s00287-019-01187-w</a>","bibtex":"@article{Platzner_Plessl_2019, title={FPGAs im Rechenzentrum}, DOI={<a href=\"https://doi.org/10.1007/s00287-019-01187-w\">10.1007/s00287-019-01187-w</a>}, journal={Informatik Spektrum}, author={Platzner, Marco and Plessl, Christian}, year={2019} }","ama":"Platzner M, Plessl C. FPGAs im Rechenzentrum. <i>Informatik Spektrum</i>. Published online 2019. doi:<a href=\"https://doi.org/10.1007/s00287-019-01187-w\">10.1007/s00287-019-01187-w</a>","mla":"Platzner, Marco, and Christian Plessl. “FPGAs im Rechenzentrum.” <i>Informatik Spektrum</i>, 2019, doi:<a href=\"https://doi.org/10.1007/s00287-019-01187-w\">10.1007/s00287-019-01187-w</a>."},"file_date_updated":"2019-07-22T12:45:02Z","quality_controlled":"1","oa":"1","publication_identifier":{"issn":["0170-6012","1432-122X"]},"author":[{"id":"398","last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"},{"id":"16153","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian","full_name":"Plessl, Christian"}],"year":"2019","title":"FPGAs im Rechenzentrum","date_updated":"2023-09-26T11:45:57Z","publication_status":"published","language":[{"iso":"ger"}],"doi":"10.1007/s00287-019-01187-w","publication":"Informatik Spektrum","date_created":"2019-07-22T12:42:44Z","file":[{"creator":"plessl","date_created":"2019-07-22T12:45:02Z","file_size":248360,"access_level":"open_access","file_name":"plessl19_informatik_spektrum.pdf","date_updated":"2019-07-22T12:45:02Z","relation":"main_file","content_type":"application/pdf","file_id":"12872"}],"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"journal_article"},{"user_id":"21241","editor":[{"last_name":"Pasternak","first_name":"Arno","full_name":"Pasternak, Arno"}],"page":" 385 ","_id":"14848","publisher":"Gesellschaft für Informatik","status":"public","conference":{"end_date":"2019-09-18","name":"INFOS 2019","start_date":"2019-09-16","location":"Dortmund, Germany"},"place":"Bonn","citation":{"bibtex":"@inproceedings{Schlichtig_Opel_Schulte_Biehler_Frischemeier_Podworny_Wassong_2019, place={Bonn}, title={Maschinelles Lernen im Unterricht mit Jupyter Notebook}, booktitle={Informatik für alle}, publisher={Gesellschaft für Informatik}, author={Schlichtig, Michael and Opel, Simone and Schulte, Carsten and Biehler, Rolf and Frischemeier, Daniel and Podworny, Susanne and Wassong, Thomas}, editor={Pasternak, Arno}, year={2019}, pages={385} }","ama":"Schlichtig M, Opel S, Schulte C, et al. Maschinelles Lernen im Unterricht mit Jupyter Notebook. In: Pasternak A, ed. <i>Informatik für alle</i>. Gesellschaft für Informatik; 2019:385.","mla":"Schlichtig, Michael, et al. “Maschinelles Lernen im Unterricht mit Jupyter Notebook.” <i>Informatik für alle</i>, edited by Arno Pasternak, Gesellschaft für Informatik, 2019, p. 385.","short":"M. Schlichtig, S. Opel, C. Schulte, R. Biehler, D. Frischemeier, S. Podworny, T. Wassong, in: A. Pasternak (Ed.), Informatik für alle, Gesellschaft für Informatik, Bonn, 2019, p. 385.","chicago":"Schlichtig, Michael, Simone Opel, Carsten Schulte, Rolf Biehler, Daniel Frischemeier, Susanne Podworny, and Thomas Wassong. “Maschinelles Lernen im Unterricht mit Jupyter Notebook.” In <i>Informatik für alle</i>, edited by Arno Pasternak, 385. Bonn: Gesellschaft für Informatik, 2019.","ieee":"M. Schlichtig <i>et al.</i>, “Maschinelles Lernen im Unterricht mit Jupyter Notebook,” in <i>Informatik für alle</i>, Dortmund, Germany, 2019, p. 385.","apa":"Schlichtig, M., Opel, S., Schulte, C., Biehler, R., Frischemeier, D., Podworny, S., &#38; Wassong, T. (2019). Maschinelles Lernen im Unterricht mit Jupyter Notebook. In A. Pasternak (Ed.), <i>Informatik für alle</i> (p. 385). Gesellschaft für Informatik."},"main_file_link":[{"url":"https://dl.gi.de/handle/20.500.12116/28964"}],"language":[{"iso":"ger"}],"date_updated":"2025-05-25T20:01:30Z","publication_status":"published","year":"2019","title":"Maschinelles Lernen im Unterricht mit Jupyter Notebook","author":[{"id":"32312","full_name":"Schlichtig, Michael","last_name":"Schlichtig","first_name":"Michael","orcid":"0000-0001-6600-6171"},{"first_name":"Simone","last_name":"Opel","full_name":"Opel, Simone"},{"last_name":"Schulte","first_name":"Carsten","full_name":"Schulte, Carsten"},{"last_name":"Biehler","first_name":"Rolf","full_name":"Biehler, Rolf"},{"last_name":"Frischemeier","first_name":"Daniel","full_name":"Frischemeier, Daniel"},{"full_name":"Podworny, Susanne","first_name":"Susanne","last_name":"Podworny"},{"id":"21241","first_name":"Thomas","last_name":"Wassong","full_name":"Wassong, Thomas"}],"publication_identifier":{"isbn":["978-3-88579-682-4"]},"type":"conference","department":[{"_id":"67"},{"_id":"97"}],"date_created":"2019-11-07T14:08:13Z","abstract":[{"text":"Data Science und Big Data durchdringt in ihren diversen Facetten unser tägliches Leben– kaum ein Tag, an dem nicht verschiedene Meldungen über technische Innovationen, Einsatzmöglichkeiten von Künstlicher Intelligenz (KI) und Maschinelles Lernen (ML) und ihre ethischen sowie gesellschaftlichen Implikationen in den unterschiedlichen Medien diskutiert werden. Aus diesem Grund erscheint es uns immens wichtig, diese Fragestellungen und Technologien auch in den Unterricht der Sekundarstufe II zu integrieren. Um diesem Anspruch gerecht zu werden, entwickelten wir im Rahmen eines Forschungsprojekts ein Curriculum, welches wir als konkretes Unterrichtskonzept innerhalb eines Projektkurses erprobt, evaluiert weiterentwickelt wird. Bei der Implementierung entschieden wir uns, zur aktiven Umsetzung von Konzepten von ML als Plattform Jupyter Notebook mit Python zu verwenden, da diese Umgebung durch die Verbindung von Code und Hypertext zur Dokumentation und Erklärung Medienbrüche im Lernprozess verringern kann. Zudem ist Python zur Implementierung der Methoden von ML sehr gut geeignet. Im Themenfeld des ML als Teilgebiet der KI legen wir den Fokus auf zwei unterschiedliche Lernverfahren um verschieden Aspekte von ML, u.A. wie Nachvollziehbarkeit unter gesellschaftlichen Gesichtspunkten zu vermitteln. Diese sind Künstliche Neuronale Netze (bei denen die Berechnung und Bedeutung der Kantengewichte zwischen den Neuronen für den Menschen insbesondere bei komplexeren Netzen kaum nachvollziehbar erschienen) und Entscheidungsbäume (strukturierte und gerichtete Bäume zur Darstellung von Entscheidungsregeln, welche auch für Schülerinnen und Schüler meist gut nachvollziehbares und verständliches KI-Modell darstellen). In diesem Workshop stellen wir konkrete Umsetzungsbeispiele inklusive der Programmierung für beide Verfahren mit Jupyter Notebook und Python als Teil einer Unterrichtssequenz vor und diskutieren diese.","lang":"ger"}],"publication":"Informatik für alle"}]