[{"user_id":"477","title":"Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?","project":[{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901: SFB 901"}],"date_created":"2023-01-09T06:28:44Z","status":"public","publication_status":"published","department":[{"_id":"77"}],"publication":"37th IEEE/ACM International Conference on Automated Software Engineering","author":[{"last_name":"Richter","id":"50003","first_name":"Cedric","full_name":"Richter, Cedric"},{"last_name":"Haltermann","id":"44413","first_name":"Jan Frederik","full_name":"Haltermann, Jan Frederik"},{"full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine","last_name":"Jakobs"},{"last_name":"Pauck","id":"22398","first_name":"Felix","full_name":"Pauck, Felix"},{"last_name":"Schott","id":"54847","first_name":"Stefan","full_name":"Schott, Stefan"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"publisher":"ACM","oa":"1","doi":"10.1145/3551349.3561156","_id":"35426","date_updated":"2023-01-19T13:50:18Z","language":[{"iso":"eng"}],"type":"conference","citation":{"short":"C. Richter, J.F. Haltermann, M.-C. Jakobs, F. Pauck, S. Schott, H. Wehrheim, in: 37th IEEE/ACM International Conference on Automated Software Engineering, ACM, 2023.","ieee":"C. Richter, J. F. Haltermann, M.-C. Jakobs, F. Pauck, S. Schott, and H. Wehrheim, “Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?,” 2023, doi: 10.1145/3551349.3561156.","chicago":"Richter, Cedric, Jan Frederik Haltermann, Marie-Christine Jakobs, Felix Pauck, Stefan Schott, and Heike Wehrheim. “Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?” In 37th IEEE/ACM International Conference on Automated Software Engineering. ACM, 2023. https://doi.org/10.1145/3551349.3561156.","apa":"Richter, C., Haltermann, J. F., Jakobs, M.-C., Pauck, F., Schott, S., & Wehrheim, H. (2023). Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs? 37th IEEE/ACM International Conference on Automated Software Engineering. https://doi.org/10.1145/3551349.3561156","ama":"Richter C, Haltermann JF, Jakobs M-C, Pauck F, Schott S, Wehrheim H. Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs? In: 37th IEEE/ACM International Conference on Automated Software Engineering. ACM; 2023. doi:10.1145/3551349.3561156","bibtex":"@inproceedings{Richter_Haltermann_Jakobs_Pauck_Schott_Wehrheim_2023, title={Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?}, DOI={10.1145/3551349.3561156}, booktitle={37th IEEE/ACM International Conference on Automated Software Engineering}, publisher={ACM}, author={Richter, Cedric and Haltermann, Jan Frederik and Jakobs, Marie-Christine and Pauck, Felix and Schott, Stefan and Wehrheim, Heike}, year={2023} }","mla":"Richter, Cedric, et al. “Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?” 37th IEEE/ACM International Conference on Automated Software Engineering, ACM, 2023, doi:10.1145/3551349.3561156."},"year":"2023","main_file_link":[{"url":"https://doi.org/10.1145/3551349.3561156","open_access":"1"}]},{"title":"Scaling Arbitrary Android App Analyses","user_id":"477","department":[{"_id":"77"}],"publication":"37th IEEE/ACM International Conference on Automated Software Engineering","publisher":"ACM","author":[{"last_name":"Pauck","id":"22398","first_name":"Felix","full_name":"Pauck, Felix"}],"publication_status":"published","date_created":"2023-01-09T06:32:33Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"}],"status":"public","date_updated":"2023-01-19T13:49:52Z","_id":"35427","doi":"10.1145/3551349.3561339","oa":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3551349.3561339"}],"type":"conference","year":"2023","citation":{"mla":"Pauck, Felix. “Scaling Arbitrary Android App Analyses.” 37th IEEE/ACM International Conference on Automated Software Engineering, ACM, 2023, doi:10.1145/3551349.3561339.","bibtex":"@inproceedings{Pauck_2023, title={Scaling Arbitrary Android App Analyses}, DOI={10.1145/3551349.3561339}, booktitle={37th IEEE/ACM International Conference on Automated Software Engineering}, publisher={ACM}, author={Pauck, Felix}, year={2023} }","ama":"Pauck F. Scaling Arbitrary Android App Analyses. In: 37th IEEE/ACM International Conference on Automated Software Engineering. ACM; 2023. doi:10.1145/3551349.3561339","apa":"Pauck, F. (2023). Scaling Arbitrary Android App Analyses. 37th IEEE/ACM International Conference on Automated Software Engineering. https://doi.org/10.1145/3551349.3561339","chicago":"Pauck, Felix. “Scaling Arbitrary Android App Analyses.” In 37th IEEE/ACM International Conference on Automated Software Engineering. ACM, 2023. https://doi.org/10.1145/3551349.3561339.","ieee":"F. Pauck, “Scaling Arbitrary Android App Analyses,” 2023, doi: 10.1145/3551349.3561339.","short":"F. Pauck, in: 37th IEEE/ACM International Conference on Automated Software Engineering, ACM, 2023."},"language":[{"iso":"eng"}]},{"oa":"1","date_updated":"2023-05-10T13:52:14Z","language":[{"iso":"eng"}],"title":"MAAS: Hiding Trojans in Approximate Circuits","project":[{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901: SFB 901"}],"department":[{"_id":"78"}],"license":"https://creativecommons.org/licenses/by/4.0/","conference":{"location":"San Fransico CA 94023-0607, USA","start_date":"2023-04-05","name":"The 24th International Symposium on Quality Electronic Design (ISQED'23)","end_date":"2023-04-07"},"_id":"44194","year":"2023","type":"conference","citation":{"mla":"Ahmed, Qazi Arbab, et al. “MAAS: Hiding Trojans in Approximate Circuits.” The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA, 2023.","bibtex":"@inproceedings{Ahmed_Awais_Platzner_2023, title={MAAS: Hiding Trojans in Approximate Circuits}, booktitle={The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA}, author={Ahmed, Qazi Arbab and Awais, Muhammad and Platzner, Marco}, year={2023} }","ama":"Ahmed QA, Awais M, Platzner M. MAAS: Hiding Trojans in Approximate Circuits. In: The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA. ; 2023.","apa":"Ahmed, Q. A., Awais, M., & Platzner, M. (2023). MAAS: Hiding Trojans in Approximate Circuits. The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA. The 24th International Symposium on Quality Electronic Design (ISQED’23), San Fransico CA 94023-0607, USA.","chicago":"Ahmed, Qazi Arbab, Muhammad Awais, and Marco Platzner. “MAAS: Hiding Trojans in Approximate Circuits.” In The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA, 2023.","ieee":"Q. A. Ahmed, M. Awais, and M. Platzner, “MAAS: Hiding Trojans in Approximate Circuits,” presented at the The 24th International Symposium on Quality Electronic Design (ISQED’23), San Fransico CA 94023-0607, USA, 2023.","short":"Q.A. Ahmed, M. Awais, M. Platzner, in: The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA, 2023."},"ddc":["620"],"user_id":"72764","date_created":"2023-04-26T13:04:56Z","has_accepted_license":"1","status":"public","publication":"The 24th International Symposium on Quality Electronic Design (ISQED'23), San Francisco, Califorina USA","file_date_updated":"2023-05-10T13:52:14Z","author":[{"id":"72764","last_name":"Ahmed","orcid":"0000-0002-1837-2254","full_name":"Ahmed, Qazi Arbab","first_name":"Qazi Arbab"},{"first_name":"Muhammad","full_name":"Awais, Muhammad","last_name":"Awais"},{"first_name":"Marco","full_name":"Platzner, Marco","last_name":"Platzner","id":"398"}],"file":[{"file_id":"44196","creator":"qazi","file_size":614626,"relation":"main_file","date_updated":"2023-05-10T13:52:14Z","content_type":"application/pdf","date_created":"2023-04-26T13:03:54Z","file_name":"s4Bp4-041.pdf","access_level":"open_access"}]},{"citation":{"ieee":"F. Pauck, Cooperative Android App Analysis. Paderborn University, 2023.","short":"F. Pauck, Cooperative Android App Analysis, Paderborn University, 2023.","bibtex":"@book{Pauck_2023, title={Cooperative Android App Analysis}, DOI={10.17619/UNIPB/1-1698}, publisher={Paderborn University}, author={Pauck, Felix}, year={2023} }","mla":"Pauck, Felix. Cooperative Android App Analysis. Paderborn University, 2023, doi:10.17619/UNIPB/1-1698.","chicago":"Pauck, Felix. Cooperative Android App Analysis. Paderborn University, 2023. https://doi.org/10.17619/UNIPB/1-1698.","ama":"Pauck F. Cooperative Android App Analysis. Paderborn University; 2023. doi:10.17619/UNIPB/1-1698","apa":"Pauck, F. (2023). Cooperative Android App Analysis. Paderborn University. https://doi.org/10.17619/UNIPB/1-1698"},"type":"dissertation","year":"2023","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"doi":"10.17619/UNIPB/1-1698","_id":"43108","date_updated":"2023-05-22T04:57:42Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"}],"date_created":"2023-03-27T07:39:35Z","status":"public","department":[{"_id":"77"}],"publisher":"Paderborn University","author":[{"first_name":"Felix","full_name":"Pauck, Felix","last_name":"Pauck","id":"22398"}],"title":"Cooperative Android App Analysis","user_id":"22398"},{"place":"Neubiberg","abstract":[{"text":"Reading between the lines has so far been reserved for humans. The present dissertation addresses this research gap using machine learning methods.\r\nImplicit expressions are not comprehensible by computers and cannot be localized in the text. However, many texts arise on interpersonal topics that, unlike commercial evaluation texts, often imply information only by means of longer phrases. Examples are the kindness and the attentiveness of a doctor, which are only paraphrased (“he didn’t even look me in the eye”). The analysis of such data, especially the identification and localization of implicit statements, is a research gap (1). This work uses so-called Aspect-based Sentiment Analysis as a method for this purpose. It remains open how the aspect categories to be extracted can be discovered and thematically delineated based on the data (2). Furthermore, it is not yet explored how a collection of tools should look like, with which implicit phrases can be identified and thus made explicit\r\n(3). Last, it is an open question how to correlate the identified phrases from the text data with other data, including the investigation of the relationship between quantitative scores (e.g., school grades) and the thematically related text (4). Based on these research gaps, the research question is posed as follows: Using text mining methods, how can implicit rating content be properly interpreted and thus made explicit before it is automatically categorized and quantified?\r\nThe uniqueness of this dissertation is based on the automated recognition of implicit linguistic statements alongside explicit statements. These are identified in unstructured text data so that features expressed only in the text can later be compared across data sources, even though they were not included in rating categories such as stars or school grades. German-language physician ratings from websites in three countries serve as the sample domain. The solution approach consists of data creation, a pipeline for text processing and analyses based on this. In the data creation, aspect classes are identified and delineated across platforms and marked in text data. This results in six datasets with over 70,000 annotated sentences and detailed guidelines. The models that were created based on the training data extract and categorize the aspects. In addition, the sentiment polarity and the evaluation weight, i. e., the importance of each phrase, are determined. The models, which are combined in a pipeline, are used in a prototype in the form of a web application. The analyses built on the pipeline quantify the rating contents by linking the obtained information with further data, thus allowing new insights.\r\nAs a result, a toolbox is provided to identify quantifiable rating content and categories using text mining for a sample domain. This is used to evaluate the approach, which in principle can also be adapted to any other domain.","lang":"eng"}],"related_material":{"link":[{"relation":"supplementary_material","url":"https://athene-forschung.unibw.de/145003"}]},"user_id":"58701","title":"Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining","author":[{"last_name":"Kersting","id":"58701","first_name":"Joschka","full_name":"Kersting, Joschka"}],"publisher":"Universität der Bundeswehr München ","department":[{"_id":"579"},{"_id":"7"}],"status":"public","project":[{"_id":"1","grant_number":"160364472","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"grant_number":"160364472","name":"SFB 901 - B1: SFB 901 - Subproject B1","_id":"9"}],"date_created":"2023-05-02T12:54:00Z","publication_status":"published","date_updated":"2023-07-03T12:29:50Z","_id":"44323","language":[{"iso":"ger"}],"supervisor":[{"last_name":"Geierhos","id":"42496","first_name":"Michaela","full_name":"Geierhos, Michaela","orcid":"0000-0002-8180-5606"}],"type":"dissertation","year":"2023","citation":{"short":"J. Kersting, Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining, Universität der Bundeswehr München , Neubiberg, 2023.","ieee":"J. Kersting, Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining. Neubiberg: Universität der Bundeswehr München , 2023.","chicago":"Kersting, Joschka. Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining. Neubiberg: Universität der Bundeswehr München , 2023.","apa":"Kersting, J. (2023). Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining. Universität der Bundeswehr München .","ama":"Kersting J. Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining. Universität der Bundeswehr München ; 2023.","bibtex":"@book{Kersting_2023, place={Neubiberg}, title={Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining}, publisher={Universität der Bundeswehr München }, author={Kersting, Joschka}, year={2023} }","mla":"Kersting, Joschka. Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining. Universität der Bundeswehr München , 2023."},"page":"208"},{"title":"Verifying Software and Reconfigurable Hardware Services","place":"Paderborn","editor":[{"last_name":"Haake","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Marco","full_name":"Platzner, Marco","last_name":"Platzner"},{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"project":[{"_id":"1","grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"}],"department":[{"_id":"7"}],"doi":"10.5281/zenodo.8068583","oa":"1","date_updated":"2023-07-07T11:18:59Z","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","ddc":["004"],"user_id":"477","volume":412,"has_accepted_license":"1","status":"public","date_created":"2023-07-07T08:01:23Z","publisher":"Heinz Nixdorf Institut, Universität Paderborn","author":[{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"},{"id":"398","last_name":"Platzner","full_name":"Platzner, Marco","first_name":"Marco"},{"full_name":"Bodden, Eric","orcid":"0000-0003-3470-3647","first_name":"Eric","id":"59256","last_name":"Bodden"},{"last_name":"Schubert","first_name":"Philipp ","full_name":"Schubert, Philipp "},{"last_name":"Pauck","id":"22398","first_name":"Felix","full_name":"Pauck, Felix"},{"last_name":"Jakobs","full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine"}],"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file_date_updated":"2023-07-07T11:18:59Z","file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2023-07-07T11:18:59Z","file_id":"45889","creator":"florida","file_size":840964,"access_level":"open_access","file_name":"B4-Chapter-SFB-Buch-Final.pdf","date_created":"2023-07-07T08:01:12Z"}],"intvolume":" 412","_id":"45888","year":"2023","type":"book_chapter","citation":{"short":"H. Wehrheim, M. Platzner, E. Bodden, P. Schubert, F. Pauck, M.-C. Jakobs, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 125–144.","ieee":"H. Wehrheim, M. Platzner, E. Bodden, P. Schubert, F. Pauck, and M.-C. Jakobs, “Verifying Software and Reconfigurable Hardware Services,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 125–144.","chicago":"Wehrheim, Heike, Marco Platzner, Eric Bodden, Philipp Schubert, Felix Pauck, and Marie-Christine Jakobs. “Verifying Software and Reconfigurable Hardware Services.” In On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:125–44. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. https://doi.org/10.5281/zenodo.8068583.","ama":"Wehrheim H, Platzner M, Bodden E, Schubert P, Pauck F, Jakobs M-C. Verifying Software and Reconfigurable Hardware Services. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:125-144. doi:10.5281/zenodo.8068583","apa":"Wehrheim, H., Platzner, M., Bodden, E., Schubert, P., Pauck, F., & Jakobs, M.-C. (2023). Verifying Software and Reconfigurable Hardware Services. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, & H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412, pp. 125–144). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068583","mla":"Wehrheim, Heike, et al. “Verifying Software and Reconfigurable Hardware Services.” On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 125–44, doi:10.5281/zenodo.8068583.","bibtex":"@inbook{Wehrheim_Platzner_Bodden_Schubert_Pauck_Jakobs_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Verifying Software and Reconfigurable Hardware Services}, volume={412}, DOI={10.5281/zenodo.8068583}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Wehrheim, Heike and Platzner, Marco and Bodden, Eric and Schubert, Philipp and Pauck, Felix and Jakobs, Marie-Christine}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={125–144}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }"},"page":"125-144"},{"place":"Paderborn","title":"Dialogue-based Requirement Compensation and Style-adjusted Data-to-text Generation","department":[{"_id":"7"},{"_id":"369"}],"editor":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","last_name":"Haake"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"},{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"project":[{"_id":"1","grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)","grant_number":"160364472","_id":"9"}],"date_updated":"2023-07-07T11:20:52Z","doi":"10.5281/zenodo.8068456","oa":"1","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","language":[{"iso":"eng"}],"ddc":["004"],"user_id":"477","publisher":"Heinz Nixdorf Institut, Universität Paderborn","author":[{"full_name":"Bäumer, Frederik Simon","first_name":"Frederik Simon","id":"38837","last_name":"Bäumer"},{"full_name":"Chen, Wei-Fan","first_name":"Wei-Fan","id":"82920","last_name":"Chen"},{"first_name":"Michaela","full_name":"Geierhos, Michaela","orcid":"0000-0002-8180-5606","last_name":"Geierhos","id":"42496"},{"first_name":"Joschka","full_name":"Kersting, Joschka","last_name":"Kersting","id":"58701"},{"last_name":"Wachsmuth","first_name":"Henning","full_name":"Wachsmuth, Henning"}],"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file_date_updated":"2023-07-07T11:20:52Z","file":[{"access_level":"open_access","date_created":"2023-07-07T07:28:58Z","file_name":"B1-Chapter-SFB-Buch-Final.pdf","date_updated":"2023-07-07T11:20:52Z","content_type":"application/pdf","relation":"main_file","file_size":1342718,"creator":"florida","file_id":"45883"}],"volume":412,"status":"public","has_accepted_license":"1","date_created":"2023-07-07T07:29:13Z","intvolume":" 412","_id":"45882","citation":{"short":"F.S. Bäumer, W.-F. Chen, M. Geierhos, J. Kersting, H. Wachsmuth, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 65–84.","ieee":"F. S. Bäumer, W.-F. Chen, M. Geierhos, J. Kersting, and H. Wachsmuth, “Dialogue-based Requirement Compensation and Style-adjusted Data-to-text Generation,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 65–84.","ama":"Bäumer FS, Chen W-F, Geierhos M, Kersting J, Wachsmuth H. Dialogue-based Requirement Compensation and Style-adjusted Data-to-text Generation. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:65-84. doi:10.5281/zenodo.8068456","apa":"Bäumer, F. S., Chen, W.-F., Geierhos, M., Kersting, J., & Wachsmuth, H. (2023). Dialogue-based Requirement Compensation and Style-adjusted Data-to-text Generation. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, & H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412, pp. 65–84). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068456","chicago":"Bäumer, Frederik Simon, Wei-Fan Chen, Michaela Geierhos, Joschka Kersting, and Henning Wachsmuth. “Dialogue-Based Requirement Compensation and Style-Adjusted Data-to-Text Generation.” In On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:65–84. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. https://doi.org/10.5281/zenodo.8068456.","bibtex":"@inbook{Bäumer_Chen_Geierhos_Kersting_Wachsmuth_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Dialogue-based Requirement Compensation and Style-adjusted Data-to-text Generation}, volume={412}, DOI={10.5281/zenodo.8068456}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Bäumer, Frederik Simon and Chen, Wei-Fan and Geierhos, Michaela and Kersting, Joschka and Wachsmuth, Henning}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={65–84}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","mla":"Bäumer, Frederik Simon, et al. “Dialogue-Based Requirement Compensation and Style-Adjusted Data-to-Text Generation.” On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 65–84, doi:10.5281/zenodo.8068456."},"type":"book_chapter","year":"2023","page":"65-84"},{"project":[{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - B2: Konfiguration und Bewertung (B02)","grant_number":"160364472"}],"editor":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","last_name":"Haake"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Platzner","full_name":"Platzner, Marco","first_name":"Marco"},{"first_name":"Henning","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"department":[{"_id":"7"}],"title":"Configuration and Evaluation","place":"Paderborn","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","oa":"1","doi":"10.5281/zenodo.8068466","date_updated":"2023-07-07T11:20:12Z","date_created":"2023-07-07T07:50:53Z","has_accepted_license":"1","status":"public","volume":412,"file":[{"access_level":"open_access","date_created":"2023-07-07T07:50:34Z","file_name":"B2-Chapter-SFB-Buch-Final.pdf","content_type":"application/pdf","date_updated":"2023-07-07T11:20:11Z","relation":"main_file","file_size":895091,"creator":"florida","file_id":"45885"}],"file_date_updated":"2023-07-07T11:20:11Z","publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","author":[{"id":"43980","last_name":"Hanselle","full_name":"Hanselle, Jonas Manuel","orcid":"0000-0002-1231-4985","first_name":"Jonas Manuel"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","id":"48129"},{"last_name":"Mohr","first_name":"Felix","full_name":"Mohr, Felix"},{"first_name":"Axel-Cyrille","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","id":"65716"},{"full_name":"Sherif, Mohamed","orcid":"https://orcid.org/0000-0002-9927-2203","first_name":"Mohamed","id":"67234","last_name":"Sherif"},{"first_name":"Alexander","full_name":"Tornede, Alexander","last_name":"Tornede","id":"38209"},{"last_name":"Wever","id":"33176","first_name":"Marcel Dominik","full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818"}],"publisher":"Heinz Nixdorf Institut, Universität Paderborn","user_id":"477","ddc":["040"],"page":"85-104","type":"book_chapter","citation":{"mla":"Hanselle, Jonas Manuel, et al. “Configuration and Evaluation.” On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 85–104, doi:10.5281/zenodo.8068466.","bibtex":"@inbook{Hanselle_Hüllermeier_Mohr_Ngonga Ngomo_Sherif_Tornede_Wever_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Configuration and Evaluation}, volume={412}, DOI={10.5281/zenodo.8068466}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Hanselle, Jonas Manuel and Hüllermeier, Eyke and Mohr, Felix and Ngonga Ngomo, Axel-Cyrille and Sherif, Mohamed and Tornede, Alexander and Wever, Marcel Dominik}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={85–104}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","chicago":"Hanselle, Jonas Manuel, Eyke Hüllermeier, Felix Mohr, Axel-Cyrille Ngonga Ngomo, Mohamed Sherif, Alexander Tornede, and Marcel Dominik Wever. “Configuration and Evaluation.” In On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:85–104. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. https://doi.org/10.5281/zenodo.8068466.","ama":"Hanselle JM, Hüllermeier E, Mohr F, et al. Configuration and Evaluation. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:85-104. doi:10.5281/zenodo.8068466","apa":"Hanselle, J. M., Hüllermeier, E., Mohr, F., Ngonga Ngomo, A.-C., Sherif, M., Tornede, A., & Wever, M. D. (2023). Configuration and Evaluation. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, & H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412, pp. 85–104). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068466","ieee":"J. M. Hanselle et al., “Configuration and Evaluation,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 85–104.","short":"J.M. Hanselle, E. Hüllermeier, F. Mohr, A.-C. Ngonga Ngomo, M. Sherif, A. Tornede, M.D. Wever, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 85–104."},"year":"2023","_id":"45884","intvolume":" 412"},{"title":"Composition Analysis in Unknown Contexts","place":"Paderborn","editor":[{"last_name":"Haake","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"},{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"project":[{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"11","name":"SFB 901 - B3: SFB 901 - Subproject B3"}],"department":[{"_id":"7"}],"doi":"10.5281/zenodo.8068510","oa":"1","date_updated":"2023-07-07T11:19:40Z","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","ddc":["004"],"user_id":"477","volume":412,"has_accepted_license":"1","status":"public","date_created":"2023-07-07T07:56:08Z","publisher":"Heinz Nixdorf Institut, Universität Paderborn","author":[{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"},{"id":"48129","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"},{"last_name":"Becker","full_name":"Becker, Steffen","first_name":"Steffen"},{"last_name":"Becker","first_name":"Matthias","full_name":"Becker, Matthias"},{"first_name":"Cedric","full_name":"Richter, Cedric","last_name":"Richter","id":"50003"},{"full_name":"Sharma, Arnab","first_name":"Arnab","id":"67200","last_name":"Sharma"}],"file_date_updated":"2023-07-07T11:19:40Z","publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file":[{"relation":"main_file","date_updated":"2023-07-07T11:19:40Z","content_type":"application/pdf","creator":"florida","file_id":"45887","file_size":370888,"access_level":"open_access","file_name":"B3-Chapter-SFB-Buch-Final.pdf","date_created":"2023-07-07T07:55:57Z"}],"intvolume":" 412","_id":"45886","citation":{"ieee":"H. Wehrheim, E. Hüllermeier, S. Becker, M. Becker, C. Richter, and A. Sharma, “Composition Analysis in Unknown Contexts,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 105–123.","short":"H. Wehrheim, E. Hüllermeier, S. Becker, M. Becker, C. Richter, A. Sharma, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 105–123.","bibtex":"@inbook{Wehrheim_Hüllermeier_Becker_Becker_Richter_Sharma_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Composition Analysis in Unknown Contexts}, volume={412}, DOI={10.5281/zenodo.8068510}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Wehrheim, Heike and Hüllermeier, Eyke and Becker, Steffen and Becker, Matthias and Richter, Cedric and Sharma, Arnab}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={105–123}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","mla":"Wehrheim, Heike, et al. “Composition Analysis in Unknown Contexts.” On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 105–23, doi:10.5281/zenodo.8068510.","chicago":"Wehrheim, Heike, Eyke Hüllermeier, Steffen Becker, Matthias Becker, Cedric Richter, and Arnab Sharma. “Composition Analysis in Unknown Contexts.” In On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:105–23. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. https://doi.org/10.5281/zenodo.8068510.","ama":"Wehrheim H, Hüllermeier E, Becker S, Becker M, Richter C, Sharma A. Composition Analysis in Unknown Contexts. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:105-123. doi:10.5281/zenodo.8068510","apa":"Wehrheim, H., Hüllermeier, E., Becker, S., Becker, M., Richter, C., & Sharma, A. (2023). Composition Analysis in Unknown Contexts. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, & H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412, pp. 105–123). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068510"},"year":"2023","type":"book_chapter","page":"105-123"},{"doi":"10.1007/978-3-031-37890-4_3","date_updated":"2023-07-28T15:11:10Z","language":[{"iso":"eng"}],"series_title":"Communications in Computer and Information Science","title":"Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews","place":"Cham","editor":[{"first_name":"Alfredo","full_name":"Cuzzocrea, Alfredo","last_name":"Cuzzocrea"},{"last_name":"Gusikhin","full_name":"Gusikhin, Oleg","first_name":"Oleg"},{"last_name":"Hammoudi","full_name":"Hammoudi, Slimane","first_name":"Slimane"},{"last_name":"Quix","first_name":"Christoph","full_name":"Quix, Christoph"}],"publication_identifier":{"isbn":["9783031378898","9783031378904"],"issn":["1865-0929","1865-0937"]},"publication_status":"published","project":[{"_id":"1","grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"_id":"9","name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)","grant_number":"160364472"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}],"department":[{"_id":"579"}],"intvolume":" 1860","_id":"46205","citation":{"short":"J. Kersting, M. Geierhos, in: A. Cuzzocrea, O. Gusikhin, S. Hammoudi, C. Quix (Eds.), Data Management Technologies and Applications, Springer Nature Switzerland, Cham, 2023, pp. 45–65.","ieee":"J. Kersting and M. Geierhos, “Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews,” in Data Management Technologies and Applications, vol. 1860, A. Cuzzocrea, O. Gusikhin, S. Hammoudi, and C. Quix, Eds. Cham: Springer Nature Switzerland, 2023, pp. 45–65.","apa":"Kersting, J., & Geierhos, M. (2023). Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews. In A. Cuzzocrea, O. Gusikhin, S. Hammoudi, & C. Quix (Eds.), Data Management Technologies and Applications (Vol. 1860, pp. 45–65). Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-37890-4_3","ama":"Kersting J, Geierhos M. Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews. In: Cuzzocrea A, Gusikhin O, Hammoudi S, Quix C, eds. Data Management Technologies and Applications. Vol 1860. Communications in Computer and Information Science. Springer Nature Switzerland; 2023:45-65. doi:10.1007/978-3-031-37890-4_3","chicago":"Kersting, Joschka, and Michaela Geierhos. “Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews.” In Data Management Technologies and Applications, edited by Alfredo Cuzzocrea, Oleg Gusikhin, Slimane Hammoudi, and Christoph Quix, 1860:45–65. Communications in Computer and Information Science. Cham: Springer Nature Switzerland, 2023. https://doi.org/10.1007/978-3-031-37890-4_3.","mla":"Kersting, Joschka, and Michaela Geierhos. “Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews.” Data Management Technologies and Applications, edited by Alfredo Cuzzocrea et al., vol. 1860, Springer Nature Switzerland, 2023, pp. 45–65, doi:10.1007/978-3-031-37890-4_3.","bibtex":"@inbook{Kersting_Geierhos_2023, place={Cham}, series={Communications in Computer and Information Science}, title={Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews}, volume={1860}, DOI={10.1007/978-3-031-37890-4_3}, booktitle={Data Management Technologies and Applications}, publisher={Springer Nature Switzerland}, author={Kersting, Joschka and Geierhos, Michaela}, editor={Cuzzocrea, Alfredo and Gusikhin, Oleg and Hammoudi, Slimane and Quix, Christoph}, year={2023}, pages={45–65}, collection={Communications in Computer and Information Science} }"},"year":"2023","type":"book_chapter","page":"45-65","ddc":["004"],"user_id":"58701","abstract":[{"text":"We present a concept for quantifying evaluative phrases to later compare rating texts numerically instead of just relying on stars or grades. We achievethis by combining deep learning models in an aspect-based sentiment analysis pipeline along with sentiment weighting, polarity, and correlation analyses that combine deep learning results with metadata. The results provide new insights for the medical field. Our application domain, physician reviews, shows that there are millions of review texts on the Internet that cannot yet be comprehensively analyzed because previous studies have focused on explicit aspects from other domains (e.g., products). We identify, extract, and classify implicit and explicit aspect phrases equally from German-language review texts. To do so, we annotated aspect phrases representing reviews on numerous aspects of a physician, medical practice, or practice staff. We apply the best performing transformer model, XLM-RoBERTa, to a large physician review dataset and correlate the results with existing metadata. As a result, we can show different correlations between the sentiment polarity of certain aspect classes (e.g., friendliness, practice equipment) and physicians’ professions (e.g., surgeon, ophthalmologist). As a result, we have individual numerical scores that contain a variety of information based on deep learning algorithms that extract textual (evaluative) information and metadata from the Web.","lang":"eng"}],"volume":1860,"has_accepted_license":"1","status":"public","date_created":"2023-07-28T15:03:14Z","author":[{"first_name":"Joschka","full_name":"Kersting, Joschka","last_name":"Kersting","id":"58701"},{"orcid":"0000-0002-8180-5606","full_name":"Geierhos, Michaela","first_name":"Michaela","id":"42496","last_name":"Geierhos"}],"publisher":"Springer Nature Switzerland","file_date_updated":"2023-07-28T15:10:48Z","publication":"Data Management Technologies and Applications","file":[{"content_type":"application/pdf","date_updated":"2023-07-28T15:10:48Z","relation":"main_file","success":1,"file_size":746336,"file_id":"46207","creator":"jkers","access_level":"closed","date_created":"2023-07-28T15:10:48Z","file_name":"Kersting and Geierhos (2023), Kersting2023b.pdf"}]},{"date_created":"2023-06-27T05:20:14Z","status":"public","has_accepted_license":"1","file_date_updated":"2023-07-24T08:42:01Z","author":[{"last_name":"Tornede","id":"38209","first_name":"Alexander","full_name":"Tornede, Alexander"}],"file":[{"file_name":"dissertation_alexander_tornede_final_publishing_compressed.pdf","date_created":"2023-07-24T08:40:35Z","access_level":"open_access","file_size":4300633,"title":" Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions","creator":"ahetzer","file_id":"46118","content_type":"application/pdf","date_updated":"2023-07-24T08:42:01Z","relation":"main_file"}],"ddc":["006"],"user_id":"15504","type":"dissertation","year":"2023","citation":{"bibtex":"@book{Tornede_2023, title={Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions}, DOI={10.17619/UNIPB/1-1780 }, author={Tornede, Alexander}, year={2023} }","mla":"Tornede, Alexander. Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions. 2023, doi:10.17619/UNIPB/1-1780 .","ieee":"A. Tornede, Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions. 2023.","chicago":"Tornede, Alexander. Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions, 2023. https://doi.org/10.17619/UNIPB/1-1780 .","ama":"Tornede A. Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions.; 2023. doi:10.17619/UNIPB/1-1780 ","apa":"Tornede, A. (2023). Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions. https://doi.org/10.17619/UNIPB/1-1780 ","short":"A. Tornede, Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions, 2023."},"supervisor":[{"last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"_id":"45780","project":[{"_id":"10","grant_number":"160364472","name":"SFB 901 - B2: Konfiguration und Bewertung (B02)"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472","_id":"1"}],"department":[{"_id":"355"}],"title":"Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions","language":[{"iso":"eng"}],"doi":"10.17619/UNIPB/1-1780 ","oa":"1","date_updated":"2023-08-04T06:01:49Z"},{"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","language":[{"iso":"eng"}],"date_updated":"2023-08-29T06:44:36Z","oa":"1","doi":"10.17619/UNIPB/1-1797","department":[{"_id":"7"}],"project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"82","name":"SFB 901 - T: SFB 901 - Project Area T"},{"grant_number":"160364472","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)","_id":"5"},{"grant_number":"160364472","name":"SFB 901 - A3: SFB 901 - Der Markt für Services: Anreize, Algorithmen, Implementation (Subproject A3)","_id":"7"},{"_id":"8","grant_number":"160364472","name":"SFB 901 - A4: SFB 901 - Empirische Analysen in Märkten für OTF Dienstleistungen (Subproject A4)"},{"grant_number":"160364472","name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)","_id":"9"},{"grant_number":"160364472","name":"SFB 901 - B2: Konfiguration und Bewertung (B02)","_id":"10"},{"_id":"11","name":"SFB 901 - B3: SFB 901 - Subproject B3"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"},{"_id":"14","name":"SFB 901 - C2: SFB 901 - On-The-Fly Compute Centers I: Heterogene Ausführungsumgebungen (Subproject C2)","grant_number":"160364472"},{"name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","grant_number":"160364472","_id":"16"},{"name":"SFB 901 - C5: SFB 901 - Subproject C5","_id":"17"},{"_id":"83","name":"SFB 901 - T1: SFB 901 -Subproject T1"},{"_id":"84","name":"SFB 901 - T2: SFB 901 -Subproject T2"}],"publication_identifier":{"unknown":["978-3-947647-31-6"]},"place":"Paderborn","title":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","page":"247","year":"2023","citation":{"ieee":"C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023.","short":"C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim, On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023.","mla":"Haake, Claus-Jochen, et al. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Heinz Nixdorf Institut, Universität Paderborn, 2023, doi:10.17619/UNIPB/1-1797.","bibtex":"@book{Haake_Meyer auf der Heide_Platzner_Wachsmuth_Wehrheim_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, volume={412}, DOI={10.17619/UNIPB/1-1797}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","chicago":"Haake, Claus-Jochen, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol. 412. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. https://doi.org/10.17619/UNIPB/1-1797.","ama":"Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Heinz Nixdorf Institut, Universität Paderborn; 2023. doi:10.17619/UNIPB/1-1797","apa":"Haake, C.-J., Meyer auf der Heide, F., Platzner, M., Wachsmuth, H., & Wehrheim, H. (2023). On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.17619/UNIPB/1-1797"},"type":"book","intvolume":" 412","_id":"45863","file":[{"date_created":"2023-07-05T07:15:55Z","file_name":"SFB-Buch-Final.pdf","access_level":"open_access","file_size":15480050,"creator":"ups","file_id":"45864","content_type":"application/pdf","date_updated":"2023-07-05T07:19:14Z","relation":"main_file"}],"file_date_updated":"2023-07-05T07:19:14Z","author":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","last_name":"Haake","id":"20801"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Platzner","id":"398","first_name":"Marco","full_name":"Platzner, Marco"},{"id":"3900","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"publisher":"Heinz Nixdorf Institut, Universität Paderborn","date_created":"2023-07-05T07:16:51Z","status":"public","has_accepted_license":"1","volume":412,"alternative_title":["Collaborative Research Centre 901 (2011 – 2023)"],"abstract":[{"text":"In the proposal for our CRC in 2011, we formulated a vision of markets for\r\nIT services that describes an approach to the provision of such services\r\nthat was novel at that time and, to a large extent, remains so today:\r\n„Our vision of on-the-fly computing is that of IT services individually and\r\nautomatically configured and brought to execution from flexibly combinable\r\nservices traded on markets. At the same time, we aim at organizing\r\nmarkets whose participants maintain a lively market of services through\r\nappropriate entrepreneurial actions.“\r\nOver the last 12 years, we have developed methods and techniques to\r\naddress problems critical to the convenient, efficient, and secure use of\r\non-the-fly computing. Among other things, we have made the description\r\nof services more convenient by allowing natural language input,\r\nincreased the quality of configured services through (natural language)\r\ninteraction and more efficient configuration processes and analysis\r\nprocedures, made the quality of (the products of) providers in the\r\nmarketplace transparent through reputation systems, and increased the\r\nresource efficiency of execution through reconfigurable heterogeneous\r\ncomputing nodes and an integrated treatment of service description and\r\nconfiguration. We have also developed network infrastructures that have\r\na high degree of adaptivity, scalability, efficiency, and reliability, and\r\nprovide cryptographic guarantees of anonymity and security for market\r\nparticipants and their products and services.\r\nTo demonstrate the pervasiveness of the OTF computing approach, we\r\nhave implemented a proof-of-concept for OTF computing that can run\r\ntypical scenarios of an OTF market. We illustrated the approach using\r\na cutting-edge application scenario – automated machine learning (AutoML).\r\nFinally, we have been pushing our work for the perpetuation of\r\nOn-The-Fly Computing beyond the SFB and sharing the expertise gained\r\nin the SFB in events with industry partners as well as transfer projects.\r\nThis work required a broad spectrum of expertise. Computer scientists\r\nand economists with research interests such as computer networks and\r\ndistributed algorithms, security and cryptography, software engineering\r\nand verification, configuration and machine learning, computer engineering\r\nand HPC, microeconomics and game theory, business informatics\r\nand management have successfully collaborated here.","lang":"eng"}],"user_id":"477","ddc":["000"]},{"year":"2023","type":"dissertation","citation":{"bibtex":"@book{König_2023, title={On the Membership and Correctness Problem for State Serializability and Value Opacity}, author={König, Jürgen}, year={2023} }","mla":"König, Jürgen. On the Membership and Correctness Problem for State Serializability and Value Opacity. 2023.","apa":"König, J. (2023). On the Membership and Correctness Problem for State Serializability and Value Opacity.","ama":"König J. On the Membership and Correctness Problem for State Serializability and Value Opacity.; 2023.","chicago":"König, Jürgen. On the Membership and Correctness Problem for State Serializability and Value Opacity, 2023.","ieee":"J. König, On the Membership and Correctness Problem for State Serializability and Value Opacity. 2023.","short":"J. König, On the Membership and Correctness Problem for State Serializability and Value Opacity, 2023."},"supervisor":[{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"language":[{"iso":"eng"}],"date_updated":"2023-10-06T12:41:42Z","_id":"47833","date_created":"2023-10-06T12:41:35Z","project":[{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B3: SFB 901 - Subproject B3","_id":"11"}],"status":"public","department":[{"_id":"77"}],"author":[{"last_name":"König","full_name":"König, Jürgen","first_name":"Jürgen"}],"title":"On the Membership and Correctness Problem for State Serializability and Value Opacity","user_id":"15504"},{"citation":{"bibtex":"@inproceedings{Witschen_Wiersema_Reuter_Platzner, title={Search Space Characterization for Approximate Logic Synthesis }, booktitle={2022 59th ACM/IEEE Design Automation Conference (DAC)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Reuter, Lucas David and Platzner, Marco} }","mla":"Witschen, Linus Matthias, et al. “Search Space Characterization for Approximate Logic Synthesis .” 2022 59th ACM/IEEE Design Automation Conference (DAC).","apa":"Witschen, L. M., Wiersema, T., Reuter, L. D., & Platzner, M. (n.d.). Search Space Characterization for Approximate Logic Synthesis . 2022 59th ACM/IEEE Design Automation Conference (DAC). 2022 59th ACM/IEEE Design Automation Conference (DAC), San Francisco, USA.","ama":"Witschen LM, Wiersema T, Reuter LD, Platzner M. Search Space Characterization for Approximate Logic Synthesis . In: 2022 59th ACM/IEEE Design Automation Conference (DAC).","chicago":"Witschen, Linus Matthias, Tobias Wiersema, Lucas David Reuter, and Marco Platzner. “Search Space Characterization for Approximate Logic Synthesis .” In 2022 59th ACM/IEEE Design Automation Conference (DAC), n.d.","ieee":"L. M. Witschen, T. Wiersema, L. D. Reuter, and M. Platzner, “Search Space Characterization for Approximate Logic Synthesis ,” presented at the 2022 59th ACM/IEEE Design Automation Conference (DAC), San Francisco, USA.","short":"L.M. Witschen, T. Wiersema, L.D. Reuter, M. Platzner, in: 2022 59th ACM/IEEE Design Automation Conference (DAC), n.d."},"year":"2022","type":"conference","language":[{"iso":"eng"}],"_id":"29945","date_updated":"2022-02-22T07:51:42Z","conference":{"end_date":"2022-07-14","name":"2022 59th ACM/IEEE Design Automation Conference (DAC)","start_date":"2022-07-10","location":"San Francisco, USA"},"author":[{"full_name":"Witschen, Linus Matthias","first_name":"Linus Matthias","id":"49051","last_name":"Witschen"},{"id":"3118","last_name":"Wiersema","full_name":"Wiersema, Tobias","first_name":"Tobias"},{"last_name":"Reuter","full_name":"Reuter, Lucas David","first_name":"Lucas David"},{"last_name":"Platzner","id":"398","first_name":"Marco","full_name":"Platzner, Marco"}],"department":[{"_id":"78"}],"publication":"2022 59th ACM/IEEE Design Automation Conference (DAC)","publication_status":"accepted","status":"public","date_created":"2022-02-22T07:51:38Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"}],"title":"Search Space Characterization for Approximate Logic Synthesis ","user_id":"49051"},{"author":[{"last_name":"Witschen","id":"49051","first_name":"Linus Matthias","full_name":"Witschen, Linus Matthias"},{"id":"3118","last_name":"Wiersema","full_name":"Wiersema, Tobias","first_name":"Tobias"},{"last_name":"Artmann","full_name":"Artmann, Matthias","first_name":"Matthias"},{"full_name":"Platzner, Marco","first_name":"Marco","id":"398","last_name":"Platzner"}],"department":[{"_id":"78"}],"publication":"Design, Automation and Test in Europe (DATE)","status":"public","date_created":"2022-02-16T16:22:23Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"publication_status":"accepted","user_id":"49051","title":"MUSCAT: MUS-based Circuit Approximation Technique","language":[{"iso":"eng"}],"citation":{"chicago":"Witschen, Linus Matthias, Tobias Wiersema, Matthias Artmann, and Marco Platzner. “MUSCAT: MUS-Based Circuit Approximation Technique.” In Design, Automation and Test in Europe (DATE), n.d.","ama":"Witschen LM, Wiersema T, Artmann M, Platzner M. MUSCAT: MUS-based Circuit Approximation Technique. In: Design, Automation and Test in Europe (DATE).","apa":"Witschen, L. M., Wiersema, T., Artmann, M., & Platzner, M. (n.d.). MUSCAT: MUS-based Circuit Approximation Technique. Design, Automation and Test in Europe (DATE). Design, Automation and Test in Europe (DATE), Online.","mla":"Witschen, Linus Matthias, et al. “MUSCAT: MUS-Based Circuit Approximation Technique.” Design, Automation and Test in Europe (DATE).","bibtex":"@inproceedings{Witschen_Wiersema_Artmann_Platzner, title={MUSCAT: MUS-based Circuit Approximation Technique}, booktitle={Design, Automation and Test in Europe (DATE)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Artmann, Matthias and Platzner, Marco} }","short":"L.M. Witschen, T. Wiersema, M. Artmann, M. Platzner, in: Design, Automation and Test in Europe (DATE), n.d.","ieee":"L. M. Witschen, T. Wiersema, M. Artmann, and M. Platzner, “MUSCAT: MUS-based Circuit Approximation Technique,” presented at the Design, Automation and Test in Europe (DATE), Online."},"year":"2022","type":"conference","date_updated":"2022-02-22T07:52:01Z","_id":"29865","conference":{"location":"Online","name":"Design, Automation and Test in Europe (DATE)"}},{"citation":{"ieee":"E. Schede et al., “A Survey of Methods for Automated Algorithm Configuration,” arXiv:2202.01651. 2022.","short":"E. Schede, J. Brandt, A. Tornede, M.D. Wever, V. Bengs, E. Hüllermeier, K. Tierney, ArXiv:2202.01651 (2022).","bibtex":"@article{Schede_Brandt_Tornede_Wever_Bengs_Hüllermeier_Tierney_2022, title={A Survey of Methods for Automated Algorithm Configuration}, journal={arXiv:2202.01651}, author={Schede, Elias and Brandt, Jasmin and Tornede, Alexander and Wever, Marcel Dominik and Bengs, Viktor and Hüllermeier, Eyke and Tierney, Kevin}, year={2022} }","mla":"Schede, Elias, et al. “A Survey of Methods for Automated Algorithm Configuration.” ArXiv:2202.01651, 2022.","apa":"Schede, E., Brandt, J., Tornede, A., Wever, M. D., Bengs, V., Hüllermeier, E., & Tierney, K. (2022). A Survey of Methods for Automated Algorithm Configuration. In arXiv:2202.01651.","ama":"Schede E, Brandt J, Tornede A, et al. A Survey of Methods for Automated Algorithm Configuration. arXiv:220201651. Published online 2022.","chicago":"Schede, Elias, Jasmin Brandt, Alexander Tornede, Marcel Dominik Wever, Viktor Bengs, Eyke Hüllermeier, and Kevin Tierney. “A Survey of Methods for Automated Algorithm Configuration.” ArXiv:2202.01651, 2022."},"type":"preprint","year":"2022","language":[{"iso":"eng"}],"date_updated":"2022-04-12T12:01:15Z","_id":"30868","status":"public","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - B2: SFB 901 - Subproject B2"}],"date_created":"2022-04-12T12:00:08Z","author":[{"full_name":"Schede, Elias","first_name":"Elias","last_name":"Schede"},{"first_name":"Jasmin","full_name":"Brandt, Jasmin","last_name":"Brandt"},{"first_name":"Alexander","full_name":"Tornede, Alexander","last_name":"Tornede","id":"38209"},{"id":"33176","last_name":"Wever","full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik"},{"last_name":"Bengs","id":"76599","first_name":"Viktor","full_name":"Bengs, Viktor"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","id":"48129"},{"full_name":"Tierney, Kevin","first_name":"Kevin","last_name":"Tierney"}],"publication":"arXiv:2202.01651","department":[{"_id":"34"},{"_id":"7"},{"_id":"26"}],"title":"A Survey of Methods for Automated Algorithm Configuration","user_id":"38209","abstract":[{"lang":"eng","text":"Algorithm configuration (AC) is concerned with the automated search of the\r\nmost suitable parameter configuration of a parametrized algorithm. There is\r\ncurrently a wide variety of AC problem variants and methods proposed in the\r\nliterature. Existing reviews do not take into account all derivatives of the AC\r\nproblem, nor do they offer a complete classification scheme. To this end, we\r\nintroduce taxonomies to describe the AC problem and features of configuration\r\nmethods, respectively. We review existing AC literature within the lens of our\r\ntaxonomies, outline relevant design choices of configuration approaches,\r\ncontrast methods and problem variants against each other, and describe the\r\nstate of AC in industry. Finally, our review provides researchers and\r\npractitioners with a look at future research directions in the field of AC."}],"external_id":{"arxiv":["2202.01651"]}},{"department":[{"_id":"7"}],"publication":"Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)","publisher":"IEEE","author":[{"first_name":"Arnab","full_name":"Sharma, Arnab","last_name":"Sharma","id":"67200"},{"last_name":"Melnikov","id":"58747","first_name":"Vitaly","full_name":"Melnikov, Vitaly"},{"id":"48129","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"date_created":"2022-07-01T11:18:03Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B3: SFB 901 - Subproject B3","_id":"11"}],"status":"public","abstract":[{"lang":"eng","text":"Testing is one of the most frequent means of quality assurance for software. Property-based testing aims at generating test suites for checking code against user-defined properties. Test input generation is, however, most often independent of the property to be checked, and is instead based on random or user-defined data generation.In this paper, we present property-driven unit testing of functions with numerical inputs and outputs. Alike property-based testing, it allows users to define the properties to be tested for. Contrary to property-based testing, it also uses the property for a targeted generation of test inputs. Our approach is a form of learning-based testing where we first of all learn a model of a given black-box function using standard machine learning algorithms, and in a second step use model and property for test input generation. This allows us to test both predefined functions as well as machine learned regression models. Our experimental evaluation shows that our property-driven approach is more effective than standard property-based testing techniques."}],"title":"Property-Driven Testing of Black-Box Functions","user_id":"477","page":"113-123","type":"conference","year":"2022","citation":{"bibtex":"@inproceedings{Sharma_Melnikov_Hüllermeier_Wehrheim_2022, title={Property-Driven Testing of Black-Box Functions}, booktitle={Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)}, publisher={IEEE}, author={Sharma, Arnab and Melnikov, Vitaly and Hüllermeier, Eyke and Wehrheim, Heike}, year={2022}, pages={113–123} }","mla":"Sharma, Arnab, et al. “Property-Driven Testing of Black-Box Functions.” Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE), IEEE, 2022, pp. 113–23.","ieee":"A. Sharma, V. Melnikov, E. Hüllermeier, and H. Wehrheim, “Property-Driven Testing of Black-Box Functions,” in Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE), 2022, pp. 113–123.","chicago":"Sharma, Arnab, Vitaly Melnikov, Eyke Hüllermeier, and Heike Wehrheim. “Property-Driven Testing of Black-Box Functions.” In Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE), 113–23. IEEE, 2022.","short":"A. Sharma, V. Melnikov, E. Hüllermeier, H. Wehrheim, in: Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE), IEEE, 2022, pp. 113–123.","apa":"Sharma, A., Melnikov, V., Hüllermeier, E., & Wehrheim, H. (2022). Property-Driven Testing of Black-Box Functions. Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE), 113–123.","ama":"Sharma A, Melnikov V, Hüllermeier E, Wehrheim H. Property-Driven Testing of Black-Box Functions. In: Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE). IEEE; 2022:113-123."},"language":[{"iso":"eng"}],"date_updated":"2022-07-01T11:21:36Z","_id":"32311"},{"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - B2: SFB 901 - Subproject B2"}],"date_created":"2022-11-17T12:57:40Z","status":"public","publication":"Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022","author":[{"full_name":"Fehring, Lukass","first_name":"Lukass","last_name":"Fehring"},{"first_name":"Jonas Manuel","orcid":"0000-0002-1231-4985","full_name":"Hanselle, Jonas Manuel","last_name":"Hanselle","id":"43980"},{"full_name":"Tornede, Alexander","first_name":"Alexander","id":"38209","last_name":"Tornede"}],"user_id":"38209","title":"HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection","external_id":{"arxiv":["2210.17341"]},"abstract":[{"lang":"eng","text":"It is well known that different algorithms perform differently well on an\r\ninstance of an algorithmic problem, motivating algorithm selection (AS): Given\r\nan instance of an algorithmic problem, which is the most suitable algorithm to\r\nsolve it? As such, the AS problem has received considerable attention resulting\r\nin various approaches - many of which either solve a regression or ranking\r\nproblem under the hood. Although both of these formulations yield very natural\r\nways to tackle AS, they have considerable weaknesses. On the one hand,\r\ncorrectly predicting the performance of an algorithm on an instance is a\r\nsufficient, but not a necessary condition to produce a correct ranking over\r\nalgorithms and in particular ranking the best algorithm first. On the other\r\nhand, classical ranking approaches often do not account for concrete\r\nperformance values available in the training data, but only leverage rankings\r\ncomposed from such data. We propose HARRIS- Hybrid rAnking and RegRessIon\r\nforeSts - a new algorithm selector leveraging special forests, combining the\r\nstrengths of both approaches while alleviating their weaknesses. HARRIS'\r\ndecisions are based on a forest model, whose trees are created based on splits\r\noptimized on a hybrid ranking and regression loss function. As our preliminary\r\nexperimental study on ASLib shows, HARRIS improves over standard algorithm\r\nselection approaches on some scenarios showing that combining ranking and\r\nregression in trees is indeed promising for AS."}],"language":[{"iso":"eng"}],"citation":{"chicago":"Fehring, Lukass, Jonas Manuel Hanselle, and Alexander Tornede. “HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection.” In Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022, 2022.","ama":"Fehring L, Hanselle JM, Tornede A. HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection. In: Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022. ; 2022.","apa":"Fehring, L., Hanselle, J. M., & Tornede, A. (2022). HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection. Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022. Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022, Baltimore.","bibtex":"@inproceedings{Fehring_Hanselle_Tornede_2022, title={HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection}, booktitle={Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022}, author={Fehring, Lukass and Hanselle, Jonas Manuel and Tornede, Alexander}, year={2022} }","mla":"Fehring, Lukass, et al. “HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection.” Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022, 2022.","short":"L. Fehring, J.M. Hanselle, A. Tornede, in: Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022, 2022.","ieee":"L. Fehring, J. M. Hanselle, and A. Tornede, “HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection,” presented at the Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022, Baltimore, 2022."},"year":"2022","type":"conference","conference":{"location":"Baltimore","name":"Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022"},"date_updated":"2022-11-17T13:00:53Z","_id":"34103"},{"issue":"1","article_number":"35","_id":"30511","intvolume":" 29","type":"journal_article","year":"2022","citation":{"bibtex":"@article{Schubert_Gazzillo_Patterson_Braha_Schiebel_Hermann_Wei_Bodden_2022, title={Static data-flow analysis for software product lines in C}, volume={29}, DOI={10.1007/s10515-022-00333-1}, number={135}, journal={Automated Software Engineering}, publisher={Springer Science and Business Media LLC}, author={Schubert, Philipp and Gazzillo, Paul and Patterson, Zach and Braha, Julian and Schiebel, Fabian and Hermann, Ben and Wei, Shiyi and Bodden, Eric}, year={2022} }","mla":"Schubert, Philipp, et al. “Static Data-Flow Analysis for Software Product Lines in C.” Automated Software Engineering, vol. 29, no. 1, 35, Springer Science and Business Media LLC, 2022, doi:10.1007/s10515-022-00333-1.","chicago":"Schubert, Philipp, Paul Gazzillo, Zach Patterson, Julian Braha, Fabian Schiebel, Ben Hermann, Shiyi Wei, and Eric Bodden. “Static Data-Flow Analysis for Software Product Lines in C.” Automated Software Engineering 29, no. 1 (2022). https://doi.org/10.1007/s10515-022-00333-1.","ama":"Schubert P, Gazzillo P, Patterson Z, et al. Static data-flow analysis for software product lines in C. Automated Software Engineering. 2022;29(1). doi:10.1007/s10515-022-00333-1","apa":"Schubert, P., Gazzillo, P., Patterson, Z., Braha, J., Schiebel, F., Hermann, B., Wei, S., & Bodden, E. (2022). Static data-flow analysis for software product lines in C. Automated Software Engineering, 29(1), Article 35. https://doi.org/10.1007/s10515-022-00333-1","ieee":"P. Schubert et al., “Static data-flow analysis for software product lines in C,” Automated Software Engineering, vol. 29, no. 1, Art. no. 35, 2022, doi: 10.1007/s10515-022-00333-1.","short":"P. Schubert, P. Gazzillo, Z. Patterson, J. Braha, F. Schiebel, B. Hermann, S. Wei, E. Bodden, Automated Software Engineering 29 (2022)."},"main_file_link":[{"url":"https://link.springer.com/article/10.1007/s10515-022-00333-1","open_access":"1"}],"user_id":"477","article_type":"original","abstract":[{"lang":"eng","text":"AbstractMany critical codebases are written in C, and most of them use preprocessor directives to encode variability, effectively encoding software product lines. These preprocessor directives, however, challenge any static code analysis. SPLlift, a previously presented approach for analyzing software product lines, is limited to Java programs that use a rather simple feature encoding and to analysis problems with a finite and ideally small domain. Other approaches that allow the analysis of real-world C software product lines use special-purpose analyses, preventing the reuse of existing analysis infrastructures and ignoring the progress made by the static analysis community. This work presents VarAlyzer, a novel static analysis approach for software product lines. VarAlyzer first transforms preprocessor constructs to plain C while preserving their variability and semantics. It then solves any given distributive analysis problem on transformed product lines in a variability-aware manner. VarAlyzer ’s analysis results are annotated with feature constraints that encode in which configurations each result holds. Our experiments with 95 compilation units of OpenSSL show that applying VarAlyzer enables one to conduct inter-procedural, flow-, field- and context-sensitive data-flow analyses on entire product lines for the first time, outperforming the product-based approach for highly-configurable systems."}],"status":"public","date_created":"2022-03-25T07:41:26Z","alternative_title":["Revoking the preprocessor’s special role"],"volume":29,"author":[{"id":"60543","last_name":"Schubert","full_name":"Schubert, Philipp","orcid":"0000-0002-8674-1859","first_name":"Philipp"},{"first_name":"Paul","full_name":"Gazzillo, Paul","last_name":"Gazzillo"},{"first_name":"Zach","full_name":"Patterson, Zach","last_name":"Patterson"},{"full_name":"Braha, Julian","first_name":"Julian","last_name":"Braha"},{"last_name":"Schiebel","full_name":"Schiebel, Fabian","first_name":"Fabian"},{"id":"66173","last_name":"Hermann","full_name":"Hermann, Ben","orcid":"0000-0001-9848-2017","first_name":"Ben"},{"full_name":"Wei, Shiyi","first_name":"Shiyi","last_name":"Wei"},{"id":"59256","last_name":"Bodden","full_name":"Bodden, Eric","orcid":"0000-0003-3470-3647","first_name":"Eric"}],"publisher":"Springer Science and Business Media LLC","publication":"Automated Software Engineering","keyword":["inter-procedural static analysis","software product lines","preprocessor","LLVM","C/C++"],"oa":"1","doi":"10.1007/s10515-022-00333-1","date_updated":"2022-11-17T14:22:38Z","language":[{"iso":"eng"}],"title":"Static data-flow analysis for software product lines in C","project":[{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901: SFB 901","_id":"1"}],"publication_status":"published","publication_identifier":{"issn":["0928-8910","1573-7535"]},"department":[{"_id":"76"}]},{"title":"Learning Realistic Mutations: Bug Creation for Neural Bug Detectors","user_id":"477","author":[{"full_name":"Richter, Cedric","first_name":"Cedric","id":"50003","last_name":"Richter"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"department":[{"_id":"77"}],"publication":"2022 IEEE Conference on Software Testing, Verification and Validation (ICST)","status":"public","date_created":"2022-08-08T07:40:04Z","project":[{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"}],"date_updated":"2022-11-18T09:45:40Z","_id":"32590","doi":"10.1109/ICST53961.2022.00027","type":"conference","year":"2022","citation":{"ama":"Richter C, Wehrheim H. Learning Realistic Mutations: Bug Creation for Neural Bug Detectors. In: 2022 IEEE Conference on Software Testing, Verification and Validation (ICST). ; 2022:162-173. doi:10.1109/ICST53961.2022.00027","apa":"Richter, C., & Wehrheim, H. (2022). Learning Realistic Mutations: Bug Creation for Neural Bug Detectors. 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 162–173. https://doi.org/10.1109/ICST53961.2022.00027","short":"C. Richter, H. Wehrheim, in: 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 2022, pp. 162–173.","chicago":"Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors.” In 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 162–73, 2022. https://doi.org/10.1109/ICST53961.2022.00027.","ieee":"C. Richter and H. Wehrheim, “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors,” in 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 2022, pp. 162–173, doi: 10.1109/ICST53961.2022.00027.","bibtex":"@inproceedings{Richter_Wehrheim_2022, title={Learning Realistic Mutations: Bug Creation for Neural Bug Detectors}, DOI={10.1109/ICST53961.2022.00027}, booktitle={2022 IEEE Conference on Software Testing, Verification and Validation (ICST)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={162–173} }","mla":"Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors.” 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 2022, pp. 162–73, doi:10.1109/ICST53961.2022.00027."},"page":"162-173","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"citation":{"mla":"Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs at Massive Scale.” 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 2022, pp. 418–22, doi:10.1145/3524842.3528505.","bibtex":"@inproceedings{Richter_Wehrheim_2022, title={TSSB-3M: Mining single statement bugs at massive scale}, DOI={10.1145/3524842.3528505}, booktitle={2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={418–422} }","chicago":"Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs at Massive Scale.” In 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 418–22, 2022. https://doi.org/10.1145/3524842.3528505.","apa":"Richter, C., & Wehrheim, H. (2022). TSSB-3M: Mining single statement bugs at massive scale. 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 418–422. https://doi.org/10.1145/3524842.3528505","ama":"Richter C, Wehrheim H. TSSB-3M: Mining single statement bugs at massive scale. In: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR). ; 2022:418-422. doi:10.1145/3524842.3528505","ieee":"C. Richter and H. Wehrheim, “TSSB-3M: Mining single statement bugs at massive scale,” in 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 2022, pp. 418–422, doi: 10.1145/3524842.3528505.","short":"C. Richter, H. Wehrheim, in: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 2022, pp. 418–422."},"year":"2022","type":"conference","page":"418-422","_id":"32591","date_updated":"2022-11-18T09:45:05Z","doi":"10.1145/3524842.3528505","author":[{"id":"50003","last_name":"Richter","full_name":"Richter, Cedric","first_name":"Cedric"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"department":[{"_id":"77"}],"publication":"2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)","status":"public","date_created":"2022-08-08T07:42:19Z","project":[{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"}],"user_id":"477","title":"TSSB-3M: Mining single statement bugs at massive scale"},{"keyword":["2022 RAKI SFB901 deer dice kevin knowgraphs limes ngonga sherif simba"],"department":[{"_id":"34"}],"publication":"Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia","author":[{"last_name":"Dreßler","id":"78256","first_name":"Kevin","full_name":"Dreßler, Kevin"},{"id":"67234","last_name":"Sherif","full_name":"Sherif, Mohamed","first_name":"Mohamed"},{"last_name":"Ngonga Ngomo","id":"65716","first_name":"Axel-Cyrille","full_name":"Ngonga Ngomo, Axel-Cyrille"}],"date_created":"2022-06-08T08:47:33Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B2: SFB 901 - Subproject B2","_id":"10"}],"status":"public","abstract":[{"lang":"eng","text":"The creation of an RDF knowledge graph for a particular application commonly involves a pipeline of tools that transform a set ofinput data sources into an RDF knowledge graph in a process called dataset augmentation. The components of such augmentation pipelines often require extensive configuration to lead to satisfactory results. Thus, non-experts are often unable to use them. Wepresent an efficient supervised algorithm based on genetic programming for learning knowledge graph augmentation pipelines of arbitrary length. Our approach uses multi-expression learning to learn augmentation pipelines able to achieve a high F-measure on the training data. Our evaluation suggests that our approach can efficiently learn a larger class of RDF dataset augmentation tasks than the state of the art while using only a single training example. Even on the most complex augmentation problem we posed, our approach consistently achieves an average F1-measure of 99% in under 500 iterations with an average runtime of 16 seconds"}],"user_id":"477","ddc":["000"],"title":"ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning","language":[{"iso":"eng"}],"citation":{"mla":"Dreßler, Kevin, et al. “ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-Expression Learning.” Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia, 2022, doi:10.1145/3511095.3531287.","bibtex":"@inproceedings{Dreßler_Sherif_Ngonga Ngomo_2022, title={ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning}, DOI={10.1145/3511095.3531287}, booktitle={Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia}, author={Dreßler, Kevin and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}, year={2022} }","apa":"Dreßler, K., Sherif, M., & Ngonga Ngomo, A.-C. (2022). ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning. Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia. HT ’22: 33rd ACM Conference on Hypertext and Social Media, Barcelona (Spain). https://doi.org/10.1145/3511095.3531287","ama":"Dreßler K, Sherif M, Ngonga Ngomo A-C. ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning. In: Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia. ; 2022. doi:10.1145/3511095.3531287","chicago":"Dreßler, Kevin, Mohamed Sherif, and Axel-Cyrille Ngonga Ngomo. “ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-Expression Learning.” In Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia, 2022. https://doi.org/10.1145/3511095.3531287.","ieee":"K. Dreßler, M. Sherif, and A.-C. Ngonga Ngomo, “ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning,” presented at the HT ’22: 33rd ACM Conference on Hypertext and Social Media, Barcelona (Spain), 2022, doi: 10.1145/3511095.3531287.","short":"K. Dreßler, M. Sherif, A.-C. Ngonga Ngomo, in: Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia, 2022."},"year":"2022","type":"conference","conference":{"end_date":"2022-07-01","location":"Barcelona (Spain)","start_date":"2022-06-28","name":"HT ’22: 33rd ACM Conference on Hypertext and Social Media"},"_id":"31806","date_updated":"2022-11-18T10:11:38Z","doi":"10.1145/3511095.3531287"},{"type":"conference","citation":{"ieee":"W.-F. Chen, M.-H. Chen, G. Mudgal, and H. Wachsmuth, “Analyzing Culture-Specific Argument Structures in Learner Essays,” in Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022), 2022, pp. 51–61.","short":"W.-F. Chen, M.-H. Chen, G. Mudgal, H. Wachsmuth, in: Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022), 2022, pp. 51–61.","bibtex":"@inproceedings{Chen_Chen_Mudgal_Wachsmuth_2022, title={Analyzing Culture-Specific Argument Structures in Learner Essays}, booktitle={Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)}, author={Chen, Wei-Fan and Chen, Mei-Hua and Mudgal, Garima and Wachsmuth, Henning}, year={2022}, pages={51–61} }","mla":"Chen, Wei-Fan, et al. “Analyzing Culture-Specific Argument Structures in Learner Essays.” Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022), 2022, pp. 51–61.","ama":"Chen W-F, Chen M-H, Mudgal G, Wachsmuth H. Analyzing Culture-Specific Argument Structures in Learner Essays. In: Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022). ; 2022:51-61.","apa":"Chen, W.-F., Chen, M.-H., Mudgal, G., & Wachsmuth, H. (2022). Analyzing Culture-Specific Argument Structures in Learner Essays. Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022), 51–61.","chicago":"Chen, Wei-Fan, Mei-Hua Chen, Garima Mudgal, and Henning Wachsmuth. “Analyzing Culture-Specific Argument Structures in Learner Essays.” In Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022), 51–61, 2022."},"year":"2022","page":"51 - 61","language":[{"iso":"eng"}],"date_updated":"2022-11-18T09:56:17Z","_id":"33274","status":"public","project":[{"name":"SFB 901 - B1: SFB 901 - Subproject B1","_id":"9"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}],"date_created":"2022-09-06T13:51:23Z","author":[{"full_name":"Chen, Wei-Fan","first_name":"Wei-Fan","id":"82920","last_name":"Chen"},{"last_name":"Chen","first_name":"Mei-Hua","full_name":"Chen, Mei-Hua"},{"full_name":"Mudgal, Garima","first_name":"Garima","last_name":"Mudgal"},{"id":"3900","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","first_name":"Henning"}],"department":[{"_id":"600"}],"publication":"Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)","title":"Analyzing Culture-Specific Argument Structures in Learner Essays","user_id":"477"},{"intvolume":" 1580","_id":"32179","conference":{"start_date":"2022-06-26","name":"24th International Conference on Human-Computer Interaction (HCII 2022)","location":"Virtual","end_date":"2022-07-01"},"citation":{"mla":"Kersting, Joschka, et al. “Chatbot-Enhanced Requirements Resolution for Automated Service Compositions.” HCI International 2022 Posters, edited by Constantine Stephanidis et al., vol. 1580, Springer International Publishing, 2022, pp. 419--426, doi:10.1007/978-3-031-06417-3_56.","bibtex":"@inbook{Kersting_Ahmed_Geierhos_2022, place={Cham, Switzerland}, series={Communications in Computer and Information Science (CCIS)}, title={Chatbot-Enhanced Requirements Resolution for Automated Service Compositions}, volume={1580}, DOI={10.1007/978-3-031-06417-3_56}, booktitle={HCI International 2022 Posters}, publisher={Springer International Publishing}, author={Kersting, Joschka and Ahmed, Mobeen and Geierhos, Michaela}, editor={Stephanidis, Constantine and Antona, Margherita and Ntoa, Stavroula}, year={2022}, pages={419--426}, collection={Communications in Computer and Information Science (CCIS)} }","chicago":"Kersting, Joschka, Mobeen Ahmed, and Michaela Geierhos. “Chatbot-Enhanced Requirements Resolution for Automated Service Compositions.” In HCI International 2022 Posters, edited by Constantine Stephanidis, Margherita Antona, and Stavroula Ntoa, 1580:419--426. Communications in Computer and Information Science (CCIS). Cham, Switzerland: Springer International Publishing, 2022. https://doi.org/10.1007/978-3-031-06417-3_56.","ama":"Kersting J, Ahmed M, Geierhos M. Chatbot-Enhanced Requirements Resolution for Automated Service Compositions. In: Stephanidis C, Antona M, Ntoa S, eds. HCI International 2022 Posters. Vol 1580. Communications in Computer and Information Science (CCIS). Springer International Publishing; 2022:419--426. doi:10.1007/978-3-031-06417-3_56","apa":"Kersting, J., Ahmed, M., & Geierhos, M. (2022). Chatbot-Enhanced Requirements Resolution for Automated Service Compositions. In C. Stephanidis, M. Antona, & S. Ntoa (Eds.), HCI International 2022 Posters (Vol. 1580, pp. 419--426). Springer International Publishing. https://doi.org/10.1007/978-3-031-06417-3_56","ieee":"J. Kersting, M. Ahmed, and M. Geierhos, “Chatbot-Enhanced Requirements Resolution for Automated Service Compositions,” in HCI International 2022 Posters, vol. 1580, C. Stephanidis, M. Antona, and S. Ntoa, Eds. Cham, Switzerland: Springer International Publishing, 2022, pp. 419--426.","short":"J. Kersting, M. Ahmed, M. Geierhos, in: C. Stephanidis, M. Antona, S. Ntoa (Eds.), HCI International 2022 Posters, Springer International Publishing, Cham, Switzerland, 2022, pp. 419--426."},"year":"2022","type":"book_chapter","page":"419--426","abstract":[{"text":"This work addresses the automatic resolution of software requirements. In the vision of On-The-Fly Computing, software services should be composed on demand, based solely on natural language input from human users. To enable this, we build a chatbot solution that works with human-in-the-loop support to receive, analyze, correct, and complete their software requirements. The chatbot is equipped with a natural language processing pipeline and a large knowledge base, as well as sophisticated dialogue management skills to enhance the user experience. Previous solutions have focused on analyzing software requirements to point out errors such as vagueness, ambiguity, or incompleteness. Our work shows how apps can collaborate with users to efficiently produce correct requirements. We developed and compared three different chatbot apps that can work with built-in knowledge. We rely on ChatterBot, DialoGPT and Rasa for this purpose. While DialoGPT provides its own knowledge base, Rasa is the best system to combine the text mining and knowledge solutions at our disposal. The evaluation shows that users accept 73% of the suggested answers from Rasa, while they accept only 63% from DialoGPT or even 36% from ChatterBot.","lang":"eng"}],"ddc":["004"],"user_id":"58701","publisher":"Springer International Publishing","author":[{"id":"58701","last_name":"Kersting","full_name":"Kersting, Joschka","first_name":"Joschka"},{"last_name":"Ahmed","full_name":"Ahmed, Mobeen","first_name":"Mobeen"},{"last_name":"Geierhos","id":"42496","first_name":"Michaela","orcid":"0000-0002-8180-5606","full_name":"Geierhos, Michaela"}],"publication":"HCI International 2022 Posters","file_date_updated":"2022-11-28T13:21:32Z","keyword":["On-The-Fly Computing","Chatbot","Knowledge Base"],"file":[{"creator":"jkers","file_id":"34150","file_size":1153017,"relation":"main_file","success":1,"date_updated":"2022-11-28T13:21:32Z","content_type":"application/pdf","date_created":"2022-11-28T13:21:32Z","file_name":"Kersting et al. (2022), Kersting2022.pdf","access_level":"closed"}],"volume":1580,"has_accepted_license":"1","status":"public","date_created":"2022-06-27T09:27:06Z","date_updated":"2022-11-28T13:22:16Z","doi":"10.1007/978-3-031-06417-3_56","series_title":"Communications in Computer and Information Science (CCIS)","language":[{"iso":"eng"}],"place":"Cham, Switzerland","title":"Chatbot-Enhanced Requirements Resolution for Automated Service Compositions","related_material":{"link":[{"relation":"confirmation","url":"https://link.springer.com/chapter/10.1007/978-3-031-06417-3_56"}]},"department":[{"_id":"579"}],"editor":[{"last_name":"Stephanidis","full_name":"Stephanidis, Constantine","first_name":"Constantine"},{"first_name":"Margherita","full_name":"Antona, Margherita","last_name":"Antona"},{"first_name":"Stavroula","full_name":"Ntoa, Stavroula","last_name":"Ntoa"}],"publication_status":"published","publication_identifier":{"isbn":["9783031064166","9783031064173"],"issn":["1865-0929","1865-0937"]},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B1: SFB 901 - Subproject B1","_id":"9"}]},{"file":[{"access_level":"closed","file_name":"Kersting & Bäumer (2022), Kersting2022.pdf","date_created":"2022-12-01T13:39:48Z","date_updated":"2022-12-01T13:39:48Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":155548,"file_id":"34172","creator":"jkers"}],"publisher":"IARIA","author":[{"full_name":"Kersting, Joschka","first_name":"Joschka","id":"58701","last_name":"Kersting"},{"full_name":"Bäumer, Frederik Simon","first_name":"Frederik Simon","id":"38837","last_name":"Bäumer"}],"file_date_updated":"2022-12-01T13:39:48Z","keyword":["Sentiment analysis","Natural language processing","Aspect phrase extraction"],"publication":"Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications","has_accepted_license":"1","status":"public","date_created":"2022-05-04T08:12:09Z","abstract":[{"lang":"eng","text":"This paper aims at discussing past limitations set in sentiment analysis research regarding explicit and implicit mentions of opinions. Previous studies have regularly neglected this question in favor of methodical research on standard-datasets. Furthermore, they were limited to linguistically less-diverse domains, such as commercial product reviews. We face this issue by annotating a German-language physician review dataset that contains numerous implicit, long, and complex statements that indicate aspect ratings, such as the physician’s friendliness. We discuss the nature of implicit statements and present various samples to illustrate the challenge described."}],"user_id":"58701","ddc":["006"],"citation":{"short":"J. Kersting, F.S. Bäumer, in: J. Kersting (Ed.), Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications, IARIA, Barcelona, Spain, 2022, pp. 5–9.","ieee":"J. Kersting and F. S. Bäumer, “Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis,” in Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications, Barcelona, Spain, 2022, pp. 5–9.","chicago":"Kersting, Joschka, and Frederik Simon Bäumer. “Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis.” In Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications, edited by Joschka Kersting, 5–9. Barcelona, Spain: IARIA, 2022.","ama":"Kersting J, Bäumer FS. Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis. In: Kersting J, ed. Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications. IARIA; 2022:5-9.","apa":"Kersting, J., & Bäumer, F. S. (2022). Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis. In J. Kersting (Ed.), Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications (pp. 5–9). IARIA.","bibtex":"@inproceedings{Kersting_Bäumer_2022, place={Barcelona, Spain}, title={Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis}, booktitle={Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications}, publisher={IARIA}, author={Kersting, Joschka and Bäumer, Frederik Simon}, editor={Kersting, Joschka}, year={2022}, pages={5–9} }","mla":"Kersting, Joschka, and Frederik Simon Bäumer. “Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis.” Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications, edited by Joschka Kersting, IARIA, 2022, pp. 5–9."},"year":"2022","type":"conference","page":"5-9","_id":"31054","conference":{"name":"The Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022)","start_date":"2022-03","location":"Barcelona, Spain"},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B1: SFB 901 - Subproject B1","_id":"9"}],"editor":[{"last_name":"Kersting","full_name":"Kersting, Joschka","first_name":"Joschka"}],"publication_status":"published","place":"Barcelona, Spain","title":"Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis","language":[{"iso":"eng"}],"date_updated":"2022-12-01T13:40:11Z"},{"type":"conference_abstract","citation":{"ieee":"M.-H. Chen, G. Mudgal, W.-F. Chen, and H. Wachsmuth, “Investigating the argumentation structures of EFL learners from diverse language backgrounds,” 2022.","short":"M.-H. Chen, G. Mudgal, W.-F. Chen, H. Wachsmuth, in: EUROCALL, 2022.","bibtex":"@inproceedings{Chen_Mudgal_Chen_Wachsmuth_2022, title={Investigating the argumentation structures of EFL learners from diverse language backgrounds}, booktitle={EUROCALL}, author={Chen, Mei-Hua and Mudgal, Garima and Chen, Wei-Fan and Wachsmuth, Henning}, year={2022} }","mla":"Chen, Mei-Hua, et al. “Investigating the Argumentation Structures of EFL Learners from Diverse Language Backgrounds.” EUROCALL, 2022.","apa":"Chen, M.-H., Mudgal, G., Chen, W.-F., & Wachsmuth, H. (2022). Investigating the argumentation structures of EFL learners from diverse language backgrounds. EUROCALL.","ama":"Chen M-H, Mudgal G, Chen W-F, Wachsmuth H. Investigating the argumentation structures of EFL learners from diverse language backgrounds. In: EUROCALL. ; 2022.","chicago":"Chen, Mei-Hua, Garima Mudgal, Wei-Fan Chen, and Henning Wachsmuth. “Investigating the Argumentation Structures of EFL Learners from Diverse Language Backgrounds.” In EUROCALL, 2022."},"year":"2022","language":[{"iso":"eng"}],"date_updated":"2022-05-09T14:58:39Z","_id":"31068","author":[{"first_name":"Mei-Hua","full_name":"Chen, Mei-Hua","last_name":"Chen"},{"first_name":"Garima","full_name":"Mudgal, Garima","last_name":"Mudgal"},{"id":"82920","last_name":"Chen","full_name":"Chen, Wei-Fan","first_name":"Wei-Fan"},{"first_name":"Henning","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","id":"3900"}],"publication":"EUROCALL","department":[{"_id":"600"}],"status":"public","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"9","name":"SFB 901 - B1: SFB 901 - Subproject B1"}],"date_created":"2022-05-05T07:50:21Z","title":"Investigating the argumentation structures of EFL learners from diverse language backgrounds","user_id":"82920"},{"citation":{"ieee":"L. Fehring, Combined Ranking and Regression Trees for Algorithm Selection. Paderborn, 2022.","short":"L. Fehring, Combined Ranking and Regression Trees for Algorithm Selection, Paderborn, 2022.","bibtex":"@book{Fehring_2022, place={Paderborn}, title={Combined Ranking and Regression Trees for Algorithm Selection}, author={Fehring, Lukas}, year={2022} }","mla":"Fehring, Lukas. Combined Ranking and Regression Trees for Algorithm Selection. 2022.","ama":"Fehring L. Combined Ranking and Regression Trees for Algorithm Selection.; 2022.","apa":"Fehring, L. (2022). Combined Ranking and Regression Trees for Algorithm Selection.","chicago":"Fehring, Lukas. Combined Ranking and Regression Trees for Algorithm Selection. Paderborn, 2022."},"type":"bachelorsthesis","year":"2022","language":[{"iso":"eng"}],"_id":"33033","date_updated":"2022-08-20T07:02:04Z","oa":"1","department":[{"_id":"34"},{"_id":"7"},{"_id":"26"}],"file_date_updated":"2022-08-19T09:39:57Z","author":[{"first_name":"Lukas","full_name":"Fehring, Lukas","last_name":"Fehring","id":"75695"}],"file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2022-08-19T09:39:57Z","creator":"ahetzer","file_id":"33034","file_size":24830795,"access_level":"open_access","file_name":"Final Bachelor Thesis.pdf","date_created":"2022-08-19T09:39:57Z"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B2: SFB 901 - Subproject B2","_id":"10"}],"date_created":"2022-08-19T09:41:14Z","status":"public","has_accepted_license":"1","place":"Paderborn","title":"Combined Ranking and Regression Trees for Algorithm Selection","ddc":["006"],"user_id":"38209"},{"_id":"30867","date_updated":"2022-08-24T12:44:27Z","type":"preprint","citation":{"ama":"Tornede A, Bengs V, Hüllermeier E. Machine Learning for Online Algorithm Selection under Censored Feedback. Proceedings of the 36th AAAI Conference on Artificial Intelligence. Published online 2022.","apa":"Tornede, A., Bengs, V., & Hüllermeier, E. (2022). Machine Learning for Online Algorithm Selection under Censored Feedback. In Proceedings of the 36th AAAI Conference on Artificial Intelligence. AAAI.","chicago":"Tornede, Alexander, Viktor Bengs, and Eyke Hüllermeier. “Machine Learning for Online Algorithm Selection under Censored Feedback.” Proceedings of the 36th AAAI Conference on Artificial Intelligence. AAAI, 2022.","mla":"Tornede, Alexander, et al. “Machine Learning for Online Algorithm Selection under Censored Feedback.” Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI, 2022.","bibtex":"@article{Tornede_Bengs_Hüllermeier_2022, title={Machine Learning for Online Algorithm Selection under Censored Feedback}, journal={Proceedings of the 36th AAAI Conference on Artificial Intelligence}, publisher={AAAI}, author={Tornede, Alexander and Bengs, Viktor and Hüllermeier, Eyke}, year={2022} }","short":"A. Tornede, V. Bengs, E. Hüllermeier, Proceedings of the 36th AAAI Conference on Artificial Intelligence (2022).","ieee":"A. Tornede, V. Bengs, and E. Hüllermeier, “Machine Learning for Online Algorithm Selection under Censored Feedback,” Proceedings of the 36th AAAI Conference on Artificial Intelligence. AAAI, 2022."},"year":"2022","language":[{"iso":"eng"}],"title":"Machine Learning for Online Algorithm Selection under Censored Feedback","user_id":"38209","abstract":[{"text":"In online algorithm selection (OAS), instances of an algorithmic problem\r\nclass are presented to an agent one after another, and the agent has to quickly\r\nselect a presumably best algorithm from a fixed set of candidate algorithms.\r\nFor decision problems such as satisfiability (SAT), quality typically refers to\r\nthe algorithm's runtime. As the latter is known to exhibit a heavy-tail\r\ndistribution, an algorithm is normally stopped when exceeding a predefined\r\nupper time limit. As a consequence, machine learning methods used to optimize\r\nan algorithm selection strategy in a data-driven manner need to deal with\r\nright-censored samples, a problem that has received little attention in the\r\nliterature so far. In this work, we revisit multi-armed bandit algorithms for\r\nOAS and discuss their capability of dealing with the problem. Moreover, we\r\nadapt them towards runtime-oriented losses, allowing for partially censored\r\ndata while keeping a space- and time-complexity independent of the time\r\nhorizon. In an extensive experimental evaluation on an adapted version of the\r\nASlib benchmark, we demonstrate that theoretically well-founded methods based\r\non Thompson sampling perform specifically strong and improve in comparison to\r\nexisting methods.","lang":"eng"}],"external_id":{"arxiv":["2109.06234"]},"status":"public","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B2: SFB 901 - Subproject B2","_id":"10"}],"date_created":"2022-04-12T11:58:56Z","author":[{"first_name":"Alexander","full_name":"Tornede, Alexander","last_name":"Tornede","id":"38209"},{"full_name":"Bengs, Viktor","first_name":"Viktor","id":"76599","last_name":"Bengs"},{"id":"48129","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"publisher":"AAAI","publication":"Proceedings of the 36th AAAI Conference on Artificial Intelligence","department":[{"_id":"34"},{"_id":"7"},{"_id":"26"}]},{"language":[{"iso":"eng"}],"type":"preprint","citation":{"bibtex":"@article{Tornede_Gehring_Tornede_Wever_Hüllermeier_2022, title={Algorithm Selection on a Meta Level}, journal={Machine Learning}, author={Tornede, Alexander and Gehring, Lukas and Tornede, Tanja and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2022} }","mla":"Tornede, Alexander, et al. “Algorithm Selection on a Meta Level.” Machine Learning, 2022.","chicago":"Tornede, Alexander, Lukas Gehring, Tanja Tornede, Marcel Dominik Wever, and Eyke Hüllermeier. “Algorithm Selection on a Meta Level.” Machine Learning, 2022.","ama":"Tornede A, Gehring L, Tornede T, Wever MD, Hüllermeier E. Algorithm Selection on a Meta Level. Machine Learning. Published online 2022.","apa":"Tornede, A., Gehring, L., Tornede, T., Wever, M. D., & Hüllermeier, E. (2022). Algorithm Selection on a Meta Level. In Machine Learning.","ieee":"A. Tornede, L. Gehring, T. Tornede, M. D. Wever, and E. Hüllermeier, “Algorithm Selection on a Meta Level,” Machine Learning. 2022.","short":"A. Tornede, L. Gehring, T. Tornede, M.D. Wever, E. Hüllermeier, Machine Learning (2022)."},"year":"2022","_id":"30865","date_updated":"2022-08-24T12:45:39Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - B2: SFB 901 - Subproject B2"}],"date_created":"2022-04-12T11:55:18Z","status":"public","publication":"Machine Learning","department":[{"_id":"34"},{"_id":"7"},{"_id":"26"}],"author":[{"last_name":"Tornede","id":"38209","first_name":"Alexander","full_name":"Tornede, Alexander"},{"full_name":"Gehring, Lukas","first_name":"Lukas","last_name":"Gehring"},{"first_name":"Tanja","full_name":"Tornede, Tanja","last_name":"Tornede","id":"40795"},{"last_name":"Wever","id":"33176","first_name":"Marcel Dominik","full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818"},{"id":"48129","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"user_id":"38209","title":"Algorithm Selection on a Meta Level","external_id":{"arxiv":["2107.09414"]},"abstract":[{"lang":"eng","text":"The problem of selecting an algorithm that appears most suitable for a\r\nspecific instance of an algorithmic problem class, such as the Boolean\r\nsatisfiability problem, is called instance-specific algorithm selection. Over\r\nthe past decade, the problem has received considerable attention, resulting in\r\na number of different methods for algorithm selection. Although most of these\r\nmethods are based on machine learning, surprisingly little work has been done\r\non meta learning, that is, on taking advantage of the complementarity of\r\nexisting algorithm selection methods in order to combine them into a single\r\nsuperior algorithm selector. In this paper, we introduce the problem of meta\r\nalgorithm selection, which essentially asks for the best way to combine a given\r\nset of algorithm selectors. We present a general methodological framework for\r\nmeta algorithm selection as well as several concrete learning methods as\r\ninstantiations of this framework, essentially combining ideas of meta learning\r\nand ensemble learning. In an extensive experimental evaluation, we demonstrate\r\nthat ensembles of algorithm selectors can significantly outperform single\r\nalgorithm selectors and have the potential to form the new state of the art in\r\nalgorithm selection."}]},{"title":"A comparison of heuristic, statistical, and machine learning methods for heated tool butt welding of two different materials","user_id":"38209","abstract":[{"text":"AbstractHeated tool butt welding is a method often used for joining thermoplastics, especially when the components are made out of different materials. The quality of the connection between the components crucially depends on a suitable choice of the parameters of the welding process, such as heating time, temperature, and the precise way how the parts are then welded. Moreover, when different materials are to be joined, the parameter values need to be tailored to the specifics of the respective material. To this end, in this paper, three approaches to tailor the parameter values to optimize the quality of the connection are compared: a heuristic by Potente, statistical experimental design, and Bayesian optimization. With the suitability for practice in mind, a series of experiments are carried out with these approaches, and their capabilities of proposing well-performing parameter values are investigated. As a result, Bayesian optimization is found to yield peak performance, but the costs for optimization are substantial. In contrast, the Potente heuristic does not require any experimentation and recommends parameter values with competitive quality.","lang":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0043-2288","1878-6669"]},"date_created":"2022-08-24T12:51:07Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B2: SFB 901 - Subproject B2","_id":"10"}],"status":"public","keyword":["Metals and Alloys","Mechanical Engineering","Mechanics of Materials"],"publication":"Welding in the World","author":[{"last_name":"Gevers","id":"83151","first_name":"Karina","full_name":"Gevers, Karina"},{"full_name":"Tornede, Alexander","first_name":"Alexander","id":"38209","last_name":"Tornede"},{"full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik","id":"33176","last_name":"Wever"},{"full_name":"Schöppner, Volker","first_name":"Volker","id":"20530","last_name":"Schöppner"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","id":"48129"}],"publisher":"Springer Science and Business Media LLC","doi":"10.1007/s40194-022-01339-9","date_updated":"2022-08-24T12:52:06Z","_id":"33090","citation":{"short":"K. Gevers, A. Tornede, M.D. Wever, V. Schöppner, E. Hüllermeier, Welding in the World (2022).","ieee":"K. Gevers, A. Tornede, M. D. Wever, V. Schöppner, and E. Hüllermeier, “A comparison of heuristic, statistical, and machine learning methods for heated tool butt welding of two different materials,” Welding in the World, 2022, doi: 10.1007/s40194-022-01339-9.","chicago":"Gevers, Karina, Alexander Tornede, Marcel Dominik Wever, Volker Schöppner, and Eyke Hüllermeier. “A Comparison of Heuristic, Statistical, and Machine Learning Methods for Heated Tool Butt Welding of Two Different Materials.” Welding in the World, 2022. https://doi.org/10.1007/s40194-022-01339-9.","apa":"Gevers, K., Tornede, A., Wever, M. D., Schöppner, V., & Hüllermeier, E. (2022). A comparison of heuristic, statistical, and machine learning methods for heated tool butt welding of two different materials. Welding in the World. https://doi.org/10.1007/s40194-022-01339-9","ama":"Gevers K, Tornede A, Wever MD, Schöppner V, Hüllermeier E. A comparison of heuristic, statistical, and machine learning methods for heated tool butt welding of two different materials. Welding in the World. Published online 2022. doi:10.1007/s40194-022-01339-9","mla":"Gevers, Karina, et al. “A Comparison of Heuristic, Statistical, and Machine Learning Methods for Heated Tool Butt Welding of Two Different Materials.” Welding in the World, Springer Science and Business Media LLC, 2022, doi:10.1007/s40194-022-01339-9.","bibtex":"@article{Gevers_Tornede_Wever_Schöppner_Hüllermeier_2022, title={A comparison of heuristic, statistical, and machine learning methods for heated tool butt welding of two different materials}, DOI={10.1007/s40194-022-01339-9}, journal={Welding in the World}, publisher={Springer Science and Business Media LLC}, author={Gevers, Karina and Tornede, Alexander and Wever, Marcel Dominik and Schöppner, Volker and Hüllermeier, Eyke}, year={2022} }"},"type":"journal_article","year":"2022","language":[{"iso":"eng"}]},{"date_created":"2022-11-09T06:26:22Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"}],"status":"public","department":[{"_id":"78"}],"author":[{"id":"49051","last_name":"Witschen","full_name":"Witschen, Linus Matthias","first_name":"Linus Matthias"}],"user_id":"15504","title":"Frameworks and Methodologies for Search-based Approximate Logic Synthesis","supervisor":[{"last_name":"Platzner","id":"398","first_name":"Marco","full_name":"Platzner, Marco"}],"language":[{"iso":"eng"}],"year":"2022","citation":{"short":"L.M. Witschen, Frameworks and Methodologies for Search-Based Approximate Logic Synthesis, 2022.","ieee":"L. M. Witschen, Frameworks and Methodologies for Search-based Approximate Logic Synthesis. 2022.","apa":"Witschen, L. M. (2022). Frameworks and Methodologies for Search-based Approximate Logic Synthesis. https://doi.org/10.17619/UNIPB/1-1649","ama":"Witschen LM. Frameworks and Methodologies for Search-Based Approximate Logic Synthesis.; 2022. doi:10.17619/UNIPB/1-1649","chicago":"Witschen, Linus Matthias. Frameworks and Methodologies for Search-Based Approximate Logic Synthesis, 2022. https://doi.org/10.17619/UNIPB/1-1649.","bibtex":"@book{Witschen_2022, title={Frameworks and Methodologies for Search-based Approximate Logic Synthesis}, DOI={10.17619/UNIPB/1-1649}, author={Witschen, Linus Matthias}, year={2022} }","mla":"Witschen, Linus Matthias. Frameworks and Methodologies for Search-Based Approximate Logic Synthesis. 2022, doi:10.17619/UNIPB/1-1649."},"type":"dissertation","doi":"10.17619/UNIPB/1-1649","date_updated":"2023-01-19T06:41:22Z","_id":"34041"},{"citation":{"short":"Q.A. Ahmed, M. Platzner, in: IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022), Pafos, Cyprus, 2022.","ieee":"Q. A. Ahmed and M. Platzner, “On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs,” presented at the IEEE Computer Society Annual Symposium on VLSI Aliathon Resort, Pafos, Cyprus, 2022.","chicago":"Ahmed, Qazi Arbab, and Marco Platzner. “On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs.” Pafos, Cyprus: IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022), 2022.","apa":"Ahmed, Q. A., & Platzner, M. (2022). On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs. IEEE Computer Society Annual Symposium on VLSI Aliathon Resort, Pafos, Cyprus.","ama":"Ahmed QA, Platzner M. On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs. In: IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022); 2022.","bibtex":"@inproceedings{Ahmed_Platzner_2022, place={Pafos, Cyprus}, title={On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs}, publisher={IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022)}, author={Ahmed, Qazi Arbab and Platzner, Marco}, year={2022} }","mla":"Ahmed, Qazi Arbab, and Marco Platzner. On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs. IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022), 2022."},"year":"2022","type":"conference","language":[{"iso":"eng"}],"_id":"32342","date_updated":"2023-04-19T15:04:30Z","conference":{"start_date":" July 4, 2022","name":"IEEE Computer Society Annual Symposium on VLSI Aliathon Resort,","location":"Pafos, Cyprus","end_date":"July 6, 2022"},"status":"public","date_created":"2022-07-12T19:56:48Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"}],"author":[{"last_name":"Ahmed","id":"72764","first_name":"Qazi Arbab","orcid":"0000-0002-1837-2254","full_name":"Ahmed, Qazi Arbab"},{"first_name":"Marco","full_name":"Platzner, Marco","last_name":"Platzner","id":"398"}],"publisher":"IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022)","department":[{"_id":"78"}],"title":"On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs","user_id":"72764","place":"Pafos, Cyprus"},{"status":"public","has_accepted_license":"1","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B1","_id":"9"}],"date_created":"2021-12-16T15:13:07Z","publication_status":"published","file":[{"file_size":3092211,"creator":"jkers","file_id":"44325","date_updated":"2023-05-02T13:25:27Z","content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2023-05-02T13:25:27Z","file_name":"Thesis-Report-MOBEEN-AHMED-6856465-Knowledge_Base_Enhanced___User_centric_Dialogue_Design_for_OTFComputing.pdf","access_level":"closed"}],"author":[{"full_name":"Ahmed, Mobeen","first_name":"Mobeen","last_name":"Ahmed"}],"department":[{"_id":"600"}],"file_date_updated":"2023-05-02T13:25:27Z","user_id":"58701","title":"Knowledge Base Enhanced & User-centric Dialogue Design for OTF Computing","ddc":["004"],"abstract":[{"lang":"eng","text":"This thesis aims to provide a bidirectional chatbot solution for the requirement engineering process. The Sonderforschungsbereich (SFB) 901 intends to provide the composition of software service On-the-Fly (OTF). The sub-project (B1) of the SFB 901 project deals with the parameters of service configuration. OTF Computing aims to eradicate the dependency on the requirement engineers for the software development process. However, there is no existing bidirectional chatbot solution that analyses user software requirements and provides viable suggestions to the user regarding their service. Previously, CORDULA chatbot was developed to analyze the software requirements but cannot keep the conversation’s context. The Rasa framework is integrated with the knowledge base to solve the issue, the knowledge base provides domain-specific knowledge to the chatbot. The software description is passed through the natural language understanding process to give consciousness to the chatbot. This process involves various machine learning models, including app family classification, to correctly identify the domain for user OTF service. The statistical models like naïve Bayes, kNN and SVM are compared with transformer models for this classification task. Furthermore, the entities (functional requirements) are also separated from the user description.\r\nThe chatbot provides the suggestion of requirements from the preliminary service template with the support of the knowledge base. Furthermore, the generated response is compared with the state-of-the-art DialoGPT transformer model and ChatterBot conversational library. These models are trained over the software development related conversational dataset. All the responses are ranked using the DialoRPT model, and the BLEU score to evaluates the models’ responses. Moreover, the chatbot mod- els are tested with human participants, they used and scored the chatbot responses based on effectiveness, efficiency and satisfaction. The overall response accuracy is also measured by averaging the user approval over the generated responses."}],"supervisor":[{"id":"58701","last_name":"Kersting","full_name":"Kersting, Joschka","first_name":"Joschka"}],"language":[{"iso":"eng"}],"year":"2022","type":"mastersthesis","citation":{"chicago":"Ahmed, Mobeen. Knowledge Base Enhanced & User-Centric Dialogue Design for OTF Computing, 2022.","apa":"Ahmed, M. (2022). Knowledge Base Enhanced & User-centric Dialogue Design for OTF Computing.","ama":"Ahmed M. Knowledge Base Enhanced & User-Centric Dialogue Design for OTF Computing.; 2022.","mla":"Ahmed, Mobeen. Knowledge Base Enhanced & User-Centric Dialogue Design for OTF Computing. 2022.","bibtex":"@book{Ahmed_2022, title={Knowledge Base Enhanced & User-centric Dialogue Design for OTF Computing}, author={Ahmed, Mobeen}, year={2022} }","short":"M. Ahmed, Knowledge Base Enhanced & User-Centric Dialogue Design for OTF Computing, 2022.","ieee":"M. Ahmed, Knowledge Base Enhanced & User-centric Dialogue Design for OTF Computing. 2022."},"_id":"29000","date_updated":"2023-05-02T13:25:45Z"},{"year":"2022","citation":{"ieee":"J. Palushi, Domain-aware Text Professionalization using Sequence-to-Sequence Neural Networks. 2022.","short":"J. Palushi, Domain-Aware Text Professionalization Using Sequence-to-Sequence Neural Networks, 2022.","mla":"Palushi, Juela. Domain-Aware Text Professionalization Using Sequence-to-Sequence Neural Networks. 2022.","bibtex":"@book{Palushi_2022, title={Domain-aware Text Professionalization using Sequence-to-Sequence Neural Networks}, author={Palushi, Juela}, year={2022} }","ama":"Palushi J. Domain-Aware Text Professionalization Using Sequence-to-Sequence Neural Networks.; 2022.","apa":"Palushi, J. (2022). Domain-aware Text Professionalization using Sequence-to-Sequence Neural Networks.","chicago":"Palushi, Juela. Domain-Aware Text Professionalization Using Sequence-to-Sequence Neural Networks, 2022."},"type":"bachelorsthesis","supervisor":[{"id":"3900","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","first_name":"Henning"}],"language":[{"iso":"eng"}],"_id":"45790","date_updated":"2023-07-05T07:31:17Z","department":[{"_id":"600"}],"author":[{"last_name":"Palushi","full_name":"Palushi, Juela","first_name":"Juela"}],"project":[{"name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)","grant_number":"160364472","_id":"9"},{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}],"date_created":"2023-06-27T12:57:57Z","status":"public","title":"Domain-aware Text Professionalization using Sequence-to-Sequence Neural Networks","user_id":"477"},{"status":"public","project":[{"_id":"9","name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)","grant_number":"160364472"},{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"}],"date_created":"2023-06-27T12:56:04Z","author":[{"first_name":"Vinaykumar","full_name":"Budanurmath, Vinaykumar","last_name":"Budanurmath"}],"department":[{"_id":"600"}],"title":"Propaganda Technique Detection Using Connotation Frames","user_id":"477","year":"2022","citation":{"bibtex":"@book{Budanurmath_2022, title={Propaganda Technique Detection Using Connotation Frames}, author={Budanurmath, Vinaykumar}, year={2022} }","mla":"Budanurmath, Vinaykumar. Propaganda Technique Detection Using Connotation Frames. 2022.","chicago":"Budanurmath, Vinaykumar. Propaganda Technique Detection Using Connotation Frames, 2022.","ama":"Budanurmath V. Propaganda Technique Detection Using Connotation Frames.; 2022.","apa":"Budanurmath, V. (2022). Propaganda Technique Detection Using Connotation Frames.","ieee":"V. Budanurmath, Propaganda Technique Detection Using Connotation Frames. 2022.","short":"V. Budanurmath, Propaganda Technique Detection Using Connotation Frames, 2022."},"type":"mastersthesis","supervisor":[{"first_name":"Henning","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","id":"3900"}],"language":[{"iso":"eng"}],"_id":"45789","date_updated":"2023-07-05T07:33:45Z"},{"user_id":"477","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"last_name":"Dongol","first_name":"Brijesh","full_name":"Dongol, Brijesh"},{"last_name":"Schellhorn","full_name":"Schellhorn, Gerhard","first_name":"Gerhard"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"publication":"33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland","status":"public","date_created":"2023-05-24T07:55:24Z","volume":243,"_id":"45248","intvolume":" 243","citation":{"mla":"Dongol, Brijesh, et al. “Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement.” 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland, edited by Bartek Klin et al., vol. 243, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 31:1–31:23, doi:10.4230/LIPIcs.CONCUR.2022.31.","bibtex":"@inproceedings{Dongol_Schellhorn_Wehrheim_2022, series={LIPIcs}, title={Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement}, volume={243}, DOI={10.4230/LIPIcs.CONCUR.2022.31}, booktitle={33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim, Heike}, editor={Klin, Bartek and Lasota, Slawomir and Muscholl, Anca}, year={2022}, pages={31:1–31:23}, collection={LIPIcs} }","chicago":"Dongol, Brijesh, Gerhard Schellhorn, and Heike Wehrheim. “Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement.” In 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland, edited by Bartek Klin, Slawomir Lasota, and Anca Muscholl, 243:31:1–31:23. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.CONCUR.2022.31.","apa":"Dongol, B., Schellhorn, G., & Wehrheim, H. (2022). Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement. In B. Klin, S. Lasota, & A. Muscholl (Eds.), 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland (Vol. 243, p. 31:1–31:23). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2022.31","ama":"Dongol B, Schellhorn G, Wehrheim H. Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement. In: Klin B, Lasota S, Muscholl A, eds. 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland. Vol 243. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:31:1–31:23. doi:10.4230/LIPIcs.CONCUR.2022.31","ieee":"B. Dongol, G. Schellhorn, and H. Wehrheim, “Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement,” in 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland, 2022, vol. 243, p. 31:1–31:23, doi: 10.4230/LIPIcs.CONCUR.2022.31.","short":"B. Dongol, G. Schellhorn, H. Wehrheim, in: B. Klin, S. Lasota, A. Muscholl (Eds.), 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 31:1–31:23."},"type":"conference","year":"2022","page":"31:1–31:23","title":"Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901: SFB 901","grant_number":"160364472"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"}],"editor":[{"last_name":"Klin","full_name":"Klin, Bartek","first_name":"Bartek"},{"full_name":"Lasota, Slawomir","first_name":"Slawomir","last_name":"Lasota"},{"last_name":"Muscholl","first_name":"Anca","full_name":"Muscholl, Anca"}],"date_updated":"2023-08-28T12:24:57Z","doi":"10.4230/LIPIcs.CONCUR.2022.31","series_title":"LIPIcs","language":[{"iso":"eng"}]},{"title":"MLCHECK–Property-Driven Testing of Machine Learning Classifiers","user_id":"477","abstract":[{"lang":"eng","text":"In recent years, we observe an increasing amount of software with machine learning components being deployed. This poses the question of quality assurance for such components: how can we validate whether specified requirements are fulfilled by a machine learned software? Current testing and verification approaches either focus on a single requirement (e.g., fairness) or specialize on a single type of machine learning model (e.g., neural networks).\r\nIn this paper, we propose property-driven testing of machine learning models. Our approach MLCheck encompasses (1) a language for property specification, and (2) a technique for systematic test case generation. The specification language is comparable to property-based testing languages. Test case generation employs advanced verification technology for a systematic, property dependent construction of test suites, without additional user supplied generator functions. We evaluate MLCheck using requirements and data sets from three different application areas (software\r\ndiscrimination, learning on knowledge graphs and security). Our evaluation shows that despite its generality MLCheck can even outperform specialised testing approaches while having a comparable runtime"}],"publication_status":"accepted","status":"public","date_created":"2021-12-07T11:11:36Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"author":[{"id":"67200","last_name":"Sharma","full_name":"Sharma, Arnab","first_name":"Arnab"},{"id":"43817","last_name":"Demir","full_name":"Demir, Caglar","first_name":"Caglar"},{"first_name":"Axel-Cyrille","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","id":"65716"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"publisher":"IEEE","department":[{"_id":"7"},{"_id":"77"},{"_id":"574"}],"publication":"Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA)","date_updated":"2022-01-06T06:58:02Z","_id":"28350","type":"conference","citation":{"ieee":"A. Sharma, C. Demir, A.-C. Ngonga Ngomo, and H. Wehrheim, “MLCHECK–Property-Driven Testing of Machine Learning Classifiers.”","short":"A. Sharma, C. Demir, A.-C. Ngonga Ngomo, H. Wehrheim, in: Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA), IEEE, n.d.","mla":"Sharma, Arnab, et al. “MLCHECK–Property-Driven Testing of Machine Learning Classifiers.” Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA), IEEE.","bibtex":"@inproceedings{Sharma_Demir_Ngonga Ngomo_Wehrheim, title={MLCHECK–Property-Driven Testing of Machine Learning Classifiers}, booktitle={Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA)}, publisher={IEEE}, author={Sharma, Arnab and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille and Wehrheim, Heike} }","ama":"Sharma A, Demir C, Ngonga Ngomo A-C, Wehrheim H. MLCHECK–Property-Driven Testing of Machine Learning Classifiers. In: Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA). IEEE.","apa":"Sharma, A., Demir, C., Ngonga Ngomo, A.-C., & Wehrheim, H. (n.d.). MLCHECK–Property-Driven Testing of Machine Learning Classifiers. Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA).","chicago":"Sharma, Arnab, Caglar Demir, Axel-Cyrille Ngonga Ngomo, and Heike Wehrheim. “MLCHECK–Property-Driven Testing of Machine Learning Classifiers.” In Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA). IEEE, n.d."},"year":"2021","language":[{"iso":"eng"}]},{"date_updated":"2022-01-06T06:57:16Z","language":[{"iso":"eng"}],"title":"IN OTHER WORDS: A NAIVE APPROACH TO TEXT SPINNING","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B1","_id":"9"}],"conference":{"location":"Lisbon, Portugal","start_date":"13.10.2021","name":"18th International Conference on Applied Computing","end_date":"15.10.2021"},"_id":"26049","page":"221--225","year":"2021","citation":{"ieee":"F. S. Bäumer, J. Kersting, S. Denisov, and M. Geierhos, “IN OTHER WORDS: A NAIVE APPROACH TO TEXT SPINNING,” in PROCEEDINGS OF THE INTERNATIONAL CONFERENCES ON WWW/INTERNET 2021 AND APPLIED COMPUTING 2021, Lisbon, Portugal, 2021, pp. 221--225.","short":"F.S. Bäumer, J. Kersting, S. Denisov, M. Geierhos, in: PROCEEDINGS OF THE INTERNATIONAL CONFERENCES ON WWW/INTERNET 2021 AND APPLIED COMPUTING 2021, IADIS, 2021, pp. 221--225.","mla":"Bäumer, Frederik Simon, et al. “IN OTHER WORDS: A NAIVE APPROACH TO TEXT SPINNING.” PROCEEDINGS OF THE INTERNATIONAL CONFERENCES ON WWW/INTERNET 2021 AND APPLIED COMPUTING 2021, IADIS, 2021, pp. 221--225.","bibtex":"@inproceedings{Bäumer_Kersting_Denisov_Geierhos_2021, title={IN OTHER WORDS: A NAIVE APPROACH TO TEXT SPINNING}, booktitle={PROCEEDINGS OF THE INTERNATIONAL CONFERENCES ON WWW/INTERNET 2021 AND APPLIED COMPUTING 2021}, publisher={IADIS}, author={Bäumer, Frederik Simon and Kersting, Joschka and Denisov, Sergej and Geierhos, Michaela}, year={2021}, pages={221--225} }","chicago":"Bäumer, Frederik Simon, Joschka Kersting, Sergej Denisov, and Michaela Geierhos. “IN OTHER WORDS: A NAIVE APPROACH TO TEXT SPINNING.” In PROCEEDINGS OF THE INTERNATIONAL CONFERENCES ON WWW/INTERNET 2021 AND APPLIED COMPUTING 2021, 221--225. IADIS, 2021.","apa":"Bäumer, F. S., Kersting, J., Denisov, S., & Geierhos, M. (2021). IN OTHER WORDS: A NAIVE APPROACH TO TEXT SPINNING. PROCEEDINGS OF THE INTERNATIONAL CONFERENCES ON WWW/INTERNET 2021 AND APPLIED COMPUTING 2021, 221--225.","ama":"Bäumer FS, Kersting J, Denisov S, Geierhos M. IN OTHER WORDS: A NAIVE APPROACH TO TEXT SPINNING. In: PROCEEDINGS OF THE INTERNATIONAL CONFERENCES ON WWW/INTERNET 2021 AND APPLIED COMPUTING 2021. IADIS; 2021:221--225."},"type":"conference","ddc":["000"],"user_id":"58701","abstract":[{"lang":"eng","text":"Content is the new oil. Users consume billions of terabytes a day while surfing on news sites or blogs, posting on social media sites, and sending chat messages around the globe. While content is heterogeneous, the dominant form of web content is text. There are situations where more diversity needs to be introduced into text content, for example, to reuse it on websites or to allow a chatbot to base its models on the information conveyed rather than of the language used. In order to achieve this, paraphrasing techniques have been developed: One example is Text spinning, a technique that automatically paraphrases text while leaving the intent intact. This makes it easier to reuse content, or to change the language generated by the bot more human. One method for modifying texts is a combination of translation and back-translation. This paper presents NATTS, a naive approach that uses transformer-based translation models to create diversified text, combining translation steps in one model. An advantage of this approach is that it can be fine-tuned and handle technical language."}],"date_created":"2021-10-11T15:26:58Z","status":"public","has_accepted_license":"1","keyword":["Software Requirements","Natural Language Processing","Transfer Learning","On-The-Fly Computing"],"publication":"PROCEEDINGS OF THE INTERNATIONAL CONFERENCES ON WWW/INTERNET 2021 AND APPLIED COMPUTING 2021","file_date_updated":"2021-10-15T15:54:41Z","publisher":"IADIS","author":[{"first_name":"Frederik Simon","full_name":"Bäumer, Frederik Simon","last_name":"Bäumer"},{"first_name":"Joschka","full_name":"Kersting, Joschka","last_name":"Kersting","id":"58701"},{"full_name":"Denisov, Sergej","first_name":"Sergej","last_name":"Denisov"},{"last_name":"Geierhos","id":"42496","first_name":"Michaela","orcid":"0000-0002-8180-5606","full_name":"Geierhos, Michaela"}],"file":[{"relation":"main_file","success":1,"date_updated":"2021-10-15T15:54:41Z","content_type":"application/pdf","file_id":"26282","creator":"jkers","file_size":411667,"access_level":"closed","date_created":"2021-10-15T15:54:41Z","file_name":"Bäumer et al. (2021), Baeumer2021.pdf"}]},{"department":[{"_id":"78"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"publication_status":"published","place":"Paderborn","title":"Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:57:26Z","oa":"1","keyword":["Proof-Carrying Hardware","Formal Verification","Sequential Circuits","Non-Functional Properties","Functional Properties"],"author":[{"id":"3118","last_name":"Wiersema","full_name":"Wiersema, Tobias","first_name":"Tobias"}],"publisher":"Paderborn University","date_created":"2021-10-25T06:35:41Z","status":"public","abstract":[{"text":"Previous research in proof-carrying hardware has established the feasibility and utility of the approach, and provided a concrete solution for employing it for the certification of functional equivalence checking against a specification, but fell short in connecting it to state-of-the-art formal verification insights, methods and tools. Due to the immense complexity of modern circuits, and verification challenges such as the state explosion problem for sequential circuits, this restriction of readily-available verification solutions severely limited the applicability of the approach in wider contexts.\r\n\r\nThis thesis closes the gap between the PCH approach and current advances in formal hardware verification, provides methods and tools to express and certify a wide range of circuit properties, both functional and non-functional, and presents for the first time prototypes in which circuits that are implemented on actual reconfigurable hardware are verified with PCH methods. Using these results, designers can now apply PCH to establish trust in more complex circuits, by using more diverse properties which they can express using modern, efficient property specification techniques.","lang":"eng"},{"lang":"ger","text":"Die bisherige Forschung zu Proof-Carrying Hardware (PCH) hat dessen Machbarkeit und Nützlichkeit gezeigt und einen Ansatz zur Zertifizierung der funktionalen Äquivalenz zu einer Spezifikation geliefert, jedoch ohne PCH mit aktuellen Erkenntnissen, Methoden oder Werkzeugen formaler Hardwareverifikation zu verknüpfen. Aufgrund der Komplexität moderner Schaltungen und Verifikationsherausforderungen wie der Zustandsexplosion bei sequentiellen Schaltungen, limitiert diese Einschränkung sofort verfügbarer Verifikationslösungen die Anwendbarkeit des Ansatzes in einem größeren Kontext signifikant.\r\n\r\nDiese Dissertation schließt die Lücke zwischen PCH und modernen Entwicklungen in der Schaltungsverifikation und stellt Methoden und Werkzeuge zur Verfügung, welche die Zertifizierung einer großen Bandbreite von Schaltungseigenschaften ermöglicht; sowohl funktionale, als auch nicht-funktionale. Überdies werden erstmals Prototypen vorgestellt in welchen Schaltungen mittels PCH verifiziert werden, die auf tatsächlicher rekonfigurierbarer Hardware realisiert sind. Dank dieser Ergebnisse können Entwickler PCH zur Herstellung von Vertrauen in weit komplexere Schaltungen verwenden, unter Zuhilfenahme einer größeren Vielfalt von Eigenschaften, welche durch moderne, effiziente Spezifikationstechniken ausgedrückt werden können."}],"user_id":"3118","ddc":["006"],"main_file_link":[{"open_access":"1","url":"https://nbn-resolving.de/urn:nbn:de:hbz:466:2-39800"}],"supervisor":[{"last_name":"Platzner","id":"398","first_name":"Marco","full_name":"Platzner, Marco"}],"page":"293","citation":{"apa":"Wiersema, T. (2021). Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware. Paderborn University.","ama":"Wiersema T. Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware. Paderborn University; 2021.","chicago":"Wiersema, Tobias. Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware. Paderborn: Paderborn University, 2021.","bibtex":"@book{Wiersema_2021, place={Paderborn}, title={Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware}, publisher={Paderborn University}, author={Wiersema, Tobias}, year={2021} }","mla":"Wiersema, Tobias. Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware. Paderborn University, 2021.","short":"T. Wiersema, Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware, Paderborn University, Paderborn, 2021.","ieee":"T. Wiersema, Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware. Paderborn: Paderborn University, 2021."},"type":"dissertation","year":"2021","_id":"26746"},{"title":"TaintBench: Automatic real-world malware benchmarking of Android taint analyses","publication_identifier":{"issn":["1382-3256","1573-7616"]},"publication_status":"published","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"department":[{"_id":"77"},{"_id":"76"}],"doi":"10.1007/s10664-021-10013-5","oa":"1","date_updated":"2022-01-06T06:57:32Z","language":[{"iso":"eng"}],"ddc":["000"],"user_id":"15249","abstract":[{"text":"Due to the lack of established real-world benchmark suites for static taint analyses of Android applications, evaluations of these analyses are often restricted and hard to compare. Even in evaluations that do use real-world apps, details about the ground truth in those apps are rarely documented, which makes it difficult to compare and reproduce the results. To push Android taint analysis research forward, this paper thus recommends criteria for constructing real-world benchmark suites for this specific domain, and presents TaintBench, the first real-world malware benchmark suite with documented taint flows. TaintBench benchmark apps include taint flows with complex structures, and addresses static challenges that are commonly agreed on by the community. Together with the TaintBench suite, we introduce the TaintBench framework, whose goal is to simplify real-world benchmarking of Android taint analyses. First, a usability test shows that the framework improves experts’ performance and perceived usability when documenting and inspecting taint flows. Second, experiments using TaintBench reveal new insights for the taint analysis tools Amandroid and FlowDroid: (i) They are less effective on real-world malware apps than on synthetic benchmark apps. (ii) Predefined lists of sources and sinks heavily impact the tools’ accuracy. (iii) Surprisingly, up-to-date versions of both tools are less accurate than their predecessors.","lang":"eng"}],"date_created":"2021-11-02T05:13:49Z","status":"public","publication":"Empirical Software Engineering","author":[{"last_name":"Luo","first_name":"Linghui","full_name":"Luo, Linghui"},{"first_name":"Felix","full_name":"Pauck, Felix","last_name":"Pauck","id":"22398"},{"first_name":"Goran","orcid":"0000-0003-4424-5838","full_name":"Piskachev, Goran","last_name":"Piskachev","id":"41936"},{"last_name":"Benz","first_name":"Manuel","full_name":"Benz, Manuel"},{"last_name":"Pashchenko","first_name":"Ivan","full_name":"Pashchenko, Ivan"},{"last_name":"Mory","id":"65667","first_name":"Martin","full_name":"Mory, Martin","orcid":"0000-0001-5609-0031"},{"orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric","first_name":"Eric","id":"59256","last_name":"Bodden"},{"first_name":"Ben","orcid":"0000-0001-9848-2017","full_name":"Hermann, Ben","last_name":"Hermann","id":"66173"},{"last_name":"Massacci","first_name":"Fabio","full_name":"Massacci, Fabio"}],"_id":"27045","year":"2021","citation":{"ieee":"L. Luo et al., “TaintBench: Automatic real-world malware benchmarking of Android taint analyses,” Empirical Software Engineering, 2021, doi: 10.1007/s10664-021-10013-5.","short":"L. Luo, F. Pauck, G. Piskachev, M. Benz, I. Pashchenko, M. Mory, E. Bodden, B. Hermann, F. Massacci, Empirical Software Engineering (2021).","bibtex":"@article{Luo_Pauck_Piskachev_Benz_Pashchenko_Mory_Bodden_Hermann_Massacci_2021, title={TaintBench: Automatic real-world malware benchmarking of Android taint analyses}, DOI={10.1007/s10664-021-10013-5}, journal={Empirical Software Engineering}, author={Luo, Linghui and Pauck, Felix and Piskachev, Goran and Benz, Manuel and Pashchenko, Ivan and Mory, Martin and Bodden, Eric and Hermann, Ben and Massacci, Fabio}, year={2021} }","mla":"Luo, Linghui, et al. “TaintBench: Automatic Real-World Malware Benchmarking of Android Taint Analyses.” Empirical Software Engineering, 2021, doi:10.1007/s10664-021-10013-5.","ama":"Luo L, Pauck F, Piskachev G, et al. TaintBench: Automatic real-world malware benchmarking of Android taint analyses. Empirical Software Engineering. Published online 2021. doi:10.1007/s10664-021-10013-5","apa":"Luo, L., Pauck, F., Piskachev, G., Benz, M., Pashchenko, I., Mory, M., Bodden, E., Hermann, B., & Massacci, F. (2021). TaintBench: Automatic real-world malware benchmarking of Android taint analyses. Empirical Software Engineering. https://doi.org/10.1007/s10664-021-10013-5","chicago":"Luo, Linghui, Felix Pauck, Goran Piskachev, Manuel Benz, Ivan Pashchenko, Martin Mory, Eric Bodden, Ben Hermann, and Fabio Massacci. “TaintBench: Automatic Real-World Malware Benchmarking of Android Taint Analyses.” Empirical Software Engineering, 2021. https://doi.org/10.1007/s10664-021-10013-5."},"type":"journal_article","main_file_link":[{"open_access":"1","url":"https://link.springer.com/content/pdf/10.1007/s10664-021-10013-5.pdf"}]},{"publication_identifier":{"issn":["0162-8828","2160-9292","1939-3539"]},"publication_status":"published","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"date_created":"2021-01-16T14:48:13Z","status":"public","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","keyword":["Automated Machine Learning","Multi Label Classification","Hierarchical Planning","Bayesian Optimization"],"department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"author":[{"last_name":"Wever","id":"33176","first_name":"Marcel Dominik","full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818"},{"id":"38209","last_name":"Tornede","full_name":"Tornede, Alexander","first_name":"Alexander"},{"first_name":"Felix","full_name":"Mohr, Felix","last_name":"Mohr"},{"id":"48129","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"title":"AutoML for Multi-Label Classification: Overview and Empirical Evaluation","user_id":"5786","abstract":[{"text":"Automated machine learning (AutoML) supports the algorithmic construction and data-specific customization of machine learning pipelines, including the selection, combination, and parametrization of machine learning algorithms as main constituents. Generally speaking, AutoML approaches comprise two major components: a search space model and an optimizer for traversing the space. Recent approaches have shown impressive results in the realm of supervised learning, most notably (single-label) classification (SLC). Moreover, first attempts at extending these approaches towards multi-label classification (MLC) have been made. While the space of candidate pipelines is already huge in SLC, the complexity of the search space is raised to an even higher power in MLC. One may wonder, therefore, whether and to what extent optimizers established for SLC can scale to this increased complexity, and how they compare to each other. This paper makes the following contributions: First, we survey existing approaches to AutoML for MLC. Second, we augment these approaches with optimizers not previously tried for MLC. Third, we propose a benchmarking framework that supports a fair and systematic comparison. Fourth, we conduct an extensive experimental study, evaluating the methods on a suite of MLC problems. We find a grammar-based best-first search to compare favorably to other optimizers.","lang":"eng"}],"page":"1-1","year":"2021","citation":{"ama":"Wever MD, Tornede A, Mohr F, Hüllermeier E. AutoML for Multi-Label Classification: Overview and Empirical Evaluation. IEEE Transactions on Pattern Analysis and Machine Intelligence. Published online 2021:1-1. doi:10.1109/tpami.2021.3051276","apa":"Wever, M. D., Tornede, A., Mohr, F., & Hüllermeier, E. (2021). AutoML for Multi-Label Classification: Overview and Empirical Evaluation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1–1. https://doi.org/10.1109/tpami.2021.3051276","chicago":"Wever, Marcel Dominik, Alexander Tornede, Felix Mohr, and Eyke Hüllermeier. “AutoML for Multi-Label Classification: Overview and Empirical Evaluation.” IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021, 1–1. https://doi.org/10.1109/tpami.2021.3051276.","bibtex":"@article{Wever_Tornede_Mohr_Hüllermeier_2021, title={AutoML for Multi-Label Classification: Overview and Empirical Evaluation}, DOI={10.1109/tpami.2021.3051276}, journal={IEEE Transactions on Pattern Analysis and Machine Intelligence}, author={Wever, Marcel Dominik and Tornede, Alexander and Mohr, Felix and Hüllermeier, Eyke}, year={2021}, pages={1–1} }","mla":"Wever, Marcel Dominik, et al. “AutoML for Multi-Label Classification: Overview and Empirical Evaluation.” IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021, pp. 1–1, doi:10.1109/tpami.2021.3051276.","short":"M.D. Wever, A. Tornede, F. Mohr, E. Hüllermeier, IEEE Transactions on Pattern Analysis and Machine Intelligence (2021) 1–1.","ieee":"M. D. Wever, A. Tornede, F. Mohr, and E. Hüllermeier, “AutoML for Multi-Label Classification: Overview and Empirical Evaluation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, pp. 1–1, 2021, doi: 10.1109/tpami.2021.3051276."},"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1109/tpami.2021.3051276","date_updated":"2022-01-06T06:54:42Z","_id":"21004"},{"_id":"21092","date_updated":"2022-01-06T06:54:45Z","citation":{"mla":"Mohr, Felix, et al. “Predicting Machine Learning Pipeline Runtimes in the Context of Automated Machine Learning.” IEEE Transactions on Pattern Analysis and Machine Intelligence, IEEE.","bibtex":"@article{Mohr_Wever_Tornede_Hüllermeier, title={Predicting Machine Learning Pipeline Runtimes in the Context of Automated Machine Learning}, journal={IEEE Transactions on Pattern Analysis and Machine Intelligence}, publisher={IEEE}, author={Mohr, Felix and Wever, Marcel Dominik and Tornede, Alexander and Hüllermeier, Eyke} }","chicago":"Mohr, Felix, Marcel Dominik Wever, Alexander Tornede, and Eyke Hüllermeier. “Predicting Machine Learning Pipeline Runtimes in the Context of Automated Machine Learning.” IEEE Transactions on Pattern Analysis and Machine Intelligence, n.d.","apa":"Mohr, F., Wever, M. D., Tornede, A., & Hüllermeier, E. (n.d.). Predicting Machine Learning Pipeline Runtimes in the Context of Automated Machine Learning. IEEE Transactions on Pattern Analysis and Machine Intelligence.","ama":"Mohr F, Wever MD, Tornede A, Hüllermeier E. Predicting Machine Learning Pipeline Runtimes in the Context of Automated Machine Learning. IEEE Transactions on Pattern Analysis and Machine Intelligence.","ieee":"F. Mohr, M. D. Wever, A. Tornede, and E. Hüllermeier, “Predicting Machine Learning Pipeline Runtimes in the Context of Automated Machine Learning,” IEEE Transactions on Pattern Analysis and Machine Intelligence.","short":"F. Mohr, M.D. Wever, A. Tornede, E. Hüllermeier, IEEE Transactions on Pattern Analysis and Machine Intelligence (n.d.)."},"type":"journal_article","year":"2021","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Automated Machine Learning (AutoML) seeks to automatically find so-called machine learning pipelines that maximize the prediction performance when being used to train a model on a given dataset. One of the main and yet open challenges in AutoML is an effective use of computational resources: An AutoML process involves the evaluation of many candidate pipelines, which are costly but often ineffective because they are canceled due to a timeout.\r\nIn this paper, we present an approach to predict the runtime of two-step machine learning pipelines with up to one pre-processor, which can be used to anticipate whether or not a pipeline will time out. Separate runtime models are trained offline for each algorithm that may be used in a pipeline, and an overall prediction is derived from these models. We empirically show that the approach increases successful evaluations made by an AutoML tool while preserving or even improving on the previously best solutions."}],"title":"Predicting Machine Learning Pipeline Runtimes in the Context of Automated Machine Learning","user_id":"5786","author":[{"last_name":"Mohr","full_name":"Mohr, Felix","first_name":"Felix"},{"last_name":"Wever","id":"33176","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik"},{"last_name":"Tornede","id":"38209","first_name":"Alexander","full_name":"Tornede, Alexander"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","id":"48129"}],"publisher":"IEEE","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","publication_status":"accepted","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"date_created":"2021-01-27T13:45:52Z"},{"language":[{"iso":"eng"}],"type":"conference","citation":{"mla":"Tornede, Tanja, et al. “Coevolution of Remaining Useful Lifetime Estimation Pipelines for Automated Predictive Maintenance.” Proceedings of the Genetic and Evolutionary Computation Conference, 2021.","bibtex":"@inproceedings{Tornede_Tornede_Wever_Hüllermeier_2021, title={Coevolution of Remaining Useful Lifetime Estimation Pipelines for Automated Predictive Maintenance}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, author={Tornede, Tanja and Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2021} }","chicago":"Tornede, Tanja, Alexander Tornede, Marcel Dominik Wever, and Eyke Hüllermeier. “Coevolution of Remaining Useful Lifetime Estimation Pipelines for Automated Predictive Maintenance.” In Proceedings of the Genetic and Evolutionary Computation Conference, 2021.","ama":"Tornede T, Tornede A, Wever MD, Hüllermeier E. Coevolution of Remaining Useful Lifetime Estimation Pipelines for Automated Predictive Maintenance. In: Proceedings of the Genetic and Evolutionary Computation Conference. ; 2021.","apa":"Tornede, T., Tornede, A., Wever, M. D., & Hüllermeier, E. (2021). Coevolution of Remaining Useful Lifetime Estimation Pipelines for Automated Predictive Maintenance. Proceedings of the Genetic and Evolutionary Computation Conference. Genetic and Evolutionary Computation Conference.","ieee":"T. Tornede, A. Tornede, M. D. Wever, and E. Hüllermeier, “Coevolution of Remaining Useful Lifetime Estimation Pipelines for Automated Predictive Maintenance,” presented at the Genetic and Evolutionary Computation Conference, 2021.","short":"T. Tornede, A. Tornede, M.D. Wever, E. Hüllermeier, in: Proceedings of the Genetic and Evolutionary Computation Conference, 2021."},"year":"2021","_id":"21570","date_updated":"2022-01-06T06:55:06Z","conference":{"end_date":"2021-07-14","start_date":"2021-07-10","name":"Genetic and Evolutionary Computation Conference"},"author":[{"full_name":"Tornede, Tanja","first_name":"Tanja","id":"40795","last_name":"Tornede"},{"id":"38209","last_name":"Tornede","full_name":"Tornede, Alexander","first_name":"Alexander"},{"id":"33176","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik"},{"id":"48129","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"status":"public","date_created":"2021-03-26T09:14:19Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"user_id":"5786","title":"Coevolution of Remaining Useful Lifetime Estimation Pipelines for Automated Predictive Maintenance"},{"file_date_updated":"2021-04-08T08:14:05Z","publication":"Natural Language Processing in Artificial Intelligence -- NLPinAI 2020","publisher":"Springer","author":[{"id":"58701","last_name":"Kersting","full_name":"Kersting, Joschka","first_name":"Joschka"},{"last_name":"Geierhos","id":"42496","first_name":"Michaela","orcid":"0000-0002-8180-5606","full_name":"Geierhos, Michaela"}],"file":[{"access_level":"closed","file_name":"Kersting-Geierhos2021_Chapter_TowardsAspectExtractionAndClas.pdf","date_created":"2021-04-08T08:14:05Z","content_type":"application/pdf","date_updated":"2021-04-08T08:14:05Z","success":1,"relation":"main_file","file_size":512065,"creator":"jkers","file_id":"21594"}],"volume":939,"date_created":"2020-08-13T09:29:52Z","status":"public","has_accepted_license":"1","abstract":[{"text":"This chapter concentrates on aspect-based sentiment analysis, a form of opinion mining where algorithms detect sentiments expressed about features of products, services, etc. We especially focus on novel approaches for aspect phrase extraction and classification trained on feature-rich datasets. Here, we present two new datasets, which we gathered from the linguistically rich domain of physician reviews, as other investigations have mainly concentrated on commercial reviews and social media reviews so far. To give readers a better understanding of the underlying datasets, we describe the annotation process and inter-annotator agreement in detail. In our research, we automatically assess implicit mentions or indications of specific aspects. To do this, we propose and utilize neural network models that perform the here-defined aspect phrase extraction and classification task, achieving F1-score values of about 80% and accuracy values of more than 90%. As we apply our models to a comparatively complex domain, we obtain promising results. ","lang":"eng"}],"ddc":["000"],"user_id":"58701","page":"163--189 ","type":"book_chapter","year":"2021","citation":{"ieee":"J. Kersting and M. Geierhos, “Towards Aspect Extraction and Classification for Opinion Mining with Deep Sequence Networks,” in Natural Language Processing in Artificial Intelligence -- NLPinAI 2020, vol. 939, R. Loukanova, Ed. Cham: Springer, 2021, pp. 163--189.","short":"J. Kersting, M. Geierhos, in: R. Loukanova (Ed.), Natural Language Processing in Artificial Intelligence -- NLPinAI 2020, Springer, Cham, 2021, pp. 163--189.","bibtex":"@inbook{Kersting_Geierhos_2021, place={Cham}, series={Studies in Computational Intelligence (SCI)}, title={Towards Aspect Extraction and Classification for Opinion Mining with Deep Sequence Networks}, volume={939}, DOI={10.1007/978-3-030-63787-3_6}, booktitle={Natural Language Processing in Artificial Intelligence -- NLPinAI 2020}, publisher={Springer}, author={Kersting, Joschka and Geierhos, Michaela}, editor={Loukanova, RoussankaEditor}, year={2021}, pages={163--189}, collection={Studies in Computational Intelligence (SCI)} }","mla":"Kersting, Joschka, and Michaela Geierhos. “Towards Aspect Extraction and Classification for Opinion Mining with Deep Sequence Networks.” Natural Language Processing in Artificial Intelligence -- NLPinAI 2020, edited by Roussanka Loukanova, vol. 939, Springer, 2021, pp. 163--189, doi:10.1007/978-3-030-63787-3_6.","chicago":"Kersting, Joschka, and Michaela Geierhos. “Towards Aspect Extraction and Classification for Opinion Mining with Deep Sequence Networks.” In Natural Language Processing in Artificial Intelligence -- NLPinAI 2020, edited by Roussanka Loukanova, 939:163--189. Studies in Computational Intelligence (SCI). Cham: Springer, 2021. https://doi.org/10.1007/978-3-030-63787-3_6.","ama":"Kersting J, Geierhos M. Towards Aspect Extraction and Classification for Opinion Mining with Deep Sequence Networks. In: Loukanova R, ed. Natural Language Processing in Artificial Intelligence -- NLPinAI 2020. Vol 939. Studies in Computational Intelligence (SCI). Cham: Springer; 2021:163--189. doi:10.1007/978-3-030-63787-3_6","apa":"Kersting, J., & Geierhos, M. (2021). Towards Aspect Extraction and Classification for Opinion Mining with Deep Sequence Networks. In R. Loukanova (Ed.), Natural Language Processing in Artificial Intelligence -- NLPinAI 2020 (Vol. 939, pp. 163--189). Cham: Springer. https://doi.org/10.1007/978-3-030-63787-3_6"},"intvolume":" 939","_id":"17905","department":[{"_id":"579"}],"publication_identifier":{"unknown":["978-3-030-63786-6 ; 978-3-030-63787-3"]},"publication_status":"published","editor":[{"first_name":"Roussanka","full_name":"Loukanova, Roussanka","last_name":"Loukanova"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B1","_id":"9"}],"place":"Cham","title":"Towards Aspect Extraction and Classification for Opinion Mining with Deep Sequence Networks","series_title":"Studies in Computational Intelligence (SCI)","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:23Z","doi":"10.1007/978-3-030-63787-3_6"},{"place":"Paderborn","title":"Android App Analysis Benchmark Case Generation","department":[{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"date_updated":"2022-01-06T06:55:31Z","oa":"1","language":[{"iso":"eng"}],"extern":"1","ddc":["000"],"user_id":"477","file_date_updated":"2021-06-09T06:01:45Z","author":[{"first_name":"Stefan","full_name":"Schott, Stefan","last_name":"Schott","id":"54847"}],"file":[{"date_created":"2021-06-09T06:01:45Z","file_name":"Masters_Thesis_Stefan_Schott_unsigned.pdf","access_level":"open_access","file_size":1918444,"creator":"fpauck","file_id":"22305","content_type":"application/pdf","date_updated":"2021-06-09T06:01:45Z","relation":"main_file"}],"date_created":"2021-06-09T06:04:12Z","status":"public","has_accepted_license":"1","_id":"22304","citation":{"short":"S. Schott, Android App Analysis Benchmark Case Generation, Paderborn, 2021.","ieee":"S. Schott, Android App Analysis Benchmark Case Generation. Paderborn, 2021.","chicago":"Schott, Stefan. Android App Analysis Benchmark Case Generation. Paderborn, 2021.","apa":"Schott, S. (2021). Android App Analysis Benchmark Case Generation. Paderborn.","ama":"Schott S. Android App Analysis Benchmark Case Generation. Paderborn; 2021.","mla":"Schott, Stefan. Android App Analysis Benchmark Case Generation. 2021.","bibtex":"@book{Schott_2021, place={Paderborn}, title={Android App Analysis Benchmark Case Generation}, author={Schott, Stefan}, year={2021} }"},"year":"2021","type":"mastersthesis","supervisor":[{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}]},{"type":"conference","citation":{"mla":"Hüllermeier, Eyke, et al. Automated Machine Learning, Bounded Rationality, and Rational Metareasoning. 2021.","bibtex":"@inproceedings{Hüllermeier_Mohr_Tornede_Wever_2021, title={Automated Machine Learning, Bounded Rationality, and Rational Metareasoning}, author={Hüllermeier, Eyke and Mohr, Felix and Tornede, Alexander and Wever, Marcel Dominik}, year={2021} }","chicago":"Hüllermeier, Eyke, Felix Mohr, Alexander Tornede, and Marcel Dominik Wever. “Automated Machine Learning, Bounded Rationality, and Rational Metareasoning,” 2021.","apa":"Hüllermeier, E., Mohr, F., Tornede, A., & Wever, M. D. (2021). Automated Machine Learning, Bounded Rationality, and Rational Metareasoning. ECML/PKDD Workshop on Automating Data Science, Bilbao (Virtual).","ama":"Hüllermeier E, Mohr F, Tornede A, Wever MD. Automated Machine Learning, Bounded Rationality, and Rational Metareasoning. In: ; 2021.","ieee":"E. Hüllermeier, F. Mohr, A. Tornede, and M. D. Wever, “Automated Machine Learning, Bounded Rationality, and Rational Metareasoning,” presented at the ECML/PKDD Workshop on Automating Data Science, Bilbao (Virtual), 2021.","short":"E. Hüllermeier, F. Mohr, A. Tornede, M.D. Wever, in: 2021."},"year":"2021","language":[{"iso":"eng"}],"conference":{"location":"Bilbao (Virtual)","start_date":"2021-09-13","name":"ECML/PKDD Workshop on Automating Data Science","end_date":"2021-09-17"},"date_updated":"2022-01-06T06:55:43Z","_id":"22913","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"author":[{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","id":"48129","last_name":"Hüllermeier"},{"first_name":"Felix","full_name":"Mohr, Felix","last_name":"Mohr"},{"last_name":"Tornede","id":"38209","first_name":"Alexander","full_name":"Tornede, Alexander"},{"last_name":"Wever","id":"33176","first_name":"Marcel Dominik","full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818"}],"quality_controlled":"1","date_created":"2021-08-02T07:46:29Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"status":"public","title":"Automated Machine Learning, Bounded Rationality, and Rational Metareasoning","user_id":"5786"},{"date_updated":"2022-01-06T06:55:43Z","_id":"22927","type":"conference","citation":{"apa":"Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., & Wehrheim, H. (n.d.). On Strong Observational Refinement and Forward Simulation. In Proceedings of the 35th International Symposium on Distributed Computing (DISC). Schloß Dagstuhl.","ama":"Derrick J, Doherty S, Dongol B, Schellhorn G, Wehrheim H. On Strong Observational Refinement and Forward Simulation. In: Proceedings of the 35th International Symposium on Distributed Computing (DISC). Leibniz International Proceedings in Informatics. Schloß Dagstuhl.","chicago":"Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim. “On Strong Observational Refinement and Forward Simulation.” In Proceedings of the 35th International Symposium on Distributed Computing (DISC). Leibniz International Proceedings in Informatics. Schloß Dagstuhl, n.d.","bibtex":"@inproceedings{Derrick_Doherty_Dongol_Schellhorn_Wehrheim, series={Leibniz International Proceedings in Informatics}, title={On Strong Observational Refinement and Forward Simulation}, booktitle={Proceedings of the 35th International Symposium on Distributed Computing (DISC)}, publisher={Schloß Dagstuhl}, author={Derrick, John and Doherty, Simon and Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim, Heike}, collection={Leibniz International Proceedings in Informatics} }","mla":"Derrick, John, et al. “On Strong Observational Refinement and Forward Simulation.” Proceedings of the 35th International Symposium on Distributed Computing (DISC), Schloß Dagstuhl.","short":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, H. Wehrheim, in: Proceedings of the 35th International Symposium on Distributed Computing (DISC), Schloß Dagstuhl, n.d.","ieee":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, and H. Wehrheim, “On Strong Observational Refinement and Forward Simulation,” in Proceedings of the 35th International Symposium on Distributed Computing (DISC)."},"year":"2021","language":[{"iso":"eng"}],"series_title":"Leibniz International Proceedings in Informatics","title":"On Strong Observational Refinement and Forward Simulation","user_id":"477","publication_status":"accepted","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"date_created":"2021-08-03T07:38:56Z","status":"public","publication":"Proceedings of the 35th International Symposium on Distributed Computing (DISC)","department":[{"_id":"7"}],"author":[{"last_name":"Derrick","full_name":"Derrick, John","first_name":"John"},{"last_name":"Doherty","first_name":"Simon","full_name":"Doherty, Simon"},{"full_name":"Dongol, Brijesh","first_name":"Brijesh","last_name":"Dongol"},{"last_name":"Schellhorn","first_name":"Gerhard","full_name":"Schellhorn, Gerhard"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"publisher":"Schloß Dagstuhl"},{"page":"275--284","type":"conference","citation":{"ieee":"J. Kersting and M. Geierhos, “Well-being in Plastic Surgery: Deep Learning Reveals Patients’ Evaluations,” in Proceedings of the 10th International Conference on Data Science, Technology and Applications (DATA 2021), Online, 2021, pp. 275--284.","short":"J. Kersting, M. Geierhos, in: Proceedings of the 10th International Conference on Data Science, Technology and Applications (DATA 2021), SCITEPRESS, Online, 2021, pp. 275--284.","mla":"Kersting, Joschka, and Michaela Geierhos. “Well-Being in Plastic Surgery: Deep Learning Reveals Patients’ Evaluations.” Proceedings of the 10th International Conference on Data Science, Technology and Applications (DATA 2021), SCITEPRESS, 2021, pp. 275--284.","bibtex":"@inproceedings{Kersting_Geierhos_2021, place={Online}, title={Well-being in Plastic Surgery: Deep Learning Reveals Patients’ Evaluations}, booktitle={Proceedings of the 10th International Conference on Data Science, Technology and Applications (DATA 2021)}, publisher={SCITEPRESS}, author={Kersting, Joschka and Geierhos, Michaela}, year={2021}, pages={275--284} }","ama":"Kersting J, Geierhos M. Well-being in Plastic Surgery: Deep Learning Reveals Patients’ Evaluations. In: Proceedings of the 10th International Conference on Data Science, Technology and Applications (DATA 2021). SCITEPRESS; 2021:275--284.","apa":"Kersting, J., & Geierhos, M. (2021). Well-being in Plastic Surgery: Deep Learning Reveals Patients’ Evaluations. Proceedings of the 10th International Conference on Data Science, Technology and Applications (DATA 2021), 275--284.","chicago":"Kersting, Joschka, and Michaela Geierhos. “Well-Being in Plastic Surgery: Deep Learning Reveals Patients’ Evaluations.” In Proceedings of the 10th International Conference on Data Science, Technology and Applications (DATA 2021), 275--284. Online: SCITEPRESS, 2021."},"year":"2021","language":[{"iso":"eng"}],"conference":{"end_date":"2021-07-08","start_date":"2021-07-06","name":"10th International Conference on Data Science, Technology and Applications (DATA 2021)","location":"Online"},"date_updated":"2022-01-06T06:55:23Z","_id":"22051","department":[{"_id":"579"}],"publication":"Proceedings of the 10th International Conference on Data Science, Technology and Applications (DATA 2021)","publisher":"SCITEPRESS","author":[{"id":"58701","last_name":"Kersting","full_name":"Kersting, Joschka","first_name":"Joschka"},{"first_name":"Michaela","full_name":"Geierhos, Michaela","orcid":"0000-0002-8180-5606","last_name":"Geierhos","id":"42496"}],"publication_status":"published","date_created":"2021-05-07T16:27:27Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"9","name":"SFB 901 - Subproject B1"}],"status":"public","place":"Online","title":"Well-being in Plastic Surgery: Deep Learning Reveals Patients' Evaluations","user_id":"58701"},{"doi":"10.1007/978-3-030-79025-7_4","conference":{"location":"Virtual conference","name":"International Symposium on Applied Reconfigurable Computing","start_date":"2021-06-29","end_date":"2021-07-01"},"_id":"21953","date_updated":"2022-02-14T11:03:09Z","language":[{"iso":"eng"}],"type":"conference","citation":{"mla":"Witschen, Linus Matthias, et al. “Timing Optimization for Virtual FPGA Configurations.” Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21), edited by Frank Hannig et al., Springer Lecture Notes in Computer Science, doi:10.1007/978-3-030-79025-7_4.","bibtex":"@inproceedings{Witschen_Wiersema_Raeisi Nafchi_Bockhorn_Platzner, series={Reconfigurable Computing: Architectures, Tools, and Applications}, title={Timing Optimization for Virtual FPGA Configurations}, DOI={10.1007/978-3-030-79025-7_4}, booktitle={Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21)}, publisher={Springer Lecture Notes in Computer Science}, author={Witschen, Linus Matthias and Wiersema, Tobias and Raeisi Nafchi, Masood and Bockhorn, Arne and Platzner, Marco}, editor={Hannig, Frank and Derrien, Steven and Diniz, Pedro and Chillet, Daniel}, collection={Reconfigurable Computing: Architectures, Tools, and Applications} }","apa":"Witschen, L. M., Wiersema, T., Raeisi Nafchi, M., Bockhorn, A., & Platzner, M. (n.d.). Timing Optimization for Virtual FPGA Configurations. In F. Hannig, S. Derrien, P. Diniz, & D. Chillet (Eds.), Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21). Springer Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-79025-7_4","ama":"Witschen LM, Wiersema T, Raeisi Nafchi M, Bockhorn A, Platzner M. Timing Optimization for Virtual FPGA Configurations. In: Hannig F, Derrien S, Diniz P, Chillet D, eds. Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21). Reconfigurable Computing: Architectures, Tools, and Applications. Springer Lecture Notes in Computer Science. doi:10.1007/978-3-030-79025-7_4","chicago":"Witschen, Linus Matthias, Tobias Wiersema, Masood Raeisi Nafchi, Arne Bockhorn, and Marco Platzner. “Timing Optimization for Virtual FPGA Configurations.” In Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21), edited by Frank Hannig, Steven Derrien, Pedro Diniz, and Daniel Chillet. Reconfigurable Computing: Architectures, Tools, and Applications. Springer Lecture Notes in Computer Science, n.d. https://doi.org/10.1007/978-3-030-79025-7_4.","ieee":"L. M. Witschen, T. Wiersema, M. Raeisi Nafchi, A. Bockhorn, and M. Platzner, “Timing Optimization for Virtual FPGA Configurations,” in Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21), Virtual conference, doi: 10.1007/978-3-030-79025-7_4.","short":"L.M. Witschen, T. Wiersema, M. Raeisi Nafchi, A. Bockhorn, M. Platzner, in: F. Hannig, S. Derrien, P. Diniz, D. Chillet (Eds.), Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21), Springer Lecture Notes in Computer Science, n.d."},"year":"2021","series_title":"Reconfigurable Computing: Architectures, Tools, and Applications","user_id":"3118","title":"Timing Optimization for Virtual FPGA Configurations","project":[{"_id":"1","name":"SFB 901"},{"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"}],"date_created":"2021-05-04T14:18:46Z","status":"public","publication_status":"accepted","editor":[{"first_name":"Frank","full_name":"Hannig, Frank","last_name":"Hannig"},{"first_name":"Steven","full_name":"Derrien, Steven","last_name":"Derrien"},{"full_name":"Diniz, Pedro","first_name":"Pedro","last_name":"Diniz"},{"last_name":"Chillet","full_name":"Chillet, Daniel","first_name":"Daniel"}],"department":[{"_id":"78"}],"publication":"Proceedings of International Symposium on Applied Reconfigurable Computing (ARC'21)","publisher":"Springer Lecture Notes in Computer Science","author":[{"last_name":"Witschen","id":"49051","first_name":"Linus Matthias","full_name":"Witschen, Linus Matthias"},{"id":"3118","last_name":"Wiersema","full_name":"Wiersema, Tobias","first_name":"Tobias"},{"full_name":"Raeisi Nafchi, Masood","first_name":"Masood","last_name":"Raeisi Nafchi"},{"last_name":"Bockhorn","full_name":"Bockhorn, Arne","first_name":"Arne"},{"first_name":"Marco","full_name":"Platzner, Marco","last_name":"Platzner","id":"398"}]},{"author":[{"id":"60543","last_name":"Schubert","full_name":"Schubert, Philipp","orcid":"0000-0002-8674-1859","first_name":"Philipp"},{"last_name":"Hermann","id":"66173","first_name":"Ben","orcid":"0000-0001-9848-2017","full_name":"Hermann, Ben"},{"first_name":"Eric","full_name":"Bodden, Eric","orcid":"0000-0003-3470-3647","last_name":"Bodden","id":"59256"}],"department":[{"_id":"76"}],"publication":"European Conference on Object-Oriented Programming (ECOOP)","status":"public","date_created":"2021-04-08T11:24:59Z","project":[{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901"}],"abstract":[{"text":"Static analysis is used to automatically detect bugs and security breaches, and aids compileroptimization. Whole-program analysis (WPA) can yield high precision, however causes long analysistimes and thus does not match common software-development workflows, making it often impracticalto use for large, real-world applications.This paper thus presents the design and implementation ofModAlyzer, a novel static-analysisapproach that aims at accelerating whole-program analysis by making the analysis modular andcompositional. It shows how to computelossless, persisted summaries for callgraph, points-to anddata-flow information, and it reports under which circumstances this function-level compositionalanalysis outperforms WPA.We implementedModAlyzeras an extension to LLVM and PhASAR, and applied it to 12 real-world C and C++ applications. At analysis time,ModAlyzermodularly and losslessly summarizesthe analysis effect of the library code those applications share, hence avoiding its repeated re-analysis.The experimental results show that the reuse of these summaries can save, on average, 72% ofanalysis time over WPA. Moreover, because it is lossless, the module-wise analysis fully retainsprecision and recall. Surprisingly, as our results show, it sometimes even yields precision superior toWPA. The initial summary generation, on average, takes about 3.67 times as long as WPA.","lang":"eng"}],"user_id":"60543","title":"Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis","main_file_link":[{"open_access":"1","url":"https://drops.dagstuhl.de/opus/volltexte/2021/14045/"}],"language":[{"iso":"eng"}],"type":"conference","citation":{"bibtex":"@inproceedings{Schubert_Hermann_Bodden_2021, title={Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis}, booktitle={European Conference on Object-Oriented Programming (ECOOP)}, author={Schubert, Philipp and Hermann, Ben and Bodden, Eric}, year={2021} }","mla":"Schubert, Philipp, et al. “Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis.” European Conference on Object-Oriented Programming (ECOOP), 2021.","ieee":"P. Schubert, B. Hermann, and E. Bodden, “Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis,” 2021.","chicago":"Schubert, Philipp, Ben Hermann, and Eric Bodden. “Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis.” In European Conference on Object-Oriented Programming (ECOOP), 2021.","ama":"Schubert P, Hermann B, Bodden E. Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis. In: European Conference on Object-Oriented Programming (ECOOP). ; 2021.","apa":"Schubert, P., Hermann, B., & Bodden, E. (2021). Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis. European Conference on Object-Oriented Programming (ECOOP).","short":"P. Schubert, B. Hermann, E. Bodden, in: European Conference on Object-Oriented Programming (ECOOP), 2021."},"year":"2021","date_updated":"2022-03-25T07:49:35Z","_id":"21598","oa":"1"}]