[{"place":"Cham","oa":"1","file_date_updated":"2023-05-11T09:12:33Z","citation":{"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>.","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>."},"project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"}],"page":"127-136","publisher":"Springer International Publishing","_id":"9913","user_id":"72764","ddc":["000"],"volume":11444,"editor":[{"full_name":"Hochberger, Christian","last_name":"Hochberger","first_name":"Christian"},{"full_name":"Nelson, Brent","first_name":"Brent","last_name":"Nelson"},{"full_name":"Koch, Andreas","last_name":"Koch","first_name":"Andreas"},{"last_name":"Woods","first_name":"Roger","full_name":"Woods, Roger"},{"full_name":"Diniz, Pedro","last_name":"Diniz","first_name":"Pedro"}],"status":"public","conference":{"start_date":"2019-04-09","name":"15th International Symposium on Applied Reconfigurable Computing (ARC 2019)","location":"Darmstadt, Germany","end_date":"2019-04-11"},"has_accepted_license":"1","file":[{"date_created":"2023-05-11T09:12:33Z","creator":"qazi","file_id":"44749","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2023-05-11T09:12:33Z","file_name":"978-3-030-17227-5_10.pdf","file_size":661354,"access_level":"closed"}],"date_created":"2019-05-22T07:36:05Z","type":"conference","department":[{"_id":"78"}],"publication":"Applied Reconfigurable Computing","abstract":[{"lang":"eng","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."}],"main_file_link":[{"open_access":"1"}],"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-030-17227-5_10","title":"Proof-Carrying Hardware Versus the Stealthy Malicious LUT Hardware Trojan","year":"2019","publication_identifier":{"isbn":["978-3-030-17227-5"]},"author":[{"id":"72764","first_name":"Qazi Arbab","orcid":"0000-0002-1837-2254","last_name":"Ahmed","full_name":"Ahmed, Qazi Arbab"},{"id":"3118","last_name":"Wiersema","first_name":"Tobias","full_name":"Wiersema, Tobias"},{"id":"398","first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco"}],"publication_status":"published","date_updated":"2023-05-15T08:13:37Z","intvolume":"     11444"},{"department":[{"_id":"76"},{"_id":"34"},{"_id":"26"}],"type":"conference","date_created":"2019-11-12T12:22:16Z","project":[{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"1","grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "}],"citation":{"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>.","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>","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>.","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>.","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} }"},"publication":"Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019","user_id":"15249","doi":"10.1145/3315568.3329965","language":[{"iso":"eng"}],"_id":"14898","publication_status":"published","date_updated":"2023-06-15T08:52:37Z","author":[{"id":"60543","full_name":"Schubert, Philipp","last_name":"Schubert","first_name":"Philipp","orcid":"0000-0002-8674-1859"},{"full_name":"Leer, Richard","last_name":"Leer","first_name":"Richard"},{"id":"66173","full_name":"Hermann, Ben","last_name":"Hermann","first_name":"Ben","orcid":"0000-0001-9848-2017"},{"id":"59256","full_name":"Bodden, Eric","orcid":"0000-0003-3470-3647","first_name":"Eric","last_name":"Bodden"}],"publication_identifier":{"isbn":["9781450367202"]},"year":"2019","title":"Know your analysis: how instrumentation aids understanding static analysis","status":"public"},{"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://ieeexplore.ieee.org/document/8456425"}],"doi":"10.1109/SCC.2018.00039","author":[{"full_name":"Mohr, Felix","first_name":"Felix","last_name":"Mohr"},{"id":"33176","full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever"},{"id":"48129","full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier"},{"first_name":"Amin","last_name":"Faez","full_name":"Faez, Amin"}],"title":"(WIP) Towards the Automated Composition of Machine Learning Services","year":"2018","publication_status":"published","date_updated":"2022-01-06T06:56:35Z","date_created":"2018-04-24T08:34:52Z","file":[{"date_updated":"2018-11-06T15:08:39Z","relation":"main_file","access_level":"closed","file_size":237890,"file_name":"08456425.pdf","content_type":"application/pdf","file_id":"5382","creator":"wever","date_created":"2018-11-06T15:08:39Z"}],"department":[{"_id":"355"}],"type":"conference","publication":"SCC","publisher":"IEEE","_id":"2479","user_id":"49109","ddc":["000"],"conference":{"end_date":"2018-07-07","name":"IEEE International Conference on Services Computing, SCC 2018","start_date":"2018-07-02","location":"San Francisco, CA, USA"},"status":"public","has_accepted_license":"1","place":"San Francisco, CA, USA","oa":"1","citation":{"apa":"Mohr, F., Wever, M. D., Hüllermeier, E., &#38; Faez, A. (2018). (WIP) Towards the Automated Composition of Machine Learning Services. In <i>SCC</i>. San Francisco, CA, USA: IEEE. <a href=\"https://doi.org/10.1109/SCC.2018.00039\">https://doi.org/10.1109/SCC.2018.00039</a>","ieee":"F. Mohr, M. D. Wever, E. Hüllermeier, and A. Faez, “(WIP) Towards the Automated Composition of Machine Learning Services,” in <i>SCC</i>, San Francisco, CA, USA, 2018.","short":"F. Mohr, M.D. Wever, E. Hüllermeier, A. Faez, in: SCC, IEEE, San Francisco, CA, USA, 2018.","chicago":"Mohr, Felix, Marcel Dominik Wever, Eyke Hüllermeier, and Amin Faez. “(WIP) Towards the Automated Composition of Machine Learning Services.” In <i>SCC</i>. San Francisco, CA, USA: IEEE, 2018. <a href=\"https://doi.org/10.1109/SCC.2018.00039\">https://doi.org/10.1109/SCC.2018.00039</a>.","mla":"Mohr, Felix, et al. “(WIP) Towards the Automated Composition of Machine Learning Services.” <i>SCC</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/SCC.2018.00039\">10.1109/SCC.2018.00039</a>.","ama":"Mohr F, Wever MD, Hüllermeier E, Faez A. (WIP) Towards the Automated Composition of Machine Learning Services. In: <i>SCC</i>. San Francisco, CA, USA: IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/SCC.2018.00039\">10.1109/SCC.2018.00039</a>","bibtex":"@inproceedings{Mohr_Wever_Hüllermeier_Faez_2018, place={San Francisco, CA, USA}, title={(WIP) Towards the Automated Composition of Machine Learning Services}, DOI={<a href=\"https://doi.org/10.1109/SCC.2018.00039\">10.1109/SCC.2018.00039</a>}, booktitle={SCC}, publisher={IEEE}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke and Faez, Amin}, year={2018} }"},"file_date_updated":"2018-11-06T15:08:39Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"}]},{"year":"2018","title":"Programmatic Task Network Planning","author":[{"first_name":"Felix","last_name":"Mohr","full_name":"Mohr, Felix"},{"first_name":"Theodor","last_name":"Lettmann","orcid":"0000-0001-5859-2457","full_name":"Lettmann, Theodor","id":"315"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier","id":"48129"},{"id":"33176","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","first_name":"Marcel Dominik","full_name":"Wever, Marcel Dominik"}],"date_updated":"2022-01-06T06:58:08Z","main_file_link":[{"open_access":"1","url":"http://icaps18.icaps-conference.org/fileadmin/alg/conferences/icaps18/workshops/workshop08/docs/Mohr18ProgrammaticPlanning.pdf"}],"language":[{"iso":"eng"}],"publication":"Proceedings of the 1st ICAPS Workshop on Hierarchical Planning","file":[{"success":1,"content_type":"application/pdf","file_id":"5384","date_updated":"2018-11-06T15:18:26Z","relation":"main_file","file_size":349958,"access_level":"closed","file_name":"Mohr18ProgrammaticPlanning.pdf","date_created":"2018-11-06T15:18:26Z","creator":"wever"}],"date_created":"2018-05-24T09:00:20Z","type":"conference","department":[{"_id":"355"}],"status":"public","conference":{"location":"Delft, Netherlands","name":"28th International Conference on Automated Planning and Scheduling","start_date":"2018-06-24","end_date":"2018-06-29"},"has_accepted_license":"1","page":"31-39","_id":"2857","publisher":"AAAI","user_id":"315","ddc":["000"],"file_date_updated":"2018-11-06T15:18:26Z","citation":{"ieee":"F. Mohr, T. Lettmann, E. Hüllermeier, and M. D. Wever, “Programmatic Task Network Planning,” in <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i>, Delft, Netherlands, 2018, pp. 31–39.","apa":"Mohr, F., Lettmann, T., Hüllermeier, E., &#38; Wever, M. D. (2018). Programmatic Task Network Planning. In <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i> (pp. 31–39). Delft, Netherlands: AAAI.","short":"F. Mohr, T. Lettmann, E. Hüllermeier, M.D. Wever, in: Proceedings of the 1st ICAPS Workshop on Hierarchical Planning, AAAI, 2018, pp. 31–39.","chicago":"Mohr, Felix, Theodor Lettmann, Eyke Hüllermeier, and Marcel Dominik Wever. “Programmatic Task Network Planning.” In <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i>, 31–39. AAAI, 2018.","mla":"Mohr, Felix, et al. “Programmatic Task Network Planning.” <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i>, AAAI, 2018, pp. 31–39.","bibtex":"@inproceedings{Mohr_Lettmann_Hüllermeier_Wever_2018, title={Programmatic Task Network Planning}, booktitle={Proceedings of the 1st ICAPS Workshop on Hierarchical Planning}, publisher={AAAI}, author={Mohr, Felix and Lettmann, Theodor and Hüllermeier, Eyke and Wever, Marcel Dominik}, year={2018}, pages={31–39} }","ama":"Mohr F, Lettmann T, Hüllermeier E, Wever MD. Programmatic Task Network Planning. In: <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i>. AAAI; 2018:31-39."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"oa":"1"},{"date_created":"2018-04-23T11:40:20Z","file":[{"file_name":"08456422.pdf","access_level":"closed","file_size":356132,"relation":"main_file","date_updated":"2018-11-06T15:15:38Z","file_id":"5383","success":1,"content_type":"application/pdf","creator":"wever","date_created":"2018-11-06T15:15:38Z"}],"department":[{"_id":"355"}],"type":"conference","publication":"SCC","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://ieeexplore.ieee.org/abstract/document/8456422","open_access":"1"}],"doi":"10.1109/SCC.2018.00036","author":[{"full_name":"Mohr, Felix","first_name":"Felix","last_name":"Mohr"},{"first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","full_name":"Wever, Marcel Dominik","id":"33176"},{"full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke","id":"48129"}],"year":"2018","title":"On-The-Fly Service Construction with Prototypes","date_updated":"2022-01-06T06:56:32Z","place":"San Francisco, CA, USA","oa":"1","citation":{"mla":"Mohr, Felix, et al. “On-The-Fly Service Construction with Prototypes.” <i>SCC</i>, IEEE Computer Society, 2018, doi:<a href=\"https://doi.org/10.1109/SCC.2018.00036\">10.1109/SCC.2018.00036</a>.","bibtex":"@inproceedings{Mohr_Wever_Hüllermeier_2018, place={San Francisco, CA, USA}, title={On-The-Fly Service Construction with Prototypes}, DOI={<a href=\"https://doi.org/10.1109/SCC.2018.00036\">10.1109/SCC.2018.00036</a>}, booktitle={SCC}, publisher={IEEE Computer Society}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2018} }","ama":"Mohr F, Wever MD, Hüllermeier E. On-The-Fly Service Construction with Prototypes. In: <i>SCC</i>. San Francisco, CA, USA: IEEE Computer Society; 2018. doi:<a href=\"https://doi.org/10.1109/SCC.2018.00036\">10.1109/SCC.2018.00036</a>","ieee":"F. Mohr, M. D. Wever, and E. Hüllermeier, “On-The-Fly Service Construction with Prototypes,” in <i>SCC</i>, San Francisco, CA, USA, 2018.","apa":"Mohr, F., Wever, M. D., &#38; Hüllermeier, E. (2018). On-The-Fly Service Construction with Prototypes. In <i>SCC</i>. San Francisco, CA, USA: IEEE Computer Society. <a href=\"https://doi.org/10.1109/SCC.2018.00036\">https://doi.org/10.1109/SCC.2018.00036</a>","short":"F. Mohr, M.D. Wever, E. Hüllermeier, in: SCC, IEEE Computer Society, San Francisco, CA, USA, 2018.","chicago":"Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “On-The-Fly Service Construction with Prototypes.” In <i>SCC</i>. San Francisco, CA, USA: IEEE Computer Society, 2018. <a href=\"https://doi.org/10.1109/SCC.2018.00036\">https://doi.org/10.1109/SCC.2018.00036</a>."},"file_date_updated":"2018-11-06T15:15:38Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"publisher":"IEEE Computer Society","_id":"2471","ddc":["000"],"user_id":"49109","conference":{"name":"IEEE International Conference on Services Computing, SCC 2018","start_date":"2018-07-02","location":"San Francisco, CA, USA","end_date":"2018-07-07"},"status":"public","has_accepted_license":"1"},{"_id":"3320","language":[{"iso":"ger"}],"publisher":"Universität Paderborn","user_id":"477","title":"Korrektheitsbeweise für Muster von Servicekompositionen","year":"2018","status":"public","author":[{"full_name":"Rautenberg, Kai","last_name":"Rautenberg","first_name":"Kai"}],"date_updated":"2022-01-06T06:59:10Z","date_created":"2018-06-25T07:53:32Z","type":"bachelorsthesis","department":[{"_id":"7"},{"_id":"77"}],"supervisor":[{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike","id":"573"}],"citation":{"mla":"Rautenberg, Kai. <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn, 2018.","bibtex":"@book{Rautenberg_2018, title={Korrektheitsbeweise für Muster von Servicekompositionen}, publisher={Universität Paderborn}, author={Rautenberg, Kai}, year={2018} }","ama":"Rautenberg K. <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn; 2018.","ieee":"K. Rautenberg, <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn, 2018.","apa":"Rautenberg, K. (2018). <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn.","short":"K. Rautenberg, Korrektheitsbeweise für Muster von Servicekompositionen, Universität Paderborn, 2018.","chicago":"Rautenberg, Kai. <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn, 2018."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B3","_id":"11"}]},{"abstract":[{"lang":"eng","text":"Modern Boolean satisfiability solvers can emit proofs of unsatisfiability. There is substantial interest in being able to verify such proofs and also in using them for further computations. In this paper, we present an FPGA accelerator for checking resolution proofs, a popular proof format. Our accelerator exploits parallelism at the low level by implementing the basic resolution step in hardware, and at the high level by instantiating a number of parallel modules for proof checking. Since proof checking involves highly irregular memory accesses, we employ Hybrid Memory Cube technology for accelerator memory. The results show that while the accelerator is scalable and achieves speedups for all benchmark proofs, performance improvements are currently limited by the overhead of transitioning the proof into the accelerator memory."}],"publication":"ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications","department":[{"_id":"78"}],"type":"conference","date_created":"2018-06-27T09:30:24Z","file":[{"creator":"ups","date_created":"2018-11-02T13:55:07Z","file_name":"AnFPGAHMC-BasedAcceleratorForR.pdf","file_size":612367,"access_level":"closed","relation":"main_file","date_updated":"2018-11-02T13:55:07Z","file_id":"5257","success":1,"content_type":"application/pdf"}],"intvolume":"     10824","publication_status":"published","date_updated":"2022-01-06T06:59:13Z","author":[{"id":"49992","orcid":"0000-0003-1377-3339","first_name":"Tim","last_name":"Hansmeier","full_name":"Hansmeier, Tim"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"},{"last_name":"Andrews","first_name":"David","full_name":"Andrews, David"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319788890","9783319788906"]},"year":"2018","title":"An FPGA/HMC-Based Accelerator for Resolution Proof Checking","doi":"10.1007/978-3-319-78890-6_13","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"}],"citation":{"mla":"Hansmeier, Tim, et al. “An FPGA/HMC-Based Accelerator for Resolution Proof Checking.” <i>ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>, vol. 10824, Springer International Publishing, 2018, pp. 153–65, doi:<a href=\"https://doi.org/10.1007/978-3-319-78890-6_13\">10.1007/978-3-319-78890-6_13</a>.","ama":"Hansmeier T, Platzner M, Andrews D. An FPGA/HMC-Based Accelerator for Resolution Proof Checking. In: <i>ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>. Vol 10824. Lecture Notes in Computer Science. Springer International Publishing; 2018:153-165. doi:<a href=\"https://doi.org/10.1007/978-3-319-78890-6_13\">10.1007/978-3-319-78890-6_13</a>","bibtex":"@inproceedings{Hansmeier_Platzner_Andrews_2018, series={Lecture Notes in Computer Science}, title={An FPGA/HMC-Based Accelerator for Resolution Proof Checking}, volume={10824}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-78890-6_13\">10.1007/978-3-319-78890-6_13</a>}, booktitle={ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications}, publisher={Springer International Publishing}, author={Hansmeier, Tim and Platzner, Marco and Andrews, David}, year={2018}, pages={153–165}, collection={Lecture Notes in Computer Science} }","apa":"Hansmeier, T., Platzner, M., &#38; Andrews, D. (2018). An FPGA/HMC-Based Accelerator for Resolution Proof Checking. In <i>ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications</i> (Vol. 10824, pp. 153–165). Santorini, Greece: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-78890-6_13\">https://doi.org/10.1007/978-3-319-78890-6_13</a>","ieee":"T. Hansmeier, M. Platzner, and D. Andrews, “An FPGA/HMC-Based Accelerator for Resolution Proof Checking,” in <i>ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>, Santorini, Greece, 2018, vol. 10824, pp. 153–165.","chicago":"Hansmeier, Tim, Marco Platzner, and David Andrews. “An FPGA/HMC-Based Accelerator for Resolution Proof Checking.” In <i>ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>, 10824:153–65. Lecture Notes in Computer Science. Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-78890-6_13\">https://doi.org/10.1007/978-3-319-78890-6_13</a>.","short":"T. Hansmeier, M. Platzner, D. Andrews, in: ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications, Springer International Publishing, 2018, pp. 153–165."},"file_date_updated":"2018-11-02T13:55:07Z","has_accepted_license":"1","conference":{"location":"Santorini, Greece","name":"ARC: International Symposium on Applied Reconfigurable Computing","start_date":"2018-05-02","end_date":"2018-05-04"},"status":"public","volume":10824,"user_id":"3118","ddc":["000"],"publisher":"Springer International Publishing","_id":"3373","page":"153-165"},{"citation":{"chicago":"Melnikov, Vitalik, and Eyke Hüllermeier. “On the Effectiveness of Heuristics for Learning Nested Dichotomies: An Empirical Analysis.” <i>Machine Learning</i>, 2018. <a href=\"https://doi.org/10.1007/s10994-018-5733-1\">https://doi.org/10.1007/s10994-018-5733-1</a>.","short":"V. Melnikov, E. Hüllermeier, Machine Learning (2018).","apa":"Melnikov, V., &#38; Hüllermeier, E. (2018). On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis. <i>Machine Learning</i>. <a href=\"https://doi.org/10.1007/s10994-018-5733-1\">https://doi.org/10.1007/s10994-018-5733-1</a>","ieee":"V. Melnikov and E. Hüllermeier, “On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis,” <i>Machine Learning</i>, 2018.","ama":"Melnikov V, Hüllermeier E. On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis. <i>Machine Learning</i>. 2018. doi:<a href=\"https://doi.org/10.1007/s10994-018-5733-1\">10.1007/s10994-018-5733-1</a>","bibtex":"@article{Melnikov_Hüllermeier_2018, title={On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis}, DOI={<a href=\"https://doi.org/10.1007/s10994-018-5733-1\">10.1007/s10994-018-5733-1</a>}, journal={Machine Learning}, author={Melnikov, Vitalik and Hüllermeier, Eyke}, year={2018} }","mla":"Melnikov, Vitalik, and Eyke Hüllermeier. “On the Effectiveness of Heuristics for Learning Nested Dichotomies: An Empirical Analysis.” <i>Machine Learning</i>, 2018, doi:<a href=\"https://doi.org/10.1007/s10994-018-5733-1\">10.1007/s10994-018-5733-1</a>."},"file_date_updated":"2018-11-02T15:30:57Z","project":[{"name":"SFB 901 - Subproject B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"1","name":"SFB 901"}],"status":"public","has_accepted_license":"1","_id":"3402","user_id":"15504","ddc":["000"],"publication":"Machine Learning","abstract":[{"text":"In machine learning, so-called nested dichotomies are utilized as a reduction technique, i.e., to decompose a multi-class classification problem into a set of binary problems, which are solved using a simple binary classifier as a base learner. The performance of the (multi-class) classifier thus produced strongly depends on the structure of the decomposition. In this paper, we conduct an empirical study, in which we compare existing heuristics for selecting a suitable structure in the form of a nested dichotomy. Moreover, we propose two additional heuristics as natural completions. One of them is the Best-of-K heuristic, which picks the (presumably) best among K randomly generated nested dichotomies. Surprisingly, and in spite of its simplicity, it turns out to outperform the state of the art.","lang":"eng"}],"date_created":"2018-06-29T07:44:26Z","file":[{"access_level":"closed","file_size":1482882,"file_name":"OnTheEffectivenessOfHeuristics.pdf","date_updated":"2018-11-02T15:30:57Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"5305","creator":"ups","date_created":"2018-11-02T15:30:57Z"}],"department":[{"_id":"355"}],"type":"journal_article","publication_identifier":{"issn":["1573-0565"]},"author":[{"first_name":"Vitalik","last_name":"Melnikov","full_name":"Melnikov, Vitalik"},{"id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"}],"title":"On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis","year":"2018","date_updated":"2022-01-06T06:59:14Z","language":[{"iso":"eng"}],"doi":"10.1007/s10994-018-5733-1"},{"citation":{"ama":"Börding P, Haltermann JF, Jakobs M-C, Wehrheim H. JMCTest: Automatically Testing Inter-Method Contracts in Java. In: <i>Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)</i>. Vol 11146. Lecture Notes in Computer Science. Springer; 2018:39--55.","bibtex":"@inproceedings{Börding_Haltermann_Jakobs_Wehrheim_2018, series={Lecture Notes in Computer Science}, title={JMCTest: Automatically Testing Inter-Method Contracts in Java}, volume={11146}, booktitle={Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)}, publisher={Springer}, author={Börding, Paul and Haltermann, Jan Frederik and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2018}, pages={39--55}, collection={Lecture Notes in Computer Science} }","mla":"Börding, Paul, et al. “JMCTest: Automatically Testing Inter-Method Contracts in Java.” <i>Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)</i>, vol. 11146, Springer, 2018, pp. 39--55.","chicago":"Börding, Paul, Jan Frederik Haltermann, Marie-Christine Jakobs, and Heike Wehrheim. “JMCTest: Automatically Testing Inter-Method Contracts in Java.” In <i>Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)</i>, 11146:39--55. Lecture Notes in Computer Science. Springer, 2018.","short":"P. Börding, J.F. Haltermann, M.-C. Jakobs, H. Wehrheim, in: Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018), Springer, 2018, pp. 39--55.","apa":"Börding, P., Haltermann, J. F., Jakobs, M.-C., &#38; Wehrheim, H. (2018). JMCTest: Automatically Testing Inter-Method Contracts in Java. In <i>Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)</i> (Vol. 11146, pp. 39--55). Cádiz, Spain: Springer.","ieee":"P. Börding, J. F. Haltermann, M.-C. Jakobs, and H. Wehrheim, “JMCTest: Automatically Testing Inter-Method Contracts in Java,” in <i>Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)</i>, Cádiz, Spain, 2018, vol. 11146, pp. 39--55."},"file_date_updated":"2018-11-21T09:35:35Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"11","name":"SFB 901 - Subproject B3"}],"conference":{"location":"Cádiz, Spain","name":"IFIP International Conference on Testing Software and Systems","start_date":"2018-10-01","end_date":"2018-10-03"},"status":"public","has_accepted_license":"1","_id":"3414","publisher":"Springer","page":"39--55","volume":11146,"ddc":["006"],"user_id":"29719","publication":"Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)","abstract":[{"text":"Over the years, Design by Contract (DbC) has evolved as a\r\npowerful concept for program documentation, testing, and verification.\r\nContracts formally specify assertions on (mostly) object-oriented programs:\r\npre- and postconditions of methods, class invariants, allowed call\r\norders, etc. Missing in the long list of properties specifiable by contracts\r\nare, however, method correlations: DbC languages fall short on stating\r\nassertions relating methods.\r\nIn this paper, we propose the novel concept of inter-method contract,\r\nallowing precisely for expressing method correlations.We present JMC as\r\na language for specifying and JMCTest as a tool for dynamically checking\r\ninter-method contracts on Java programs. JMCTest fully automatically\r\ngenerates objects on which the contracted methods are called and\r\nthe validity of the contract is checked. Using JMCTest, we detected\r\nthat large Java code bases (e.g. JBoss, Java RT) frequently violate standard\r\ninter-method contracts. In comparison to other verification tools\r\ninspecting (some) inter-method contracts, JMCTest can find bugs that\r\nremain undetected by those tools.","lang":"eng"}],"date_created":"2018-07-02T09:06:56Z","file":[{"date_created":"2018-11-21T09:35:35Z","creator":"schlatt","file_id":"5770","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-11-21T09:35:35Z","file_name":"Börding2018_Chapter_JMCTestAutomaticallyTestingInt.pdf","access_level":"closed","file_size":574386}],"department":[{"_id":"7"},{"_id":"77"}],"type":"conference","author":[{"full_name":"Börding, Paul","first_name":"Paul","last_name":"Börding"},{"id":"44413","full_name":"Haltermann, Jan Frederik","last_name":"Haltermann","first_name":"Jan Frederik"},{"full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine","last_name":"Jakobs"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"year":"2018","title":"JMCTest: Automatically Testing Inter-Method Contracts in Java","intvolume":"     11146","date_updated":"2022-01-06T06:59:15Z","publication_status":"published","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}]},{"file":[{"creator":"ups","date_created":"2018-11-02T15:32:16Z","relation":"main_file","date_updated":"2018-11-02T15:32:16Z","file_name":"ML-PlanAutomatedMachineLearnin.pdf","file_size":1070937,"access_level":"closed","file_id":"5306","content_type":"application/pdf","success":1}],"date_created":"2018-07-08T14:06:14Z","keyword":["AutoML","Hierarchical Planning","HTN planning","ML-Plan"],"type":"journal_article","department":[{"_id":"355"},{"_id":"34"},{"_id":"7"},{"_id":"26"}],"publication":"Machine Learning","abstract":[{"lang":"eng","text":"Automated machine learning (AutoML) seeks to automatically select, compose, and parametrize machine learning algorithms, so as to achieve optimal performance on a given task (dataset). Although current approaches to AutoML have already produced impressive results, the field is still far from mature, and new techniques are still being developed. In this paper, we present ML-Plan, a new approach to AutoML based on hierarchical planning. To highlight the potential of this approach, we compare ML-Plan to the state-of-the-art frameworks Auto-WEKA, auto-sklearn, and TPOT. In an extensive series of experiments, we show that ML-Plan is highly competitive and often outperforms existing approaches."}],"main_file_link":[{"url":"https://rdcu.be/3Nc2","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1007/s10994-018-5735-z","title":"ML-Plan: Automated Machine Learning via Hierarchical Planning","year":"2018","publication_identifier":{"issn":["0885-6125"],"eissn":["1573-0565"]},"author":[{"first_name":"Felix","last_name":"Mohr","full_name":"Mohr, Felix"},{"id":"33176","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik","last_name":"Wever","full_name":"Wever, Marcel Dominik"},{"id":"48129","first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke"}],"publication_status":"epub_ahead","date_updated":"2022-01-06T06:59:21Z","article_type":"original","oa":"1","file_date_updated":"2018-11-02T15:32:16Z","citation":{"short":"F. Mohr, M.D. Wever, E. Hüllermeier, Machine Learning (2018) 1495–1515.","ama":"Mohr F, Wever MD, Hüllermeier E. ML-Plan: Automated Machine Learning via Hierarchical Planning. <i>Machine Learning</i>. Published online 2018:1495-1515. doi:<a href=\"https://doi.org/10.1007/s10994-018-5735-z\">10.1007/s10994-018-5735-z</a>","chicago":"Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “ML-Plan: Automated Machine Learning via Hierarchical Planning.” <i>Machine Learning</i>, 2018, 1495–1515. <a href=\"https://doi.org/10.1007/s10994-018-5735-z\">https://doi.org/10.1007/s10994-018-5735-z</a>.","bibtex":"@article{Mohr_Wever_Hüllermeier_2018, title={ML-Plan: Automated Machine Learning via Hierarchical Planning}, DOI={<a href=\"https://doi.org/10.1007/s10994-018-5735-z\">10.1007/s10994-018-5735-z</a>}, journal={Machine Learning}, publisher={Springer}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2018}, pages={1495–1515} }","mla":"Mohr, Felix, et al. “ML-Plan: Automated Machine Learning via Hierarchical Planning.” <i>Machine Learning</i>, Springer, 2018, pp. 1495–515, doi:<a href=\"https://doi.org/10.1007/s10994-018-5735-z\">10.1007/s10994-018-5735-z</a>.","apa":"Mohr, F., Wever, M. D., &#38; Hüllermeier, E. (2018). ML-Plan: Automated Machine Learning via Hierarchical Planning. <i>Machine Learning</i>, 1495–1515. <a href=\"https://doi.org/10.1007/s10994-018-5735-z\">https://doi.org/10.1007/s10994-018-5735-z</a>","ieee":"F. Mohr, M. D. Wever, and E. Hüllermeier, “ML-Plan: Automated Machine Learning via Hierarchical Planning,” <i>Machine Learning</i>, pp. 1495–1515, 2018, doi: <a href=\"https://doi.org/10.1007/s10994-018-5735-z\">10.1007/s10994-018-5735-z</a>."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"page":"1495-1515","publisher":"Springer","_id":"3510","user_id":"5786","ddc":["000"],"status":"public","conference":{"end_date":"2018-09-14","name":"European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases","start_date":"2018-09-10","location":"Dublin, Ireland"},"has_accepted_license":"1"},{"oa":"1","place":"‘s-Hertogenbosch, the Netherlands","project":[{"_id":"1","name":"SFB 901"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"3","name":"SFB 901 - Project Area B"}],"quality_controlled":"1","citation":{"mla":"Mohr, Felix, et al. “Reduction Stumps for Multi-Class Classification.” <i>Proceedings of the Symposium on Intelligent Data Analysis</i>, doi:<a href=\"https://doi.org/10.1007/978-3-030-01768-2_19\">10.1007/978-3-030-01768-2_19</a>.","bibtex":"@inproceedings{Mohr_Wever_Hüllermeier, place={‘s-Hertogenbosch, the Netherlands}, title={Reduction Stumps for Multi-Class Classification}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-01768-2_19\">10.1007/978-3-030-01768-2_19</a>}, booktitle={Proceedings of the Symposium on Intelligent Data Analysis}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke} }","ama":"Mohr F, Wever MD, Hüllermeier E. Reduction Stumps for Multi-Class Classification. In: <i>Proceedings of the Symposium on Intelligent Data Analysis</i>. ‘s-Hertogenbosch, the Netherlands. doi:<a href=\"https://doi.org/10.1007/978-3-030-01768-2_19\">10.1007/978-3-030-01768-2_19</a>","ieee":"F. Mohr, M. D. Wever, and E. Hüllermeier, “Reduction Stumps for Multi-Class Classification,” in <i>Proceedings of the Symposium on Intelligent Data Analysis</i>, ‘s-Hertogenbosch, the Netherlands.","apa":"Mohr, F., Wever, M. D., &#38; Hüllermeier, E. (n.d.). Reduction Stumps for Multi-Class Classification. In <i>Proceedings of the Symposium on Intelligent Data Analysis</i>. ‘s-Hertogenbosch, the Netherlands. <a href=\"https://doi.org/10.1007/978-3-030-01768-2_19\">https://doi.org/10.1007/978-3-030-01768-2_19</a>","short":"F. Mohr, M.D. Wever, E. Hüllermeier, in: Proceedings of the Symposium on Intelligent Data Analysis, ‘s-Hertogenbosch, the Netherlands, n.d.","chicago":"Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “Reduction Stumps for Multi-Class Classification.” In <i>Proceedings of the Symposium on Intelligent Data Analysis</i>. ‘s-Hertogenbosch, the Netherlands, n.d. <a href=\"https://doi.org/10.1007/978-3-030-01768-2_19\">https://doi.org/10.1007/978-3-030-01768-2_19</a>."},"file_date_updated":"2018-11-06T15:23:02Z","user_id":"49109","ddc":["000"],"_id":"3552","has_accepted_license":"1","conference":{"end_date":"2018-10-26","location":"‘s-Hertogenbosch, the Netherlands","name":"Symposium on Intelligent Data Analysis","start_date":"2018-10-24"},"status":"public","department":[{"_id":"355"}],"type":"conference","date_created":"2018-07-13T15:29:15Z","file":[{"creator":"wever","date_created":"2018-11-06T15:23:02Z","file_size":1348768,"access_level":"closed","file_name":"Mohr2018_Chapter_ReductionStumpsForMulti-classC.pdf","date_updated":"2018-11-06T15:23:02Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5385"}],"publication":"Proceedings of the Symposium on Intelligent Data Analysis","doi":"10.1007/978-3-030-01768-2_19","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://link.springer.com/chapter/10.1007%2F978-3-030-01768-2_19"}],"publication_status":"accepted","date_updated":"2022-01-06T06:59:25Z","author":[{"last_name":"Mohr","first_name":"Felix","full_name":"Mohr, Felix"},{"full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","id":"33176"},{"id":"48129","last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke"}],"title":"Reduction Stumps for Multi-Class Classification","year":"2018"},{"file":[{"success":1,"content_type":"application/pdf","file_id":"3587","date_updated":"2018-07-20T14:13:31Z","relation":"main_file","file_size":285348,"access_level":"closed","file_name":"WitschenWMAP2018.pdf","date_created":"2018-07-20T14:13:31Z","creator":"tobias82"}],"date_created":"2018-07-20T14:10:46Z","keyword":["Approximate Computing","Framework","Pareto Front","Accuracy"],"type":"preprint","department":[{"_id":"78"}],"publication":"Third Workshop on Approximate Computing (AxC 2018)","abstract":[{"text":"Existing approaches and tools for the generation of approximate circuits often lack generality and are restricted to certain circuit types, approximation techniques, and quality assurance methods. Moreover, only few tools are publicly available. This hinders the development and evaluation of new techniques for approximating circuits and their comparison to previous approaches. In this paper, we first analyze and classify related approaches and then present CIRCA, our flexible framework for search-based approximate circuit generation. CIRCA is developed with a focus on modularity and extensibility. We present the architecture of CIRCA with its clear separation into stages and functional blocks, report on the current prototype, and show initial experiments.","lang":"eng"}],"language":[{"iso":"eng"}],"title":"CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation","year":"2018","author":[{"last_name":"Witschen","first_name":"Linus Matthias","full_name":"Witschen, Linus Matthias","id":"49051"},{"id":"3118","full_name":"Wiersema, Tobias","last_name":"Wiersema","first_name":"Tobias"},{"id":"61186","first_name":"Hassan","last_name":"Ghasemzadeh Mohammadi","full_name":"Ghasemzadeh Mohammadi, Hassan"},{"full_name":"Awais, Muhammad","orcid":"https://orcid.org/0000-0003-4148-2969","first_name":"Muhammad","last_name":"Awais","id":"64665"},{"id":"398","first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco"}],"publication_status":"accepted","date_updated":"2022-01-06T06:59:26Z","file_date_updated":"2018-07-20T14:13:31Z","citation":{"bibtex":"@article{Witschen_Wiersema_Ghasemzadeh Mohammadi_Awais_Platzner, title={CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation}, journal={Third Workshop on Approximate Computing (AxC 2018)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Ghasemzadeh Mohammadi, Hassan and Awais, Muhammad and Platzner, Marco} }","ama":"Witschen LM, Wiersema T, Ghasemzadeh Mohammadi H, Awais M, Platzner M. CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation. <i>Third Workshop on Approximate Computing (AxC 2018)</i>.","mla":"Witschen, Linus Matthias, et al. “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation.” <i>Third Workshop on Approximate Computing (AxC 2018)</i>.","chicago":"Witschen, Linus Matthias, Tobias Wiersema, Hassan Ghasemzadeh Mohammadi, Muhammad Awais, and Marco Platzner. “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation.” <i>Third Workshop on Approximate Computing (AxC 2018)</i>, n.d.","short":"L.M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, M. Platzner, Third Workshop on Approximate Computing (AxC 2018) (n.d.).","ieee":"L. M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, and M. Platzner, “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation,” <i>Third Workshop on Approximate Computing (AxC 2018)</i>. .","apa":"Witschen, L. M., Wiersema, T., Ghasemzadeh Mohammadi, H., Awais, M., &#38; Platzner, M. (n.d.). CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation. <i>Third Workshop on Approximate Computing (AxC 2018)</i>."},"project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"page":"6","_id":"3586","user_id":"49051","ddc":["000"],"status":"public","has_accepted_license":"1"},{"date_updated":"2022-01-06T06:59:31Z","publication_status":"published","author":[{"last_name":"Ho","first_name":"Nam","full_name":"Ho, Nam"}],"year":"2018","title":"FPGA-based Reconfigurable Cache Mapping Schemes: Design and Optimization","status":"public","doi":"10.17619/UNIPB/1-376","user_id":"477","publisher":"Universität Paderborn","_id":"3720","language":[{"iso":"eng"}],"page":"139","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"abstract":[{"lang":"eng","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."},{"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.","lang":"ger"}],"supervisor":[{"full_name":"Kaufmann, Paul","first_name":"Paul","last_name":"Kaufmann"},{"full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco","id":"398"}],"citation":{"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} }","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>","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>.","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.","ieee":"N. Ho, <i>FPGA-based Reconfigurable Cache Mapping Schemes: Design and Optimization</i>. Universität Paderborn, 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>"},"department":[{"_id":"78"}],"type":"dissertation","date_created":"2018-07-27T06:41:13Z"},{"urn":"38527","_id":"3852","user_id":"49109","ddc":["006"],"conference":{"name":"ICML 2018 AutoML Workshop","start_date":"2018-07-10","location":"Stockholm, Sweden","end_date":"2018-07-15"},"status":"public","has_accepted_license":"1","oa":"1","citation":{"mla":"Wever, Marcel Dominik, et al. “ML-Plan for Unlimited-Length Machine Learning Pipelines.” <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} }","ama":"Wever MD, Mohr F, Hüllermeier E. ML-Plan for Unlimited-Length Machine Learning Pipelines. In: <i>ICML 2018 AutoML Workshop</i>. ; 2018.","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.","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.","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."},"file_date_updated":"2018-08-09T06:14:43Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"quality_controlled":"1","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://docs.google.com/viewer?a=v&pid=sites&srcid=ZGVmYXVsdGRvbWFpbnxhdXRvbWwyMDE4aWNtbHxneDo3M2Q3MjUzYjViNDRhZTAx"}],"author":[{"full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","id":"33176"},{"full_name":"Mohr, Felix","last_name":"Mohr","first_name":"Felix"},{"id":"48129","full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier"}],"title":"ML-Plan for Unlimited-Length Machine Learning Pipelines","year":"2018","date_updated":"2022-01-06T06:59:46Z","date_created":"2018-08-09T06:14:54Z","file":[{"creator":"wever","date_created":"2018-08-09T06:14:43Z","file_size":297811,"access_level":"open_access","file_name":"38.pdf","date_updated":"2018-08-09T06:14:43Z","relation":"main_file","content_type":"application/pdf","file_id":"3853"}],"department":[{"_id":"355"}],"type":"conference","keyword":["automated machine learning","complex pipelines","hierarchical planning"],"publication":"ICML 2018 AutoML Workshop","abstract":[{"lang":"eng","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."}]},{"language":[{"iso":"eng"}],"_id":"2711","user_id":"477","ddc":["000"],"year":"2018","title":"Do Android Taint Analysis Tools Keep their Promises?","status":"public","author":[{"id":"22398","last_name":"Pauck","first_name":"Felix","full_name":"Pauck, Felix"},{"id":"59256","last_name":"Bodden","orcid":"0000-0003-3470-3647","first_name":"Eric","full_name":"Bodden, Eric"},{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike","id":"573"}],"date_updated":"2022-01-06T06:57:35Z","has_accepted_license":"1","file":[{"date_created":"2018-11-21T10:49:23Z","creator":"florida","file_id":"5781","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-21T10:49:23Z","file_name":"Do Android Taint Analysis Tools Keep their Promises.pdf","access_level":"closed","file_size":1045861}],"date_created":"2018-05-09T08:27:11Z","type":"preprint","department":[{"_id":"77"},{"_id":"76"}],"file_date_updated":"2018-11-21T10:49:23Z","publication":"arXiv:1804.02903","citation":{"chicago":"Pauck, Felix, Eric Bodden, and Heike 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).","ieee":"F. Pauck, E. Bodden, and H. Wehrheim, “Do Android Taint Analysis Tools Keep their Promises?,” <i>arXiv:1804.02903</i>. 2018.","apa":"Pauck, F., Bodden, E., &#38; Wehrheim, H. (2018). Do Android Taint Analysis Tools Keep their Promises? <i>ArXiv:1804.02903</i>.","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} }","ama":"Pauck F, Bodden E, Wehrheim H. Do Android Taint Analysis Tools Keep their Promises? <i>arXiv:180402903</i>. 2018.","mla":"Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?” <i>ArXiv:1804.02903</i>, 2018."},"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":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"}]},{"department":[{"_id":"7"},{"_id":"34"},{"_id":"78"}],"type":"preprint","date_created":"2018-02-01T14:24:54Z","file":[{"relation":"main_file","date_updated":"2018-11-26T08:00:53Z","file_name":"WitschenWP2018[1].pdf","access_level":"closed","file_size":287224,"file_id":"5821","success":1,"content_type":"application/pdf","creator":"tobias82","date_created":"2018-11-26T08:00:53Z"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"citation":{"short":"L.M. Witschen, T. Wiersema, M. Platzner, 4th Workshop On Approximate Computing (WAPCO 2018) (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.","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>.","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."},"publication":"4th Workshop On Approximate Computing (WAPCO 2018)","file_date_updated":"2018-11-26T08:00:53Z","ddc":["000"],"user_id":"49051","language":[{"iso":"eng"}],"_id":"1165","has_accepted_license":"1","date_updated":"2022-01-06T06:51:06Z","author":[{"last_name":"Witschen","first_name":"Linus Matthias","full_name":"Witschen, Linus Matthias","id":"49051"},{"full_name":"Wiersema, Tobias","first_name":"Tobias","last_name":"Wiersema","id":"3118"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"status":"public","title":"Making the Case for Proof-carrying Approximate Circuits","year":"2018"},{"ddc":["000"],"user_id":"33176","publisher":"ACM","_id":"2109","has_accepted_license":"1","conference":{"end_date":"2018-07-19","name":"GECCO 2018","start_date":"2018-07-15","location":"Kyoto, Japan"},"status":"public","oa":"1","place":"Kyoto, Japan","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"citation":{"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>","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>.","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>.","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.","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>"},"file_date_updated":"2018-11-02T14:33:54Z","doi":"10.1145/3205455.3205562","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://dl.acm.org/citation.cfm?doid=3205455.3205562"}],"date_updated":"2022-01-06T06:54:45Z","publication_status":"published","author":[{"id":"33176","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik","last_name":"Wever","full_name":"Wever, Marcel Dominik"},{"full_name":"Mohr, Felix","first_name":"Felix","last_name":"Mohr"},{"id":"48129","first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke"}],"title":"Ensembles of Evolved Nested Dichotomies for Classification","year":"2018","department":[{"_id":"355"}],"type":"conference","keyword":["Classification","Hierarchical Decomposition","Indirect Encoding"],"date_created":"2018-03-31T13:51:23Z","file":[{"date_updated":"2018-11-02T14:33:54Z","relation":"main_file","access_level":"closed","file_size":875404,"file_name":"p561-wever.pdf","content_type":"application/pdf","success":1,"file_id":"5275","creator":"ups","date_created":"2018-11-02T14:33:54Z"}],"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"},{"main_file_link":[{"url":"https://arxiv.org/pdf/1811.04060.pdf","open_access":"1"}],"_id":"17713","publisher":"Arxiv","language":[{"iso":"eng"}],"user_id":"5786","title":"Automated Multi-Label Classification based on ML-Plan","year":"2018","status":"public","author":[{"orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik","last_name":"Wever","full_name":"Wever, Marcel Dominik","id":"33176"},{"full_name":"Mohr, Felix","last_name":"Mohr","first_name":"Felix"},{"full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke","id":"48129"}],"date_updated":"2022-01-06T06:53:17Z","date_created":"2020-08-07T11:38:10Z","type":"preprint","oa":"1","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"citation":{"mla":"Wever, Marcel Dominik, et al. <i>Automated Multi-Label Classification Based on ML-Plan</i>. Arxiv, 2018.","ama":"Wever MD, Mohr F, Hüllermeier E. Automated Multi-Label Classification based on ML-Plan. Published online 2018.","bibtex":"@article{Wever_Mohr_Hüllermeier_2018, title={Automated Multi-Label Classification based on ML-Plan}, publisher={Arxiv}, author={Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2018} }","apa":"Wever, M. D., Mohr, F., &#38; Hüllermeier, E. (2018). <i>Automated Multi-Label Classification based on ML-Plan</i>. Arxiv.","ieee":"M. D. Wever, F. Mohr, and E. Hüllermeier, “Automated Multi-Label Classification based on ML-Plan.” Arxiv, 2018.","short":"M.D. Wever, F. Mohr, E. Hüllermeier, (2018).","chicago":"Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “Automated Multi-Label Classification Based on ML-Plan.” Arxiv, 2018."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}]},{"user_id":"5786","language":[{"iso":"eng"}],"_id":"17714","main_file_link":[{"open_access":"1","url":"https://arxiv.org/pdf/1809.00486.pdf"}],"date_updated":"2022-01-06T06:53:17Z","author":[{"full_name":"Mohr, Felix","first_name":"Felix","last_name":"Mohr"},{"last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik","full_name":"Wever, Marcel Dominik","id":"33176"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier","id":"48129"}],"title":"Automated machine learning service composition","status":"public","year":"2018","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"oa":"1","type":"preprint","date_created":"2020-08-07T11:40:13Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"citation":{"mla":"Mohr, Felix, et al. <i>Automated Machine Learning Service Composition</i>. 2018.","bibtex":"@article{Mohr_Wever_Hüllermeier_2018, title={Automated machine learning service composition}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2018} }","ama":"Mohr F, Wever MD, Hüllermeier E. Automated machine learning service composition. Published online 2018.","ieee":"F. Mohr, M. D. Wever, and E. Hüllermeier, “Automated machine learning service composition.” 2018.","apa":"Mohr, F., Wever, M. D., &#38; Hüllermeier, E. (2018). <i>Automated machine learning service composition</i>.","short":"F. Mohr, M.D. Wever, E. Hüllermeier, (2018).","chicago":"Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “Automated Machine Learning Service Composition,” 2018."}},{"doi":"10.1007/978-3-319-91947-8_53","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"intvolume":"     10859","date_updated":"2022-01-06T06:55:47Z","publication_status":"published","publication_identifier":{"isbn":["978-3-319-91946-1"]},"author":[{"first_name":"Frederik Simon","last_name":"Bäumer","full_name":"Bäumer, Frederik Simon","id":"38837"},{"full_name":"Geierhos, Michaela","last_name":"Geierhos","orcid":"0000-0002-8180-5606","first_name":"Michaela","id":"42496"}],"title":"How to Deal with Inaccurate Service Descriptions in On-The-Fly Computing: Open Challenges","year":"2018","department":[{"_id":"36"},{"_id":"1"},{"_id":"579"}],"type":"book_chapter","keyword":["Requirements Extraction","Temporal Reordering of Software Functions","Inaccuracy Compensation"],"date_created":"2018-04-13T08:54:56Z","file":[{"date_created":"2018-11-02T16:12:26Z","creator":"ups","content_type":"application/pdf","success":1,"file_id":"5326","date_updated":"2018-11-02T16:12:26Z","relation":"main_file","file_size":327508,"access_level":"closed","file_name":"Bäumer-Geierhos2018_Chapter_HowToDealWithInaccurateService.pdf"}],"abstract":[{"text":"The vision of On-The-Fly Computing is an automatic composition\r\nof existing software services. Based on natural language software\r\ndescriptions, end users will receive compositions tailored to their needs.\r\nFor this reason, the quality of the initial software service description\r\nstrongly determines whether a software composition really meets the expectations\r\nof end users. In this paper, we expose open NLP challenges\r\nneeded to be faced for service composition in On-The-Fly Computing.","lang":"eng"}],"publication":"Proceedings of the 23rd International Conference on Natural Language and Information Systems","editor":[{"full_name":"Silberztein, Max ","first_name":"Max ","last_name":"Silberztein"},{"full_name":"Atigui, Faten ","first_name":"Faten ","last_name":"Atigui"},{"full_name":"Kornyshova, Elena ","first_name":"Elena ","last_name":"Kornyshova"},{"first_name":"Elisabeth ","last_name":"Métais","full_name":"Métais, Elisabeth "},{"full_name":"Meziane, Farid ","first_name":"Farid ","last_name":"Meziane"}],"volume":10859,"ddc":["000"],"user_id":"477","_id":"2322","publisher":"Springer","page":"509-513","has_accepted_license":"1","conference":{"name":"23rd International Conference on Natural Language and Information Systems","start_date":"2018-06-13","location":"Paris, France","end_date":"2018-06-18"},"status":"public","place":"Cham, Switzerland","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B1","_id":"9"}],"quality_controlled":"1","citation":{"bibtex":"@inbook{Bäumer_Geierhos_2018, place={Cham, Switzerland}, series={Lecture Notes in Computer Science}, title={How to Deal with Inaccurate Service Descriptions in On-The-Fly Computing: Open Challenges}, volume={10859}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-91947-8_53\">10.1007/978-3-319-91947-8_53</a>}, booktitle={Proceedings of the 23rd International Conference on Natural Language and Information Systems}, publisher={Springer}, author={Bäumer, Frederik Simon and Geierhos, Michaela}, editor={Silberztein, Max  and Atigui, Faten  and Kornyshova, Elena  and Métais, Elisabeth  and Meziane, Farid Editors}, year={2018}, pages={509–513}, collection={Lecture Notes in Computer Science} }","ama":"Bäumer FS, Geierhos M. How to Deal with Inaccurate Service Descriptions in On-The-Fly Computing: Open Challenges. In: Silberztein M, Atigui F, Kornyshova E, Métais E, Meziane F, eds. <i>Proceedings of the 23rd International Conference on Natural Language and Information Systems</i>. Vol 10859. Lecture Notes in Computer Science. Cham, Switzerland: Springer; 2018:509-513. doi:<a href=\"https://doi.org/10.1007/978-3-319-91947-8_53\">10.1007/978-3-319-91947-8_53</a>","mla":"Bäumer, Frederik Simon, and Michaela Geierhos. “How to Deal with Inaccurate Service Descriptions in On-The-Fly Computing: Open Challenges.” <i>Proceedings of the 23rd International Conference on Natural Language and Information Systems</i>, edited by Max  Silberztein et al., vol. 10859, Springer, 2018, pp. 509–13, doi:<a href=\"https://doi.org/10.1007/978-3-319-91947-8_53\">10.1007/978-3-319-91947-8_53</a>.","short":"F.S. Bäumer, M. Geierhos, in: M. Silberztein, F. Atigui, E. Kornyshova, E. Métais, F. Meziane (Eds.), Proceedings of the 23rd International Conference on Natural Language and Information Systems, Springer, Cham, Switzerland, 2018, pp. 509–513.","chicago":"Bäumer, Frederik Simon, and Michaela Geierhos. “How to Deal with Inaccurate Service Descriptions in On-The-Fly Computing: Open Challenges.” In <i>Proceedings of the 23rd International Conference on Natural Language and Information Systems</i>, edited by Max  Silberztein, Faten  Atigui, Elena  Kornyshova, Elisabeth  Métais, and Farid  Meziane, 10859:509–13. Lecture Notes in Computer Science. Cham, Switzerland: Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-91947-8_53\">https://doi.org/10.1007/978-3-319-91947-8_53</a>.","ieee":"F. S. Bäumer and M. Geierhos, “How to Deal with Inaccurate Service Descriptions in On-The-Fly Computing: Open Challenges,” in <i>Proceedings of the 23rd International Conference on Natural Language and Information Systems</i>, vol. 10859, M. Silberztein, F. Atigui, E. Kornyshova, E. Métais, and F. Meziane, Eds. Cham, Switzerland: Springer, 2018, pp. 509–513.","apa":"Bäumer, F. S., &#38; Geierhos, M. (2018). How to Deal with Inaccurate Service Descriptions in On-The-Fly Computing: Open Challenges. In M. Silberztein, F. Atigui, E. Kornyshova, E. Métais, &#38; F. Meziane (Eds.), <i>Proceedings of the 23rd International Conference on Natural Language and Information Systems</i> (Vol. 10859, pp. 509–513). Cham, Switzerland: Springer. <a href=\"https://doi.org/10.1007/978-3-319-91947-8_53\">https://doi.org/10.1007/978-3-319-91947-8_53</a>"},"file_date_updated":"2018-11-02T16:12:26Z"}]