@inbook{54412, author = {{Firmansyah, Asep Fajar and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{The Semantic Web}}, isbn = {{9783031606250}}, issn = {{0302-9743}}, publisher = {{Springer Nature Switzerland}}, title = {{{ESLM: Improving Entity Summarization by Leveraging Language Models}}}, doi = {{10.1007/978-3-031-60626-7_9}}, year = {{2024}}, } @inbook{54580, author = {{Mahmood, Yasir and Virtema, Jonni and Barlag, Timon and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783031569395}}, issn = {{0302-9743}}, publisher = {{Springer Nature Switzerland}}, title = {{{Computing Repairs Under Functional and Inclusion Dependencies via Argumentation}}}, doi = {{10.1007/978-3-031-56940-1_2}}, year = {{2024}}, } @inbook{54624, author = {{Papenkordt, Jörg}}, booktitle = {{Artificial Intelligence in HCI}}, isbn = {{9783031606052}}, issn = {{0302-9743}}, publisher = {{Springer Nature Switzerland}}, title = {{{Navigating Transparency: The Influence of On-demand Explanations on Non-expert User Interaction with AI}}}, doi = {{10.1007/978-3-031-60606-9_14}}, year = {{2024}}, } @inbook{52759, author = {{Preuß, Oliver Ludger and Rook, Jeroen and Trautmann, Heike}}, booktitle = {{Applications of Evolutionary Computation}}, isbn = {{9783031568510}}, issn = {{0302-9743}}, publisher = {{Springer Nature Switzerland}}, title = {{{On the Potential of Multi-objective Automated Algorithm Configuration on Multi-modal Multi-objective Optimisation Problems}}}, doi = {{10.1007/978-3-031-56852-7_20}}, year = {{2024}}, } @inbook{54802, abstract = {{Motivated by the prospect of nano-robots that assist human physiological functions at the nanoscale, we investigate the coating problem in the three-dimensional model for hybrid programmable matter. In this model, a single agent with strictly limited viewing range and the computational capability of a deterministic finite automaton can act on passive tiles by picking up a tile, moving, and placing it at some spot. The goal of the coating problem is to fill each node of some surface graph of size n with a tile. We first solve the problem on a restricted class of graphs with a single tile type, and then use constantly many tile types to encode this graph in certain surface graphs capturing the surface of 3D objects. Our algorithm requires O(n^2) steps, which is worst-case optimal compared to an agent with global knowledge and no memory restrictions.}}, author = {{Kostitsyna, Irina and Liedtke, David Jan and Scheideler, Christian}}, booktitle = {{Structural Information and Communication Complexity}}, editor = {{Emek, Yuval}}, isbn = {{9783031606021}}, issn = {{0302-9743}}, keywords = {{Programmable Matter, Coating, Finite Automaton, 3D}}, publisher = {{Springer Nature Switzerland}}, title = {{{Universal Coating by 3D Hybrid Programmable Matter}}}, doi = {{10.1007/978-3-031-60603-8_21}}, year = {{2024}}, } @inbook{56079, author = {{Radoy, Maximilian Manfred and Hebrok, Sven Niclas and Somorovsky, Juraj}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783031708954}}, issn = {{0302-9743}}, publisher = {{Springer Nature Switzerland}}, title = {{{In Search of Partitioning Oracle Attacks Against TLS Session Tickets}}}, doi = {{10.1007/978-3-031-70896-1_16}}, year = {{2024}}, } @inbook{56606, abstract = {{AbstractMost FPGA boards in the HPC domain are well-suited for parallel scaling because of the direct integration of versatile and high-throughput network ports. However, the utilization of their network capabilities is often challenging and error-prone because the whole network stack and communication patterns have to be implemented and managed on the FPGAs. Also, this approach conceptually involves a trade-off between the performance potential of improved communication and the impact of resource consumption for communication infrastructure, since the utilized resources on the FPGAs could otherwise be used for computations. In this work, we investigate this trade-off, firstly, by using synthetic benchmarks to evaluate the different configuration options of the communication framework ACCL and their impact on communication latency and throughput. Finally, we use our findings to implement a shallow water simulation whose scalability heavily depends on low-latency communication. With a suitable configuration of ACCL, good scaling behavior can be shown to all 48 FPGAs installed in the system. Overall, the results show that the availability of inter-FPGA communication frameworks as well as the configurability of framework and network stack are crucial to achieve the best application performance with low latency communication.}}, author = {{Meyer, Marius and Kenter, Tobias and Petrica, Lucian and O’Brien, Kenneth and Blott, Michaela and Plessl, Christian}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783031697654}}, issn = {{0302-9743}}, publisher = {{Springer Nature Switzerland}}, title = {{{Optimizing Communication for Latency Sensitive HPC Applications on up to 48 FPGAs Using ACCL}}}, doi = {{10.1007/978-3-031-69766-1_9}}, year = {{2024}}, } @inbook{56581, abstract = {{In recent years, there has been a surge in natural language processing research focused on low-resource languages (LrLs), underscoring the growing recognition that LrLs deserve the same attention as high-resource languages (HrLs). This shift is crucial for ensuring linguistic diversity and inclusivity in the digital age. Despite Indonesian ranking as the 11th most spoken language globally, it remains under-resourced in terms of computational tools and datasets. Within the semantic web domain, Entity Linking (EL) is pivotal, linking textual entity mentions to their corresponding entries in knowledge bases. This process is foundational for advanced information extraction tasks, including relation extraction and event detection. To bolster EL research in Indonesian, we introduce IndEL, the first benchmark dataset tailored for both general and specific domains. IndEL was manually curated using Wikidata, adhering to a rigorous set of annotation guidelines. We used two Named Entity Recognition (NER) benchmark datasets for entity extraction: NER UI for the general domain and IndQNER for the specific domain. IndQNER focused on entities from the Indonesian translation of the Quran. IndEL comprises 4765 entities in the general domain and 2453 in the specific domain. Using the GERBIL framework, we use IndEL to evaluate the performance of various EL systems, such as Babelfy, DBpedia Spotlight, MAG, OpenTapioca, and WAT. Our further investigation reveals that within Wikidata, a significant number of NIL entities remain unlinked due to the limited number of Indonesian labels and the use of acronyms. Especially in the specific domain, transliteration and translation processes performed to create the Indonesian translation of the Quran contribute to the presence of entities in a descriptive form and as synonyms.}}, author = {{Gusmita, Ria Hari and Abshar, Muhammad Faruq Amiral and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783031702389}}, issn = {{0302-9743}}, keywords = {{entity linking benchmark dataset, Indonesian, general and specific domains}}, location = {{Turin, Italy}}, publisher = {{Springer Nature Switzerland}}, title = {{{IndEL: Indonesian Entity Linking Benchmark Dataset for General and Specific Domains}}}, doi = {{10.1007/978-3-031-70239-6_34}}, year = {{2024}}, } @inbook{56237, author = {{Schönherr, Johanna and Mayer, Richard E.}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783031712906}}, issn = {{0302-9743}}, publisher = {{Springer Nature Switzerland}}, title = {{{Anxiety Moderates the Effects of Drawing Support on Drawing Accuracy in Mathematical Modeling}}}, doi = {{10.1007/978-3-031-71291-3_26}}, year = {{2024}}, } @inbook{64202, author = {{Bora, Revoti Prasad and Terhörst, Philipp and Veldhuis, Raymond and Ramachandra, Raghavendra and Raja, Kiran}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783031781889}}, issn = {{0302-9743}}, publisher = {{Springer Nature Switzerland}}, title = {{{CoFE: Consistency-Driven Feature Elimination for eXplainable AI}}}, doi = {{10.1007/978-3-031-78189-6_24}}, year = {{2024}}, } @inbook{54623, author = {{Papenkordt, Jörg}}, booktitle = {{Artificial Intelligence in HCI}}, isbn = {{9783031606052}}, issn = {{0302-9743}}, publisher = {{Springer Nature Switzerland}}, title = {{{Navigating Transparency: The Influence of On-demand Explanations on Non-expert User Interaction with AI}}}, doi = {{10.1007/978-3-031-60606-9_14}}, year = {{2024}}, } @inbook{57323, author = {{Karalis, Nikolaos and Bigerl, Alexander and Demir, Caglar and Heidrich, Liss and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783031703645}}, issn = {{0302-9743}}, publisher = {{Springer Nature Switzerland}}, title = {{{Evaluating Negation with Multi-way Joins Accelerates Class Expression Learning}}}, doi = {{10.1007/978-3-031-70365-2_12}}, year = {{2024}}, } @inbook{61210, abstract = {{Knowledge graphs (KGs) differ significantly over multiple different versions of the same data source. They also often contain blank nodes that do not have a constant identifier over all versions. Linking such blank nodes from different versions is a challenging task. Previous works propose different approaches to create signatures for all blank nodes based on named nodes in their neighborhood to match blank nodes with similar signatures. However, these works struggle to find a good mapping when the difference between the KGs’ versions grows too large. In this work, we propose Blink, an embedding-based approach for blank node linking. Blink merges two KGs’ versions and embeds the merged graph into a latent vector space based on translational embeddings and subsequently matches the closest pairs of blank nodes from different graphs. We evaluate our approach using real-world datasets against state-of-the-art approaches by computing the blank node matching for isomorphic graphs and graphs that contain triple changes (i.e., added or removed triples). The results indicate that Blink achieves perfect accuracy for isomorphic graphs. For graph versions that contain changes, such as having up to 20% of triples removed in one version, Blink still produces a mapping with an Optimal Mapping Deviation Ratio of under 1%. These results show that Blink leads to a better linking of KGs over different versions and similar graphs adhering to the linked data guidelines.}}, author = {{Becker, Alexander and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783031778438}}, issn = {{0302-9743}}, location = {{Baltimore, USA}}, publisher = {{Springer Nature Switzerland}}, title = {{{Blink: Blank Node Matching Using Embeddings}}}, doi = {{10.1007/978-3-031-77844-5_12}}, year = {{2024}}, } @inbook{62067, abstract = {{Most FPGA boards in the HPC domain are well-suited for parallel scaling because of the direct integration of versatile and high-throughput network ports. However, the utilization of their network capabilities is often challenging and error-prone because the whole network stack and communication patterns have to be implemented and managed on the FPGAs. Also, this approach conceptually involves a trade-off between the performance potential of improved communication and the impact of resource consumption for communication infrastructure, since the utilized resources on the FPGAs could otherwise be used for computations. In this work, we investigate this trade-off, firstly, by using synthetic benchmarks to evaluate the different configuration options of the communication framework ACCL and their impact on communication latency and throughput. Finally, we use our findings to implement a shallow water simulation whose scalability heavily depends on low-latency communication. With a suitable configuration of ACCL, good scaling behavior can be shown to all 48 FPGAs installed in the system. Overall, the results show that the availability of inter-FPGA communication frameworks as well as the configurability of framework and network stack are crucial to achieve the best application performance with low latency communication.}}, author = {{Meyer, Marius and Kenter, Tobias and Petrica, Lucian and O’Brien, Kenneth and Blott, Michaela and Plessl, Christian}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783031697654}}, issn = {{0302-9743}}, publisher = {{Springer Nature Switzerland}}, title = {{{Optimizing Communication for Latency Sensitive HPC Applications on up to 48 FPGAs Using ACCL}}}, doi = {{10.1007/978-3-031-69766-1_9}}, year = {{2024}}, } @inbook{53942, abstract = {{AbstractSince its inception two decades ago, Soot has become one of the most widely used open-source static analysis frameworks. Over time it has been extended with the contributions of countless researchers. Yet, at the same time, the requirements for Soot have changed over the years and become increasingly at odds with some of the major design decisions that underlie it. In this work, we thus present SootUp, a complete reimplementation of Soot that seeks to fulfill these requirements with a novel design, while at the same time keeping elements that Soot users have grown accustomed to.}}, author = {{Karakaya, Kadiray and Schott, Stefan and Klauke, Jonas and Bodden, Eric and Schmidt, Markus and Luo, Linghui and He, Dongjie}}, booktitle = {{Tools and Algorithms for the Construction and Analysis of Systems}}, isbn = {{9783031572456}}, issn = {{0302-9743}}, publisher = {{Springer Nature Switzerland}}, title = {{{SootUp: A Redesign of the Soot Static Analysis Framework}}}, doi = {{10.1007/978-3-031-57246-3_13}}, year = {{2024}}, } @article{47953, author = {{Kornowicz, Jaroslaw and Thommes, Kirsten}}, isbn = {{9783031358906}}, issn = {{0302-9743}}, journal = {{Artificial Intelligence in HCI}}, publisher = {{Springer Nature Switzerland}}, title = {{{Aggregating Human Domain Knowledge for Feature Ranking}}}, doi = {{10.1007/978-3-031-35891-3_7}}, year = {{2023}}, } @inproceedings{50479, abstract = {{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 = {{Qudus, Umair and Röder, Michael and Kirrane, Sabrina and Ngomo, Axel-Cyrille Ngonga}}, booktitle = {{The Semantic Web – ISWC 2023}}, 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}}, isbn = {{9783031472398}}, issn = {{0302-9743}}, keywords = {{temporal fact checking · ensemble learning · transfer learning · time-point prediction · temporal knowledge graphs}}, location = {{Athens, Greece}}, pages = {{465–483}}, publisher = {{Springer, Cham}}, title = {{{TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs}}}, doi = {{10.1007/978-3-031-47240-4_25}}, volume = {{14265}}, year = {{2023}}, } @inproceedings{51373, author = {{Hanselle, Jonas Manuel and Fürnkranz, Johannes and Hüllermeier, Eyke}}, booktitle = {{26th International Conference on Discovery Science }}, isbn = {{9783031452741}}, issn = {{0302-9743}}, location = {{Porto}}, pages = {{189--203}}, publisher = {{Springer Nature Switzerland}}, title = {{{Probabilistic Scoring Lists for Interpretable Machine Learning}}}, doi = {{10.1007/978-3-031-45275-8_13}}, volume = {{14050}}, year = {{2023}}, } @inbook{47421, abstract = {{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 = {{Kouagou, N'Dah Jean and Heindorf, Stefan and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Machine Learning and Knowledge Discovery in Databases: Research Track}}, isbn = {{9783031434204}}, issn = {{0302-9743}}, location = {{Turin}}, publisher = {{Springer Nature Switzerland}}, title = {{{Neural Class Expression Synthesis in ALCHIQ(D)}}}, doi = {{10.1007/978-3-031-43421-1_12}}, year = {{2023}}, } @inbook{46516, abstract = {{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 = {{Ahmed, Abdullah Fathi Ahmed and Firmansyah, Asep Fajar and Sherif, Mohamed and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Natural Language Processing and Information Systems}}, isbn = {{9783031353192}}, issn = {{0302-9743}}, publisher = {{Springer Nature Switzerland}}, title = {{{Explainable Integration of Knowledge Graphs Using Large Language Models}}}, doi = {{10.1007/978-3-031-35320-8_9}}, year = {{2023}}, }