[{"file_date_updated":"2023-06-21T13:22:59Z","language":[{"iso":"eng"}],"ddc":["600","370"],"department":[{"_id":"300"}],"user_id":"76955","_id":"45653","status":"public","file":[{"date_updated":"2023-06-21T13:22:59Z","date_created":"2023-06-16T07:16:21Z","creator":"maver001","file_size":957407,"access_level":"local","file_name":"267-Artikeltext-1208-1-10-20230419.pdf","file_id":"45654","content_type":"application/pdf","relation":"main_file"}],"type":"conference_abstract","doi":"https://doi.org/10.48513/joted.v11i2.267 ","conference":{"end_date":"2022-11-25","location":"Stuttgart","name":"7. Technikdidaktik-Symposium ","start_date":"2022-11-23"},"title":"Industrie 4.0 in der beruflichen Bildung – Automatisierter Maschinenbaulernbetrieb Paderborn ","author":[{"first_name":"Mats","full_name":"Vernholz, Mats","id":"76955","orcid":"0000-0001-5175-357X","last_name":"Vernholz"}],"date_created":"2023-06-16T07:17:47Z","date_updated":"2023-06-21T13:23:00Z","citation":{"chicago":"Vernholz, Mats. “Industrie 4.0 in Der Beruflichen Bildung – Automatisierter Maschinenbaulernbetrieb Paderborn ,” 2022. <a href=\"https://doi.org/10.48513/joted.v11i2.267 \">https://doi.org/10.48513/joted.v11i2.267 </a>.","ieee":"M. Vernholz, “Industrie 4.0 in der beruflichen Bildung – Automatisierter Maschinenbaulernbetrieb Paderborn ,” presented at the 7. Technikdidaktik-Symposium , Stuttgart, 2022, doi: <a href=\"https://doi.org/10.48513/joted.v11i2.267 \">https://doi.org/10.48513/joted.v11i2.267 </a>.","ama":"Vernholz M. Industrie 4.0 in der beruflichen Bildung – Automatisierter Maschinenbaulernbetrieb Paderborn . In: ; 2022. doi:<a href=\"https://doi.org/10.48513/joted.v11i2.267 \">https://doi.org/10.48513/joted.v11i2.267 </a>","apa":"Vernholz, M. (2022). <i>Industrie 4.0 in der beruflichen Bildung – Automatisierter Maschinenbaulernbetrieb Paderborn </i>. 7. Technikdidaktik-Symposium , Stuttgart. <a href=\"https://doi.org/10.48513/joted.v11i2.267 \">https://doi.org/10.48513/joted.v11i2.267 </a>","bibtex":"@inproceedings{Vernholz_2022, title={Industrie 4.0 in der beruflichen Bildung – Automatisierter Maschinenbaulernbetrieb Paderborn }, DOI={<a href=\"https://doi.org/10.48513/joted.v11i2.267 \">https://doi.org/10.48513/joted.v11i2.267 </a>}, author={Vernholz, Mats}, year={2022} }","mla":"Vernholz, Mats. <i>Industrie 4.0 in Der Beruflichen Bildung – Automatisierter Maschinenbaulernbetrieb Paderborn </i>. 2022, doi:<a href=\"https://doi.org/10.48513/joted.v11i2.267 \">https://doi.org/10.48513/joted.v11i2.267 </a>.","short":"M. Vernholz, in: 2022."},"year":"2022","has_accepted_license":"1"},{"author":[{"first_name":"Vanessa Ingrid","full_name":"Tcheussi Ngayap, Vanessa Ingrid","last_name":"Tcheussi Ngayap"}],"supervisor":[{"first_name":"Lennart","orcid":"0000-0003-3789-6034","last_name":"Clausing","id":"74287","full_name":"Clausing, Lennart"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"last_name":"Hellebrand","orcid":"0000-0002-3717-3939","id":"209","full_name":"Hellebrand, Sybille","first_name":"Sybille"}],"date_created":"2023-06-22T12:04:57Z","date_updated":"2023-06-22T12:07:53Z","title":"FreeRTOS on a MicroBlaze Soft-Core Processor with Hardware Accelerators","citation":{"ama":"Tcheussi Ngayap VI. <i>FreeRTOS on a MicroBlaze Soft-Core Processor with Hardware Accelerators</i>.; 2022.","chicago":"Tcheussi Ngayap, Vanessa Ingrid. <i>FreeRTOS on a MicroBlaze Soft-Core Processor with Hardware Accelerators</i>, 2022.","ieee":"V. I. Tcheussi Ngayap, <i>FreeRTOS on a MicroBlaze Soft-Core Processor with Hardware Accelerators</i>. 2022.","apa":"Tcheussi Ngayap, V. I. (2022). <i>FreeRTOS on a MicroBlaze Soft-Core Processor with Hardware Accelerators</i>.","short":"V.I. Tcheussi Ngayap, FreeRTOS on a MicroBlaze Soft-Core Processor with Hardware Accelerators, 2022.","bibtex":"@book{Tcheussi Ngayap_2022, title={FreeRTOS on a MicroBlaze Soft-Core Processor with Hardware Accelerators}, author={Tcheussi Ngayap, Vanessa Ingrid}, year={2022} }","mla":"Tcheussi Ngayap, Vanessa Ingrid. <i>FreeRTOS on a MicroBlaze Soft-Core Processor with Hardware Accelerators</i>. 2022."},"year":"2022","department":[{"_id":"78"}],"user_id":"74287","_id":"45715","project":[{"_id":"83","name":"SFB 901 - T1: SFB 901 -Subproject T1"},{"_id":"82","name":"SFB 901 - T: SFB 901 - Project Area T"},{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public"},{"status":"public","type":"book_chapter","publication":"The Semantic Web: ESWC 2022 Satellite Events","language":[{"iso":"eng"}],"user_id":"72768","department":[{"_id":"574"}],"_id":"33738","citation":{"ama":"Zahera HMA, Heindorf S, Balke S, et al. Tab2Onto: Unsupervised Semantification with Knowledge Graph Embeddings. In: <i>The Semantic Web: ESWC 2022 Satellite Events</i>. Springer International Publishing; 2022. doi:<a href=\"https://doi.org/10.1007/978-3-031-11609-4_9\">10.1007/978-3-031-11609-4_9</a>","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 <i>The Semantic Web: ESWC 2022 Satellite Events</i>. Cham: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-031-11609-4_9\">https://doi.org/10.1007/978-3-031-11609-4_9</a>.","ieee":"H. M. A. Zahera <i>et al.</i>, “Tab2Onto: Unsupervised Semantification with Knowledge Graph Embeddings,” in <i>The Semantic Web: ESWC 2022 Satellite Events</i>, Cham: Springer International Publishing, 2022.","apa":"Zahera, H. M. A., Heindorf, S., Balke, S., Haupt, J., Voigt, M., Walter, C., Witter, F., &#38; Ngonga Ngomo, A.-C. (2022). Tab2Onto: Unsupervised Semantification with Knowledge Graph Embeddings. In <i>The Semantic Web: ESWC 2022 Satellite Events</i>. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-031-11609-4_9\">https://doi.org/10.1007/978-3-031-11609-4_9</a>","bibtex":"@inbook{Zahera_Heindorf_Balke_Haupt_Voigt_Walter_Witter_Ngonga Ngomo_2022, place={Cham}, title={Tab2Onto: Unsupervised Semantification with Knowledge Graph Embeddings}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-11609-4_9\">10.1007/978-3-031-11609-4_9</a>}, 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} }","mla":"Zahera, Hamada Mohamed Abdelsamee, et al. “Tab2Onto: Unsupervised Semantification with Knowledge Graph Embeddings.” <i>The Semantic Web: ESWC 2022 Satellite Events</i>, Springer International Publishing, 2022, doi:<a href=\"https://doi.org/10.1007/978-3-031-11609-4_9\">10.1007/978-3-031-11609-4_9</a>.","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."},"place":"Cham","year":"2022","publication_status":"published","publication_identifier":{"isbn":["9783031116087","9783031116094"],"issn":["0302-9743","1611-3349"]},"main_file_link":[{"url":"https://2022.eswc-conferences.org/wp-content/uploads/2022/05/pd_Zahera_et_al_paper_230.pdf","open_access":"1"}],"doi":"10.1007/978-3-031-11609-4_9","title":"Tab2Onto: Unsupervised Semantification with Knowledge Graph Embeddings","date_created":"2022-10-15T19:25:42Z","author":[{"first_name":"Hamada Mohamed Abdelsamee","id":"72768","full_name":"Zahera, Hamada Mohamed Abdelsamee","last_name":"Zahera","orcid":"0000-0003-0215-1278"},{"last_name":"Heindorf","orcid":"0000-0002-4525-6865","id":"11871","full_name":"Heindorf, Stefan","first_name":"Stefan"},{"full_name":"Balke, Stefan","last_name":"Balke","first_name":"Stefan"},{"last_name":"Haupt","full_name":"Haupt, Jonas","first_name":"Jonas"},{"first_name":"Martin","full_name":"Voigt, Martin","last_name":"Voigt"},{"full_name":"Walter, Carolin","last_name":"Walter","first_name":"Carolin"},{"full_name":"Witter, Fabian","last_name":"Witter","first_name":"Fabian"},{"last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716","first_name":"Axel-Cyrille"}],"publisher":"Springer International Publishing","oa":"1","date_updated":"2023-06-23T09:20:20Z"},{"publication":"ESWC","type":"conference","status":"public","abstract":[{"lang":"eng","text":"Concept learning approaches based on refinement operators explore partially ordered solution spaces to compute concepts, which are used as binary classification models for individuals. However, the number of concepts explored by these approaches can grow to the millions for complex learning problems. This often leads to impractical runtimes. We propose to alleviate this problem by predicting the length of target concepts before the exploration of the solution space. By these means, we can prune the search space during concept learning. To achieve this goal, we compare four neural architectures and evaluate them on four benchmarks. Our evaluation results suggest that recurrent neural network architectures perform best at concept length prediction with a macro F-measure ranging from 38% to 92%. We then extend the CELOE algorithm, which learns ALC concepts, with our concept length predictor. Our extension yields the algorithm CLIP. In our experiments, CLIP is at least 7.5 times faster than other state-of-the-art concept learning algorithms for ALC---including CELOE---and achieves significant improvements in the F-measure of the concepts learned on 3 out of 4 datasets. For reproducibility, we provide our implementation in the public GitHub repository at https://github.com/dice-group/LearnALCLengths"}],"department":[{"_id":"34"}],"user_id":"87189","_id":"31257","language":[{"iso":"eng"}],"keyword":["dice knowgraphs raki daikiri kouagou heindorf demir ngonga"],"related_material":{"link":[{"relation":"confirmation","url":"http://arxiv.org/abs/2107.04911"}]},"page":"236 - 252","intvolume":"     13261","citation":{"apa":"Kouagou, N. J., Heindorf, S., Demir, C., &#38; Ngomo, N. A.-C. (2022). Learning Concept Lengths Accelerates Concept Learning in ALC. <i>ESWC</i>, <i>13261</i>, 236–252.","mla":"Kouagou, N’Dah Jean, et al. “Learning Concept Lengths Accelerates Concept Learning in ALC.” <i>ESWC</i>, vol. 13261, Springer, 2022, pp. 236–52.","short":"N.J. Kouagou, S. Heindorf, C. Demir, N.A.-C. Ngomo, in: ESWC, Springer, 2022, pp. 236–252.","bibtex":"@inproceedings{Kouagou_Heindorf_Demir_Ngomo_2022, title={Learning Concept Lengths Accelerates Concept Learning in ALC}, volume={13261}, booktitle={ESWC}, publisher={Springer}, author={Kouagou, N’Dah Jean and Heindorf, Stefan and Demir, Caglar and Ngomo, Ngonga Axel-Cyrille}, year={2022}, pages={236–252} }","ama":"Kouagou NJ, Heindorf S, Demir C, Ngomo NA-C. Learning Concept Lengths Accelerates Concept Learning in ALC. In: <i>ESWC</i>. Vol 13261. Springer; 2022:236-252.","ieee":"N. J. Kouagou, S. Heindorf, C. Demir, and N. A.-C. Ngomo, “Learning Concept Lengths Accelerates Concept Learning in ALC,” in <i>ESWC</i>, Hersonissos, Crete, Greece, 2022, vol. 13261, pp. 236–252.","chicago":"Kouagou, N’Dah Jean, Stefan Heindorf, Caglar Demir, and Ngonga Axel-Cyrille Ngomo. “Learning Concept Lengths Accelerates Concept Learning in ALC.” In <i>ESWC</i>, 13261:236–52. Springer, 2022."},"year":"2022","volume":13261,"date_created":"2022-05-17T09:55:25Z","author":[{"full_name":"Kouagou, N’Dah Jean","last_name":"Kouagou","first_name":"N’Dah Jean"},{"first_name":"Stefan","full_name":"Heindorf, Stefan","last_name":"Heindorf"},{"first_name":"Caglar","full_name":"Demir, Caglar","last_name":"Demir"},{"first_name":"Ngonga Axel-Cyrille","full_name":"Ngomo, Ngonga Axel-Cyrille","last_name":"Ngomo"}],"date_updated":"2023-06-27T10:23:10Z","publisher":"Springer","conference":{"end_date":"2022-06-02","location":"Hersonissos, Crete, Greece","name":"Extended Semantic Web Conference (ESWC)","start_date":"2022-05-29"},"main_file_link":[{"url":"http://arxiv.org/abs/2107.04911"}],"title":"Learning Concept Lengths Accelerates Concept Learning in ALC"},{"project":[{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"33739","user_id":"11871","department":[{"_id":"574"},{"_id":"760"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 29th International Conference on Computational Linguistics","abstract":[{"text":"At least 5% of questions submitted to search engines ask about cause-effect relationships in some way. To support the development of tailored approaches that can answer such questions, we construct Webis-CausalQA-22, a benchmark corpus of 1.1 million causal questions with answers. We distinguish different types of causal questions using a novel typology derived from a data-driven, manual analysis of questions from ten large question answering (QA) datasets. Using high-precision lexical rules, we extract causal questions of each type from these datasets to create our corpus. As an initial baseline, the state-of-the-art QA model UnifiedQA achieves a ROUGE-L F1 score of 0.48 on our new benchmark.","lang":"eng"}],"status":"public","oa":"1","publisher":"International Committee on Computational Linguistics","date_updated":"2023-07-02T18:14:01Z","author":[{"full_name":"Bondarenko, Alexander","last_name":"Bondarenko","first_name":"Alexander"},{"first_name":"Magdalena","full_name":"Wolska, Magdalena","last_name":"Wolska"},{"first_name":"Stefan","orcid":"0000-0002-4525-6865","last_name":"Heindorf","full_name":"Heindorf, Stefan","id":"11871"},{"first_name":"Lukas","last_name":"Blübaum","full_name":"Blübaum, Lukas"},{"id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"},{"first_name":"Benno","full_name":"Stein, Benno","last_name":"Stein"},{"first_name":"Pavel","full_name":"Braslavski, Pavel","last_name":"Braslavski"},{"first_name":"Matthias","full_name":"Hagen, Matthias","last_name":"Hagen"},{"first_name":"Martin","full_name":"Potthast, Martin","last_name":"Potthast"}],"date_created":"2022-10-15T19:33:10Z","title":"CausalQA: A Benchmark for Causal Question Answering","main_file_link":[{"open_access":"1","url":"https://aclanthology.org/2022.coling-1.291.pdf"}],"year":"2022","place":"Gyeongju, Republic of Korea","citation":{"ama":"Bondarenko A, Wolska M, Heindorf S, et al. CausalQA: A Benchmark for Causal Question Answering. In: <i>Proceedings of the 29th International Conference on Computational Linguistics</i>. International Committee on Computational Linguistics; 2022:3296–3308.","chicago":"Bondarenko, Alexander, Magdalena Wolska, Stefan Heindorf, Lukas Blübaum, Axel-Cyrille Ngonga Ngomo, Benno Stein, Pavel Braslavski, Matthias Hagen, and Martin Potthast. “CausalQA: A Benchmark for Causal Question Answering.” In <i>Proceedings of the 29th International Conference on Computational Linguistics</i>, 3296–3308. Gyeongju, Republic of Korea: International Committee on Computational Linguistics, 2022.","ieee":"A. Bondarenko <i>et al.</i>, “CausalQA: A Benchmark for Causal Question Answering,” in <i>Proceedings of the 29th International Conference on Computational Linguistics</i>, 2022, pp. 3296–3308.","apa":"Bondarenko, A., Wolska, M., Heindorf, S., Blübaum, L., Ngonga Ngomo, A.-C., Stein, B., Braslavski, P., Hagen, M., &#38; Potthast, M. (2022). CausalQA: A Benchmark for Causal Question Answering. <i>Proceedings of the 29th International Conference on Computational Linguistics</i>, 3296–3308.","short":"A. Bondarenko, M. Wolska, S. Heindorf, L. Blübaum, A.-C. Ngonga Ngomo, B. Stein, P. Braslavski, M. Hagen, M. Potthast, in: Proceedings of the 29th International Conference on Computational Linguistics, International Committee on Computational Linguistics, Gyeongju, Republic of Korea, 2022, pp. 3296–3308.","bibtex":"@inproceedings{Bondarenko_Wolska_Heindorf_Blübaum_Ngonga Ngomo_Stein_Braslavski_Hagen_Potthast_2022, place={Gyeongju, Republic of Korea}, title={CausalQA: A Benchmark for Causal Question Answering}, booktitle={Proceedings of the 29th International Conference on Computational Linguistics}, publisher={International Committee on Computational Linguistics}, author={Bondarenko, Alexander and Wolska, Magdalena and Heindorf, Stefan and Blübaum, Lukas and Ngonga Ngomo, Axel-Cyrille and Stein, Benno and Braslavski, Pavel and Hagen, Matthias and Potthast, Martin}, year={2022}, pages={3296–3308} }","mla":"Bondarenko, Alexander, et al. “CausalQA: A Benchmark for Causal Question Answering.” <i>Proceedings of the 29th International Conference on Computational Linguistics</i>, International Committee on Computational Linguistics, 2022, pp. 3296–3308."},"page":"3296–3308"},{"language":[{"iso":"eng"}],"keyword":["General Mathematics"],"department":[{"_id":"102"}],"user_id":"93826","_id":"45854","status":"public","abstract":[{"lang":"eng","text":"In a previous paper the authors developed an algorithm to classify certain quaternary quadratic lattices over totally real fields. The present article applies this algorithm to the classification of binary Hermitian lattices over totally imaginary fields. We use it in particular to classify the 48-dimensional extremal even unimodular lattices over the integers that admit a semilarge automorphism."}],"publication":"Experimental Mathematics","type":"journal_article","doi":"10.1080/10586458.2019.1618756","title":"Binary Hermitian Lattices over Number Fields","volume":31,"date_created":"2023-07-04T08:28:04Z","author":[{"first_name":"Markus","full_name":"Kirschmer, Markus","id":"82258","last_name":"Kirschmer"},{"last_name":"Nebe","full_name":"Nebe, Gabriele","first_name":"Gabriele"}],"publisher":"Informa UK Limited","date_updated":"2023-07-04T08:29:22Z","intvolume":"        31","page":"280-301","citation":{"apa":"Kirschmer, M., &#38; Nebe, G. (2022). Binary Hermitian Lattices over Number Fields. <i>Experimental Mathematics</i>, <i>31</i>(1), 280–301. <a href=\"https://doi.org/10.1080/10586458.2019.1618756\">https://doi.org/10.1080/10586458.2019.1618756</a>","short":"M. Kirschmer, G. Nebe, Experimental Mathematics 31 (2022) 280–301.","mla":"Kirschmer, Markus, and Gabriele Nebe. “Binary Hermitian Lattices over Number Fields.” <i>Experimental Mathematics</i>, vol. 31, no. 1, Informa UK Limited, 2022, pp. 280–301, doi:<a href=\"https://doi.org/10.1080/10586458.2019.1618756\">10.1080/10586458.2019.1618756</a>.","bibtex":"@article{Kirschmer_Nebe_2022, title={Binary Hermitian Lattices over Number Fields}, volume={31}, DOI={<a href=\"https://doi.org/10.1080/10586458.2019.1618756\">10.1080/10586458.2019.1618756</a>}, number={1}, journal={Experimental Mathematics}, publisher={Informa UK Limited}, author={Kirschmer, Markus and Nebe, Gabriele}, year={2022}, pages={280–301} }","ama":"Kirschmer M, Nebe G. Binary Hermitian Lattices over Number Fields. <i>Experimental Mathematics</i>. 2022;31(1):280-301. doi:<a href=\"https://doi.org/10.1080/10586458.2019.1618756\">10.1080/10586458.2019.1618756</a>","ieee":"M. Kirschmer and G. Nebe, “Binary Hermitian Lattices over Number Fields,” <i>Experimental Mathematics</i>, vol. 31, no. 1, pp. 280–301, 2022, doi: <a href=\"https://doi.org/10.1080/10586458.2019.1618756\">10.1080/10586458.2019.1618756</a>.","chicago":"Kirschmer, Markus, and Gabriele Nebe. “Binary Hermitian Lattices over Number Fields.” <i>Experimental Mathematics</i> 31, no. 1 (2022): 280–301. <a href=\"https://doi.org/10.1080/10586458.2019.1618756\">https://doi.org/10.1080/10586458.2019.1618756</a>."},"year":"2022","issue":"1","publication_identifier":{"issn":["1058-6458","1944-950X"]},"publication_status":"published"},{"citation":{"ama":"Palushi J. <i>Domain-Aware Text Professionalization Using Sequence-to-Sequence Neural Networks</i>.; 2022.","chicago":"Palushi, Juela. <i>Domain-Aware Text Professionalization Using Sequence-to-Sequence Neural Networks</i>, 2022.","ieee":"J. Palushi, <i>Domain-aware Text Professionalization using Sequence-to-Sequence Neural Networks</i>. 2022.","bibtex":"@book{Palushi_2022, title={Domain-aware Text Professionalization using Sequence-to-Sequence Neural Networks}, author={Palushi, Juela}, year={2022} }","short":"J. Palushi, Domain-Aware Text Professionalization Using Sequence-to-Sequence Neural Networks, 2022.","mla":"Palushi, Juela. <i>Domain-Aware Text Professionalization Using Sequence-to-Sequence Neural Networks</i>. 2022.","apa":"Palushi, J. (2022). <i>Domain-aware Text Professionalization using Sequence-to-Sequence Neural Networks</i>."},"year":"2022","author":[{"last_name":"Palushi","full_name":"Palushi, Juela","first_name":"Juela"}],"supervisor":[{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900","first_name":"Henning"}],"date_created":"2023-06-27T12:57:57Z","date_updated":"2023-07-05T07:31:17Z","title":"Domain-aware Text Professionalization using Sequence-to-Sequence Neural Networks","type":"bachelorsthesis","status":"public","user_id":"477","department":[{"_id":"600"}],"project":[{"grant_number":"160364472","_id":"9","name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)"},{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}],"_id":"45790","language":[{"iso":"eng"}]},{"title":"Propaganda Technique Detection Using Connotation Frames","supervisor":[{"first_name":"Henning","last_name":"Wachsmuth","id":"3900","full_name":"Wachsmuth, Henning"}],"date_created":"2023-06-27T12:56:04Z","author":[{"first_name":"Vinaykumar","last_name":"Budanurmath","full_name":"Budanurmath, Vinaykumar"}],"date_updated":"2023-07-05T07:33:45Z","citation":{"ama":"Budanurmath V. <i>Propaganda Technique Detection Using Connotation Frames</i>.; 2022.","ieee":"V. Budanurmath, <i>Propaganda Technique Detection Using Connotation Frames</i>. 2022.","chicago":"Budanurmath, Vinaykumar. <i>Propaganda Technique Detection Using Connotation Frames</i>, 2022.","apa":"Budanurmath, V. (2022). <i>Propaganda Technique Detection Using Connotation Frames</i>.","bibtex":"@book{Budanurmath_2022, title={Propaganda Technique Detection Using Connotation Frames}, author={Budanurmath, Vinaykumar}, year={2022} }","short":"V. Budanurmath, Propaganda Technique Detection Using Connotation Frames, 2022.","mla":"Budanurmath, Vinaykumar. <i>Propaganda Technique Detection Using Connotation Frames</i>. 2022."},"year":"2022","language":[{"iso":"eng"}],"department":[{"_id":"600"}],"user_id":"477","_id":"45789","project":[{"_id":"9","name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)","grant_number":"160364472"},{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"}],"status":"public","type":"mastersthesis"},{"citation":{"short":"S. Manjunatha, Dealing With Pre-Processing And Feature Extraction Of Time-Series Data In  Predictive Maintenance, Paderborn University , 2022.","mla":"Manjunatha, Suraj. <i>Dealing With Pre-Processing And Feature Extraction Of Time-Series Data In  Predictive Maintenance</i>. Paderborn University , 2022.","bibtex":"@book{Manjunatha_2022, title={Dealing With Pre-Processing And Feature Extraction Of Time-Series Data In  Predictive Maintenance}, publisher={Paderborn University }, author={Manjunatha, Suraj}, year={2022} }","apa":"Manjunatha, S. (2022). <i>Dealing With Pre-Processing And Feature Extraction Of Time-Series Data In  Predictive Maintenance</i>. Paderborn University .","ama":"Manjunatha S. <i>Dealing With Pre-Processing And Feature Extraction Of Time-Series Data In  Predictive Maintenance</i>. Paderborn University ; 2022.","ieee":"S. Manjunatha, <i>Dealing With Pre-Processing And Feature Extraction Of Time-Series Data In  Predictive Maintenance</i>. Paderborn University , 2022.","chicago":"Manjunatha, Suraj. <i>Dealing With Pre-Processing And Feature Extraction Of Time-Series Data In  Predictive Maintenance</i>. Paderborn University , 2022."},"year":"2022","title":"Dealing With Pre-Processing And Feature Extraction Of Time-Series Data In  Predictive Maintenance","date_created":"2023-07-09T12:54:08Z","supervisor":[{"first_name":"Marco ","last_name":"Platzner","full_name":"Platzner, Marco "}],"author":[{"full_name":"Manjunatha, Suraj","last_name":"Manjunatha","first_name":"Suraj"}],"date_updated":"2023-07-09T13:05:11Z","publisher":"Paderborn University ","status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"department":[{"_id":"78"}],"user_id":"398","_id":"45914","project":[{"name":"SFB 901 - T1: SFB 901 -Subproject T1","_id":"83"},{"_id":"82","name":"SFB 901 - T: SFB 901 - Project Area T"},{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"}]},{"project":[{"_id":"83","name":"SFB 901 - T1: SFB 901 -Subproject T1"},{"_id":"82","name":"SFB 901 - T: SFB 901 - Project Area T"},{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"}],"_id":"45915","user_id":"398","department":[{"_id":"78"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","date_updated":"2023-07-09T13:05:55Z","author":[{"full_name":"Kaur , Parvinder","last_name":"Kaur ","first_name":"Parvinder"}],"supervisor":[{"full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"date_created":"2023-07-09T12:58:06Z","title":"Analysis of Time-Series Classification in Conditional Monitoring Systems","year":"2022","place":"Paderborn University ","citation":{"ama":"Kaur  P. <i>Analysis of Time-Series Classification in Conditional Monitoring Systems</i>.; 2022.","chicago":"Kaur , Parvinder. <i>Analysis of Time-Series Classification in Conditional Monitoring Systems</i>. Paderborn University , 2022.","ieee":"P. Kaur , <i>Analysis of Time-Series Classification in Conditional Monitoring Systems</i>. Paderborn University , 2022.","short":"P. Kaur , Analysis of Time-Series Classification in Conditional Monitoring Systems, Paderborn University , 2022.","mla":"Kaur , Parvinder. <i>Analysis of Time-Series Classification in Conditional Monitoring Systems</i>. 2022.","bibtex":"@book{Kaur _2022, place={Paderborn University }, title={Analysis of Time-Series Classification in Conditional Monitoring Systems}, author={Kaur , Parvinder}, year={2022} }","apa":"Kaur , P. (2022). <i>Analysis of Time-Series Classification in Conditional Monitoring Systems</i>."}},{"language":[{"iso":"eng"}],"article_number":"96","keyword":["Applied Mathematics","Analysis"],"user_id":"23686","department":[{"_id":"34"},{"_id":"10"},{"_id":"90"}],"_id":"34677","status":"public","type":"journal_article","publication":"Calculus of Variations and Partial Differential Equations","doi":"10.1007/s00526-022-02201-y","title":"Prescribed signal concentration on the boundary: eventual smoothness in a chemotaxis-Navier–Stokes system with logistic proliferation","date_created":"2022-12-21T09:50:59Z","author":[{"full_name":"Black, Tobias","id":"23686","last_name":"Black","orcid":"0000-0001-9963-0800","first_name":"Tobias"},{"first_name":"Chunyan","last_name":"Wu","full_name":"Wu, Chunyan"}],"volume":61,"date_updated":"2023-07-10T11:37:27Z","publisher":"Springer Science and Business Media LLC","citation":{"ieee":"T. Black and C. Wu, “Prescribed signal concentration on the boundary: eventual smoothness in a chemotaxis-Navier–Stokes system with logistic proliferation,” <i>Calculus of Variations and Partial Differential Equations</i>, vol. 61, no. 3, Art. no. 96, 2022, doi: <a href=\"https://doi.org/10.1007/s00526-022-02201-y\">10.1007/s00526-022-02201-y</a>.","chicago":"Black, Tobias, and Chunyan Wu. “Prescribed Signal Concentration on the Boundary: Eventual Smoothness in a Chemotaxis-Navier–Stokes System with Logistic Proliferation.” <i>Calculus of Variations and Partial Differential Equations</i> 61, no. 3 (2022). <a href=\"https://doi.org/10.1007/s00526-022-02201-y\">https://doi.org/10.1007/s00526-022-02201-y</a>.","ama":"Black T, Wu C. Prescribed signal concentration on the boundary: eventual smoothness in a chemotaxis-Navier–Stokes system with logistic proliferation. <i>Calculus of Variations and Partial Differential Equations</i>. 2022;61(3). doi:<a href=\"https://doi.org/10.1007/s00526-022-02201-y\">10.1007/s00526-022-02201-y</a>","bibtex":"@article{Black_Wu_2022, title={Prescribed signal concentration on the boundary: eventual smoothness in a chemotaxis-Navier–Stokes system with logistic proliferation}, volume={61}, DOI={<a href=\"https://doi.org/10.1007/s00526-022-02201-y\">10.1007/s00526-022-02201-y</a>}, number={396}, journal={Calculus of Variations and Partial Differential Equations}, publisher={Springer Science and Business Media LLC}, author={Black, Tobias and Wu, Chunyan}, year={2022} }","short":"T. Black, C. Wu, Calculus of Variations and Partial Differential Equations 61 (2022).","mla":"Black, Tobias, and Chunyan Wu. “Prescribed Signal Concentration on the Boundary: Eventual Smoothness in a Chemotaxis-Navier–Stokes System with Logistic Proliferation.” <i>Calculus of Variations and Partial Differential Equations</i>, vol. 61, no. 3, 96, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s00526-022-02201-y\">10.1007/s00526-022-02201-y</a>.","apa":"Black, T., &#38; Wu, C. (2022). Prescribed signal concentration on the boundary: eventual smoothness in a chemotaxis-Navier–Stokes system with logistic proliferation. <i>Calculus of Variations and Partial Differential Equations</i>, <i>61</i>(3), Article 96. <a href=\"https://doi.org/10.1007/s00526-022-02201-y\">https://doi.org/10.1007/s00526-022-02201-y</a>"},"intvolume":"        61","year":"2022","issue":"3","publication_status":"published","publication_identifier":{"issn":["0944-2669","1432-0835"]}},{"language":[{"iso":"eng"}],"department":[{"_id":"27"},{"_id":"518"}],"user_id":"24135","_id":"33493","external_id":{"arxiv":["2209.12747"]},"project":[{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"status":"public","abstract":[{"text":"Electronic structure calculations have been instrumental in providing many\r\nimportant insights into a range of physical and chemical properties of various\r\nmolecular and solid-state systems. Their importance to various fields,\r\nincluding materials science, chemical sciences, computational chemistry and\r\ndevice physics, is underscored by the large fraction of available public\r\nsupercomputing resources devoted to these calculations. As we enter the\r\nexascale era, exciting new opportunities to increase simulation numbers, sizes,\r\nand accuracies present themselves. In order to realize these promises, the\r\ncommunity of electronic structure software developers will however first have\r\nto tackle a number of challenges pertaining to the efficient use of new\r\narchitectures that will rely heavily on massive parallelism and hardware\r\naccelerators. This roadmap provides a broad overview of the state-of-the-art in\r\nelectronic structure calculations and of the various new directions being\r\npursued by the community. It covers 14 electronic structure codes, presenting\r\ntheir current status, their development priorities over the next five years,\r\nand their plans towards tackling the challenges and leveraging the\r\nopportunities presented by the advent of exascale computing.","lang":"eng"}],"publication":"arXiv:2209.12747","type":"preprint","title":"Roadmap on Electronic Structure Codes in the Exascale Era","date_created":"2022-09-28T05:25:10Z","author":[{"first_name":"Vikram","full_name":"Gavini, Vikram","last_name":"Gavini"},{"first_name":"Stefano","last_name":"Baroni","full_name":"Baroni, Stefano"},{"full_name":"Blum, Volker","last_name":"Blum","first_name":"Volker"},{"first_name":"David R.","last_name":"Bowler","full_name":"Bowler, David R."},{"first_name":"Alexander","last_name":"Buccheri","full_name":"Buccheri, Alexander"},{"last_name":"Chelikowsky","full_name":"Chelikowsky, James R.","first_name":"James R."},{"last_name":"Das","full_name":"Das, Sambit","first_name":"Sambit"},{"first_name":"William","full_name":"Dawson, William","last_name":"Dawson"},{"first_name":"Pietro","last_name":"Delugas","full_name":"Delugas, Pietro"},{"full_name":"Dogan, Mehmet","last_name":"Dogan","first_name":"Mehmet"},{"first_name":"Claudia","last_name":"Draxl","full_name":"Draxl, Claudia"},{"first_name":"Giulia","full_name":"Galli, Giulia","last_name":"Galli"},{"first_name":"Luigi","last_name":"Genovese","full_name":"Genovese, Luigi"},{"last_name":"Giannozzi","full_name":"Giannozzi, Paolo","first_name":"Paolo"},{"first_name":"Matteo","full_name":"Giantomassi, Matteo","last_name":"Giantomassi"},{"last_name":"Gonze","full_name":"Gonze, Xavier","first_name":"Xavier"},{"last_name":"Govoni","full_name":"Govoni, Marco","first_name":"Marco"},{"full_name":"Gulans, Andris","last_name":"Gulans","first_name":"Andris"},{"first_name":"François","last_name":"Gygi","full_name":"Gygi, François"},{"last_name":"Herbert","full_name":"Herbert, John M.","first_name":"John M."},{"full_name":"Kokott, Sebastian","last_name":"Kokott","first_name":"Sebastian"},{"first_name":"Thomas","full_name":"Kühne, Thomas","id":"49079","last_name":"Kühne"},{"full_name":"Liou, Kai-Hsin","last_name":"Liou","first_name":"Kai-Hsin"},{"last_name":"Miyazaki","full_name":"Miyazaki, Tsuyoshi","first_name":"Tsuyoshi"},{"first_name":"Phani","full_name":"Motamarri, Phani","last_name":"Motamarri"},{"first_name":"Ayako","full_name":"Nakata, Ayako","last_name":"Nakata"},{"first_name":"John E.","full_name":"Pask, John E.","last_name":"Pask"},{"first_name":"Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153"},{"first_name":"Laura E.","last_name":"Ratcliff","full_name":"Ratcliff, Laura E."},{"first_name":"Ryan M.","full_name":"Richard, Ryan M.","last_name":"Richard"},{"first_name":"Mariana","last_name":"Rossi","full_name":"Rossi, Mariana"},{"first_name":"Robert","id":"75963","full_name":"Schade, Robert","last_name":"Schade","orcid":"0000-0002-6268-539"},{"last_name":"Scheffler","full_name":"Scheffler, Matthias","first_name":"Matthias"},{"first_name":"Ole","last_name":"Schütt","full_name":"Schütt, Ole"},{"first_name":"Phanish","last_name":"Suryanarayana","full_name":"Suryanarayana, Phanish"},{"first_name":"Marc","last_name":"Torrent","full_name":"Torrent, Marc"},{"full_name":"Truflandier, Lionel","last_name":"Truflandier","first_name":"Lionel"},{"last_name":"Windus","full_name":"Windus, Theresa L.","first_name":"Theresa L."},{"last_name":"Xu","full_name":"Xu, Qimen","first_name":"Qimen"},{"first_name":"Victor W. -Z.","last_name":"Yu","full_name":"Yu, Victor W. -Z."},{"full_name":"Perez, Danny","last_name":"Perez","first_name":"Danny"}],"date_updated":"2023-07-28T08:03:41Z","citation":{"chicago":"Gavini, Vikram, Stefano Baroni, Volker Blum, David R. Bowler, Alexander Buccheri, James R. Chelikowsky, Sambit Das, et al. “Roadmap on Electronic Structure Codes in the Exascale Era.” <i>ArXiv:2209.12747</i>, 2022.","ieee":"V. Gavini <i>et al.</i>, “Roadmap on Electronic Structure Codes in the Exascale Era,” <i>arXiv:2209.12747</i>. 2022.","ama":"Gavini V, Baroni S, Blum V, et al. Roadmap on Electronic Structure Codes in the Exascale Era. <i>arXiv:220912747</i>. Published online 2022.","apa":"Gavini, V., Baroni, S., Blum, V., Bowler, D. R., Buccheri, A., Chelikowsky, J. R., Das, S., Dawson, W., Delugas, P., Dogan, M., Draxl, C., Galli, G., Genovese, L., Giannozzi, P., Giantomassi, M., Gonze, X., Govoni, M., Gulans, A., Gygi, F., … Perez, D. (2022). Roadmap on Electronic Structure Codes in the Exascale Era. In <i>arXiv:2209.12747</i>.","mla":"Gavini, Vikram, et al. “Roadmap on Electronic Structure Codes in the Exascale Era.” <i>ArXiv:2209.12747</i>, 2022.","short":"V. Gavini, S. Baroni, V. Blum, D.R. Bowler, A. Buccheri, J.R. Chelikowsky, S. Das, W. Dawson, P. Delugas, M. Dogan, C. Draxl, G. Galli, L. Genovese, P. Giannozzi, M. Giantomassi, X. Gonze, M. Govoni, A. Gulans, F. Gygi, J.M. Herbert, S. Kokott, T. Kühne, K.-H. Liou, T. Miyazaki, P. Motamarri, A. Nakata, J.E. Pask, C. Plessl, L.E. Ratcliff, R.M. Richard, M. Rossi, R. Schade, M. Scheffler, O. Schütt, P. Suryanarayana, M. Torrent, L. Truflandier, T.L. Windus, Q. Xu, V.W.-Z. Yu, D. Perez, ArXiv:2209.12747 (2022).","bibtex":"@article{Gavini_Baroni_Blum_Bowler_Buccheri_Chelikowsky_Das_Dawson_Delugas_Dogan_et al._2022, title={Roadmap on Electronic Structure Codes in the Exascale Era}, journal={arXiv:2209.12747}, author={Gavini, Vikram and Baroni, Stefano and Blum, Volker and Bowler, David R. and Buccheri, Alexander and Chelikowsky, James R. and Das, Sambit and Dawson, William and Delugas, Pietro and Dogan, Mehmet and et al.}, year={2022} }"},"year":"2022"},{"publication_status":"published","quality_controlled":"1","year":"2022","citation":{"apa":"Karp, M., Podobas, A., Kenter, T., Jansson, N., Plessl, C., Schlatter, P., &#38; Markidis, S. (2022). A High-Fidelity Flow Solver for Unstructured Meshes on Field-Programmable Gate Arrays: Design, Evaluation, and Future Challenges. <i>International Conference on High Performance Computing in Asia-Pacific Region</i>. <a href=\"https://doi.org/10.1145/3492805.3492808\">https://doi.org/10.1145/3492805.3492808</a>","bibtex":"@inproceedings{Karp_Podobas_Kenter_Jansson_Plessl_Schlatter_Markidis_2022, title={A High-Fidelity Flow Solver for Unstructured Meshes on Field-Programmable Gate Arrays: Design, Evaluation, and Future Challenges}, DOI={<a href=\"https://doi.org/10.1145/3492805.3492808\">10.1145/3492805.3492808</a>}, booktitle={International Conference on High Performance Computing in Asia-Pacific Region}, publisher={ACM}, author={Karp, Martin and Podobas, Artur and Kenter, Tobias and Jansson, Niclas and Plessl, Christian and Schlatter, Philipp and Markidis, Stefano}, year={2022} }","short":"M. Karp, A. Podobas, T. Kenter, N. Jansson, C. Plessl, P. Schlatter, S. Markidis, in: International Conference on High Performance Computing in Asia-Pacific Region, ACM, 2022.","mla":"Karp, Martin, et al. “A High-Fidelity Flow Solver for Unstructured Meshes on Field-Programmable Gate Arrays: Design, Evaluation, and Future Challenges.” <i>International Conference on High Performance Computing in Asia-Pacific Region</i>, ACM, 2022, doi:<a href=\"https://doi.org/10.1145/3492805.3492808\">10.1145/3492805.3492808</a>.","chicago":"Karp, Martin, Artur Podobas, Tobias Kenter, Niclas Jansson, Christian Plessl, Philipp Schlatter, and Stefano Markidis. “A High-Fidelity Flow Solver for Unstructured Meshes on Field-Programmable Gate Arrays: Design, Evaluation, and Future Challenges.” In <i>International Conference on High Performance Computing in Asia-Pacific Region</i>. ACM, 2022. <a href=\"https://doi.org/10.1145/3492805.3492808\">https://doi.org/10.1145/3492805.3492808</a>.","ieee":"M. Karp <i>et al.</i>, “A High-Fidelity Flow Solver for Unstructured Meshes on Field-Programmable Gate Arrays: Design, Evaluation, and Future Challenges,” 2022, doi: <a href=\"https://doi.org/10.1145/3492805.3492808\">10.1145/3492805.3492808</a>.","ama":"Karp M, Podobas A, Kenter T, et al. A High-Fidelity Flow Solver for Unstructured Meshes on Field-Programmable Gate Arrays: Design, Evaluation, and Future Challenges. In: <i>International Conference on High Performance Computing in Asia-Pacific Region</i>. ACM; 2022. doi:<a href=\"https://doi.org/10.1145/3492805.3492808\">10.1145/3492805.3492808</a>"},"publisher":"ACM","date_updated":"2023-07-28T11:53:15Z","oa":"1","date_created":"2023-07-28T11:51:55Z","author":[{"first_name":"Martin","full_name":"Karp, Martin","last_name":"Karp"},{"first_name":"Artur","last_name":"Podobas","full_name":"Podobas, Artur"},{"first_name":"Tobias","id":"3145","full_name":"Kenter, Tobias","last_name":"Kenter"},{"first_name":"Niclas","last_name":"Jansson","full_name":"Jansson, Niclas"},{"last_name":"Plessl","orcid":"0000-0001-5728-9982","id":"16153","full_name":"Plessl, Christian","first_name":"Christian"},{"last_name":"Schlatter","full_name":"Schlatter, Philipp","first_name":"Philipp"},{"last_name":"Markidis","full_name":"Markidis, Stefano","first_name":"Stefano"}],"title":"A High-Fidelity Flow Solver for Unstructured Meshes on Field-Programmable Gate Arrays: Design, Evaluation, and Future Challenges","main_file_link":[{"open_access":"1","url":"https://dl.acm.org/doi/pdf/10.1145/3492805.3492808"}],"doi":"10.1145/3492805.3492808","type":"conference","publication":"International Conference on High Performance Computing in Asia-Pacific Region","status":"public","project":[{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"46193","user_id":"3145","department":[{"_id":"27"},{"_id":"518"}],"language":[{"iso":"eng"}]},{"date_updated":"2023-08-02T14:55:35Z","author":[{"first_name":"Thomas","full_name":"Kühne, Thomas","id":"49079","last_name":"Kühne"},{"first_name":"Christian","full_name":"Plessl, Christian","id":"16153","orcid":"0000-0001-5728-9982","last_name":"Plessl"},{"first_name":"Robert","last_name":"Schade","orcid":"0000-0002-6268-539","id":"75963","full_name":"Schade, Robert"},{"first_name":"Ole","full_name":"Schütt, Ole","last_name":"Schütt"}],"date_created":"2022-07-22T08:14:08Z","title":"CP2K on the road to exascale","main_file_link":[{"url":"https://arxiv.org/abs/2205.14741"}],"year":"2022","citation":{"apa":"Kühne, T., Plessl, C., Schade, R., &#38; Schütt, O. (2022). CP2K on the road to exascale. In <i>arXiv:2205.14741</i>.","mla":"Kühne, Thomas, et al. “CP2K on the Road to Exascale.” <i>ArXiv:2205.14741</i>, 2022.","short":"T. Kühne, C. Plessl, R. Schade, O. Schütt, ArXiv:2205.14741 (2022).","bibtex":"@article{Kühne_Plessl_Schade_Schütt_2022, title={CP2K on the road to exascale}, journal={arXiv:2205.14741}, author={Kühne, Thomas and Plessl, Christian and Schade, Robert and Schütt, Ole}, year={2022} }","ama":"Kühne T, Plessl C, Schade R, Schütt O. CP2K on the road to exascale. <i>arXiv:220514741</i>. Published online 2022.","chicago":"Kühne, Thomas, Christian Plessl, Robert Schade, and Ole Schütt. “CP2K on the Road to Exascale.” <i>ArXiv:2205.14741</i>, 2022.","ieee":"T. Kühne, C. Plessl, R. Schade, and O. Schütt, “CP2K on the road to exascale,” <i>arXiv:2205.14741</i>. 2022."},"project":[{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"32404","external_id":{"arxiv":["2205.14741"]},"user_id":"75963","department":[{"_id":"27"},{"_id":"518"},{"_id":"304"}],"language":[{"iso":"eng"}],"type":"preprint","publication":"arXiv:2205.14741","abstract":[{"text":"The CP2K program package, which can be considered as the swiss army knife of\r\natomistic simulations, is presented with a special emphasis on ab-initio\r\nmolecular dynamics using the second-generation Car-Parrinello method. After\r\noutlining current and near-term development efforts with regards to massively\r\nparallel low-scaling post-Hartree-Fock and eigenvalue solvers, novel approaches\r\non how we plan to take full advantage of future low-precision hardware\r\narchitectures are introduced. Our focus here is on combining our submatrix\r\nmethod with the approximate computing paradigm to address the immanent exascale\r\nera.","lang":"eng"}],"status":"public"},{"year":"2022","quality_controlled":"1","title":"Parallel quantum chemistry on noisy intermediate-scale quantum computers","date_created":"2022-08-29T14:07:01Z","publisher":"American Physical Society","abstract":[{"lang":"eng","text":"A parallel hybrid quantum-classical algorithm for the solution of the quantum-chemical ground-state energy problem on gate-based quantum computers is presented. This approach is based on the reduced density-matrix functional theory (RDMFT) formulation of the electronic structure problem. For that purpose, the density-matrix functional of the full system is decomposed into an indirectly coupled sum of density-matrix functionals for all its subsystems using the adaptive cluster approximation to RDMFT. The approximations involved in the decomposition and the adaptive cluster approximation itself can be systematically converged to the exact result. The solutions for the density-matrix functionals of the effective subsystems involves a constrained minimization over many-particle states that are approximated by parametrized trial states on the quantum computer similarly to the variational quantum eigensolver. The independence of the density-matrix functionals of the effective subsystems introduces a new level of parallelization and allows for the computational treatment of much larger molecules on a quantum computer with a given qubit count. In addition, for the proposed algorithm techniques are presented to reduce the qubit count, the number of quantum programs, as well as its depth. The evaluation of a density-matrix functional as the essential part of our approach is demonstrated for Hubbard-like systems on IBM quantum computers based on superconducting transmon qubits."}],"publication":"Phys. Rev. Research","language":[{"iso":"eng"}],"intvolume":"         4","page":"033160","citation":{"chicago":"Schade, Robert, Carsten Bauer, Konstantin Tamoev, Lukas Mazur, Christian Plessl, and Thomas Kühne. “Parallel Quantum Chemistry on Noisy Intermediate-Scale Quantum Computers.” <i>Phys. Rev. Research</i> 4 (2022): 033160. <a href=\"https://doi.org/10.1103/PhysRevResearch.4.033160\">https://doi.org/10.1103/PhysRevResearch.4.033160</a>.","ieee":"R. Schade, C. Bauer, K. Tamoev, L. Mazur, C. Plessl, and T. Kühne, “Parallel quantum chemistry on noisy intermediate-scale quantum computers,” <i>Phys. Rev. Research</i>, vol. 4, p. 033160, 2022, doi: <a href=\"https://doi.org/10.1103/PhysRevResearch.4.033160\">10.1103/PhysRevResearch.4.033160</a>.","ama":"Schade R, Bauer C, Tamoev K, Mazur L, Plessl C, Kühne T. Parallel quantum chemistry on noisy intermediate-scale quantum computers. <i>Phys Rev Research</i>. 2022;4:033160. doi:<a href=\"https://doi.org/10.1103/PhysRevResearch.4.033160\">10.1103/PhysRevResearch.4.033160</a>","apa":"Schade, R., Bauer, C., Tamoev, K., Mazur, L., Plessl, C., &#38; Kühne, T. (2022). Parallel quantum chemistry on noisy intermediate-scale quantum computers. <i>Phys. Rev. Research</i>, <i>4</i>, 033160. <a href=\"https://doi.org/10.1103/PhysRevResearch.4.033160\">https://doi.org/10.1103/PhysRevResearch.4.033160</a>","short":"R. Schade, C. Bauer, K. Tamoev, L. Mazur, C. Plessl, T. Kühne, Phys. Rev. Research 4 (2022) 033160.","bibtex":"@article{Schade_Bauer_Tamoev_Mazur_Plessl_Kühne_2022, title={Parallel quantum chemistry on noisy intermediate-scale quantum computers}, volume={4}, DOI={<a href=\"https://doi.org/10.1103/PhysRevResearch.4.033160\">10.1103/PhysRevResearch.4.033160</a>}, journal={Phys. Rev. Research}, publisher={American Physical Society}, author={Schade, Robert and Bauer, Carsten and Tamoev, Konstantin and Mazur, Lukas and Plessl, Christian and Kühne, Thomas}, year={2022}, pages={033160} }","mla":"Schade, Robert, et al. “Parallel Quantum Chemistry on Noisy Intermediate-Scale Quantum Computers.” <i>Phys. Rev. Research</i>, vol. 4, American Physical Society, 2022, p. 033160, doi:<a href=\"https://doi.org/10.1103/PhysRevResearch.4.033160\">10.1103/PhysRevResearch.4.033160</a>."},"publication_status":"published","doi":"10.1103/PhysRevResearch.4.033160","main_file_link":[{"open_access":"1","url":"https://journals.aps.org/prresearch/abstract/10.1103/PhysRevResearch.4.033160"}],"volume":4,"author":[{"first_name":"Robert","full_name":"Schade, Robert","id":"75963","last_name":"Schade","orcid":"0000-0002-6268-539"},{"last_name":"Bauer","full_name":"Bauer, Carsten","id":"90082","first_name":"Carsten"},{"last_name":"Tamoev","full_name":"Tamoev, Konstantin","id":"50177","first_name":"Konstantin"},{"first_name":"Lukas","id":"90492","full_name":"Mazur, Lukas","orcid":" 0000-0001-6304-7082","last_name":"Mazur"},{"orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153","first_name":"Christian"},{"first_name":"Thomas","full_name":"Kühne, Thomas","id":"49079","last_name":"Kühne"}],"oa":"1","date_updated":"2023-08-02T15:04:22Z","status":"public","type":"journal_article","article_type":"original","department":[{"_id":"27"},{"_id":"518"}],"user_id":"75963","_id":"33226","project":[{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}]},{"publication_status":"published","publication_identifier":{"issn":["0167-8191"]},"citation":{"bibtex":"@article{Schade_Kenter_Elgabarty_Lass_Schütt_Lazzaro_Pabst_Mohr_Hutter_Kühne_et al._2022, title={Towards electronic structure-based ab-initio molecular dynamics simulations with hundreds of millions of atoms}, volume={111}, DOI={<a href=\"https://doi.org/10.1016/j.parco.2022.102920\">10.1016/j.parco.2022.102920</a>}, number={102920}, journal={Parallel Computing}, publisher={Elsevier BV}, author={Schade, Robert and Kenter, Tobias and Elgabarty, Hossam and Lass, Michael and Schütt, Ole and Lazzaro, Alfio and Pabst, Hans and Mohr, Stephan and Hutter, Jürg and Kühne, Thomas and et al.}, year={2022} }","mla":"Schade, Robert, et al. “Towards Electronic Structure-Based Ab-Initio Molecular Dynamics Simulations with Hundreds of Millions of Atoms.” <i>Parallel Computing</i>, vol. 111, 102920, Elsevier BV, 2022, doi:<a href=\"https://doi.org/10.1016/j.parco.2022.102920\">10.1016/j.parco.2022.102920</a>.","short":"R. Schade, T. Kenter, H. Elgabarty, M. Lass, O. Schütt, A. Lazzaro, H. Pabst, S. Mohr, J. Hutter, T. Kühne, C. Plessl, Parallel Computing 111 (2022).","apa":"Schade, R., Kenter, T., Elgabarty, H., Lass, M., Schütt, O., Lazzaro, A., Pabst, H., Mohr, S., Hutter, J., Kühne, T., &#38; Plessl, C. (2022). Towards electronic structure-based ab-initio molecular dynamics simulations with hundreds of millions of atoms. <i>Parallel Computing</i>, <i>111</i>, Article 102920. <a href=\"https://doi.org/10.1016/j.parco.2022.102920\">https://doi.org/10.1016/j.parco.2022.102920</a>","chicago":"Schade, Robert, Tobias Kenter, Hossam Elgabarty, Michael Lass, Ole Schütt, Alfio Lazzaro, Hans Pabst, et al. “Towards Electronic Structure-Based Ab-Initio Molecular Dynamics Simulations with Hundreds of Millions of Atoms.” <i>Parallel Computing</i> 111 (2022). <a href=\"https://doi.org/10.1016/j.parco.2022.102920\">https://doi.org/10.1016/j.parco.2022.102920</a>.","ieee":"R. Schade <i>et al.</i>, “Towards electronic structure-based ab-initio molecular dynamics simulations with hundreds of millions of atoms,” <i>Parallel Computing</i>, vol. 111, Art. no. 102920, 2022, doi: <a href=\"https://doi.org/10.1016/j.parco.2022.102920\">10.1016/j.parco.2022.102920</a>.","ama":"Schade R, Kenter T, Elgabarty H, et al. Towards electronic structure-based ab-initio molecular dynamics simulations with hundreds of millions of atoms. <i>Parallel Computing</i>. 2022;111. doi:<a href=\"https://doi.org/10.1016/j.parco.2022.102920\">10.1016/j.parco.2022.102920</a>"},"intvolume":"       111","author":[{"id":"75963","full_name":"Schade, Robert","orcid":"0000-0002-6268-539","last_name":"Schade","first_name":"Robert"},{"last_name":"Kenter","full_name":"Kenter, Tobias","id":"3145","first_name":"Tobias"},{"first_name":"Hossam","full_name":"Elgabarty, Hossam","id":"60250","last_name":"Elgabarty","orcid":"0000-0002-4945-1481"},{"first_name":"Michael","id":"24135","full_name":"Lass, Michael","last_name":"Lass","orcid":"0000-0002-5708-7632"},{"last_name":"Schütt","full_name":"Schütt, Ole","first_name":"Ole"},{"last_name":"Lazzaro","full_name":"Lazzaro, Alfio","first_name":"Alfio"},{"last_name":"Pabst","full_name":"Pabst, Hans","first_name":"Hans"},{"full_name":"Mohr, Stephan","last_name":"Mohr","first_name":"Stephan"},{"full_name":"Hutter, Jürg","last_name":"Hutter","first_name":"Jürg"},{"first_name":"Thomas","last_name":"Kühne","full_name":"Kühne, Thomas","id":"49079"},{"id":"16153","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian"}],"volume":111,"date_updated":"2023-08-02T15:03:55Z","oa":"1","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/S0167819122000242"}],"doi":"10.1016/j.parco.2022.102920","type":"journal_article","status":"public","user_id":"75963","department":[{"_id":"613"},{"_id":"27"},{"_id":"518"}],"project":[{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"33684","article_number":"102920","quality_controlled":"1","year":"2022","date_created":"2022-10-11T08:17:02Z","publisher":"Elsevier BV","title":"Towards electronic structure-based ab-initio molecular dynamics simulations with hundreds of millions of atoms","publication":"Parallel Computing","language":[{"iso":"eng"}],"keyword":["Artificial Intelligence","Computer Graphics and Computer-Aided Design","Computer Networks and Communications","Hardware and Architecture","Theoretical Computer Science","Software"]},{"related_material":{"link":[{"url":"https://github.com/Christian-Offen/multisymplectic","relation":"software"}]},"publication_status":"published","has_accepted_license":"1","citation":{"chicago":"McLachlan, Robert I, and Christian Offen. “Backward Error Analysis for Variational Discretisations of Partial  Differential Equations.” <i>Journal of Geometric Mechanics</i> 14, no. 3 (2022): 447–71. <a href=\"https://doi.org/10.3934/jgm.2022014\">https://doi.org/10.3934/jgm.2022014</a>.","ieee":"R. I. McLachlan and C. Offen, “Backward error analysis for variational discretisations of partial  differential equations,” <i>Journal of Geometric Mechanics</i>, vol. 14, no. 3, pp. 447–471, 2022, doi: <a href=\"https://doi.org/10.3934/jgm.2022014\">10.3934/jgm.2022014</a>.","ama":"McLachlan RI, Offen C. Backward error analysis for variational discretisations of partial  differential equations. <i>Journal of Geometric Mechanics</i>. 2022;14(3):447-471. doi:<a href=\"https://doi.org/10.3934/jgm.2022014\">10.3934/jgm.2022014</a>","mla":"McLachlan, Robert I., and Christian Offen. “Backward Error Analysis for Variational Discretisations of Partial  Differential Equations.” <i>Journal of Geometric Mechanics</i>, vol. 14, no. 3, AIMS, 2022, pp. 447–71, doi:<a href=\"https://doi.org/10.3934/jgm.2022014\">10.3934/jgm.2022014</a>.","bibtex":"@article{McLachlan_Offen_2022, title={Backward error analysis for variational discretisations of partial  differential equations}, volume={14}, DOI={<a href=\"https://doi.org/10.3934/jgm.2022014\">10.3934/jgm.2022014</a>}, number={3}, journal={Journal of Geometric Mechanics}, publisher={AIMS}, author={McLachlan, Robert I and Offen, Christian}, year={2022}, pages={447–471} }","short":"R.I. McLachlan, C. Offen, Journal of Geometric Mechanics 14 (2022) 447–471.","apa":"McLachlan, R. I., &#38; Offen, C. (2022). Backward error analysis for variational discretisations of partial  differential equations. <i>Journal of Geometric Mechanics</i>, <i>14</i>(3), 447–471. <a href=\"https://doi.org/10.3934/jgm.2022014\">https://doi.org/10.3934/jgm.2022014</a>"},"intvolume":"        14","page":"447 - 471","author":[{"last_name":"McLachlan","full_name":"McLachlan, Robert I","first_name":"Robert I"},{"orcid":"https://orcid.org/0000-0002-5940-8057","last_name":"Offen","full_name":"Offen, Christian","id":"85279","first_name":"Christian"}],"volume":14,"date_updated":"2023-08-10T08:44:55Z","oa":"1","doi":"10.3934/jgm.2022014","type":"journal_article","status":"public","user_id":"85279","department":[{"_id":"636"}],"_id":"19941","file_date_updated":"2022-06-13T09:11:38Z","article_type":"original","issue":"3","year":"2022","date_created":"2020-10-06T16:33:19Z","publisher":"AIMS","title":"Backward error analysis for variational discretisations of partial  differential equations","publication":"Journal of Geometric Mechanics","file":[{"title":"Backward error analysis for variational discretisations of PDEs","description":"In backward error analysis, an approximate solution to an equa-\ntion is compared to the exact solution to a nearby ‘modified’ equation. In\nnumerical ordinary differential equations, the two agree up to any power of\nthe step size. If the differential equation has a geometric property then the\nmodified equation may share it. In this way, known properties of differential\nequations can be applied to the approximation. But for partial differential\nequations, the known modified equations are of higher order, limiting appli-\ncability of the theory. Therefore, we study symmetric solutions of discretized\npartial differential equations that arise from a discrete variational principle.\nThese symmetric solutions obey infinite-dimensional functional equations. We\nshow that these equations admit second-order modified equations which are\nHamiltonian and also possess first-order Lagrangians in modified coordinates.\nThe modified equation and its associated structures are computed explicitly\nfor the case of rotating travelling waves in the nonlinear wave equation.","file_size":1507248,"file_name":"2_BlendedBEASymmPDE.pdf","access_level":"open_access","file_id":"31859","date_updated":"2022-06-13T09:11:38Z","creator":"coffen","date_created":"2022-06-13T09:11:38Z","relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"In backward error analysis, an approximate solution to an equation is compared to the exact solution to a nearby ‘modified’ equation. In numerical ordinary differential equations, the two agree up to any power of the step size. If the differential equation has a geometric property then the modified equation may share it. In this way, known properties of differential equations can be applied to the approximation. But for partial differential equations, the known modified equations are of higher order, limiting applicability of the theory. Therefore, we study symmetric solutions of discretized\r\npartial differential equations that arise from a discrete variational principle. These symmetric solutions obey infinite-dimensional functional equations. We show that these equations admit second-order modified equations which are Hamiltonian and also possess first-order Lagrangians in modified coordinates. The modified equation and its associated structures are computed explicitly for the case of rotating travelling waves in the nonlinear wave equation.","lang":"eng"}],"external_id":{"arxiv":["2006.14172"]},"language":[{"iso":"eng"}],"ddc":["510"]},{"related_material":{"link":[{"url":"https://github.com/Christian-Offen/symplectic-shadow-integration","description":"GitHub","relation":"software"}]},"publication_status":"published","has_accepted_license":"1","citation":{"apa":"Offen, C., &#38; Ober-Blöbaum, S. (2022). Symplectic integration of learned Hamiltonian systems. <i>Chaos: An Interdisciplinary Journal of Nonlinear Science</i>, <i>32(1)</i>. <a href=\"https://doi.org/10.1063/5.0065913\">https://doi.org/10.1063/5.0065913</a>","short":"C. Offen, S. Ober-Blöbaum, Chaos: An Interdisciplinary Journal of Nonlinear Science 32(1) (2022).","bibtex":"@article{Offen_Ober-Blöbaum_2022, title={Symplectic integration of learned Hamiltonian systems}, volume={32(1)}, DOI={<a href=\"https://doi.org/10.1063/5.0065913\">10.1063/5.0065913</a>}, journal={Chaos: An Interdisciplinary Journal of Nonlinear Science}, publisher={AIP}, author={Offen, Christian and Ober-Blöbaum, Sina}, year={2022} }","mla":"Offen, Christian, and Sina Ober-Blöbaum. “Symplectic Integration of Learned Hamiltonian Systems.” <i>Chaos: An Interdisciplinary Journal of Nonlinear Science</i>, vol. 32(1), AIP, 2022, doi:<a href=\"https://doi.org/10.1063/5.0065913\">10.1063/5.0065913</a>.","ama":"Offen C, Ober-Blöbaum S. Symplectic integration of learned Hamiltonian systems. <i>Chaos: An Interdisciplinary Journal of Nonlinear Science</i>. 2022;32(1). doi:<a href=\"https://doi.org/10.1063/5.0065913\">10.1063/5.0065913</a>","chicago":"Offen, Christian, and Sina Ober-Blöbaum. “Symplectic Integration of Learned Hamiltonian Systems.” <i>Chaos: An Interdisciplinary Journal of Nonlinear Science</i> 32(1) (2022). <a href=\"https://doi.org/10.1063/5.0065913\">https://doi.org/10.1063/5.0065913</a>.","ieee":"C. Offen and S. Ober-Blöbaum, “Symplectic integration of learned Hamiltonian systems,” <i>Chaos: An Interdisciplinary Journal of Nonlinear Science</i>, vol. 32(1), 2022, doi: <a href=\"https://doi.org/10.1063/5.0065913\">10.1063/5.0065913</a>."},"author":[{"first_name":"Christian","orcid":"0000-0002-5940-8057","last_name":"Offen","full_name":"Offen, Christian","id":"85279"},{"first_name":"Sina","full_name":"Ober-Blöbaum, Sina","id":"16494","last_name":"Ober-Blöbaum"}],"volume":"32(1)","date_updated":"2023-08-10T08:48:14Z","oa":"1","main_file_link":[{"url":"https://aip.scitation.org/doi/abs/10.1063/5.0065913","open_access":"1"}],"doi":"10.1063/5.0065913","type":"journal_article","status":"public","user_id":"85279","department":[{"_id":"636"}],"_id":"23382","file_date_updated":"2021-12-13T14:56:15Z","article_type":"original","quality_controlled":"1","year":"2022","date_created":"2021-08-11T08:24:02Z","publisher":"AIP","title":"Symplectic integration of learned Hamiltonian systems","publication":"Chaos: An Interdisciplinary Journal of Nonlinear Science","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2021-12-13T14:56:15Z","creator":"coffen","date_created":"2021-12-13T14:56:15Z","file_size":2285059,"access_level":"open_access","file_name":"SymplecticShadowIntegration_AIP.pdf","file_id":"28734"}],"abstract":[{"text":"Hamiltonian systems are differential equations which describe systems in classical mechanics, plasma physics, and sampling problems. They exhibit many structural properties, such as a lack of attractors and the presence of conservation laws. To predict Hamiltonian dynamics based on discrete trajectory observations, incorporation of prior knowledge about Hamiltonian structure greatly improves predictions. This is typically done by learning the system's Hamiltonian and then integrating the Hamiltonian vector field with a symplectic integrator. For this, however, Hamiltonian data needs to be approximated based on the trajectory observations. Moreover, the numerical integrator introduces an additional discretisation error. In this paper, we show that an inverse modified Hamiltonian structure adapted to the geometric integrator can be learned directly from observations. A separate approximation step for the Hamiltonian data avoided. The inverse modified data compensates for the discretisation error such that the discretisation error is eliminated. The technique is developed for Gaussian Processes.","lang":"eng"}],"external_id":{"arxiv":["2108.02492"]},"language":[{"iso":"eng"}],"ddc":["510"]},{"publication":"Beiträge zum Mathematikunterricht","type":"conference","status":"public","department":[{"_id":"98"}],"user_id":"85820","_id":"40613","language":[{"iso":"eng"}],"citation":{"ama":"Dröse J. Verstehensgrundlagen diagnostizieren - Diagnostisches Denken von drei Professionalisierungsgruppen. In: <i>Beiträge Zum Mathematikunterricht</i>. ; 2022.","chicago":"Dröse, Jennifer. “Verstehensgrundlagen Diagnostizieren - Diagnostisches Denken von Drei Professionalisierungsgruppen.” In <i>Beiträge Zum Mathematikunterricht</i>, 2022.","ieee":"J. Dröse, “Verstehensgrundlagen diagnostizieren - Diagnostisches Denken von drei Professionalisierungsgruppen,” 2022.","apa":"Dröse, J. (2022). Verstehensgrundlagen diagnostizieren - Diagnostisches Denken von drei Professionalisierungsgruppen. <i>Beiträge Zum Mathematikunterricht</i>.","short":"J. Dröse, in: Beiträge Zum Mathematikunterricht, 2022.","mla":"Dröse, Jennifer. “Verstehensgrundlagen Diagnostizieren - Diagnostisches Denken von Drei Professionalisierungsgruppen.” <i>Beiträge Zum Mathematikunterricht</i>, 2022.","bibtex":"@inproceedings{Dröse_2022, title={Verstehensgrundlagen diagnostizieren - Diagnostisches Denken von drei Professionalisierungsgruppen}, booktitle={Beiträge zum Mathematikunterricht}, author={Dröse, Jennifer}, year={2022} }"},"year":"2022","author":[{"first_name":"Jennifer","id":"85820","full_name":"Dröse, Jennifer","last_name":"Dröse"}],"date_created":"2023-01-27T19:00:01Z","date_updated":"2023-08-15T06:04:03Z","title":"Verstehensgrundlagen diagnostizieren - Diagnostisches Denken von drei Professionalisierungsgruppen"},{"type":"conference","publication":"ISWC 2022","status":"public","user_id":"67234","department":[{"_id":"34"}],"_id":"46538","language":[{"iso":"eng"}],"keyword":["colide dice eml4u ngonga raki sherif speaker vollmers zahera"],"publication_status":"accepted","publication_identifier":{"eisbn":["978-3-031-19433-7"],"isbn":["978-3-031-19432-0"]},"citation":{"ieee":"H. M. A. Zahera, D. Vollmers, M. Sherif, and A.-C. Ngonga Ngomo, “MultPAX: Keyphrase Extraction using Language Models and Knowledge Graphs,” doi: <a href=\"https://doi.org/10.1007/978-3-031-19433-7_18\">10.1007/978-3-031-19433-7_18</a>.","chicago":"Zahera, Hamada Mohamed Abdelsamee, Daniel Vollmers, Mohamed Sherif, and Axel-Cyrille Ngonga Ngomo. “MultPAX: Keyphrase Extraction Using Language Models and Knowledge Graphs.” In <i>ISWC 2022</i>. Springer, Cham, n.d. <a href=\"https://doi.org/10.1007/978-3-031-19433-7_18\">https://doi.org/10.1007/978-3-031-19433-7_18</a>.","ama":"Zahera HMA, Vollmers D, Sherif M, Ngonga Ngomo A-C. MultPAX: Keyphrase Extraction using Language Models and Knowledge Graphs. In: <i>ISWC 2022</i>. Springer, Cham. doi:<a href=\"https://doi.org/10.1007/978-3-031-19433-7_18\">10.1007/978-3-031-19433-7_18</a>","short":"H.M.A. Zahera, D. Vollmers, M. Sherif, A.-C. Ngonga Ngomo, in: ISWC 2022, Springer, Cham, n.d.","bibtex":"@inproceedings{Zahera_Vollmers_Sherif_Ngonga Ngomo, title={MultPAX: Keyphrase Extraction using Language Models and Knowledge Graphs}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-19433-7_18\">10.1007/978-3-031-19433-7_18</a>}, booktitle={ISWC 2022}, publisher={Springer, Cham}, author={Zahera, Hamada Mohamed Abdelsamee and Vollmers, Daniel and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille} }","mla":"Zahera, Hamada Mohamed Abdelsamee, et al. “MultPAX: Keyphrase Extraction Using Language Models and Knowledge Graphs.” <i>ISWC 2022</i>, Springer, Cham, doi:<a href=\"https://doi.org/10.1007/978-3-031-19433-7_18\">10.1007/978-3-031-19433-7_18</a>.","apa":"Zahera, H. M. A., Vollmers, D., Sherif, M., &#38; Ngonga Ngomo, A.-C. (n.d.). MultPAX: Keyphrase Extraction using Language Models and Knowledge Graphs. <i>ISWC 2022</i>. <a href=\"https://doi.org/10.1007/978-3-031-19433-7_18\">https://doi.org/10.1007/978-3-031-19433-7_18</a>"},"year":"2022","author":[{"id":"72768","full_name":"Zahera, Hamada Mohamed Abdelsamee","last_name":"Zahera","orcid":"0000-0003-0215-1278","first_name":"Hamada Mohamed Abdelsamee"},{"full_name":"Vollmers, Daniel","last_name":"Vollmers","first_name":"Daniel"},{"orcid":"https://orcid.org/0000-0002-9927-2203","last_name":"Sherif","full_name":"Sherif, Mohamed","id":"67234","first_name":"Mohamed"},{"first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716"}],"date_created":"2023-08-16T10:16:05Z","publisher":"Springer, Cham","date_updated":"2023-08-16T10:20:31Z","doi":"10.1007/978-3-031-19433-7_18","title":"MultPAX: Keyphrase Extraction using Language Models and Knowledge Graphs"}]