--- _id: '43395' author: - first_name: Roman full_name: Trentinaglia, Roman id: '49934' last_name: Trentinaglia orcid: 0000-0001-9728-4991 - first_name: Sven full_name: Merschjohann, Sven id: '11394' last_name: Merschjohann - first_name: Markus full_name: Fockel, Markus id: '8472' last_name: Fockel orcid: 0000-0002-1269-0702 - first_name: Hendrik full_name: Eikerling, Hendrik id: '29279' last_name: Eikerling citation: ama: 'Trentinaglia R, Merschjohann S, Fockel M, Eikerling H. Eliciting Security Requirements – An Experience Report. In: REFSQ 2023: Requirements Engineering: Foundation for Software Quality. Springer Nature Switzerland; 2023. doi:10.1007/978-3-031-29786-1_25' apa: 'Trentinaglia, R., Merschjohann, S., Fockel, M., & Eikerling, H. (2023). Eliciting Security Requirements – An Experience Report. REFSQ 2023: Requirements Engineering: Foundation for Software Quality. https://doi.org/10.1007/978-3-031-29786-1_25' bibtex: '@inproceedings{Trentinaglia_Merschjohann_Fockel_Eikerling_2023, place={Cham}, title={Eliciting Security Requirements – An Experience Report}, DOI={10.1007/978-3-031-29786-1_25}, booktitle={REFSQ 2023: Requirements Engineering: Foundation for Software Quality}, publisher={Springer Nature Switzerland}, author={Trentinaglia, Roman and Merschjohann, Sven and Fockel, Markus and Eikerling, Hendrik}, year={2023} }' chicago: 'Trentinaglia, Roman, Sven Merschjohann, Markus Fockel, and Hendrik Eikerling. “Eliciting Security Requirements – An Experience Report.” In REFSQ 2023: Requirements Engineering: Foundation for Software Quality. Cham: Springer Nature Switzerland, 2023. https://doi.org/10.1007/978-3-031-29786-1_25.' ieee: 'R. Trentinaglia, S. Merschjohann, M. Fockel, and H. Eikerling, “Eliciting Security Requirements – An Experience Report,” 2023, doi: 10.1007/978-3-031-29786-1_25.' mla: 'Trentinaglia, Roman, et al. “Eliciting Security Requirements – An Experience Report.” REFSQ 2023: Requirements Engineering: Foundation for Software Quality, Springer Nature Switzerland, 2023, doi:10.1007/978-3-031-29786-1_25.' short: 'R. Trentinaglia, S. Merschjohann, M. Fockel, H. Eikerling, in: REFSQ 2023: Requirements Engineering: Foundation for Software Quality, Springer Nature Switzerland, Cham, 2023.' date_created: 2023-04-04T12:47:31Z date_updated: 2023-04-04T12:51:41Z department: - _id: '241' - _id: '662' doi: 10.1007/978-3-031-29786-1_25 language: - iso: eng place: Cham publication: 'REFSQ 2023: Requirements Engineering: Foundation for Software Quality' publication_identifier: isbn: - '9783031297854' - '9783031297861' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Nature Switzerland status: public title: Eliciting Security Requirements – An Experience Report type: conference user_id: '8472' year: '2023' ... --- _id: '44769' author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Jonas full_name: Harbig, Jonas id: '47213' last_name: Harbig - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Castenow J, Harbig J, Meyer auf der Heide F. Unifying Gathering Protocols for Swarms of Mobile Robots. In: Lecture Notes in Computer Science. Springer International Publishing; 2023. doi:10.1007/978-3-031-30448-4_1' apa: Castenow, J., Harbig, J., & Meyer auf der Heide, F. (2023). Unifying Gathering Protocols for Swarms of Mobile Robots. In Lecture Notes in Computer Science. Springer International Publishing. https://doi.org/10.1007/978-3-031-30448-4_1 bibtex: '@inbook{Castenow_Harbig_Meyer auf der Heide_2023, place={Cham}, title={Unifying Gathering Protocols for Swarms of Mobile Robots}, DOI={10.1007/978-3-031-30448-4_1}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Castenow, Jannik and Harbig, Jonas and Meyer auf der Heide, Friedhelm}, year={2023} }' chicago: 'Castenow, Jannik, Jonas Harbig, and Friedhelm Meyer auf der Heide. “Unifying Gathering Protocols for Swarms of Mobile Robots.” In Lecture Notes in Computer Science. Cham: Springer International Publishing, 2023. https://doi.org/10.1007/978-3-031-30448-4_1.' ieee: 'J. Castenow, J. Harbig, and F. Meyer auf der Heide, “Unifying Gathering Protocols for Swarms of Mobile Robots,” in Lecture Notes in Computer Science, Cham: Springer International Publishing, 2023.' mla: Castenow, Jannik, et al. “Unifying Gathering Protocols for Swarms of Mobile Robots.” Lecture Notes in Computer Science, Springer International Publishing, 2023, doi:10.1007/978-3-031-30448-4_1. short: 'J. Castenow, J. Harbig, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2023.' date_created: 2023-05-11T13:13:45Z date_updated: 2023-05-11T13:14:43Z department: - _id: '63' doi: 10.1007/978-3-031-30448-4_1 language: - iso: eng place: Cham project: - _id: '106' name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme' publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783031304477' - '9783031304484' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: Unifying Gathering Protocols for Swarms of Mobile Robots type: book_chapter user_id: '38705' year: '2023' ... --- _id: '46516' abstract: - lang: eng text: Linked knowledge graphs build the backbone of many data-driven applications such as search engines, conversational agents and e-commerce solutions. Declarative link discovery frameworks use complex link specifications to express the conditions under which a link between two resources can be deemed to exist. However, understanding such complex link specifications is a challenging task for non-expert users of link discovery frameworks. In this paper, we address this drawback by devising NMV-LS, a language model-based verbalization approach for translating complex link specifications into natural language. NMV-LS relies on the results of rule-based link specification verbalization to apply continuous training on T5, a large language model based on the Transformerarchitecture. We evaluated NMV-LS on English and German datasets using well-known machine translation metrics such as BLUE, METEOR, ChrF++ and TER. Our results suggest that our approach achieves a verbalization performance close to that of humans and outperforms state of the art approaches. Our source code and datasets are publicly available at https://github.com/dice-group/NMV-LS. author: - first_name: Abdullah Fathi Ahmed full_name: Ahmed, Abdullah Fathi Ahmed id: '29670' last_name: Ahmed - first_name: Asep Fajar full_name: Firmansyah, Asep Fajar id: '76787' last_name: Firmansyah - first_name: Mohamed full_name: Sherif, Mohamed id: '67234' last_name: Sherif orcid: https://orcid.org/0000-0002-9927-2203 - first_name: Diego full_name: Moussallem, Diego id: '71635' last_name: Moussallem - first_name: Axel-Cyrille full_name: Ngonga Ngomo, Axel-Cyrille id: '65716' last_name: Ngonga Ngomo citation: ama: 'Ahmed AFA, Firmansyah AF, Sherif M, Moussallem D, Ngonga Ngomo A-C. Explainable Integration of Knowledge Graphs Using Large Language Models. In: Natural Language Processing and Information Systems. Springer Nature Switzerland; 2023. doi:10.1007/978-3-031-35320-8_9' apa: Ahmed, A. F. A., Firmansyah, A. F., Sherif, M., Moussallem, D., & Ngonga Ngomo, A.-C. (2023). Explainable Integration of Knowledge Graphs Using Large Language Models. In Natural Language Processing and Information Systems. Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-35320-8_9 bibtex: '@inbook{Ahmed_Firmansyah_Sherif_Moussallem_Ngonga Ngomo_2023, place={Cham}, title={Explainable Integration of Knowledge Graphs Using Large Language Models}, DOI={10.1007/978-3-031-35320-8_9}, booktitle={Natural Language Processing and Information Systems}, publisher={Springer Nature Switzerland}, author={Ahmed, Abdullah Fathi Ahmed and Firmansyah, Asep Fajar and Sherif, Mohamed and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}, year={2023} }' chicago: 'Ahmed, Abdullah Fathi Ahmed, Asep Fajar Firmansyah, Mohamed Sherif, Diego Moussallem, and Axel-Cyrille Ngonga Ngomo. “Explainable Integration of Knowledge Graphs Using Large Language Models.” In Natural Language Processing and Information Systems. Cham: Springer Nature Switzerland, 2023. https://doi.org/10.1007/978-3-031-35320-8_9.' ieee: 'A. F. A. Ahmed, A. F. Firmansyah, M. Sherif, D. Moussallem, and A.-C. Ngonga Ngomo, “Explainable Integration of Knowledge Graphs Using Large Language Models,” in Natural Language Processing and Information Systems, Cham: Springer Nature Switzerland, 2023.' mla: Ahmed, Abdullah Fathi Ahmed, et al. “Explainable Integration of Knowledge Graphs Using Large Language Models.” Natural Language Processing and Information Systems, Springer Nature Switzerland, 2023, doi:10.1007/978-3-031-35320-8_9. short: 'A.F.A. Ahmed, A.F. Firmansyah, M. Sherif, D. Moussallem, A.-C. Ngonga Ngomo, in: Natural Language Processing and Information Systems, Springer Nature Switzerland, Cham, 2023.' date_created: 2023-08-16T08:57:11Z date_updated: 2023-08-16T09:15:42Z department: - _id: '34' doi: 10.1007/978-3-031-35320-8_9 language: - iso: eng place: Cham publication: Natural Language Processing and Information Systems publication_identifier: isbn: - '9783031353192' - '9783031353208' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Nature Switzerland status: public title: Explainable Integration of Knowledge Graphs Using Large Language Models type: book_chapter user_id: '67234' year: '2023' ... --- _id: '46572' abstract: - lang: eng text: Indonesian is classified as underrepresented in the Natural Language Processing (NLP) field, despite being the tenth most spoken language in the world with 198 million speakers. The paucity of datasets is recognized as the main reason for the slow advancements in NLP research for underrepresented languages. Significant attempts were made in 2020 to address this drawback for Indonesian. The Indonesian Natural Language Understanding (IndoNLU) benchmark was introduced alongside IndoBERT pre-trained language model. The second benchmark, Indonesian Language Evaluation Montage (IndoLEM), was presented in the same year. These benchmarks support several tasks, including Named Entity Recognition (NER). However, all NER datasets are in the public domain and do not contain domain-specific datasets. To alleviate this drawback, we introduce IndQNER, a manually annotated NER benchmark dataset in the religious domain that adheres to a meticulously designed annotation guideline. Since Indonesia has the world’s largest Muslim population, we build the dataset from the Indonesian translation of the Quran. The dataset includes 2475 named entities representing 18 different classes. To assess the annotation quality of IndQNER, we perform experiments with BiLSTM and CRF-based NER, as well as IndoBERT fine-tuning. The results reveal that the first model outperforms the second model achieving 0.98 F1 points. This outcome indicates that IndQNER may be an acceptable evaluation metric for Indonesian NER tasks in the aforementioned domain, widening the research’s domain range. author: - first_name: Ria Hari full_name: Gusmita, Ria Hari last_name: Gusmita - first_name: Asep Fajar full_name: Firmansyah, Asep Fajar last_name: Firmansyah - first_name: Diego full_name: Moussallem, Diego last_name: Moussallem - first_name: Axel-Cyrille full_name: Ngonga Ngomo, Axel-Cyrille last_name: Ngonga Ngomo citation: ama: 'Gusmita RH, Firmansyah AF, Moussallem D, Ngonga Ngomo A-C. IndQNER: Named Entity Recognition Benchmark Dataset from the Indonesian Translation of the Quran. In: Natural Language Processing and Information Systems. Springer Nature Switzerland; 2023. doi:10.1007/978-3-031-35320-8_12' apa: 'Gusmita, R. H., Firmansyah, A. F., Moussallem, D., & Ngonga Ngomo, A.-C. (2023). IndQNER: Named Entity Recognition Benchmark Dataset from the Indonesian Translation of the Quran. In Natural Language Processing and Information Systems. International Conference on Applications of Natural Language to Information Systems (NLDB) 2023, Derby, UK. Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-35320-8_12' bibtex: '@inbook{Gusmita_Firmansyah_Moussallem_Ngonga Ngomo_2023, place={Cham}, title={IndQNER: Named Entity Recognition Benchmark Dataset from the Indonesian Translation of the Quran}, DOI={10.1007/978-3-031-35320-8_12}, booktitle={Natural Language Processing and Information Systems}, publisher={Springer Nature Switzerland}, author={Gusmita, Ria Hari and Firmansyah, Asep Fajar and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}, year={2023} }' chicago: 'Gusmita, Ria Hari, Asep Fajar Firmansyah, Diego Moussallem, and Axel-Cyrille Ngonga Ngomo. “IndQNER: Named Entity Recognition Benchmark Dataset from the Indonesian Translation of the Quran.” In Natural Language Processing and Information Systems. Cham: Springer Nature Switzerland, 2023. https://doi.org/10.1007/978-3-031-35320-8_12.' ieee: 'R. H. Gusmita, A. F. Firmansyah, D. Moussallem, and A.-C. Ngonga Ngomo, “IndQNER: Named Entity Recognition Benchmark Dataset from the Indonesian Translation of the Quran,” in Natural Language Processing and Information Systems, Cham: Springer Nature Switzerland, 2023.' mla: 'Gusmita, Ria Hari, et al. “IndQNER: Named Entity Recognition Benchmark Dataset from the Indonesian Translation of the Quran.” Natural Language Processing and Information Systems, Springer Nature Switzerland, 2023, doi:10.1007/978-3-031-35320-8_12.' short: 'R.H. Gusmita, A.F. Firmansyah, D. Moussallem, A.-C. Ngonga Ngomo, in: Natural Language Processing and Information Systems, Springer Nature Switzerland, Cham, 2023.' conference: end_date: 2023-06-23 location: Derby, UK name: International Conference on Applications of Natural Language to Information Systems (NLDB) 2023 start_date: 2023-06-21 date_created: 2023-08-17T12:41:45Z date_updated: 2023-08-17T12:52:03Z department: - _id: '574' doi: 10.1007/978-3-031-35320-8_12 language: - iso: eng place: Cham publication: Natural Language Processing and Information Systems publication_identifier: isbn: - '9783031353192' - '9783031353208' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Nature Switzerland status: public title: 'IndQNER: Named Entity Recognition Benchmark Dataset from the Indonesian Translation of the Quran' type: book_chapter user_id: '76787' year: '2023' ... --- _id: '46867' author: - first_name: Peter full_name: Dieter, Peter id: '88592' last_name: Dieter citation: ama: 'Dieter P. A Regret Policy for the Dynamic Vehicle Routing Problem with Time Windows. In: Lecture Notes in Computer Science. Springer Nature Switzerland; 2023. doi:10.1007/978-3-031-43612-3_14' apa: Dieter, P. (2023). A Regret Policy for the Dynamic Vehicle Routing Problem with Time Windows. In Lecture Notes in Computer Science. Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-43612-3_14 bibtex: '@inbook{Dieter_2023, place={Cham}, title={A Regret Policy for the Dynamic Vehicle Routing Problem with Time Windows}, DOI={10.1007/978-3-031-43612-3_14}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Dieter, Peter}, year={2023} }' chicago: 'Dieter, Peter. “A Regret Policy for the Dynamic Vehicle Routing Problem with Time Windows.” In Lecture Notes in Computer Science. Cham: Springer Nature Switzerland, 2023. https://doi.org/10.1007/978-3-031-43612-3_14.' ieee: 'P. Dieter, “A Regret Policy for the Dynamic Vehicle Routing Problem with Time Windows,” in Lecture Notes in Computer Science, Cham: Springer Nature Switzerland, 2023.' mla: Dieter, Peter. “A Regret Policy for the Dynamic Vehicle Routing Problem with Time Windows.” Lecture Notes in Computer Science, Springer Nature Switzerland, 2023, doi:10.1007/978-3-031-43612-3_14. short: 'P. Dieter, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2023.' date_created: 2023-09-07T17:46:08Z date_updated: 2023-09-07T17:52:46Z ddc: - '000' department: - _id: '277' doi: 10.1007/978-3-031-43612-3_14 has_accepted_license: '1' language: - iso: eng place: Cham publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783031436116' - '9783031436123' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Nature Switzerland status: public title: A Regret Policy for the Dynamic Vehicle Routing Problem with Time Windows type: book_chapter user_id: '51811' year: '2023' ... --- _id: '47421' abstract: - lang: eng text: Class expression learning in description logics has long been regarded as an iterative search problem in an infinite conceptual space. Each iteration of the search process invokes a reasoner and a heuristic function. The reasoner finds the instances of the current expression, and the heuristic function computes the information gain and decides on the next step to be taken. As the size of the background knowledge base grows, search-based approaches for class expression learning become prohibitively slow. Current neural class expression synthesis (NCES) approaches investigate the use of neural networks for class expression learning in the attributive language with complement (ALC). While they show significant improvements over search-based approaches in runtime and quality of the computed solutions, they rely on the availability of pretrained embeddings for the input knowledge base. Moreover, they are not applicable to ontologies in more expressive description logics. In this paper, we propose a novel NCES approach which extends the state of the art to the description logic ALCHIQ(D). Our extension, dubbed NCES2, comes with an improved training data generator and does not require pretrained embeddings for the input knowledge base as both the embedding model and the class expression synthesizer are trained jointly. Empirical results on benchmark datasets suggest that our approach inherits the scalability capability of current NCES instances with the additional advantage that it supports more complex learning problems. NCES2 achieves the highest performance overall when compared to search-based approaches and to its predecessor NCES. We provide our source code, datasets, and pretrained models at https://github.com/dice-group/NCES2. author: - first_name: N'Dah Jean full_name: Kouagou, N'Dah Jean id: '87189' last_name: Kouagou - first_name: Stefan full_name: Heindorf, Stefan id: '11871' last_name: Heindorf orcid: 0000-0002-4525-6865 - 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 citation: ama: 'Kouagou NJ, Heindorf S, Demir C, Ngonga Ngomo A-C. Neural Class Expression Synthesis in ALCHIQ(D). In: Machine Learning and Knowledge Discovery in Databases: Research Track. Springer Nature Switzerland; 2023. doi:10.1007/978-3-031-43421-1_12' apa: 'Kouagou, N. J., Heindorf, S., Demir, C., & Ngonga Ngomo, A.-C. (2023). Neural Class Expression Synthesis in ALCHIQ(D). In Machine Learning and Knowledge Discovery in Databases: Research Track. European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Turin. Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-43421-1_12' bibtex: '@inbook{Kouagou_Heindorf_Demir_Ngonga Ngomo_2023, place={Cham}, title={Neural Class Expression Synthesis in ALCHIQ(D)}, DOI={10.1007/978-3-031-43421-1_12}, booktitle={Machine Learning and Knowledge Discovery in Databases: Research Track}, publisher={Springer Nature Switzerland}, author={Kouagou, N’Dah Jean and Heindorf, Stefan and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}, year={2023} }' chicago: 'Kouagou, N’Dah Jean, Stefan Heindorf, Caglar Demir, and Axel-Cyrille Ngonga Ngomo. “Neural Class Expression Synthesis in ALCHIQ(D).” In Machine Learning and Knowledge Discovery in Databases: Research Track. Cham: Springer Nature Switzerland, 2023. https://doi.org/10.1007/978-3-031-43421-1_12.' ieee: 'N. J. Kouagou, S. Heindorf, C. Demir, and A.-C. Ngonga Ngomo, “Neural Class Expression Synthesis in ALCHIQ(D),” in Machine Learning and Knowledge Discovery in Databases: Research Track, Cham: Springer Nature Switzerland, 2023.' mla: 'Kouagou, N’Dah Jean, et al. “Neural Class Expression Synthesis in ALCHIQ(D).” Machine Learning and Knowledge Discovery in Databases: Research Track, Springer Nature Switzerland, 2023, doi:10.1007/978-3-031-43421-1_12.' short: 'N.J. Kouagou, S. Heindorf, C. Demir, A.-C. Ngonga Ngomo, in: Machine Learning and Knowledge Discovery in Databases: Research Track, Springer Nature Switzerland, Cham, 2023.' conference: end_date: 2023-09-22 location: Turin name: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases start_date: 2023-09-18 date_created: 2023-09-25T13:42:01Z date_updated: 2023-11-21T09:20:31Z department: - _id: '760' - _id: '574' doi: 10.1007/978-3-031-43421-1_12 language: - iso: eng place: Cham publication: 'Machine Learning and Knowledge Discovery in Databases: Research Track' publication_identifier: isbn: - '9783031434204' - '9783031434211' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Nature Switzerland status: public title: Neural Class Expression Synthesis in ALCHIQ(D) type: book_chapter user_id: '11871' year: '2023' ... --- _id: '47953' author: - first_name: Jaroslaw full_name: Kornowicz, Jaroslaw id: '44029' last_name: Kornowicz - first_name: Kirsten full_name: Thommes, Kirsten id: '72497' last_name: Thommes citation: ama: Kornowicz J, Thommes K. Aggregating Human Domain Knowledge for Feature Ranking. Artificial Intelligence in HCI. Published online 2023. doi:10.1007/978-3-031-35891-3_7 apa: Kornowicz, J., & Thommes, K. (2023). Aggregating Human Domain Knowledge for Feature Ranking. Artificial Intelligence in HCI. https://doi.org/10.1007/978-3-031-35891-3_7 bibtex: '@article{Kornowicz_Thommes_2023, title={Aggregating Human Domain Knowledge for Feature Ranking}, DOI={10.1007/978-3-031-35891-3_7}, journal={Artificial Intelligence in HCI}, publisher={Springer Nature Switzerland}, author={Kornowicz, Jaroslaw and Thommes, Kirsten}, year={2023} }' chicago: Kornowicz, Jaroslaw, and Kirsten Thommes. “Aggregating Human Domain Knowledge for Feature Ranking.” Artificial Intelligence in HCI, 2023. https://doi.org/10.1007/978-3-031-35891-3_7. ieee: 'J. Kornowicz and K. Thommes, “Aggregating Human Domain Knowledge for Feature Ranking,” Artificial Intelligence in HCI, 2023, doi: 10.1007/978-3-031-35891-3_7.' mla: Kornowicz, Jaroslaw, and Kirsten Thommes. “Aggregating Human Domain Knowledge for Feature Ranking.” Artificial Intelligence in HCI, Springer Nature Switzerland, 2023, doi:10.1007/978-3-031-35891-3_7. short: J. Kornowicz, K. Thommes, Artificial Intelligence in HCI (2023). date_created: 2023-10-11T08:01:00Z date_updated: 2023-12-05T10:15:37Z department: - _id: '184' - _id: '178' doi: 10.1007/978-3-031-35891-3_7 language: - iso: eng project: - _id: '125' name: 'TRR 318 - C2: TRR 318 - Subproject C2' publication: Artificial Intelligence in HCI publication_identifier: isbn: - '9783031358906' - '9783031358913' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Nature Switzerland status: public title: Aggregating Human Domain Knowledge for Feature Ranking type: journal_article user_id: '42933' year: '2023' ... --- _id: '50479' abstract: - lang: eng text: Verifying assertions is an essential part of creating and maintaining knowledge graphs. Most often, this task cannot be carried out manually due to the sheer size of modern knowledge graphs. Hence, automatic fact-checking approaches have been proposed over the last decade. These approaches aim to compute automatically whether a given assertion is correct or incorrect. However, most fact-checking approaches are binary classifiers that fail to consider the volatility of some assertions, i.e., the fact that such assertions are only valid at certain times or for specific time intervals. Moreover, the few approaches able to predict when an assertion was valid (i.e., time-point prediction approaches) rely on manual feature engineering. This paper presents TEMPORALFC, a temporal fact-checking approach that uses multiple sources of background knowledge to assess the veracity and temporal validity of a given assertion. We evaluate TEMPORALFC on two datasets and compare it to the state of the art in fact-checking and time-point prediction. Our results suggest that TEMPORALFC outperforms the state of the art on the fact-checking task by 0.13 to 0.15 in terms of Area Under the Receiver Operating Characteristic curve and on the time-point prediction task by 0.25 to 0.27 in terms of Mean Reciprocal Rank. Our code is open-source and can be found at https://github.com/dice-group/TemporalFC. author: - first_name: Umair full_name: Qudus, Umair last_name: Qudus - first_name: Michael full_name: Röder, Michael last_name: Röder - first_name: Sabrina full_name: Kirrane, Sabrina last_name: Kirrane - first_name: Axel-Cyrille Ngonga full_name: Ngomo, Axel-Cyrille Ngonga last_name: Ngomo citation: ama: 'Qudus U, Röder M, Kirrane S, Ngomo A-CN. TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs. In: R. Payne T, Presutti V, Qi G, et al., eds. The Semantic Web – ISWC 2023. Vol 14265. Lecture Notes in Computer Science. Springer, Cham; 2023:465–483. doi:10.1007/978-3-031-47240-4_25' apa: 'Qudus, U., Röder, M., Kirrane, S., & Ngomo, A.-C. N. (2023). TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs. In T. R. Payne, V. Presutti, G. Qi, M. Poveda-Villalón, G. Stoilos, L. Hollink, Z. Kaoudi, G. Cheng, & J. Li (Eds.), The Semantic Web – ISWC 2023 (Vol. 14265, pp. 465–483). Springer, Cham. https://doi.org/10.1007/978-3-031-47240-4_25' bibtex: '@inproceedings{Qudus_Röder_Kirrane_Ngomo_2023, place={Cham}, series={ Lecture Notes in Computer Science}, title={TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs}, volume={14265}, DOI={10.1007/978-3-031-47240-4_25}, booktitle={The Semantic Web – ISWC 2023}, publisher={Springer, Cham}, author={Qudus, Umair and Röder, Michael and Kirrane, Sabrina and Ngomo, Axel-Cyrille Ngonga}, editor={R. Payne, Terry and Presutti, Valentina and Qi, Guilin and Poveda-Villalón, María and Stoilos, Giorgos and Hollink, Laura and Kaoudi, Zoi and Cheng, Gong and Li, Juanzi}, year={2023}, pages={465–483}, collection={ Lecture Notes in Computer Science} }' chicago: 'Qudus, Umair, Michael Röder, Sabrina Kirrane, and Axel-Cyrille Ngonga Ngomo. “TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs.” In The Semantic Web – ISWC 2023, edited by Terry R. Payne, Valentina Presutti, Guilin Qi, María Poveda-Villalón, Giorgos Stoilos, Laura Hollink, Zoi Kaoudi, Gong Cheng, and Juanzi Li, 14265:465–483. Lecture Notes in Computer Science. Cham: Springer, Cham, 2023. https://doi.org/10.1007/978-3-031-47240-4_25.' ieee: 'U. Qudus, M. Röder, S. Kirrane, and A.-C. N. Ngomo, “TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs,” in The Semantic Web – ISWC 2023, Athens, Greece, 2023, vol. 14265, pp. 465–483, doi: 10.1007/978-3-031-47240-4_25.' mla: 'Qudus, Umair, et al. “TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs.” The Semantic Web – ISWC 2023, edited by Terry R. Payne et al., vol. 14265, Springer, Cham, 2023, pp. 465–483, doi:10.1007/978-3-031-47240-4_25.' short: 'U. Qudus, M. Röder, S. Kirrane, A.-C.N. Ngomo, in: T. R. Payne, V. Presutti, G. Qi, M. Poveda-Villalón, G. Stoilos, L. Hollink, Z. Kaoudi, G. Cheng, J. Li (Eds.), The Semantic Web – ISWC 2023, Springer, Cham, Cham, 2023, pp. 465–483.' conference: end_date: 2023-11-10 location: Athens, Greece name: The Semantic Web – ISWC 2023 start_date: 2023-11-06 date_created: 2024-01-13T11:22:15Z date_updated: 2024-01-13T11:48:28Z ddc: - '006' department: - _id: '34' doi: 10.1007/978-3-031-47240-4_25 editor: - first_name: Terry full_name: R. Payne, Terry last_name: R. Payne - first_name: Valentina full_name: Presutti, Valentina last_name: Presutti - first_name: Guilin full_name: Qi, Guilin last_name: Qi - first_name: María full_name: Poveda-Villalón, María last_name: Poveda-Villalón - first_name: Giorgos full_name: Stoilos, Giorgos last_name: Stoilos - first_name: Laura full_name: Hollink, Laura last_name: Hollink - first_name: Zoi full_name: Kaoudi, Zoi last_name: Kaoudi - first_name: Gong full_name: Cheng, Gong last_name: Cheng - first_name: Juanzi full_name: Li, Juanzi last_name: Li file: - access_level: closed content_type: application/pdf creator: uqudus date_created: 2024-01-13T11:25:48Z date_updated: 2024-01-13T11:25:48Z file_id: '50480' file_name: ISWC 2023 TemporalFC-A Temporal Fact Checking approach over Knowledge Graphs.pdf file_size: 1944818 relation: main_file success: 1 file_date_updated: 2024-01-13T11:25:48Z has_accepted_license: '1' intvolume: ' 14265' jel: - C keyword: - temporal fact checking · ensemble learning · transfer learning · time-point prediction · temporal knowledge graphs language: - iso: eng page: 465–483 place: Cham project: - _id: '410' grant_number: '860801' name: 'KnowGraphs: KnowGraphs: Knowledge Graphs at Scale' publication: The Semantic Web – ISWC 2023 publication_identifier: isbn: - '9783031472398' - '9783031472404' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer, Cham series_title: ' Lecture Notes in Computer Science' status: public title: 'TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs' type: conference user_id: '83392' volume: 14265 year: '2023' ... --- _id: '46191' author: - first_name: Christoph full_name: Alt, Christoph id: '100625' last_name: Alt - first_name: Tobias full_name: Kenter, Tobias id: '3145' last_name: Kenter - first_name: Sara full_name: Faghih-Naini, Sara last_name: Faghih-Naini - first_name: Jennifer full_name: Faj, Jennifer id: '78722' last_name: Faj - first_name: Jan-Oliver full_name: Opdenhövel, Jan-Oliver last_name: Opdenhövel - first_name: Christian full_name: Plessl, Christian id: '16153' last_name: Plessl orcid: 0000-0001-5728-9982 - first_name: Vadym full_name: Aizinger, Vadym last_name: Aizinger - first_name: Jan full_name: Hönig, Jan last_name: Hönig - first_name: Harald full_name: Köstler, Harald last_name: Köstler citation: ama: 'Alt C, Kenter T, Faghih-Naini S, et al. Shallow Water DG Simulations on FPGAs: Design and Comparison of a Novel Code Generation Pipeline. In: Lecture Notes in Computer Science. Springer Nature Switzerland; 2023. doi:10.1007/978-3-031-32041-5_5' apa: 'Alt, C., Kenter, T., Faghih-Naini, S., Faj, J., Opdenhövel, J.-O., Plessl, C., Aizinger, V., Hönig, J., & Köstler, H. (2023). Shallow Water DG Simulations on FPGAs: Design and Comparison of a Novel Code Generation Pipeline. In Lecture Notes in Computer Science. Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-32041-5_5' bibtex: '@inbook{Alt_Kenter_Faghih-Naini_Faj_Opdenhövel_Plessl_Aizinger_Hönig_Köstler_2023, place={Cham}, title={Shallow Water DG Simulations on FPGAs: Design and Comparison of a Novel Code Generation Pipeline}, DOI={10.1007/978-3-031-32041-5_5}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Alt, Christoph and Kenter, Tobias and Faghih-Naini, Sara and Faj, Jennifer and Opdenhövel, Jan-Oliver and Plessl, Christian and Aizinger, Vadym and Hönig, Jan and Köstler, Harald}, year={2023} }' chicago: 'Alt, Christoph, Tobias Kenter, Sara Faghih-Naini, Jennifer Faj, Jan-Oliver Opdenhövel, Christian Plessl, Vadym Aizinger, Jan Hönig, and Harald Köstler. “Shallow Water DG Simulations on FPGAs: Design and Comparison of a Novel Code Generation Pipeline.” In Lecture Notes in Computer Science. Cham: Springer Nature Switzerland, 2023. https://doi.org/10.1007/978-3-031-32041-5_5.' ieee: 'C. Alt et al., “Shallow Water DG Simulations on FPGAs: Design and Comparison of a Novel Code Generation Pipeline,” in Lecture Notes in Computer Science, Cham: Springer Nature Switzerland, 2023.' mla: 'Alt, Christoph, et al. “Shallow Water DG Simulations on FPGAs: Design and Comparison of a Novel Code Generation Pipeline.” Lecture Notes in Computer Science, Springer Nature Switzerland, 2023, doi:10.1007/978-3-031-32041-5_5.' short: 'C. Alt, T. Kenter, S. Faghih-Naini, J. Faj, J.-O. Opdenhövel, C. Plessl, V. Aizinger, J. Hönig, H. Köstler, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2023.' date_created: 2023-07-28T09:53:21Z date_updated: 2024-01-22T09:58:49Z department: - _id: '27' - _id: '518' doi: 10.1007/978-3-031-32041-5_5 language: - iso: eng place: Cham project: - _id: '52' name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing' publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783031320408' - '9783031320415' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Nature Switzerland quality_controlled: '1' status: public title: 'Shallow Water DG Simulations on FPGAs: Design and Comparison of a Novel Code Generation Pipeline' type: book_chapter user_id: '3145' year: '2023' ... --- _id: '51373' author: - first_name: Jonas Manuel full_name: Hanselle, Jonas Manuel id: '43980' last_name: Hanselle orcid: 0000-0002-1231-4985 - first_name: Johannes full_name: Fürnkranz, Johannes last_name: Fürnkranz - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Hanselle JM, Fürnkranz J, Hüllermeier E. Probabilistic Scoring Lists for Interpretable Machine Learning. In: 26th International Conference on Discovery Science . Vol 14050. Lecture Notes in Computer Science. Springer Nature Switzerland; 2023:189-203. doi:10.1007/978-3-031-45275-8_13' apa: Hanselle, J. M., Fürnkranz, J., & Hüllermeier, E. (2023). Probabilistic Scoring Lists for Interpretable Machine Learning. 26th International Conference on Discovery Science , 14050, 189–203. https://doi.org/10.1007/978-3-031-45275-8_13 bibtex: '@inproceedings{Hanselle_Fürnkranz_Hüllermeier_2023, place={Cham}, series={Lecture Notes in Computer Science}, title={Probabilistic Scoring Lists for Interpretable Machine Learning}, volume={14050}, DOI={10.1007/978-3-031-45275-8_13}, booktitle={26th International Conference on Discovery Science }, publisher={Springer Nature Switzerland}, author={Hanselle, Jonas Manuel and Fürnkranz, Johannes and Hüllermeier, Eyke}, year={2023}, pages={189–203}, collection={Lecture Notes in Computer Science} }' chicago: 'Hanselle, Jonas Manuel, Johannes Fürnkranz, and Eyke Hüllermeier. “Probabilistic Scoring Lists for Interpretable Machine Learning.” In 26th International Conference on Discovery Science , 14050:189–203. Lecture Notes in Computer Science. Cham: Springer Nature Switzerland, 2023. https://doi.org/10.1007/978-3-031-45275-8_13.' ieee: 'J. M. Hanselle, J. Fürnkranz, and E. Hüllermeier, “Probabilistic Scoring Lists for Interpretable Machine Learning,” in 26th International Conference on Discovery Science , Porto, 2023, vol. 14050, pp. 189–203, doi: 10.1007/978-3-031-45275-8_13.' mla: Hanselle, Jonas Manuel, et al. “Probabilistic Scoring Lists for Interpretable Machine Learning.” 26th International Conference on Discovery Science , vol. 14050, Springer Nature Switzerland, 2023, pp. 189–203, doi:10.1007/978-3-031-45275-8_13. short: 'J.M. Hanselle, J. Fürnkranz, E. Hüllermeier, in: 26th International Conference on Discovery Science , Springer Nature Switzerland, Cham, 2023, pp. 189–203.' conference: end_date: 2021-10-11 location: Porto name: '26th International Conference on Discovery Science ' start_date: 2023-10-9 date_created: 2024-02-18T11:05:55Z date_updated: 2024-02-26T08:41:49Z doi: 10.1007/978-3-031-45275-8_13 intvolume: ' 14050' language: - iso: eng page: 189-203 place: Cham publication: '26th International Conference on Discovery Science ' publication_identifier: isbn: - '9783031452741' - '9783031452758' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Nature Switzerland series_title: Lecture Notes in Computer Science status: public title: Probabilistic Scoring Lists for Interpretable Machine Learning type: conference user_id: '54779' volume: 14050 year: '2023' ... --- _id: '48776' author: - first_name: Maximilian full_name: Muschalik, Maximilian last_name: Muschalik - first_name: Fabian full_name: Fumagalli, Fabian id: '93420' last_name: Fumagalli - first_name: Barbara full_name: Hammer, Barbara last_name: Hammer - first_name: Eyke full_name: Huellermeier, Eyke id: '48129' last_name: Huellermeier citation: ama: 'Muschalik M, Fumagalli F, Hammer B, Huellermeier E. iSAGE: An Incremental Version of SAGE for Online Explanation on Data Streams. In: Machine Learning and Knowledge Discovery in Databases: Research Track. Springer Nature Switzerland; 2023. doi:10.1007/978-3-031-43418-1_26' apa: 'Muschalik, M., Fumagalli, F., Hammer, B., & Huellermeier, E. (2023). iSAGE: An Incremental Version of SAGE for Online Explanation on Data Streams. In Machine Learning and Knowledge Discovery in Databases: Research Track. Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-43418-1_26' bibtex: '@inbook{Muschalik_Fumagalli_Hammer_Huellermeier_2023, place={Cham}, title={iSAGE: An Incremental Version of SAGE for Online Explanation on Data Streams}, DOI={10.1007/978-3-031-43418-1_26}, booktitle={Machine Learning and Knowledge Discovery in Databases: Research Track}, publisher={Springer Nature Switzerland}, author={Muschalik, Maximilian and Fumagalli, Fabian and Hammer, Barbara and Huellermeier, Eyke}, year={2023} }' chicago: 'Muschalik, Maximilian, Fabian Fumagalli, Barbara Hammer, and Eyke Huellermeier. “ISAGE: An Incremental Version of SAGE for Online Explanation on Data Streams.” In Machine Learning and Knowledge Discovery in Databases: Research Track. Cham: Springer Nature Switzerland, 2023. https://doi.org/10.1007/978-3-031-43418-1_26.' ieee: 'M. Muschalik, F. Fumagalli, B. Hammer, and E. Huellermeier, “iSAGE: An Incremental Version of SAGE for Online Explanation on Data Streams,” in Machine Learning and Knowledge Discovery in Databases: Research Track, Cham: Springer Nature Switzerland, 2023.' mla: 'Muschalik, Maximilian, et al. “ISAGE: An Incremental Version of SAGE for Online Explanation on Data Streams.” Machine Learning and Knowledge Discovery in Databases: Research Track, Springer Nature Switzerland, 2023, doi:10.1007/978-3-031-43418-1_26.' short: 'M. Muschalik, F. Fumagalli, B. Hammer, E. Huellermeier, in: Machine Learning and Knowledge Discovery in Databases: Research Track, Springer Nature Switzerland, Cham, 2023.' date_created: 2023-11-10T14:11:20Z date_updated: 2024-03-05T10:48:40Z department: - _id: '660' doi: 10.1007/978-3-031-43418-1_26 language: - iso: eng place: Cham project: - _id: '126' name: 'TRR 318 - C3: TRR 318 - Subproject C3' publication: 'Machine Learning and Knowledge Discovery in Databases: Research Track' publication_identifier: eisbn: - '9783031434181' eissn: - 1611-3349 isbn: - '9783031434174' issn: - 0302-9743 publication_status: published publisher: Springer Nature Switzerland status: public title: 'iSAGE: An Incremental Version of SAGE for Online Explanation on Data Streams' type: book_chapter user_id: '14931' year: '2023' ... --- _id: '52859' author: - first_name: Igor full_name: de Camargo e Souza Câmara, Igor last_name: de Camargo e Souza Câmara - first_name: Anni-Yasmin full_name: Turhan, Anni-Yasmin id: '104470' last_name: Turhan citation: ama: 'de Camargo e Souza Câmara I, Turhan A-Y. Deciding Subsumption in Defeasible $$\mathcal {ELI}_\bot $$ with Typicality Models. In: Logics in Artificial Intelligence. Springer Nature Switzerland; 2023. doi:10.1007/978-3-031-43619-2_36' apa: de Camargo e Souza Câmara, I., & Turhan, A.-Y. (2023). Deciding Subsumption in Defeasible $$\mathcal {ELI}_\bot $$ with Typicality Models. In Logics in Artificial Intelligence. Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-43619-2_36 bibtex: '@inbook{de Camargo e Souza Câmara_Turhan_2023, place={Cham}, title={Deciding Subsumption in Defeasible $$\mathcal {ELI}_\bot $$ with Typicality Models}, DOI={10.1007/978-3-031-43619-2_36}, booktitle={Logics in Artificial Intelligence}, publisher={Springer Nature Switzerland}, author={de Camargo e Souza Câmara, Igor and Turhan, Anni-Yasmin}, year={2023} }' chicago: 'Camargo e Souza Câmara, Igor de, and Anni-Yasmin Turhan. “Deciding Subsumption in Defeasible $$\mathcal {ELI}_\bot $$ with Typicality Models.” In Logics in Artificial Intelligence. Cham: Springer Nature Switzerland, 2023. https://doi.org/10.1007/978-3-031-43619-2_36.' ieee: 'I. de Camargo e Souza Câmara and A.-Y. Turhan, “Deciding Subsumption in Defeasible $$\mathcal {ELI}_\bot $$ with Typicality Models,” in Logics in Artificial Intelligence, Cham: Springer Nature Switzerland, 2023.' mla: de Camargo e Souza Câmara, Igor, and Anni-Yasmin Turhan. “Deciding Subsumption in Defeasible $$\mathcal {ELI}_\bot $$ with Typicality Models.” Logics in Artificial Intelligence, Springer Nature Switzerland, 2023, doi:10.1007/978-3-031-43619-2_36. short: 'I. de Camargo e Souza Câmara, A.-Y. Turhan, in: Logics in Artificial Intelligence, Springer Nature Switzerland, Cham, 2023.' date_created: 2024-03-25T13:56:30Z date_updated: 2024-03-25T13:59:43Z department: - _id: '888' doi: 10.1007/978-3-031-43619-2_36 language: - iso: eng place: Cham publication: Logics in Artificial Intelligence publication_identifier: isbn: - '9783031436185' - '9783031436192' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Nature Switzerland status: public title: Deciding Subsumption in Defeasible $$\mathcal {ELI}_\bot $$ with Typicality Models type: book_chapter user_id: '9503' year: '2023' ... --- _id: '30971' author: - first_name: Tim full_name: Hansmeier, Tim id: '49992' last_name: Hansmeier orcid: 0000-0003-1377-3339 - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: ama: 'Hansmeier T, Platzner M. Integrating Safety Guarantees into the Learning Classifier System XCS. In: Applications of Evolutionary Computation, EvoApplications 2022, Proceedings. Vol 13224. Lecture Notes in Computer Science. Springer International Publishing; 2022:386-401. doi:10.1007/978-3-031-02462-7_25' apa: Hansmeier, T., & Platzner, M. (2022). Integrating Safety Guarantees into the Learning Classifier System XCS. Applications of Evolutionary Computation, EvoApplications 2022, Proceedings, 13224, 386–401. https://doi.org/10.1007/978-3-031-02462-7_25 bibtex: '@inproceedings{Hansmeier_Platzner_2022, series={Lecture Notes in Computer Science}, title={Integrating Safety Guarantees into the Learning Classifier System XCS}, volume={13224}, DOI={10.1007/978-3-031-02462-7_25}, booktitle={Applications of Evolutionary Computation, EvoApplications 2022, Proceedings}, publisher={Springer International Publishing}, author={Hansmeier, Tim and Platzner, Marco}, year={2022}, pages={386–401}, collection={Lecture Notes in Computer Science} }' chicago: Hansmeier, Tim, and Marco Platzner. “Integrating Safety Guarantees into the Learning Classifier System XCS.” In Applications of Evolutionary Computation, EvoApplications 2022, Proceedings, 13224:386–401. Lecture Notes in Computer Science. Springer International Publishing, 2022. https://doi.org/10.1007/978-3-031-02462-7_25. ieee: 'T. Hansmeier and M. Platzner, “Integrating Safety Guarantees into the Learning Classifier System XCS,” in Applications of Evolutionary Computation, EvoApplications 2022, Proceedings, Madrid, 2022, vol. 13224, pp. 386–401, doi: 10.1007/978-3-031-02462-7_25.' mla: Hansmeier, Tim, and Marco Platzner. “Integrating Safety Guarantees into the Learning Classifier System XCS.” Applications of Evolutionary Computation, EvoApplications 2022, Proceedings, vol. 13224, Springer International Publishing, 2022, pp. 386–401, doi:10.1007/978-3-031-02462-7_25. short: 'T. Hansmeier, M. Platzner, in: Applications of Evolutionary Computation, EvoApplications 2022, Proceedings, Springer International Publishing, 2022, pp. 386–401.' conference: end_date: 2022-04-22 location: Madrid name: 25th International Conference on Applications of Evolutionary Computation, EvoApplications 2022 start_date: 2022-04-20 date_created: 2022-04-28T09:42:33Z date_updated: 2022-04-28T10:24:18Z department: - _id: '78' doi: 10.1007/978-3-031-02462-7_25 intvolume: ' 13224' language: - iso: eng page: 386-401 project: - _id: '4' name: 'SFB 901 - C: SFB 901 - Project Area C' - _id: '14' name: 'SFB 901 - C2: SFB 901 - Subproject C2' - _id: '1' name: 'SFB 901: SFB 901' publication: Applications of Evolutionary Computation, EvoApplications 2022, Proceedings publication_identifier: isbn: - '9783031024610' - '9783031024627' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing series_title: Lecture Notes in Computer Science status: public title: Integrating Safety Guarantees into the Learning Classifier System XCS type: conference user_id: '49992' volume: 13224 year: '2022' ... --- _id: '34077' alternative_title: - Extended Abstract author: - first_name: Alexander full_name: Bondarenko, Alexander last_name: Bondarenko - first_name: Maik full_name: Fröbe, Maik last_name: Fröbe - first_name: Johannes full_name: Kiesel, Johannes last_name: Kiesel - first_name: Shahbaz full_name: Syed, Shahbaz last_name: Syed - first_name: Timon full_name: Gurcke, Timon last_name: Gurcke - first_name: Meriem full_name: Beloucif, Meriem last_name: Beloucif - first_name: Alexander full_name: Panchenko, Alexander last_name: Panchenko - first_name: Chris full_name: Biemann, Chris last_name: Biemann - first_name: Benno full_name: Stein, Benno last_name: Stein - first_name: Henning full_name: Wachsmuth, Henning last_name: Wachsmuth - first_name: Martin full_name: Potthast, Martin last_name: Potthast - first_name: Matthias full_name: Hagen, Matthias last_name: Hagen citation: ama: 'Bondarenko A, Fröbe M, Kiesel J, et al. Overview of Touché 2022: Argument Retrieval. In: Lecture Notes in Computer Science. Springer International Publishing; 2022. doi:10.1007/978-3-030-99739-7_43' apa: 'Bondarenko, A., Fröbe, M., Kiesel, J., Syed, S., Gurcke, T., Beloucif, M., Panchenko, A., Biemann, C., Stein, B., Wachsmuth, H., Potthast, M., & Hagen, M. (2022). Overview of Touché 2022: Argument Retrieval. In Lecture Notes in Computer Science. Springer International Publishing. https://doi.org/10.1007/978-3-030-99739-7_43' bibtex: '@inbook{Bondarenko_Fröbe_Kiesel_Syed_Gurcke_Beloucif_Panchenko_Biemann_Stein_Wachsmuth_et al._2022, place={Cham}, title={Overview of Touché 2022: Argument Retrieval}, DOI={10.1007/978-3-030-99739-7_43}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Bondarenko, Alexander and Fröbe, Maik and Kiesel, Johannes and Syed, Shahbaz and Gurcke, Timon and Beloucif, Meriem and Panchenko, Alexander and Biemann, Chris and Stein, Benno and Wachsmuth, Henning and et al.}, year={2022} }' chicago: 'Bondarenko, Alexander, Maik Fröbe, Johannes Kiesel, Shahbaz Syed, Timon Gurcke, Meriem Beloucif, Alexander Panchenko, et al. “Overview of Touché 2022: Argument Retrieval.” In Lecture Notes in Computer Science. Cham: Springer International Publishing, 2022. https://doi.org/10.1007/978-3-030-99739-7_43.' ieee: 'A. Bondarenko et al., “Overview of Touché 2022: Argument Retrieval,” in Lecture Notes in Computer Science, Cham: Springer International Publishing, 2022.' mla: 'Bondarenko, Alexander, et al. “Overview of Touché 2022: Argument Retrieval.” Lecture Notes in Computer Science, Springer International Publishing, 2022, doi:10.1007/978-3-030-99739-7_43.' short: 'A. Bondarenko, M. Fröbe, J. Kiesel, S. Syed, T. Gurcke, M. Beloucif, A. Panchenko, C. Biemann, B. Stein, H. Wachsmuth, M. Potthast, M. Hagen, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2022.' date_created: 2022-11-14T13:47:51Z date_updated: 2022-11-14T13:48:38Z department: - _id: '600' doi: 10.1007/978-3-030-99739-7_43 place: Cham publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783030997380' - '9783030997397' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: 'Overview of Touché 2022: Argument Retrieval' type: book_chapter user_id: '52174' year: '2022' ... --- _id: '34292' author: - first_name: Dennis full_name: Wolters, Dennis id: '11308' last_name: Wolters - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels citation: ama: 'Wolters D, Engels G. Towards Situational Process Management for Professional Education Programmes. In: Taibi D, Kuhrmann M, Mikkonen T, Klünder J, Abrahamsson P, eds. Product-Focused Software Process Improvement. Vol 13709. Lecture Notes in Computer Science. Springer International Publishing; 2022:235-242. doi:10.1007/978-3-031-21388-5_16' apa: Wolters, D., & Engels, G. (2022). Towards Situational Process Management for Professional Education Programmes. In D. Taibi, M. Kuhrmann, T. Mikkonen, J. Klünder, & P. Abrahamsson (Eds.), Product-Focused Software Process Improvement (Vol. 13709, pp. 235–242). Springer International Publishing. https://doi.org/10.1007/978-3-031-21388-5_16 bibtex: '@inbook{Wolters_Engels_2022, place={Cham}, series={Lecture Notes in Computer Science}, title={Towards Situational Process Management for Professional Education Programmes}, volume={13709}, DOI={10.1007/978-3-031-21388-5_16}, booktitle={Product-Focused Software Process Improvement}, publisher={Springer International Publishing}, author={Wolters, Dennis and Engels, Gregor}, editor={Taibi, Davide and Kuhrmann, Marco and Mikkonen, Tommi and Klünder, Jil and Abrahamsson, Pekka}, year={2022}, pages={235–242}, collection={Lecture Notes in Computer Science} }' chicago: 'Wolters, Dennis, and Gregor Engels. “Towards Situational Process Management for Professional Education Programmes.” In Product-Focused Software Process Improvement, edited by Davide Taibi, Marco Kuhrmann, Tommi Mikkonen, Jil Klünder, and Pekka Abrahamsson, 13709:235–42. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2022. https://doi.org/10.1007/978-3-031-21388-5_16.' ieee: 'D. Wolters and G. Engels, “Towards Situational Process Management for Professional Education Programmes,” in Product-Focused Software Process Improvement, vol. 13709, D. Taibi, M. Kuhrmann, T. Mikkonen, J. Klünder, and P. Abrahamsson, Eds. Cham: Springer International Publishing, 2022, pp. 235–242.' mla: Wolters, Dennis, and Gregor Engels. “Towards Situational Process Management for Professional Education Programmes.” Product-Focused Software Process Improvement, edited by Davide Taibi et al., vol. 13709, Springer International Publishing, 2022, pp. 235–42, doi:10.1007/978-3-031-21388-5_16. short: 'D. Wolters, G. Engels, in: D. Taibi, M. Kuhrmann, T. Mikkonen, J. Klünder, P. Abrahamsson (Eds.), Product-Focused Software Process Improvement, Springer International Publishing, Cham, 2022, pp. 235–242.' date_created: 2022-12-08T19:23:46Z date_updated: 2022-12-17T19:00:40Z department: - _id: '66' doi: 10.1007/978-3-031-21388-5_16 editor: - first_name: Davide full_name: Taibi, Davide last_name: Taibi - first_name: Marco full_name: Kuhrmann, Marco last_name: Kuhrmann - first_name: Tommi full_name: Mikkonen, Tommi last_name: Mikkonen - first_name: Jil full_name: Klünder, Jil last_name: Klünder - first_name: Pekka full_name: Abrahamsson, Pekka last_name: Abrahamsson intvolume: ' 13709' language: - iso: eng page: 235-242 place: Cham publication: Product-Focused Software Process Improvement publication_identifier: isbn: - '9783031213878' - '9783031213885' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing series_title: Lecture Notes in Computer Science status: public title: Towards Situational Process Management for Professional Education Programmes type: book_chapter user_id: '11308' volume: 13709 year: '2022' ... --- _id: '29872' author: - first_name: Marten full_name: Maack, Marten id: '88252' last_name: Maack - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Simon full_name: Pukrop, Simon id: '44428' last_name: Pukrop citation: ama: 'Maack M, Meyer auf der Heide F, Pukrop S. Server Cloud Scheduling. In: Approximation and Online Algorithms. Springer International Publishing; 2022. doi:10.1007/978-3-030-92702-8_10' apa: Maack, M., Meyer auf der Heide, F., & Pukrop, S. (2022). Server Cloud Scheduling. In Approximation and Online Algorithms. Springer International Publishing. https://doi.org/10.1007/978-3-030-92702-8_10 bibtex: '@inbook{Maack_Meyer auf der Heide_Pukrop_2022, place={Cham}, title={Server Cloud Scheduling}, DOI={10.1007/978-3-030-92702-8_10}, booktitle={Approximation and Online Algorithms}, publisher={Springer International Publishing}, author={Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2022} }' chicago: 'Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Server Cloud Scheduling.” In Approximation and Online Algorithms. Cham: Springer International Publishing, 2022. https://doi.org/10.1007/978-3-030-92702-8_10.' ieee: 'M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Server Cloud Scheduling,” in Approximation and Online Algorithms, Cham: Springer International Publishing, 2022.' mla: Maack, Marten, et al. “Server Cloud Scheduling.” Approximation and Online Algorithms, Springer International Publishing, 2022, doi:10.1007/978-3-030-92702-8_10. short: 'M. Maack, F. Meyer auf der Heide, S. Pukrop, in: Approximation and Online Algorithms, Springer International Publishing, Cham, 2022.' date_created: 2022-02-18T09:31:54Z date_updated: 2022-09-27T15:03:13Z department: - _id: '63' doi: 10.1007/978-3-030-92702-8_10 language: - iso: eng place: Cham project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '4' name: 'SFB 901 - C: SFB 901 - Project Area C' - _id: '16' name: 'SFB 901 - C4: SFB 901 - Subproject C4' publication: Approximation and Online Algorithms publication_identifier: isbn: - '9783030927011' - '9783030927028' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: Server Cloud Scheduling type: book_chapter user_id: '44428' year: '2022' ... --- _id: '33740' author: - first_name: N'Dah Jean full_name: KOUAGOU, N'Dah Jean id: '87189' last_name: KOUAGOU - first_name: Stefan full_name: Heindorf, Stefan id: '11871' last_name: Heindorf orcid: 0000-0002-4525-6865 - 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 citation: ama: 'KOUAGOU NJ, Heindorf S, Demir C, Ngonga Ngomo A-C. Learning Concept Lengths Accelerates Concept Learning in ALC. In: The Semantic Web. Springer International Publishing; 2022. doi:10.1007/978-3-031-06981-9_14' apa: KOUAGOU, N. J., Heindorf, S., Demir, C., & Ngonga Ngomo, A.-C. (2022). Learning Concept Lengths Accelerates Concept Learning in ALC. In The Semantic Web. Springer International Publishing. https://doi.org/10.1007/978-3-031-06981-9_14 bibtex: '@inbook{KOUAGOU_Heindorf_Demir_Ngonga Ngomo_2022, place={Cham}, title={Learning Concept Lengths Accelerates Concept Learning in ALC}, DOI={10.1007/978-3-031-06981-9_14}, booktitle={The Semantic Web}, publisher={Springer International Publishing}, author={KOUAGOU, N’Dah Jean and Heindorf, Stefan and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}, year={2022} }' chicago: 'KOUAGOU, N’Dah Jean, Stefan Heindorf, Caglar Demir, and Axel-Cyrille Ngonga Ngomo. “Learning Concept Lengths Accelerates Concept Learning in ALC.” In The Semantic Web. Cham: Springer International Publishing, 2022. https://doi.org/10.1007/978-3-031-06981-9_14.' ieee: 'N. J. KOUAGOU, S. Heindorf, C. Demir, and A.-C. Ngonga Ngomo, “Learning Concept Lengths Accelerates Concept Learning in ALC,” in The Semantic Web, Cham: Springer International Publishing, 2022.' mla: KOUAGOU, N’Dah Jean, et al. “Learning Concept Lengths Accelerates Concept Learning in ALC.” The Semantic Web, Springer International Publishing, 2022, doi:10.1007/978-3-031-06981-9_14. short: 'N.J. KOUAGOU, S. Heindorf, C. Demir, A.-C. Ngonga Ngomo, in: The Semantic Web, Springer International Publishing, Cham, 2022.' date_created: 2022-10-15T19:34:41Z date_updated: 2022-10-15T19:52:08Z department: - _id: '574' doi: 10.1007/978-3-031-06981-9_14 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2107.04911 oa: '1' place: Cham publication: The Semantic Web publication_identifier: isbn: - '9783031069802' - '9783031069819' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing related_material: link: - relation: confirmation url: https://link.springer.com/chapter/10.1007/978-3-031-06981-9_14 status: public title: Learning Concept Lengths Accelerates Concept Learning in ALC type: book_chapter user_id: '11871' year: '2022' ... --- _id: '29727' author: - first_name: Meike Claudia full_name: Wohlleben, Meike Claudia id: '43991' last_name: Wohlleben - first_name: Amelie full_name: Bender, Amelie id: '54290' last_name: Bender - first_name: Sebastian full_name: Peitz, Sebastian id: '47427' last_name: Peitz orcid: 0000-0002-3389-793X - first_name: Walter full_name: Sextro, Walter id: '21220' last_name: Sextro citation: ama: 'Wohlleben MC, Bender A, Peitz S, Sextro W. Development of a Hybrid Modeling Methodology for Oscillating Systems with Friction. In: Machine Learning, Optimization, and Data Science. Springer International Publishing; 2022. doi:10.1007/978-3-030-95470-3_8' apa: Wohlleben, M. C., Bender, A., Peitz, S., & Sextro, W. (2022). Development of a Hybrid Modeling Methodology for Oscillating Systems with Friction. In Machine Learning, Optimization, and Data Science. Springer International Publishing. https://doi.org/10.1007/978-3-030-95470-3_8 bibtex: '@inbook{Wohlleben_Bender_Peitz_Sextro_2022, place={Cham}, title={Development of a Hybrid Modeling Methodology for Oscillating Systems with Friction}, DOI={10.1007/978-3-030-95470-3_8}, booktitle={Machine Learning, Optimization, and Data Science}, publisher={Springer International Publishing}, author={Wohlleben, Meike Claudia and Bender, Amelie and Peitz, Sebastian and Sextro, Walter}, year={2022} }' chicago: 'Wohlleben, Meike Claudia, Amelie Bender, Sebastian Peitz, and Walter Sextro. “Development of a Hybrid Modeling Methodology for Oscillating Systems with Friction.” In Machine Learning, Optimization, and Data Science. Cham: Springer International Publishing, 2022. https://doi.org/10.1007/978-3-030-95470-3_8.' ieee: 'M. C. Wohlleben, A. Bender, S. Peitz, and W. Sextro, “Development of a Hybrid Modeling Methodology for Oscillating Systems with Friction,” in Machine Learning, Optimization, and Data Science, Cham: Springer International Publishing, 2022.' mla: Wohlleben, Meike Claudia, et al. “Development of a Hybrid Modeling Methodology for Oscillating Systems with Friction.” Machine Learning, Optimization, and Data Science, Springer International Publishing, 2022, doi:10.1007/978-3-030-95470-3_8. short: 'M.C. Wohlleben, A. Bender, S. Peitz, W. Sextro, in: Machine Learning, Optimization, and Data Science, Springer International Publishing, Cham, 2022.' date_created: 2022-02-03T10:30:23Z date_updated: 2023-04-26T12:10:58Z department: - _id: '151' - _id: '655' doi: 10.1007/978-3-030-95470-3_8 language: - iso: eng main_file_link: - url: https://link.springer.com/content/pdf/10.1007%2F978-3-030-95470-3_8.pdf place: Cham publication: Machine Learning, Optimization, and Data Science publication_identifier: isbn: - '9783030954697' - '9783030954703' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing quality_controlled: '1' status: public title: Development of a Hybrid Modeling Methodology for Oscillating Systems with Friction type: book_chapter user_id: '43991' year: '2022' ... --- _id: '33738' author: - first_name: Hamada Mohamed Abdelsamee full_name: Zahera, Hamada Mohamed Abdelsamee id: '72768' last_name: Zahera orcid: 0000-0003-0215-1278 - first_name: Stefan full_name: Heindorf, Stefan id: '11871' last_name: Heindorf orcid: 0000-0002-4525-6865 - first_name: Stefan full_name: Balke, Stefan last_name: Balke - first_name: Jonas full_name: Haupt, Jonas last_name: Haupt - first_name: Martin full_name: Voigt, Martin last_name: Voigt - first_name: Carolin full_name: Walter, Carolin last_name: Walter - first_name: Fabian full_name: Witter, Fabian last_name: Witter - first_name: Axel-Cyrille full_name: Ngonga Ngomo, Axel-Cyrille id: '65716' last_name: Ngonga Ngomo citation: ama: 'Zahera HMA, Heindorf S, Balke S, et al. Tab2Onto: Unsupervised Semantification with Knowledge Graph Embeddings. In: The Semantic Web: ESWC 2022 Satellite Events. Springer International Publishing; 2022. doi:10.1007/978-3-031-11609-4_9' apa: 'Zahera, H. M. A., Heindorf, S., Balke, S., Haupt, J., Voigt, M., Walter, C., Witter, F., & Ngonga Ngomo, A.-C. (2022). Tab2Onto: Unsupervised Semantification with Knowledge Graph Embeddings. In The Semantic Web: ESWC 2022 Satellite Events. Springer International Publishing. https://doi.org/10.1007/978-3-031-11609-4_9' bibtex: '@inbook{Zahera_Heindorf_Balke_Haupt_Voigt_Walter_Witter_Ngonga Ngomo_2022, place={Cham}, title={Tab2Onto: Unsupervised Semantification with Knowledge Graph Embeddings}, DOI={10.1007/978-3-031-11609-4_9}, booktitle={The Semantic Web: ESWC 2022 Satellite Events}, publisher={Springer International Publishing}, author={Zahera, Hamada Mohamed Abdelsamee and Heindorf, Stefan and Balke, Stefan and Haupt, Jonas and Voigt, Martin and Walter, Carolin and Witter, Fabian and Ngonga Ngomo, Axel-Cyrille}, year={2022} }' chicago: 'Zahera, Hamada Mohamed Abdelsamee, Stefan Heindorf, Stefan Balke, Jonas Haupt, Martin Voigt, Carolin Walter, Fabian Witter, and Axel-Cyrille Ngonga Ngomo. “Tab2Onto: Unsupervised Semantification with Knowledge Graph Embeddings.” In The Semantic Web: ESWC 2022 Satellite Events. Cham: Springer International Publishing, 2022. https://doi.org/10.1007/978-3-031-11609-4_9.' ieee: 'H. M. A. Zahera et al., “Tab2Onto: Unsupervised Semantification with Knowledge Graph Embeddings,” in The Semantic Web: ESWC 2022 Satellite Events, Cham: Springer International Publishing, 2022.' mla: 'Zahera, Hamada Mohamed Abdelsamee, et al. “Tab2Onto: Unsupervised Semantification with Knowledge Graph Embeddings.” The Semantic Web: ESWC 2022 Satellite Events, Springer International Publishing, 2022, doi:10.1007/978-3-031-11609-4_9.' short: 'H.M.A. Zahera, S. Heindorf, S. Balke, J. Haupt, M. Voigt, C. Walter, F. Witter, A.-C. Ngonga Ngomo, in: The Semantic Web: ESWC 2022 Satellite Events, Springer International Publishing, Cham, 2022.' date_created: 2022-10-15T19:25:42Z date_updated: 2023-06-23T09:20:20Z department: - _id: '574' doi: 10.1007/978-3-031-11609-4_9 language: - iso: eng main_file_link: - open_access: '1' url: https://2022.eswc-conferences.org/wp-content/uploads/2022/05/pd_Zahera_et_al_paper_230.pdf oa: '1' place: Cham publication: 'The Semantic Web: ESWC 2022 Satellite Events' publication_identifier: isbn: - '9783031116087' - '9783031116094' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: 'Tab2Onto: Unsupervised Semantification with Knowledge Graph Embeddings' type: book_chapter user_id: '72768' year: '2022' ... --- _id: '38506' author: - first_name: H.M.A full_name: Zahera, H.M.A last_name: Zahera - first_name: Daniel full_name: Vollmers, Daniel last_name: Vollmers - first_name: Mohamed Ahmed full_name: Sherif, Mohamed Ahmed last_name: Sherif - first_name: Axel-Cyrille Ngonga full_name: Ngomo, Axel-Cyrille Ngonga last_name: Ngomo citation: ama: 'Zahera HMA, Vollmers D, Sherif MA, Ngomo A-CN. MultPAX: Keyphrase Extraction Using Language Models and Knowledge Graphs. In: The Semantic Web – ISWC 2022. Springer International Publishing; 2022. doi:10.1007/978-3-031-19433-7_18' apa: 'Zahera, H. M. A., Vollmers, D., Sherif, M. A., & Ngomo, A.-C. N. (2022). MultPAX: Keyphrase Extraction Using Language Models and Knowledge Graphs. In The Semantic Web – ISWC 2022. Springer International Publishing. https://doi.org/10.1007/978-3-031-19433-7_18' bibtex: '@inbook{Zahera_Vollmers_Sherif_Ngomo_2022, place={Cham}, title={MultPAX: Keyphrase Extraction Using Language Models and Knowledge Graphs}, DOI={10.1007/978-3-031-19433-7_18}, booktitle={The Semantic Web – ISWC 2022}, publisher={Springer International Publishing}, author={Zahera, H.M.A and Vollmers, Daniel and Sherif, Mohamed Ahmed and Ngomo, Axel-Cyrille Ngonga}, year={2022} }' chicago: 'Zahera, H.M.A, Daniel Vollmers, Mohamed Ahmed Sherif, and Axel-Cyrille Ngonga Ngomo. “MultPAX: Keyphrase Extraction Using Language Models and Knowledge Graphs.” In The Semantic Web – ISWC 2022. Cham: Springer International Publishing, 2022. https://doi.org/10.1007/978-3-031-19433-7_18.' ieee: 'H. M. A. Zahera, D. Vollmers, M. A. Sherif, and A.-C. N. Ngomo, “MultPAX: Keyphrase Extraction Using Language Models and Knowledge Graphs,” in The Semantic Web – ISWC 2022, Cham: Springer International Publishing, 2022.' mla: 'Zahera, H. M. A., et al. “MultPAX: Keyphrase Extraction Using Language Models and Knowledge Graphs.” The Semantic Web – ISWC 2022, Springer International Publishing, 2022, doi:10.1007/978-3-031-19433-7_18.' short: 'H.M.A. Zahera, D. Vollmers, M.A. Sherif, A.-C.N. Ngomo, in: The Semantic Web – ISWC 2022, Springer International Publishing, Cham, 2022.' date_created: 2023-01-23T19:10:15Z date_updated: 2023-06-23T09:21:49Z doi: 10.1007/978-3-031-19433-7_18 language: - iso: eng place: Cham publication: The Semantic Web – ISWC 2022 publication_identifier: isbn: - '9783031194320' - '9783031194337' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: 'MultPAX: Keyphrase Extraction Using Language Models and Knowledge Graphs' type: book_chapter user_id: '72768' year: '2022' ... --- _id: '29046' author: - first_name: Robert full_name: Feldhans, Robert last_name: Feldhans - first_name: Adrian full_name: Wilke, Adrian last_name: Wilke - first_name: Stefan full_name: Heindorf, Stefan last_name: Heindorf - first_name: Mohammad Hossein full_name: Shaker, Mohammad Hossein last_name: Shaker - first_name: Barbara full_name: Hammer, Barbara last_name: Hammer - first_name: Axel-Cyrille full_name: Ngonga Ngomo, Axel-Cyrille last_name: Ngonga Ngomo - first_name: Eyke full_name: Hüllermeier, Eyke last_name: Hüllermeier citation: ama: 'Feldhans R, Wilke A, Heindorf S, et al. Drift Detection in Text Data with Document Embeddings. In: Intelligent Data Engineering and Automated Learning – IDEAL 2021. ; 2021. doi:10.1007/978-3-030-91608-4_11' apa: Feldhans, R., Wilke, A., Heindorf, S., Shaker, M. H., Hammer, B., Ngonga Ngomo, A.-C., & Hüllermeier, E. (2021). Drift Detection in Text Data with Document Embeddings. In Intelligent Data Engineering and Automated Learning – IDEAL 2021. https://doi.org/10.1007/978-3-030-91608-4_11 bibtex: '@inbook{Feldhans_Wilke_Heindorf_Shaker_Hammer_Ngonga Ngomo_Hüllermeier_2021, place={Cham}, title={Drift Detection in Text Data with Document Embeddings}, DOI={10.1007/978-3-030-91608-4_11}, booktitle={Intelligent Data Engineering and Automated Learning – IDEAL 2021}, author={Feldhans, Robert and Wilke, Adrian and Heindorf, Stefan and Shaker, Mohammad Hossein and Hammer, Barbara and Ngonga Ngomo, Axel-Cyrille and Hüllermeier, Eyke}, year={2021} }' chicago: Feldhans, Robert, Adrian Wilke, Stefan Heindorf, Mohammad Hossein Shaker, Barbara Hammer, Axel-Cyrille Ngonga Ngomo, and Eyke Hüllermeier. “Drift Detection in Text Data with Document Embeddings.” In Intelligent Data Engineering and Automated Learning – IDEAL 2021. Cham, 2021. https://doi.org/10.1007/978-3-030-91608-4_11. ieee: R. Feldhans et al., “Drift Detection in Text Data with Document Embeddings,” in Intelligent Data Engineering and Automated Learning – IDEAL 2021, Cham, 2021. mla: Feldhans, Robert, et al. “Drift Detection in Text Data with Document Embeddings.” Intelligent Data Engineering and Automated Learning – IDEAL 2021, 2021, doi:10.1007/978-3-030-91608-4_11. short: 'R. Feldhans, A. Wilke, S. Heindorf, M.H. Shaker, B. Hammer, A.-C. Ngonga Ngomo, E. Hüllermeier, in: Intelligent Data Engineering and Automated Learning – IDEAL 2021, Cham, 2021.' date_created: 2021-12-17T10:33:12Z date_updated: 2022-01-06T06:58:44Z department: - _id: '574' doi: 10.1007/978-3-030-91608-4_11 language: - iso: eng place: Cham publication: Intelligent Data Engineering and Automated Learning – IDEAL 2021 publication_identifier: isbn: - '9783030916077' - '9783030916084' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Drift Detection in Text Data with Document Embeddings type: book_chapter user_id: '9101' year: '2021' ... --- _id: '21378' author: - first_name: Rita full_name: Hartel, Rita id: '14961' last_name: Hartel - first_name: Alexander full_name: Dunst, Alexander last_name: Dunst citation: ama: 'Hartel R, Dunst A. An OCR Pipeline and Semantic Text Analysis for Comics. In: MANPU 2020: The 4th International Workshop on CoMics ANalysis, Processing and Understanding@Pattern Recognition. ICPR International Workshops and Challenges. Cham; 2021. doi:10.1007/978-3-030-68780-9_19' apa: 'Hartel, R., & Dunst, A. (2021). An OCR Pipeline and Semantic Text Analysis for Comics. In MANPU 2020: The 4th International Workshop on coMics ANalysis, Processing and Understanding@Pattern Recognition. ICPR International Workshops and Challenges. Cham. https://doi.org/10.1007/978-3-030-68780-9_19' bibtex: '@inproceedings{Hartel_Dunst_2021, place={Cham}, title={An OCR Pipeline and Semantic Text Analysis for Comics}, DOI={10.1007/978-3-030-68780-9_19}, booktitle={MANPU 2020: The 4th International Workshop on coMics ANalysis, Processing and Understanding@Pattern Recognition. ICPR International Workshops and Challenges}, author={Hartel, Rita and Dunst, Alexander}, year={2021} }' chicago: 'Hartel, Rita, and Alexander Dunst. “An OCR Pipeline and Semantic Text Analysis for Comics.” In MANPU 2020: The 4th International Workshop on CoMics ANalysis, Processing and Understanding@Pattern Recognition. ICPR International Workshops and Challenges. Cham, 2021. https://doi.org/10.1007/978-3-030-68780-9_19.' ieee: 'R. Hartel and A. Dunst, “An OCR Pipeline and Semantic Text Analysis for Comics,” in MANPU 2020: The 4th International Workshop on coMics ANalysis, Processing and Understanding@Pattern Recognition. ICPR International Workshops and Challenges, 2021.' mla: 'Hartel, Rita, and Alexander Dunst. “An OCR Pipeline and Semantic Text Analysis for Comics.” MANPU 2020: The 4th International Workshop on CoMics ANalysis, Processing and Understanding@Pattern Recognition. ICPR International Workshops and Challenges, 2021, doi:10.1007/978-3-030-68780-9_19.' short: 'R. Hartel, A. Dunst, in: MANPU 2020: The 4th International Workshop on CoMics ANalysis, Processing and Understanding@Pattern Recognition. ICPR International Workshops and Challenges, Cham, 2021.' date_created: 2021-03-04T12:35:22Z date_updated: 2022-01-06T06:54:57Z department: - _id: '69' doi: 10.1007/978-3-030-68780-9_19 language: - iso: eng place: Cham publication: 'MANPU 2020: The 4th International Workshop on coMics ANalysis, Processing and Understanding@Pattern Recognition. ICPR International Workshops and Challenges' publication_identifier: isbn: - '9783030687793' - '9783030687809' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: An OCR Pipeline and Semantic Text Analysis for Comics type: conference user_id: '14961' year: '2021' ... --- _id: '22057' abstract: - lang: eng text: "We construct more efficient cryptosystems with provable\r\nsecurity against adaptive attacks, based on simple and natural hardness\r\nassumptions in the standard model. Concretely, we describe:\r\n– An adaptively-secure variant of the efficient, selectively-secure LWE-\r\nbased identity-based encryption (IBE) scheme of Agrawal, Boneh,\r\nand Boyen (EUROCRYPT 2010). In comparison to the previously\r\nmost efficient such scheme by Yamada (CRYPTO 2017) we achieve\r\nsmaller lattice parameters and shorter public keys of size O(log λ),\r\nwhere λ is the security parameter.\r\n– Adaptively-secure variants of two efficient selectively-secure pairing-\r\nbased IBEs of Boneh and Boyen (EUROCRYPT 2004). One is based\r\non the DBDH assumption, has the same ciphertext size as the cor-\r\nresponding BB04 scheme, and achieves full adaptive security with\r\npublic parameters of size only O(log λ). The other is based on a q-\r\ntype assumption and has public key size O(λ), but a ciphertext is\r\nonly a single group element and the security reduction is quadrat-\r\nically tighter than the corresponding scheme by Jager and Kurek\r\n(ASIACRYPT 2018).\r\n– A very efficient adaptively-secure verifiable random function where\r\nproofs, public keys, and secret keys have size O(log λ).\r\nAs a technical contribution we introduce blockwise partitioning, which\r\nleverages the assumption that a cryptographic hash function is weak\r\nnear-collision resistant to prove full adaptive security of cryptosystems." author: - first_name: Tibor full_name: Jager, Tibor last_name: Jager - first_name: Rafael full_name: Kurek, Rafael last_name: Kurek - first_name: David full_name: Niehues, David id: '36113' last_name: Niehues citation: ama: 'Jager T, Kurek R, Niehues D. Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance. In: Public-Key Cryptography – PKC 2021. Cham; 2021. doi:10.1007/978-3-030-75245-3_22' apa: Jager, T., Kurek, R., & Niehues, D. (2021). Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance. In Public-Key Cryptography – PKC 2021. Cham. https://doi.org/10.1007/978-3-030-75245-3_22 bibtex: '@inbook{Jager_Kurek_Niehues_2021, place={Cham}, title={Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance}, DOI={10.1007/978-3-030-75245-3_22}, booktitle={Public-Key Cryptography – PKC 2021}, author={Jager, Tibor and Kurek, Rafael and Niehues, David}, year={2021} }' chicago: Jager, Tibor, Rafael Kurek, and David Niehues. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance.” In Public-Key Cryptography – PKC 2021. Cham, 2021. https://doi.org/10.1007/978-3-030-75245-3_22. ieee: T. Jager, R. Kurek, and D. Niehues, “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance,” in Public-Key Cryptography – PKC 2021, Cham, 2021. mla: Jager, Tibor, et al. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance.” Public-Key Cryptography – PKC 2021, 2021, doi:10.1007/978-3-030-75245-3_22. short: 'T. Jager, R. Kurek, D. Niehues, in: Public-Key Cryptography – PKC 2021, Cham, 2021.' date_created: 2021-05-10T15:56:24Z date_updated: 2022-01-06T06:55:23Z ddc: - '000' department: - _id: '558' doi: 10.1007/978-3-030-75245-3_22 file: - access_level: closed content_type: application/pdf creator: davnie date_created: 2021-05-10T16:02:02Z date_updated: 2021-05-10T16:02:02Z file_id: '22058' file_name: Jager et al. - 2021 - Efficient Adaptively-Secure IB-KEMs and VRFs via N.pdf file_size: 701068 relation: main_file file_date_updated: 2021-05-10T16:02:02Z has_accepted_license: '1' language: - iso: eng place: Cham project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '13' name: SFB 901 - Subproject C1 publication: Public-Key Cryptography – PKC 2021 publication_identifier: isbn: - '9783030752446' - '9783030752453' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance type: book_chapter user_id: '36113' year: '2021' ... --- _id: '22059' abstract: - lang: eng text: "Verifiable random functions (VRFs), introduced by Micali,\r\nRabin and Vadhan (FOCS’99), are the public-key equivalent of pseudo-\r\nrandom functions. A public verification key and proofs accompanying the\r\noutput enable all parties to verify the correctness of the output. How-\r\never, all known standard model VRFs have a reduction loss that is much\r\nworse than what one would expect from known optimal constructions of\r\nclosely related primitives like unique signatures. We show that:\r\n1. Every security proof for a VRF that relies on a non-interactive\r\nassumption has to lose a factor of Q, where Q is the number of adver-\r\nsarial queries. To that end, we extend the meta-reduction technique\r\nof Bader et al. (EUROCRYPT’16) to also cover VRFs.\r\n2. This raises the question: Is this bound optimal? We answer this ques-\r\ntion in the affirmative by presenting the first VRF with a reduction\r\nfrom the non-interactive qDBDHI assumption to the security of VRF\r\nthat achieves this optimal loss.\r\nWe thus paint a complete picture of the achievability of tight verifiable\r\nrandom functions: We show that a security loss of Q is unavoidable and\r\npresent the first construction that achieves this bound." author: - first_name: David full_name: Niehues, David id: '36113' last_name: Niehues citation: ama: 'Niehues D. Verifiable Random Functions with Optimal Tightness. In: Public-Key Cryptography – PKC 2021. Cham; 2021. doi:10.1007/978-3-030-75248-4_3' apa: Niehues, D. (2021). Verifiable Random Functions with Optimal Tightness. In Public-Key Cryptography – PKC 2021. Cham. https://doi.org/10.1007/978-3-030-75248-4_3 bibtex: '@inbook{Niehues_2021, place={Cham}, title={Verifiable Random Functions with Optimal Tightness}, DOI={10.1007/978-3-030-75248-4_3}, booktitle={Public-Key Cryptography – PKC 2021}, author={Niehues, David}, year={2021} }' chicago: Niehues, David. “Verifiable Random Functions with Optimal Tightness.” In Public-Key Cryptography – PKC 2021. Cham, 2021. https://doi.org/10.1007/978-3-030-75248-4_3. ieee: D. Niehues, “Verifiable Random Functions with Optimal Tightness,” in Public-Key Cryptography – PKC 2021, Cham, 2021. mla: Niehues, David. “Verifiable Random Functions with Optimal Tightness.” Public-Key Cryptography – PKC 2021, 2021, doi:10.1007/978-3-030-75248-4_3. short: 'D. Niehues, in: Public-Key Cryptography – PKC 2021, Cham, 2021.' date_created: 2021-05-10T16:07:50Z date_updated: 2022-01-06T06:55:24Z ddc: - '000' department: - _id: '558' doi: 10.1007/978-3-030-75248-4_3 file: - access_level: closed content_type: application/pdf creator: davnie date_created: 2021-05-10T16:09:17Z date_updated: 2021-05-10T16:09:17Z file_id: '22060' file_name: Niehues - 2021 - Verifiable Random Functions with Optimal Tightness.pdf file_size: 697361 relation: main_file file_date_updated: 2021-05-10T16:09:17Z has_accepted_license: '1' language: - iso: eng place: Cham project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '13' name: SFB 901 - Subproject C1 publication: Public-Key Cryptography – PKC 2021 publication_identifier: isbn: - '9783030752477' - '9783030752484' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Verifiable Random Functions with Optimal Tightness type: book_chapter user_id: '36113' year: '2021' ... --- _id: '27381' abstract: - lang: eng text: Graph neural networks (GNNs) have been successfully applied in many structured data domains, with applications ranging from molecular property prediction to the analysis of social networks. Motivated by the broad applicability of GNNs, we propose the family of so-called RankGNNs, a combination of neural Learning to Rank (LtR) methods and GNNs. RankGNNs are trained with a set of pair-wise preferences between graphs, suggesting that one of them is preferred over the other. One practical application of this problem is drug screening, where an expert wants to find the most promising molecules in a large collection of drug candidates. We empirically demonstrate that our proposed pair-wise RankGNN approach either significantly outperforms or at least matches the ranking performance of the naive point-wise baseline approach, in which the LtR problem is solved via GNN-based graph regression. author: - first_name: Clemens full_name: Damke, Clemens id: '48192' last_name: Damke orcid: 0000-0002-0455-0048 - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Damke C, Hüllermeier E. Ranking Structured Objects with Graph Neural Networks. In: Soares C, Torgo L, eds. Proceedings of The 24th International Conference on Discovery Science (DS 2021). Vol 12986. Lecture Notes in Computer Science. Springer; 2021:166-180. doi:10.1007/978-3-030-88942-5' apa: Damke, C., & Hüllermeier, E. (2021). Ranking Structured Objects with Graph Neural Networks. In C. Soares & L. Torgo (Eds.), Proceedings of The 24th International Conference on Discovery Science (DS 2021) (Vol. 12986, pp. 166–180). Springer. https://doi.org/10.1007/978-3-030-88942-5 bibtex: '@inproceedings{Damke_Hüllermeier_2021, series={Lecture Notes in Computer Science}, title={Ranking Structured Objects with Graph Neural Networks}, volume={12986}, DOI={10.1007/978-3-030-88942-5}, booktitle={Proceedings of The 24th International Conference on Discovery Science (DS 2021)}, publisher={Springer}, author={Damke, Clemens and Hüllermeier, Eyke}, editor={Soares, Carlos and Torgo, Luis}, year={2021}, pages={166–180}, collection={Lecture Notes in Computer Science} }' chicago: Damke, Clemens, and Eyke Hüllermeier. “Ranking Structured Objects with Graph Neural Networks.” In Proceedings of The 24th International Conference on Discovery Science (DS 2021), edited by Carlos Soares and Luis Torgo, 12986:166–80. Lecture Notes in Computer Science. Springer, 2021. https://doi.org/10.1007/978-3-030-88942-5. ieee: 'C. Damke and E. Hüllermeier, “Ranking Structured Objects with Graph Neural Networks,” in Proceedings of The 24th International Conference on Discovery Science (DS 2021), Halifax, Canada, 2021, vol. 12986, pp. 166–180, doi: 10.1007/978-3-030-88942-5.' mla: Damke, Clemens, and Eyke Hüllermeier. “Ranking Structured Objects with Graph Neural Networks.” Proceedings of The 24th International Conference on Discovery Science (DS 2021), edited by Carlos Soares and Luis Torgo, vol. 12986, Springer, 2021, pp. 166–80, doi:10.1007/978-3-030-88942-5. short: 'C. Damke, E. Hüllermeier, in: C. Soares, L. Torgo (Eds.), Proceedings of The 24th International Conference on Discovery Science (DS 2021), Springer, 2021, pp. 166–180.' conference: end_date: 2021-10-13 location: Halifax, Canada name: 24th International Conference on Discovery Science start_date: 2021-10-11 date_created: 2021-11-11T14:15:18Z date_updated: 2022-04-11T22:08:12Z department: - _id: '355' doi: 10.1007/978-3-030-88942-5 editor: - first_name: Carlos full_name: Soares, Carlos last_name: Soares - first_name: Luis full_name: Torgo, Luis last_name: Torgo external_id: arxiv: - '2104.08869' intvolume: ' 12986' keyword: - Graph-structured data - Graph neural networks - Preference learning - Learning to rank language: - iso: eng page: 166-180 publication: Proceedings of The 24th International Conference on Discovery Science (DS 2021) publication_identifier: isbn: - '9783030889418' - '9783030889425' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer quality_controlled: '1' series_title: Lecture Notes in Computer Science status: public title: Ranking Structured Objects with Graph Neural Networks type: conference user_id: '48192' volume: 12986 year: '2021' ... --- _id: '26888' author: - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte - first_name: Christina full_name: Kolb, Christina id: '43647' last_name: Kolb - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Julian full_name: Werthmann, Julian id: '50024' last_name: Werthmann citation: ama: 'Götte T, Kolb C, Scheideler C, Werthmann J. Beep-And-Sleep: Message and Energy Efficient Set Cover. In: Algorithms for Sensor Systems (ALGOSENSORS ’21). ; 2021. doi:10.1007/978-3-030-89240-1_7' apa: 'Götte, T., Kolb, C., Scheideler, C., & Werthmann, J. (2021). Beep-And-Sleep: Message and Energy Efficient Set Cover. In Algorithms for Sensor Systems (ALGOSENSORS ’21). ALGOSENSORS 2021, Lisbon, Portgual. https://doi.org/10.1007/978-3-030-89240-1_7' bibtex: '@inbook{Götte_Kolb_Scheideler_Werthmann_2021, place={Cham}, title={Beep-And-Sleep: Message and Energy Efficient Set Cover}, DOI={10.1007/978-3-030-89240-1_7}, booktitle={Algorithms for Sensor Systems (ALGOSENSORS ’21)}, author={Götte, Thorsten and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}, year={2021} }' chicago: 'Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann. “Beep-And-Sleep: Message and Energy Efficient Set Cover.” In Algorithms for Sensor Systems (ALGOSENSORS ’21). Cham, 2021. https://doi.org/10.1007/978-3-030-89240-1_7.' ieee: 'T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-And-Sleep: Message and Energy Efficient Set Cover,” in Algorithms for Sensor Systems (ALGOSENSORS ’21), Cham, 2021.' mla: 'Götte, Thorsten, et al. “Beep-And-Sleep: Message and Energy Efficient Set Cover.” Algorithms for Sensor Systems (ALGOSENSORS ’21), 2021, doi:10.1007/978-3-030-89240-1_7.' short: 'T. Götte, C. Kolb, C. Scheideler, J. Werthmann, in: Algorithms for Sensor Systems (ALGOSENSORS ’21), Cham, 2021.' conference: location: Lisbon, Portgual name: ALGOSENSORS 2021 date_created: 2021-10-26T12:06:04Z date_updated: 2022-11-18T10:01:36Z doi: 10.1007/978-3-030-89240-1_7 language: - iso: eng place: Cham project: - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 - _id: '1' name: 'SFB 901: SFB 901' publication: Algorithms for Sensor Systems (ALGOSENSORS '21) publication_identifier: issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: 'Beep-And-Sleep: Message and Energy Efficient Set Cover' type: book_chapter user_id: '477' year: '2021' ... --- _id: '29566' author: - first_name: Jan full_name: Bobolz, Jan id: '27207' last_name: Bobolz - first_name: Fabian full_name: Eidens, Fabian id: '25078' last_name: Eidens - first_name: Stephan full_name: Krenn, Stephan last_name: Krenn - first_name: Sebastian full_name: Ramacher, Sebastian last_name: Ramacher - first_name: Kai full_name: Samelin, Kai last_name: Samelin citation: ama: 'Bobolz J, Eidens F, Krenn S, Ramacher S, Samelin K. Issuer-Hiding Attribute-Based Credentials. In: Cryptology and Network Security. Springer International Publishing; 2021. doi:10.1007/978-3-030-92548-2_9' apa: Bobolz, J., Eidens, F., Krenn, S., Ramacher, S., & Samelin, K. (2021). Issuer-Hiding Attribute-Based Credentials. Cryptology and Network Security. https://doi.org/10.1007/978-3-030-92548-2_9 bibtex: '@inproceedings{Bobolz_Eidens_Krenn_Ramacher_Samelin_2021, place={Cham}, title={Issuer-Hiding Attribute-Based Credentials}, DOI={10.1007/978-3-030-92548-2_9}, booktitle={Cryptology and Network Security}, publisher={Springer International Publishing}, author={Bobolz, Jan and Eidens, Fabian and Krenn, Stephan and Ramacher, Sebastian and Samelin, Kai}, year={2021} }' chicago: 'Bobolz, Jan, Fabian Eidens, Stephan Krenn, Sebastian Ramacher, and Kai Samelin. “Issuer-Hiding Attribute-Based Credentials.” In Cryptology and Network Security. Cham: Springer International Publishing, 2021. https://doi.org/10.1007/978-3-030-92548-2_9.' ieee: 'J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, and K. Samelin, “Issuer-Hiding Attribute-Based Credentials,” 2021, doi: 10.1007/978-3-030-92548-2_9.' mla: Bobolz, Jan, et al. “Issuer-Hiding Attribute-Based Credentials.” Cryptology and Network Security, Springer International Publishing, 2021, doi:10.1007/978-3-030-92548-2_9. short: 'J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, K. Samelin, in: Cryptology and Network Security, Springer International Publishing, Cham, 2021.' date_created: 2022-01-27T13:00:21Z date_updated: 2022-01-27T13:02:23Z department: - _id: '7' - _id: '64' doi: 10.1007/978-3-030-92548-2_9 language: - iso: eng place: Cham project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '4' name: 'SFB 901 - C: SFB 901 - Project Area C' - _id: '13' name: 'SFB 901 - C1: SFB 901 - Subproject C1' publication: Cryptology and Network Security publication_identifier: isbn: - '9783030925475' - '9783030925482' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: Issuer-Hiding Attribute-Based Credentials type: conference user_id: '27207' year: '2021' ... --- _id: '32868' author: - first_name: Per Rådberg full_name: Nagbøl, Per Rådberg last_name: Nagbøl - first_name: Oliver full_name: Müller, Oliver last_name: Müller - first_name: Oliver full_name: Krancher, Oliver last_name: Krancher citation: ama: 'Nagbøl PR, Müller O, Krancher O. Designing a Risk Assessment Tool for Artificial Intelligence Systems. In: The Next Wave of Sociotechnical Design. Springer International Publishing; 2021. doi:10.1007/978-3-030-82405-1_32' apa: Nagbøl, P. R., Müller, O., & Krancher, O. (2021). Designing a Risk Assessment Tool for Artificial Intelligence Systems. In The Next Wave of Sociotechnical Design. Springer International Publishing. https://doi.org/10.1007/978-3-030-82405-1_32 bibtex: '@inbook{Nagbøl_Müller_Krancher_2021, place={Cham}, title={Designing a Risk Assessment Tool for Artificial Intelligence Systems}, DOI={10.1007/978-3-030-82405-1_32}, booktitle={The Next Wave of Sociotechnical Design}, publisher={Springer International Publishing}, author={Nagbøl, Per Rådberg and Müller, Oliver and Krancher, Oliver}, year={2021} }' chicago: 'Nagbøl, Per Rådberg, Oliver Müller, and Oliver Krancher. “Designing a Risk Assessment Tool for Artificial Intelligence Systems.” In The Next Wave of Sociotechnical Design. Cham: Springer International Publishing, 2021. https://doi.org/10.1007/978-3-030-82405-1_32.' ieee: 'P. R. Nagbøl, O. Müller, and O. Krancher, “Designing a Risk Assessment Tool for Artificial Intelligence Systems,” in The Next Wave of Sociotechnical Design, Cham: Springer International Publishing, 2021.' mla: Nagbøl, Per Rådberg, et al. “Designing a Risk Assessment Tool for Artificial Intelligence Systems.” The Next Wave of Sociotechnical Design, Springer International Publishing, 2021, doi:10.1007/978-3-030-82405-1_32. short: 'P.R. Nagbøl, O. Müller, O. Krancher, in: The Next Wave of Sociotechnical Design, Springer International Publishing, Cham, 2021.' date_created: 2022-08-17T07:14:41Z date_updated: 2022-08-17T07:16:00Z department: - _id: '196' doi: 10.1007/978-3-030-82405-1_32 language: - iso: eng place: Cham publication: The Next Wave of Sociotechnical Design publication_identifier: isbn: - '9783030824044' - '9783030824051' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: Designing a Risk Assessment Tool for Artificial Intelligence Systems type: book_chapter user_id: '72849' year: '2021' ... --- _id: '29292' author: - first_name: Robert full_name: Feldhans, Robert last_name: Feldhans - first_name: Adrian full_name: Wilke, Adrian id: '9101' last_name: Wilke orcid: 0000-0002-6575-807X - first_name: Stefan full_name: Heindorf, Stefan id: '11871' last_name: Heindorf orcid: 0000-0002-4525-6865 - first_name: Mohammad Hossein full_name: Shaker, Mohammad Hossein last_name: Shaker - first_name: Barbara full_name: Hammer, Barbara last_name: Hammer - first_name: Axel-Cyrille full_name: Ngonga Ngomo, Axel-Cyrille id: '65716' last_name: Ngonga Ngomo - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Feldhans R, Wilke A, Heindorf S, et al. Drift Detection in Text Data with Document Embeddings. In: Intelligent Data Engineering and Automated Learning – IDEAL 2021. Springer International Publishing; 2021. doi:10.1007/978-3-030-91608-4_11' apa: Feldhans, R., Wilke, A., Heindorf, S., Shaker, M. H., Hammer, B., Ngonga Ngomo, A.-C., & Hüllermeier, E. (2021). Drift Detection in Text Data with Document Embeddings. In Intelligent Data Engineering and Automated Learning – IDEAL 2021. Springer International Publishing. https://doi.org/10.1007/978-3-030-91608-4_11 bibtex: '@inbook{Feldhans_Wilke_Heindorf_Shaker_Hammer_Ngonga Ngomo_Hüllermeier_2021, place={Cham}, title={Drift Detection in Text Data with Document Embeddings}, DOI={10.1007/978-3-030-91608-4_11}, booktitle={Intelligent Data Engineering and Automated Learning – IDEAL 2021}, publisher={Springer International Publishing}, author={Feldhans, Robert and Wilke, Adrian and Heindorf, Stefan and Shaker, Mohammad Hossein and Hammer, Barbara and Ngonga Ngomo, Axel-Cyrille and Hüllermeier, Eyke}, year={2021} }' chicago: 'Feldhans, Robert, Adrian Wilke, Stefan Heindorf, Mohammad Hossein Shaker, Barbara Hammer, Axel-Cyrille Ngonga Ngomo, and Eyke Hüllermeier. “Drift Detection in Text Data with Document Embeddings.” In Intelligent Data Engineering and Automated Learning – IDEAL 2021. Cham: Springer International Publishing, 2021. https://doi.org/10.1007/978-3-030-91608-4_11.' ieee: 'R. Feldhans et al., “Drift Detection in Text Data with Document Embeddings,” in Intelligent Data Engineering and Automated Learning – IDEAL 2021, Cham: Springer International Publishing, 2021.' mla: Feldhans, Robert, et al. “Drift Detection in Text Data with Document Embeddings.” Intelligent Data Engineering and Automated Learning – IDEAL 2021, Springer International Publishing, 2021, doi:10.1007/978-3-030-91608-4_11. short: 'R. Feldhans, A. Wilke, S. Heindorf, M.H. Shaker, B. Hammer, A.-C. Ngonga Ngomo, E. Hüllermeier, in: Intelligent Data Engineering and Automated Learning – IDEAL 2021, Springer International Publishing, Cham, 2021.' date_created: 2022-01-12T10:27:23Z date_updated: 2022-10-15T19:54:20Z department: - _id: '574' doi: 10.1007/978-3-030-91608-4_11 language: - iso: eng main_file_link: - open_access: '1' url: https://papers.dice-research.org/2021/IDEAL2021_DriftDetectionEmbeddings/Drift-Detection-in-Text-Data-with-Document-Embeddings-public.pdf oa: '1' place: Cham publication: Intelligent Data Engineering and Automated Learning – IDEAL 2021 publication_identifier: isbn: - '9783030916077' - '9783030916084' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing related_material: link: - relation: confirmation url: https://link.springer.com/chapter/10.1007/978-3-030-91608-4_11 status: public title: Drift Detection in Text Data with Document Embeddings type: book_chapter user_id: '11871' year: '2021' ... --- _id: '45846' author: - first_name: Juha full_name: Kontinen, Juha last_name: Kontinen - first_name: Arne full_name: Meier, Arne last_name: Meier - first_name: Yasir full_name: Mahmood, Yasir last_name: Mahmood citation: ama: 'Kontinen J, Meier A, Mahmood Y. A Parameterized View on the Complexity of Dependence Logic. In: Logical Foundations of Computer Science. Springer International Publishing; 2021. doi:10.1007/978-3-030-93100-1_9' apa: Kontinen, J., Meier, A., & Mahmood, Y. (2021). A Parameterized View on the Complexity of Dependence Logic. Logical Foundations of Computer Science. https://doi.org/10.1007/978-3-030-93100-1_9 bibtex: '@inproceedings{Kontinen_Meier_Mahmood_2021, place={Cham}, title={A Parameterized View on the Complexity of Dependence Logic}, DOI={10.1007/978-3-030-93100-1_9}, booktitle={Logical Foundations of Computer Science}, publisher={Springer International Publishing}, author={Kontinen, Juha and Meier, Arne and Mahmood, Yasir}, year={2021} }' chicago: 'Kontinen, Juha, Arne Meier, and Yasir Mahmood. “A Parameterized View on the Complexity of Dependence Logic.” In Logical Foundations of Computer Science. Cham: Springer International Publishing, 2021. https://doi.org/10.1007/978-3-030-93100-1_9.' ieee: 'J. Kontinen, A. Meier, and Y. Mahmood, “A Parameterized View on the Complexity of Dependence Logic,” 2021, doi: 10.1007/978-3-030-93100-1_9.' mla: Kontinen, Juha, et al. “A Parameterized View on the Complexity of Dependence Logic.” Logical Foundations of Computer Science, Springer International Publishing, 2021, doi:10.1007/978-3-030-93100-1_9. short: 'J. Kontinen, A. Meier, Y. Mahmood, in: Logical Foundations of Computer Science, Springer International Publishing, Cham, 2021.' date_created: 2023-07-03T11:36:33Z date_updated: 2023-07-03T11:44:42Z doi: 10.1007/978-3-030-93100-1_9 language: - iso: eng place: Cham publication: Logical Foundations of Computer Science publication_identifier: isbn: - '9783030930998' - '9783030931001' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: A Parameterized View on the Complexity of Dependence Logic type: conference user_id: '99353' year: '2021' ... --- _id: '21587' abstract: - lang: eng text: Solving partial differential equations on unstructured grids is a cornerstone of engineering and scientific computing. Nowadays, heterogeneous parallel platforms with CPUs, GPUs, and FPGAs enable energy-efficient and computationally demanding simulations. We developed the HighPerMeshes C++-embedded Domain-Specific Language (DSL) for bridging the abstraction gap between the mathematical and algorithmic formulation of mesh-based algorithms for PDE problems on the one hand and an increasing number of heterogeneous platforms with their different parallel programming and runtime models on the other hand. Thus, the HighPerMeshes DSL aims at higher productivity in the code development process for multiple target platforms. We introduce the concepts as well as the basic structure of the HighPerMeshes DSL, and demonstrate its usage with three examples, a Poisson and monodomain problem, respectively, solved by the continuous finite element method, and the discontinuous Galerkin method for Maxwell’s equation. The mapping of the abstract algorithmic description onto parallel hardware, including distributed memory compute clusters, is presented. Finally, the achievable performance and scalability are demonstrated for a typical example problem on a multi-core CPU cluster. author: - first_name: Samer full_name: Alhaddad, Samer id: '42456' last_name: Alhaddad - first_name: Jens full_name: Förstner, Jens id: '158' last_name: Förstner orcid: 0000-0001-7059-9862 - first_name: Stefan full_name: Groth, Stefan last_name: Groth - first_name: Daniel full_name: Grünewald, Daniel last_name: Grünewald - first_name: Yevgen full_name: Grynko, Yevgen id: '26059' last_name: Grynko - first_name: Frank full_name: Hannig, Frank last_name: Hannig - first_name: Tobias full_name: Kenter, Tobias id: '3145' last_name: Kenter - first_name: Franz-Josef full_name: Pfreundt, Franz-Josef last_name: Pfreundt - first_name: Christian full_name: Plessl, Christian id: '16153' last_name: Plessl orcid: 0000-0001-5728-9982 - first_name: Merlind full_name: Schotte, Merlind last_name: Schotte - first_name: Thomas full_name: Steinke, Thomas last_name: Steinke - first_name: Jürgen full_name: Teich, Jürgen last_name: Teich - first_name: Martin full_name: Weiser, Martin last_name: Weiser - first_name: Florian full_name: Wende, Florian last_name: Wende citation: ama: 'Alhaddad S, Förstner J, Groth S, et al. HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids. In: Euro-Par 2020: Parallel Processing Workshops. ; 2021. doi:10.1007/978-3-030-71593-9_15' apa: 'Alhaddad, S., Förstner, J., Groth, S., Grünewald, D., Grynko, Y., Hannig, F., Kenter, T., Pfreundt, F.-J., Plessl, C., Schotte, M., Steinke, T., Teich, J., Weiser, M., & Wende, F. (2021). HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids. In Euro-Par 2020: Parallel Processing Workshops. https://doi.org/10.1007/978-3-030-71593-9_15' bibtex: '@inbook{Alhaddad_Förstner_Groth_Grünewald_Grynko_Hannig_Kenter_Pfreundt_Plessl_Schotte_et al._2021, place={Cham}, title={HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids}, DOI={10.1007/978-3-030-71593-9_15}, booktitle={Euro-Par 2020: Parallel Processing Workshops}, author={Alhaddad, Samer and Förstner, Jens and Groth, Stefan and Grünewald, Daniel and Grynko, Yevgen and Hannig, Frank and Kenter, Tobias and Pfreundt, Franz-Josef and Plessl, Christian and Schotte, Merlind and et al.}, year={2021} }' chicago: 'Alhaddad, Samer, Jens Förstner, Stefan Groth, Daniel Grünewald, Yevgen Grynko, Frank Hannig, Tobias Kenter, et al. “HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids.” In Euro-Par 2020: Parallel Processing Workshops. Cham, 2021. https://doi.org/10.1007/978-3-030-71593-9_15.' ieee: 'S. Alhaddad et al., “HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids,” in Euro-Par 2020: Parallel Processing Workshops, Cham, 2021.' mla: 'Alhaddad, Samer, et al. “HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids.” Euro-Par 2020: Parallel Processing Workshops, 2021, doi:10.1007/978-3-030-71593-9_15.' short: 'S. Alhaddad, J. Förstner, S. Groth, D. Grünewald, Y. Grynko, F. Hannig, T. Kenter, F.-J. Pfreundt, C. Plessl, M. Schotte, T. Steinke, J. Teich, M. Weiser, F. Wende, in: Euro-Par 2020: Parallel Processing Workshops, Cham, 2021.' date_created: 2021-03-31T19:39:42Z date_updated: 2023-09-26T11:40:25Z ddc: - '004' department: - _id: '61' - _id: '230' - _id: '429' - _id: '27' - _id: '518' doi: 10.1007/978-3-030-71593-9_15 file: - access_level: closed content_type: application/pdf creator: fossie date_created: 2021-03-31T19:42:52Z date_updated: 2021-03-31T19:42:52Z file_id: '21588' file_name: 2021-03 Alhaddad2021_Chapter_HighPerMeshesADomain-SpecificL.pdf file_size: 564398 relation: main_file success: 1 file_date_updated: 2021-03-31T19:42:52Z has_accepted_license: '1' keyword: - tet_topic_hpc language: - iso: eng place: Cham project: - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: 'Euro-Par 2020: Parallel Processing Workshops' publication_identifier: isbn: - '9783030715922' - '9783030715939' issn: - 0302-9743 - 1611-3349 publication_status: published quality_controlled: '1' status: public title: HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids type: book_chapter user_id: '15278' year: '2021' ... --- _id: '29936' author: - first_name: Arjun full_name: Ramaswami, Arjun id: '49171' last_name: Ramaswami orcid: https://orcid.org/0000-0002-0909-1178 - first_name: Tobias full_name: Kenter, Tobias id: '3145' last_name: Kenter - first_name: Thomas full_name: Kühne, Thomas id: '49079' last_name: Kühne - first_name: Christian full_name: Plessl, Christian id: '16153' last_name: Plessl orcid: 0000-0001-5728-9982 citation: ama: 'Ramaswami A, Kenter T, Kühne T, Plessl C. Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing. In: Applied Reconfigurable Computing. Architectures, Tools, and Applications. Springer International Publishing; 2021. doi:10.1007/978-3-030-79025-7_21' apa: Ramaswami, A., Kenter, T., Kühne, T., & Plessl, C. (2021). Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing. In Applied Reconfigurable Computing. Architectures, Tools, and Applications. Int. Conf. on Applied Reconfigurable Computing. Architectures, Tools, and Applications. Springer International Publishing. https://doi.org/10.1007/978-3-030-79025-7_21 bibtex: '@inbook{Ramaswami_Kenter_Kühne_Plessl_2021, place={Cham}, title={Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing}, DOI={10.1007/978-3-030-79025-7_21}, booktitle={Applied Reconfigurable Computing. Architectures, Tools, and Applications}, publisher={Springer International Publishing}, author={Ramaswami, Arjun and Kenter, Tobias and Kühne, Thomas and Plessl, Christian}, year={2021} }' chicago: 'Ramaswami, Arjun, Tobias Kenter, Thomas Kühne, and Christian Plessl. “Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing.” In Applied Reconfigurable Computing. Architectures, Tools, and Applications. Cham: Springer International Publishing, 2021. https://doi.org/10.1007/978-3-030-79025-7_21.' ieee: 'A. Ramaswami, T. Kenter, T. Kühne, and C. Plessl, “Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing,” in Applied Reconfigurable Computing. Architectures, Tools, and Applications, Cham: Springer International Publishing, 2021.' mla: Ramaswami, Arjun, et al. “Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing.” Applied Reconfigurable Computing. Architectures, Tools, and Applications, Springer International Publishing, 2021, doi:10.1007/978-3-030-79025-7_21. short: 'A. Ramaswami, T. Kenter, T. Kühne, C. Plessl, in: Applied Reconfigurable Computing. Architectures, Tools, and Applications, Springer International Publishing, Cham, 2021.' conference: name: Int. Conf. on Applied Reconfigurable Computing. Architectures, Tools, and Applications date_created: 2022-02-21T14:22:01Z date_updated: 2023-09-26T11:40:45Z department: - _id: '27' - _id: '518' - _id: '304' doi: 10.1007/978-3-030-79025-7_21 language: - iso: eng place: Cham publication: Applied Reconfigurable Computing. Architectures, Tools, and Applications publication_identifier: isbn: - '9783030790240' - '9783030790257' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing quality_controlled: '1' status: public title: Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing type: book_chapter user_id: '15278' year: '2021' ... --- _id: '45823' author: - first_name: Juha full_name: Kontinen, Juha last_name: Kontinen - first_name: Arne full_name: Meier, Arne last_name: Meier - first_name: Yasir full_name: Mahmood, Yasir last_name: Mahmood citation: ama: 'Kontinen J, Meier A, Mahmood Y. A Parameterized View on the Complexity of Dependence Logic. In: Logical Foundations of Computer Science. Springer International Publishing; 2021. doi:10.1007/978-3-030-93100-1_9' apa: Kontinen, J., Meier, A., & Mahmood, Y. (2021). A Parameterized View on the Complexity of Dependence Logic. In Logical Foundations of Computer Science. Springer International Publishing. https://doi.org/10.1007/978-3-030-93100-1_9 bibtex: '@inbook{Kontinen_Meier_Mahmood_2021, place={Cham}, title={A Parameterized View on the Complexity of Dependence Logic}, DOI={10.1007/978-3-030-93100-1_9}, booktitle={Logical Foundations of Computer Science}, publisher={Springer International Publishing}, author={Kontinen, Juha and Meier, Arne and Mahmood, Yasir}, year={2021} }' chicago: 'Kontinen, Juha, Arne Meier, and Yasir Mahmood. “A Parameterized View on the Complexity of Dependence Logic.” In Logical Foundations of Computer Science. Cham: Springer International Publishing, 2021. https://doi.org/10.1007/978-3-030-93100-1_9.' ieee: 'J. Kontinen, A. Meier, and Y. Mahmood, “A Parameterized View on the Complexity of Dependence Logic,” in Logical Foundations of Computer Science, Cham: Springer International Publishing, 2021.' mla: Kontinen, Juha, et al. “A Parameterized View on the Complexity of Dependence Logic.” Logical Foundations of Computer Science, Springer International Publishing, 2021, doi:10.1007/978-3-030-93100-1_9. short: 'J. Kontinen, A. Meier, Y. Mahmood, in: Logical Foundations of Computer Science, Springer International Publishing, Cham, 2021.' date_created: 2023-06-30T11:58:04Z date_updated: 2024-03-01T11:45:56Z doi: 10.1007/978-3-030-93100-1_9 place: Cham publication: Logical Foundations of Computer Science publication_identifier: isbn: - '9783030930998' - '9783030931001' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: A Parameterized View on the Complexity of Dependence Logic type: book_chapter user_id: '99353' year: '2021' ... --- _id: '19521' author: - first_name: Karlson full_name: Pfannschmidt, Karlson last_name: Pfannschmidt - first_name: Eyke full_name: Hüllermeier, Eyke last_name: Hüllermeier citation: ama: 'Pfannschmidt K, Hüllermeier E. Learning Choice Functions via Pareto-Embeddings. In: Lecture Notes in Computer Science. Cham; 2020. doi:10.1007/978-3-030-58285-2_30' apa: Pfannschmidt, K., & Hüllermeier, E. (2020). Learning Choice Functions via Pareto-Embeddings. In Lecture Notes in Computer Science. Cham. https://doi.org/10.1007/978-3-030-58285-2_30 bibtex: '@inbook{Pfannschmidt_Hüllermeier_2020, place={Cham}, title={Learning Choice Functions via Pareto-Embeddings}, DOI={10.1007/978-3-030-58285-2_30}, booktitle={Lecture Notes in Computer Science}, author={Pfannschmidt, Karlson and Hüllermeier, Eyke}, year={2020} }' chicago: Pfannschmidt, Karlson, and Eyke Hüllermeier. “Learning Choice Functions via Pareto-Embeddings.” In Lecture Notes in Computer Science. Cham, 2020. https://doi.org/10.1007/978-3-030-58285-2_30. ieee: K. Pfannschmidt and E. Hüllermeier, “Learning Choice Functions via Pareto-Embeddings,” in Lecture Notes in Computer Science, Cham, 2020. mla: Pfannschmidt, Karlson, and Eyke Hüllermeier. “Learning Choice Functions via Pareto-Embeddings.” Lecture Notes in Computer Science, 2020, doi:10.1007/978-3-030-58285-2_30. short: 'K. Pfannschmidt, E. Hüllermeier, in: Lecture Notes in Computer Science, Cham, 2020.' date_created: 2020-09-17T10:52:41Z date_updated: 2022-01-06T06:54:06Z department: - _id: '7' - _id: '355' doi: 10.1007/978-3-030-58285-2_30 language: - iso: eng place: Cham project: - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783030582845' - '9783030582852' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Learning Choice Functions via Pareto-Embeddings type: book_chapter user_id: '13472' year: '2020' ... --- _id: '19561' author: - first_name: Meinolf full_name: Sellmann, Meinolf last_name: Sellmann - first_name: Kevin full_name: Tierney, Kevin last_name: Tierney citation: ama: 'Sellmann M, Tierney K. Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types. In: Lecture Notes in Computer Science. Cham; 2020. doi:10.1007/978-3-030-53552-0_12' apa: Sellmann, M., & Tierney, K. (2020). Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types. In Lecture Notes in Computer Science. Cham. https://doi.org/10.1007/978-3-030-53552-0_12 bibtex: '@inbook{Sellmann_Tierney_2020, place={Cham}, title={Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types}, DOI={10.1007/978-3-030-53552-0_12}, booktitle={Lecture Notes in Computer Science}, author={Sellmann, Meinolf and Tierney, Kevin}, year={2020} }' chicago: Sellmann, Meinolf, and Kevin Tierney. “Hyper-Parameterized Dialectic Search for Non-Linear Box-Constrained Optimization with Heterogenous Variable Types.” In Lecture Notes in Computer Science. Cham, 2020. https://doi.org/10.1007/978-3-030-53552-0_12. ieee: M. Sellmann and K. Tierney, “Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types,” in Lecture Notes in Computer Science, Cham, 2020. mla: Sellmann, Meinolf, and Kevin Tierney. “Hyper-Parameterized Dialectic Search for Non-Linear Box-Constrained Optimization with Heterogenous Variable Types.” Lecture Notes in Computer Science, 2020, doi:10.1007/978-3-030-53552-0_12. short: 'M. Sellmann, K. Tierney, in: Lecture Notes in Computer Science, Cham, 2020.' date_created: 2020-09-18T07:54:06Z date_updated: 2022-01-06T06:54:07Z doi: 10.1007/978-3-030-53552-0_12 keyword: - pc2-ressources language: - iso: eng place: Cham project: - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783030535513' - '9783030535520' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types type: book_chapter user_id: '61189' year: '2020' ... --- _id: '21396' abstract: - lang: eng text: "Verifiable random functions (VRFs) are essentially digital signatures with additional properties, namely verifiable uniqueness and pseudorandomness, which make VRFs a useful tool, e.g., to prevent enumeration in DNSSEC Authenticated Denial of Existence and the CONIKS key management system, or in the random committee selection of the Algorand blockchain.\r\n\r\nMost standard-model VRFs rely on admissible hash functions (AHFs) to achieve security against adaptive attacks in the standard model. Known AHF constructions are based on error-correcting codes, which yield asymptotically efficient constructions. However, previous works do not clarify how the code should be instantiated concretely in the real world. The rate and the minimal distance of the selected code have significant impact on the efficiency of the resulting cryptosystem, therefore it is unclear if and how the aforementioned constructions can be used in practice.\r\n\r\nFirst, we explain inherent limitations of code-based AHFs. Concretely, we assume that even if we were given codes that achieve the well-known Gilbert-Varshamov or McEliece-Rodemich-Rumsey-Welch bounds, existing AHF-based constructions of verifiable random functions (VRFs) can only be instantiated quite inefficiently. Then we introduce and construct computational AHFs (cAHFs). While classical AHFs are information-theoretic, and therefore work even in presence of computationally unbounded adversaries, cAHFs provide only security against computationally bounded adversaries. However, we show that cAHFs can be instantiated significantly more efficiently. Finally, we use our cAHF to construct the currently most efficient verifiable random function with full adaptive security in the standard model." author: - first_name: Tibor full_name: Jager, Tibor last_name: Jager - first_name: David full_name: Niehues, David id: '36113' last_name: Niehues citation: ama: 'Jager T, Niehues D. On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions. In: Lecture Notes in Computer Science. Cham; 2020. doi:10.1007/978-3-030-38471-5_13' apa: Jager, T., & Niehues, D. (2020). On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions. In Lecture Notes in Computer Science. Cham. https://doi.org/10.1007/978-3-030-38471-5_13 bibtex: '@inbook{Jager_Niehues_2020, place={Cham}, title={On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions}, DOI={10.1007/978-3-030-38471-5_13}, booktitle={Lecture Notes in Computer Science}, author={Jager, Tibor and Niehues, David}, year={2020} }' chicago: Jager, Tibor, and David Niehues. “On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions.” In Lecture Notes in Computer Science. Cham, 2020. https://doi.org/10.1007/978-3-030-38471-5_13. ieee: T. Jager and D. Niehues, “On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions,” in Lecture Notes in Computer Science, Cham, 2020. mla: Jager, Tibor, and David Niehues. “On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions.” Lecture Notes in Computer Science, 2020, doi:10.1007/978-3-030-38471-5_13. short: 'T. Jager, D. Niehues, in: Lecture Notes in Computer Science, Cham, 2020.' conference: end_date: 2019-08-16 location: Waterloo, Canada name: Selected Areas in Cryptography start_date: 2019-08-12 date_created: 2021-03-08T16:50:31Z date_updated: 2022-01-06T06:54:58Z ddc: - '000' department: - _id: '558' doi: 10.1007/978-3-030-38471-5_13 file: - access_level: closed content_type: application/pdf creator: davnie date_created: 2021-03-08T17:02:37Z date_updated: 2021-03-08T17:02:37Z file_id: '21399' file_name: Jager und Niehues - 2020 - On the Real-World Instantiability of Admissible Ha.pdf file_size: 706743 relation: main_file file_date_updated: 2021-03-08T17:02:37Z has_accepted_license: '1' keyword: - Admissible hash functions - Verifiable random functions - Error-correcting codes - Provable security language: - iso: eng main_file_link: - url: https://link.springer.com/content/pdf/10.1007%252F978-3-030-38471-5_13.pdf place: Cham project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '13' name: SFB 901 - Subproject C1 publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783030384708' - '9783030384715' issn: - 0302-9743 - 1611-3349 publication_status: published quality_controlled: '1' related_material: link: - relation: later_version url: https://eprint.iacr.org/2019/1335.pdf status: public title: On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions type: book_chapter user_id: '36113' year: '2020' ... --- _id: '17337' author: - first_name: Bahar full_name: Jazayeri, Bahar last_name: Jazayeri - first_name: Simon full_name: Schwichtenberg, Simon last_name: Schwichtenberg - first_name: Jochen full_name: Küster, Jochen last_name: Küster - first_name: Olaf full_name: Zimmermann, Olaf last_name: Zimmermann - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels citation: ama: 'Jazayeri B, Schwichtenberg S, Küster J, Zimmermann O, Engels G. Modeling and Analyzing Architectural Diversity of Open Platforms. In: Advanced Information Systems Engineering. Cham; 2020. doi:10.1007/978-3-030-49435-3_3' apa: Jazayeri, B., Schwichtenberg, S., Küster, J., Zimmermann, O., & Engels, G. (2020). Modeling and Analyzing Architectural Diversity of Open Platforms. In Advanced Information Systems Engineering. Cham. https://doi.org/10.1007/978-3-030-49435-3_3 bibtex: '@inbook{Jazayeri_Schwichtenberg_Küster_Zimmermann_Engels_2020, place={Cham}, title={Modeling and Analyzing Architectural Diversity of Open Platforms}, DOI={10.1007/978-3-030-49435-3_3}, booktitle={Advanced Information Systems Engineering}, author={Jazayeri, Bahar and Schwichtenberg, Simon and Küster, Jochen and Zimmermann, Olaf and Engels, Gregor}, year={2020} }' chicago: Jazayeri, Bahar, Simon Schwichtenberg, Jochen Küster, Olaf Zimmermann, and Gregor Engels. “Modeling and Analyzing Architectural Diversity of Open Platforms.” In Advanced Information Systems Engineering. Cham, 2020. https://doi.org/10.1007/978-3-030-49435-3_3. ieee: B. Jazayeri, S. Schwichtenberg, J. Küster, O. Zimmermann, and G. Engels, “Modeling and Analyzing Architectural Diversity of Open Platforms,” in Advanced Information Systems Engineering, Cham, 2020. mla: Jazayeri, Bahar, et al. “Modeling and Analyzing Architectural Diversity of Open Platforms.” Advanced Information Systems Engineering, 2020, doi:10.1007/978-3-030-49435-3_3. short: 'B. Jazayeri, S. Schwichtenberg, J. Küster, O. Zimmermann, G. Engels, in: Advanced Information Systems Engineering, Cham, 2020.' date_created: 2020-06-26T10:31:49Z date_updated: 2022-01-06T06:53:08Z department: - _id: '66' doi: 10.1007/978-3-030-49435-3_3 language: - iso: eng place: Cham publication: Advanced Information Systems Engineering publication_identifier: isbn: - '9783030494346' - '9783030494353' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Modeling and Analyzing Architectural Diversity of Open Platforms type: book_chapter user_id: '57458' year: '2020' ... --- _id: '20891' abstract: - lang: eng text: "Today, software systems are rarely developed monolithically, but may be composed of numerous individually developed features. Their modularization facilitates independent development and verification. While feature-based strategies to verify features in isolation have existed for years, they cannot address interactions between features. The problem with feature interactions is that they are typically unknown and may involve any subset of the features. Contrary, a family-based verification strategy captures feature interactions, but does not scale well when features evolve frequently. To the best of our knowledge, there currently exists no approach with focus on evolving features that combines both strategies and aims at eliminating their respective drawbacks. To fill this gap, we introduce Fefalution, a feature-family-based verification approach based on abstract contracts to verify evolving features and their interactions. Fefalution builds partial proofs for each evolving feature and then reuses the resulting partial proofs in verifying feature interactions, yielding a full verification of the complete software system. Moreover, to investigate whether a combination of both strategies is fruitful, we present the first empirical study for the verification of evolving features implemented by means of feature-oriented programming and by comparing Fefalution with another five family-based approaches varying in a set of optimizations. Our results indicate that partial proofs based on abstract contracts exhibit huge reuse potential, but also come with a substantial overhead for smaller evolution scenarios.\r\n" author: - first_name: Alexander full_name: Knüppel, Alexander last_name: Knüppel - first_name: Stefan full_name: Krüger, Stefan last_name: Krüger - first_name: Thomas full_name: Thüm, Thomas last_name: Thüm - first_name: Richard full_name: Bubel, Richard last_name: Bubel - first_name: Sebastian full_name: Krieter, Sebastian last_name: Krieter - first_name: Eric full_name: Bodden, Eric id: '59256' last_name: Bodden orcid: 0000-0003-3470-3647 - first_name: Ina full_name: Schaefer, Ina last_name: Schaefer citation: ama: 'Knüppel A, Krüger S, Thüm T, et al. Using Abstract Contracts for Verifying Evolving Features and Their Interactions. In: Lecture Notes in Computer Science. ; 2020. doi:10.1007/978-3-030-64354-6_5' apa: Knüppel, A., Krüger, S., Thüm, T., Bubel, R., Krieter, S., Bodden, E., & Schaefer, I. (2020). Using Abstract Contracts for Verifying Evolving Features and Their Interactions. In Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-64354-6_5 bibtex: '@inbook{Knüppel_Krüger_Thüm_Bubel_Krieter_Bodden_Schaefer_2020, place={Cham}, title={Using Abstract Contracts for Verifying Evolving Features and Their Interactions}, DOI={10.1007/978-3-030-64354-6_5}, booktitle={Lecture Notes in Computer Science}, author={Knüppel, Alexander and Krüger, Stefan and Thüm, Thomas and Bubel, Richard and Krieter, Sebastian and Bodden, Eric and Schaefer, Ina}, year={2020} }' chicago: Knüppel, Alexander, Stefan Krüger, Thomas Thüm, Richard Bubel, Sebastian Krieter, Eric Bodden, and Ina Schaefer. “Using Abstract Contracts for Verifying Evolving Features and Their Interactions.” In Lecture Notes in Computer Science. Cham, 2020. https://doi.org/10.1007/978-3-030-64354-6_5. ieee: A. Knüppel et al., “Using Abstract Contracts for Verifying Evolving Features and Their Interactions,” in Lecture Notes in Computer Science, Cham, 2020. mla: Knüppel, Alexander, et al. “Using Abstract Contracts for Verifying Evolving Features and Their Interactions.” Lecture Notes in Computer Science, 2020, doi:10.1007/978-3-030-64354-6_5. short: 'A. Knüppel, S. Krüger, T. Thüm, R. Bubel, S. Krieter, E. Bodden, I. Schaefer, in: Lecture Notes in Computer Science, Cham, 2020.' date_created: 2021-01-11T09:15:41Z date_updated: 2022-01-06T06:54:41Z department: - _id: '76' doi: 10.1007/978-3-030-64354-6_5 language: - iso: eng place: Cham publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783030643539' - '9783030643546' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Using Abstract Contracts for Verifying Evolving Features and Their Interactions type: book_chapter user_id: '5786' year: '2020' ... --- _id: '18014' author: - first_name: Adil full_name: El Mesaoudi-Paul, Adil last_name: El Mesaoudi-Paul - first_name: Dimitri full_name: Weiß, Dimitri last_name: Weiß - 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: 'El Mesaoudi-Paul A, Weiß D, Bengs V, Hüllermeier E, Tierney K. Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach. In: Learning and Intelligent Optimization. LION 2020. Vol 12096. Lecture Notes in Computer Science. Cham: Springer; 2020:216-232. doi:10.1007/978-3-030-53552-0_22' apa: 'El Mesaoudi-Paul, A., Weiß, D., Bengs, V., Hüllermeier, E., & Tierney, K. (2020). Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach. In Learning and Intelligent Optimization. LION 2020. (Vol. 12096, pp. 216–232). Cham: Springer. https://doi.org/10.1007/978-3-030-53552-0_22' bibtex: '@inbook{El Mesaoudi-Paul_Weiß_Bengs_Hüllermeier_Tierney_2020, place={Cham}, series={Lecture Notes in Computer Science}, title={Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach}, volume={12096}, DOI={10.1007/978-3-030-53552-0_22}, booktitle={Learning and Intelligent Optimization. LION 2020.}, publisher={Springer}, author={El Mesaoudi-Paul, Adil and Weiß, Dimitri and Bengs, Viktor and Hüllermeier, Eyke and Tierney, Kevin}, year={2020}, pages={216–232}, collection={Lecture Notes in Computer Science} }' chicago: 'El Mesaoudi-Paul, Adil, Dimitri Weiß, Viktor Bengs, Eyke Hüllermeier, and Kevin Tierney. “Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach.” In Learning and Intelligent Optimization. LION 2020., 12096:216–32. Lecture Notes in Computer Science. Cham: Springer, 2020. https://doi.org/10.1007/978-3-030-53552-0_22.' ieee: 'A. El Mesaoudi-Paul, D. Weiß, V. Bengs, E. Hüllermeier, and K. Tierney, “Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach,” in Learning and Intelligent Optimization. LION 2020., vol. 12096, Cham: Springer, 2020, pp. 216–232.' mla: 'El Mesaoudi-Paul, Adil, et al. “Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach.” Learning and Intelligent Optimization. LION 2020., vol. 12096, Springer, 2020, pp. 216–32, doi:10.1007/978-3-030-53552-0_22.' short: 'A. El Mesaoudi-Paul, D. Weiß, V. Bengs, E. Hüllermeier, K. Tierney, in: Learning and Intelligent Optimization. LION 2020., Springer, Cham, 2020, pp. 216–232.' date_created: 2020-08-17T11:44:37Z date_updated: 2022-01-06T06:53:25Z department: - _id: '34' - _id: '7' - _id: '355' doi: 10.1007/978-3-030-53552-0_22 intvolume: ' 12096' language: - iso: eng page: 216 - 232 place: Cham project: - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: Learning and Intelligent Optimization. LION 2020. publication_identifier: isbn: - '9783030535513' - '9783030535520' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer series_title: Lecture Notes in Computer Science status: public title: 'Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach' type: book_chapter user_id: '76599' volume: 12096 year: '2020' ... --- _id: '23377' author: - first_name: Goran full_name: Piskachev, Goran last_name: Piskachev - first_name: Tobias full_name: Petrasch, Tobias last_name: Petrasch - first_name: Johannes full_name: Späth, Johannes last_name: Späth - first_name: Eric full_name: Bodden, Eric last_name: Bodden citation: ama: 'Piskachev G, Petrasch T, Späth J, Bodden E. AuthCheck: Program-State Analysis for Access-Control Vulnerabilities. In: Lecture Notes in Computer Science. ; 2020. doi:10.1007/978-3-030-54997-8_34' apa: 'Piskachev, G., Petrasch, T., Späth, J., & Bodden, E. (2020). AuthCheck: Program-State Analysis for Access-Control Vulnerabilities. In Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-54997-8_34' bibtex: '@inbook{Piskachev_Petrasch_Späth_Bodden_2020, place={Cham}, title={AuthCheck: Program-State Analysis for Access-Control Vulnerabilities}, DOI={10.1007/978-3-030-54997-8_34}, booktitle={Lecture Notes in Computer Science}, author={Piskachev, Goran and Petrasch, Tobias and Späth, Johannes and Bodden, Eric}, year={2020} }' chicago: 'Piskachev, Goran, Tobias Petrasch, Johannes Späth, and Eric Bodden. “AuthCheck: Program-State Analysis for Access-Control Vulnerabilities.” In Lecture Notes in Computer Science. Cham, 2020. https://doi.org/10.1007/978-3-030-54997-8_34.' ieee: 'G. Piskachev, T. Petrasch, J. Späth, and E. Bodden, “AuthCheck: Program-State Analysis for Access-Control Vulnerabilities,” in Lecture Notes in Computer Science, Cham, 2020.' mla: 'Piskachev, Goran, et al. “AuthCheck: Program-State Analysis for Access-Control Vulnerabilities.” Lecture Notes in Computer Science, 2020, doi:10.1007/978-3-030-54997-8_34.' short: 'G. Piskachev, T. Petrasch, J. Späth, E. Bodden, in: Lecture Notes in Computer Science, Cham, 2020.' date_created: 2021-08-09T12:05:09Z date_updated: 2022-01-06T06:55:50Z department: - _id: '241' - _id: '662' - _id: '76' doi: 10.1007/978-3-030-54997-8_34 language: - iso: eng place: Cham publication: Lecture Notes in Computer Science publication_identifier: issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: 'AuthCheck: Program-State Analysis for Access-Control Vulnerabilities' type: book_chapter user_id: '5786' year: '2020' ... --- _id: '17084' author: - first_name: Nils full_name: Weidmann, Nils id: '53103' last_name: Weidmann - first_name: Anthony full_name: Anjorin, Anthony last_name: Anjorin citation: ama: 'Weidmann N, Anjorin A. Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming. In: Wehrheim H, Cabot J, eds. Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020. Cham: Springer; 2020. doi:10.1007/978-3-030-45234-6_16' apa: 'Weidmann, N., & Anjorin, A. (2020). Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming. In H. Wehrheim & J. Cabot (Eds.), Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020. Cham: Springer. https://doi.org/10.1007/978-3-030-45234-6_16' bibtex: '@inproceedings{Weidmann_Anjorin_2020, place={Cham}, title={Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming}, DOI={10.1007/978-3-030-45234-6_16}, booktitle={Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020}, publisher={Springer}, author={Weidmann, Nils and Anjorin, Anthony}, editor={Wehrheim, Heike and Cabot, JordiEditors}, year={2020} }' chicago: 'Weidmann, Nils, and Anthony Anjorin. “Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming.” In Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020, edited by Heike Wehrheim and Jordi Cabot. Cham: Springer, 2020. https://doi.org/10.1007/978-3-030-45234-6_16.' ieee: N. Weidmann and A. Anjorin, “Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming,” in Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020, Dublin, Ireland, 2020. mla: Weidmann, Nils, and Anthony Anjorin. “Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming.” Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020, edited by Heike Wehrheim and Jordi Cabot, Springer, 2020, doi:10.1007/978-3-030-45234-6_16. short: 'N. Weidmann, A. Anjorin, in: H. Wehrheim, J. Cabot (Eds.), Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020, Springer, Cham, 2020.' conference: end_date: 2020-04-30 location: Dublin, Ireland name: Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020 start_date: 2020-04-25 date_created: 2020-06-06T09:50:42Z date_updated: 2022-01-06T06:53:04Z department: - _id: '28' - _id: '66' - _id: '534' doi: 10.1007/978-3-030-45234-6_16 editor: - first_name: Heike full_name: Wehrheim, Heike last_name: Wehrheim - first_name: Jordi full_name: Cabot, Jordi last_name: Cabot language: - iso: eng place: Cham publication: Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020 publication_identifier: isbn: - '9783030452339' - '9783030452346' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer status: public title: Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming type: conference user_id: '53103' year: '2020' ... --- _id: '17085' author: - first_name: Bahar full_name: Schwichtenberg, Bahar id: '36399' last_name: Schwichtenberg - first_name: Simon full_name: Schwichtenberg, Simon id: '13235' last_name: Schwichtenberg - first_name: Jochen full_name: Küster, Jochen last_name: Küster - first_name: Olaf full_name: Zimmermann, Olaf last_name: Zimmermann - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels citation: ama: 'Schwichtenberg B, Schwichtenberg S, Küster J, Zimmermann O, Engels G. Modeling and Analyzing Architectural Diversity of Open Platforms. In: Advanced Information Systems Engineering. Cham; 2020. doi:10.1007/978-3-030-49435-3_3' apa: Schwichtenberg, B., Schwichtenberg, S., Küster, J., Zimmermann, O., & Engels, G. (2020). Modeling and Analyzing Architectural Diversity of Open Platforms. In Advanced Information Systems Engineering. Cham. https://doi.org/10.1007/978-3-030-49435-3_3 bibtex: '@inproceedings{Schwichtenberg_Schwichtenberg_Küster_Zimmermann_Engels_2020, place={Cham}, title={Modeling and Analyzing Architectural Diversity of Open Platforms}, DOI={10.1007/978-3-030-49435-3_3}, booktitle={Advanced Information Systems Engineering}, author={Schwichtenberg, Bahar and Schwichtenberg, Simon and Küster, Jochen and Zimmermann, Olaf and Engels, Gregor}, year={2020} }' chicago: Schwichtenberg, Bahar, Simon Schwichtenberg, Jochen Küster, Olaf Zimmermann, and Gregor Engels. “Modeling and Analyzing Architectural Diversity of Open Platforms.” In Advanced Information Systems Engineering. Cham, 2020. https://doi.org/10.1007/978-3-030-49435-3_3. ieee: B. Schwichtenberg, S. Schwichtenberg, J. Küster, O. Zimmermann, and G. Engels, “Modeling and Analyzing Architectural Diversity of Open Platforms,” in Advanced Information Systems Engineering, 2020. mla: Schwichtenberg, Bahar, et al. “Modeling and Analyzing Architectural Diversity of Open Platforms.” Advanced Information Systems Engineering, 2020, doi:10.1007/978-3-030-49435-3_3. short: 'B. Schwichtenberg, S. Schwichtenberg, J. Küster, O. Zimmermann, G. Engels, in: Advanced Information Systems Engineering, Cham, 2020.' date_created: 2020-06-07T08:53:10Z date_updated: 2022-01-06T06:53:04Z doi: 10.1007/978-3-030-49435-3_3 language: - iso: eng place: Cham publication: Advanced Information Systems Engineering publication_identifier: isbn: - '9783030494346' - '9783030494353' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Modeling and Analyzing Architectural Diversity of Open Platforms type: conference user_id: '36399' year: '2020' ... --- _id: '28997' abstract: - lang: eng text: "Modern cryptographic protocols, such as TLS 1.3 and QUIC, can send cryptographically protected data in “zero round-trip times (0-RTT)”, that is, without the need for a prior interactive handshake. Such protocols meet the demand for communication with minimal latency, but those currently deployed in practice achieve only rather weak security properties, as they may not achieve forward security for the first transmitted payload message and require additional countermeasures against replay attacks.Recently, 0-RTT protocols with full forward security and replay resilience have been proposed in the academic literature. These are based on puncturable encryption, which uses rather heavy building blocks, such as cryptographic pairings. Some constructions were claimed to have practical efficiency, but it is unclear how they compare concretely to protocols deployed in practice, and we currently do not have any benchmark results that new protocols can be compared with.We provide the first concrete performance analysis of a modern 0-RTT protocol with full forward security, by integrating the Bloom Filter Encryption scheme of Derler et al. (EUROCRYPT 2018) in the Chromium QUIC implementation and comparing it to Google’s original QUIC protocol. We find that for reasonable deployment parameters, the server CPU load increases approximately by a factor of eight and the memory consumption on the server increases significantly, but stays below 400 MB even for medium-scale deployments that handle up to 50K connections per day. The difference of the size of handshake messages is small enough that transmission time on the network is identical, and therefore not significant.We conclude that while current 0-RTT protocols with full forward security come with significant computational overhead, their use in practice is feasible, and may be used in applications where the increased CPU and memory load can be tolerated in exchange for full forward security and replay resilience on the cryptographic protocol level. Our results serve as a first benchmark that can be used to assess the efficiency of 0-RTT protocols potentially developed in the future.\r\n" author: - first_name: Fynn full_name: Dallmeier, Fynn last_name: Dallmeier - first_name: Jan P. full_name: Drees, Jan P. last_name: Drees - first_name: Kai full_name: Gellert, Kai last_name: Gellert - first_name: Tobias full_name: Handirk, Tobias last_name: Handirk - first_name: Tibor full_name: Jager, Tibor last_name: Jager - first_name: Jonas full_name: Klauke, Jonas id: '40915' last_name: Klauke orcid: 0000-0001-9160-9636 - first_name: Simon full_name: Nachtigall, Simon last_name: Nachtigall - first_name: Timo full_name: Renzelmann, Timo last_name: Renzelmann - first_name: Rudi full_name: Wolf, Rudi last_name: Wolf citation: ama: 'Dallmeier F, Drees JP, Gellert K, et al. Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC. In: Cryptology and Network Security. Springer-Verlag; 2020:211-231. doi:10.1007/978-3-030-65411-5_11' apa: 'Dallmeier, F., Drees, J. P., Gellert, K., Handirk, T., Jager, T., Klauke, J., Nachtigall, S., Renzelmann, T., & Wolf, R. (2020). Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC. Cryptology and Network Security, 211–231. https://doi.org/10.1007/978-3-030-65411-5_11' bibtex: '@inproceedings{Dallmeier_Drees_Gellert_Handirk_Jager_Klauke_Nachtigall_Renzelmann_Wolf_2020, place={Cham}, title={Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC}, DOI={10.1007/978-3-030-65411-5_11}, booktitle={Cryptology and Network Security}, publisher={Springer-Verlag}, author={Dallmeier, Fynn and Drees, Jan P. and Gellert, Kai and Handirk, Tobias and Jager, Tibor and Klauke, Jonas and Nachtigall, Simon and Renzelmann, Timo and Wolf, Rudi}, year={2020}, pages={211–231} }' chicago: 'Dallmeier, Fynn, Jan P. Drees, Kai Gellert, Tobias Handirk, Tibor Jager, Jonas Klauke, Simon Nachtigall, Timo Renzelmann, and Rudi Wolf. “Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC.” In Cryptology and Network Security, 211–31. Cham: Springer-Verlag, 2020. https://doi.org/10.1007/978-3-030-65411-5_11.' ieee: 'F. Dallmeier et al., “Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC,” in Cryptology and Network Security, Vienna, 2020, pp. 211–231, doi: 10.1007/978-3-030-65411-5_11.' mla: 'Dallmeier, Fynn, et al. “Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC.” Cryptology and Network Security, Springer-Verlag, 2020, pp. 211–31, doi:10.1007/978-3-030-65411-5_11.' short: 'F. Dallmeier, J.P. Drees, K. Gellert, T. Handirk, T. Jager, J. Klauke, S. Nachtigall, T. Renzelmann, R. Wolf, in: Cryptology and Network Security, Springer-Verlag, Cham, 2020, pp. 211–231.' conference: end_date: 2020-12-16 location: Vienna name: CANS 2020 start_date: 2020-12-14 date_created: 2021-12-15T17:43:11Z date_updated: 2022-03-11T10:59:41Z doi: 10.1007/978-3-030-65411-5_11 extern: '1' language: - iso: eng page: 211-231 place: Cham publication: Cryptology and Network Security publication_identifier: isbn: - '9783030654108' - '9783030654115' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer-Verlag status: public title: 'Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC' type: conference user_id: '40915' year: '2020' ... --- _id: '20706' author: - first_name: Philipp full_name: zur Heiden, Philipp last_name: zur Heiden citation: ama: 'zur Heiden P. Considering Context in Design Science Research: A Systematic Literature Review. In: Designing for Digital Transformation. Co-Creating Services with Citizens and Industry. ; 2020. doi:10.1007/978-3-030-64823-7_21' apa: 'zur Heiden, P. (2020). Considering Context in Design Science Research: A Systematic Literature Review. Designing for Digital Transformation. Co-Creating Services with Citizens and Industry. https://doi.org/10.1007/978-3-030-64823-7_21' bibtex: '@inproceedings{zur Heiden_2020, place={Cham}, title={Considering Context in Design Science Research: A Systematic Literature Review}, DOI={10.1007/978-3-030-64823-7_21}, booktitle={Designing for Digital Transformation. Co-Creating Services with Citizens and Industry}, author={zur Heiden, Philipp}, year={2020} }' chicago: 'Heiden, Philipp zur. “Considering Context in Design Science Research: A Systematic Literature Review.” In Designing for Digital Transformation. Co-Creating Services with Citizens and Industry. Cham, 2020. https://doi.org/10.1007/978-3-030-64823-7_21.' ieee: 'P. zur Heiden, “Considering Context in Design Science Research: A Systematic Literature Review,” 2020, doi: 10.1007/978-3-030-64823-7_21.' mla: 'zur Heiden, Philipp. “Considering Context in Design Science Research: A Systematic Literature Review.” Designing for Digital Transformation. Co-Creating Services with Citizens and Industry, 2020, doi:10.1007/978-3-030-64823-7_21.' short: 'P. zur Heiden, in: Designing for Digital Transformation. Co-Creating Services with Citizens and Industry, Cham, 2020.' date_created: 2020-12-11T14:01:48Z date_updated: 2022-04-04T09:59:49Z doi: 10.1007/978-3-030-64823-7_21 language: - iso: eng place: Cham publication: Designing for Digital Transformation. Co-Creating Services with Citizens and Industry publication_identifier: isbn: - '9783030648220' - '9783030648237' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: 'Considering Context in Design Science Research: A Systematic Literature Review' type: conference user_id: '64394' year: '2020' ... --- _id: '45848' author: - first_name: Yasir full_name: Mahmood, Yasir last_name: Mahmood - first_name: Arne full_name: Meier, Arne last_name: Meier citation: ama: 'Mahmood Y, Meier A. Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. In: Lecture Notes in Computer Science. Springer International Publishing; 2020. doi:10.1007/978-3-030-39951-1_10' apa: Mahmood, Y., & Meier, A. (2020). Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-39951-1_10 bibtex: '@inproceedings{Mahmood_Meier_2020, place={Cham}, title={Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic}, DOI={10.1007/978-3-030-39951-1_10}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Mahmood, Yasir and Meier, Arne}, year={2020} }' chicago: 'Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.” In Lecture Notes in Computer Science. Cham: Springer International Publishing, 2020. https://doi.org/10.1007/978-3-030-39951-1_10.' ieee: 'Y. Mahmood and A. Meier, “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic,” 2020, doi: 10.1007/978-3-030-39951-1_10.' mla: Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.” Lecture Notes in Computer Science, Springer International Publishing, 2020, doi:10.1007/978-3-030-39951-1_10. short: 'Y. Mahmood, A. Meier, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2020.' date_created: 2023-07-03T11:41:58Z date_updated: 2023-07-03T11:43:37Z doi: 10.1007/978-3-030-39951-1_10 language: - iso: eng place: Cham publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783030399504' - '9783030399511' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic type: conference user_id: '99353' year: '2020' ... --- _id: '47261' author: - first_name: Julie M. full_name: Haney, Julie M. last_name: Haney - first_name: Susanne M. full_name: Furman, Susanne M. last_name: Furman - first_name: Yasemin full_name: Acar, Yasemin id: '94636' last_name: Acar citation: ama: 'Haney JM, Furman SM, Acar Y. Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges. In: HCI for Cybersecurity, Privacy and Trust. Springer International Publishing; 2020. doi:10.1007/978-3-030-50309-3_26' apa: 'Haney, J. M., Furman, S. M., & Acar, Y. (2020). Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges. In HCI for Cybersecurity, Privacy and Trust. Springer International Publishing. https://doi.org/10.1007/978-3-030-50309-3_26' bibtex: '@inbook{Haney_Furman_Acar_2020, place={Cham}, title={Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges}, DOI={10.1007/978-3-030-50309-3_26}, booktitle={HCI for Cybersecurity, Privacy and Trust}, publisher={Springer International Publishing}, author={Haney, Julie M. and Furman, Susanne M. and Acar, Yasemin}, year={2020} }' chicago: 'Haney, Julie M., Susanne M. Furman, and Yasemin Acar. “Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges.” In HCI for Cybersecurity, Privacy and Trust. Cham: Springer International Publishing, 2020. https://doi.org/10.1007/978-3-030-50309-3_26.' ieee: 'J. M. Haney, S. M. Furman, and Y. Acar, “Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges,” in HCI for Cybersecurity, Privacy and Trust, Cham: Springer International Publishing, 2020.' mla: 'Haney, Julie M., et al. “Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges.” HCI for Cybersecurity, Privacy and Trust, Springer International Publishing, 2020, doi:10.1007/978-3-030-50309-3_26.' short: 'J.M. Haney, S.M. Furman, Y. Acar, in: HCI for Cybersecurity, Privacy and Trust, Springer International Publishing, Cham, 2020.' date_created: 2023-09-22T12:59:53Z date_updated: 2023-11-22T09:57:52Z department: - _id: '34' - _id: '740' doi: 10.1007/978-3-030-50309-3_26 extern: '1' language: - iso: eng place: Cham publication: HCI for Cybersecurity, Privacy and Trust publication_identifier: isbn: - '9783030503086' - '9783030503093' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: 'Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges' type: book_chapter user_id: '15458' year: '2020' ... --- _id: '11952' author: - first_name: Björn full_name: Senft, Björn id: '9109' last_name: Senft - first_name: Florian full_name: Rittmeier, Florian id: '5281' last_name: Rittmeier - first_name: Holger Gerhard full_name: Fischer, Holger Gerhard id: '30457' last_name: Fischer - first_name: Simon full_name: Oberthür, Simon id: '383' last_name: Oberthür citation: ama: 'Senft B, Rittmeier F, Fischer HG, Oberthür S. A Value-Centered Approach for Unique and Novel Software Applications. In: Design, User Experience, and Usability. Practice and Case Studies. Cham; 2019. doi:10.1007/978-3-030-23535-2_27' apa: Senft, B., Rittmeier, F., Fischer, H. G., & Oberthür, S. (2019). A Value-Centered Approach for Unique and Novel Software Applications. In Design, User Experience, and Usability. Practice and Case Studies. Cham. https://doi.org/10.1007/978-3-030-23535-2_27 bibtex: '@inbook{Senft_Rittmeier_Fischer_Oberthür_2019, place={Cham}, title={A Value-Centered Approach for Unique and Novel Software Applications}, DOI={10.1007/978-3-030-23535-2_27}, booktitle={Design, User Experience, and Usability. Practice and Case Studies}, author={Senft, Björn and Rittmeier, Florian and Fischer, Holger Gerhard and Oberthür, Simon}, year={2019} }' chicago: Senft, Björn, Florian Rittmeier, Holger Gerhard Fischer, and Simon Oberthür. “A Value-Centered Approach for Unique and Novel Software Applications.” In Design, User Experience, and Usability. Practice and Case Studies. Cham, 2019. https://doi.org/10.1007/978-3-030-23535-2_27. ieee: B. Senft, F. Rittmeier, H. G. Fischer, and S. Oberthür, “A Value-Centered Approach for Unique and Novel Software Applications,” in Design, User Experience, and Usability. Practice and Case Studies, Cham, 2019. mla: Senft, Björn, et al. “A Value-Centered Approach for Unique and Novel Software Applications.” Design, User Experience, and Usability. Practice and Case Studies, 2019, doi:10.1007/978-3-030-23535-2_27. short: 'B. Senft, F. Rittmeier, H.G. Fischer, S. Oberthür, in: Design, User Experience, and Usability. Practice and Case Studies, Cham, 2019.' conference: end_date: 2019-07-31 location: Orlando, FL, USA name: 21st International Conference on Human-Computer Interaction start_date: 2019-07-26 date_created: 2019-07-14T07:57:53Z date_updated: 2022-01-06T06:51:13Z department: - _id: '66' doi: 10.1007/978-3-030-23535-2_27 language: - iso: eng place: Cham publication: Design, User Experience, and Usability. Practice and Case Studies publication_identifier: isbn: - '9783030235345' - '9783030235352' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: A Value-Centered Approach for Unique and Novel Software Applications type: book_chapter user_id: '9109' year: '2019' ... --- _id: '14890' author: - first_name: Stefan full_name: Kuhlemann, Stefan id: '38910' last_name: Kuhlemann - first_name: Meinolf full_name: Sellmann, Meinolf last_name: Sellmann - first_name: Kevin full_name: Tierney, Kevin last_name: Tierney citation: ama: 'Kuhlemann S, Sellmann M, Tierney K. Exploiting Counterfactuals for Scalable Stochastic Optimization. In: Lecture Notes in Computer Science. Cham; 2019. doi:10.1007/978-3-030-30048-7_40' apa: Kuhlemann, S., Sellmann, M., & Tierney, K. (2019). Exploiting Counterfactuals for Scalable Stochastic Optimization. In Lecture Notes in Computer Science. Cham. https://doi.org/10.1007/978-3-030-30048-7_40 bibtex: '@inbook{Kuhlemann_Sellmann_Tierney_2019, place={Cham}, title={Exploiting Counterfactuals for Scalable Stochastic Optimization}, DOI={10.1007/978-3-030-30048-7_40}, booktitle={Lecture Notes in Computer Science}, author={Kuhlemann, Stefan and Sellmann, Meinolf and Tierney, Kevin}, year={2019} }' chicago: Kuhlemann, Stefan, Meinolf Sellmann, and Kevin Tierney. “Exploiting Counterfactuals for Scalable Stochastic Optimization.” In Lecture Notes in Computer Science. Cham, 2019. https://doi.org/10.1007/978-3-030-30048-7_40. ieee: S. Kuhlemann, M. Sellmann, and K. Tierney, “Exploiting Counterfactuals for Scalable Stochastic Optimization,” in Lecture Notes in Computer Science, Cham, 2019. mla: Kuhlemann, Stefan, et al. “Exploiting Counterfactuals for Scalable Stochastic Optimization.” Lecture Notes in Computer Science, 2019, doi:10.1007/978-3-030-30048-7_40. short: 'S. Kuhlemann, M. Sellmann, K. Tierney, in: Lecture Notes in Computer Science, Cham, 2019.' date_created: 2019-11-12T07:45:53Z date_updated: 2022-01-06T06:52:09Z department: - _id: '277' doi: 10.1007/978-3-030-30048-7_40 language: - iso: eng place: Cham publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783030300470' - '9783030300487' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Exploiting Counterfactuals for Scalable Stochastic Optimization type: book_chapter user_id: '38910' year: '2019' ... --- _id: '15004' author: - first_name: Mohsen full_name: Ahmadi Fahandar, Mohsen id: '59547' last_name: Ahmadi Fahandar - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Ahmadi Fahandar M, Hüllermeier E. Feature Selection for Analogy-Based Learning to Rank. In: Discovery Science. Cham; 2019. doi:10.1007/978-3-030-33778-0_22' apa: Ahmadi Fahandar, M., & Hüllermeier, E. (2019). Feature Selection for Analogy-Based Learning to Rank. In Discovery Science. Cham. https://doi.org/10.1007/978-3-030-33778-0_22 bibtex: '@inbook{Ahmadi Fahandar_Hüllermeier_2019, place={Cham}, title={Feature Selection for Analogy-Based Learning to Rank}, DOI={10.1007/978-3-030-33778-0_22}, booktitle={Discovery Science}, author={Ahmadi Fahandar, Mohsen and Hüllermeier, Eyke}, year={2019} }' chicago: Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Feature Selection for Analogy-Based Learning to Rank.” In Discovery Science. Cham, 2019. https://doi.org/10.1007/978-3-030-33778-0_22. ieee: M. Ahmadi Fahandar and E. Hüllermeier, “Feature Selection for Analogy-Based Learning to Rank,” in Discovery Science, Cham, 2019. mla: Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Feature Selection for Analogy-Based Learning to Rank.” Discovery Science, 2019, doi:10.1007/978-3-030-33778-0_22. short: 'M. Ahmadi Fahandar, E. Hüllermeier, in: Discovery Science, Cham, 2019.' date_created: 2019-11-15T10:24:45Z date_updated: 2022-01-06T06:52:14Z department: - _id: '34' - _id: '355' doi: 10.1007/978-3-030-33778-0_22 language: - iso: eng place: Cham publication: Discovery Science publication_identifier: isbn: - '9783030337773' - '9783030337780' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Feature Selection for Analogy-Based Learning to Rank type: book_chapter user_id: '315' year: '2019' ... --- _id: '15005' author: - first_name: Mohsen full_name: Ahmadi Fahandar, Mohsen id: '59547' last_name: Ahmadi Fahandar - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Ahmadi Fahandar M, Hüllermeier E. Analogy-Based Preference Learning with Kernels. In: KI 2019: Advances in Artificial Intelligence. Cham; 2019. doi:10.1007/978-3-030-30179-8_3' apa: 'Ahmadi Fahandar, M., & Hüllermeier, E. (2019). Analogy-Based Preference Learning with Kernels. In KI 2019: Advances in Artificial Intelligence. Cham. https://doi.org/10.1007/978-3-030-30179-8_3' bibtex: '@inbook{Ahmadi Fahandar_Hüllermeier_2019, place={Cham}, title={Analogy-Based Preference Learning with Kernels}, DOI={10.1007/978-3-030-30179-8_3}, booktitle={KI 2019: Advances in Artificial Intelligence}, author={Ahmadi Fahandar, Mohsen and Hüllermeier, Eyke}, year={2019} }' chicago: 'Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Analogy-Based Preference Learning with Kernels.” In KI 2019: Advances in Artificial Intelligence. Cham, 2019. https://doi.org/10.1007/978-3-030-30179-8_3.' ieee: 'M. Ahmadi Fahandar and E. Hüllermeier, “Analogy-Based Preference Learning with Kernels,” in KI 2019: Advances in Artificial Intelligence, Cham, 2019.' mla: 'Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Analogy-Based Preference Learning with Kernels.” KI 2019: Advances in Artificial Intelligence, 2019, doi:10.1007/978-3-030-30179-8_3.' short: 'M. Ahmadi Fahandar, E. Hüllermeier, in: KI 2019: Advances in Artificial Intelligence, Cham, 2019.' date_created: 2019-11-15T10:30:10Z date_updated: 2022-01-06T06:52:14Z department: - _id: '34' - _id: '355' doi: 10.1007/978-3-030-30179-8_3 language: - iso: eng place: Cham publication: 'KI 2019: Advances in Artificial Intelligence' publication_identifier: isbn: - '9783030301781' - '9783030301798' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Analogy-Based Preference Learning with Kernels type: book_chapter user_id: '315' year: '2019' ...