[{"citation":{"mla":"Afzal, Ayesha, et al. “Solving Maxwell’s Equations with Modern C++ and SYCL: A Case Study.” <i>Proceedings of the 29th Annual IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP)</i>, 2018, pp. 49–56, doi:<a href=\"https://doi.org/10.1109/ASAP.2018.8445127\">10.1109/ASAP.2018.8445127</a>.","bibtex":"@inproceedings{Afzal_Schmitt_Alhaddad_Grynko_Teich_Förstner_Hannig_2018, title={Solving Maxwell’s Equations with Modern C++ and SYCL: A Case Study}, DOI={<a href=\"https://doi.org/10.1109/ASAP.2018.8445127\">10.1109/ASAP.2018.8445127</a>}, booktitle={Proceedings of the 29th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)}, author={Afzal, Ayesha and Schmitt, Christian and Alhaddad, Samer and Grynko, Yevgen and Teich, Jürgen and Förstner, Jens and Hannig, Frank}, year={2018}, pages={49–56} }","ama":"Afzal A, Schmitt C, Alhaddad S, et al. Solving Maxwell’s Equations with Modern C++ and SYCL: A Case Study. In: <i>Proceedings of the 29th Annual IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP)</i>. ; 2018:49-56. doi:<a href=\"https://doi.org/10.1109/ASAP.2018.8445127\">10.1109/ASAP.2018.8445127</a>","ieee":"A. Afzal <i>et al.</i>, “Solving Maxwell’s Equations with Modern C++ and SYCL: A Case Study,” in <i>Proceedings of the 29th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)</i>, 2018, pp. 49–56.","apa":"Afzal, A., Schmitt, C., Alhaddad, S., Grynko, Y., Teich, J., Förstner, J., &#38; Hannig, F. (2018). Solving Maxwell’s Equations with Modern C++ and SYCL: A Case Study. In <i>Proceedings of the 29th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)</i> (pp. 49–56). <a href=\"https://doi.org/10.1109/ASAP.2018.8445127\">https://doi.org/10.1109/ASAP.2018.8445127</a>","chicago":"Afzal, Ayesha, Christian Schmitt, Samer Alhaddad, Yevgen Grynko, Jürgen Teich, Jens Förstner, and Frank Hannig. “Solving Maxwell’s Equations with Modern C++ and SYCL: A Case Study.” In <i>Proceedings of the 29th Annual IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP)</i>, 49–56, 2018. <a href=\"https://doi.org/10.1109/ASAP.2018.8445127\">https://doi.org/10.1109/ASAP.2018.8445127</a>.","short":"A. Afzal, C. Schmitt, S. Alhaddad, Y. Grynko, J. Teich, J. Förstner, F. Hannig, in: Proceedings of the 29th Annual IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP), 2018, pp. 49–56."},"file_date_updated":"2022-01-06T06:59:26Z","project":[{"grant_number":"01|H16005","_id":"33","name":"HighPerMeshes"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"3588","page":"49-56","user_id":"158","ddc":["004"],"status":"public","has_accepted_license":"1","date_created":"2018-07-23T07:12:03Z","file":[{"embargo_to":"open_access","creator":"fossie","date_created":"2018-08-21T10:12:05Z","file_name":"2018-08 Afzal - ASAP Proceedings - Solving Maxwell equations with modern C++ and SYCL.pdf","access_level":"request","file_size":252186,"embargo":"2019-09-03","relation":"main_file","date_updated":"2022-01-06T06:59:26Z","file_id":"3986","content_type":"application/pdf"}],"department":[{"_id":"61"}],"type":"conference","keyword":["tet_topic_hpc"],"publication":"Proceedings of the 29th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)","abstract":[{"lang":"eng","text":"In scientific computing, unstructured meshes are a crucial foundation for the simulation of real-world physical phenomena. Compared to regular grids, they allow resembling the computational domain with a much higher accuracy, which in turn leads to more efficient computations.<br />There exists a wealth of supporting libraries and frameworks that aid programmers with the implementation of applications working on such grids, each built on top of existing parallelization technologies. However, many approaches require the programmer to introduce a different programming paradigm into their application or provide different variants of the code. SYCL is a new programming standard providing a remedy to this dilemma by building on standard C ++17 with its so-called single-source approach: Programmers write standard C ++ code and expose parallelism using C++17 keywords. The application is<br />then transformed into a concrete implementation by the SYCL implementation. By encapsulating the OpenCL ecosystem, different SYCL implementations enable not only the programming of CPUs but also of heterogeneous platforms such as GPUs or other devices. For the first time, this paper showcases a SYCL-<br />based solver for the nodal Discontinuous Galerkin method for Maxwell’s equations on unstructured meshes. We compare our solution to a previous C-based implementation with respect to programmability and performance on heterogeneous platforms.<br"}],"language":[{"iso":"eng"}],"doi":"10.1109/ASAP.2018.8445127","publication_identifier":{"isbn":["978-1-5386-7479-6"]},"author":[{"full_name":"Afzal, Ayesha","first_name":"Ayesha","last_name":"Afzal"},{"full_name":"Schmitt, Christian","first_name":"Christian","last_name":"Schmitt"},{"full_name":"Alhaddad, Samer","first_name":"Samer","last_name":"Alhaddad","id":"42456"},{"last_name":"Grynko","first_name":"Yevgen","full_name":"Grynko, Yevgen","id":"26059"},{"last_name":"Teich","first_name":"Jürgen","full_name":"Teich, Jürgen"},{"id":"158","orcid":"0000-0001-7059-9862","first_name":"Jens","last_name":"Förstner","full_name":"Förstner, Jens"},{"last_name":"Hannig","first_name":"Frank","full_name":"Hannig, Frank"}],"title":"Solving Maxwell's Equations with Modern C++ and SYCL: A Case Study","year":"2018","date_updated":"2022-01-06T06:59:26Z"},{"doi":"10.17619/UNIPB/1-376","user_id":"477","publisher":"Universität Paderborn","_id":"3720","language":[{"iso":"eng"}],"page":"139","date_updated":"2022-01-06T06:59:31Z","publication_status":"published","author":[{"full_name":"Ho, Nam","last_name":"Ho","first_name":"Nam"}],"status":"public","title":"FPGA-based Reconfigurable Cache Mapping Schemes: Design and Optimization","year":"2018","department":[{"_id":"78"}],"type":"dissertation","date_created":"2018-07-27T06:41:13Z","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"abstract":[{"text":"Traditional cache design uses a consolidated block of memory address bits to index a cache set, equivalent to the use of modulo functions. While this module-based mapping scheme is widely used in contemporary cache structures due to the simplicity of its hardware design and its good performance for sequences of consecutive addresses, its use may not be satisfactory for a variety of application domains having different characteristics.This thesis presents a new type of cache mapping scheme, motivated by programmable capabilities combined with Nature-inspired optimization of reconfigurable hardware. This research has focussed on an FPGA-based evolvable cache structure of the first level cache in a multi-core processor architecture, able to dynamically change cache indexing. To solve the challenge of reconfigurable cache mappings, a programmable Boolean circuit based on a combination of Look-up Table (LUT) memory elements is proposed. Focusing on optimization aspects at the system level, a Performance Measurement Infrastructure is introduced that is able to monitor the underlying microarchitectural metrics, and an adaptive evaluation strategy is presented that leverages on Evolutionary Algorithms, that is not only capable of evolving application-specific address-to-cache-index mappings for level one split caches but also of reducing optimization times. Putting this all together and prototyping in an FPGA for a LEON3/Linux-based multi-core processor, the creation of a system architecture reduces cache misses and improves performance over the use of conventional caches.","lang":"eng"},{"lang":"ger","text":"Traditionelle Cachedesigns verwenden konsolidierte Blöcke von Speicheradressbits um einen Cachesatz zu indizieren, vergleichbar mit der Anwendung einer Modulofunktion. Obwohl dieses modulobasierte Abbildungsschema in heutigen Cachestrukturen weit verbreitet ist, vor allem wegen seiner einfachen Anforderungen an das Hardwaredesign und seiner Effizienz für die Indizierung eufeinanderfolgender Speicheradressen, kann seine Verwendung für eine Vielzahl von Anwendungsdomänen mit unterschiedlichen Charakteristiken zu suboptimalen Ergebnissen führen. Diese Dissertation präsentiert einen neuen Typ von Cacheabbildungsschema, motiviert durch die Kombination programmierbarer Ressourcen mit der naturinspirierten Optimierung rekonfigurierbarer Hardware. Im Fokus dieser Forschung steht eine FPGA-basierte Cachestruktur für den first level Cache einer Mehrkernprozessorarchitektur, welche die Cacheindizierung dynamisch ändern kann. Um die Herausforderung rekonfigurierbarer Cacheabbildungen zu lösen, wird eine reprogrammierbare Boolesche Schaltung eingeführt, die auf Look-up Table (LUT) Speicherelementen basiert. Weiterhin wird eine Infrastruktur zur Effizienzmessung eingeführt, welche die zugrundeliege Mikroarchitektur überwachen kann, sowie eine adaptive Evaluationsstrategie präsentiert, die evolutionäre Algorithmen wirksam einsetzt, und die nicht nur anwendungsspezifische Abbildungen von Speicheradressen zu Cacheindizes für level one Caches evolvieren sondern dabei auch die Optimierungszeiten reduzieren kann. All diese Aspekte zusammen in einer prototypischen Implementierung auf einem FPGA für einen LEON3/Linux-basierten Mehrkernprozessor zeigen, dass evolvierbare Cacheabbildungsfunktionen Cache Misses reduzieren, sowie die Effizienz im Vergleich zu konventionellen Caches erhöhen können."}],"supervisor":[{"first_name":"Paul","last_name":"Kaufmann","full_name":"Kaufmann, Paul"},{"id":"398","full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"}],"citation":{"mla":"Ho, Nam. <i>FPGA-Based Reconfigurable Cache Mapping Schemes: Design and Optimization</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-376\">10.17619/UNIPB/1-376</a>.","ama":"Ho N. <i>FPGA-Based Reconfigurable Cache Mapping Schemes: Design and Optimization</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-376\">10.17619/UNIPB/1-376</a>","bibtex":"@book{Ho_2018, title={FPGA-based Reconfigurable Cache Mapping Schemes: Design and Optimization}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-376\">10.17619/UNIPB/1-376</a>}, publisher={Universität Paderborn}, author={Ho, Nam}, year={2018} }","apa":"Ho, N. (2018). <i>FPGA-based Reconfigurable Cache Mapping Schemes: Design and Optimization</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-376\">https://doi.org/10.17619/UNIPB/1-376</a>","ieee":"N. Ho, <i>FPGA-based Reconfigurable Cache Mapping Schemes: Design and Optimization</i>. Universität Paderborn, 2018.","chicago":"Ho, Nam. <i>FPGA-Based Reconfigurable Cache Mapping Schemes: Design and Optimization</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-376\">https://doi.org/10.17619/UNIPB/1-376</a>.","short":"N. Ho, FPGA-Based Reconfigurable Cache Mapping Schemes: Design and Optimization, Universität Paderborn, 2018."}},{"type":"journal_article","keyword":["tet_topic_waveguide"],"department":[{"_id":"61"}],"file":[{"creator":"hclaudia","date_created":"2018-08-01T09:30:58Z","file_name":"2018-07 Ebers_Hammer_Förstner_OpticsExpress_Oblique incidence of semi guided planar waves on slab waveguide steps_Rounded Edges.pdf","access_level":"open_access","file_size":6193865,"relation":"main_file","date_updated":"2018-08-01T09:30:58Z","file_id":"3741","content_type":"application/pdf"}],"date_created":"2018-08-01T09:31:03Z","abstract":[{"lang":"eng","text":"Oblique propagation of semi-guided waves across slab waveguide structures with bent corners is investigated. A critical angle can be defined beyond which all radiation losses are suppressed. Additionally an increase of the curvature radius of the bends also leads to low-loss configurations for incidence angles below that critical angle. A combination of two bent corner systems represents a step-like structure, behaving like a Fabry-Perot interferometer, with two partial reflectors separated by the vertical height between the horizontal slabs. We numerically analyse typical high-index-contrast Si/SiO2 structures for their reflectance and transmittance properties. When increasing the curvature radius the resonant effect becomes less relevant such that full transmittance is reached with less critical conditions on the vertical distance or the incidence angle. For practical interest 3-D problems are considered, where the structures are excited by the fundamental mode of a wide, shallow rib waveguide. High transmittance levels can be observed also for these 3-D configurations depending on the width of the rib."}],"publication":"Optics Express","issue":"14","doi":"10.1364/OE.26.018621","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:59:33Z","article_type":"letter_note","intvolume":"        26","year":"2018","title":"Oblique incidence of semi-guided planar waves on slab waveguide steps: effects of rounded edges","author":[{"full_name":"Ebers, Lena","last_name":"Ebers","first_name":"Lena","id":"40428"},{"full_name":"Hammer, Manfred","orcid":"0000-0002-6331-9348","first_name":"Manfred","last_name":"Hammer","id":"48077"},{"full_name":"Förstner, Jens","first_name":"Jens","orcid":"0000-0001-7059-9862","last_name":"Förstner","id":"158"}],"oa":"1","project":[{"name":"TRR 142 - Project Area C","_id":"56"},{"name":"TRR 142","_id":"53"},{"name":"TRR 142 - Subproject C5","_id":"75"}],"file_date_updated":"2018-08-01T09:30:58Z","citation":{"chicago":"Ebers, Lena, Manfred Hammer, and Jens Förstner. “Oblique Incidence of Semi-Guided Planar Waves on Slab Waveguide Steps: Effects of Rounded Edges.” <i>Optics Express</i> 26, no. 14 (2018): 18621–32. <a href=\"https://doi.org/10.1364/OE.26.018621\">https://doi.org/10.1364/OE.26.018621</a>.","short":"L. Ebers, M. Hammer, J. Förstner, Optics Express 26 (2018) 18621–18632.","ama":"Ebers L, Hammer M, Förstner J. Oblique incidence of semi-guided planar waves on slab waveguide steps: effects of rounded edges. <i>Optics Express</i>. 2018;26(14):18621-18632. doi:<a href=\"https://doi.org/10.1364/OE.26.018621\">10.1364/OE.26.018621</a>","bibtex":"@article{Ebers_Hammer_Förstner_2018, title={Oblique incidence of semi-guided planar waves on slab waveguide steps: effects of rounded edges}, volume={26}, DOI={<a href=\"https://doi.org/10.1364/OE.26.018621\">10.1364/OE.26.018621</a>}, number={14}, journal={Optics Express}, publisher={OSA Publishing}, author={Ebers, Lena and Hammer, Manfred and Förstner, Jens}, year={2018}, pages={18621–18632} }","apa":"Ebers, L., Hammer, M., &#38; Förstner, J. (2018). Oblique incidence of semi-guided planar waves on slab waveguide steps: effects of rounded edges. <i>Optics Express</i>, <i>26</i>(14), 18621–18632. <a href=\"https://doi.org/10.1364/OE.26.018621\">https://doi.org/10.1364/OE.26.018621</a>","mla":"Ebers, Lena, et al. “Oblique Incidence of Semi-Guided Planar Waves on Slab Waveguide Steps: Effects of Rounded Edges.” <i>Optics Express</i>, vol. 26, no. 14, OSA Publishing, 2018, pp. 18621–32, doi:<a href=\"https://doi.org/10.1364/OE.26.018621\">10.1364/OE.26.018621</a>.","ieee":"L. Ebers, M. Hammer, and J. Förstner, “Oblique incidence of semi-guided planar waves on slab waveguide steps: effects of rounded edges,” <i>Optics Express</i>, vol. 26, no. 14, pp. 18621–18632, 2018."},"user_id":"158","ddc":["620"],"volume":26,"page":"18621-18632","_id":"3740","publisher":"OSA Publishing","urn":"37409","has_accepted_license":"1","status":"public"},{"date_updated":"2022-01-06T06:59:36Z","author":[{"full_name":"Al Khatib, Khalid","first_name":"Khalid","last_name":"Al Khatib"},{"id":"3900","last_name":"Wachsmuth","first_name":"Henning","full_name":"Wachsmuth, Henning"},{"last_name":"Lang","first_name":"Kevin","full_name":"Lang, Kevin"},{"last_name":"Herpel","first_name":"Jakob","full_name":"Herpel, Jakob"},{"full_name":"Hagen, Matthias","last_name":"Hagen","first_name":"Matthias"},{"last_name":"Stein","first_name":"Benno","full_name":"Stein, Benno"}],"title":"Modeling Deliberative Argumentation Strategies on Wikipedia","year":"2018","status":"public","user_id":"82920","_id":"3804","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://www.aclweb.org/anthology/P18-1237.pdf"}],"page":"2545-2555","citation":{"ieee":"K. Al Khatib, H. Wachsmuth, K. Lang, J. Herpel, M. Hagen, and B. Stein, “Modeling Deliberative Argumentation Strategies on Wikipedia,” in <i>Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</i>, 2018, pp. 2545–2555.","mla":"Al Khatib, Khalid, et al. “Modeling Deliberative Argumentation Strategies on Wikipedia.” <i>Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</i>, 2018, pp. 2545–55.","apa":"Al Khatib, K., Wachsmuth, H., Lang, K., Herpel, J., Hagen, M., &#38; Stein, B. (2018). Modeling Deliberative Argumentation Strategies on Wikipedia. In <i>Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</i> (pp. 2545–2555).","bibtex":"@inproceedings{Al Khatib_Wachsmuth_Lang_Herpel_Hagen_Stein_2018, title={Modeling Deliberative Argumentation Strategies on Wikipedia}, booktitle={Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)}, author={Al Khatib, Khalid and Wachsmuth, Henning and Lang, Kevin and Herpel, Jakob and Hagen, Matthias and Stein, Benno}, year={2018}, pages={2545–2555} }","chicago":"Al Khatib, Khalid, Henning Wachsmuth, Kevin Lang, Jakob Herpel, Matthias Hagen, and Benno Stein. “Modeling Deliberative Argumentation Strategies on Wikipedia.” In <i>Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</i>, 2545–55, 2018.","ama":"Al Khatib K, Wachsmuth H, Lang K, Herpel J, Hagen M, Stein B. Modeling Deliberative Argumentation Strategies on Wikipedia. In: <i>Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</i>. ; 2018:2545-2555.","short":"K. Al Khatib, H. Wachsmuth, K. Lang, J. Herpel, M. Hagen, B. Stein, in: Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2018, pp. 2545–2555."},"publication":"Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)","department":[{"_id":"568"},{"_id":"600"}],"type":"conference","date_created":"2018-08-02T13:38:27Z"},{"date_updated":"2022-01-06T06:59:36Z","status":"public","title":"Before Name-Calling: Dynamics and Triggers of Ad Hominem Fallacies in Web Argumentation","year":"2018","author":[{"last_name":"Habernal","first_name":"Ivan","full_name":"Habernal, Ivan"},{"id":"3900","first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning"},{"last_name":"Gurevych","first_name":"Iryna","full_name":"Gurevych, Iryna"},{"last_name":"Stein","first_name":"Benno","full_name":"Stein, Benno"}],"user_id":"82920","main_file_link":[{"url":"https://www.aclweb.org/anthology/N18-1036.pdf"}],"page":"386-396","language":[{"iso":"eng"}],"_id":"3806","publication":"Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers)","citation":{"ieee":"I. Habernal, H. Wachsmuth, I. Gurevych, and B. Stein, “Before Name-Calling: Dynamics and Triggers of Ad Hominem Fallacies in Web Argumentation,” in <i>Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers)</i>, 2018, pp. 386–396.","apa":"Habernal, I., Wachsmuth, H., Gurevych, I., &#38; Stein, B. (2018). Before Name-Calling: Dynamics and Triggers of Ad Hominem Fallacies in Web Argumentation. In <i>Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers)</i> (pp. 386–396).","chicago":"Habernal, Ivan, Henning Wachsmuth, Iryna Gurevych, and Benno Stein. “Before Name-Calling: Dynamics and Triggers of Ad Hominem Fallacies in Web Argumentation.” In <i>Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers)</i>, 386–96, 2018.","short":"I. Habernal, H. Wachsmuth, I. Gurevych, B. Stein, in: Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers), 2018, pp. 386–396.","mla":"Habernal, Ivan, et al. “Before Name-Calling: Dynamics and Triggers of Ad Hominem Fallacies in Web Argumentation.” <i>Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers)</i>, 2018, pp. 386–96.","bibtex":"@inproceedings{Habernal_Wachsmuth_Gurevych_Stein_2018, title={Before Name-Calling: Dynamics and Triggers of Ad Hominem Fallacies in Web Argumentation}, booktitle={Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers)}, author={Habernal, Ivan and Wachsmuth, Henning and Gurevych, Iryna and Stein, Benno}, year={2018}, pages={386–396} }","ama":"Habernal I, Wachsmuth H, Gurevych I, Stein B. Before Name-Calling: Dynamics and Triggers of Ad Hominem Fallacies in Web Argumentation. In: <i>Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers)</i>. ; 2018:386-396."},"type":"conference","department":[{"_id":"568"},{"_id":"600"}],"date_created":"2018-08-02T13:38:29Z"},{"date_created":"2018-08-02T13:38:31Z","department":[{"_id":"600"}],"type":"conference","citation":{"mla":"Habernal, Ivan, et al. “SemEval-2018 Task 12: The Argument Reasoning Comprehension Task.” <i>Proceedings of The 12th International Workshop on Semantic Evaluation</i>, 2018, pp. 763–72.","bibtex":"@inproceedings{Habernal_Wachsmuth_Gurevych_Stein_2018, title={SemEval-2018 Task 12: The Argument Reasoning Comprehension Task}, booktitle={Proceedings of The 12th International Workshop on Semantic Evaluation}, author={Habernal, Ivan and Wachsmuth, Henning and Gurevych, Iryna and Stein, Benno}, year={2018}, pages={763–772} }","ama":"Habernal I, Wachsmuth H, Gurevych I, Stein B. SemEval-2018 Task 12: The Argument Reasoning Comprehension Task. In: <i>Proceedings of The 12th International Workshop on Semantic Evaluation</i>. ; 2018:763-772.","ieee":"I. Habernal, H. Wachsmuth, I. Gurevych, and B. Stein, “SemEval-2018 Task 12: The Argument Reasoning Comprehension Task,” in <i>Proceedings of The 12th International Workshop on Semantic Evaluation</i>, 2018, pp. 763–772.","apa":"Habernal, I., Wachsmuth, H., Gurevych, I., &#38; Stein, B. (2018). SemEval-2018 Task 12: The Argument Reasoning Comprehension Task. In <i>Proceedings of The 12th International Workshop on Semantic Evaluation</i> (pp. 763–772).","short":"I. Habernal, H. Wachsmuth, I. Gurevych, B. Stein, in: Proceedings of The 12th International Workshop on Semantic Evaluation, 2018, pp. 763–772.","chicago":"Habernal, Ivan, Henning Wachsmuth, Iryna Gurevych, and Benno Stein. “SemEval-2018 Task 12: The Argument Reasoning Comprehension Task.” In <i>Proceedings of The 12th International Workshop on Semantic Evaluation</i>, 763–72, 2018."},"publication":"Proceedings of The 12th International Workshop on Semantic Evaluation","language":[{"iso":"eng"}],"_id":"3807","main_file_link":[{"url":"https://www.aclweb.org/anthology/S18-1121.pdf"}],"page":"763-772","user_id":"82920","author":[{"last_name":"Habernal","first_name":"Ivan","full_name":"Habernal, Ivan"},{"id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth"},{"full_name":"Gurevych, Iryna","last_name":"Gurevych","first_name":"Iryna"},{"last_name":"Stein","first_name":"Benno","full_name":"Stein, Benno"}],"title":"SemEval-2018 Task 12: The Argument Reasoning Comprehension Task","status":"public","year":"2018","date_updated":"2022-01-06T06:59:36Z"},{"user_id":"82920","main_file_link":[{"url":"https://www.aclweb.org/anthology/P18-1023.pdf"}],"page":"241-251","language":[{"iso":"eng"}],"_id":"3821","date_updated":"2022-01-06T06:59:37Z","year":"2018","status":"public","title":"Retrieval of the Best Counterargument without Prior Topic Knowledge","author":[{"full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth","id":"3900"},{"full_name":"Syed, Shahbaz","first_name":"Shahbaz","last_name":"Syed"},{"full_name":"Stein, Benno","last_name":"Stein","first_name":"Benno"}],"type":"conference","department":[{"_id":"568"},{"_id":"600"}],"date_created":"2018-08-02T13:38:50Z","publication":"Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)","citation":{"ama":"Wachsmuth H, Syed S, Stein B. Retrieval of the Best Counterargument without Prior Topic Knowledge. In: <i>Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</i>. ; 2018:241-251.","bibtex":"@inproceedings{Wachsmuth_Syed_Stein_2018, title={Retrieval of the Best Counterargument without Prior Topic Knowledge}, booktitle={Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)}, author={Wachsmuth, Henning and Syed, Shahbaz and Stein, Benno}, year={2018}, pages={241–251} }","mla":"Wachsmuth, Henning, et al. “Retrieval of the Best Counterargument without Prior Topic Knowledge.” <i>Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</i>, 2018, pp. 241–51.","short":"H. Wachsmuth, S. Syed, B. Stein, in: Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2018, pp. 241–251.","chicago":"Wachsmuth, Henning, Shahbaz Syed, and Benno Stein. “Retrieval of the Best Counterargument without Prior Topic Knowledge.” In <i>Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</i>, 241–51, 2018.","apa":"Wachsmuth, H., Syed, S., &#38; Stein, B. (2018). Retrieval of the Best Counterargument without Prior Topic Knowledge. In <i>Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</i> (pp. 241–251).","ieee":"H. Wachsmuth, S. Syed, and B. Stein, “Retrieval of the Best Counterargument without Prior Topic Knowledge,” in <i>Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</i>, 2018, pp. 241–251."}},{"language":[{"iso":"ger"}],"_id":"3851","publisher":"Universität Paderborn","user_id":"14052","author":[{"full_name":"Koop, Samuel","first_name":"Samuel","last_name":"Koop"}],"title":"Congestion Games mit gewichteten Strategien","status":"public","year":"2018","date_updated":"2022-01-06T06:59:45Z","date_created":"2018-08-08T11:56:37Z","department":[{"_id":"541"},{"_id":"63"}],"type":"bachelorsthesis","citation":{"apa":"Koop, S. (2018). <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn.","ieee":"S. Koop, <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn, 2018.","short":"S. Koop, Congestion Games mit gewichteten Strategien, Universität Paderborn, 2018.","chicago":"Koop, Samuel. <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn, 2018.","mla":"Koop, Samuel. <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn, 2018.","ama":"Koop S. <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn; 2018.","bibtex":"@book{Koop_2018, title={Congestion Games mit gewichteten Strategien}, publisher={Universität Paderborn}, author={Koop, Samuel}, year={2018} }"},"supervisor":[{"full_name":"Skopalik, Alexander","first_name":"Alexander","last_name":"Skopalik","id":"40384"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}]},{"publication":"ICML 2018 AutoML Workshop","abstract":[{"text":"In automated machine learning (AutoML), the process of engineering machine learning applications with respect to a specific problem is (partially) automated.\r\nVarious AutoML tools have already been introduced to provide out-of-the-box machine learning functionality.\r\nMore specifically, by selecting machine learning algorithms and optimizing their hyperparameters, these tools produce a machine learning pipeline tailored to the problem at hand.\r\nExcept for TPOT, all of these tools restrict the maximum number of processing steps of such a pipeline.\r\nHowever, as TPOT follows an evolutionary approach, it suffers from performance issues when dealing with larger datasets.\r\nIn this paper, we present an alternative approach leveraging a hierarchical planning to configure machine learning pipelines that are unlimited in length.\r\nWe evaluate our approach and find its performance to be competitive with other AutoML tools, including TPOT.","lang":"eng"}],"file":[{"content_type":"application/pdf","file_id":"3853","access_level":"open_access","file_size":297811,"file_name":"38.pdf","date_updated":"2018-08-09T06:14:43Z","relation":"main_file","date_created":"2018-08-09T06:14:43Z","creator":"wever"}],"date_created":"2018-08-09T06:14:54Z","keyword":["automated machine learning","complex pipelines","hierarchical planning"],"type":"conference","department":[{"_id":"355"}],"year":"2018","title":"ML-Plan for Unlimited-Length Machine Learning Pipelines","author":[{"full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik","last_name":"Wever","id":"33176"},{"last_name":"Mohr","first_name":"Felix","full_name":"Mohr, Felix"},{"last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129"}],"date_updated":"2022-01-06T06:59:46Z","main_file_link":[{"url":"https://docs.google.com/viewer?a=v&pid=sites&srcid=ZGVmYXVsdGRvbWFpbnxhdXRvbWwyMDE4aWNtbHxneDo3M2Q3MjUzYjViNDRhZTAx"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-08-09T06:14:43Z","citation":{"apa":"Wever, M. D., Mohr, F., &#38; Hüllermeier, E. (2018). ML-Plan for Unlimited-Length Machine Learning Pipelines. In <i>ICML 2018 AutoML Workshop</i>. Stockholm, Sweden.","ieee":"M. D. Wever, F. Mohr, and E. Hüllermeier, “ML-Plan for Unlimited-Length Machine Learning Pipelines,” in <i>ICML 2018 AutoML Workshop</i>, Stockholm, Sweden, 2018.","short":"M.D. Wever, F. Mohr, E. Hüllermeier, in: ICML 2018 AutoML Workshop, 2018.","chicago":"Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “ML-Plan for Unlimited-Length Machine Learning Pipelines.” In <i>ICML 2018 AutoML Workshop</i>, 2018.","mla":"Wever, Marcel Dominik, et al. “ML-Plan for Unlimited-Length Machine Learning Pipelines.” <i>ICML 2018 AutoML Workshop</i>, 2018.","ama":"Wever MD, Mohr F, Hüllermeier E. ML-Plan for Unlimited-Length Machine Learning Pipelines. In: <i>ICML 2018 AutoML Workshop</i>. ; 2018.","bibtex":"@inproceedings{Wever_Mohr_Hüllermeier_2018, title={ML-Plan for Unlimited-Length Machine Learning Pipelines}, booktitle={ICML 2018 AutoML Workshop}, author={Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2018} }"},"quality_controlled":"1","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"oa":"1","status":"public","conference":{"location":"Stockholm, Sweden","name":"ICML 2018 AutoML Workshop","start_date":"2018-07-10","end_date":"2018-07-15"},"has_accepted_license":"1","urn":"38527","_id":"3852","user_id":"49109","ddc":["006"]},{"date_updated":"2022-01-06T06:59:47Z","year":"2018","status":"public","title":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","conference":{"location":"Vienna, Austria"},"publication_identifier":{"isbn":["978-1-4503-5799-9"]},"user_id":"15504","editor":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"},{"full_name":"Fineman, Jeremy T.","first_name":"Jeremy T.","last_name":"Fineman"}],"publisher":"ACM","_id":"3874","citation":{"short":"C. Scheideler, J.T. Fineman, eds., Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, ACM, 2018.","chicago":"Scheideler, Christian, and Jeremy T. Fineman, eds. <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures</i>. ACM, 2018.","ieee":"C. Scheideler and J. T. Fineman, Eds., <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures</i>. ACM, 2018.","apa":"Scheideler, C., &#38; Fineman, J. T. (Eds.). (2018). <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures</i>. Vienna, Austria: ACM.","bibtex":"@book{Scheideler_Fineman_2018, title={Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures}, publisher={ACM}, year={2018} }","ama":"Scheideler C, Fineman JT, eds. <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures</i>. ACM; 2018.","mla":"Scheideler, Christian, and Jeremy T. Fineman, editors. <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures</i>. ACM, 2018."},"type":"conference_editor","department":[{"_id":"79"}],"date_created":"2018-08-10T10:03:47Z"},{"conference":{"name":"ARES 2018","location":"Hamburg, Germany"},"status":"public","has_accepted_license":"1","_id":"2965","publisher":"ACM","page":"25:1--25:10","user_id":"13703","ddc":["000"],"citation":{"apa":"Blömer, J., &#38; Löken, N. (n.d.). Cloud Architectures for Searchable Encryption. In <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i> (pp. 25:1--25:10). New York, NY, USA: ACM. <a href=\"https://doi.org/10.1145/3230833.3230853\">https://doi.org/10.1145/3230833.3230853</a>","ieee":"J. Blömer and N. Löken, “Cloud Architectures for Searchable Encryption,” in <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i>, Hamburg, Germany, pp. 25:1--25:10.","chicago":"Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.” In <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i>, 25:1--25:10. New York, NY, USA: ACM, n.d. <a href=\"https://doi.org/10.1145/3230833.3230853\">https://doi.org/10.1145/3230833.3230853</a>.","short":"J. Blömer, N. Löken, in: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, ACM, New York, NY, USA, n.d., pp. 25:1--25:10.","mla":"Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.” <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i>, ACM, pp. 25:1--25:10, doi:<a href=\"https://doi.org/10.1145/3230833.3230853\">10.1145/3230833.3230853</a>.","ama":"Blömer J, Löken N. Cloud Architectures for Searchable Encryption. In: <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i>. New York, NY, USA: ACM; :25:1--25:10. doi:<a href=\"https://doi.org/10.1145/3230833.3230853\">10.1145/3230833.3230853</a>","bibtex":"@inproceedings{Blömer_Löken, place={New York, NY, USA}, title={Cloud Architectures for Searchable Encryption}, DOI={<a href=\"https://doi.org/10.1145/3230833.3230853\">10.1145/3230833.3230853</a>}, booktitle={Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018}, publisher={ACM}, author={Blömer, Johannes and Löken, Nils}, pages={25:1--25:10} }"},"file_date_updated":"2018-11-02T14:39:46Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"quality_controlled":"1","place":"New York, NY, USA","author":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"},{"first_name":"Nils","last_name":"Löken","full_name":"Löken, Nils","id":"13703"}],"publication_identifier":{"isbn":["978-1-4503-6448-5"]},"year":"2018","title":"Cloud Architectures for Searchable Encryption","publication_status":"accepted","date_updated":"2022-01-06T06:58:49Z","language":[{"iso":"eng"}],"doi":"10.1145/3230833.3230853","publication":"Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018","date_created":"2018-06-04T11:33:15Z","file":[{"creator":"ups","date_created":"2018-11-02T14:39:46Z","file_name":"a25-Blomer.pdf","file_size":769807,"access_level":"closed","relation":"main_file","date_updated":"2018-11-02T14:39:46Z","file_id":"5278","success":1,"content_type":"application/pdf"}],"department":[{"_id":"64"},{"_id":"568"}],"type":"conference"},{"doi":"10.1007/978-3-319-78372-7_14","ddc":["006"],"user_id":"38235","_id":"3105","language":[{"iso":"eng"}],"page":"425--455","main_file_link":[{"url":"https://eprint.iacr.org/2018/199.pdf"}],"has_accepted_license":"1","date_updated":"2022-01-06T06:58:56Z","author":[{"last_name":"Derler","first_name":"David","full_name":"Derler, David"},{"id":"64669","last_name":"Jager","first_name":"Tibor","full_name":"Jager, Tibor"},{"full_name":"Slamanig, Daniel","last_name":"Slamanig","first_name":"Daniel"},{"first_name":"Christoph","last_name":"Striecks","full_name":"Striecks, Christoph"}],"title":"Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange","year":"2018","status":"public","department":[{"_id":"558"}],"type":"conference","date_created":"2018-06-07T08:47:17Z","file":[{"relation":"main_file","date_updated":"2018-11-08T13:25:52Z","file_name":"2018-199.pdf","access_level":"closed","file_size":533731,"file_id":"5453","content_type":"application/pdf","success":1,"creator":"abirke","date_created":"2018-11-08T13:25:52Z"}],"citation":{"apa":"Derler, D., Jager, T., Slamanig, D., &#38; Striecks, C. (2018). Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange. In <i>Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III</i> (pp. 425--455). <a href=\"https://doi.org/10.1007/978-3-319-78372-7_14\">https://doi.org/10.1007/978-3-319-78372-7_14</a>","ieee":"D. Derler, T. Jager, D. Slamanig, and C. Striecks, “Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange,” in <i>Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III</i>, 2018, pp. 425--455.","short":"D. Derler, T. Jager, D. Slamanig, C. Striecks, in: Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III, 2018, pp. 425--455.","chicago":"Derler, David, Tibor Jager, Daniel Slamanig, and Christoph Striecks. “Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange.” In <i>Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III</i>, 425--455, 2018. <a href=\"https://doi.org/10.1007/978-3-319-78372-7_14\">https://doi.org/10.1007/978-3-319-78372-7_14</a>.","mla":"Derler, David, et al. “Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange.” <i>Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III</i>, 2018, pp. 425--455, doi:<a href=\"https://doi.org/10.1007/978-3-319-78372-7_14\">10.1007/978-3-319-78372-7_14</a>.","ama":"Derler D, Jager T, Slamanig D, Striecks C. Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange. In: <i>Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III</i>. ; 2018:425--455. doi:<a href=\"https://doi.org/10.1007/978-3-319-78372-7_14\">10.1007/978-3-319-78372-7_14</a>","bibtex":"@inproceedings{Derler_Jager_Slamanig_Striecks_2018, title={Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-78372-7_14\">10.1007/978-3-319-78372-7_14</a>}, booktitle={Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III}, author={Derler, David and Jager, Tibor and Slamanig, Daniel and Striecks, Christoph}, year={2018}, pages={425--455} }"},"publication":"Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III","file_date_updated":"2018-11-08T13:25:52Z"},{"oa":"1","file_date_updated":"2019-01-21T16:12:36Z","citation":{"ama":"Dräxler S, Karl H, Mann ZA. JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services. <i>IEEE Transactions on Network and Service Management</i>. 2018. doi:<a href=\"https://doi.org/10.1109/TNSM.2018.2846572\">10.1109/TNSM.2018.2846572</a>","bibtex":"@article{Dräxler_Karl_Mann_2018, title={JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services}, DOI={<a href=\"https://doi.org/10.1109/TNSM.2018.2846572\">10.1109/TNSM.2018.2846572</a>}, journal={IEEE Transactions on Network and Service Management}, publisher={IEEE}, author={Dräxler, Sevil and Karl, Holger and Mann, Zoltan Adam}, year={2018} }","mla":"Dräxler, Sevil, et al. “JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services.” <i>IEEE Transactions on Network and Service Management</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/TNSM.2018.2846572\">10.1109/TNSM.2018.2846572</a>.","chicago":"Dräxler, Sevil, Holger Karl, and Zoltan Adam Mann. “JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services.” <i>IEEE Transactions on Network and Service Management</i>, 2018. <a href=\"https://doi.org/10.1109/TNSM.2018.2846572\">https://doi.org/10.1109/TNSM.2018.2846572</a>.","short":"S. Dräxler, H. Karl, Z.A. Mann, IEEE Transactions on Network and Service Management (2018).","apa":"Dräxler, S., Karl, H., &#38; Mann, Z. A. (2018). JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services. <i>IEEE Transactions on Network and Service Management</i>. <a href=\"https://doi.org/10.1109/TNSM.2018.2846572\">https://doi.org/10.1109/TNSM.2018.2846572</a>","ieee":"S. Dräxler, H. Karl, and Z. A. Mann, “JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services,” <i>IEEE Transactions on Network and Service Management</i>, 2018."},"project":[{"_id":"23","grant_number":"762057","name":"5G Programmable Infrastructure Converging disaggregated neTwork and compUte Resources"},{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"_id":"3152","publisher":"IEEE","urn":"31522","ddc":["000"],"user_id":"31764","status":"public","has_accepted_license":"1","file":[{"date_created":"2018-11-02T15:25:49Z","creator":"ups","file_id":"5302","content_type":"application/pdf","success":1,"file_name":"08382313.pdf","access_level":"closed","file_size":1767054,"relation":"main_file","date_updated":"2018-11-02T15:25:49Z"},{"content_type":"application/pdf","file_id":"6950","date_updated":"2019-01-21T16:12:36Z","relation":"main_file","access_level":"open_access","file_size":2878350,"file_name":"TNSM2846572_RIS.pdf","date_created":"2019-01-21T16:12:36Z","creator":"sevilmeh"}],"date_created":"2018-06-11T06:55:05Z","type":"journal_article","department":[{"_id":"75"}],"publication":"IEEE Transactions on Network and Service Management","abstract":[{"lang":"eng","text":"To adapt to continuously changing workloads in networks, components of the running network services may need to be replicated (scaling the network service) and allocated to physical resources (placement) dynamically, also necessitating dynamic re-routing of flows between service components. In this paper, we propose JASPER, a fully automated approach to jointly optimizing scaling, placement, and routing for complex network services, consisting of multiple (virtualized) components. JASPER handles multiple network services that share the same substrate network; services can be dynamically added or removed and dynamic workload changes are handled. Our approach lets service designers specify their services on a high level of abstraction using service templates. JASPER automatically makes scaling, placement and routing decisions, enabling quick reaction to changes. We formalize the problem, analyze its complexity, and develop two algorithms to solve it. Extensive empirical results show the applicability and effectiveness of the proposed approach."}],"main_file_link":[{"url":"https://arxiv.org/abs/1711.10839","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1109/TNSM.2018.2846572","year":"2018","title":"JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services","author":[{"id":"31764","full_name":"Dräxler, Sevil","first_name":"Sevil","last_name":"Dräxler"},{"id":"126","last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger"},{"first_name":"Zoltan Adam","last_name":"Mann","full_name":"Mann, Zoltan Adam"}],"date_updated":"2022-01-06T06:59:00Z","article_type":"original"},{"user_id":"29719","_id":"3153","date_updated":"2022-01-06T06:59:00Z","author":[{"first_name":"Simon","last_name":"Doherty","full_name":"Doherty, Simon"},{"first_name":"John","last_name":"Derrick","full_name":"Derrick, John"},{"first_name":"Brijesh","last_name":"Dongol","full_name":"Dongol, Brijesh"},{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike","id":"573"}],"title":"Causal Linearizability: Compositionality for Partially Ordered Executions","status":"public","year":"2018","department":[{"_id":"77"}],"type":"journal_article","date_created":"2018-06-13T07:26:35Z","citation":{"ama":"Doherty S, Derrick J, Dongol B, Wehrheim H. Causal Linearizability: Compositionality for Partially Ordered Executions. <i>CoRR</i>. 2018.","bibtex":"@article{Doherty_Derrick_Dongol_Wehrheim_2018, title={Causal Linearizability: Compositionality for Partially Ordered Executions}, journal={CoRR}, author={Doherty, Simon and Derrick, John and Dongol, Brijesh and Wehrheim, Heike}, year={2018} }","mla":"Doherty, Simon, et al. “Causal Linearizability: Compositionality for Partially Ordered Executions.” <i>CoRR</i>, 2018.","short":"S. Doherty, J. Derrick, B. Dongol, H. Wehrheim, CoRR (2018).","chicago":"Doherty, Simon, John Derrick, Brijesh Dongol, and Heike Wehrheim. “Causal Linearizability: Compositionality for Partially Ordered Executions.” <i>CoRR</i>, 2018.","apa":"Doherty, S., Derrick, J., Dongol, B., &#38; Wehrheim, H. (2018). Causal Linearizability: Compositionality for Partially Ordered Executions. <i>CoRR</i>.","ieee":"S. Doherty, J. Derrick, B. Dongol, and H. Wehrheim, “Causal Linearizability: Compositionality for Partially Ordered Executions,” <i>CoRR</i>, 2018."},"publication":"CoRR"},{"_id":"2711","language":[{"iso":"eng"}],"ddc":["000"],"user_id":"477","author":[{"full_name":"Pauck, Felix","first_name":"Felix","last_name":"Pauck","id":"22398"},{"full_name":"Bodden, Eric","first_name":"Eric","orcid":"0000-0003-3470-3647","last_name":"Bodden","id":"59256"},{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike","id":"573"}],"title":"Do Android Taint Analysis Tools Keep their Promises?","year":"2018","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:57:35Z","date_created":"2018-05-09T08:27:11Z","file":[{"date_created":"2018-11-21T10:49:23Z","creator":"florida","success":1,"content_type":"application/pdf","file_id":"5781","file_size":1045861,"access_level":"closed","file_name":"Do Android Taint Analysis Tools Keep their Promises.pdf","date_updated":"2018-11-21T10:49:23Z","relation":"main_file"}],"department":[{"_id":"77"},{"_id":"76"}],"type":"preprint","citation":{"mla":"Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?” <i>ArXiv:1804.02903</i>, 2018.","ama":"Pauck F, Bodden E, Wehrheim H. Do Android Taint Analysis Tools Keep their Promises? <i>arXiv:180402903</i>. 2018.","bibtex":"@article{Pauck_Bodden_Wehrheim_2018, title={Do Android Taint Analysis Tools Keep their Promises?}, journal={arXiv:1804.02903}, author={Pauck, Felix and Bodden, Eric and Wehrheim, Heike}, year={2018} }","apa":"Pauck, F., Bodden, E., &#38; Wehrheim, H. (2018). Do Android Taint Analysis Tools Keep their Promises? <i>ArXiv:1804.02903</i>.","ieee":"F. Pauck, E. Bodden, and H. Wehrheim, “Do Android Taint Analysis Tools Keep their Promises?,” <i>arXiv:1804.02903</i>. 2018.","short":"F. Pauck, E. Bodden, H. Wehrheim, ArXiv:1804.02903 (2018).","chicago":"Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Do Android Taint Analysis Tools Keep Their Promises?” <i>ArXiv:1804.02903</i>, 2018."},"publication":"arXiv:1804.02903","file_date_updated":"2018-11-21T10:49:23Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"abstract":[{"lang":"eng","text":"In recent years, researchers have developed a number of tools to conduct\r\ntaint analysis of Android applications. While all the respective papers aim at\r\nproviding a thorough empirical evaluation, comparability is hindered by varying\r\nor unclear evaluation targets. Sometimes, the apps used for evaluation are not\r\nprecisely described. In other cases, authors use an established benchmark but\r\ncover it only partially. In yet other cases, the evaluations differ in terms of\r\nthe data leaks searched for, or lack a ground truth to compare against. All\r\nthose limitations make it impossible to truly compare the tools based on those\r\npublished evaluations.\r\n  We thus present ReproDroid, a framework allowing the accurate comparison of\r\nAndroid taint analysis tools. ReproDroid supports researchers in inferring the\r\nground truth for data leaks in apps, in automatically applying tools to\r\nbenchmarks, and in evaluating the obtained results. We use ReproDroid to\r\ncomparatively evaluate on equal grounds the six prominent taint analysis tools\r\nAmandroid, DIALDroid, DidFail, DroidSafe, FlowDroid and IccTA. The results are\r\nlargely positive although four tools violate some promises concerning features\r\nand accuracy. Finally, we contribute to the area of unbiased benchmarking with\r\na new and improved version of the open test suite DroidBench."}]},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"citation":{"apa":"Gmyr, R. (2018). <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-265\">https://doi.org/10.17619/UNIPB/1-265</a>","ieee":"R. Gmyr, <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018.","short":"R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter, Universität Paderborn, 2018.","chicago":"Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-265\">https://doi.org/10.17619/UNIPB/1-265</a>.","mla":"Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>.","ama":"Gmyr R. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>","bibtex":"@book{Gmyr_2018, title={Distributed Algorithms for Overlay Networks and Programmable Matter}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>}, publisher={Universität Paderborn}, author={Gmyr, Robert}, year={2018} }"},"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"department":[{"_id":"79"}],"type":"dissertation","date_created":"2018-01-31T06:04:03Z","date_updated":"2022-01-06T06:51:00Z","author":[{"full_name":"Gmyr, Robert","first_name":"Robert","last_name":"Gmyr"}],"year":"2018","status":"public","title":"Distributed Algorithms for Overlay Networks and Programmable Matter","user_id":"477","doi":"10.17619/UNIPB/1-265","_id":"1138","publisher":"Universität Paderborn"},{"has_accepted_license":"1","conference":{"name":"32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","start_date":"2018-5-22","location":"Vancouver","end_date":"2018-5-24"},"status":"public","ddc":["040"],"user_id":"11319","publisher":"IEEE","_id":"1163","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"citation":{"chicago":"Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.” In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">https://doi.org/10.1109/IPDPS.2018.00114</a>.","short":"M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS), IEEE, 2018.","ama":"Feldmann M, Kolb C, Scheideler C, Strothmann TF. Self-Stabilizing Supervised Publish-Subscribe Systems. In: <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>","bibtex":"@inproceedings{Feldmann_Kolb_Scheideler_Strothmann_2018, title={Self-Stabilizing Supervised Publish-Subscribe Systems}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>}, booktitle={Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018} }","mla":"Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.” <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>.","apa":"Feldmann, M., Kolb, C., Scheideler, C., &#38; Strothmann, T. F. (2018). Self-Stabilizing Supervised Publish-Subscribe Systems. In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. Vancouver: IEEE. <a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">https://doi.org/10.1109/IPDPS.2018.00114</a>","ieee":"M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing Supervised Publish-Subscribe Systems,” in <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, Vancouver, 2018."},"file_date_updated":"2018-10-31T13:25:37Z","external_id":{"arxiv":["1710.08128"]},"date_updated":"2022-01-06T06:51:05Z","author":[{"id":"23538","full_name":"Feldmann, Michael","first_name":"Michael","last_name":"Feldmann"},{"first_name":"Christina","last_name":"Kolb","full_name":"Kolb, Christina","id":"43647"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"id":"11319","first_name":"Thim Frederik","last_name":"Strothmann","full_name":"Strothmann, Thim Frederik"}],"year":"2018","title":"Self-Stabilizing Supervised Publish-Subscribe Systems","doi":"10.1109/IPDPS.2018.00114","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"In this paper we present two major results:\r\nFirst, we introduce the first self-stabilizing version of a supervised overlay network (as introduced in~\\cite{DBLP:conf/ispan/KothapalliS05}) by presenting a self-stabilizing supervised skip ring.\r\nSecondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system.\r\nThat is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system.\r\n"}],"publication":"Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","department":[{"_id":"79"},{"_id":"66"}],"keyword":["Topological Self-stabilization","Supervised Overlay","Publish-Subscribe System"],"type":"conference","date_created":"2018-02-01T13:56:01Z","file":[{"creator":"mfeldma2","date_created":"2018-10-31T13:25:37Z","access_level":"closed","file_size":239559,"file_name":"08425258.pdf","date_updated":"2018-10-31T13:25:37Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5211"}]},{"publisher":"IEEE","_id":"1164","user_id":"23538","ddc":["040"],"status":"public","conference":{"end_date":"2018-5-24","location":"Vancouver","start_date":"2018-5-22","name":"32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)"},"has_accepted_license":"1","external_id":{"arxiv":["1802.07504"]},"file_date_updated":"2018-10-31T13:29:26Z","citation":{"apa":"Feldmann, M., Scheideler, C., &#38; Setzer, A. (2018). Skueue: A Scalable and Sequentially Consistent Distributed Queue. In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. Vancouver: IEEE. <a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">https://doi.org/10.1109/IPDPS.2018.00113</a>","ieee":"M. Feldmann, C. Scheideler, and A. Setzer, “Skueue: A Scalable and Sequentially Consistent Distributed Queue,” in <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, Vancouver, 2018.","short":"M. Feldmann, C. Scheideler, A. Setzer, in: Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS), IEEE, 2018.","chicago":"Feldmann, Michael, Christian Scheideler, and Alexander Setzer. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">https://doi.org/10.1109/IPDPS.2018.00113</a>.","mla":"Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>.","ama":"Feldmann M, Scheideler C, Setzer A. Skueue: A Scalable and Sequentially Consistent Distributed Queue. In: <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>","bibtex":"@inproceedings{Feldmann_Scheideler_Setzer_2018, title={Skueue: A Scalable and Sequentially Consistent Distributed Queue}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>}, booktitle={Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Scheideler, Christian and Setzer, Alexander}, year={2018} }"},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"language":[{"iso":"eng"}],"doi":"10.1109/IPDPS.2018.00113","year":"2018","title":"Skueue: A Scalable and Sequentially Consistent Distributed Queue","author":[{"id":"23538","full_name":"Feldmann, Michael","first_name":"Michael","last_name":"Feldmann"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"},{"full_name":"Setzer, Alexander","first_name":"Alexander","last_name":"Setzer","id":"11108"}],"date_updated":"2022-01-06T06:51:05Z","file":[{"creator":"mfeldma2","date_created":"2018-10-31T13:29:26Z","date_updated":"2018-10-31T13:29:26Z","relation":"main_file","access_level":"closed","file_size":218420,"file_name":"08425257.pdf","success":1,"content_type":"application/pdf","file_id":"5212"}],"date_created":"2018-02-01T14:00:36Z","type":"conference","department":[{"_id":"79"}],"publication":"Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","abstract":[{"text":"We propose a distributed protocol for a queue, called Skueue, which spreads its data fairly onto multiple processes, avoiding bottlenecks in high throughput scenarios.\r\nSkueuecan be used in highly dynamic environments, through the addition of join and leave requests to the standard queue operations enqueue and dequeue.\r\nFurthermore Skueue satisfies sequential consistency in the asynchronous message passing model.\r\nScalability is achieved by aggregating multiple requests to a batch, which can then be processed in a distributed fashion without hurting the queue semantics.\r\nOperations in Skueue need a logarithmic number of rounds w.h.p. until they are processed, even under a high rate of incoming requests.","lang":"eng"}]},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"file_date_updated":"2018-11-26T08:00:53Z","publication":"4th Workshop On Approximate Computing (WAPCO 2018)","citation":{"bibtex":"@article{Witschen_Wiersema_Platzner_2018, title={Making the Case for Proof-carrying Approximate Circuits}, journal={4th Workshop On Approximate Computing (WAPCO 2018)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Platzner, Marco}, year={2018} }","ama":"Witschen LM, Wiersema T, Platzner M. Making the Case for Proof-carrying Approximate Circuits. <i>4th Workshop On Approximate Computing (WAPCO 2018)</i>. 2018.","mla":"Witschen, Linus Matthias, et al. “Making the Case for Proof-Carrying Approximate Circuits.” <i>4th Workshop On Approximate Computing (WAPCO 2018)</i>, 2018.","chicago":"Witschen, Linus Matthias, Tobias Wiersema, and Marco Platzner. “Making the Case for Proof-Carrying Approximate Circuits.” <i>4th Workshop On Approximate Computing (WAPCO 2018)</i>, 2018.","short":"L.M. Witschen, T. Wiersema, M. Platzner, 4th Workshop On Approximate Computing (WAPCO 2018) (2018).","ieee":"L. M. Witschen, T. Wiersema, and M. Platzner, “Making the Case for Proof-carrying Approximate Circuits,” <i>4th Workshop On Approximate Computing (WAPCO 2018)</i>. 2018.","apa":"Witschen, L. M., Wiersema, T., &#38; Platzner, M. (2018). Making the Case for Proof-carrying Approximate Circuits. <i>4th Workshop On Approximate Computing (WAPCO 2018)</i>."},"type":"preprint","department":[{"_id":"7"},{"_id":"34"},{"_id":"78"}],"file":[{"date_created":"2018-11-26T08:00:53Z","creator":"tobias82","file_id":"5821","content_type":"application/pdf","success":1,"file_name":"WitschenWP2018[1].pdf","file_size":287224,"access_level":"closed","relation":"main_file","date_updated":"2018-11-26T08:00:53Z"}],"date_created":"2018-02-01T14:24:54Z","date_updated":"2022-01-06T06:51:06Z","has_accepted_license":"1","title":"Making the Case for Proof-carrying Approximate Circuits","year":"2018","status":"public","author":[{"id":"49051","first_name":"Linus Matthias","last_name":"Witschen","full_name":"Witschen, Linus Matthias"},{"last_name":"Wiersema","first_name":"Tobias","full_name":"Wiersema, Tobias","id":"3118"},{"full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco","id":"398"}],"user_id":"49051","ddc":["000"],"language":[{"iso":"eng"}],"_id":"1165"},{"has_accepted_license":"1","conference":{"end_date":"2018-07-19","start_date":"2018-07-15","name":"GECCO 2018","location":"Kyoto, Japan"},"status":"public","ddc":["000"],"user_id":"33176","_id":"2109","publisher":"ACM","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"citation":{"ieee":"M. D. Wever, F. Mohr, and E. Hüllermeier, “Ensembles of Evolved Nested Dichotomies for Classification,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>, Kyoto, Japan, 2018.","apa":"Wever, M. D., Mohr, F., &#38; Hüllermeier, E. (2018). Ensembles of Evolved Nested Dichotomies for Classification. In <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>. Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/3205455.3205562\">https://doi.org/10.1145/3205455.3205562</a>","short":"M.D. Wever, F. Mohr, E. Hüllermeier, in: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018, ACM, Kyoto, Japan, 2018.","chicago":"Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “Ensembles of Evolved Nested Dichotomies for Classification.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>. Kyoto, Japan: ACM, 2018. <a href=\"https://doi.org/10.1145/3205455.3205562\">https://doi.org/10.1145/3205455.3205562</a>.","mla":"Wever, Marcel Dominik, et al. “Ensembles of Evolved Nested Dichotomies for Classification.” <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3205455.3205562\">10.1145/3205455.3205562</a>.","bibtex":"@inproceedings{Wever_Mohr_Hüllermeier_2018, place={Kyoto, Japan}, title={Ensembles of Evolved Nested Dichotomies for Classification}, DOI={<a href=\"https://doi.org/10.1145/3205455.3205562\">10.1145/3205455.3205562</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018}, publisher={ACM}, author={Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2018} }","ama":"Wever MD, Mohr F, Hüllermeier E. Ensembles of Evolved Nested Dichotomies for Classification. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>. Kyoto, Japan: ACM; 2018. doi:<a href=\"https://doi.org/10.1145/3205455.3205562\">10.1145/3205455.3205562</a>"},"file_date_updated":"2018-11-02T14:33:54Z","oa":"1","place":"Kyoto, Japan","date_updated":"2022-01-06T06:54:45Z","publication_status":"published","author":[{"id":"33176","full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik","last_name":"Wever"},{"full_name":"Mohr, Felix","first_name":"Felix","last_name":"Mohr"},{"full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke","id":"48129"}],"title":"Ensembles of Evolved Nested Dichotomies for Classification","year":"2018","doi":"10.1145/3205455.3205562","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://dl.acm.org/citation.cfm?doid=3205455.3205562","open_access":"1"}],"abstract":[{"lang":"eng","text":"In multinomial classification, reduction techniques are commonly used to decompose the original learning problem into several simpler problems. For example, by recursively bisecting the original set of classes, so-called nested dichotomies define a set of binary classification problems that are organized in the structure of a binary tree. In contrast to the existing one-shot heuristics for constructing nested dichotomies and motivated by recent work on algorithm configuration, we propose a genetic algorithm for optimizing the structure of such dichotomies. A key component of this approach is the proposed genetic representation that facilitates the application of standard genetic operators, while still supporting the exchange of partial solutions under recombination. We evaluate the approach in an extensive experimental study, showing that it yields classifiers with superior generalization performance."}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018","department":[{"_id":"355"}],"type":"conference","keyword":["Classification","Hierarchical Decomposition","Indirect Encoding"],"date_created":"2018-03-31T13:51:23Z","file":[{"file_name":"p561-wever.pdf","access_level":"closed","file_size":875404,"relation":"main_file","date_updated":"2018-11-02T14:33:54Z","file_id":"5275","content_type":"application/pdf","success":1,"creator":"ups","date_created":"2018-11-02T14:33:54Z"}]}]