[{"place":"Cham","file_date_updated":"2018-06-26T13:58:28Z","citation":{"mla":"Lösch, Achim, et al. “Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes.” <i>Proceedings of the International Conference on Architecture of Computing Systems (ARCS)</i>, vol. 10793, Springer International Publishing, 2018, pp. 73–84, doi:<a href=\"https://doi.org/10.1007/978-3-319-77610-1_6\">10.1007/978-3-319-77610-1_6</a>.","ama":"Lösch A, Wiens A, Platzner M. Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes. In: <i>Proceedings of the International Conference on Architecture of Computing Systems (ARCS)</i>. Vol 10793. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2018:73-84. doi:<a href=\"https://doi.org/10.1007/978-3-319-77610-1_6\">10.1007/978-3-319-77610-1_6</a>","bibtex":"@inproceedings{Lösch_Wiens_Platzner_2018, place={Cham}, series={Lecture Notes in Computer Science}, title={Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes}, volume={10793}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-77610-1_6\">10.1007/978-3-319-77610-1_6</a>}, booktitle={Proceedings of the International Conference on Architecture of Computing Systems (ARCS)}, publisher={Springer International Publishing}, author={Lösch, Achim and Wiens, Alex and Platzner, Marco}, year={2018}, pages={73–84}, collection={Lecture Notes in Computer Science} }","apa":"Lösch, A., Wiens, A., &#38; Platzner, M. (2018). Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes. In <i>Proceedings of the International Conference on Architecture of Computing Systems (ARCS)</i> (Vol. 10793, pp. 73–84). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-77610-1_6\">https://doi.org/10.1007/978-3-319-77610-1_6</a>","ieee":"A. Lösch, A. Wiens, and M. Platzner, “Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes,” in <i>Proceedings of the International Conference on Architecture of Computing Systems (ARCS)</i>, 2018, vol. 10793, pp. 73–84.","chicago":"Lösch, Achim, Alex Wiens, and Marco Platzner. “Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes.” In <i>Proceedings of the International Conference on Architecture of Computing Systems (ARCS)</i>, 10793:73–84. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-77610-1_6\">https://doi.org/10.1007/978-3-319-77610-1_6</a>.","short":"A. Lösch, A. Wiens, M. Platzner, in: Proceedings of the International Conference on Architecture of Computing Systems (ARCS), Springer International Publishing, Cham, 2018, pp. 73–84."},"project":[{"name":"SFB 901 - Subproject C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"1","name":"SFB 901"}],"page":"73-84","_id":"3362","publisher":"Springer International Publishing","user_id":"477","ddc":["040"],"volume":10793,"status":"public","has_accepted_license":"1","file":[{"file_name":"loesch2017_arcs.pdf","access_level":"closed","file_size":1114026,"relation":"main_file","date_updated":"2018-06-26T13:58:28Z","file_id":"3363","success":1,"content_type":"application/pdf","creator":"aloesch","date_created":"2018-06-26T13:58:28Z"}],"date_created":"2018-06-26T13:47:52Z","type":"conference","department":[{"_id":"78"}],"publication":"Proceedings of the International Conference on Architecture of Computing Systems (ARCS)","abstract":[{"text":"Profiling applications on a heterogeneous compute node is challenging since the way to retrieve data from the resources and interpret them varies between resource types and manufacturers. This holds especially true for measuring the energy consumption. In this paper we present Ampehre, a novel open source measurement framework that allows developers to gather comparable measurements from heterogeneous compute nodes, e.g., nodes comprising CPU, GPU, and FPGA. We explain the architecture of Ampehre and detail the measurement process on the example of energy measurements on CPU and GPU. To characterize the probing effect, we quantitatively analyze the trade-off between the accuracy of measurements and the CPU load imposed by Ampehre. Based on this analysis, we are able to specify reasonable combinations of sampling periods for the different resource types of a compute node.","lang":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-319-77610-1_6","title":"Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes","year":"2018","publication_identifier":{"isbn":["9783319776095","9783319776101"],"issn":["0302-9743","1611-3349"]},"author":[{"last_name":"Lösch","first_name":"Achim","full_name":"Lösch, Achim","id":"43646"},{"first_name":"Alex","last_name":"Wiens","full_name":"Wiens, Alex"},{"id":"398","last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"}],"publication_status":"published","date_updated":"2022-01-06T06:59:13Z","intvolume":"     10793"},{"user_id":"477","_id":"3365","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:13Z","author":[{"full_name":"Schnuer, Jan-Philip","first_name":"Jan-Philip","last_name":"Schnuer"}],"title":"Static Scheduling Algorithms for Heterogeneous Compute Nodes","status":"public","year":"2018","department":[{"_id":"78"}],"type":"bachelorsthesis","date_created":"2018-06-26T14:10:18Z","project":[{"name":"SFB 901 - Subproject C2","_id":"14"},{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"bibtex":"@book{Schnuer_2018, title={Static Scheduling Algorithms for Heterogeneous Compute Nodes}, publisher={Universität Paderborn}, author={Schnuer, Jan-Philip}, year={2018} }","ama":"Schnuer J-P. <i>Static Scheduling Algorithms for Heterogeneous Compute Nodes</i>. Universität Paderborn; 2018.","mla":"Schnuer, Jan-Philip. <i>Static Scheduling Algorithms for Heterogeneous Compute Nodes</i>. Universität Paderborn, 2018.","short":"J.-P. Schnuer, Static Scheduling Algorithms for Heterogeneous Compute Nodes, Universität Paderborn, 2018.","chicago":"Schnuer, Jan-Philip. <i>Static Scheduling Algorithms for Heterogeneous Compute Nodes</i>. Universität Paderborn, 2018.","ieee":"J.-P. Schnuer, <i>Static Scheduling Algorithms for Heterogeneous Compute Nodes</i>. Universität Paderborn, 2018.","apa":"Schnuer, J.-P. (2018). <i>Static Scheduling Algorithms for Heterogeneous Compute Nodes</i>. Universität Paderborn."},"supervisor":[{"first_name":"Achim","last_name":"Lösch","full_name":"Lösch, Achim","id":"43646"},{"id":"398","first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco"}]},{"language":[{"iso":"eng"}],"_id":"3366","publisher":"Universität Paderborn","user_id":"477","author":[{"last_name":"Croce","first_name":"Marcel","full_name":"Croce, Marcel"}],"title":"Evaluation of OpenCL-based Compilation for FPGAs","status":"public","year":"2018","date_updated":"2022-01-06T06:59:13Z","date_created":"2018-06-26T14:12:00Z","department":[{"_id":"78"}],"type":"bachelorsthesis","supervisor":[{"id":"43646","last_name":"Lösch","first_name":"Achim","full_name":"Lösch, Achim"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"citation":{"ieee":"M. Croce, <i>Evaluation of OpenCL-based Compilation for FPGAs</i>. Universität Paderborn, 2018.","apa":"Croce, M. (2018). <i>Evaluation of OpenCL-based Compilation for FPGAs</i>. Universität Paderborn.","short":"M. Croce, Evaluation of OpenCL-Based Compilation for FPGAs, Universität Paderborn, 2018.","chicago":"Croce, Marcel. <i>Evaluation of OpenCL-Based Compilation for FPGAs</i>. Universität Paderborn, 2018.","mla":"Croce, Marcel. <i>Evaluation of OpenCL-Based Compilation for FPGAs</i>. Universität Paderborn, 2018.","bibtex":"@book{Croce_2018, title={Evaluation of OpenCL-based Compilation for FPGAs}, publisher={Universität Paderborn}, author={Croce, Marcel}, year={2018} }","ama":"Croce M. <i>Evaluation of OpenCL-Based Compilation for FPGAs</i>. Universität Paderborn; 2018."},"project":[{"_id":"14","name":"SFB 901 - Subproject C2"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"}]},{"abstract":[{"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.","lang":"eng"}],"publication":"ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications","department":[{"_id":"78"}],"type":"conference","date_created":"2018-06-27T09:30:24Z","file":[{"file_id":"5257","success":1,"content_type":"application/pdf","file_name":"AnFPGAHMC-BasedAcceleratorForR.pdf","file_size":612367,"access_level":"closed","relation":"main_file","date_updated":"2018-11-02T13:55:07Z","date_created":"2018-11-02T13:55:07Z","creator":"ups"}],"intvolume":"     10824","date_updated":"2022-01-06T06:59:13Z","publication_status":"published","author":[{"orcid":"0000-0003-1377-3339","first_name":"Tim","last_name":"Hansmeier","full_name":"Hansmeier, Tim","id":"49992"},{"id":"398","last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"},{"full_name":"Andrews, David","last_name":"Andrews","first_name":"David"}],"publication_identifier":{"isbn":["9783319788890","9783319788906"],"issn":["0302-9743","1611-3349"]},"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":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"}],"citation":{"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.","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} }"},"file_date_updated":"2018-11-02T13:55:07Z","has_accepted_license":"1","conference":{"end_date":"2018-05-04","location":"Santorini, Greece","start_date":"2018-05-02","name":"ARC: International Symposium on Applied Reconfigurable Computing"},"status":"public","volume":10824,"ddc":["000"],"user_id":"3118","_id":"3373","publisher":"Springer International Publishing","page":"153-165"},{"year":"2018","title":"On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis","author":[{"full_name":"Melnikov, Vitalik","last_name":"Melnikov","first_name":"Vitalik"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"}],"publication_identifier":{"issn":["1573-0565"]},"date_updated":"2022-01-06T06:59:14Z","language":[{"iso":"eng"}],"doi":"10.1007/s10994-018-5733-1","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"}],"file":[{"date_created":"2018-11-02T15:30:57Z","creator":"ups","file_id":"5305","success":1,"content_type":"application/pdf","file_name":"OnTheEffectivenessOfHeuristics.pdf","file_size":1482882,"access_level":"closed","relation":"main_file","date_updated":"2018-11-02T15:30:57Z"}],"date_created":"2018-06-29T07:44:26Z","type":"journal_article","department":[{"_id":"355"}],"status":"public","has_accepted_license":"1","_id":"3402","user_id":"15504","ddc":["000"],"file_date_updated":"2018-11-02T15:30:57Z","citation":{"ieee":"V. Melnikov and E. Hüllermeier, “On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis,” <i>Machine Learning</i>, 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>","short":"V. Melnikov, E. Hüllermeier, Machine Learning (2018).","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>.","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>.","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} }","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>"},"project":[{"_id":"11","name":"SFB 901 - Subproject B3"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"1","name":"SFB 901"}]},{"has_accepted_license":"1","status":"public","conference":{"end_date":"2018-10-03","location":"Cádiz, Spain","start_date":"2018-10-01","name":"IFIP International Conference on Testing Software and Systems"},"user_id":"29719","ddc":["006"],"volume":11146,"page":"39--55","publisher":"Springer","_id":"3414","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"file_date_updated":"2018-11-21T09:35:35Z","citation":{"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.","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.","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.","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} }","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.","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."},"publication_status":"published","date_updated":"2022-01-06T06:59:15Z","intvolume":"     11146","title":"JMCTest: Automatically Testing Inter-Method Contracts in Java","year":"2018","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"},{"last_name":"Jakobs","first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","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"}],"publication":"Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)","type":"conference","department":[{"_id":"7"},{"_id":"77"}],"file":[{"file_id":"5770","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-21T09:35:35Z","file_name":"Börding2018_Chapter_JMCTestAutomaticallyTestingInt.pdf","access_level":"closed","file_size":574386,"date_created":"2018-11-21T09:35:35Z","creator":"schlatt"}],"date_created":"2018-07-02T09:06:56Z"},{"language":[{"iso":"eng"}],"doi":"10.1145/3210377.3210399","title":"Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary","year":"2018","author":[{"first_name":"Peter","last_name":"Robinson","full_name":"Robinson, Peter"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Setzer","first_name":"Alexander","full_name":"Setzer, Alexander","id":"11108"}],"publication_identifier":{"isbn":["978-1-4503-5799-9/18/07"]},"publication_status":"accepted","date_updated":"2022-01-06T06:59:16Z","file":[{"creator":"asetzer","date_created":"2018-10-31T13:30:40Z","relation":"main_file","date_updated":"2018-10-31T13:30:40Z","file_name":"p173-robinson.pdf","file_size":1675407,"access_level":"closed","file_id":"5215","success":1,"content_type":"application/pdf"}],"date_created":"2018-07-04T08:55:45Z","type":"conference","keyword":["distributed consensus","randomized algorithm","adaptive adversary","complexity lower bound"],"department":[{"_id":"79"},{"_id":"34"},{"_id":"7"}],"publication":"Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","abstract":[{"lang":"eng","text":"We study the consensus problem in a synchronous distributed system of n nodes under an adaptive adversary that has a slightly outdated view of the system and can block all incoming and outgoing communication of a constant fraction of the nodes in each round. Motivated by a result of Ben-Or and Bar-Joseph (1998), showing that any consensus algorithm that is resilient against a linear number of crash faults requires $\\tilde \\Omega(\\sqrt n)$ rounds in an n-node network against an adaptive adversary, we consider a late adaptive adversary, who has full knowledge of the network state at the beginning of the previous round and unlimited computational power, but is oblivious to the current state of the nodes. \r\n\r\nOur main contributions are randomized distributed algorithms that achieve consensus with high probability among all except a small constant fraction of the nodes (i.e., \"almost-everywhere'') against a late adaptive adversary who can block up to ε n$ nodes in each round, for a small constant ε >0$. Our first protocol achieves binary almost-everywhere consensus and also guarantees a decision on the majority input value, thus ensuring plurality consensus. We also present an algorithm that achieves the same time complexity for multi-value consensus. Both of our algorithms succeed in $O(log n)$ rounds with high probability, thus showing an exponential gap to the $\\tilde\\Omega(\\sqrt n)$ lower bound of Ben-Or and Bar-Joseph for strongly adaptive crash-failure adversaries, which can be strengthened to $\\Omega(n)$ when allowing the adversary to block nodes instead of permanently crashing them. Our algorithms are scalable to large systems as each node contacts only an (amortized) constant number of peers in each communication round. We show that our algorithms are optimal up to constant (resp.\\ sub-logarithmic) factors by proving that every almost-everywhere consensus protocol takes $\\Omega(log_d n)$ rounds in the worst case, where d is an upper bound on the number of communication requests initiated per node in each round. We complement our theoretical results with an experimental evaluation of the binary almost-everywhere consensus protocol revealing a short convergence time even against an adversary blocking a large fraction of nodes."}],"_id":"3422","user_id":"11108","ddc":["040"],"status":"public","conference":{"location":"Wien","start_date":"2018-07-16","name":"30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","end_date":"2018-07-18"},"has_accepted_license":"1","file_date_updated":"2018-10-31T13:30:40Z","citation":{"mla":"Robinson, Peter, et al. “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.” <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, doi:<a href=\"https://doi.org/10.1145/3210377.3210399\">10.1145/3210377.3210399</a>.","bibtex":"@inproceedings{Robinson_Scheideler_Setzer, title={Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary}, DOI={<a href=\"https://doi.org/10.1145/3210377.3210399\">10.1145/3210377.3210399</a>}, booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Robinson, Peter and Scheideler, Christian and Setzer, Alexander} }","ama":"Robinson P, Scheideler C, Setzer A. Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. In: <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. doi:<a href=\"https://doi.org/10.1145/3210377.3210399\">10.1145/3210377.3210399</a>","ieee":"P. Robinson, C. Scheideler, and A. Setzer, “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary,” in <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, Wien.","apa":"Robinson, P., Scheideler, C., &#38; Setzer, A. (n.d.). Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. In <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. Wien. <a href=\"https://doi.org/10.1145/3210377.3210399\">https://doi.org/10.1145/3210377.3210399</a>","chicago":"Robinson, Peter, Christian Scheideler, and Alexander Setzer. “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.” In <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, n.d. <a href=\"https://doi.org/10.1145/3210377.3210399\">https://doi.org/10.1145/3210377.3210399</a>.","short":"P. Robinson, C. Scheideler, A. Setzer, in: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), n.d."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}]},{"page":"1495-1515","_id":"3510","publisher":"Springer","user_id":"5786","ddc":["000"],"status":"public","conference":{"end_date":"2018-09-14","location":"Dublin, Ireland","name":"European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases","start_date":"2018-09-10"},"has_accepted_license":"1","oa":"1","file_date_updated":"2018-11-02T15:32:16Z","citation":{"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} }","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>","short":"F. Mohr, M.D. Wever, E. Hüllermeier, Machine Learning (2018) 1495–1515.","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>.","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>.","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>","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>."},"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"}],"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":{"eissn":["1573-0565"],"issn":["0885-6125"]},"author":[{"first_name":"Felix","last_name":"Mohr","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"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier","id":"48129"}],"publication_status":"epub_ahead","date_updated":"2022-01-06T06:59:21Z","article_type":"original","file":[{"date_created":"2018-11-02T15:32:16Z","creator":"ups","file_id":"5306","success":1,"content_type":"application/pdf","file_name":"ML-PlanAutomatedMachineLearnin.pdf","access_level":"closed","file_size":1070937,"relation":"main_file","date_updated":"2018-11-02T15:32:16Z"}],"date_created":"2018-07-08T14:06:14Z","type":"journal_article","keyword":["AutoML","Hierarchical Planning","HTN planning","ML-Plan"],"department":[{"_id":"355"},{"_id":"34"},{"_id":"7"},{"_id":"26"}],"publication":"Machine Learning","abstract":[{"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.","lang":"eng"}]},{"date_updated":"2022-01-06T06:59:22Z","publication_status":"published","status":"public","year":"2018","title":"FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity","publication_identifier":{"isbn":["9783319929699","9783319929705"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Schellhorn, Gerhard","last_name":"Schellhorn","first_name":"Gerhard"},{"full_name":"Wedel, Monika","last_name":"Wedel","first_name":"Monika"},{"last_name":"Travkin","first_name":"Oleg","full_name":"Travkin, Oleg"},{"full_name":"König, Jürgen","last_name":"König","first_name":"Jürgen","id":"22358"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"doi":"10.1007/978-3-319-92970-5_7","user_id":"29719","page":"105-120","_id":"3536","publisher":"Springer International Publishing","project":[{"_id":"78","name":"Validation of Software Transactional Memory"}],"publication":"Software Engineering and Formal Methods","citation":{"chicago":"Schellhorn, Gerhard, Monika Wedel, Oleg Travkin, Jürgen König, and Heike Wehrheim. “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity.” In <i>Software Engineering and Formal Methods</i>, 105–20. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-92970-5_7\">https://doi.org/10.1007/978-3-319-92970-5_7</a>.","short":"G. Schellhorn, M. Wedel, O. Travkin, J. König, H. Wehrheim, in: Software Engineering and Formal Methods, Springer International Publishing, Cham, 2018, pp. 105–120.","apa":"Schellhorn, G., Wedel, M., Travkin, O., König, J., &#38; Wehrheim, H. (2018). FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity. In <i>Software Engineering and Formal Methods</i> (pp. 105–120). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-92970-5_7\">https://doi.org/10.1007/978-3-319-92970-5_7</a>","ieee":"G. Schellhorn, M. Wedel, O. Travkin, J. König, and H. Wehrheim, “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity,” in <i>Software Engineering and Formal Methods</i>, Cham: Springer International Publishing, 2018, pp. 105–120.","ama":"Schellhorn G, Wedel M, Travkin O, König J, Wehrheim H. FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity. In: <i>Software Engineering and Formal Methods</i>. Cham: Springer International Publishing; 2018:105-120. doi:<a href=\"https://doi.org/10.1007/978-3-319-92970-5_7\">10.1007/978-3-319-92970-5_7</a>","bibtex":"@inbook{Schellhorn_Wedel_Travkin_König_Wehrheim_2018, place={Cham}, title={FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-92970-5_7\">10.1007/978-3-319-92970-5_7</a>}, booktitle={Software Engineering and Formal Methods}, publisher={Springer International Publishing}, author={Schellhorn, Gerhard and Wedel, Monika and Travkin, Oleg and König, Jürgen and Wehrheim, Heike}, year={2018}, pages={105–120} }","mla":"Schellhorn, Gerhard, et al. “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity.” <i>Software Engineering and Formal Methods</i>, Springer International Publishing, 2018, pp. 105–20, doi:<a href=\"https://doi.org/10.1007/978-3-319-92970-5_7\">10.1007/978-3-319-92970-5_7</a>."},"type":"book_chapter","department":[{"_id":"77"}],"place":"Cham","date_created":"2018-07-11T06:19:58Z"},{"place":"Wien, Austria","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"file_date_updated":"2018-11-12T19:01:06Z","citation":{"ieee":"B. Jazayeri, O. Zimmermann, G. Engels, J. Küster, D. Kundisch, and D. Szopinski, “Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions,” in <i>Proceeding of International Symposium on Business Modeling and Software Design</i>, 2018, vol. 319, pp. 390–400.","apa":"Jazayeri, B., Zimmermann, O., Engels, G., Küster, J., Kundisch, D., &#38; Szopinski, D. (2018). Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions. In <i>Proceeding of International Symposium on Business Modeling and Software Design</i> (Vol. 319, pp. 390–400). Wien, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-319-94214-8_30\">https://doi.org/10.1007/978-3-319-94214-8_30</a>","chicago":"Jazayeri, Bahar, Olaf Zimmermann, Gregor Engels, Jochen Küster, Dennis Kundisch, and Daniel Szopinski. “Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions.” In <i>Proceeding of International Symposium on Business Modeling and Software Design</i>, 319:390–400. Lecture Notes in Business Information Processing (LNBIP). Wien, Austria: Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-94214-8_30\">https://doi.org/10.1007/978-3-319-94214-8_30</a>.","short":"B. Jazayeri, O. Zimmermann, G. Engels, J. Küster, D. Kundisch, D. Szopinski, in: Proceeding of International Symposium on Business Modeling and Software Design, Springer, Wien, Austria, 2018, pp. 390–400.","mla":"Jazayeri, Bahar, et al. “Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions.” <i>Proceeding of International Symposium on Business Modeling and Software Design</i>, vol. 319, Springer, 2018, pp. 390–400, doi:<a href=\"https://doi.org/10.1007/978-3-319-94214-8_30\">10.1007/978-3-319-94214-8_30</a>.","bibtex":"@inproceedings{Jazayeri_Zimmermann_Engels_Küster_Kundisch_Szopinski_2018, place={Wien, Austria}, series={Lecture Notes in Business Information Processing (LNBIP)}, title={Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions}, volume={319}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-94214-8_30\">10.1007/978-3-319-94214-8_30</a>}, booktitle={Proceeding of International Symposium on Business Modeling and Software Design}, publisher={Springer}, author={Jazayeri, Bahar and Zimmermann, Olaf and Engels, Gregor and Küster, Jochen and Kundisch, Dennis and Szopinski, Daniel}, year={2018}, pages={390–400}, collection={Lecture Notes in Business Information Processing (LNBIP)} }","ama":"Jazayeri B, Zimmermann O, Engels G, Küster J, Kundisch D, Szopinski D. Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions. In: <i>Proceeding of International Symposium on Business Modeling and Software Design</i>. Vol 319. Lecture Notes in Business Information Processing (LNBIP). Wien, Austria: Springer; 2018:390-400. doi:<a href=\"https://doi.org/10.1007/978-3-319-94214-8_30\">10.1007/978-3-319-94214-8_30</a>"},"ddc":["040"],"user_id":"16205","volume":319,"page":"390-400","publisher":"Springer","_id":"3550","has_accepted_license":"1","status":"public","type":"conference","department":[{"_id":"66"},{"_id":"276"}],"file":[{"creator":"bahareh","date_created":"2018-11-12T19:01:06Z","date_updated":"2018-11-12T19:01:06Z","relation":"main_file","file_size":408509,"access_level":"closed","file_name":"Jazayeri_BMSD2018.pdf","content_type":"application/pdf","success":1,"file_id":"5533"}],"date_created":"2018-07-12T10:59:16Z","abstract":[{"text":"Nowadays companies like Apple create ecosystems of third- party providers and users around their software platforms. Often online stores like Apple App Store are created to directly market third-party solutions. We call such ecosystems store-oriented software ecosystems. While the architecture of these ecosystems is mainly derived from busi- ness decisions of their owners, ecosystems with greatly different archi- tectural designs have been created. This diversity makes it challenging for future ecosystem providers to understand which architectural design is suitable to fulfill certain business decisions. In turn, opening a plat- form becomes risky while endangering intellectual property or scarifying quality of services. In this paper, we identify three main design options of store-oriented software ecosystems by classifying existing ecosystems based on similarities in their business decisions. We elaborate on the design options, discuss their main contributions, and provide exemplary ecosystems. Our work provides aspiring ecosystem providers with the reusable knowledge of existing ecosystems and helps them to take more informed architectural decisions and reduce risks in future.","lang":"eng"}],"publication":"Proceeding of International Symposium on Business Modeling and Software Design","doi":"10.1007/978-3-319-94214-8_30","series_title":"Lecture Notes in Business Information Processing (LNBIP)","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:59:24Z","publication_status":"published","intvolume":"       319","title":"Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions","year":"2018","publication_identifier":{"isbn":["9783319942131","9783319942148"],"issn":["1865-1348","1865-1356"]},"author":[{"id":"36399","full_name":"Jazayeri, Bahar","last_name":"Jazayeri","first_name":"Bahar"},{"full_name":"Zimmermann, Olaf","last_name":"Zimmermann","first_name":"Olaf"},{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels","id":"107"},{"last_name":"Küster","first_name":"Jochen","full_name":"Küster, Jochen"},{"first_name":"Dennis","last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117"},{"last_name":"Szopinski","first_name":"Daniel","full_name":"Szopinski, Daniel","id":"36372"}]},{"page":"1356-1379","_id":"3551","user_id":"477","ddc":["000"],"volume":36,"status":"public","has_accepted_license":"1","file_date_updated":"2018-11-02T15:20:24Z","citation":{"apa":"König, J., Mäcker, A., Meyer auf der Heide, F., &#38; Riechers, S. (2018). Scheduling with interjob communication on parallel processors. <i>Journal of Combinatorial Optimization</i>, <i>36</i>(4), 1356–1379. <a href=\"https://doi.org/10.1007/s10878-018-0325-3\">https://doi.org/10.1007/s10878-018-0325-3</a>","ieee":"J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with interjob communication on parallel processors,” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, pp. 1356–1379, 2018.","short":"J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial Optimization 36 (2018) 1356–1379.","chicago":"König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören Riechers. “Scheduling with Interjob Communication on Parallel Processors.” <i>Journal of Combinatorial Optimization</i> 36, no. 4 (2018): 1356–79. <a href=\"https://doi.org/10.1007/s10878-018-0325-3\">https://doi.org/10.1007/s10878-018-0325-3</a>.","mla":"König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, 2018, pp. 1356–79, doi:<a href=\"https://doi.org/10.1007/s10878-018-0325-3\">10.1007/s10878-018-0325-3</a>.","ama":"König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with interjob communication on parallel processors. <i>Journal of Combinatorial Optimization</i>. 2018;36(4):1356-1379. doi:<a href=\"https://doi.org/10.1007/s10878-018-0325-3\">10.1007/s10878-018-0325-3</a>","bibtex":"@article{König_Mäcker_Meyer auf der Heide_Riechers_2018, title={Scheduling with interjob communication on parallel processors}, volume={36}, DOI={<a href=\"https://doi.org/10.1007/s10878-018-0325-3\">10.1007/s10878-018-0325-3</a>}, number={4}, journal={Journal of Combinatorial Optimization}, author={König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2018}, pages={1356–1379} }"},"project":[{"_id":"16","name":"SFB 901 - Subproject C4"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"}],"language":[{"iso":"eng"}],"doi":"10.1007/s10878-018-0325-3","title":"Scheduling with interjob communication on parallel processors","year":"2018","author":[{"full_name":"König, Jürgen","last_name":"König","first_name":"Jürgen","id":"22358"},{"id":"13536","last_name":"Mäcker","first_name":"Alexander","full_name":"Mäcker, Alexander"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Riechers, Sören","last_name":"Riechers","first_name":"Sören"}],"date_updated":"2022-01-06T06:59:24Z","intvolume":"        36","file":[{"creator":"ups","date_created":"2018-11-02T15:20:24Z","date_updated":"2018-11-02T15:20:24Z","relation":"main_file","file_size":745708,"access_level":"closed","file_name":"SchedulingWithInterjobCommunic.pdf","content_type":"application/pdf","success":1,"file_id":"5299"}],"date_created":"2018-07-13T09:57:48Z","type":"journal_article","department":[{"_id":"63"}],"issue":"4","publication":"Journal of Combinatorial Optimization"},{"file":[{"date_created":"2018-11-06T15:23:02Z","creator":"wever","content_type":"application/pdf","success":1,"file_id":"5385","access_level":"closed","file_size":1348768,"file_name":"Mohr2018_Chapter_ReductionStumpsForMulti-classC.pdf","date_updated":"2018-11-06T15:23:02Z","relation":"main_file"}],"date_created":"2018-07-13T15:29:15Z","type":"conference","department":[{"_id":"355"}],"publication":"Proceedings of the Symposium on Intelligent Data Analysis","main_file_link":[{"open_access":"1","url":"https://link.springer.com/chapter/10.1007%2F978-3-030-01768-2_19"}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-01768-2_19","title":"Reduction Stumps for Multi-Class Classification","year":"2018","author":[{"first_name":"Felix","last_name":"Mohr","full_name":"Mohr, Felix"},{"id":"33176","first_name":"Marcel Dominik","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik"},{"last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129"}],"publication_status":"accepted","date_updated":"2022-01-06T06:59:25Z","place":"‘s-Hertogenbosch, the Netherlands","oa":"1","file_date_updated":"2018-11-06T15:23:02Z","citation":{"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>.","short":"F. Mohr, M.D. Wever, E. Hüllermeier, in: Proceedings of the Symposium on Intelligent Data Analysis, ‘s-Hertogenbosch, the Netherlands, n.d.","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>","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>","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>."},"quality_controlled":"1","project":[{"name":"SFB 901","_id":"1"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"3552","user_id":"49109","ddc":["000"],"status":"public","conference":{"end_date":"2018-10-26","name":"Symposium on Intelligent Data Analysis","start_date":"2018-10-24","location":"‘s-Hertogenbosch, the Netherlands"},"has_accepted_license":"1"},{"language":[{"iso":"eng"}],"publication_status":"accepted","date_updated":"2022-01-06T06:59:26Z","author":[{"first_name":"Linus Matthias","last_name":"Witschen","full_name":"Witschen, Linus Matthias","id":"49051"},{"last_name":"Wiersema","first_name":"Tobias","full_name":"Wiersema, Tobias","id":"3118"},{"id":"61186","full_name":"Ghasemzadeh Mohammadi, Hassan","last_name":"Ghasemzadeh Mohammadi","first_name":"Hassan"},{"orcid":"https://orcid.org/0000-0003-4148-2969","first_name":"Muhammad","last_name":"Awais","full_name":"Awais, Muhammad","id":"64665"},{"id":"398","last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"}],"year":"2018","title":"CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation","department":[{"_id":"78"}],"keyword":["Approximate Computing","Framework","Pareto Front","Accuracy"],"type":"preprint","date_created":"2018-07-20T14:10:46Z","file":[{"success":1,"content_type":"application/pdf","file_id":"3587","file_size":285348,"access_level":"closed","file_name":"WitschenWMAP2018.pdf","date_updated":"2018-07-20T14:13:31Z","relation":"main_file","date_created":"2018-07-20T14:13:31Z","creator":"tobias82"}],"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"}],"publication":"Third Workshop on Approximate Computing (AxC 2018)","user_id":"49051","ddc":["000"],"_id":"3586","page":"6","has_accepted_license":"1","status":"public","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"_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"}],"citation":{"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>.","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>.","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>.","short":"L.M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, M. Platzner, Third Workshop on Approximate Computing (AxC 2018) (n.d.).","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."},"file_date_updated":"2018-07-20T14:13:31Z"},{"date_created":"2018-07-27T06:41:13Z","type":"dissertation","department":[{"_id":"78"}],"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."},"supervisor":[{"last_name":"Kaufmann","first_name":"Paul","full_name":"Kaufmann, Paul"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"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"}],"project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"}],"page":"139","_id":"3720","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","user_id":"477","doi":"10.17619/UNIPB/1-376","year":"2018","title":"FPGA-based Reconfigurable Cache Mapping Schemes: Design and Optimization","status":"public","author":[{"full_name":"Ho, Nam","last_name":"Ho","first_name":"Nam"}],"publication_status":"published","date_updated":"2022-01-06T06:59:31Z"},{"year":"2018","title":"Modeling Deliberative Argumentation Strategies on Wikipedia","status":"public","author":[{"first_name":"Khalid","last_name":"Al Khatib","full_name":"Al Khatib, Khalid"},{"full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning","id":"3900"},{"full_name":"Lang, Kevin","last_name":"Lang","first_name":"Kevin"},{"last_name":"Herpel","first_name":"Jakob","full_name":"Herpel, Jakob"},{"last_name":"Hagen","first_name":"Matthias","full_name":"Hagen, Matthias"},{"last_name":"Stein","first_name":"Benno","full_name":"Stein, Benno"}],"date_updated":"2022-01-06T06:59:36Z","page":"2545-2555","main_file_link":[{"url":"https://www.aclweb.org/anthology/P18-1237.pdf"}],"_id":"3804","language":[{"iso":"eng"}],"user_id":"82920","publication":"Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)","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."},"date_created":"2018-08-02T13:38:27Z","type":"conference","department":[{"_id":"568"},{"_id":"600"}]},{"user_id":"82920","_id":"3806","language":[{"iso":"eng"}],"page":"386-396","main_file_link":[{"url":"https://www.aclweb.org/anthology/N18-1036.pdf"}],"date_updated":"2022-01-06T06:59:36Z","author":[{"first_name":"Ivan","last_name":"Habernal","full_name":"Habernal, Ivan"},{"id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth"},{"full_name":"Gurevych, Iryna","first_name":"Iryna","last_name":"Gurevych"},{"first_name":"Benno","last_name":"Stein","full_name":"Stein, Benno"}],"status":"public","year":"2018","title":"Before Name-Calling: Dynamics and Triggers of Ad Hominem Fallacies in Web Argumentation","department":[{"_id":"568"},{"_id":"600"}],"type":"conference","date_created":"2018-08-02T13:38:29Z","citation":{"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.","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.","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} }","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).","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.","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."},"publication":"Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers)"},{"date_created":"2018-08-02T13:38:31Z","type":"conference","department":[{"_id":"600"}],"publication":"Proceedings of The 12th International Workshop on Semantic Evaluation","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."},"main_file_link":[{"url":"https://www.aclweb.org/anthology/S18-1121.pdf"}],"page":"763-772","language":[{"iso":"eng"}],"_id":"3807","user_id":"82920","title":"SemEval-2018 Task 12: The Argument Reasoning Comprehension Task","status":"public","year":"2018","author":[{"full_name":"Habernal, Ivan","last_name":"Habernal","first_name":"Ivan"},{"full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning","id":"3900"},{"first_name":"Iryna","last_name":"Gurevych","full_name":"Gurevych, Iryna"},{"first_name":"Benno","last_name":"Stein","full_name":"Stein, Benno"}],"date_updated":"2022-01-06T06:59:36Z"},{"date_updated":"2022-01-06T06:59:37Z","year":"2018","title":"Retrieval of the Best Counterargument without Prior Topic Knowledge","status":"public","author":[{"last_name":"Wachsmuth","first_name":"Henning","full_name":"Wachsmuth, Henning","id":"3900"},{"first_name":"Shahbaz","last_name":"Syed","full_name":"Syed, Shahbaz"},{"last_name":"Stein","first_name":"Benno","full_name":"Stein, Benno"}],"user_id":"82920","page":"241-251","main_file_link":[{"url":"https://www.aclweb.org/anthology/P18-1023.pdf"}],"_id":"3821","language":[{"iso":"eng"}],"publication":"Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)","citation":{"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.","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} }","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.","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.","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).","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."},"type":"conference","department":[{"_id":"568"},{"_id":"600"}],"date_created":"2018-08-02T13:38:50Z"},{"date_created":"2018-08-08T11:56:37Z","department":[{"_id":"541"},{"_id":"63"}],"type":"bachelorsthesis","supervisor":[{"id":"40384","last_name":"Skopalik","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"citation":{"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.","ieee":"S. Koop, <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn, 2018.","apa":"Koop, S. (2018). <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn.","bibtex":"@book{Koop_2018, title={Congestion Games mit gewichteten Strategien}, publisher={Universität Paderborn}, author={Koop, Samuel}, year={2018} }","ama":"Koop S. <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."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"3851","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"user_id":"14052","author":[{"full_name":"Koop, Samuel","last_name":"Koop","first_name":"Samuel"}],"year":"2018","title":"Congestion Games mit gewichteten Strategien","status":"public","date_updated":"2022-01-06T06:59:45Z"},{"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://docs.google.com/viewer?a=v&pid=sites&srcid=ZGVmYXVsdGRvbWFpbnxhdXRvbWwyMDE4aWNtbHxneDo3M2Q3MjUzYjViNDRhZTAx"}],"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","last_name":"Mohr","first_name":"Felix"},{"id":"48129","last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke"}],"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":[{"file_name":"38.pdf","access_level":"open_access","file_size":297811,"relation":"main_file","date_updated":"2018-08-09T06:14:43Z","file_id":"3853","content_type":"application/pdf","creator":"wever","date_created":"2018-08-09T06:14:43Z"}],"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."}],"urn":"38527","_id":"3852","user_id":"49109","ddc":["006"],"conference":{"start_date":"2018-07-10","name":"ICML 2018 AutoML Workshop","location":"Stockholm, Sweden","end_date":"2018-07-15"},"status":"public","has_accepted_license":"1","oa":"1","citation":{"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.","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."},"file_date_updated":"2018-08-09T06:14:43Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"quality_controlled":"1"}]