The SciQA Scientific Question Answering Benchmark for Scholarly Knowledge.

Knowledge graphs have gained increasing popularity in the last decade in science and technology. However, knowledge graphs are currently relatively simple to moderate semantic structures that are mainly a collection of factual statements. Question answering (QA) benchmarks and systems were so far mainly geared towards encyclopedic knowledge graphs such as DBpedia and Wikidata. We present SciQA a scientific QA benchmark for scholarly knowledge. The benchmark leverages the Open Research Knowledge Graph (ORKG) which includes almost 170,000 resources describing research contributions of almost 15,000 scholarly articles from 709 research fields. Following a bottom-up methodology, we first manually developed a set of 100 complex questions that can be answered using this knowledge graph. Furthermore, we devised eight question templates with which we automatically generated further 2465 questions, that can also be answered with the ORKG. The questions cover a range of research fields and question types and are translated into corresponding SPARQL queries over the ORKG. Based on two preliminary evaluations, we show that the resulting SciQA benchmark represents a challenging task for next-generation QA systems. This task is part of the open competitions at the 22nd International Semantic Web Conference 2023 as the Scholarly Question Answering over Linked Data (QALD) Challenge.

Improved objective Bayesian estimator for a PLP model hierarchically represented subject to competing risks under minimal repair regime.

In this paper, we propose a hierarchical statistical model for a single repairable system subject to several failure modes (competing risks). The paper describes how complex engineered systems may be modelled hierarchically by use of Bayesian methods. It is also assumed that repairs are minimal and each failure mode has a power-law intensity. Our proposed model generalizes another one already presented in the literature and continues the study initiated by us in another published paper. Some properties of the new model are discussed. We conduct statistical inference under an objective Bayesian framework. A simulation study is carried out to investigate the efficiency of the proposed methods. Finally, our methodology is illustrated by two practical situations currently addressed in a project under development arising from a partnership between Petrobras and six research institutes.

Graphical models and point pattern matching.

This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We present a noniterative, polynomial time algorithm that is guaranteed to find an optimal solution for the noiseless case. First, we model point pattern matching as a weighted graph matching problem, where weights correspond to Euclidean distances between nodes. We then formulate graph matching as a problem of finding a maximum probability configuration in a graphical model. By using graph rigidity arguments, we prove that a sparse graphical model yields equivalent results to the fully connected model in the noiseless case. This allows us to obtain an algorithm that runs in polynomial time and is provably optimal for exact matching between noiseless point sets. For inexact matching, we can still apply the same algorithm to find approximately optimal solutions. Experimental results obtained by our approach show improvements in accuracy over current methods, particularly when matching patterns of different sizes.