--- _id: '35426' author: - first_name: Cedric full_name: Richter, Cedric id: '50003' last_name: Richter - first_name: Jan Frederik full_name: Haltermann, Jan Frederik id: '44413' last_name: Haltermann - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Felix full_name: Pauck, Felix id: '22398' last_name: Pauck - first_name: Stefan full_name: Schott, Stefan id: '54847' last_name: Schott - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: 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' 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 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} }' 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. 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.' 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. 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.' date_created: 2023-01-09T06:28:44Z date_updated: 2023-01-19T13:50:18Z department: - _id: '77' doi: 10.1145/3551349.3561156 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1145/3551349.3561156 oa: '1' 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' publication: 37th IEEE/ACM International Conference on Automated Software Engineering publication_status: published publisher: ACM status: public title: Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs? type: conference user_id: '477' year: '2023' ... --- _id: '35427' author: - first_name: Felix full_name: Pauck, Felix id: '22398' last_name: Pauck citation: 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 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} }' 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.' mla: Pauck, Felix. “Scaling Arbitrary Android App Analyses.” 37th IEEE/ACM International Conference on Automated Software Engineering, ACM, 2023, doi:10.1145/3551349.3561339. short: 'F. Pauck, in: 37th IEEE/ACM International Conference on Automated Software Engineering, ACM, 2023.' date_created: 2023-01-09T06:32:33Z date_updated: 2023-01-19T13:49:52Z department: - _id: '77' doi: 10.1145/3551349.3561339 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1145/3551349.3561339 oa: '1' 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' publication: 37th IEEE/ACM International Conference on Automated Software Engineering publication_status: published publisher: ACM status: public title: Scaling Arbitrary Android App Analyses type: conference user_id: '477' year: '2023' ... --- _id: '44194' author: - first_name: Qazi Arbab full_name: Ahmed, Qazi Arbab id: '72764' last_name: Ahmed orcid: 0000-0002-1837-2254 - first_name: Muhammad full_name: Awais, Muhammad last_name: Awais - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: 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.' 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} }' 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.' 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.' short: 'Q.A. Ahmed, M. Awais, M. Platzner, in: The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA, 2023.' conference: end_date: 2023-04-07 location: San Fransico CA 94023-0607, USA name: The 24th International Symposium on Quality Electronic Design (ISQED'23) start_date: 2023-04-05 date_created: 2023-04-26T13:04:56Z date_updated: 2023-05-10T13:52:14Z ddc: - '620' department: - _id: '78' file: - access_level: open_access content_type: application/pdf creator: qazi date_created: 2023-04-26T13:03:54Z date_updated: 2023-05-10T13:52:14Z file_id: '44196' file_name: s4Bp4-041.pdf file_size: 614626 relation: main_file file_date_updated: 2023-05-10T13:52:14Z has_accepted_license: '1' language: - iso: eng oa: '1' 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' publication: The 24th International Symposium on Quality Electronic Design (ISQED'23), San Francisco, Califorina USA status: public title: 'MAAS: Hiding Trojans in Approximate Circuits' type: conference user_id: '72764' year: '2023' ... --- _id: '43108' author: - first_name: Felix full_name: Pauck, Felix id: '22398' last_name: Pauck citation: 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 bibtex: '@book{Pauck_2023, title={Cooperative Android App Analysis}, DOI={10.17619/UNIPB/1-1698}, publisher={Paderborn University}, author={Pauck, Felix}, year={2023} }' chicago: Pauck, Felix. Cooperative Android App Analysis. Paderborn University, 2023. https://doi.org/10.17619/UNIPB/1-1698. ieee: F. Pauck, Cooperative Android App Analysis. Paderborn University, 2023. mla: Pauck, Felix. Cooperative Android App Analysis. Paderborn University, 2023, doi:10.17619/UNIPB/1-1698. short: F. Pauck, Cooperative Android App Analysis, Paderborn University, 2023. date_created: 2023-03-27T07:39:35Z date_updated: 2023-05-22T04:57:42Z department: - _id: '77' doi: 10.17619/UNIPB/1-1698 language: - iso: eng 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' publisher: Paderborn University status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim title: Cooperative Android App Analysis type: dissertation user_id: '22398' year: '2023' ... --- _id: '44323' abstract: - lang: eng 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." author: - first_name: Joschka full_name: Kersting, Joschka id: '58701' last_name: Kersting citation: ama: Kersting J. Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining. 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 . 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} }' chicago: 'Kersting, Joschka. Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining. Neubiberg: Universität der Bundeswehr München , 2023.' ieee: 'J. Kersting, Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining. Neubiberg: Universität der Bundeswehr München , 2023.' mla: Kersting, Joschka. Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining. Universität der Bundeswehr München , 2023. short: J. Kersting, Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining, Universität der Bundeswehr München , Neubiberg, 2023. date_created: 2023-05-02T12:54:00Z date_updated: 2023-07-03T12:29:50Z department: - _id: '579' - _id: '7' language: - iso: ger page: '208' place: Neubiberg project: - _id: '1' grant_number: '160364472' name: 'SFB 901: SFB 901' - _id: '3' name: 'SFB 901 - B: SFB 901 - Project Area B' - _id: '9' grant_number: '160364472' name: 'SFB 901 - B1: SFB 901 - Subproject B1' publication_status: published publisher: 'Universität der Bundeswehr München ' related_material: link: - relation: supplementary_material url: https://athene-forschung.unibw.de/145003 status: public supervisor: - first_name: Michaela full_name: Geierhos, Michaela id: '42496' last_name: Geierhos orcid: 0000-0002-8180-5606 title: Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining type: dissertation user_id: '58701' year: '2023' ... --- _id: '45888' author: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner - first_name: Eric full_name: Bodden, Eric id: '59256' last_name: Bodden orcid: 0000-0003-3470-3647 - first_name: 'Philipp ' full_name: 'Schubert, Philipp ' last_name: Schubert - first_name: Felix full_name: Pauck, Felix id: '22398' last_name: Pauck - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs citation: 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 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} }' 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.' 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.' 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. 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.' date_created: 2023-07-07T08:01:23Z date_updated: 2023-07-07T11:18:59Z ddc: - '004' department: - _id: '7' doi: 10.5281/zenodo.8068583 editor: - first_name: Claus-Jochen full_name: Haake, Claus-Jochen last_name: Haake - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm last_name: Meyer auf der Heide - first_name: Marco full_name: Platzner, Marco last_name: Platzner - first_name: Henning full_name: Wachsmuth, Henning last_name: Wachsmuth - first_name: Heike full_name: Wehrheim, Heike last_name: Wehrheim file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2023-07-07T08:01:12Z date_updated: 2023-07-07T11:18:59Z file_id: '45889' file_name: B4-Chapter-SFB-Buch-Final.pdf file_size: 840964 relation: main_file file_date_updated: 2023-07-07T11:18:59Z has_accepted_license: '1' intvolume: ' 412' language: - iso: eng oa: '1' page: 125-144 place: Paderborn 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' - _id: '12' name: 'SFB 901 - B4: SFB 901 - Subproject B4' publication: On-The-Fly Computing -- Individualized IT-services in dynamic markets publisher: Heinz Nixdorf Institut, Universität Paderborn series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts status: public title: Verifying Software and Reconfigurable Hardware Services type: book_chapter user_id: '477' volume: 412 year: '2023' ... --- _id: '45882' author: - first_name: Frederik Simon full_name: Bäumer, Frederik Simon id: '38837' last_name: Bäumer - first_name: Wei-Fan full_name: Chen, Wei-Fan id: '82920' last_name: Chen - first_name: Michaela full_name: Geierhos, Michaela id: '42496' last_name: Geierhos orcid: 0000-0002-8180-5606 - first_name: Joschka full_name: Kersting, Joschka id: '58701' last_name: Kersting - first_name: Henning full_name: Wachsmuth, Henning last_name: Wachsmuth citation: 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 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} }' 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.' 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.' 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. 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.' date_created: 2023-07-07T07:29:13Z date_updated: 2023-07-07T11:20:52Z ddc: - '004' department: - _id: '7' - _id: '369' doi: 10.5281/zenodo.8068456 editor: - first_name: Claus-Jochen full_name: Haake, Claus-Jochen last_name: Haake - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm last_name: Meyer auf der Heide - first_name: Marco full_name: Platzner, Marco last_name: Platzner - first_name: Henning full_name: Wachsmuth, Henning last_name: Wachsmuth - first_name: Heike full_name: Wehrheim, Heike last_name: Wehrheim file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2023-07-07T07:28:58Z date_updated: 2023-07-07T11:20:52Z file_id: '45883' file_name: B1-Chapter-SFB-Buch-Final.pdf file_size: 1342718 relation: main_file file_date_updated: 2023-07-07T11:20:52Z has_accepted_license: '1' intvolume: ' 412' language: - iso: eng oa: '1' page: 65-84 place: Paderborn 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' - _id: '9' grant_number: '160364472' name: 'SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)' publication: On-The-Fly Computing -- Individualized IT-services in dynamic markets publisher: Heinz Nixdorf Institut, Universität Paderborn series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts status: public title: Dialogue-based Requirement Compensation and Style-adjusted Data-to-text Generation type: book_chapter user_id: '477' volume: 412 year: '2023' ... --- _id: '45884' author: - first_name: Jonas Manuel full_name: Hanselle, Jonas Manuel id: '43980' last_name: Hanselle orcid: 0000-0002-1231-4985 - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier - first_name: Felix full_name: Mohr, Felix last_name: Mohr - first_name: Axel-Cyrille full_name: Ngonga Ngomo, Axel-Cyrille id: '65716' last_name: Ngonga Ngomo - first_name: Mohamed full_name: Sherif, Mohamed id: '67234' last_name: Sherif orcid: https://orcid.org/0000-0002-9927-2203 - first_name: Alexander full_name: Tornede, Alexander id: '38209' last_name: Tornede - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' citation: 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 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.' 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.' 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. 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.' date_created: 2023-07-07T07:50:53Z date_updated: 2023-07-07T11:20:12Z ddc: - '040' department: - _id: '7' doi: 10.5281/zenodo.8068466 editor: - first_name: Claus-Jochen full_name: Haake, Claus-Jochen last_name: Haake - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm last_name: Meyer auf der Heide - first_name: Marco full_name: Platzner, Marco last_name: Platzner - first_name: Henning full_name: Wachsmuth, Henning last_name: Wachsmuth - first_name: Heike full_name: Wehrheim, Heike last_name: Wehrheim file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2023-07-07T07:50:34Z date_updated: 2023-07-07T11:20:11Z file_id: '45885' file_name: B2-Chapter-SFB-Buch-Final.pdf file_size: 895091 relation: main_file file_date_updated: 2023-07-07T11:20:11Z has_accepted_license: '1' intvolume: ' 412' language: - iso: eng oa: '1' page: 85-104 place: Paderborn 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' - _id: '10' grant_number: '160364472' name: 'SFB 901 - B2: Konfiguration und Bewertung (B02)' publication: On-The-Fly Computing -- Individualized IT-services in dynamic markets publisher: Heinz Nixdorf Institut, Universität Paderborn series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts status: public title: Configuration and Evaluation type: book_chapter user_id: '477' volume: 412 year: '2023' ... --- _id: '45886' author: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier - first_name: Steffen full_name: Becker, Steffen last_name: Becker - first_name: Matthias full_name: Becker, Matthias last_name: Becker - first_name: Cedric full_name: Richter, Cedric id: '50003' last_name: Richter - first_name: Arnab full_name: Sharma, Arnab id: '67200' last_name: Sharma citation: 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 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} }' 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.' 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.' 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. 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.' date_created: 2023-07-07T07:56:08Z date_updated: 2023-07-07T11:19:40Z ddc: - '004' department: - _id: '7' doi: 10.5281/zenodo.8068510 editor: - first_name: Claus-Jochen full_name: Haake, Claus-Jochen last_name: Haake - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm last_name: Meyer auf der Heide - first_name: Marco full_name: Platzner, Marco last_name: Platzner - first_name: Henning full_name: Wachsmuth, Henning last_name: Wachsmuth - first_name: Heike full_name: Wehrheim, Heike last_name: Wehrheim file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2023-07-07T07:55:57Z date_updated: 2023-07-07T11:19:40Z file_id: '45887' file_name: B3-Chapter-SFB-Buch-Final.pdf file_size: 370888 relation: main_file file_date_updated: 2023-07-07T11:19:40Z has_accepted_license: '1' intvolume: ' 412' language: - iso: eng oa: '1' page: 105-123 place: Paderborn 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' - _id: '11' name: 'SFB 901 - B3: SFB 901 - Subproject B3' publication: On-The-Fly Computing -- Individualized IT-services in dynamic markets publisher: Heinz Nixdorf Institut, Universität Paderborn series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts status: public title: Composition Analysis in Unknown Contexts type: book_chapter user_id: '477' volume: 412 year: '2023' ... --- _id: '46205' abstract: - lang: eng 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. author: - first_name: Joschka full_name: Kersting, Joschka id: '58701' last_name: Kersting - first_name: Michaela full_name: Geierhos, Michaela id: '42496' last_name: Geierhos orcid: 0000-0002-8180-5606 citation: 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' 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' 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} }' 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.' 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.' 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.' 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.' date_created: 2023-07-28T15:03:14Z date_updated: 2023-07-28T15:11:10Z ddc: - '004' department: - _id: '579' doi: 10.1007/978-3-031-37890-4_3 editor: - first_name: Alfredo full_name: Cuzzocrea, Alfredo last_name: Cuzzocrea - first_name: Oleg full_name: Gusikhin, Oleg last_name: Gusikhin - first_name: Slimane full_name: Hammoudi, Slimane last_name: Hammoudi - first_name: Christoph full_name: Quix, Christoph last_name: Quix file: - access_level: closed content_type: application/pdf creator: jkers date_created: 2023-07-28T15:10:48Z date_updated: 2023-07-28T15:10:48Z file_id: '46207' file_name: Kersting and Geierhos (2023), Kersting2023b.pdf file_size: 746336 relation: main_file success: 1 file_date_updated: 2023-07-28T15:10:48Z has_accepted_license: '1' intvolume: ' 1860' language: - iso: eng page: 45-65 place: Cham project: - _id: '1' grant_number: '160364472' name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ' - _id: '9' grant_number: '160364472' name: 'SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)' - _id: '3' name: 'SFB 901 - B: SFB 901 - Project Area B' publication: Data Management Technologies and Applications publication_identifier: isbn: - '9783031378898' - '9783031378904' issn: - 1865-0929 - 1865-0937 publication_status: published publisher: Springer Nature Switzerland series_title: Communications in Computer and Information Science status: public title: 'Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews' type: book_chapter user_id: '58701' volume: 1860 year: '2023' ... --- _id: '45780' author: - first_name: Alexander full_name: Tornede, Alexander id: '38209' last_name: Tornede citation: 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 ' 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} }' 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 .' ieee: 'A. Tornede, Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions. 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 .' short: 'A. Tornede, Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions, 2023.' date_created: 2023-06-27T05:20:14Z date_updated: 2023-08-04T06:01:49Z ddc: - '006' department: - _id: '355' doi: '10.17619/UNIPB/1-1780 ' file: - access_level: open_access content_type: application/pdf creator: ahetzer date_created: 2023-07-24T08:40:35Z date_updated: 2023-07-24T08:42:01Z file_id: '46118' file_name: dissertation_alexander_tornede_final_publishing_compressed.pdf file_size: 4300633 relation: main_file title: ' Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions' file_date_updated: 2023-07-24T08:42:01Z has_accepted_license: '1' language: - iso: eng oa: '1' 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' - _id: '1' grant_number: '160364472' name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ' status: public supervisor: - first_name: Eyke full_name: Hüllermeier, Eyke last_name: Hüllermeier title: 'Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions' type: dissertation user_id: '15504' year: '2023' ... --- _id: '45863' abstract: - lang: eng 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." alternative_title: - Collaborative Research Centre 901 (2011 – 2023) author: - first_name: Claus-Jochen full_name: Haake, Claus-Jochen id: '20801' last_name: Haake - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner - first_name: Henning full_name: Wachsmuth, Henning id: '3900' last_name: Wachsmuth - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: 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 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.' 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.' 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. 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. date_created: 2023-07-05T07:16:51Z date_updated: 2023-08-29T06:44:36Z ddc: - '000' department: - _id: '7' doi: 10.17619/UNIPB/1-1797 file: - access_level: open_access content_type: application/pdf creator: ups date_created: 2023-07-05T07:15:55Z date_updated: 2023-07-05T07:19:14Z file_id: '45864' file_name: SFB-Buch-Final.pdf file_size: 15480050 relation: main_file file_date_updated: 2023-07-05T07:19:14Z has_accepted_license: '1' intvolume: ' 412' language: - iso: eng oa: '1' page: '247' place: Paderborn project: - _id: '1' grant_number: '160364472' name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ' - _id: '2' name: 'SFB 901 - A: SFB 901 - Project Area A' - _id: '3' name: 'SFB 901 - B: SFB 901 - Project Area B' - _id: '4' name: 'SFB 901 - C: SFB 901 - Project Area C' - _id: '82' name: 'SFB 901 - T: SFB 901 - Project Area T' - _id: '5' grant_number: '160364472' name: 'SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)' - _id: '7' grant_number: '160364472' name: 'SFB 901 - A3: SFB 901 - Der Markt für Services: Anreize, Algorithmen, Implementation (Subproject A3)' - _id: '8' grant_number: '160364472' name: 'SFB 901 - A4: SFB 901 - Empirische Analysen in Märkten für OTF Dienstleistungen (Subproject A4)' - _id: '9' grant_number: '160364472' name: 'SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)' - _id: '10' grant_number: '160364472' name: 'SFB 901 - B2: Konfiguration und Bewertung (B02)' - _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' grant_number: '160364472' name: 'SFB 901 - C2: SFB 901 - On-The-Fly Compute Centers I: Heterogene Ausführungsumgebungen (Subproject C2)' - _id: '16' grant_number: '160364472' name: 'SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)' - _id: '17' name: 'SFB 901 - C5: SFB 901 - Subproject C5' - _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 publisher: Heinz Nixdorf Institut, Universität Paderborn series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts status: public title: On-The-Fly Computing -- Individualized IT-services in dynamic markets type: book user_id: '477' volume: 412 year: '2023' ... --- _id: '47833' author: - first_name: Jürgen full_name: König, Jürgen last_name: König citation: ama: König J. 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. 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} }' 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. mla: König, Jürgen. 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. date_created: 2023-10-06T12:41:35Z date_updated: 2023-10-06T12:41:42Z department: - _id: '77' language: - iso: eng 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' - _id: '11' name: 'SFB 901 - B3: SFB 901 - Subproject B3' status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim title: On the Membership and Correctness Problem for State Serializability and Value Opacity type: dissertation user_id: '15504' year: '2023' ... --- _id: '29945' author: - first_name: Linus Matthias full_name: Witschen, Linus Matthias id: '49051' last_name: Witschen - first_name: Tobias full_name: Wiersema, Tobias id: '3118' last_name: Wiersema - first_name: Lucas David full_name: Reuter, Lucas David last_name: Reuter - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: 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).' 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. 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} }' 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. mla: Witschen, Linus Matthias, et al. “Search Space Characterization for Approximate Logic Synthesis .” 2022 59th ACM/IEEE Design Automation Conference (DAC). short: 'L.M. Witschen, T. Wiersema, L.D. Reuter, M. Platzner, in: 2022 59th ACM/IEEE Design Automation Conference (DAC), n.d.' conference: end_date: 2022-07-14 location: San Francisco, USA name: 2022 59th ACM/IEEE Design Automation Conference (DAC) start_date: 2022-07-10 date_created: 2022-02-22T07:51:38Z date_updated: 2022-02-22T07:51:42Z department: - _id: '78' language: - iso: eng 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' publication: 2022 59th ACM/IEEE Design Automation Conference (DAC) publication_status: accepted status: public title: 'Search Space Characterization for Approximate Logic Synthesis ' type: conference user_id: '49051' year: '2022' ... --- _id: '29865' author: - first_name: Linus Matthias full_name: Witschen, Linus Matthias id: '49051' last_name: Witschen - first_name: Tobias full_name: Wiersema, Tobias id: '3118' last_name: Wiersema - first_name: Matthias full_name: Artmann, Matthias last_name: Artmann - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: 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.' 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} }' 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.' 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.' mla: 'Witschen, Linus Matthias, et al. “MUSCAT: MUS-Based Circuit Approximation Technique.” Design, Automation and Test in Europe (DATE).' short: 'L.M. Witschen, T. Wiersema, M. Artmann, M. Platzner, in: Design, Automation and Test in Europe (DATE), n.d.' conference: location: Online name: Design, Automation and Test in Europe (DATE) date_created: 2022-02-16T16:22:23Z date_updated: 2022-02-22T07:52:01Z department: - _id: '78' language: - iso: eng 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' - _id: '52' name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing' publication: Design, Automation and Test in Europe (DATE) publication_status: accepted status: public title: 'MUSCAT: MUS-based Circuit Approximation Technique' type: conference user_id: '49051' year: '2022' ... --- _id: '30868' 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." author: - first_name: Elias full_name: Schede, Elias last_name: Schede - first_name: Jasmin full_name: Brandt, Jasmin last_name: Brandt - first_name: Alexander full_name: Tornede, Alexander id: '38209' last_name: Tornede - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Viktor full_name: Bengs, Viktor id: '76599' last_name: Bengs - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier - first_name: Kevin full_name: Tierney, Kevin last_name: Tierney citation: ama: Schede E, Brandt J, Tornede A, et al. A Survey of Methods for Automated Algorithm Configuration. arXiv:220201651. Published online 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. 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} }' 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. ieee: E. Schede et al., “A Survey of Methods for Automated Algorithm Configuration,” arXiv:2202.01651. 2022. mla: Schede, Elias, 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). date_created: 2022-04-12T12:00:08Z date_updated: 2022-04-12T12:01:15Z department: - _id: '34' - _id: '7' - _id: '26' external_id: arxiv: - '2202.01651' language: - iso: eng 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' publication: arXiv:2202.01651 status: public title: A Survey of Methods for Automated Algorithm Configuration type: preprint user_id: '38209' year: '2022' ... --- _id: '32311' 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. author: - first_name: Arnab full_name: Sharma, Arnab id: '67200' last_name: Sharma - first_name: Vitaly full_name: Melnikov, Vitaly id: '58747' last_name: Melnikov - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: 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.' 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. 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} }' 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. 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. 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. 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.' date_created: 2022-07-01T11:18:03Z date_updated: 2022-07-01T11:21:36Z department: - _id: '7' language: - iso: eng page: 113-123 project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '3' name: 'SFB 901 - B: SFB 901 - Project Area B' - _id: '11' name: 'SFB 901 - B3: SFB 901 - Subproject B3' publication: Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE) publisher: IEEE status: public title: Property-Driven Testing of Black-Box Functions type: conference user_id: '477' year: '2022' ... --- _id: '34103' 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." author: - first_name: Lukass full_name: Fehring, Lukass last_name: Fehring - first_name: Jonas Manuel full_name: Hanselle, Jonas Manuel id: '43980' last_name: Hanselle orcid: 0000-0002-1231-4985 - first_name: Alexander full_name: Tornede, Alexander id: '38209' last_name: Tornede citation: 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} }' 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.' 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.' 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.' conference: location: Baltimore name: Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022 date_created: 2022-11-17T12:57:40Z date_updated: 2022-11-17T13:00:53Z external_id: arxiv: - '2210.17341' language: - iso: eng 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' publication: Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022 status: public title: 'HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection' type: conference user_id: '38209' year: '2022' ... --- _id: '30511' 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. alternative_title: - Revoking the preprocessor’s special role article_number: '35' article_type: original author: - first_name: Philipp full_name: Schubert, Philipp id: '60543' last_name: Schubert orcid: 0000-0002-8674-1859 - first_name: Paul full_name: Gazzillo, Paul last_name: Gazzillo - first_name: Zach full_name: Patterson, Zach last_name: Patterson - first_name: Julian full_name: Braha, Julian last_name: Braha - first_name: Fabian full_name: Schiebel, Fabian last_name: Schiebel - first_name: Ben full_name: Hermann, Ben id: '66173' last_name: Hermann orcid: 0000-0001-9848-2017 - first_name: Shiyi full_name: Wei, Shiyi last_name: Wei - first_name: Eric full_name: Bodden, Eric id: '59256' last_name: Bodden orcid: 0000-0003-3470-3647 citation: 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 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} }' 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. 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.' 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. short: P. Schubert, P. Gazzillo, Z. Patterson, J. Braha, F. Schiebel, B. Hermann, S. Wei, E. Bodden, Automated Software Engineering 29 (2022). date_created: 2022-03-25T07:41:26Z date_updated: 2022-11-17T14:22:38Z department: - _id: '76' doi: 10.1007/s10515-022-00333-1 intvolume: ' 29' issue: '1' keyword: - inter-procedural static analysis - software product lines - preprocessor - LLVM - C/C++ language: - iso: eng main_file_link: - open_access: '1' url: https://link.springer.com/article/10.1007/s10515-022-00333-1 oa: '1' project: - _id: '12' name: 'SFB 901 - B4: SFB 901 - Subproject B4' - _id: '3' name: 'SFB 901 - B: SFB 901 - Project Area B' - _id: '1' name: 'SFB 901: SFB 901' publication: Automated Software Engineering publication_identifier: issn: - 0928-8910 - 1573-7535 publication_status: published publisher: Springer Science and Business Media LLC status: public title: Static data-flow analysis for software product lines in C type: journal_article user_id: '477' volume: 29 year: '2022' ... --- _id: '32590' author: - first_name: Cedric full_name: Richter, Cedric id: '50003' last_name: Richter - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim 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' 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} }' 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.' 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.' short: 'C. Richter, H. Wehrheim, in: 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 2022, pp. 162–173.' date_created: 2022-08-08T07:40:04Z date_updated: 2022-11-18T09:45:40Z department: - _id: '77' doi: 10.1109/ICST53961.2022.00027 language: - iso: eng page: 162-173 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' publication: 2022 IEEE Conference on Software Testing, Verification and Validation (ICST) status: public title: 'Learning Realistic Mutations: Bug Creation for Neural Bug Detectors' type: conference user_id: '477' year: '2022' ... --- _id: '32591' author: - first_name: Cedric full_name: Richter, Cedric id: '50003' last_name: Richter - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: 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' 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' 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.' 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.' 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.' short: 'C. Richter, H. Wehrheim, in: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 2022, pp. 418–422.' date_created: 2022-08-08T07:42:19Z date_updated: 2022-11-18T09:45:05Z department: - _id: '77' doi: 10.1145/3524842.3528505 language: - iso: eng page: 418-422 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' publication: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR) status: public title: 'TSSB-3M: Mining single statement bugs at massive scale' type: conference user_id: '477' year: '2022' ... --- _id: '31806' 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 author: - first_name: Kevin full_name: Dreßler, Kevin id: '78256' last_name: Dreßler - first_name: Mohamed full_name: Sherif, Mohamed id: '67234' last_name: Sherif - first_name: Axel-Cyrille full_name: Ngonga Ngomo, Axel-Cyrille id: '65716' last_name: Ngonga Ngomo citation: 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' 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' 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} }' 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.' 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. short: 'K. Dreßler, M. Sherif, A.-C. Ngonga Ngomo, in: Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia, 2022.' conference: end_date: 2022-07-01 location: Barcelona (Spain) name: 'HT ’22: 33rd ACM Conference on Hypertext and Social Media' start_date: 2022-06-28 date_created: 2022-06-08T08:47:33Z date_updated: 2022-11-18T10:11:38Z ddc: - '000' department: - _id: '34' doi: 10.1145/3511095.3531287 keyword: - 2022 RAKI SFB901 deer dice kevin knowgraphs limes ngonga sherif simba language: - iso: eng 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' publication: Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia status: public title: ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning type: conference user_id: '477' year: '2022' ... --- _id: '33274' author: - first_name: Wei-Fan full_name: Chen, Wei-Fan id: '82920' last_name: Chen - first_name: Mei-Hua full_name: Chen, Mei-Hua last_name: Chen - first_name: Garima full_name: Mudgal, Garima last_name: Mudgal - first_name: Henning full_name: Wachsmuth, Henning id: '3900' last_name: Wachsmuth citation: 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. 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} }' 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. 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. 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. 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.' date_created: 2022-09-06T13:51:23Z date_updated: 2022-11-18T09:56:17Z department: - _id: '600' language: - iso: eng page: 51 - 61 project: - _id: '9' name: 'SFB 901 - B1: SFB 901 - Subproject B1' - _id: '1' name: 'SFB 901: SFB 901' - _id: '3' name: 'SFB 901 - B: SFB 901 - Project Area B' publication: Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022) status: public title: Analyzing Culture-Specific Argument Structures in Learner Essays type: conference user_id: '477' year: '2022' ... --- _id: '32179' abstract: - lang: eng 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. author: - first_name: Joschka full_name: Kersting, Joschka id: '58701' last_name: Kersting - first_name: Mobeen full_name: Ahmed, Mobeen last_name: Ahmed - first_name: Michaela full_name: Geierhos, Michaela id: '42496' last_name: Geierhos orcid: 0000-0002-8180-5606 citation: 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 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.' 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.' 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. 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.' conference: end_date: 2022-07-01 location: Virtual name: 24th International Conference on Human-Computer Interaction (HCII 2022) start_date: 2022-06-26 date_created: 2022-06-27T09:27:06Z date_updated: 2022-11-28T13:22:16Z ddc: - '004' department: - _id: '579' doi: 10.1007/978-3-031-06417-3_56 editor: - first_name: Constantine full_name: Stephanidis, Constantine last_name: Stephanidis - first_name: Margherita full_name: Antona, Margherita last_name: Antona - first_name: Stavroula full_name: Ntoa, Stavroula last_name: Ntoa file: - access_level: closed content_type: application/pdf creator: jkers date_created: 2022-11-28T13:21:32Z date_updated: 2022-11-28T13:21:32Z file_id: '34150' file_name: Kersting et al. (2022), Kersting2022.pdf file_size: 1153017 relation: main_file success: 1 file_date_updated: 2022-11-28T13:21:32Z has_accepted_license: '1' intvolume: ' 1580' keyword: - On-The-Fly Computing - Chatbot - Knowledge Base language: - iso: eng page: 419--426 place: Cham, Switzerland project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '3' name: 'SFB 901 - B: SFB 901 - Project Area B' - _id: '9' name: 'SFB 901 - B1: SFB 901 - Subproject B1' publication: HCI International 2022 Posters publication_identifier: isbn: - '9783031064166' - '9783031064173' issn: - 1865-0929 - 1865-0937 publication_status: published publisher: Springer International Publishing related_material: link: - relation: confirmation url: https://link.springer.com/chapter/10.1007/978-3-031-06417-3_56 series_title: Communications in Computer and Information Science (CCIS) status: public title: Chatbot-Enhanced Requirements Resolution for Automated Service Compositions type: book_chapter user_id: '58701' volume: 1580 year: '2022' ... --- _id: '31054' 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. author: - first_name: Joschka full_name: Kersting, Joschka id: '58701' last_name: Kersting - first_name: Frederik Simon full_name: Bäumer, Frederik Simon id: '38837' last_name: Bäumer citation: 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} }' 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.' 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.' 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.' 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.' conference: location: Barcelona, Spain name: The Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022) start_date: 2022-03 date_created: 2022-05-04T08:12:09Z date_updated: 2022-12-01T13:40:11Z ddc: - '006' editor: - first_name: Joschka full_name: Kersting, Joschka last_name: Kersting file: - access_level: closed content_type: application/pdf creator: jkers date_created: 2022-12-01T13:39:48Z date_updated: 2022-12-01T13:39:48Z file_id: '34172' file_name: Kersting & Bäumer (2022), Kersting2022.pdf file_size: 155548 relation: main_file success: 1 file_date_updated: 2022-12-01T13:39:48Z has_accepted_license: '1' keyword: - Sentiment analysis - Natural language processing - Aspect phrase extraction language: - iso: eng page: 5-9 place: Barcelona, Spain project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '3' name: 'SFB 901 - B: SFB 901 - Project Area B' - _id: '9' name: 'SFB 901 - B1: SFB 901 - Subproject B1' 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' publication_status: published publisher: IARIA status: public title: 'Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis' type: conference user_id: '58701' year: '2022' ... --- _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 - first_name: Wei-Fan full_name: Chen, Wei-Fan id: '82920' last_name: Chen - first_name: Henning full_name: Wachsmuth, Henning id: '3900' last_name: Wachsmuth citation: 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.' apa: Chen, M.-H., Mudgal, G., Chen, W.-F., & Wachsmuth, H. (2022). Investigating the argumentation structures of EFL learners from diverse language backgrounds. EUROCALL. 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} }' 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. ieee: M.-H. Chen, G. Mudgal, W.-F. Chen, and H. Wachsmuth, “Investigating the argumentation structures of EFL learners from diverse language backgrounds,” 2022. mla: Chen, Mei-Hua, et al. “Investigating the Argumentation Structures of EFL Learners from Diverse Language Backgrounds.” EUROCALL, 2022. short: 'M.-H. Chen, G. Mudgal, W.-F. Chen, H. Wachsmuth, in: EUROCALL, 2022.' date_created: 2022-05-05T07:50:21Z date_updated: 2022-05-09T14:58:39Z department: - _id: '600' language: - iso: eng project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '3' name: 'SFB 901 - B: SFB 901 - Project Area B' - _id: '9' name: 'SFB 901 - B1: SFB 901 - Subproject B1' publication: EUROCALL status: public title: Investigating the argumentation structures of EFL learners from diverse language backgrounds type: conference_abstract user_id: '82920' year: '2022' ... --- _id: '33033' author: - first_name: Lukas full_name: Fehring, Lukas id: '75695' last_name: Fehring citation: ama: Fehring L. Combined Ranking and Regression Trees for Algorithm Selection.; 2022. apa: Fehring, L. (2022). Combined Ranking and Regression Trees for Algorithm Selection. bibtex: '@book{Fehring_2022, place={Paderborn}, title={Combined Ranking and Regression Trees for Algorithm Selection}, author={Fehring, Lukas}, year={2022} }' chicago: Fehring, Lukas. Combined Ranking and Regression Trees for Algorithm Selection. Paderborn, 2022. ieee: L. Fehring, Combined Ranking and Regression Trees for Algorithm Selection. Paderborn, 2022. mla: Fehring, Lukas. Combined Ranking and Regression Trees for Algorithm Selection. 2022. short: L. Fehring, Combined Ranking and Regression Trees for Algorithm Selection, Paderborn, 2022. date_created: 2022-08-19T09:41:14Z date_updated: 2022-08-20T07:02:04Z ddc: - '006' department: - _id: '34' - _id: '7' - _id: '26' file: - access_level: open_access content_type: application/pdf creator: ahetzer date_created: 2022-08-19T09:39:57Z date_updated: 2022-08-19T09:39:57Z file_id: '33034' file_name: Final Bachelor Thesis.pdf file_size: 24830795 relation: main_file file_date_updated: 2022-08-19T09:39:57Z has_accepted_license: '1' language: - iso: eng oa: '1' place: Paderborn 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' status: public title: Combined Ranking and Regression Trees for Algorithm Selection type: bachelorsthesis user_id: '38209' year: '2022' ... --- _id: '30867' abstract: - lang: eng 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." author: - first_name: Alexander full_name: Tornede, Alexander id: '38209' last_name: Tornede - first_name: Viktor full_name: Bengs, Viktor id: '76599' last_name: Bengs - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier 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. 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} }' 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. 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. 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. short: A. Tornede, V. Bengs, E. Hüllermeier, Proceedings of the 36th AAAI Conference on Artificial Intelligence (2022). date_created: 2022-04-12T11:58:56Z date_updated: 2022-08-24T12:44:27Z department: - _id: '34' - _id: '7' - _id: '26' external_id: arxiv: - '2109.06234' language: - iso: eng 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' publication: Proceedings of the 36th AAAI Conference on Artificial Intelligence publisher: AAAI status: public title: Machine Learning for Online Algorithm Selection under Censored Feedback type: preprint user_id: '38209' year: '2022' ... --- _id: '30865' 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." author: - first_name: Alexander full_name: Tornede, Alexander id: '38209' last_name: Tornede - first_name: Lukas full_name: Gehring, Lukas last_name: Gehring - first_name: Tanja full_name: Tornede, Tanja id: '40795' last_name: Tornede - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: 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. 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} }' chicago: Tornede, Alexander, Lukas Gehring, Tanja Tornede, Marcel Dominik Wever, and Eyke Hüllermeier. “Algorithm Selection on a Meta Level.” Machine Learning, 2022. ieee: A. Tornede, L. Gehring, T. Tornede, M. D. Wever, and E. Hüllermeier, “Algorithm Selection on a Meta Level,” Machine Learning. 2022. mla: Tornede, Alexander, et al. “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). date_created: 2022-04-12T11:55:18Z date_updated: 2022-08-24T12:45:39Z department: - _id: '34' - _id: '7' - _id: '26' external_id: arxiv: - '2107.09414' language: - iso: eng 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' publication: Machine Learning status: public title: Algorithm Selection on a Meta Level type: preprint user_id: '38209' year: '2022' ... --- _id: '33090' abstract: - lang: eng 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.' author: - first_name: Karina full_name: Gevers, Karina id: '83151' last_name: Gevers - first_name: Alexander full_name: Tornede, Alexander id: '38209' last_name: Tornede - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Volker full_name: Schöppner, Volker id: '20530' last_name: Schöppner - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: 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 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 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} }' 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. 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.' 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. short: K. Gevers, A. Tornede, M.D. Wever, V. Schöppner, E. Hüllermeier, Welding in the World (2022). date_created: 2022-08-24T12:51:07Z date_updated: 2022-08-24T12:52:06Z doi: 10.1007/s40194-022-01339-9 keyword: - Metals and Alloys - Mechanical Engineering - Mechanics of Materials language: - iso: eng 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' publication: Welding in the World publication_identifier: issn: - 0043-2288 - 1878-6669 publication_status: published publisher: Springer Science and Business Media LLC status: public title: A comparison of heuristic, statistical, and machine learning methods for heated tool butt welding of two different materials type: journal_article user_id: '38209' year: '2022' ... --- _id: '34041' author: - first_name: Linus Matthias full_name: Witschen, Linus Matthias id: '49051' last_name: Witschen citation: ama: Witschen LM. Frameworks and Methodologies for Search-Based Approximate Logic Synthesis.; 2022. doi:10.17619/UNIPB/1-1649 apa: Witschen, L. M. (2022). Frameworks and Methodologies for Search-based Approximate Logic Synthesis. 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} }' chicago: Witschen, Linus Matthias. Frameworks and Methodologies for Search-Based Approximate Logic Synthesis, 2022. https://doi.org/10.17619/UNIPB/1-1649. ieee: L. M. Witschen, Frameworks and Methodologies for Search-based Approximate Logic Synthesis. 2022. mla: Witschen, Linus Matthias. Frameworks and Methodologies for Search-Based Approximate Logic Synthesis. 2022, doi:10.17619/UNIPB/1-1649. short: L.M. Witschen, Frameworks and Methodologies for Search-Based Approximate Logic Synthesis, 2022. date_created: 2022-11-09T06:26:22Z date_updated: 2023-01-19T06:41:22Z department: - _id: '78' doi: 10.17619/UNIPB/1-1649 language: - iso: eng 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' status: public supervisor: - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner title: Frameworks and Methodologies for Search-based Approximate Logic Synthesis type: dissertation user_id: '15504' year: '2022' ... --- _id: '32342' author: - first_name: Qazi Arbab full_name: Ahmed, Qazi Arbab id: '72764' last_name: Ahmed orcid: 0000-0002-1837-2254 - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: 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.' 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. 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} }' 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.' 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. 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. short: 'Q.A. Ahmed, M. Platzner, in: IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022), Pafos, Cyprus, 2022.' conference: end_date: July 6, 2022 location: Pafos, Cyprus name: IEEE Computer Society Annual Symposium on VLSI Aliathon Resort, start_date: ' July 4, 2022' date_created: 2022-07-12T19:56:48Z date_updated: 2023-04-19T15:04:30Z department: - _id: '78' language: - iso: eng place: Pafos, Cyprus 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' publisher: IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022) status: public title: On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs type: conference user_id: '72764' year: '2022' ... --- _id: '29000' 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." author: - first_name: Mobeen full_name: Ahmed, Mobeen last_name: Ahmed citation: ama: Ahmed M. 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. bibtex: '@book{Ahmed_2022, title={Knowledge Base Enhanced & User-centric Dialogue Design for OTF Computing}, author={Ahmed, Mobeen}, year={2022} }' chicago: Ahmed, Mobeen. 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. mla: Ahmed, Mobeen. Knowledge Base Enhanced & User-Centric Dialogue Design for OTF Computing. 2022. short: M. Ahmed, Knowledge Base Enhanced & User-Centric Dialogue Design for OTF Computing, 2022. date_created: 2021-12-16T15:13:07Z date_updated: 2023-05-02T13:25:45Z ddc: - '004' department: - _id: '600' file: - access_level: closed content_type: application/pdf creator: jkers date_created: 2023-05-02T13:25:27Z date_updated: 2023-05-02T13:25:27Z file_id: '44325' file_name: Thesis-Report-MOBEEN-AHMED-6856465-Knowledge_Base_Enhanced___User_centric_Dialogue_Design_for_OTFComputing.pdf file_size: 3092211 relation: main_file success: 1 file_date_updated: 2023-05-02T13:25:27Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '9' name: SFB 901 - Subproject B1 publication_status: published status: public supervisor: - first_name: Joschka full_name: Kersting, Joschka id: '58701' last_name: Kersting title: Knowledge Base Enhanced & User-centric Dialogue Design for OTF Computing type: mastersthesis user_id: '58701' year: '2022' ... --- _id: '45790' author: - first_name: Juela full_name: Palushi, Juela last_name: Palushi citation: 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. bibtex: '@book{Palushi_2022, title={Domain-aware Text Professionalization using Sequence-to-Sequence Neural Networks}, author={Palushi, Juela}, year={2022} }' chicago: Palushi, Juela. Domain-Aware Text Professionalization Using Sequence-to-Sequence Neural Networks, 2022. ieee: 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. short: J. Palushi, Domain-Aware Text Professionalization Using Sequence-to-Sequence Neural Networks, 2022. date_created: 2023-06-27T12:57:57Z date_updated: 2023-07-05T07:31:17Z department: - _id: '600' language: - iso: eng project: - _id: '9' grant_number: '160364472' name: 'SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)' - _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' status: public supervisor: - first_name: Henning full_name: Wachsmuth, Henning id: '3900' last_name: Wachsmuth title: Domain-aware Text Professionalization using Sequence-to-Sequence Neural Networks type: bachelorsthesis user_id: '477' year: '2022' ... --- _id: '45789' author: - first_name: Vinaykumar full_name: Budanurmath, Vinaykumar last_name: Budanurmath citation: ama: Budanurmath V. Propaganda Technique Detection Using Connotation Frames.; 2022. apa: Budanurmath, V. (2022). Propaganda Technique Detection Using Connotation Frames. bibtex: '@book{Budanurmath_2022, title={Propaganda Technique Detection Using Connotation Frames}, author={Budanurmath, Vinaykumar}, year={2022} }' chicago: Budanurmath, Vinaykumar. Propaganda Technique Detection Using Connotation Frames, 2022. ieee: V. Budanurmath, Propaganda Technique Detection Using Connotation Frames. 2022. mla: Budanurmath, Vinaykumar. Propaganda Technique Detection Using Connotation Frames. 2022. short: V. Budanurmath, Propaganda Technique Detection Using Connotation Frames, 2022. date_created: 2023-06-27T12:56:04Z date_updated: 2023-07-05T07:33:45Z department: - _id: '600' language: - iso: eng project: - _id: '9' grant_number: '160364472' name: 'SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)' - _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' status: public supervisor: - first_name: Henning full_name: Wachsmuth, Henning id: '3900' last_name: Wachsmuth title: Propaganda Technique Detection Using Connotation Frames type: mastersthesis user_id: '477' year: '2022' ... --- _id: '45248' author: - first_name: Brijesh full_name: Dongol, Brijesh last_name: Dongol - first_name: Gerhard full_name: Schellhorn, Gerhard last_name: Schellhorn - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: 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' 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 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. 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.' 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. 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.' date_created: 2023-05-24T07:55:24Z date_updated: 2023-08-28T12:24:57Z department: - _id: '77' doi: 10.4230/LIPIcs.CONCUR.2022.31 editor: - first_name: Bartek full_name: Klin, Bartek last_name: Klin - first_name: Slawomir full_name: Lasota, Slawomir last_name: Lasota - first_name: Anca full_name: Muscholl, Anca last_name: Muscholl intvolume: ' 243' language: - iso: eng page: 31:1–31:23 project: - _id: '1' grant_number: '160364472' 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' publication: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik series_title: LIPIcs status: public title: Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement type: conference user_id: '477' volume: 243 year: '2022' ... --- _id: '28350' 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" author: - first_name: Arnab full_name: Sharma, Arnab id: '67200' last_name: Sharma - first_name: Caglar full_name: Demir, Caglar id: '43817' last_name: Demir - first_name: Axel-Cyrille full_name: Ngonga Ngomo, Axel-Cyrille id: '65716' last_name: Ngonga Ngomo - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: 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). 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} }' 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. ieee: A. Sharma, C. Demir, A.-C. Ngonga Ngomo, and H. Wehrheim, “MLCHECK–Property-Driven Testing of Machine Learning Classifiers.” 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. 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.' date_created: 2021-12-07T11:11:36Z date_updated: 2022-01-06T06:58:02Z department: - _id: '7' - _id: '77' - _id: '574' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '11' name: SFB 901 - Subproject B3 - _id: '10' name: SFB 901 - Subproject B2 publication: Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA) publication_status: accepted publisher: IEEE status: public title: MLCHECK–Property-Driven Testing of Machine Learning Classifiers type: conference user_id: '477' year: '2021' ... --- _id: '26049' 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.' author: - first_name: Frederik Simon full_name: Bäumer, Frederik Simon last_name: Bäumer - first_name: Joschka full_name: Kersting, Joschka id: '58701' last_name: Kersting - first_name: Sergej full_name: Denisov, Sergej last_name: Denisov - first_name: Michaela full_name: Geierhos, Michaela id: '42496' last_name: Geierhos orcid: 0000-0002-8180-5606 citation: 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.' 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.' 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.' 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.' 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.' 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.' conference: end_date: 15.10.2021 location: Lisbon, Portugal name: 18th International Conference on Applied Computing start_date: 13.10.2021 date_created: 2021-10-11T15:26:58Z date_updated: 2022-01-06T06:57:16Z ddc: - '000' file: - access_level: closed content_type: application/pdf creator: jkers date_created: 2021-10-15T15:54:41Z date_updated: 2021-10-15T15:54:41Z file_id: '26282' file_name: Bäumer et al. (2021), Baeumer2021.pdf file_size: 411667 relation: main_file success: 1 file_date_updated: 2021-10-15T15:54:41Z has_accepted_license: '1' keyword: - Software Requirements - Natural Language Processing - Transfer Learning - On-The-Fly Computing language: - iso: eng page: 221--225 project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '9' name: SFB 901 - Subproject B1 publication: PROCEEDINGS OF THE INTERNATIONAL CONFERENCES ON WWW/INTERNET 2021 AND APPLIED COMPUTING 2021 publisher: IADIS status: public title: 'IN OTHER WORDS: A NAIVE APPROACH TO TEXT SPINNING' type: conference user_id: '58701' year: '2021' ... --- _id: '26746' abstract: - lang: eng 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: 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." author: - first_name: Tobias full_name: Wiersema, Tobias id: '3118' last_name: Wiersema citation: ama: Wiersema T. Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware. Paderborn University; 2021. apa: Wiersema, T. (2021). Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware. Paderborn University. 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} }' chicago: 'Wiersema, Tobias. Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware. Paderborn: Paderborn University, 2021.' ieee: 'T. Wiersema, Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware. Paderborn: Paderborn University, 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. date_created: 2021-10-25T06:35:41Z date_updated: 2022-01-06T06:57:26Z ddc: - '006' department: - _id: '78' keyword: - Proof-Carrying Hardware - Formal Verification - Sequential Circuits - Non-Functional Properties - Functional Properties language: - iso: eng main_file_link: - open_access: '1' url: https://nbn-resolving.de/urn:nbn:de:hbz:466:2-39800 oa: '1' page: '293' place: Paderborn project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 publication_status: published publisher: Paderborn University status: public supervisor: - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner title: Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware type: dissertation user_id: '3118' year: '2021' ... --- _id: '27045' abstract: - lang: eng 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.' author: - first_name: Linghui full_name: Luo, Linghui last_name: Luo - first_name: Felix full_name: Pauck, Felix id: '22398' last_name: Pauck - first_name: Goran full_name: Piskachev, Goran id: '41936' last_name: Piskachev orcid: 0000-0003-4424-5838 - first_name: Manuel full_name: Benz, Manuel last_name: Benz - first_name: Ivan full_name: Pashchenko, Ivan last_name: Pashchenko - first_name: Martin full_name: Mory, Martin id: '65667' last_name: Mory orcid: 0000-0001-5609-0031 - first_name: Eric full_name: Bodden, Eric id: '59256' last_name: Bodden orcid: 0000-0003-3470-3647 - first_name: Ben full_name: Hermann, Ben id: '66173' last_name: Hermann orcid: 0000-0001-9848-2017 - first_name: Fabio full_name: Massacci, Fabio last_name: Massacci citation: 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' 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} }' 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.' 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.' 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.' short: L. Luo, F. Pauck, G. Piskachev, M. Benz, I. Pashchenko, M. Mory, E. Bodden, B. Hermann, F. Massacci, Empirical Software Engineering (2021). date_created: 2021-11-02T05:13:49Z date_updated: 2022-01-06T06:57:32Z ddc: - '000' department: - _id: '77' - _id: '76' doi: 10.1007/s10664-021-10013-5 language: - iso: eng main_file_link: - open_access: '1' url: https://link.springer.com/content/pdf/10.1007/s10664-021-10013-5.pdf oa: '1' project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 publication: Empirical Software Engineering publication_identifier: issn: - 1382-3256 - 1573-7616 publication_status: published status: public title: 'TaintBench: Automatic real-world malware benchmarking of Android taint analyses' type: journal_article user_id: '15249' year: '2021' ... --- _id: '21004' abstract: - lang: eng 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.' author: - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Alexander full_name: Tornede, Alexander id: '38209' last_name: Tornede - first_name: Felix full_name: Mohr, Felix last_name: Mohr - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier 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' 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} }' 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.' 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.' 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. date_created: 2021-01-16T14:48:13Z date_updated: 2022-01-06T06:54:42Z department: - _id: '34' - _id: '355' - _id: '26' doi: 10.1109/tpami.2021.3051276 keyword: - Automated Machine Learning - Multi Label Classification - Hierarchical Planning - Bayesian Optimization language: - iso: eng page: 1-1 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 publication: IEEE Transactions on Pattern Analysis and Machine Intelligence publication_identifier: issn: - 0162-8828 - 2160-9292 - 1939-3539 publication_status: published status: public title: 'AutoML for Multi-Label Classification: Overview and Empirical Evaluation' type: journal_article user_id: '5786' year: '2021' ... --- _id: '21092' 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." author: - first_name: Felix full_name: Mohr, Felix last_name: Mohr - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Alexander full_name: Tornede, Alexander id: '38209' last_name: Tornede - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: 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. 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. 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. 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. 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. short: F. Mohr, M.D. Wever, A. Tornede, E. Hüllermeier, IEEE Transactions on Pattern Analysis and Machine Intelligence (n.d.). date_created: 2021-01-27T13:45:52Z date_updated: 2022-01-06T06:54:45Z department: - _id: '34' - _id: '355' - _id: '26' language: - iso: eng 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 publication: IEEE Transactions on Pattern Analysis and Machine Intelligence publication_status: accepted publisher: IEEE status: public title: Predicting Machine Learning Pipeline Runtimes in the Context of Automated Machine Learning type: journal_article user_id: '5786' year: '2021' ... --- _id: '21570' author: - first_name: Tanja full_name: Tornede, Tanja id: '40795' last_name: Tornede - first_name: Alexander full_name: Tornede, Alexander id: '38209' last_name: Tornede - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: 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. 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. 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. 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. short: 'T. Tornede, A. Tornede, M.D. Wever, E. Hüllermeier, in: Proceedings of the Genetic and Evolutionary Computation Conference, 2021.' conference: end_date: 2021-07-14 name: Genetic and Evolutionary Computation Conference start_date: 2021-07-10 date_created: 2021-03-26T09:14:19Z date_updated: 2022-01-06T06:55:06Z department: - _id: '34' - _id: '355' - _id: '26' language: - iso: eng 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 publication: Proceedings of the Genetic and Evolutionary Computation Conference status: public title: Coevolution of Remaining Useful Lifetime Estimation Pipelines for Automated Predictive Maintenance type: conference user_id: '5786' year: '2021' ... --- _id: '17905' abstract: - lang: eng 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. ' author: - first_name: Joschka full_name: Kersting, Joschka id: '58701' last_name: Kersting - first_name: Michaela full_name: Geierhos, Michaela id: '42496' last_name: Geierhos orcid: 0000-0002-8180-5606 citation: 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' 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)} }' 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.' 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.' 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. short: 'J. Kersting, M. Geierhos, in: R. Loukanova (Ed.), Natural Language Processing in Artificial Intelligence -- NLPinAI 2020, Springer, Cham, 2021, pp. 163--189.' date_created: 2020-08-13T09:29:52Z date_updated: 2022-01-06T06:53:23Z ddc: - '000' department: - _id: '579' doi: 10.1007/978-3-030-63787-3_6 editor: - first_name: Roussanka full_name: Loukanova, Roussanka last_name: Loukanova file: - access_level: closed content_type: application/pdf creator: jkers date_created: 2021-04-08T08:14:05Z date_updated: 2021-04-08T08:14:05Z file_id: '21594' file_name: Kersting-Geierhos2021_Chapter_TowardsAspectExtractionAndClas.pdf file_size: 512065 relation: main_file success: 1 file_date_updated: 2021-04-08T08:14:05Z has_accepted_license: '1' intvolume: ' 939' language: - iso: eng page: '163--189 ' place: Cham project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '9' name: SFB 901 - Subproject B1 publication: Natural Language Processing in Artificial Intelligence -- NLPinAI 2020 publication_identifier: unknown: - 978-3-030-63786-6 ; 978-3-030-63787-3 publication_status: published publisher: Springer series_title: Studies in Computational Intelligence (SCI) status: public title: Towards Aspect Extraction and Classification for Opinion Mining with Deep Sequence Networks type: book_chapter user_id: '58701' volume: 939 year: '2021' ... --- _id: '22304' author: - first_name: Stefan full_name: Schott, Stefan id: '54847' last_name: Schott citation: ama: Schott S. Android App Analysis Benchmark Case Generation. Paderborn; 2021. apa: Schott, S. (2021). Android App Analysis Benchmark Case Generation. Paderborn. bibtex: '@book{Schott_2021, place={Paderborn}, title={Android App Analysis Benchmark Case Generation}, author={Schott, Stefan}, year={2021} }' chicago: Schott, Stefan. Android App Analysis Benchmark Case Generation. Paderborn, 2021. ieee: S. Schott, Android App Analysis Benchmark Case Generation. Paderborn, 2021. mla: Schott, Stefan. Android App Analysis Benchmark Case Generation. 2021. short: S. Schott, Android App Analysis Benchmark Case Generation, Paderborn, 2021. date_created: 2021-06-09T06:04:12Z date_updated: 2022-01-06T06:55:31Z ddc: - '000' department: - _id: '77' extern: '1' file: - access_level: open_access content_type: application/pdf creator: fpauck date_created: 2021-06-09T06:01:45Z date_updated: 2021-06-09T06:01:45Z file_id: '22305' file_name: Masters_Thesis_Stefan_Schott_unsigned.pdf file_size: 1918444 relation: main_file file_date_updated: 2021-06-09T06:01:45Z has_accepted_license: '1' language: - iso: eng oa: '1' place: Paderborn project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subproject B4 - _id: '3' name: SFB 901 - Project Area B status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim title: Android App Analysis Benchmark Case Generation type: mastersthesis user_id: '477' year: '2021' ... --- _id: '22913' author: - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier - first_name: Felix full_name: Mohr, Felix last_name: Mohr - first_name: Alexander full_name: Tornede, Alexander id: '38209' last_name: Tornede - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' citation: ama: 'Hüllermeier E, Mohr F, Tornede A, Wever MD. Automated Machine Learning, Bounded Rationality, and Rational Metareasoning. In: ; 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). 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. 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. mla: Hüllermeier, Eyke, et al. Automated Machine Learning, Bounded Rationality, and Rational Metareasoning. 2021. short: 'E. Hüllermeier, F. Mohr, A. Tornede, M.D. Wever, in: 2021.' conference: end_date: 2021-09-17 location: Bilbao (Virtual) name: ECML/PKDD Workshop on Automating Data Science start_date: 2021-09-13 date_created: 2021-08-02T07:46:29Z date_updated: 2022-01-06T06:55:43Z department: - _id: '34' - _id: '355' - _id: '26' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '10' name: SFB 901 - Subproject B2 quality_controlled: '1' status: public title: Automated Machine Learning, Bounded Rationality, and Rational Metareasoning type: conference user_id: '5786' year: '2021' ... --- _id: '22927' author: - first_name: John full_name: Derrick, John last_name: Derrick - first_name: Simon full_name: Doherty, Simon last_name: Doherty - first_name: Brijesh full_name: Dongol, Brijesh last_name: Dongol - first_name: Gerhard full_name: Schellhorn, Gerhard last_name: Schellhorn - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: 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.' 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. 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} }' 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. 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). 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.' date_created: 2021-08-03T07:38:56Z date_updated: 2022-01-06T06:55:43Z department: - _id: '7' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 publication: Proceedings of the 35th International Symposium on Distributed Computing (DISC) publication_status: accepted publisher: Schloß Dagstuhl series_title: Leibniz International Proceedings in Informatics status: public title: On Strong Observational Refinement and Forward Simulation type: conference user_id: '477' year: '2021' ... --- _id: '22051' author: - first_name: Joschka full_name: Kersting, Joschka id: '58701' last_name: Kersting - first_name: Michaela full_name: Geierhos, Michaela id: '42496' last_name: Geierhos orcid: 0000-0002-8180-5606 citation: 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.' 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} }' 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.' 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.' 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.' 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.' conference: end_date: 2021-07-08 location: Online name: 10th International Conference on Data Science, Technology and Applications (DATA 2021) start_date: 2021-07-06 date_created: 2021-05-07T16:27:27Z date_updated: 2022-01-06T06:55:23Z department: - _id: '579' language: - iso: eng page: 275--284 place: Online project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '9' name: SFB 901 - Subproject B1 publication: Proceedings of the 10th International Conference on Data Science, Technology and Applications (DATA 2021) publication_status: published publisher: SCITEPRESS status: public title: 'Well-being in Plastic Surgery: Deep Learning Reveals Patients'' Evaluations' type: conference user_id: '58701' year: '2021' ... --- _id: '21953' author: - first_name: Linus Matthias full_name: Witschen, Linus Matthias id: '49051' last_name: Witschen - first_name: Tobias full_name: Wiersema, Tobias id: '3118' last_name: Wiersema - first_name: Masood full_name: Raeisi Nafchi, Masood last_name: Raeisi Nafchi - first_name: Arne full_name: Bockhorn, Arne last_name: Bockhorn - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: 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' 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 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} }' 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.' 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. 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.' conference: end_date: 2021-07-01 location: Virtual conference name: International Symposium on Applied Reconfigurable Computing start_date: 2021-06-29 date_created: 2021-05-04T14:18:46Z date_updated: 2022-02-14T11:03:09Z department: - _id: '78' doi: 10.1007/978-3-030-79025-7_4 editor: - first_name: Frank full_name: Hannig, Frank last_name: Hannig - first_name: Steven full_name: Derrien, Steven last_name: Derrien - first_name: Pedro full_name: Diniz, Pedro last_name: Diniz - first_name: Daniel full_name: Chillet, Daniel last_name: Chillet language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: Proceedings of International Symposium on Applied Reconfigurable Computing (ARC'21) publication_status: accepted publisher: Springer Lecture Notes in Computer Science series_title: 'Reconfigurable Computing: Architectures, Tools, and Applications' status: public title: Timing Optimization for Virtual FPGA Configurations type: conference user_id: '3118' year: '2021' ... --- _id: '21598' abstract: - lang: eng 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. author: - first_name: Philipp full_name: Schubert, Philipp id: '60543' last_name: Schubert orcid: 0000-0002-8674-1859 - first_name: Ben full_name: Hermann, Ben id: '66173' last_name: Hermann orcid: 0000-0001-9848-2017 - first_name: Eric full_name: Bodden, Eric id: '59256' last_name: Bodden orcid: 0000-0003-3470-3647 citation: 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). 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} }' 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. ieee: P. Schubert, B. Hermann, and E. Bodden, “Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis,” 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. short: 'P. Schubert, B. Hermann, E. Bodden, in: European Conference on Object-Oriented Programming (ECOOP), 2021.' date_created: 2021-04-08T11:24:59Z date_updated: 2022-03-25T07:49:35Z department: - _id: '76' language: - iso: eng main_file_link: - open_access: '1' url: https://drops.dagstuhl.de/opus/volltexte/2021/14045/ oa: '1' project: - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 - _id: '1' name: SFB 901 publication: European Conference on Object-Oriented Programming (ECOOP) status: public title: Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis type: conference user_id: '60543' year: '2021' ... --- _id: '30866' abstract: - lang: eng text: "Automated machine learning (AutoML) strives for the automatic configuration\r\nof machine learning algorithms and their composition into an overall (software)\r\nsolution - a machine learning pipeline - tailored to the learning task\r\n(dataset) at hand. Over the last decade, AutoML has developed into an\r\nindependent research field with hundreds of contributions. While AutoML offers\r\nmany prospects, it is also known to be quite resource-intensive, which is one\r\nof its major points of criticism. The primary cause for a high resource\r\nconsumption is that many approaches rely on the (costly) evaluation of many\r\nmachine learning pipelines while searching for good candidates. This problem is\r\namplified in the context of research on AutoML methods, due to large scale\r\nexperiments conducted with many datasets and approaches, each of them being run\r\nwith several repetitions to rule out random effects. In the spirit of recent\r\nwork on Green AI, this paper is written in an attempt to raise the awareness of\r\nAutoML researchers for the problem and to elaborate on possible remedies. To\r\nthis end, we identify four categories of actions the community may take towards\r\nmore sustainable research on AutoML, i.e. Green AutoML: design of AutoML\r\nsystems, benchmarking, transparency and research incentives." author: - first_name: Tanja full_name: Tornede, Tanja id: '40795' last_name: Tornede - first_name: Alexander full_name: Tornede, Alexander id: '38209' last_name: Tornede - first_name: Jonas Manuel full_name: Hanselle, Jonas Manuel id: '43980' last_name: Hanselle orcid: 0000-0002-1231-4985 - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Felix full_name: Mohr, Felix last_name: Mohr - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Tornede T, Tornede A, Hanselle JM, Wever MD, Mohr F, Hüllermeier E. Towards Green Automated Machine Learning: Status Quo and Future Directions. arXiv:211105850. Published online 2021.' apa: 'Tornede, T., Tornede, A., Hanselle, J. M., Wever, M. D., Mohr, F., & Hüllermeier, E. (2021). Towards Green Automated Machine Learning: Status Quo and Future Directions. In arXiv:2111.05850.' bibtex: '@article{Tornede_Tornede_Hanselle_Wever_Mohr_Hüllermeier_2021, title={Towards Green Automated Machine Learning: Status Quo and Future Directions}, journal={arXiv:2111.05850}, author={Tornede, Tanja and Tornede, Alexander and Hanselle, Jonas Manuel and Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2021} }' chicago: 'Tornede, Tanja, Alexander Tornede, Jonas Manuel Hanselle, Marcel Dominik Wever, Felix Mohr, and Eyke Hüllermeier. “Towards Green Automated Machine Learning: Status Quo and Future Directions.” ArXiv:2111.05850, 2021.' ieee: 'T. Tornede, A. Tornede, J. M. Hanselle, M. D. Wever, F. Mohr, and E. Hüllermeier, “Towards Green Automated Machine Learning: Status Quo and Future Directions,” arXiv:2111.05850. 2021.' mla: 'Tornede, Tanja, et al. “Towards Green Automated Machine Learning: Status Quo and Future Directions.” ArXiv:2111.05850, 2021.' short: T. Tornede, A. Tornede, J.M. Hanselle, M.D. Wever, F. Mohr, E. Hüllermeier, ArXiv:2111.05850 (2021). date_created: 2022-04-12T11:57:15Z date_updated: 2022-04-12T12:01:23Z department: - _id: '34' - _id: '7' - _id: '26' external_id: arxiv: - '2111.05850' language: - iso: eng 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' publication: arXiv:2111.05850 status: public title: 'Towards Green Automated Machine Learning: Status Quo and Future Directions' type: preprint user_id: '38209' year: '2021' ... --- _id: '27284' author: - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' citation: ama: Wever MD. Automated Machine Learning for Multi-Label Classification.; 2021. doi:10.17619/UNIPB/1-1302 apa: Wever, M. D. (2021). Automated Machine Learning for Multi-Label Classification. https://doi.org/10.17619/UNIPB/1-1302 bibtex: '@book{Wever_2021, title={Automated Machine Learning for Multi-Label Classification}, DOI={10.17619/UNIPB/1-1302}, author={Wever, Marcel Dominik}, year={2021} }' chicago: Wever, Marcel Dominik. Automated Machine Learning for Multi-Label Classification, 2021. https://doi.org/10.17619/UNIPB/1-1302. ieee: M. D. Wever, Automated Machine Learning for Multi-Label Classification. 2021. mla: Wever, Marcel Dominik. Automated Machine Learning for Multi-Label Classification. 2021, doi:10.17619/UNIPB/1-1302. short: M.D. Wever, Automated Machine Learning for Multi-Label Classification, 2021. date_created: 2021-11-08T14:05:19Z date_updated: 2022-04-13T09:39:56Z ddc: - '000' department: - _id: '355' doi: 10.17619/UNIPB/1-1302 file: - access_level: open_access content_type: application/pdf creator: wever date_created: 2022-04-13T09:35:25Z date_updated: 2022-04-13T09:39:56Z file_id: '30886' file_name: dissertation_publish_upload.pdf file_size: 8098177 relation: main_file file_date_updated: 2022-04-13T09:39:56Z has_accepted_license: '1' language: - iso: eng oa: '1' project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '10' name: SFB 901 - Subproject B2 publication_status: published status: public supervisor: - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier title: Automated Machine Learning for Multi-Label Classification type: dissertation user_id: '33176' year: '2021' ... --- _id: '22052' abstract: - lang: eng text: In this study, we describe a text processing pipeline that transforms user-generated text into structured data. To do this, we train neural and transformer-based models for aspect-based sentiment analysis. As most research deals with explicit aspects from product or service data, we extract and classify implicit and explicit aspect phrases from German-language physician review texts. Patients often rate on the basis of perceived friendliness or competence. The vocabulary is difficult, the topic sensitive, and the data user-generated. The aspect phrases come with various wordings using insertions and are not noun-based, which makes the presented case equally relevant and reality-based. To find complex, indirect aspect phrases, up-to-date deep learning approaches must be combined with supervised training data. We describe three aspect phrase datasets, one of them new, as well as a newly annotated aspect polarity dataset. Alongside this, we build an algorithm to rate the aspect phrase importance. All in all, we train eight transformers on the new raw data domain, compare 54 neural aspect extraction models and, based on this, create eight aspect polarity models for our pipeline. These models are evaluated by using Precision, Recall, and F-Score measures. Finally, we evaluate our aspect phrase importance measure algorithm. author: - first_name: Joschka full_name: Kersting, Joschka id: '58701' last_name: Kersting - first_name: Michaela full_name: Geierhos, Michaela id: '42496' last_name: Geierhos orcid: 0000-0002-8180-5606 citation: ama: 'Kersting J, Geierhos M. Human Language Comprehension in Aspect Phrase Extraction with Importance Weighting. In: Kapetanios E, Horacek H, Métais E, Meziane F, eds. Natural Language Processing and Information Systems. Vol 12801. Lecture Notes in Computer Science. Springer; 2021:231--242.' apa: Kersting, J., & Geierhos, M. (2021). Human Language Comprehension in Aspect Phrase Extraction with Importance Weighting. In E. Kapetanios, H. Horacek, E. Métais, & F. Meziane (Eds.), Natural Language Processing and Information Systems (Vol. 12801, pp. 231--242). Springer. bibtex: '@inbook{Kersting_Geierhos_2021, place={Saarbrücken, Germany}, series={Lecture Notes in Computer Science}, title={Human Language Comprehension in Aspect Phrase Extraction with Importance Weighting}, volume={12801}, booktitle={Natural Language Processing and Information Systems}, publisher={Springer}, author={Kersting, Joschka and Geierhos, Michaela}, editor={Kapetanios, Epaminondas and Horacek, Helmut and Métais, Elisabeth and Meziane, Farid}, year={2021}, pages={231--242}, collection={Lecture Notes in Computer Science} }' chicago: 'Kersting, Joschka, and Michaela Geierhos. “Human Language Comprehension in Aspect Phrase Extraction with Importance Weighting.” In Natural Language Processing and Information Systems, edited by Epaminondas Kapetanios, Helmut Horacek, Elisabeth Métais, and Farid Meziane, 12801:231--242. Lecture Notes in Computer Science. Saarbrücken, Germany: Springer, 2021.' ieee: 'J. Kersting and M. Geierhos, “Human Language Comprehension in Aspect Phrase Extraction with Importance Weighting,” in Natural Language Processing and Information Systems, vol. 12801, E. Kapetanios, H. Horacek, E. Métais, and F. Meziane, Eds. Saarbrücken, Germany: Springer, 2021, pp. 231--242.' mla: Kersting, Joschka, and Michaela Geierhos. “Human Language Comprehension in Aspect Phrase Extraction with Importance Weighting.” Natural Language Processing and Information Systems, edited by Epaminondas Kapetanios et al., vol. 12801, Springer, 2021, pp. 231--242. short: 'J. Kersting, M. Geierhos, in: E. Kapetanios, H. Horacek, E. Métais, F. Meziane (Eds.), Natural Language Processing and Information Systems, Springer, Saarbrücken, Germany, 2021, pp. 231--242.' conference: end_date: 2021-06-25 location: Saarbrücken, Germany name: 26th International Conference on Natural Language & Information Systems (NLDB 2021) start_date: 2021-06-23 date_created: 2021-05-07T16:31:05Z date_updated: 2022-07-14T08:00:56Z ddc: - '004' department: - _id: '579' editor: - first_name: Epaminondas full_name: Kapetanios, Epaminondas last_name: Kapetanios - first_name: Helmut full_name: Horacek, Helmut last_name: Horacek - first_name: Elisabeth full_name: Métais, Elisabeth last_name: Métais - first_name: Farid full_name: Meziane, Farid last_name: Meziane file: - access_level: closed content_type: application/pdf creator: jkers date_created: 2022-07-14T08:00:35Z date_updated: 2022-07-14T08:00:35Z file_id: '32362' file_name: Kersting & Geierhos (2021b), Kersting2021b.pdf file_size: 506329 relation: main_file success: 1 file_date_updated: 2022-07-14T08:00:35Z has_accepted_license: '1' intvolume: ' 12801' language: - iso: eng page: 231--242 place: Saarbrücken, Germany project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '9' name: SFB 901 - Subproject B1 publication: Natural Language Processing and Information Systems publication_status: published publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Human Language Comprehension in Aspect Phrase Extraction with Importance Weighting type: book_chapter user_id: '58701' volume: 12801 year: '2021' ... --- _id: '28199' author: - first_name: Felix full_name: Pauck, Felix id: '22398' last_name: Pauck - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Pauck F, Wehrheim H. Jicer: Simplifying Cooperative Android App Analysis Tasks. In: 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM). ; 2021. doi:10.1109/scam52516.2021.00031' apa: 'Pauck, F., & Wehrheim, H. (2021). Jicer: Simplifying Cooperative Android App Analysis Tasks. 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM). https://doi.org/10.1109/scam52516.2021.00031' bibtex: '@inproceedings{Pauck_Wehrheim_2021, title={Jicer: Simplifying Cooperative Android App Analysis Tasks}, DOI={10.1109/scam52516.2021.00031}, booktitle={2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)}, author={Pauck, Felix and Wehrheim, Heike}, year={2021} }' chicago: 'Pauck, Felix, and Heike Wehrheim. “Jicer: Simplifying Cooperative Android App Analysis Tasks.” In 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM), 2021. https://doi.org/10.1109/scam52516.2021.00031.' ieee: 'F. Pauck and H. Wehrheim, “Jicer: Simplifying Cooperative Android App Analysis Tasks,” 2021, doi: 10.1109/scam52516.2021.00031.' mla: 'Pauck, Felix, and Heike Wehrheim. “Jicer: Simplifying Cooperative Android App Analysis Tasks.” 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM), 2021, doi:10.1109/scam52516.2021.00031.' short: 'F. Pauck, H. Wehrheim, in: 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM), 2021.' date_created: 2021-12-01T08:53:29Z date_updated: 2022-11-17T14:26:19Z department: - _id: '77' doi: 10.1109/scam52516.2021.00031 language: - iso: eng project: - _id: '12' name: SFB 901 - Subproject B4 - _id: '1' name: 'SFB 901: SFB 901' - _id: '3' name: 'SFB 901 - B: SFB 901 - Project Area B' publication: 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM) publication_status: published status: public title: 'Jicer: Simplifying Cooperative Android App Analysis Tasks' type: conference user_id: '477' year: '2021' ... --- _id: '21178' abstract: - lang: eng text: "When engaging in argumentative discourse, skilled human debaters tailor\r\nclaims to the beliefs of the audience, to construct effective arguments.\r\nRecently, the field of computational argumentation witnessed extensive effort\r\nto address the automatic generation of arguments. However, existing approaches\r\ndo not perform any audience-specific adaptation. In this work, we aim to bridge\r\nthis gap by studying the task of belief-based claim generation: Given a\r\ncontroversial topic and a set of beliefs, generate an argumentative claim\r\ntailored to the beliefs. To tackle this task, we model the people's prior\r\nbeliefs through their stances on controversial topics and extend\r\nstate-of-the-art text generation models to generate claims conditioned on the\r\nbeliefs. Our automatic evaluation confirms the ability of our approach to adapt\r\nclaims to a set of given beliefs. In a manual study, we additionally evaluate\r\nthe generated claims in terms of informativeness and their likelihood to be\r\nuttered by someone with a respective belief. Our results reveal the limitations\r\nof modeling users' beliefs based on their stances, but demonstrate the\r\npotential of encoding beliefs into argumentative texts, laying the ground for\r\nfuture exploration of audience reach." author: - first_name: Milad full_name: Alshomary, Milad id: '73059' last_name: Alshomary - first_name: Wei-Fan full_name: Chen, Wei-Fan id: '82920' last_name: Chen - first_name: Timon full_name: Gurcke, Timon id: '52174' last_name: Gurcke - first_name: Henning full_name: Wachsmuth, Henning id: '3900' last_name: Wachsmuth citation: ama: 'Alshomary M, Chen W-F, Gurcke T, Wachsmuth H. Belief-based Generation of Argumentative Claims. In: Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume. Association for Computational Linguistics; 2021:224-223.' apa: 'Alshomary, M., Chen, W.-F., Gurcke, T., & Wachsmuth, H. (2021). Belief-based Generation of Argumentative Claims. Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume, 224–223.' bibtex: '@inproceedings{Alshomary_Chen_Gurcke_Wachsmuth_2021, title={Belief-based Generation of Argumentative Claims}, booktitle={Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume}, publisher={Association for Computational Linguistics}, author={Alshomary, Milad and Chen, Wei-Fan and Gurcke, Timon and Wachsmuth, Henning}, year={2021}, pages={224–223} }' chicago: 'Alshomary, Milad, Wei-Fan Chen, Timon Gurcke, and Henning Wachsmuth. “Belief-Based Generation of Argumentative Claims.” In Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume, 224–223. Association for Computational Linguistics, 2021.' ieee: 'M. Alshomary, W.-F. Chen, T. Gurcke, and H. Wachsmuth, “Belief-based Generation of Argumentative Claims,” in Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume, Online, 2021, pp. 224–223.' mla: 'Alshomary, Milad, et al. “Belief-Based Generation of Argumentative Claims.” Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume, Association for Computational Linguistics, 2021, pp. 224–223.' short: 'M. Alshomary, W.-F. Chen, T. Gurcke, H. Wachsmuth, in: Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume, Association for Computational Linguistics, 2021, pp. 224–223.' conference: location: Online name: 'Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume' date_created: 2021-02-05T08:00:07Z date_updated: 2022-05-09T15:01:53Z department: - _id: '600' language: - iso: eng main_file_link: - url: https://www.aclweb.org/anthology/2021.eacl-main.17 page: 224-223 project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '3' name: 'SFB 901 - B: SFB 901 - Project Area B' - _id: '9' name: 'SFB 901 - B1: SFB 901 - Subproject B1' publication: 'Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume' publisher: Association for Computational Linguistics status: public title: Belief-based Generation of Argumentative Claims type: conference user_id: '82920' year: '2021' ... --- _id: '23709' author: - first_name: Wei-Fan full_name: Chen, Wei-Fan id: '82920' last_name: Chen - first_name: Khalid full_name: Al Khatib, Khalid last_name: Al Khatib - first_name: Benno full_name: Stein, Benno last_name: Stein - first_name: Henning full_name: Wachsmuth, Henning id: '3900' last_name: Wachsmuth citation: ama: 'Chen W-F, Al Khatib K, Stein B, Wachsmuth H. Controlled Neural Sentence-Level Reframing of News Articles. In: Findings of the Association for Computational Linguistics: EMNLP 2021. ; 2021:2683-2693.' apa: 'Chen, W.-F., Al Khatib, K., Stein, B., & Wachsmuth, H. (2021). Controlled Neural Sentence-Level Reframing of News Articles. Findings of the Association for Computational Linguistics: EMNLP 2021, 2683–2693.' bibtex: '@inproceedings{Chen_Al Khatib_Stein_Wachsmuth_2021, title={Controlled Neural Sentence-Level Reframing of News Articles}, booktitle={Findings of the Association for Computational Linguistics: EMNLP 2021}, author={Chen, Wei-Fan and Al Khatib, Khalid and Stein, Benno and Wachsmuth, Henning}, year={2021}, pages={2683–2693} }' chicago: 'Chen, Wei-Fan, Khalid Al Khatib, Benno Stein, and Henning Wachsmuth. “Controlled Neural Sentence-Level Reframing of News Articles.” In Findings of the Association for Computational Linguistics: EMNLP 2021, 2683–93, 2021.' ieee: 'W.-F. Chen, K. Al Khatib, B. Stein, and H. Wachsmuth, “Controlled Neural Sentence-Level Reframing of News Articles,” in Findings of the Association for Computational Linguistics: EMNLP 2021, 2021, pp. 2683–2693.' mla: 'Chen, Wei-Fan, et al. “Controlled Neural Sentence-Level Reframing of News Articles.” Findings of the Association for Computational Linguistics: EMNLP 2021, 2021, pp. 2683–93.' short: 'W.-F. Chen, K. Al Khatib, B. Stein, H. Wachsmuth, in: Findings of the Association for Computational Linguistics: EMNLP 2021, 2021, pp. 2683–2693.' date_created: 2021-09-02T20:09:20Z date_updated: 2022-05-09T15:00:09Z department: - _id: '600' language: - iso: eng main_file_link: - url: https://aclanthology.org/2021.findings-emnlp.228.pdf page: 2683 - 2693 project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '3' name: 'SFB 901 - B: SFB 901 - Project Area B' - _id: '9' name: 'SFB 901 - B1: SFB 901 - Subproject B1' publication: 'Findings of the Association for Computational Linguistics: EMNLP 2021' status: public title: Controlled Neural Sentence-Level Reframing of News Articles type: conference user_id: '82920' year: '2021' ... --- _id: '22229' author: - first_name: Milad full_name: Alshomary, Milad id: '73059' last_name: Alshomary - first_name: Shahbaz full_name: Syed, Shahbaz last_name: Syed - first_name: Martin full_name: Potthast, Martin last_name: Potthast - first_name: Henning full_name: Wachsmuth, Henning id: '3900' last_name: Wachsmuth citation: ama: 'Alshomary M, Syed S, Potthast M, Wachsmuth H. Argument Undermining: Counter-Argument Generation by Attacking Weak Premises. In: Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021). Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021. Association for Computational Linguistics; 2021:1816–1827. doi:10.18653/v1/2021.findings-acl.159' apa: 'Alshomary, M., Syed, S., Potthast, M., & Wachsmuth, H. (2021). Argument Undermining: Counter-Argument Generation by Attacking Weak Premises. Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021), 1816–1827. https://doi.org/10.18653/v1/2021.findings-acl.159' bibtex: '@inproceedings{Alshomary_Syed_Potthast_Wachsmuth_2021, series={Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021}, title={Argument Undermining: Counter-Argument Generation by Attacking Weak Premises}, DOI={10.18653/v1/2021.findings-acl.159}, booktitle={Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)}, publisher={Association for Computational Linguistics}, author={Alshomary, Milad and Syed, Shahbaz and Potthast, Martin and Wachsmuth, Henning}, year={2021}, pages={1816–1827}, collection={Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021} }' chicago: 'Alshomary, Milad, Shahbaz Syed, Martin Potthast, and Henning Wachsmuth. “Argument Undermining: Counter-Argument Generation by Attacking Weak Premises.” In Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021), 1816–1827. Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021. Association for Computational Linguistics, 2021. https://doi.org/10.18653/v1/2021.findings-acl.159.' ieee: 'M. Alshomary, S. Syed, M. Potthast, and H. Wachsmuth, “Argument Undermining: Counter-Argument Generation by Attacking Weak Premises,” in Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021), Online, 2021, pp. 1816–1827, doi: 10.18653/v1/2021.findings-acl.159.' mla: 'Alshomary, Milad, et al. “Argument Undermining: Counter-Argument Generation by Attacking Weak Premises.” Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021), Association for Computational Linguistics, 2021, pp. 1816–1827, doi:10.18653/v1/2021.findings-acl.159.' short: 'M. Alshomary, S. Syed, M. Potthast, H. Wachsmuth, in: Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021), Association for Computational Linguistics, 2021, pp. 1816–1827.' conference: location: Online name: The Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021) date_created: 2021-05-26T07:06:18Z date_updated: 2022-05-09T15:06:36Z department: - _id: '600' doi: 10.18653/v1/2021.findings-acl.159 language: - iso: eng main_file_link: - url: https://aclanthology.org/2021.findings-acl.159.pdf page: 1816–1827 project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '3' name: 'SFB 901 - B: SFB 901 - Project Area B' - _id: '9' name: 'SFB 901 - B1: SFB 901 - Subproject B1' publication: Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021) publisher: Association for Computational Linguistics series_title: 'Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021' status: public title: 'Argument Undermining: Counter-Argument Generation by Attacking Weak Premises' type: conference user_id: '82920' year: '2021' ... --- _id: '21198' author: - first_name: Jonas Manuel full_name: Hanselle, Jonas Manuel id: '43980' last_name: Hanselle orcid: 0000-0002-1231-4985 - first_name: Alexander full_name: Tornede, Alexander id: '38209' last_name: Tornede - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Hanselle JM, Tornede A, Wever MD, Hüllermeier E. Algorithm Selection as Superset Learning: Constructing Algorithm Selectors from Imprecise Performance Data. Published online 2021.' apa: 'Hanselle, J. M., Tornede, A., Wever, M. D., & Hüllermeier, E. (2021). Algorithm Selection as Superset Learning: Constructing Algorithm Selectors from Imprecise Performance Data. The 25th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-2021), Delhi, India.' bibtex: '@article{Hanselle_Tornede_Wever_Hüllermeier_2021, series={PAKDD}, title={Algorithm Selection as Superset Learning: Constructing Algorithm Selectors from Imprecise Performance Data}, author={Hanselle, Jonas Manuel and Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2021}, collection={PAKDD} }' chicago: 'Hanselle, Jonas Manuel, Alexander Tornede, Marcel Dominik Wever, and Eyke Hüllermeier. “Algorithm Selection as Superset Learning: Constructing Algorithm Selectors from Imprecise Performance Data.” PAKDD, 2021.' ieee: 'J. M. Hanselle, A. Tornede, M. D. Wever, and E. Hüllermeier, “Algorithm Selection as Superset Learning: Constructing Algorithm Selectors from Imprecise Performance Data.” 2021.' mla: 'Hanselle, Jonas Manuel, et al. Algorithm Selection as Superset Learning: Constructing Algorithm Selectors from Imprecise Performance Data. 2021.' short: J.M. Hanselle, A. Tornede, M.D. Wever, E. Hüllermeier, (2021). conference: end_date: 2021-05-14 location: Delhi, India name: The 25th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-2021) start_date: 2021-05-11 date_created: 2021-02-09T09:30:14Z date_updated: 2022-08-24T12:49:06Z department: - _id: '34' - _id: '355' - _id: '26' language: - iso: eng 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 series_title: PAKDD status: public title: 'Algorithm Selection as Superset Learning: Constructing Algorithm Selectors from Imprecise Performance Data' type: conference user_id: '38209' year: '2021' ... --- _id: '27841' abstract: - lang: eng text: Verification of software and processor hardware usually proceeds separately, software analysis relying on the correctness of processors executing machine instructions. This assumption is valid as long as the software runs on standard CPUs that have been extensively validated and are in wide use. However, for processors exploiting custom instruction set extensions to meet performance and energy constraints the validation might be less extensive, challenging the correctness assumption. In this paper we present a novel formal approach for hardware/software co-verification targeting processors with custom instruction set extensions. We detail two different approaches for checking whether the hardware fulfills the requirements expected by the software analysis. The approaches are designed to explore a trade-off between generality of the verification and computational effort. Then, we describe the integration of software and hardware analyses for both techniques and describe a fully automated tool chain implementing the approaches. Finally, we demonstrate and compare the two approaches on example source code with custom instructions, using state-of-the-art software analysis and hardware verification techniques. author: - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Felix full_name: Pauck, Felix id: '22398' last_name: Pauck - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim - first_name: Tobias full_name: Wiersema, Tobias id: '3118' last_name: Wiersema citation: ama: Jakobs M-C, Pauck F, Platzner M, Wehrheim H, Wiersema T. Software/Hardware Co-Verification for Custom Instruction Set Processors. IEEE Access. Published online 2021. doi:10.1109/ACCESS.2021.3131213 apa: Jakobs, M.-C., Pauck, F., Platzner, M., Wehrheim, H., & Wiersema, T. (2021). Software/Hardware Co-Verification for Custom Instruction Set Processors. IEEE Access. https://doi.org/10.1109/ACCESS.2021.3131213 bibtex: '@article{Jakobs_Pauck_Platzner_Wehrheim_Wiersema_2021, title={Software/Hardware Co-Verification for Custom Instruction Set Processors}, DOI={10.1109/ACCESS.2021.3131213}, journal={IEEE Access}, publisher={IEEE}, author={Jakobs, Marie-Christine and Pauck, Felix and Platzner, Marco and Wehrheim, Heike and Wiersema, Tobias}, year={2021} }' chicago: Jakobs, Marie-Christine, Felix Pauck, Marco Platzner, Heike Wehrheim, and Tobias Wiersema. “Software/Hardware Co-Verification for Custom Instruction Set Processors.” IEEE Access, 2021. https://doi.org/10.1109/ACCESS.2021.3131213. ieee: 'M.-C. Jakobs, F. Pauck, M. Platzner, H. Wehrheim, and T. Wiersema, “Software/Hardware Co-Verification for Custom Instruction Set Processors,” IEEE Access, 2021, doi: 10.1109/ACCESS.2021.3131213.' mla: Jakobs, Marie-Christine, et al. “Software/Hardware Co-Verification for Custom Instruction Set Processors.” IEEE Access, IEEE, 2021, doi:10.1109/ACCESS.2021.3131213. short: M.-C. Jakobs, F. Pauck, M. Platzner, H. Wehrheim, T. Wiersema, IEEE Access (2021). date_created: 2021-11-25T14:12:22Z date_updated: 2023-01-18T08:34:50Z department: - _id: '78' doi: 10.1109/ACCESS.2021.3131213 funded_apc: '1' keyword: - Software Analysis - Abstract Interpretation - Custom Instruction - Hardware Verification language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 publication: IEEE Access publication_status: published publisher: IEEE quality_controlled: '1' status: public title: Software/Hardware Co-Verification for Custom Instruction Set Processors type: journal_article user_id: '22398' year: '2021' ... --- _id: '21238' author: - first_name: Felix full_name: Pauck, Felix id: '22398' last_name: Pauck - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Pauck F, Wehrheim H. Cooperative Android App Analysis with CoDiDroid. In: Koziolek A, Schaefer I, Seidl C, eds. Software Engineering 2021. Gesellschaft für Informatik e.V.; 2021:83-84. doi:10.18420/SE2021_30 ' apa: Pauck, F., & Wehrheim, H. (2021). Cooperative Android App Analysis with CoDiDroid. In A. Koziolek, I. Schaefer, & C. Seidl (Eds.), Software Engineering 2021 (pp. 83–84). Gesellschaft für Informatik e.V. https://doi.org/10.18420/SE2021_30 bibtex: '@inproceedings{Pauck_Wehrheim_2021, place={Bonn}, title={Cooperative Android App Analysis with CoDiDroid}, DOI={10.18420/SE2021_30 }, booktitle={Software Engineering 2021}, publisher={Gesellschaft für Informatik e.V.}, author={Pauck, Felix and Wehrheim, Heike}, editor={Koziolek, Anne and Schaefer, Ina and Seidl, Christoph}, year={2021}, pages={83–84} }' chicago: 'Pauck, Felix, and Heike Wehrheim. “Cooperative Android App Analysis with CoDiDroid.” In Software Engineering 2021, edited by Anne Koziolek, Ina Schaefer, and Christoph Seidl, 83–84. Bonn: Gesellschaft für Informatik e.V., 2021. https://doi.org/10.18420/SE2021_30 .' ieee: 'F. Pauck and H. Wehrheim, “Cooperative Android App Analysis with CoDiDroid,” in Software Engineering 2021, 2021, pp. 83–84, doi: 10.18420/SE2021_30 .' mla: Pauck, Felix, and Heike Wehrheim. “Cooperative Android App Analysis with CoDiDroid.” Software Engineering 2021, edited by Anne Koziolek et al., Gesellschaft für Informatik e.V., 2021, pp. 83–84, doi:10.18420/SE2021_30 . short: 'F. Pauck, H. Wehrheim, in: A. Koziolek, I. Schaefer, C. Seidl (Eds.), Software Engineering 2021, Gesellschaft für Informatik e.V., Bonn, 2021, pp. 83–84.' date_created: 2021-02-16T09:28:49Z date_updated: 2023-01-18T08:35:20Z department: - _id: '77' doi: '10.18420/SE2021_30 ' editor: - first_name: Anne full_name: Koziolek, Anne last_name: Koziolek - first_name: Ina full_name: Schaefer, Ina last_name: Schaefer - first_name: Christoph full_name: Seidl, Christoph last_name: Seidl language: - iso: eng page: ' 83-84 ' place: Bonn project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 publication: Software Engineering 2021 publication_status: published publisher: Gesellschaft für Informatik e.V. status: public title: Cooperative Android App Analysis with CoDiDroid type: conference user_id: '22398' year: '2021' ... --- _id: '29138' author: - first_name: Qazi Arbab full_name: Ahmed, Qazi Arbab id: '72764' last_name: Ahmed orcid: 0000-0002-1837-2254 citation: ama: 'Ahmed QA. Hardware Trojans in Reconfigurable Computing. In: 2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC). ; 2021. doi:10.1109/vlsi-soc53125.2021.9606974' apa: Ahmed, Q. A. (2021). Hardware Trojans in Reconfigurable Computing. 2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC). https://doi.org/10.1109/vlsi-soc53125.2021.9606974 bibtex: '@inproceedings{Ahmed_2021, title={Hardware Trojans in Reconfigurable Computing}, DOI={10.1109/vlsi-soc53125.2021.9606974}, booktitle={2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC)}, author={Ahmed, Qazi Arbab}, year={2021} }' chicago: Ahmed, Qazi Arbab. “Hardware Trojans in Reconfigurable Computing.” In 2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC), 2021. https://doi.org/10.1109/vlsi-soc53125.2021.9606974. ieee: 'Q. A. Ahmed, “Hardware Trojans in Reconfigurable Computing,” 2021, doi: 10.1109/vlsi-soc53125.2021.9606974.' mla: Ahmed, Qazi Arbab. “Hardware Trojans in Reconfigurable Computing.” 2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC), 2021, doi:10.1109/vlsi-soc53125.2021.9606974. short: 'Q.A. Ahmed, in: 2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC), 2021.' date_created: 2021-12-30T00:02:24Z date_updated: 2023-04-19T15:03:45Z department: - _id: '78' doi: 10.1109/vlsi-soc53125.2021.9606974 language: - iso: eng 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' publication: 2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC) publication_status: published status: public title: Hardware Trojans in Reconfigurable Computing type: conference user_id: '72764' year: '2021' ... --- _id: '20681' abstract: - lang: eng text: The battle of developing hardware Trojans and corresponding countermeasures has taken adversaries towards ingenious ways of compromising hardware designs by circumventing even advanced testing and verification methods. Besides conventional methods of inserting Trojans into a design by a malicious entity, the design flow for field-programmable gate arrays (FPGAs) can also be surreptitiously compromised to assist the attacker to perform a successful malfunctioning or information leakage attack. The advanced stealthy malicious look-up-table (LUT) attack activates a Trojan only when generating the FPGA bitstream and can thus not be detected by register transfer and gate level testing and verification. However, also this attack was recently revealed by a bitstream-level proof-carrying hardware (PCH) approach. In this paper, we present a novel attack that leverages malicious routing of the inserted Trojan circuit to acquire a dormant state even in the generated and transmitted bitstream. The Trojan's payload is connected to primary inputs/outputs of the FPGA via a programmable interconnect point (PIP). The Trojan is detached from inputs/outputs during place-and-route and re-connected only when the FPGA is being programmed, thus activating the Trojan circuit without any need for a trigger logic. Since the Trojan is injected in a post-synthesis step and remains unconnected in the bitstream, the presented attack can currently neither be prevented by conventional testing and verification methods nor by recent bitstream-level verification techniques. author: - first_name: Qazi Arbab full_name: Ahmed, Qazi Arbab id: '72764' last_name: Ahmed orcid: 0000-0002-1837-2254 - first_name: Tobias full_name: Wiersema, Tobias id: '3118' last_name: Wiersema - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: ama: 'Ahmed QA, Wiersema T, Platzner M. Malicious Routing: Circumventing Bitstream-level Verification for FPGAs. In: 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE). 2021 Design, Automation and Test in Europe Conference (DATE); 2021. doi:10.23919/DATE51398.2021.9474026' apa: 'Ahmed, Q. A., Wiersema, T., & Platzner, M. (2021). Malicious Routing: Circumventing Bitstream-level Verification for FPGAs. 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE). Design, Automation and Test in Europe Conference (DATE’21), Alpexpo | Grenoble, France. https://doi.org/10.23919/DATE51398.2021.9474026' bibtex: '@inproceedings{Ahmed_Wiersema_Platzner_2021, place={Alpexpo | Grenoble, France}, title={Malicious Routing: Circumventing Bitstream-level Verification for FPGAs}, DOI={10.23919/DATE51398.2021.9474026}, booktitle={2021 Design, Automation & Test in Europe Conference & Exhibition (DATE)}, publisher={2021 Design, Automation and Test in Europe Conference (DATE)}, author={Ahmed, Qazi Arbab and Wiersema, Tobias and Platzner, Marco}, year={2021} }' chicago: 'Ahmed, Qazi Arbab, Tobias Wiersema, and Marco Platzner. “Malicious Routing: Circumventing Bitstream-Level Verification for FPGAs.” In 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE). Alpexpo | Grenoble, France: 2021 Design, Automation and Test in Europe Conference (DATE), 2021. https://doi.org/10.23919/DATE51398.2021.9474026.' ieee: 'Q. A. Ahmed, T. Wiersema, and M. Platzner, “Malicious Routing: Circumventing Bitstream-level Verification for FPGAs,” presented at the Design, Automation and Test in Europe Conference (DATE’21), Alpexpo | Grenoble, France, 2021, doi: 10.23919/DATE51398.2021.9474026.' mla: 'Ahmed, Qazi Arbab, et al. “Malicious Routing: Circumventing Bitstream-Level Verification for FPGAs.” 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE), 2021 Design, Automation and Test in Europe Conference (DATE), 2021, doi:10.23919/DATE51398.2021.9474026.' short: 'Q.A. Ahmed, T. Wiersema, M. Platzner, in: 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE), 2021 Design, Automation and Test in Europe Conference (DATE), Alpexpo | Grenoble, France, 2021.' conference: end_date: 2021-02-05 location: Alpexpo | Grenoble, France name: Design, Automation and Test in Europe Conference (DATE'21) start_date: 2021-02-01 date_created: 2020-12-07T14:03:00Z date_updated: 2023-05-11T09:16:34Z ddc: - '006' department: - _id: '78' doi: 10.23919/DATE51398.2021.9474026 file: - access_level: closed content_type: application/pdf creator: qazi date_created: 2023-05-11T09:16:15Z date_updated: 2023-05-11T09:16:15Z file_id: '44752' file_name: 1812.pdf file_size: 394011 relation: main_file success: 1 file_date_updated: 2023-05-11T09:16:15Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' oa: '1' place: Alpexpo | Grenoble, France project: - _id: '12' name: SFB 901 - Subproject B4 - _id: '3' name: SFB 901 - Project Area B - _id: '1' name: SFB 901 publication: 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE) publication_identifier: eisbn: - 978-3-9819263-5-4 publication_status: published publisher: 2021 Design, Automation and Test in Europe Conference (DATE) status: public title: 'Malicious Routing: Circumventing Bitstream-level Verification for FPGAs' type: conference user_id: '72764' year: '2021' ... --- _id: '26406' author: - first_name: Philipp full_name: Schubert, Philipp id: '60543' last_name: Schubert orcid: 0000-0002-8674-1859 - first_name: Ben full_name: Hermann, Ben id: '66173' last_name: Hermann orcid: 0000-0001-9848-2017 - first_name: Eric full_name: Bodden, Eric id: '59256' last_name: Bodden orcid: 0000-0003-3470-3647 - first_name: Richard full_name: Leer, Richard last_name: Leer citation: ama: 'Schubert P, Hermann B, Bodden E, Leer R. Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++. In: SCAM ’21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track). ; 2021.' apa: 'Schubert, P., Hermann, B., Bodden, E., & Leer, R. (2021). Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++. SCAM ’21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track).' bibtex: '@inproceedings{Schubert_Hermann_Bodden_Leer_2021, title={Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++}, booktitle={SCAM ’21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track)}, author={Schubert, Philipp and Hermann, Ben and Bodden, Eric and Leer, Richard}, year={2021} }' chicago: 'Schubert, Philipp, Ben Hermann, Eric Bodden, and Richard Leer. “Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++.” In SCAM ’21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track), 2021.' ieee: 'P. Schubert, B. Hermann, E. Bodden, and R. Leer, “Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++,” 2021.' mla: 'Schubert, Philipp, et al. “Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++.” SCAM ’21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track), 2021.' short: 'P. Schubert, B. Hermann, E. Bodden, R. Leer, in: SCAM ’21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track), 2021.' date_created: 2021-10-18T12:52:12Z date_updated: 2023-06-15T08:39:55Z department: - _id: '76' language: - iso: eng project: - _id: '3' name: 'SFB 901 - B: SFB 901 - Project Area B' - _id: '12' name: 'SFB 901 - B4: SFB 901 - Subproject B4' - _id: '1' grant_number: '160364472' name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ' publication: 'SCAM ''21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track)' status: public title: 'Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++' type: conference user_id: '15249' year: '2021' ... --- _id: '26405' author: - first_name: Philipp full_name: Schubert, Philipp id: '60543' last_name: Schubert orcid: 0000-0002-8674-1859 - first_name: Florian full_name: Sattler, Florian last_name: Sattler - first_name: Fabian full_name: Schiebel, Fabian last_name: Schiebel - first_name: Ben full_name: Hermann, Ben id: '66173' last_name: Hermann orcid: 0000-0001-9848-2017 - first_name: Eric full_name: Bodden, Eric id: '59256' last_name: Bodden orcid: 0000-0003-3470-3647 citation: ama: 'Schubert P, Sattler F, Schiebel F, Hermann B, Bodden E. Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++. In: 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM). ; 2021.' apa: Schubert, P., Sattler, F., Schiebel, F., Hermann, B., & Bodden, E. (2021). Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++. 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM). bibtex: '@inproceedings{Schubert_Sattler_Schiebel_Hermann_Bodden_2021, title={Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++}, booktitle={2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)}, author={Schubert, Philipp and Sattler, Florian and Schiebel, Fabian and Hermann, Ben and Bodden, Eric}, year={2021} }' chicago: Schubert, Philipp, Florian Sattler, Fabian Schiebel, Ben Hermann, and Eric Bodden. “Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++.” In 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM), 2021. ieee: P. Schubert, F. Sattler, F. Schiebel, B. Hermann, and E. Bodden, “Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++,” 2021. mla: Schubert, Philipp, et al. “Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++.” 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM), 2021. short: 'P. Schubert, F. Sattler, F. Schiebel, B. Hermann, E. Bodden, in: 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM), 2021.' date_created: 2021-10-18T12:50:35Z date_updated: 2023-06-15T08:57:24Z department: - _id: '76' language: - iso: eng project: - _id: '12' name: 'SFB 901 - B4: SFB 901 - Subproject B4' - _id: '3' name: 'SFB 901 - B: SFB 901 - Project Area B' - _id: '1' grant_number: '160364472' name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ' publication: 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM) status: public title: Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++ type: conference user_id: '15249' year: '2021' ... --- _id: '45788' author: - first_name: Jonas full_name: Bülling, Jonas last_name: Bülling citation: ama: 'Bülling J. Political Speaker Transfer: Learning to Generate Text in the Styles of Barack Obama and Donald Trump.; 2021.' apa: 'Bülling, J. (2021). Political Speaker Transfer: Learning to Generate Text in the Styles of Barack Obama and Donald Trump.' bibtex: '@book{Bülling_2021, title={Political Speaker Transfer: Learning to Generate Text in the Styles of Barack Obama and Donald Trump}, author={Bülling, Jonas}, year={2021} }' chicago: 'Bülling, Jonas. Political Speaker Transfer: Learning to Generate Text in the Styles of Barack Obama and Donald Trump, 2021.' ieee: 'J. Bülling, Political Speaker Transfer: Learning to Generate Text in the Styles of Barack Obama and Donald Trump. 2021.' mla: 'Bülling, Jonas. Political Speaker Transfer: Learning to Generate Text in the Styles of Barack Obama and Donald Trump. 2021.' short: 'J. Bülling, Political Speaker Transfer: Learning to Generate Text in the Styles of Barack Obama and Donald Trump, 2021.' date_created: 2023-06-27T12:54:30Z date_updated: 2023-07-05T07:32:18Z department: - _id: '600' language: - iso: eng project: - _id: '9' grant_number: '160364472' name: 'SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)' - _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' status: public supervisor: - first_name: Henning full_name: Wachsmuth, Henning id: '3900' last_name: Wachsmuth title: 'Political Speaker Transfer: Learning to Generate Text in the Styles of Barack Obama and Donald Trump' type: mastersthesis user_id: '477' year: '2021' ... --- _id: '45787' author: - first_name: Avishek full_name: Mishra, Avishek last_name: Mishra citation: ama: Mishra A. Computational Text Professionalization Using Neural Sequence-to-Sequence Models.; 2021. apa: Mishra, A. (2021). Computational Text Professionalization using Neural Sequence-to-Sequence Models. bibtex: '@book{Mishra_2021, title={Computational Text Professionalization using Neural Sequence-to-Sequence Models}, author={Mishra, Avishek}, year={2021} }' chicago: Mishra, Avishek. Computational Text Professionalization Using Neural Sequence-to-Sequence Models, 2021. ieee: A. Mishra, Computational Text Professionalization using Neural Sequence-to-Sequence Models. 2021. mla: Mishra, Avishek. Computational Text Professionalization Using Neural Sequence-to-Sequence Models. 2021. short: A. Mishra, Computational Text Professionalization Using Neural Sequence-to-Sequence Models, 2021. date_created: 2023-06-27T12:51:08Z date_updated: 2023-07-05T07:32:50Z department: - _id: '600' language: - iso: eng project: - _id: '9' grant_number: '160364472' name: 'SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)' - _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' status: public supervisor: - first_name: Henning full_name: Wachsmuth, Henning id: '3900' last_name: Wachsmuth title: Computational Text Professionalization using Neural Sequence-to-Sequence Models type: mastersthesis user_id: '477' year: '2021' ... --- _id: '19656' author: - first_name: Arnab full_name: Sharma, Arnab id: '67200' last_name: Sharma - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Sharma A, Wehrheim H. Automatic Fairness Testing of Machine Learning Models. In: Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS). LNCS. Springer.' apa: Sharma, A., & Wehrheim, H. (n.d.). Automatic Fairness Testing of Machine Learning Models. In Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS). Springer. bibtex: '@inproceedings{Sharma_Wehrheim, series={LNCS}, title={Automatic Fairness Testing of Machine Learning Models}, booktitle={Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)}, publisher={Springer}, author={Sharma, Arnab and Wehrheim, Heike}, collection={LNCS} }' chicago: Sharma, Arnab, and Heike Wehrheim. “Automatic Fairness Testing of Machine Learning Models.” In Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS). LNCS. Springer, n.d. ieee: A. Sharma and H. Wehrheim, “Automatic Fairness Testing of Machine Learning Models,” in Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS). mla: Sharma, Arnab, and Heike Wehrheim. “Automatic Fairness Testing of Machine Learning Models.” Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS), Springer. short: 'A. Sharma, H. Wehrheim, in: Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS), Springer, n.d.' date_created: 2020-09-24T12:53:02Z date_updated: 2022-01-06T06:54:09Z department: - _id: '7' - _id: '77' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subproject B3 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS) publication_status: accepted publisher: Springer series_title: LNCS status: public title: Automatic Fairness Testing of Machine Learning Models type: conference user_id: '477' year: '2020' ... --- _id: '19999' author: - first_name: Stefan full_name: Mayer, Stefan last_name: Mayer citation: ama: Mayer S. Optimierung von JMCTest Beim Testen von Inter Method Contracts. Universität Paderborn; 2020. apa: Mayer, S. (2020). Optimierung von JMCTest beim Testen von Inter Method Contracts. Universität Paderborn. bibtex: '@book{Mayer_2020, title={Optimierung von JMCTest beim Testen von Inter Method Contracts}, publisher={Universität Paderborn}, author={Mayer, Stefan}, year={2020} }' chicago: Mayer, Stefan. Optimierung von JMCTest Beim Testen von Inter Method Contracts. Universität Paderborn, 2020. ieee: S. Mayer, Optimierung von JMCTest beim Testen von Inter Method Contracts. Universität Paderborn, 2020. mla: Mayer, Stefan. Optimierung von JMCTest Beim Testen von Inter Method Contracts. Universität Paderborn, 2020. short: S. Mayer, Optimierung von JMCTest Beim Testen von Inter Method Contracts, Universität Paderborn, 2020. date_created: 2020-10-15T05:15:46Z date_updated: 2022-01-06T06:54:18Z department: - _id: '7' - _id: '77' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '11' name: SFB 901 - Subproject B3 publisher: Universität Paderborn status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim title: Optimierung von JMCTest beim Testen von Inter Method Contracts type: bachelorsthesis user_id: '477' year: '2020' ... --- _id: '17347' abstract: - lang: eng text: Peer-to-Peer news portals allow Internet users to write news articles and make them available online to interested readers. Despite the fact that authors are free in their choice of topics, there are a number of quality characteristics that an article must meet before it is published. In addition to meaningful titles, comprehensibly written texts and meaning- ful images, relevant tags are an important criteria for the quality of such news. In this case study, we discuss the challenges and common mistakes that Peer-to-Peer reporters face when tagging news and how incorrect information can be corrected through the orchestration of existing Natu- ral Language Processing services. Lastly, we use this illustrative example to give insight into the challenges of dealing with bottom-up taxonomies. author: - first_name: Frederik Simon full_name: Bäumer, Frederik Simon id: '38837' last_name: Bäumer - first_name: Joschka full_name: Kersting, Joschka id: '58701' last_name: Kersting - first_name: Bianca full_name: Buff, Bianca last_name: Buff - first_name: Michaela full_name: Geierhos, Michaela id: '42496' last_name: Geierhos orcid: 0000-0002-8180-5606 citation: ama: 'Bäumer FS, Kersting J, Buff B, Geierhos M. Tag Me If You Can: Insights into the Challenges of Supporting Unrestricted P2P News Tagging. In: Audrius L, Rita B, Daina G, Vilma S, eds. Information and Software Technologies. Vol 1283. Communications in Computer and Information Science. Springer; 2020:368--382. doi:https://doi.org/10.1007/978-3-030-59506-7_30' apa: 'Bäumer, F. S., Kersting, J., Buff, B., & Geierhos, M. (2020). Tag Me If You Can: Insights into the Challenges of Supporting Unrestricted P2P News Tagging. In L. Audrius, B. Rita, G. Daina, & S. Vilma (Eds.), Information and Software Technologies (Vol. 1283, pp. 368--382). Kaunas, Litauen: Springer. https://doi.org/10.1007/978-3-030-59506-7_30' bibtex: '@inbook{Bäumer_Kersting_Buff_Geierhos_2020, series={Communications in Computer and Information Science}, title={Tag Me If You Can: Insights into the Challenges of Supporting Unrestricted P2P News Tagging}, volume={1283}, DOI={https://doi.org/10.1007/978-3-030-59506-7_30}, booktitle={Information and Software Technologies}, publisher={Springer}, author={Bäumer, Frederik Simon and Kersting, Joschka and Buff, Bianca and Geierhos, Michaela}, editor={Audrius, Lopata and Rita, Butkienė and Daina, Gudonienė and Vilma, SukackėEditors}, year={2020}, pages={368--382}, collection={Communications in Computer and Information Science} }' chicago: 'Bäumer, Frederik Simon, Joschka Kersting, Bianca Buff, and Michaela Geierhos. “Tag Me If You Can: Insights into the Challenges of Supporting Unrestricted P2P News Tagging.” In Information and Software Technologies, edited by Lopata Audrius, Butkienė Rita, Gudonienė Daina, and Sukackė Vilma, 1283:368--382. Communications in Computer and Information Science. Springer, 2020. https://doi.org/10.1007/978-3-030-59506-7_30.' ieee: 'F. S. Bäumer, J. Kersting, B. Buff, and M. Geierhos, “Tag Me If You Can: Insights into the Challenges of Supporting Unrestricted P2P News Tagging,” in Information and Software Technologies, vol. 1283, L. Audrius, B. Rita, G. Daina, and S. Vilma, Eds. Springer, 2020, pp. 368--382.' mla: 'Bäumer, Frederik Simon, et al. “Tag Me If You Can: Insights into the Challenges of Supporting Unrestricted P2P News Tagging.” Information and Software Technologies, edited by Lopata Audrius et al., vol. 1283, Springer, 2020, pp. 368--382, doi:https://doi.org/10.1007/978-3-030-59506-7_30.' short: 'F.S. Bäumer, J. Kersting, B. Buff, M. Geierhos, in: L. Audrius, B. Rita, G. Daina, S. Vilma (Eds.), Information and Software Technologies, Springer, 2020, pp. 368--382.' conference: end_date: 2020-10-17 location: Kaunas, Litauen name: 26th International Conference on Information and Software Technologies (ICIST 2020) start_date: 2020-10-15 date_created: 2020-06-26T14:23:52Z date_updated: 2022-01-06T06:53:08Z ddc: - '004' department: - _id: '579' - _id: '1' - _id: '36' doi: https://doi.org/10.1007/978-3-030-59506-7_30 editor: - first_name: Lopata full_name: Audrius, Lopata last_name: Audrius - first_name: Butkienė full_name: Rita, Butkienė last_name: Rita - first_name: Gudonienė full_name: Daina, Gudonienė last_name: Daina - first_name: Sukackė full_name: Vilma, Sukackė last_name: Vilma file: - access_level: closed content_type: application/pdf creator: jkers date_created: 2020-11-07T19:47:30Z date_updated: 2020-11-07T19:47:30Z file_id: '20309' file_name: Bäumer et al. (2020), Baeumer2020.pdf .pdf file_size: 599881 relation: main_file success: 1 file_date_updated: 2020-11-07T19:47:30Z has_accepted_license: '1' intvolume: ' 1283' language: - iso: eng page: 368--382 project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '9' name: SFB 901 - Subproject B1 publication: Information and Software Technologies publication_status: published publisher: Springer series_title: Communications in Computer and Information Science status: public title: 'Tag Me If You Can: Insights into the Challenges of Supporting Unrestricted P2P News Tagging' type: book_chapter user_id: '58701' volume: 1283 year: '2020' ... --- _id: '17358' abstract: - lang: eng text: 'Approximate circuits trade-off computational accuracy against improvements in hardware area, delay, or energy consumption. IP core vendors who wish to create such circuits need to convince consumers of the resulting approximation quality. As a solution we propose proof-carrying approximate circuits: The vendor creates an approximate IP core together with a certificate that proves the approximation quality. The proof certificate is bundled with the approximate IP core and sent off to the consumer. The consumer can formally verify the approximation quality of the IP core at a fraction of the typical computational cost for formal verification. In this paper, we first make the case for proof-carrying approximate circuits and then demonstrate the feasibility of the approach by a set of synthesis experiments using an exemplary approximation framework.' article_type: original author: - first_name: Linus Matthias full_name: Witschen, Linus Matthias id: '49051' last_name: Witschen - first_name: Tobias full_name: Wiersema, Tobias id: '3118' last_name: Wiersema - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: ama: Witschen LM, Wiersema T, Platzner M. Proof-carrying Approximate Circuits. IEEE Transactions On Very Large Scale Integration Systems. 2020;28(9):2084-2088. doi:10.1109/TVLSI.2020.3008061 apa: Witschen, L. M., Wiersema, T., & Platzner, M. (2020). Proof-carrying Approximate Circuits. IEEE Transactions On Very Large Scale Integration Systems, 28(9), 2084–2088. https://doi.org/10.1109/TVLSI.2020.3008061 bibtex: '@article{Witschen_Wiersema_Platzner_2020, title={Proof-carrying Approximate Circuits}, volume={28}, DOI={10.1109/TVLSI.2020.3008061}, number={9}, journal={IEEE Transactions On Very Large Scale Integration Systems}, publisher={IEEE}, author={Witschen, Linus Matthias and Wiersema, Tobias and Platzner, Marco}, year={2020}, pages={2084–2088} }' chicago: 'Witschen, Linus Matthias, Tobias Wiersema, and Marco Platzner. “Proof-Carrying Approximate Circuits.” IEEE Transactions On Very Large Scale Integration Systems 28, no. 9 (2020): 2084–88. https://doi.org/10.1109/TVLSI.2020.3008061.' ieee: L. M. Witschen, T. Wiersema, and M. Platzner, “Proof-carrying Approximate Circuits,” IEEE Transactions On Very Large Scale Integration Systems, vol. 28, no. 9, pp. 2084–2088, 2020. mla: Witschen, Linus Matthias, et al. “Proof-Carrying Approximate Circuits.” IEEE Transactions On Very Large Scale Integration Systems, vol. 28, no. 9, IEEE, 2020, pp. 2084–88, doi:10.1109/TVLSI.2020.3008061. short: L.M. Witschen, T. Wiersema, M. Platzner, IEEE Transactions On Very Large Scale Integration Systems 28 (2020) 2084–2088. date_created: 2020-07-06T11:21:30Z date_updated: 2022-01-06T06:53:09Z department: - _id: '78' doi: 10.1109/TVLSI.2020.3008061 funded_apc: '1' intvolume: ' 28' issue: '9' keyword: - Approximate circuit synthesis - approximate computing - error metrics - formal verification - proof-carrying hardware language: - iso: eng page: 2084 - 2088 project: - _id: '12' name: SFB 901 - Subproject B4 - _id: '3' name: SFB 901 - Project Area B - _id: '1' name: SFB 901 publication: IEEE Transactions On Very Large Scale Integration Systems publication_identifier: eissn: - 1557-9999 issn: - 1063-8210 publication_status: published publisher: IEEE quality_controlled: '1' status: public title: Proof-carrying Approximate Circuits type: journal_article user_id: '49051' volume: 28 year: '2020' ... --- _id: '17407' author: - first_name: Alexander full_name: Tornede, Alexander id: '38209' last_name: Tornede - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Tornede A, Wever MD, Hüllermeier E. Extreme Algorithm Selection with Dyadic Feature Representation. In: Discovery Science. ; 2020.' apa: Tornede, A., Wever, M. D., & Hüllermeier, E. (2020). Extreme Algorithm Selection with Dyadic Feature Representation. Discovery Science. Discovery Science 2020. bibtex: '@inproceedings{Tornede_Wever_Hüllermeier_2020, title={Extreme Algorithm Selection with Dyadic Feature Representation}, booktitle={Discovery Science}, author={Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2020} }' chicago: Tornede, Alexander, Marcel Dominik Wever, and Eyke Hüllermeier. “Extreme Algorithm Selection with Dyadic Feature Representation.” In Discovery Science, 2020. ieee: A. Tornede, M. D. Wever, and E. Hüllermeier, “Extreme Algorithm Selection with Dyadic Feature Representation,” presented at the Discovery Science 2020, 2020. mla: Tornede, Alexander, et al. “Extreme Algorithm Selection with Dyadic Feature Representation.” Discovery Science, 2020. short: 'A. Tornede, M.D. Wever, E. Hüllermeier, in: Discovery Science, 2020.' conference: name: Discovery Science 2020 date_created: 2020-07-21T10:06:51Z date_updated: 2022-01-06T06:53:10Z department: - _id: '34' - _id: '355' - _id: '26' language: - iso: eng 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 publication: Discovery Science status: public title: Extreme Algorithm Selection with Dyadic Feature Representation type: conference user_id: '5786' year: '2020' ... --- _id: '17408' author: - first_name: Jonas Manuel full_name: Hanselle, Jonas Manuel id: '43980' last_name: Hanselle orcid: 0000-0002-1231-4985 - first_name: Alexander full_name: Tornede, Alexander id: '38209' last_name: Tornede - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Hanselle JM, Tornede A, Wever MD, Hüllermeier E. Hybrid Ranking and Regression for Algorithm Selection. In: KI 2020: Advances in Artificial Intelligence. ; 2020.' apa: 'Hanselle, J. M., Tornede, A., Wever, M. D., & Hüllermeier, E. (2020). Hybrid Ranking and Regression for Algorithm Selection. KI 2020: Advances in Artificial Intelligence. 43rd German Conference on Artificial Intelligence.' bibtex: '@inproceedings{Hanselle_Tornede_Wever_Hüllermeier_2020, title={Hybrid Ranking and Regression for Algorithm Selection}, booktitle={KI 2020: Advances in Artificial Intelligence}, author={Hanselle, Jonas Manuel and Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2020} }' chicago: 'Hanselle, Jonas Manuel, Alexander Tornede, Marcel Dominik Wever, and Eyke Hüllermeier. “Hybrid Ranking and Regression for Algorithm Selection.” In KI 2020: Advances in Artificial Intelligence, 2020.' ieee: J. M. Hanselle, A. Tornede, M. D. Wever, and E. Hüllermeier, “Hybrid Ranking and Regression for Algorithm Selection,” presented at the 43rd German Conference on Artificial Intelligence, 2020. mla: 'Hanselle, Jonas Manuel, et al. “Hybrid Ranking and Regression for Algorithm Selection.” KI 2020: Advances in Artificial Intelligence, 2020.' short: 'J.M. Hanselle, A. Tornede, M.D. Wever, E. Hüllermeier, in: KI 2020: Advances in Artificial Intelligence, 2020.' conference: name: 43rd German Conference on Artificial Intelligence date_created: 2020-07-21T10:21:09Z date_updated: 2022-01-06T06:53:10Z department: - _id: '34' - _id: '355' - _id: '26' language: - iso: eng 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 publication: 'KI 2020: Advances in Artificial Intelligence' status: public title: Hybrid Ranking and Regression for Algorithm Selection type: conference user_id: '5786' year: '2020' ... --- _id: '17424' author: - first_name: Tanja full_name: Tornede, Tanja id: '40795' last_name: Tornede - first_name: Alexander full_name: Tornede, Alexander id: '38209' last_name: Tornede - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Felix full_name: Mohr, Felix last_name: Mohr - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Tornede T, Tornede A, Wever MD, Mohr F, Hüllermeier E. AutoML for Predictive Maintenance: One Tool to RUL Them All. In: Proceedings of the ECMLPKDD 2020. ; 2020. doi:10.1007/978-3-030-66770-2_8' apa: 'Tornede, T., Tornede, A., Wever, M. D., Mohr, F., & Hüllermeier, E. (2020). AutoML for Predictive Maintenance: One Tool to RUL Them All. Proceedings of the ECMLPKDD 2020. IOTStream Workshop @ ECMLPKDD 2020. https://doi.org/10.1007/978-3-030-66770-2_8' bibtex: '@inproceedings{Tornede_Tornede_Wever_Mohr_Hüllermeier_2020, title={AutoML for Predictive Maintenance: One Tool to RUL Them All}, DOI={10.1007/978-3-030-66770-2_8}, booktitle={Proceedings of the ECMLPKDD 2020}, author={Tornede, Tanja and Tornede, Alexander and Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2020} }' chicago: 'Tornede, Tanja, Alexander Tornede, Marcel Dominik Wever, Felix Mohr, and Eyke Hüllermeier. “AutoML for Predictive Maintenance: One Tool to RUL Them All.” In Proceedings of the ECMLPKDD 2020, 2020. https://doi.org/10.1007/978-3-030-66770-2_8.' ieee: 'T. Tornede, A. Tornede, M. D. Wever, F. Mohr, and E. Hüllermeier, “AutoML for Predictive Maintenance: One Tool to RUL Them All,” presented at the IOTStream Workshop @ ECMLPKDD 2020, 2020, doi: 10.1007/978-3-030-66770-2_8.' mla: 'Tornede, Tanja, et al. “AutoML for Predictive Maintenance: One Tool to RUL Them All.” Proceedings of the ECMLPKDD 2020, 2020, doi:10.1007/978-3-030-66770-2_8.' short: 'T. Tornede, A. Tornede, M.D. Wever, F. Mohr, E. Hüllermeier, in: Proceedings of the ECMLPKDD 2020, 2020.' conference: name: IOTStream Workshop @ ECMLPKDD 2020 date_created: 2020-07-28T09:17:41Z date_updated: 2022-01-06T06:53:11Z department: - _id: '34' - _id: '355' - _id: '26' doi: 10.1007/978-3-030-66770-2_8 language: - iso: eng project: - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing - _id: '3' name: SFB 901 - Project Area B - _id: '10' name: SFB 901 - Subproject B2 - _id: '1' name: SFB 901 - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: Proceedings of the ECMLPKDD 2020 status: public title: 'AutoML for Predictive Maintenance: One Tool to RUL Them All' type: conference user_id: '5786' year: '2020' ... --- _id: '18686' author: - first_name: Joschka full_name: Kersting, Joschka id: '58701' last_name: Kersting - first_name: Frederik Simon full_name: Bäumer, Frederik Simon id: '38837' last_name: Bäumer citation: ama: 'Kersting J, Bäumer FS. SEMANTIC TAGGING OF REQUIREMENT DESCRIPTIONS: A TRANSFORMER-BASED APPROACH. In: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON APPLIED COMPUTING 2020. IADIS; 2020:119--123.' apa: 'Kersting, J., & Bäumer, F. S. (2020). SEMANTIC TAGGING OF REQUIREMENT DESCRIPTIONS: A TRANSFORMER-BASED APPROACH. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON APPLIED COMPUTING 2020, 119--123.' bibtex: '@inproceedings{Kersting_Bäumer_2020, title={SEMANTIC TAGGING OF REQUIREMENT DESCRIPTIONS: A TRANSFORMER-BASED APPROACH}, booktitle={PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON APPLIED COMPUTING 2020}, publisher={IADIS}, author={Kersting, Joschka and Bäumer, Frederik Simon}, year={2020}, pages={119--123} }' chicago: 'Kersting, Joschka, and Frederik Simon Bäumer. “SEMANTIC TAGGING OF REQUIREMENT DESCRIPTIONS: A TRANSFORMER-BASED APPROACH.” In PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON APPLIED COMPUTING 2020, 119--123. IADIS, 2020.' ieee: 'J. Kersting and F. S. Bäumer, “SEMANTIC TAGGING OF REQUIREMENT DESCRIPTIONS: A TRANSFORMER-BASED APPROACH,” in PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON APPLIED COMPUTING 2020, Lisbon, Portugal, 2020, pp. 119--123.' mla: 'Kersting, Joschka, and Frederik Simon Bäumer. “SEMANTIC TAGGING OF REQUIREMENT DESCRIPTIONS: A TRANSFORMER-BASED APPROACH.” PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON APPLIED COMPUTING 2020, IADIS, 2020, pp. 119--123.' short: 'J. Kersting, F.S. Bäumer, in: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON APPLIED COMPUTING 2020, IADIS, 2020, pp. 119--123.' conference: end_date: 20.11.2020 location: Lisbon, Portugal name: 17th International Conference on Applied Computing start_date: 18.11.2020 date_created: 2020-08-31T10:59:54Z date_updated: 2022-01-06T06:53:51Z ddc: - '000' department: - _id: '579' file: - access_level: closed content_type: application/pdf creator: jkers date_created: 2020-11-19T17:29:03Z date_updated: 2020-11-19T17:29:03Z file_id: '20443' file_name: Kersting & Bäumer (2020), Kersting2020d.pdf file_size: 1064877 relation: main_file success: 1 file_date_updated: 2020-11-19T17:29:03Z has_accepted_license: '1' keyword: - Software Requirements - Natural Language Processing - Transfer Learning - On-The-Fly Computing language: - iso: eng page: 119--123 project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '9' name: SFB 901 - Subproject B1 publication: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON APPLIED COMPUTING 2020 publisher: IADIS status: public title: 'SEMANTIC TAGGING OF REQUIREMENT DESCRIPTIONS: A TRANSFORMER-BASED APPROACH' type: conference user_id: '58701' year: '2020' ... --- _id: '20306' author: - first_name: Alexander full_name: Tornede, Alexander id: '38209' last_name: Tornede - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Tornede A, Wever MD, Hüllermeier E. Towards Meta-Algorithm Selection. In: Workshop MetaLearn 2020 @ NeurIPS 2020. ; 2020.' apa: Tornede, A., Wever, M. D., & Hüllermeier, E. (2020). Towards Meta-Algorithm Selection. Workshop MetaLearn 2020 @ NeurIPS 2020. Workshop MetaLearn 2020 @ NeurIPS 2020, Online. bibtex: '@inproceedings{Tornede_Wever_Hüllermeier_2020, title={Towards Meta-Algorithm Selection}, booktitle={Workshop MetaLearn 2020 @ NeurIPS 2020}, author={Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2020} }' chicago: Tornede, Alexander, Marcel Dominik Wever, and Eyke Hüllermeier. “Towards Meta-Algorithm Selection.” In Workshop MetaLearn 2020 @ NeurIPS 2020, 2020. ieee: A. Tornede, M. D. Wever, and E. Hüllermeier, “Towards Meta-Algorithm Selection,” presented at the Workshop MetaLearn 2020 @ NeurIPS 2020, Online, 2020. mla: Tornede, Alexander, et al. “Towards Meta-Algorithm Selection.” Workshop MetaLearn 2020 @ NeurIPS 2020, 2020. short: 'A. Tornede, M.D. Wever, E. Hüllermeier, in: Workshop MetaLearn 2020 @ NeurIPS 2020, 2020.' conference: location: Online name: Workshop MetaLearn 2020 @ NeurIPS 2020 date_created: 2020-11-06T09:42:27Z date_updated: 2022-01-06T06:54:26Z department: - _id: '34' - _id: '355' - _id: '26' language: - iso: eng 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 publication: Workshop MetaLearn 2020 @ NeurIPS 2020 status: public title: Towards Meta-Algorithm Selection type: conference user_id: '5786' year: '2020' ... --- _id: '20712' author: - first_name: Philipp full_name: Schubert, Philipp id: '60543' last_name: Schubert orcid: 0000-0002-8674-1859 - first_name: Eric full_name: Bodden, Eric id: '59256' last_name: Bodden orcid: 0000-0003-3470-3647 - first_name: Ben full_name: Hermann, Ben id: '66173' last_name: Hermann orcid: 0000-0001-9848-2017 citation: ama: Schubert P, Bodden E, Hermann B. Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries.; 2020. apa: Schubert, P., Bodden, E., & Hermann, B. (2020). Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries. bibtex: '@book{Schubert_Bodden_Hermann_2020, title={Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries}, author={Schubert, Philipp and Bodden, Eric and Hermann, Ben}, year={2020} }' chicago: Schubert, Philipp, Eric Bodden, and Ben Hermann. Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries, 2020. ieee: P. Schubert, E. Bodden, and B. Hermann, Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries. 2020. mla: Schubert, Philipp, et al. Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries. 2020. short: P. Schubert, E. Bodden, B. Hermann, Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries, 2020. date_created: 2020-12-14T07:44:11Z date_updated: 2022-01-06T06:54:34Z ddc: - '000' department: - _id: '76' file: - access_level: closed content_type: application/pdf creator: pdschbrt date_created: 2020-12-14T07:39:07Z date_updated: 2020-12-14T07:39:07Z file_id: '20713' file_name: main.pdf file_size: 683576 relation: main_file success: 1 file_date_updated: 2020-12-14T07:39:07Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 status: public title: Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries type: report user_id: '477' year: '2020' ... --- _id: '20748' abstract: - lang: eng text: "On the circuit level, the design paradigm Approximate Computing seeks to trade off computational accuracy against a target metric, e.g., energy consumption. This trade-off is possible for many applications due to their inherent resiliency against inaccuracies.\r\nIn the past, several automated approximation frameworks have been presented, which either utilize designated approximation techniques or libraries to replace approximable circuit parts with inaccurate versions. The frameworks invoke a search algorithm to iteratively explore the search space of performance degraded circuits, and validate their quality individually. \r\nIn this paper, we propose to reverse this procedure. Rather than exploring the search space, we delineate the approximate parts of the search space which are guaranteed to lead to valid approximate circuits. Our methodology is supported by formal verification and independent of approximation techniques. Eventually, the user is provided with quality bounds of the individual approximable circuit parts. Consequently, our approach guarantees that any approximate circuit which implements these parts within the determined quality constraints satisfies the global quality constraints, superseding a subsequent quality verification.\r\nIn our experimental results, we present the runtimes of our approach." author: - first_name: Linus Matthias full_name: Witschen, Linus Matthias id: '49051' last_name: Witschen - first_name: Tobias full_name: Wiersema, Tobias id: '3118' last_name: Wiersema - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: ama: Witschen LM, Wiersema T, Platzner M. Search Space Characterization for AxC Synthesis. Fifth Workshop on Approximate Computing (AxC 2020). apa: Witschen, L. M., Wiersema, T., & Platzner, M. (n.d.). Search Space Characterization for AxC Synthesis. Fifth Workshop on Approximate Computing (AxC 2020). bibtex: '@article{Witschen_Wiersema_Platzner, title={Search Space Characterization for AxC Synthesis}, journal={Fifth Workshop on Approximate Computing (AxC 2020)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Platzner, Marco} }' chicago: Witschen, Linus Matthias, Tobias Wiersema, and Marco Platzner. “Search Space Characterization for AxC Synthesis.” Fifth Workshop on Approximate Computing (AxC 2020), n.d. ieee: L. M. Witschen, T. Wiersema, and M. Platzner, “Search Space Characterization for AxC Synthesis,” Fifth Workshop on Approximate Computing (AxC 2020). . mla: Witschen, Linus Matthias, et al. “Search Space Characterization for AxC Synthesis.” Fifth Workshop on Approximate Computing (AxC 2020). short: L.M. Witschen, T. Wiersema, M. Platzner, Fifth Workshop on Approximate Computing (AxC 2020) (n.d.). date_created: 2020-12-15T15:13:49Z date_updated: 2022-01-06T06:54:35Z ddc: - '000' department: - _id: '78' file: - access_level: closed content_type: application/pdf creator: witschen date_created: 2020-12-15T15:11:06Z date_updated: 2020-12-15T15:11:06Z file_id: '20749' file_name: witschen20_axc.pdf file_size: 250870 relation: main_file success: 1 file_date_updated: 2020-12-15T15:11:06Z has_accepted_license: '1' language: - iso: eng page: '2' project: - _id: '12' name: SFB 901 - Subproject B4 - _id: '3' name: SFB 901 - Project Area B - _id: '1' name: SFB 901 publication: Fifth Workshop on Approximate Computing (AxC 2020) publication_status: accepted status: public title: Search Space Characterization for AxC Synthesis type: preprint user_id: '3118' year: '2020' ... --- _id: '18276' abstract: - lang: eng text: "Algorithm selection (AS) deals with the automatic selection of an algorithm\r\nfrom a fixed set of candidate algorithms most suitable for a specific instance\r\nof an algorithmic problem class, where \"suitability\" often refers to an\r\nalgorithm's runtime. Due to possibly extremely long runtimes of candidate\r\nalgorithms, training data for algorithm selection models is usually generated\r\nunder time constraints in the sense that not all algorithms are run to\r\ncompletion on all instances. Thus, training data usually comprises censored\r\ninformation, as the true runtime of algorithms timed out remains unknown.\r\nHowever, many standard AS approaches are not able to handle such information in\r\na proper way. On the other side, survival analysis (SA) naturally supports\r\ncensored data and offers appropriate ways to use such data for learning\r\ndistributional models of algorithm runtime, as we demonstrate in this work. We\r\nleverage such models as a basis of a sophisticated decision-theoretic approach\r\nto algorithm selection, which we dub Run2Survive. Moreover, taking advantage of\r\na framework of this kind, we advocate a risk-averse approach to algorithm\r\nselection, in which the avoidance of a timeout is given high priority. In an\r\nextensive experimental study with the standard benchmark ASlib, our approach is\r\nshown to be highly competitive and in many cases even superior to\r\nstate-of-the-art AS approaches." author: - first_name: Alexander full_name: Tornede, Alexander id: '38209' last_name: Tornede - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Stefan full_name: Werner, Stefan last_name: Werner - first_name: Felix full_name: Mohr, Felix last_name: Mohr - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Tornede A, Wever MD, Werner S, Mohr F, Hüllermeier E. Run2Survive: A Decision-theoretic Approach to Algorithm Selection based on Survival Analysis. In: ACML 2020. ; 2020.' apa: 'Tornede, A., Wever, M. D., Werner, S., Mohr, F., & Hüllermeier, E. (2020). Run2Survive: A Decision-theoretic Approach to Algorithm Selection based on Survival Analysis. ACML 2020. 12th Asian Conference on Machine Learning, Bangkok, Thailand.' bibtex: '@inproceedings{Tornede_Wever_Werner_Mohr_Hüllermeier_2020, title={Run2Survive: A Decision-theoretic Approach to Algorithm Selection based on Survival Analysis}, booktitle={ACML 2020}, author={Tornede, Alexander and Wever, Marcel Dominik and Werner, Stefan and Mohr, Felix and Hüllermeier, Eyke}, year={2020} }' chicago: 'Tornede, Alexander, Marcel Dominik Wever, Stefan Werner, Felix Mohr, and Eyke Hüllermeier. “Run2Survive: A Decision-Theoretic Approach to Algorithm Selection Based on Survival Analysis.” In ACML 2020, 2020.' ieee: 'A. Tornede, M. D. Wever, S. Werner, F. Mohr, and E. Hüllermeier, “Run2Survive: A Decision-theoretic Approach to Algorithm Selection based on Survival Analysis,” presented at the 12th Asian Conference on Machine Learning, Bangkok, Thailand, 2020.' mla: 'Tornede, Alexander, et al. “Run2Survive: A Decision-Theoretic Approach to Algorithm Selection Based on Survival Analysis.” ACML 2020, 2020.' short: 'A. Tornede, M.D. Wever, S. Werner, F. Mohr, E. Hüllermeier, in: ACML 2020, 2020.' conference: end_date: 2020-11-20 location: Bangkok, Thailand name: 12th Asian Conference on Machine Learning start_date: 2020-11-18 date_created: 2020-08-25T12:09:28Z date_updated: 2022-01-06T06:53:28Z department: - _id: '34' - _id: '355' - _id: '26' language: - iso: eng main_file_link: - url: https://arxiv.org/pdf/2007.02816.pdf 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 publication: ACML 2020 status: public title: 'Run2Survive: A Decision-theoretic Approach to Algorithm Selection based on Survival Analysis' type: conference user_id: '5786' year: '2020' ... --- _id: '16724' author: - first_name: Arnab full_name: Sharma, Arnab id: '67200' last_name: Sharma - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Sharma A, Wehrheim H. Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models. In: Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA). ACM.' apa: Sharma, A., & Wehrheim, H. (n.d.). Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models. In Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA). ACM. bibtex: '@inproceedings{Sharma_Wehrheim, title={Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models}, booktitle={Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).}, publisher={ACM}, author={Sharma, Arnab and Wehrheim, Heike} }' chicago: Sharma, Arnab, and Heike Wehrheim. “Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models.” In Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA). ACM, n.d. ieee: A. Sharma and H. Wehrheim, “Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models,” in Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA). mla: Sharma, Arnab, and Heike Wehrheim. “Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models.” Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA)., ACM. short: 'A. Sharma, H. Wehrheim, in: Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA)., ACM, n.d.' date_created: 2020-04-19T14:01:53Z date_updated: 2022-01-06T06:52:55Z department: - _id: '7' - _id: '77' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '11' name: SFB 901 - Subproject B3 publication: Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA). publication_status: accepted publisher: ACM status: public title: Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models type: conference user_id: '477' year: '2020' ... --- _id: '16725' author: - first_name: Cedric full_name: Richter, Cedric id: '50003' last_name: Richter - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: Richter C, Hüllermeier E, Jakobs M-C, Wehrheim H. Algorithm Selection for Software Validation Based on Graph Kernels. Journal of Automated Software Engineering. apa: Richter, C., Hüllermeier, E., Jakobs, M.-C., & Wehrheim, H. (n.d.). Algorithm Selection for Software Validation Based on Graph Kernels. Journal of Automated Software Engineering. bibtex: '@article{Richter_Hüllermeier_Jakobs_Wehrheim, title={Algorithm Selection for Software Validation Based on Graph Kernels}, journal={Journal of Automated Software Engineering}, publisher={Springer}, author={Richter, Cedric and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim, Heike} }' chicago: Richter, Cedric, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim. “Algorithm Selection for Software Validation Based on Graph Kernels.” Journal of Automated Software Engineering, n.d. ieee: C. Richter, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, “Algorithm Selection for Software Validation Based on Graph Kernels,” Journal of Automated Software Engineering. mla: Richter, Cedric, et al. “Algorithm Selection for Software Validation Based on Graph Kernels.” Journal of Automated Software Engineering, Springer. short: C. Richter, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Journal of Automated Software Engineering (n.d.). date_created: 2020-04-19T14:08:06Z date_updated: 2022-01-06T06:52:55Z department: - _id: '7' - _id: '77' - _id: '355' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '11' name: SFB 901 - Subproject B3 - _id: '12' name: SFB 901 - Subproject B4 publication: Journal of Automated Software Engineering publication_status: accepted publisher: Springer status: public title: Algorithm Selection for Software Validation Based on Graph Kernels type: journal_article user_id: '477' year: '2020' ... --- _id: '15580' abstract: - lang: eng text: This paper deals with aspect phrase extraction and classification in sentiment analysis. We summarize current approaches and datasets from the domain of aspect-based sentiment analysis. This domain detects sentiments expressed for individual aspects in unstructured text data. So far, mainly commercial user reviews for products or services such as restaurants were investigated. We here present our dataset consisting of German physician reviews, a sensitive and linguistically complex field. Furthermore, we describe the annotation process of a dataset for supervised learning with neural networks. Moreover, we introduce our model for extracting and classifying aspect phrases in one step, which obtains an F1-score of 80%. By applying it to a more complex domain, our approach and results outperform previous approaches. author: - first_name: Joschka full_name: Kersting, Joschka id: '58701' last_name: Kersting - first_name: Michaela full_name: Geierhos, Michaela id: '42496' last_name: Geierhos orcid: 0000-0002-8180-5606 citation: ama: 'Kersting J, Geierhos M. Aspect Phrase Extraction in Sentiment Analysis with Deep Learning. In: Proceedings of the 12th International Conference on Agents and Artificial Intelligence (ICAART 2020) --  Special Session on Natural Language Processing in Artificial Intelligence (NLPinAI 2020). Setúbal, Portugal: SCITEPRESS; 2020:391--400.' apa: 'Kersting, J., & Geierhos, M. (2020). Aspect Phrase Extraction in Sentiment Analysis with Deep Learning. In Proceedings of the 12th International Conference on Agents and Artificial Intelligence (ICAART 2020) --  Special Session on Natural Language Processing in Artificial Intelligence (NLPinAI 2020) (pp. 391--400). Setúbal, Portugal: SCITEPRESS.' bibtex: '@inproceedings{Kersting_Geierhos_2020, place={Setúbal, Portugal}, title={Aspect Phrase Extraction in Sentiment Analysis with Deep Learning}, booktitle={Proceedings of the 12th International Conference on Agents and Artificial Intelligence (ICAART 2020) --  Special Session on Natural Language Processing in Artificial Intelligence (NLPinAI 2020)}, publisher={SCITEPRESS}, author={Kersting, Joschka and Geierhos, Michaela}, year={2020}, pages={391--400} }' chicago: 'Kersting, Joschka, and Michaela Geierhos. “Aspect Phrase Extraction in Sentiment Analysis with Deep Learning.” In Proceedings of the 12th International Conference on Agents and Artificial Intelligence (ICAART 2020) --  Special Session on Natural Language Processing in Artificial Intelligence (NLPinAI 2020), 391--400. Setúbal, Portugal: SCITEPRESS, 2020.' ieee: J. Kersting and M. Geierhos, “Aspect Phrase Extraction in Sentiment Analysis with Deep Learning,” in Proceedings of the 12th International Conference on Agents and Artificial Intelligence (ICAART 2020) --  Special Session on Natural Language Processing in Artificial Intelligence (NLPinAI 2020), Valetta, Malta, 2020, pp. 391--400. mla: Kersting, Joschka, and Michaela Geierhos. “Aspect Phrase Extraction in Sentiment Analysis with Deep Learning.” Proceedings of the 12th International Conference on Agents and Artificial Intelligence (ICAART 2020) --  Special Session on Natural Language Processing in Artificial Intelligence (NLPinAI 2020), SCITEPRESS, 2020, pp. 391--400. short: 'J. Kersting, M. Geierhos, in: Proceedings of the 12th International Conference on Agents and Artificial Intelligence (ICAART 2020) --  Special Session on Natural Language Processing in Artificial Intelligence (NLPinAI 2020), SCITEPRESS, Setúbal, Portugal, 2020, pp. 391--400.' conference: location: Valetta, Malta name: International Conference on Agents and Artificial Intelligence (ICAART) -- Special Session on Natural Language Processing in Artificial Intelligence (NLPinAI) date_created: 2020-01-15T08:35:07Z date_updated: 2022-01-06T06:52:29Z ddc: - '000' department: - _id: '579' file: - access_level: closed content_type: application/pdf creator: jkers date_created: 2020-09-18T09:27:00Z date_updated: 2020-09-18T09:27:00Z file_id: '19576' file_name: Kersting & Geierhos (2020), Kersting2020.pdf file_size: 421780 relation: main_file success: 1 file_date_updated: 2020-09-18T09:27:00Z has_accepted_license: '1' keyword: - Deep Learning - Natural Language Processing - Aspect-based Sentiment Analysis language: - iso: eng page: 391--400 place: Setúbal, Portugal project: - _id: '3' name: SFB 901 - Project Area B - _id: '1' name: SFB 901 - _id: '9' name: SFB 901 - Subproject B1 publication: Proceedings of the 12th International Conference on Agents and Artificial Intelligence (ICAART 2020) -- Special Session on Natural Language Processing in Artificial Intelligence (NLPinAI 2020) publisher: SCITEPRESS status: public title: Aspect Phrase Extraction in Sentiment Analysis with Deep Learning type: conference user_id: '58701' year: '2020' ... --- _id: '15582' abstract: - lang: eng text: When it comes to increased digitization in the health care domain, privacy is a relevant topic nowadays. This relates to patient data, electronic health records or physician reviews published online, for instance. There exist different approaches to the protection of individuals’ privacy, which focus on the anonymization and masking of personal information subsequent to their mining. In the medical domain in particular, measures to protect the privacy of patients are of high importance due to the amount of sensitive data that is involved (e.g. age, gender, illnesses, medication). While privacy breaches in structured data can be detected more easily, disclosure in written texts is more difficult to find automatically due to the unstructured nature of natural language. Therefore, we take a detailed look at existing research on areas related to privacy protection. Likewise, we review approaches to the automatic detection of privacy disclosure in different types of medical data. We provide a survey of several studies concerned with privacy breaches in the medical domain with a focus on Physician Review Websites (PRWs). Finally, we briefly develop implications and directions for further research. author: - first_name: Bianca full_name: Buff, Bianca last_name: Buff - first_name: Joschka full_name: Kersting, Joschka id: '58701' last_name: Kersting - first_name: Michaela full_name: Geierhos, Michaela id: '42496' last_name: Geierhos orcid: 0000-0002-8180-5606 citation: ama: 'Buff B, Kersting J, Geierhos M. Detection of Privacy Disclosure in the Medical Domain: A Survey. In: Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods (ICPRAM 2020). Setúbal, Portugal: SCITEPRESS; 2020:630--637.' apa: 'Buff, B., Kersting, J., & Geierhos, M. (2020). Detection of Privacy Disclosure in the Medical Domain: A Survey. In Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods (ICPRAM 2020) (pp. 630--637). Setúbal, Portugal: SCITEPRESS.' bibtex: '@inproceedings{Buff_Kersting_Geierhos_2020, place={Setúbal, Portugal}, title={Detection of Privacy Disclosure in the Medical Domain: A Survey}, booktitle={Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods (ICPRAM 2020)}, publisher={SCITEPRESS}, author={Buff, Bianca and Kersting, Joschka and Geierhos, Michaela}, year={2020}, pages={630--637} }' chicago: 'Buff, Bianca, Joschka Kersting, and Michaela Geierhos. “Detection of Privacy Disclosure in the Medical Domain: A Survey.” In Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods (ICPRAM 2020), 630--637. Setúbal, Portugal: SCITEPRESS, 2020.' ieee: 'B. Buff, J. Kersting, and M. Geierhos, “Detection of Privacy Disclosure in the Medical Domain: A Survey,” in Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods (ICPRAM 2020), Valetta, Malta, 2020, pp. 630--637.' mla: 'Buff, Bianca, et al. “Detection of Privacy Disclosure in the Medical Domain: A Survey.” Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods (ICPRAM 2020), SCITEPRESS, 2020, pp. 630--637.' short: 'B. Buff, J. Kersting, M. Geierhos, in: Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods (ICPRAM 2020), SCITEPRESS, Setúbal, Portugal, 2020, pp. 630--637.' conference: location: Valetta, Malta name: International Conference on Pattern Recognition Applications and Methods (ICPRAM) date_created: 2020-01-15T08:49:25Z date_updated: 2022-01-06T06:52:30Z ddc: - '000' department: - _id: '579' file: - access_level: closed content_type: application/pdf creator: jkers date_created: 2020-09-18T09:25:30Z date_updated: 2020-09-18T09:25:30Z file_id: '19574' file_name: Buff et al. (2020), Buff2020.pdf file_size: 287956 relation: main_file success: 1 file_date_updated: 2020-09-18T09:25:30Z has_accepted_license: '1' keyword: - Identity Disclosure - Privacy Protection - Physician Review Website - De-Anonymization - Medical Domain language: - iso: eng page: 630--637 place: Setúbal, Portugal project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '9' name: SFB 901 - Subproject B1 publication: Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods (ICPRAM 2020) publisher: SCITEPRESS status: public title: 'Detection of Privacy Disclosure in the Medical Domain: A Survey' type: conference user_id: '58701' year: '2020' ... --- _id: '15629' abstract: - lang: eng text: In multi-label classification (MLC), each instance is associated with a set of class labels, in contrast to standard classification where an instance is assigned a single label. Binary relevance (BR) learning, which reduces a multi-label to a set of binary classification problems, one per label, is arguably the most straight-forward approach to MLC. In spite of its simplicity, BR proved to be competitive to more sophisticated MLC methods, and still achieves state-of-the-art performance for many loss functions. Somewhat surprisingly, the optimal choice of the base learner for tackling the binary classification problems has received very little attention so far. Taking advantage of the label independence assumption inherent to BR, we propose a label-wise base learner selection method optimizing label-wise macro averaged performance measures. In an extensive experimental evaluation, we find that or approach, called LiBRe, can significantly improve generalization performance. author: - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Alexander full_name: Tornede, Alexander id: '38209' last_name: Tornede - first_name: Felix full_name: Mohr, Felix last_name: Mohr - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Wever MD, Tornede A, Mohr F, Hüllermeier E. LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification. In: Springer.' apa: 'Wever, M. D., Tornede, A., Mohr, F., & Hüllermeier, E. (n.d.). LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification. Symposium on Intelligent Data Analysis, Konstanz, Germany.' bibtex: '@inproceedings{Wever_Tornede_Mohr_Hüllermeier, title={LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification}, publisher={Springer}, author={Wever, Marcel Dominik and Tornede, Alexander and Mohr, Felix and Hüllermeier, Eyke} }' chicago: 'Wever, Marcel Dominik, Alexander Tornede, Felix Mohr, and Eyke Hüllermeier. “LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification.” Springer, n.d.' ieee: 'M. D. Wever, A. Tornede, F. Mohr, and E. Hüllermeier, “LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification,” presented at the Symposium on Intelligent Data Analysis, Konstanz, Germany.' mla: 'Wever, Marcel Dominik, et al. LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification. Springer.' short: 'M.D. Wever, A. Tornede, F. Mohr, E. Hüllermeier, in: Springer, n.d.' conference: end_date: 2020-04-27 location: Konstanz, Germany name: Symposium on Intelligent Data Analysis start_date: 2020-04-24 date_created: 2020-01-23T08:44:08Z date_updated: 2022-01-06T06:52:30Z department: - _id: '34' - _id: '355' - _id: '26' language: - iso: eng 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 publication_status: accepted publisher: Springer status: public title: 'LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification' type: conference user_id: '5786' year: '2020' ... --- _id: '15635' author: - first_name: Joschka full_name: Kersting, Joschka id: '58701' last_name: Kersting - first_name: Michaela full_name: Geierhos, Michaela id: '42496' last_name: Geierhos orcid: 0000-0002-8180-5606 citation: ama: 'Kersting J, Geierhos M. Neural Learning for Aspect Phrase Extraction and Classification in Sentiment Analysis. In: Proceedings of the 33rd International Florida Artificial Intelligence Research Symposium (FLAIRS) Conference. North Miami Beach, FL, USA: AAAI; 2020:282--285.' apa: 'Kersting, J., & Geierhos, M. (2020). Neural Learning for Aspect Phrase Extraction and Classification in Sentiment Analysis. In Proceedings of the 33rd International Florida Artificial Intelligence Research Symposium (FLAIRS) Conference (pp. 282--285). North Miami Beach, FL, USA: AAAI.' bibtex: '@inproceedings{Kersting_Geierhos_2020, place={North Miami Beach, FL, USA}, title={Neural Learning for Aspect Phrase Extraction and Classification in Sentiment Analysis}, booktitle={Proceedings of the 33rd International Florida Artificial Intelligence Research Symposium (FLAIRS) Conference}, publisher={AAAI}, author={Kersting, Joschka and Geierhos, Michaela}, year={2020}, pages={282--285} }' chicago: 'Kersting, Joschka, and Michaela Geierhos. “Neural Learning for Aspect Phrase Extraction and Classification in Sentiment Analysis.” In Proceedings of the 33rd International Florida Artificial Intelligence Research Symposium (FLAIRS) Conference, 282--285. North Miami Beach, FL, USA: AAAI, 2020.' ieee: J. Kersting and M. Geierhos, “Neural Learning for Aspect Phrase Extraction and Classification in Sentiment Analysis,” in Proceedings of the 33rd International Florida Artificial Intelligence Research Symposium (FLAIRS) Conference, North Miami Beach, FL, USA, 2020, pp. 282--285. mla: Kersting, Joschka, and Michaela Geierhos. “Neural Learning for Aspect Phrase Extraction and Classification in Sentiment Analysis.” Proceedings of the 33rd International Florida Artificial Intelligence Research Symposium (FLAIRS) Conference, AAAI, 2020, pp. 282--285. short: 'J. Kersting, M. Geierhos, in: Proceedings of the 33rd International Florida Artificial Intelligence Research Symposium (FLAIRS) Conference, AAAI, North Miami Beach, FL, USA, 2020, pp. 282--285.' conference: end_date: 2020-05-20 location: North Miami Beach, FL, USA name: The 33rd International Florida Artificial Intelligence Research Symposium (FLAIRS) Conference start_date: 2020-05-17 date_created: 2020-01-24T09:10:09Z date_updated: 2022-01-06T06:52:31Z ddc: - '000' department: - _id: '579' file: - access_level: closed content_type: application/pdf creator: jkers date_created: 2020-09-18T09:39:08Z date_updated: 2020-09-18T09:39:08Z file_id: '19582' file_name: Kersting & Geierhos (2020b), Kersting2020b.pdf file_size: 464976 relation: main_file success: 1 file_date_updated: 2020-09-18T09:39:08Z has_accepted_license: '1' language: - iso: eng page: 282--285 place: North Miami Beach, FL, USA project: - _id: '3' name: SFB 901 - Project Area B - _id: '9' name: SFB 901 - Subproject B1 - _id: '1' name: SFB 901 publication: Proceedings of the 33rd International Florida Artificial Intelligence Research Symposium (FLAIRS) Conference publisher: AAAI status: public title: Neural Learning for Aspect Phrase Extraction and Classification in Sentiment Analysis type: conference user_id: '58701' year: '2020' ... --- _id: '15025' abstract: - lang: eng text: In software engineering, the imprecise requirements of a user are transformed to a formal requirements specification during the requirements elicitation process. This process is usually guided by requirements engineers interviewing the user. We want to partially automate this first step of the software engineering process in order to enable users to specify a desired software system on their own. With our approach, users are only asked to provide exemplary behavioral descriptions. The problem of synthesizing a requirements specification from examples can partially be reduced to the problem of grammatical inference, to which we apply an active coevolutionary learning approach. However, this approach would usually require many feedback queries to be sent to the user. In this work, we extend and generalize our active learning approach to receive knowledge from multiple oracles, also known as proactive learning. The ‘user oracle’ represents input received from the user and the ‘knowledge oracle’ represents available, formalized domain knowledge. We call our two-oracle approach the ‘first apply knowledge then query’ (FAKT/Q) algorithm. We compare FAKT/Q to the active learning approach and provide an extensive benchmark evaluation. As result we find that the number of required user queries is reduced and the inference process is sped up significantly. Finally, with so-called On-The-Fly Markets, we present a motivation and an application of our approach where such knowledge is available. author: - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Lorijn full_name: van Rooijen, Lorijn id: '58843' last_name: van Rooijen - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: ama: Wever MD, van Rooijen L, Hamann H. Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets. Evolutionary Computation. 2020;28(2):165–193. doi:10.1162/evco_a_00266 apa: Wever, M. D., van Rooijen, L., & Hamann, H. (2020). Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets. Evolutionary Computation, 28(2), 165–193. https://doi.org/10.1162/evco_a_00266 bibtex: '@article{Wever_van Rooijen_Hamann_2020, title={Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets}, volume={28}, DOI={10.1162/evco_a_00266}, number={2}, journal={Evolutionary Computation}, publisher={MIT Press Journals}, author={Wever, Marcel Dominik and van Rooijen, Lorijn and Hamann, Heiko}, year={2020}, pages={165–193} }' chicago: 'Wever, Marcel Dominik, Lorijn van Rooijen, and Heiko Hamann. “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets.” Evolutionary Computation 28, no. 2 (2020): 165–193. https://doi.org/10.1162/evco_a_00266.' ieee: 'M. D. Wever, L. van Rooijen, and H. Hamann, “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets,” Evolutionary Computation, vol. 28, no. 2, pp. 165–193, 2020, doi: 10.1162/evco_a_00266.' mla: Wever, Marcel Dominik, et al. “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets.” Evolutionary Computation, vol. 28, no. 2, MIT Press Journals, 2020, pp. 165–193, doi:10.1162/evco_a_00266. short: M.D. Wever, L. van Rooijen, H. Hamann, Evolutionary Computation 28 (2020) 165–193. date_created: 2019-11-18T14:19:19Z date_updated: 2022-01-06T06:52:15Z department: - _id: '34' - _id: '355' - _id: '26' - _id: '63' - _id: '238' doi: 10.1162/evco_a_00266 intvolume: ' 28' issue: '2' language: - iso: eng page: 165–193 project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '9' name: SFB 901 - Subproject B1 - _id: '10' name: SFB 901 - Subproject B2 - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: Evolutionary Computation publication_status: published publisher: MIT Press Journals related_material: link: - relation: confirmation url: https://www.mitpressjournals.org/doi/pdf/10.1162/evco_a_00266 status: public title: Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets type: journal_article user_id: '15415' volume: 28 year: '2020' ... --- _id: '15256' abstract: - lang: eng text: This paper deals with online customer reviews of local multi-service providers. While many studies investigate product reviews and online labour markets with service providers delivering intangible products “over the wire”, we focus on websites where providers offer multiple distinct services that can be booked, paid and reviewed online but are performed locally offline. This type of service providers has so far been neglected in the literature. This paper analyses reviews and applies sentiment analysis. It aims to gain new insights into local multi-service providers’ performance. There is a broad literature range presented with regard to the topics addressed. The results show, among other things, that providers with good ratings continue to perform well over time. We find that many positive reviews seem to encourage sales. On average, quantitative star ratings and qualitative ratings in the form of review texts match. Further results are also achieved in this study. author: - first_name: Joschka full_name: Kersting, Joschka id: '58701' last_name: Kersting - first_name: Michaela full_name: Geierhos, Michaela id: '42496' last_name: Geierhos orcid: 0000-0002-8180-5606 citation: ama: 'Kersting J, Geierhos M. What Reviews in Local Online Labour Markets Reveal about the Performance of Multi-Service Providers. In: Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods. Setúbal, Portugal: SCITEPRESS; 2020:263--272.' apa: 'Kersting, J., & Geierhos, M. (2020). What Reviews in Local Online Labour Markets Reveal about the Performance of Multi-Service Providers. In Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods (pp. 263--272). Setúbal, Portugal: SCITEPRESS.' bibtex: '@inproceedings{Kersting_Geierhos_2020, place={Setúbal, Portugal}, title={What Reviews in Local Online Labour Markets Reveal about the Performance of Multi-Service Providers}, booktitle={Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods}, publisher={SCITEPRESS}, author={Kersting, Joschka and Geierhos, Michaela}, year={2020}, pages={263--272} }' chicago: 'Kersting, Joschka, and Michaela Geierhos. “What Reviews in Local Online Labour Markets Reveal about the Performance of Multi-Service Providers.” In Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods, 263--272. Setúbal, Portugal: SCITEPRESS, 2020.' ieee: J. Kersting and M. Geierhos, “What Reviews in Local Online Labour Markets Reveal about the Performance of Multi-Service Providers,” in Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods, Valetta, Malta, 2020, pp. 263--272. mla: Kersting, Joschka, and Michaela Geierhos. “What Reviews in Local Online Labour Markets Reveal about the Performance of Multi-Service Providers.” Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods, SCITEPRESS, 2020, pp. 263--272. short: 'J. Kersting, M. Geierhos, in: Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods, SCITEPRESS, Setúbal, Portugal, 2020, pp. 263--272.' conference: location: Valetta, Malta name: International Conference on Pattern Recognition Applications and Methods (ICPRAM) date_created: 2019-12-06T13:09:42Z date_updated: 2022-01-06T06:52:19Z ddc: - '000' department: - _id: '579' file: - access_level: closed content_type: application/pdf creator: jkers date_created: 2020-09-18T09:27:41Z date_updated: 2020-09-18T09:27:41Z file_id: '19577' file_name: Kersting & Geierhos (2020c), Kersting2020c.pdf file_size: 963370 relation: main_file success: 1 file_date_updated: 2020-09-18T09:27:41Z has_accepted_license: '1' keyword: - Customer Reviews - Sentiment Analysis - Online Labour Markets language: - iso: eng page: 263--272 place: Setúbal, Portugal project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '9' name: SFB 901 - Subproject B1 publication: Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods publisher: SCITEPRESS status: public title: What Reviews in Local Online Labour Markets Reveal about the Performance of Multi-Service Providers type: conference user_id: '58701' year: '2020' ... --- _id: '16935' author: - first_name: Diego Campos full_name: Moussalem, Diego Campos last_name: Moussalem citation: ama: Moussalem DC. Knowledge Graphs for Multilingual Language Translation and Generation.; 2020. doi:10.17619/UNIPB/1-980 apa: Moussalem, D. C. (2020). Knowledge Graphs for Multilingual Language Translation and Generation. https://doi.org/10.17619/UNIPB/1-980 bibtex: '@book{Moussalem_2020, title={Knowledge Graphs for Multilingual Language Translation and Generation}, DOI={10.17619/UNIPB/1-980}, author={Moussalem, Diego Campos}, year={2020} }' chicago: Moussalem, Diego Campos. Knowledge Graphs for Multilingual Language Translation and Generation, 2020. https://doi.org/10.17619/UNIPB/1-980. ieee: D. C. Moussalem, Knowledge Graphs for Multilingual Language Translation and Generation. 2020. mla: Moussalem, Diego Campos. Knowledge Graphs for Multilingual Language Translation and Generation. 2020, doi:10.17619/UNIPB/1-980. short: D.C. Moussalem, Knowledge Graphs for Multilingual Language Translation and Generation, 2020. date_created: 2020-05-05T06:16:29Z date_updated: 2022-11-30T13:43:53Z department: - _id: '574' doi: 10.17619/UNIPB/1-980 language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '10' name: SFB 901 - Subproject B2 status: public supervisor: - first_name: Axel-Cyrille full_name: Ngonga Ngomo, Axel-Cyrille id: '65716' last_name: Ngonga Ngomo title: Knowledge Graphs for Multilingual Language Translation and Generation type: dissertation user_id: '477' year: '2020' ... --- _id: '13770' author: - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Karl H, Kundisch D, Meyer auf der Heide F, Wehrheim H. A Case for a New IT Ecosystem: On-The-Fly Computing. Business & Information Systems Engineering. 2020;62(6):467-481. doi:10.1007/s12599-019-00627-x' apa: 'Karl, H., Kundisch, D., Meyer auf der Heide, F., & Wehrheim, H. (2020). A Case for a New IT Ecosystem: On-The-Fly Computing. Business & Information Systems Engineering, 62(6), 467–481. https://doi.org/10.1007/s12599-019-00627-x' bibtex: '@article{Karl_Kundisch_Meyer auf der Heide_Wehrheim_2020, title={A Case for a New IT Ecosystem: On-The-Fly Computing}, volume={62}, DOI={10.1007/s12599-019-00627-x}, number={6}, journal={Business & Information Systems Engineering}, publisher={Springer}, author={Karl, Holger and Kundisch, Dennis and Meyer auf der Heide, Friedhelm and Wehrheim, Heike}, year={2020}, pages={467–481} }' chicago: 'Karl, Holger, Dennis Kundisch, Friedhelm Meyer auf der Heide, and Heike Wehrheim. “A Case for a New IT Ecosystem: On-The-Fly Computing.” Business & Information Systems Engineering 62, no. 6 (2020): 467–81. https://doi.org/10.1007/s12599-019-00627-x.' ieee: 'H. Karl, D. Kundisch, F. Meyer auf der Heide, and H. Wehrheim, “A Case for a New IT Ecosystem: On-The-Fly Computing,” Business & Information Systems Engineering, vol. 62, no. 6, pp. 467–481, 2020, doi: 10.1007/s12599-019-00627-x.' mla: 'Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.” Business & Information Systems Engineering, vol. 62, no. 6, Springer, 2020, pp. 467–81, doi:10.1007/s12599-019-00627-x.' short: H. Karl, D. Kundisch, F. Meyer auf der Heide, H. Wehrheim, Business & Information Systems Engineering 62 (2020) 467–481. date_created: 2019-10-10T13:41:06Z date_updated: 2022-12-02T09:27:17Z ddc: - '004' department: - _id: '276' - _id: '75' - _id: '63' - _id: '77' doi: 10.1007/s12599-019-00627-x file: - access_level: closed content_type: application/pdf creator: ups date_created: 2019-12-12T10:24:47Z date_updated: 2019-12-12T10:24:47Z file_id: '15311' file_name: Karl2019_Article_ACaseForANewITEcosystemOn-The-.pdf file_size: 454532 relation: main_file success: 1 file_date_updated: 2019-12-12T10:24:47Z has_accepted_license: '1' intvolume: ' 62' issue: '6' language: - iso: eng page: 467-481 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '3' name: SFB 901 - Project Area B - _id: '4' name: SFB 901 - Project Area C - _id: '82' name: SFB 901 - Project Area T - _id: '5' name: SFB 901 - Subproject A1 - _id: '6' name: SFB 901 - Subproject A2 - _id: '7' name: SFB 901 - Subproject A3 - _id: '8' name: SFB 901 - Subproject A4 - _id: '9' name: SFB 901 - Subproject B1 - _id: '10' name: SFB 901 - Subproject B2 - _id: '11' name: SFB 901 - Subproject B3 - _id: '12' name: SFB 901 - Subproject B4 - _id: '13' name: SFB 901 - Subproject C1 - _id: '14' name: SFB 901 - Subproject C2 - _id: '15' name: SFB 901 - Subproject C3 - _id: '16' name: SFB 901 - Subproject C4 - _id: '17' name: SFB 901 - Subproject C5 - _id: '83' name: SFB 901 -Subproject T1 - _id: '84' name: SFB 901 -Subproject T2 - _id: '107' name: SFB 901 -Subproject T3 - _id: '158' name: 'SFB 901 - T4: SFB 901 -Subproject T4' publication: Business & Information Systems Engineering publication_status: published publisher: Springer status: public title: 'A Case for a New IT Ecosystem: On-The-Fly Computing' type: journal_article user_id: '477' volume: 62 year: '2020' ... --- _id: '3776' author: - first_name: Wei-Fan full_name: Chen, Wei-Fan id: '82920' last_name: Chen - first_name: Khalid full_name: Al-Khatib, Khalid last_name: Al-Khatib - first_name: Henning full_name: Wachsmuth, Henning id: '3900' last_name: Wachsmuth - first_name: Benno full_name: Stein, Benno last_name: Stein citation: ama: 'Chen W-F, Al-Khatib K, Wachsmuth H, Stein B. Analyzing Political Bias and Unfairness in News Articles at Different Levels of Granularity. In: Proceedings of the Fourth Workshop on Natural Language Processing and Computational Social Science. ; 2020:149-154.' apa: Chen, W.-F., Al-Khatib, K., Wachsmuth, H., & Stein, B. (2020). Analyzing Political Bias and Unfairness in News Articles at Different Levels of Granularity. Proceedings of the Fourth Workshop on Natural Language Processing and Computational Social Science, 149–154. bibtex: '@inproceedings{Chen_Al-Khatib_Wachsmuth_Stein_2020, title={Analyzing Political Bias and Unfairness in News Articles at Different Levels of Granularity}, booktitle={Proceedings of the Fourth Workshop on Natural Language Processing and Computational Social Science}, author={Chen, Wei-Fan and Al-Khatib, Khalid and Wachsmuth, Henning and Stein, Benno}, year={2020}, pages={149–154} }' chicago: Chen, Wei-Fan, Khalid Al-Khatib, Henning Wachsmuth, and Benno Stein. “Analyzing Political Bias and Unfairness in News Articles at Different Levels of Granularity.” In Proceedings of the Fourth Workshop on Natural Language Processing and Computational Social Science, 149–54, 2020. ieee: W.-F. Chen, K. Al-Khatib, H. Wachsmuth, and B. Stein, “Analyzing Political Bias and Unfairness in News Articles at Different Levels of Granularity,” in Proceedings of the Fourth Workshop on Natural Language Processing and Computational Social Science, 2020, pp. 149–154. mla: Chen, Wei-Fan, et al. “Analyzing Political Bias and Unfairness in News Articles at Different Levels of Granularity.” Proceedings of the Fourth Workshop on Natural Language Processing and Computational Social Science, 2020, pp. 149–54. short: 'W.-F. Chen, K. Al-Khatib, H. Wachsmuth, B. Stein, in: Proceedings of the Fourth Workshop on Natural Language Processing and Computational Social Science, 2020, pp. 149–154.' date_created: 2018-08-02T11:40:56Z date_updated: 2022-05-09T15:03:31Z department: - _id: '600' language: - iso: eng main_file_link: - url: https://www.aclweb.org/anthology/2020.nlpcss-1.16.pdf page: 149-154 project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '3' name: 'SFB 901 - B: SFB 901 - Project Area B' - _id: '9' name: 'SFB 901 - B1: SFB 901 - Subproject B1' publication: Proceedings of the Fourth Workshop on Natural Language Processing and Computational Social Science status: public title: Analyzing Political Bias and Unfairness in News Articles at Different Levels of Granularity type: conference user_id: '82920' year: '2020' ... --- _id: '20137' author: - first_name: Shahbaz full_name: Syed, Shahbaz last_name: Syed - first_name: Wei-Fan full_name: Chen, Wei-Fan id: '82920' last_name: Chen - first_name: Matthias full_name: Hagen, Matthias last_name: Hagen - first_name: Benno full_name: Stein, Benno last_name: Stein - first_name: Henning full_name: Wachsmuth, Henning id: '3900' last_name: Wachsmuth - first_name: Martin full_name: Potthast, Martin last_name: Potthast citation: ama: 'Syed S, Chen W-F, Hagen M, Stein B, Wachsmuth H, Potthast M. Task Proposal: Abstractive Snippet Generation for Web Pages. In: Proceedings of the 13th International Conference on Natural Language Generation (INLG 2020). ; 2020:237-241.' apa: 'Syed, S., Chen, W.-F., Hagen, M., Stein, B., Wachsmuth, H., & Potthast, M. (2020). Task Proposal: Abstractive Snippet Generation for Web Pages. Proceedings of the 13th International Conference on Natural Language Generation (INLG 2020), 237–241.' bibtex: '@inproceedings{Syed_Chen_Hagen_Stein_Wachsmuth_Potthast_2020, title={Task Proposal: Abstractive Snippet Generation for Web Pages}, booktitle={Proceedings of the 13th International Conference on Natural Language Generation (INLG 2020)}, author={Syed, Shahbaz and Chen, Wei-Fan and Hagen, Matthias and Stein, Benno and Wachsmuth, Henning and Potthast, Martin}, year={2020}, pages={237–241} }' chicago: 'Syed, Shahbaz, Wei-Fan Chen, Matthias Hagen, Benno Stein, Henning Wachsmuth, and Martin Potthast. “Task Proposal: Abstractive Snippet Generation for Web Pages.” In Proceedings of the 13th International Conference on Natural Language Generation (INLG 2020), 237–41, 2020.' ieee: 'S. Syed, W.-F. Chen, M. Hagen, B. Stein, H. Wachsmuth, and M. Potthast, “Task Proposal: Abstractive Snippet Generation for Web Pages,” in Proceedings of the 13th International Conference on Natural Language Generation (INLG 2020), 2020, pp. 237–241.' mla: 'Syed, Shahbaz, et al. “Task Proposal: Abstractive Snippet Generation for Web Pages.” Proceedings of the 13th International Conference on Natural Language Generation (INLG 2020), 2020, pp. 237–41.' short: 'S. Syed, W.-F. Chen, M. Hagen, B. Stein, H. Wachsmuth, M. Potthast, in: Proceedings of the 13th International Conference on Natural Language Generation (INLG 2020), 2020, pp. 237–241.' date_created: 2020-10-20T13:00:06Z date_updated: 2022-05-09T15:03:11Z department: - _id: '600' language: - iso: eng main_file_link: - url: https://www.aclweb.org/anthology/2020.inlg-1.30.pdf page: 237-241 project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '3' name: 'SFB 901 - B: SFB 901 - Project Area B' - _id: '9' name: 'SFB 901 - B1: SFB 901 - Subproject B1' publication: Proceedings of the 13th International Conference on Natural Language Generation (INLG 2020) status: public title: 'Task Proposal: Abstractive Snippet Generation for Web Pages' type: conference user_id: '82920' year: '2020' ... --- _id: '3818' author: - first_name: Wei-Fan full_name: Chen, Wei-Fan id: '82920' last_name: Chen - first_name: Khalid full_name: Al-Khatib, Khalid last_name: Al-Khatib - first_name: Benno full_name: Stein, Benno last_name: Stein - first_name: Henning full_name: Wachsmuth, Henning id: '3900' last_name: Wachsmuth citation: ama: 'Chen W-F, Al-Khatib K, Stein B, Wachsmuth H. Detecting Media Bias in News Articles using Gaussian Bias Distributions. In: Findings of the Association for Computational Linguistics: EMNLP 2020. ; 2020:4290-4300.' apa: 'Chen, W.-F., Al-Khatib, K., Stein, B., & Wachsmuth, H. (2020). Detecting Media Bias in News Articles using Gaussian Bias Distributions. Findings of the Association for Computational Linguistics: EMNLP 2020, 4290–4300.' bibtex: '@inproceedings{Chen_Al-Khatib_Stein_Wachsmuth_2020, title={Detecting Media Bias in News Articles using Gaussian Bias Distributions}, booktitle={Findings of the Association for Computational Linguistics: EMNLP 2020}, author={Chen, Wei-Fan and Al-Khatib, Khalid and Stein, Benno and Wachsmuth, Henning}, year={2020}, pages={4290–4300} }' chicago: 'Chen, Wei-Fan, Khalid Al-Khatib, Benno Stein, and Henning Wachsmuth. “Detecting Media Bias in News Articles Using Gaussian Bias Distributions.” In Findings of the Association for Computational Linguistics: EMNLP 2020, 4290–4300, 2020.' ieee: 'W.-F. Chen, K. Al-Khatib, B. Stein, and H. Wachsmuth, “Detecting Media Bias in News Articles using Gaussian Bias Distributions,” in Findings of the Association for Computational Linguistics: EMNLP 2020, 2020, pp. 4290–4300.' mla: 'Chen, Wei-Fan, et al. “Detecting Media Bias in News Articles Using Gaussian Bias Distributions.” Findings of the Association for Computational Linguistics: EMNLP 2020, 2020, pp. 4290–300.' short: 'W.-F. Chen, K. Al-Khatib, B. Stein, H. Wachsmuth, in: Findings of the Association for Computational Linguistics: EMNLP 2020, 2020, pp. 4290–4300.' date_created: 2018-08-02T13:38:46Z date_updated: 2022-05-09T15:00:46Z department: - _id: '600' language: - iso: eng main_file_link: - url: https://www.aclweb.org/anthology/2020.findings-emnlp.383.pdf page: 4290-4300 project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '3' name: 'SFB 901 - B: SFB 901 - Project Area B' - _id: '9' name: 'SFB 901 - B1: SFB 901 - Subproject B1' publication: 'Findings of the Association for Computational Linguistics: EMNLP 2020' status: public title: Detecting Media Bias in News Articles using Gaussian Bias Distributions type: conference user_id: '82920' year: '2020' ... --- _id: '15826' author: - first_name: Wei-Fan full_name: Chen, Wei-Fan id: '82920' last_name: Chen - first_name: Shahbaz full_name: Syed, Shahbaz last_name: Syed - first_name: Benno full_name: Stein, Benno last_name: Stein - first_name: Matthias full_name: Hagen, Matthias last_name: Hagen - first_name: Martin full_name: Potthast, Martin last_name: Potthast citation: ama: 'Chen W-F, Syed S, Stein B, Hagen M, Potthast M. Abstractive Snippet Generation. In: Proceedings of the Web Conference 2020. ; 2020:1309-1319.' apa: Chen, W.-F., Syed, S., Stein, B., Hagen, M., & Potthast, M. (2020). Abstractive Snippet Generation. Proceedings of the Web Conference 2020, 1309–1319. bibtex: '@inproceedings{Chen_Syed_Stein_Hagen_Potthast_2020, title={Abstractive Snippet Generation}, booktitle={Proceedings of the Web Conference 2020}, author={Chen, Wei-Fan and Syed, Shahbaz and Stein, Benno and Hagen, Matthias and Potthast, Martin}, year={2020}, pages={1309–1319} }' chicago: Chen, Wei-Fan, Shahbaz Syed, Benno Stein, Matthias Hagen, and Martin Potthast. “Abstractive Snippet Generation.” In Proceedings of the Web Conference 2020, 1309–19, 2020. ieee: W.-F. Chen, S. Syed, B. Stein, M. Hagen, and M. Potthast, “Abstractive Snippet Generation,” in Proceedings of the Web Conference 2020, 2020, pp. 1309–1319. mla: Chen, Wei-Fan, et al. “Abstractive Snippet Generation.” Proceedings of the Web Conference 2020, 2020, pp. 1309–19. short: 'W.-F. Chen, S. Syed, B. Stein, M. Hagen, M. Potthast, in: Proceedings of the Web Conference 2020, 2020, pp. 1309–1319.' date_created: 2020-02-06T10:51:33Z date_updated: 2022-05-09T15:03:53Z department: - _id: '600' - _id: '568' language: - iso: eng main_file_link: - url: https://dl.acm.org/doi/pdf/10.1145/3366423.3380206 page: 1309-1319 project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '3' name: 'SFB 901 - B: SFB 901 - Project Area B' - _id: '9' name: 'SFB 901 - B1: SFB 901 - Subproject B1' publication: Proceedings of the Web Conference 2020 status: public title: Abstractive Snippet Generation type: conference user_id: '82920' year: '2020' ... --- _id: '16868' author: - first_name: Milad full_name: Alshomary, Milad id: '73059' last_name: Alshomary - first_name: Shahbaz full_name: Syed, Shahbaz last_name: Syed - first_name: Martin full_name: Potthast, Martin last_name: Potthast - first_name: Henning full_name: Wachsmuth, Henning id: '3900' last_name: Wachsmuth citation: ama: 'Alshomary M, Syed S, Potthast M, Wachsmuth H. Target Inference in Argument Conclusion Generation. In: Proceedings of 58th Annual Meeting of the Association for Computational Linguistics (ACL 2020). Proceedings of 58th Annual Meeting of the Association for Computational Linguistics. Association for Computational Linguistics; 2020:4334-4345.' apa: Alshomary, M., Syed, S., Potthast, M., & Wachsmuth, H. (2020). Target Inference in Argument Conclusion Generation. Proceedings of 58th Annual Meeting of the Association for Computational Linguistics (ACL 2020), 4334–4345. bibtex: '@inproceedings{Alshomary_Syed_Potthast_Wachsmuth_2020, series={Proceedings of 58th Annual Meeting of the Association for Computational Linguistics}, title={Target Inference in Argument Conclusion Generation}, booktitle={Proceedings of 58th Annual Meeting of the Association for Computational Linguistics (ACL 2020)}, publisher={Association for Computational Linguistics}, author={Alshomary, Milad and Syed, Shahbaz and Potthast, Martin and Wachsmuth, Henning}, year={2020}, pages={4334–4345}, collection={Proceedings of 58th Annual Meeting of the Association for Computational Linguistics} }' chicago: Alshomary, Milad, Shahbaz Syed, Martin Potthast, and Henning Wachsmuth. “Target Inference in Argument Conclusion Generation.” In Proceedings of 58th Annual Meeting of the Association for Computational Linguistics (ACL 2020), 4334–45. Proceedings of 58th Annual Meeting of the Association for Computational Linguistics. Association for Computational Linguistics, 2020. ieee: M. Alshomary, S. Syed, M. Potthast, and H. Wachsmuth, “Target Inference in Argument Conclusion Generation,” in Proceedings of 58th Annual Meeting of the Association for Computational Linguistics (ACL 2020), Seattle, USA, 2020, pp. 4334–4345. mla: Alshomary, Milad, et al. “Target Inference in Argument Conclusion Generation.” Proceedings of 58th Annual Meeting of the Association for Computational Linguistics (ACL 2020), Association for Computational Linguistics, 2020, pp. 4334–45. short: 'M. Alshomary, S. Syed, M. Potthast, H. Wachsmuth, in: Proceedings of 58th Annual Meeting of the Association for Computational Linguistics (ACL 2020), Association for Computational Linguistics, 2020, pp. 4334–4345.' conference: end_date: 2020.07.10 location: Seattle, USA name: 58th Annual Meeting of the Association for Computational Linguistics (ACL 2020) start_date: 2020.07.05 date_created: 2020-04-27T10:11:00Z date_updated: 2022-05-09T15:06:52Z ddc: - '000' department: - _id: '600' - _id: '568' file: - access_level: closed content_type: application/pdf creator: sile2804 date_created: 2020-05-22T06:41:25Z date_updated: 2020-05-22T06:41:25Z file_id: '17054' file_name: acl20-conclusion-generation-frame.pdf file_size: 1572275 relation: main_file success: 1 file_date_updated: 2020-05-22T06:41:25Z has_accepted_license: '1' language: - iso: eng page: 4334-4345 project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '3' name: 'SFB 901 - B: SFB 901 - Project Area B' - _id: '9' name: 'SFB 901 - B1: SFB 901 - Subproject B1' publication: Proceedings of 58th Annual Meeting of the Association for Computational Linguistics (ACL 2020) publisher: Association for Computational Linguistics series_title: Proceedings of 58th Annual Meeting of the Association for Computational Linguistics status: public title: Target Inference in Argument Conclusion Generation type: conference user_id: '82920' year: '2020' ... --- _id: '3287' abstract: - lang: eng text: "For optimal placement and orchestration of network services, it is crucial\r\nthat their structure and semantics are specified clearly and comprehensively\r\nand are available to an orchestrator. Existing specification approaches are\r\neither ambiguous or miss important aspects regarding the behavior of virtual\r\nnetwork functions (VNFs) forming a service. We propose to formally and\r\nunambiguously specify the behavior of these functions and services using\r\nQueuing Petri Nets (QPNs). QPNs are an established method that allows to\r\nexpress queuing, synchronization, stochastically distributed processing delays,\r\nand changing traffic volume and characteristics at each VNF. With QPNs,\r\nmultiple VNFs can be connected to complete network services in any structure,\r\neven specifying bidirectional network services containing loops.\r\n We discuss how management and orchestration systems can benefit from our\r\nclear and comprehensive specification approach, leading to better placement of\r\nVNFs and improved Quality of Service. Another benefit of formally specifying\r\nnetwork services with QPNs are diverse analysis options, which allow valuable\r\ninsights such as the distribution of end-to-end delay. We propose a tool-based\r\nworkflow that supports the specification of network services and the automatic\r\ngeneration of corresponding simulation code to enable an in-depth analysis of\r\ntheir behavior and performance." author: - first_name: Stefan Balthasar full_name: Schneider, Stefan Balthasar id: '35343' last_name: Schneider orcid: 0000-0001-8210-4011 - first_name: Arnab full_name: Sharma, Arnab id: '67200' last_name: Sharma - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Schneider SB, Sharma A, Karl H, Wehrheim H. Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets. In: 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM). Washington, DC, USA: IFIP; 2019:116--124.' apa: 'Schneider, S. B., Sharma, A., Karl, H., & Wehrheim, H. (2019). Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets. In 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM) (pp. 116--124). Washington, DC, USA: IFIP.' bibtex: '@inproceedings{Schneider_Sharma_Karl_Wehrheim_2019, place={Washington, DC, USA}, title={Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets}, booktitle={2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)}, publisher={IFIP}, author={Schneider, Stefan Balthasar and Sharma, Arnab and Karl, Holger and Wehrheim, Heike}, year={2019}, pages={116--124} }' chicago: 'Schneider, Stefan Balthasar, Arnab Sharma, Holger Karl, and Heike Wehrheim. “Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets.” In 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM), 116--124. Washington, DC, USA: IFIP, 2019.' ieee: S. B. Schneider, A. Sharma, H. Karl, and H. Wehrheim, “Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets,” in 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM), Washington, DC, USA, 2019, pp. 116--124. mla: Schneider, Stefan Balthasar, et al. “Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets.” 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM), IFIP, 2019, pp. 116--124. short: 'S.B. Schneider, A. Sharma, H. Karl, H. Wehrheim, in: 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM), IFIP, Washington, DC, USA, 2019, pp. 116--124.' conference: end_date: 2019-04-12 location: Washington, DC, USA name: 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM) start_date: 2019-04-08 date_created: 2018-06-18T15:23:18Z date_updated: 2022-01-06T06:59:09Z ddc: - '040' department: - _id: '77' - _id: '75' file: - access_level: open_access content_type: application/pdf creator: stschn date_created: 2019-01-07T12:38:35Z date_updated: 2019-01-07T12:38:35Z file_id: '6504' file_name: ris_preprint.pdf file_size: 497528 relation: main_file file_date_updated: 2019-01-07T12:38:35Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://dl.ifip.org/db/conf/im/im2019/188490.pdf oa: '1' page: 116--124 place: Washington, DC, USA project: - _id: '3' name: SFB 901 - Project Area B - _id: '11' name: SFB 901 - Subproject B3 - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '16' name: SFB 901 - Subproject C4 - _id: '28' grant_number: '761493' name: 5G Development and validation platform for global industry-specific network services and Apps - _id: '25' call_identifier: 5G PPP Phase 1 grant_number: '671517' name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks' publication: 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM) publisher: IFIP status: public title: Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets type: conference user_id: '35343' year: '2019' ... --- _id: '3585' abstract: - lang: eng text: Existing approaches and tools for the generation of approximate circuits often lack generality and are restricted to certain circuit types, approximation techniques, and quality assurance methods. Moreover, only few tools are publicly available. This hinders the development and evaluation of new techniques for approximating circuits and their comparison to previous approaches. In this paper, we first analyze and classify related approaches and then present CIRCA, our flexible framework for search-based approximate circuit generation. CIRCA is developed with a focus on modularity and extensibility. We present the architecture of CIRCA with its clear separation into stages and functional blocks, report on the current prototype, and show initial experiments. author: - first_name: Linus Matthias full_name: Witschen, Linus Matthias id: '49051' last_name: Witschen - first_name: Tobias full_name: Wiersema, Tobias id: '3118' last_name: Wiersema - first_name: Hassan full_name: Ghasemzadeh Mohammadi, Hassan id: '61186' last_name: Ghasemzadeh Mohammadi - first_name: Muhammad full_name: Awais, Muhammad id: '64665' last_name: Awais orcid: https://orcid.org/0000-0003-4148-2969 - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: ama: 'Witschen LM, Wiersema T, Ghasemzadeh Mohammadi H, Awais M, Platzner M. CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation. Microelectronics Reliability. 2019;99:277-290. doi:10.1016/j.microrel.2019.04.003' apa: 'Witschen, L. M., Wiersema, T., Ghasemzadeh Mohammadi, H., Awais, M., & Platzner, M. (2019). CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation. Microelectronics Reliability, 99, 277–290. https://doi.org/10.1016/j.microrel.2019.04.003' bibtex: '@article{Witschen_Wiersema_Ghasemzadeh Mohammadi_Awais_Platzner_2019, title={CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation}, volume={99}, DOI={10.1016/j.microrel.2019.04.003}, journal={Microelectronics Reliability}, publisher={Elsevier}, author={Witschen, Linus Matthias and Wiersema, Tobias and Ghasemzadeh Mohammadi, Hassan and Awais, Muhammad and Platzner, Marco}, year={2019}, pages={277–290} }' chicago: 'Witschen, Linus Matthias, Tobias Wiersema, Hassan Ghasemzadeh Mohammadi, Muhammad Awais, and Marco Platzner. “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation.” Microelectronics Reliability 99 (2019): 277–90. https://doi.org/10.1016/j.microrel.2019.04.003.' ieee: 'L. M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, and M. Platzner, “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation,” Microelectronics Reliability, vol. 99, pp. 277–290, 2019.' mla: 'Witschen, Linus Matthias, et al. “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation.” Microelectronics Reliability, vol. 99, Elsevier, 2019, pp. 277–90, doi:10.1016/j.microrel.2019.04.003.' short: L.M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, M. Platzner, Microelectronics Reliability 99 (2019) 277–290. date_created: 2018-07-20T14:08:49Z date_updated: 2022-01-06T06:59:25Z department: - _id: '78' doi: 10.1016/j.microrel.2019.04.003 intvolume: ' 99' keyword: - Approximate Computing - Framework - Pareto Front - Accuracy language: - iso: eng page: 277-290 project: - _id: '12' name: SFB 901 - Subproject B4 - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: Microelectronics Reliability publication_identifier: issn: - 0026-2714 publication_status: published publisher: Elsevier status: public title: 'CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation' type: journal_article user_id: '49051' volume: 99 year: '2019' ... --- _id: '7752' author: - first_name: Arnab full_name: Sharma, Arnab id: '67200' last_name: Sharma - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Sharma A, Wehrheim H. Testing Balancedness of ML Algorithms. In: Proceedings of the Software Engineering Conference (SE). Vol P-292. Lecture Notes in Informatics (LNI). Stuttgart: Gesellschaft für Informatik e.V. (GI); 2019:157-158.' apa: 'Sharma, A., & Wehrheim, H. (2019). Testing Balancedness of ML Algorithms. In Proceedings of the Software Engineering Conference (SE) (Vol. P-292, pp. 157–158). Stuttgart: Gesellschaft für Informatik e.V. (GI).' bibtex: '@inproceedings{Sharma_Wehrheim_2019, place={Stuttgart}, series={Lecture Notes in Informatics (LNI)}, title={Testing Balancedness of ML Algorithms}, volume={P-292}, booktitle={Proceedings of the Software Engineering Conference (SE)}, publisher={Gesellschaft für Informatik e.V. (GI)}, author={Sharma, Arnab and Wehrheim, Heike}, year={2019}, pages={157–158}, collection={Lecture Notes in Informatics (LNI)} }' chicago: 'Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.” In Proceedings of the Software Engineering Conference (SE), P-292:157–58. Lecture Notes in Informatics (LNI). Stuttgart: Gesellschaft für Informatik e.V. (GI), 2019.' ieee: A. Sharma and H. Wehrheim, “Testing Balancedness of ML Algorithms,” in Proceedings of the Software Engineering Conference (SE), Stuttgart, 2019, vol. P-292, pp. 157–158. mla: Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.” Proceedings of the Software Engineering Conference (SE), vol. P-292, Gesellschaft für Informatik e.V. (GI), 2019, pp. 157–58. short: 'A. Sharma, H. Wehrheim, in: Proceedings of the Software Engineering Conference (SE), Gesellschaft für Informatik e.V. (GI), Stuttgart, 2019, pp. 157–158.' conference: end_date: 2019-02-22 location: Stuttgart name: Software Engineering(SE) start_date: 2019-02-18 date_created: 2019-02-19T08:28:23Z date_updated: 2022-01-06T07:03:45Z department: - _id: '34' - _id: '77' language: - iso: eng page: 157 - 158 place: Stuttgart project: - _id: '3' name: SFB 901 - Project Area B - _id: '11' name: SFB 901 - Subproject B3 - _id: '1' name: SFB 901 publication: Proceedings of the Software Engineering Conference (SE) publication_identifier: isbn: - 978-3-88579-686-2 publication_status: published publisher: Gesellschaft für Informatik e.V. (GI) series_title: Lecture Notes in Informatics (LNI) status: public title: Testing Balancedness of ML Algorithms type: conference_abstract user_id: '477' volume: P-292 year: '2019' ... --- _id: '8312' author: - first_name: Frederik Simon full_name: Bäumer, Frederik Simon id: '38837' last_name: Bäumer - first_name: Michaela full_name: Geierhos, Michaela id: '42496' last_name: Geierhos orcid: 0000-0002-8180-5606 citation: ama: 'Bäumer FS, Geierhos M. Requirements Engineering in OTF-Computing. In: Encyclopedia.Pub. Basel, Switzerland: MDPI; 2019.' apa: 'Bäumer, F. S., & Geierhos, M. (2019). Requirements Engineering in OTF-Computing. In encyclopedia.pub. Basel, Switzerland: MDPI.' bibtex: '@inbook{Bäumer_Geierhos_2019, place={Basel, Switzerland}, title={Requirements Engineering in OTF-Computing}, booktitle={encyclopedia.pub}, publisher={MDPI}, author={Bäumer, Frederik Simon and Geierhos, Michaela}, year={2019} }' chicago: 'Bäumer, Frederik Simon, and Michaela Geierhos. “Requirements Engineering in OTF-Computing.” In Encyclopedia.Pub. Basel, Switzerland: MDPI, 2019.' ieee: 'F. S. Bäumer and M. Geierhos, “Requirements Engineering in OTF-Computing,” in encyclopedia.pub, Basel, Switzerland: MDPI, 2019.' mla: Bäumer, Frederik Simon, and Michaela Geierhos. “Requirements Engineering in OTF-Computing.” Encyclopedia.Pub, MDPI, 2019. short: 'F.S. Bäumer, M. Geierhos, in: Encyclopedia.Pub, MDPI, Basel, Switzerland, 2019.' date_created: 2019-03-05T08:54:37Z date_updated: 2022-01-06T07:03:53Z department: - _id: '36' - _id: '1' - _id: '579' keyword: - OTF Computing - Natural Language Processing - Requirements Engineering language: - iso: eng main_file_link: - open_access: '1' url: https://encyclopedia.pub/131 oa: '1' place: Basel, Switzerland project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '9' name: SFB 901 - Subproject B1 publication: encyclopedia.pub publication_status: published publisher: MDPI quality_controlled: '1' status: public title: Requirements Engineering in OTF-Computing type: encyclopedia_article user_id: '42496' year: '2019' ... --- _id: '7623' author: - first_name: Shikun full_name: Zhang, Shikun last_name: Zhang citation: ama: Zhang S. Combining Android Apps for Analysis Purposes. Universität Paderborn; 2019. apa: Zhang, S. (2019). Combining Android Apps for Analysis Purposes. Universität Paderborn. bibtex: '@book{Zhang_2019, title={Combining Android Apps for Analysis Purposes}, publisher={Universität Paderborn}, author={Zhang, Shikun}, year={2019} }' chicago: Zhang, Shikun. Combining Android Apps for Analysis Purposes. Universität Paderborn, 2019. ieee: S. Zhang, Combining Android Apps for Analysis Purposes. Universität Paderborn, 2019. mla: Zhang, Shikun. Combining Android Apps for Analysis Purposes. Universität Paderborn, 2019. short: S. Zhang, Combining Android Apps for Analysis Purposes, Universität Paderborn, 2019. date_created: 2019-02-12T06:13:43Z date_updated: 2022-01-06T07:03:41Z department: - _id: '77' language: - iso: eng page: '64' project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 publisher: Universität Paderborn status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim title: Combining Android Apps for Analysis Purposes type: mastersthesis user_id: '477' year: '2019' ... --- _id: '7628' author: - first_name: Nils full_name: Selbach, Nils last_name: Selbach citation: ama: Selbach N. Modeling Crypto API Usages in OpenSSL’s EVP Library. Universität Paderborn; 2019. apa: Selbach, N. (2019). Modeling Crypto API usages in OpenSSL’s EVP library. Universität Paderborn. bibtex: '@book{Selbach_2019, title={Modeling Crypto API usages in OpenSSL’s EVP library}, publisher={Universität Paderborn}, author={Selbach, Nils}, year={2019} }' chicago: Selbach, Nils. Modeling Crypto API Usages in OpenSSL’s EVP Library. Universität Paderborn, 2019. ieee: N. Selbach, Modeling Crypto API usages in OpenSSL’s EVP library. Universität Paderborn, 2019. mla: Selbach, Nils. Modeling Crypto API Usages in OpenSSL’s EVP Library. Universität Paderborn, 2019. short: N. Selbach, Modeling Crypto API Usages in OpenSSL’s EVP Library, Universität Paderborn, 2019. date_created: 2019-02-12T07:28:12Z date_updated: 2022-01-06T07:03:41Z department: - _id: '76' language: - iso: eng project: - _id: '12' name: SFB 901 - Subproject B4 - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public supervisor: - first_name: Philipp full_name: Schubert, Philipp id: '60543' last_name: Schubert orcid: 0000-0002-8674-1859 title: Modeling Crypto API usages in OpenSSL's EVP library type: bachelorsthesis user_id: '477' year: '2019' ... --- _id: '7635' author: - first_name: Arnab full_name: Sharma, Arnab id: '67200' last_name: Sharma - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Sharma A, Wehrheim H. Testing Machine Learning Algorithms for Balanced Data Usage. In: IEEE International Conference on Software Testing, Verification and Validation (ICST). Xi’an, China: IEEE; 2019:125--135.' apa: 'Sharma, A., & Wehrheim, H. (2019). Testing Machine Learning Algorithms for Balanced Data Usage. In IEEE International Conference on Software Testing, Verification and Validation (ICST) (pp. 125--135). Xi’an, China: IEEE.' bibtex: '@inproceedings{Sharma_Wehrheim_2019, place={Xi’an, China}, title={Testing Machine Learning Algorithms for Balanced Data Usage}, booktitle={IEEE International Conference on Software Testing, Verification and Validation (ICST)}, publisher={IEEE}, author={Sharma, Arnab and Wehrheim, Heike}, year={2019}, pages={125--135} }' chicago: 'Sharma, Arnab, and Heike Wehrheim. “Testing Machine Learning Algorithms for Balanced Data Usage.” In IEEE International Conference on Software Testing, Verification and Validation (ICST), 125--135. Xi’an, China: IEEE, 2019.' ieee: A. Sharma and H. Wehrheim, “Testing Machine Learning Algorithms for Balanced Data Usage,” in IEEE International Conference on Software Testing, Verification and Validation (ICST), Xi’an, China, April, 2019, 2019, pp. 125--135. mla: Sharma, Arnab, and Heike Wehrheim. “Testing Machine Learning Algorithms for Balanced Data Usage.” IEEE International Conference on Software Testing, Verification and Validation (ICST), IEEE, 2019, pp. 125--135. short: 'A. Sharma, H. Wehrheim, in: IEEE International Conference on Software Testing, Verification and Validation (ICST), IEEE, Xi’an, China, 2019, pp. 125--135.' conference: end_date: 2019-04-27 location: Xi'an, China, April, 2019 name: IEEE International Conference on Software Testing, Verification and Validation (ICST) start_date: 2019-04-22 date_created: 2019-02-12T12:31:57Z date_updated: 2022-01-06T07:03:42Z ddc: - '004' department: - _id: '34' - _id: '77' file: - access_level: closed content_type: application/pdf creator: ups date_created: 2019-08-26T10:56:34Z date_updated: 2019-08-26T10:56:34Z file_id: '12960' file_name: 08730187.pdf file_size: 266375 relation: main_file success: 1 file_date_updated: 2019-08-26T10:56:34Z has_accepted_license: '1' language: - iso: eng page: 125--135 place: Xi'an, China project: - _id: '3' name: SFB 901 - Project Area B - _id: '11' name: SFB 901 - Subproject B3 - _id: '1' name: SFB 901 publication: IEEE International Conference on Software Testing, Verification and Validation (ICST) publication_status: published publisher: IEEE status: public title: Testing Machine Learning Algorithms for Balanced Data Usage type: conference user_id: '29719' year: '2019' ...