10 results
Search Results
Now showing 1 - 10 of 10
- ItemComparative Verification of the Digital Library of Mathematical Functions and Computer Algebra Systems(Berlin ; Heidelberg : Springer, 2022) Greiner-Petter, André; Cohl, Howard S.; Youssef, Abdou; Schubotz, Moritz; Trost, Avi; Dey, Rajen; Aizawa, Akiko; Gipp, Bela; Fisman, Dana; Rosu, GrigoreDigital mathematical libraries assemble the knowledge of years of mathematical research. Numerous disciplines (e.g., physics, engineering, pure and applied mathematics) rely heavily on compendia gathered findings. Likewise, modern research applications rely more and more on computational solutions, which are often calculated and verified by computer algebra systems. Hence, the correctness, accuracy, and reliability of both digital mathematical libraries and computer algebra systems is a crucial attribute for modern research. In this paper, we present a novel approach to verify a digital mathematical library and two computer algebra systems with one another by converting mathematical expressions from one system to the other. We use our previously developed conversion tool (referred to as ) to translate formulae from the NIST Digital Library of Mathematical Functions to the computer algebra systems Maple and Mathematica. The contributions of our presented work are as follows: (1) we present the most comprehensive verification of computer algebra systems and digital mathematical libraries with one another; (2) we significantly enhance the performance of the underlying translator in terms of coverage and accuracy; and (3) we provide open access to translations for Maple and Mathematica of the formulae in the NIST Digital Library of Mathematical Functions.
- ItemDetecting Cross-Language Plagiarism using Open Knowledge Graphs(Aachen, Germany : RWTH Aachen, 2021) Stegmüller, Johannes; Bauer-Marquart, Fabian; Meuschke, Norman; Ruas, Terry; Schubotz, Moritz; Gipp, Bela; Zhang, Chengzhi; Mayr, Philipp; Lu, Wie; Zhang, YiIdentifying cross-language plagiarism is challenging, especially for distant language pairs and sense-for-sense translations. We introduce the new multilingual retrieval model Cross-Language Ontology-Based Similarity Analysis (CL-OSA) for this task. CL-OSA represents documents as entity vectors obtained from the open knowledge graph Wikidata. Opposed to other methods, CL-OSA does not require computationally expensive machine translation, nor pre-training using comparable or parallel corpora. It reliably disambiguates homonyms and scales to allow its application toWebscale document collections. We show that CL-OSA outperforms state-of-the-art methods for retrieving candidate documents from five large, topically diverse test corpora that include distant language pairs like Japanese-English. For identifying cross-language plagiarism at the character level, CL-OSA primarily improves the detection of sense-for-sense translations. For these challenging cases, CL-OSA’s performance in terms of the well-established PlagDet score exceeds that of the best competitor by more than factor two. The code and data of our study are openly available.
- ItemIncentive Mechanisms in Peer-to-Peer Networks — A Systematic Literature Review(New York, NY : Association for Computing Machinery, 2023) Ihle, Cornelius; Trautwein, Dennis; Schubotz, Moritz; Meuschke, Norman; Gipp, BelaCentralized networks inevitably exhibit single points of failure that malicious actors regularly target. Decentralized networks are more resilient if numerous participants contribute to the network’s functionality. Most decentralized networks employ incentive mechanisms to coordinate the participation and cooperation of peers and thereby ensure the functionality and security of the network. This article systematically reviews incentive mechanisms for decentralized networks and networked systems by covering 165 prior literature reviews and 178 primary research papers published between 1993 and October 2022. Of the considered sources, we analyze 11 literature reviews and 105 primary research papers in detail by categorizing and comparing the distinctive properties of the presented incentive mechanisms. The reviewed incentive mechanisms establish fairness and reward participation and cooperative behavior. We review work that substitutes central authority through independent and subjective mechanisms run in isolation at each participating peer and work that applies multiparty computation. We use monetary, reputation, and service rewards as categories to differentiate the implementations and evaluate each incentive mechanism’s data management, attack resistance, and contribution model. Further, we highlight research gaps and deficiencies in reproducibility and comparability. Finally, we summarize our assessments and provide recommendations to apply incentive mechanisms to decentralized networks that share computational resources.
- ItemConnecting Islands: Bridging zbMATH and DLMF with Scholix, a blueprint for connecting expert knowledge systems(Berlin : EMS Press, 2021) Cohl, Howard S.; Teschke, Olaf; Schubotz, MoritzThis paper reports on the recently launched zbMATH Links API. We discuss its potential based on the initial link partner, the National Institute of Standards and Technology Digital Library of Mathematical Functions. As the API provides machine readable data in the links, we show how one can use data from both sources for further analysis. To exemplify the simplicity, we also show how one can use zbMATH’s link data in Jupyter notebooks.
- ItemSustaining the swMATH project: Integration into zbMATH Open interface and Open Data perspectives(Berlin : EMS Press, an imprint of the European Mathematical Society (EMS), 2022) Azzouz-Thuderoz, Maxence; Schubotz, Moritz; Teschke, Olaf[no abstract available]
- ItemCaching and Reproducibility: Making Data Science Experiments Faster and FAIRer(Lausanne : Frontiers Media, 2022) Schubotz, Moritz; Satpute, Ankit; Greiner-Petter, André; Aizawa, Akiko; Gipp, BelaSmall to medium-scale data science experiments often rely on research software developed ad-hoc by individual scientists or small teams. Often there is no time to make the research software fast, reusable, and open access. The consequence is twofold. First, subsequent researchers must spend significant work hours building upon the proposed hypotheses or experimental framework. In the worst case, others cannot reproduce the experiment and reuse the findings for subsequent research. Second, suppose the ad-hoc research software fails during often long-running computational expensive experiments. In that case, the overall effort to iteratively improve the software and rerun the experiments creates significant time pressure on the researchers. We suggest making caching an integral part of the research software development process, even before the first line of code is written. This article outlines caching recommendations for developing research software in data science projects. Our recommendations provide a perspective to circumvent common problems such as propriety dependence, speed, etc. At the same time, caching contributes to the reproducibility of experiments in the open science workflow. Concerning the four guiding principles, i.e., Findability, Accessibility, Interoperability, and Reusability (FAIR), we foresee that including the proposed recommendation in a research software development will make the data related to that software FAIRer for both machines and humans. We exhibit the usefulness of some of the proposed recommendations on our recently completed research software project in mathematical information retrieval.
- ItemzbMATH Open: API Solutions and Research Challenges(Aachen, Germany : RWTH Aachen, 2021) Petrera, Matteo; Trautwein, Dennis; Beckenbach, Isabel; Ehsani, Dariush; Müller, Fabian; Teschke, Olaf; Gipp, Bela; Schubotz, Moritz; Balke, Wolf-Tilo; de Waard, Anita; Fu, Yuanxi; Hua, Bolin; Schneider, Jodi; Song, Ningyuan; Wang, XiaoguangWe present zbMATH Open, the most comprehensive collection of reviews and bibliographic metadata of scholarly literature in mathematics. Besides our website zbMATH.org which is openly accessible since the beginning of this year, we provide API endpoints to offer our data. APIs improve interoperability with others, i.e., digital libraries, and allow using our data for research purposes. In this article, we (1) illustrate the current and future overview of the services offered by zbMATH; (2) present the initial version of the zbMATH links API; (3) analyze potentials and limitations of the links API based on the example of the NIST Digital Library of Mathematical Functions; (4) and finally, present thezbMATHOpen dataset as a research resource and discuss connected open research problems.
- ItemMathematics in Wikidata(Aachen, Germany : RWTH Aachen, 2021) Scharpf, Philipp; Schubotz, Moritz; Gipp, Bela; Kaffee, Lucie-Aimée; Razniewski, Simon; Hogan, AidanDocuments from Science, Technology, Engineering, and Mathematics (STEM) disciplines usually contain a signicant amount of mathematical formulae alongside text. Some Mathematical Information Retrieval (MathIR) systems, e.g., Mathematical Question Answering (MathQA), exploit knowledge from Wikidata. Therefore, the mathematical information needs to be stored in items. In the last years, there have been efforts to define several properties and seed formulae together with their constituting identifiers into Wikidata. This paper summarizes the current state, challenges, and discussions related to this endeavor. Furthermore, some data mining methods (supervised formula annotation and concept retrieval) and applications (question answering and classification explainability) of the mathematical information are outlined. Finally, we discuss community feedback and issues related to integrating Mathematical Entity Linking (MathEL) into Wikidata and Wikipedia, which was rejected in 33% and 12% of the test cases, for Wikidata and Wikipedia respectively. Our long-term goal is to populate Wikidata, such that it can serve a variety of automated math reasoning tasks and AI systems.
- ItemKnowledge Graphs - Working Group Charter (NFDI section-metadata) (1.2)(Genève : CERN, 2023) Stocker, Markus; Rossenova, Lozana; Shigapov, Renat; Betancort, Noemi; Dietze, Stefan; Murphy, Bridget; Bölling, Christian; Schubotz, Moritz; Koepler, OliverKnowledge Graphs are a key technology for implementing the FAIR principles in data infrastructures by ensuring interoperability for both humans and machines. The Working Group "Knowledge Graphs" in Section "(Meta)data, Terminologies, Provenance" of the German National Research Data Infrastructure (Nationale Forschungsdateninfrastruktur (NFDI) e.V.) aims to promote the use of knowledge graphs in all NFDI consortia, to facilitate cross-domain data interlinking and federation following the FAIR principles, and to contribute to the joint development of tools and technologies that enable transformation of structured and unstructured data into semantically reusable knowledge across different domains.
- ItemThe Case for a Common, Reusable Knowledge Graph Infrastructure for NFDI(Hannover : TIB Open Publishing, 2023) Rossenova, Lozana; Schubotz, Moritz; Shigapov, RenatThe Strategic Research and Innovation Agenda (SRIA) of the European Commission identifies Knowledge Graphs (KGs) as one of the most important technologies for building an interoperability framework and enabling data exchange among users across countries, sectors, and disciplines [1]. KG is a graph-structured knowledge base containing a terminology (vocabulary or ontology) and data entities interrelated via the terminology [2]. KGs are based on semantic web technologies (RDF, SPARQL, etc.) and often used for agile data integration. KGs also play an essential role within Germany as a vehicle to connect research data and research-related entities and make those accessible – examples include the GESIS Knowledge Graph Infrastructure, TIB Open Research Knowledge Graph, and GND.network. Furthermore, the Wikidata knowledge graph, maintained by Wikimedia Germany, contains a large number of research-related entities and is widely used in scientific knowledge management in addition to being an important advocacy tool for open data [3]. Extending domain-specific ontology-supported KGs with the multidisciplinary, crowdsourced knowledge in Wikidata KG would enable significant applications. The linking between expert knowledge systems and world knowledge empowers lay persons to benefit from high-quality research data and ultimately contributes to increasing confidence in scientific research in society.