51 results
Search Results
Now showing 1 - 10 of 51
- ItemHandreichung Urheberrecht und Datenschutz(Genève : CERN, 2023) Blumtritt, Ute; Euler, Ellen; Fadeevy, Yuliya; Pohle, Jörg; Rack, Fabian; Wrzesinski, MarcelDie vorliegende Handreichung adressiert wissenschaftsgeleitete Zeitschriften sowie herausgebende Einrichtungen. Sie sollen in die Lage versetzt werden, erste urheberrechtliche wie datenschutzrechtliche Fragen zu beantworten und dabei Qualitätsstandards einzuhalten. Dieser Text ersetzt keine Rechtsberatung, sondern bietet grundsätzliche Informationen, gibt Empfehlungen zum Weiterlesen für klassische Fragestellungen und verweist auf gelungene Beispiele im weiteren Feld des wissenschaftsgeleiteten Publizierens.
- 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.
- ItemData Protection Impact Assessments in Practice: Experiences from Case Studies(Berlin ; Heidelberg : Springer, 2022) Friedewald, Michael; Schiering, Ina; Martin, Nicholas; Hallinan, Dara; Katsikas, Sokratis; Lambrinoudakis, Costas; Cuppens, Nora; Mylopoulos, John; Kalloniatis, Christos; Meng, Weizhi; Furnell, Steven; Pallas, Frank; Pohle, Jörg; Sasse, M. Angela; Abie, Habtamu; Ranise, Silvio; Verderame, Luca; Cambiaso, Enrico; Vidal, Jorge Maestre; Monge, Marco Antonio SoteloIn the context of the project A Data Protection Impact Assessment (DPIA) Tool for Practical Use in Companies and Public Administration an operationalization for Data Protection Impact Assessments was developed based on the approach of Forum Privatheit. This operationalization was tested and refined during twelve tests with startups, small- and medium sized enterprises, corporations and public bodies. This paper presents the operationalization and summarizes the experience from the tests.
- ItemA Data Model for Linked Stage Graph and the Historical Performing Arts Domain(Aachen, Germany : RWTH Aachen, 2023) Tietz, Tabea; Bruns, Oleksandra; Sack, Harald; Bikakis, Antonis; Ferrario, Roberta; Jean, Stéphane; Markhoff, Béatrice; Mosca, Alessandro; Nicolosi Asmundo, MariannaThe performing arts are complex, dynamic and embedded into societal and political systems. Providing means to research historical performing arts data is therefore crucial for understanding our history and culture. However, currently no commonly accepted ontology for historical performing arts data exists. On the example of the Linked Stage Graph, this position paper presents the ongoing process of creating an application-driven and efficient data model by leveraging and building upon existing standards and ontologies like CIDOC-CRM, FRBR, and FRBRoo.
- ItemKnowledge Extraction for Art History: the Case of Vasari’s The Lives of The Artists (1568)(Aachen, Germany : RWTH Aachen, 2022) Santini, Cristian; Tan, Mary Ann; Tietz, Tabea; Bruns, Oleksandra; Posthumus, Etienne; Sack, Harald; Paschke, Adrian; Rehm, Georg; Neudecker, Clemens; Pintscher, LydiaKnowledge Extraction (KE) techniques are used to convert unstructured information present in texts to Knowledge Graphs (KGs) which can be queried and explored. Despite their potential for cultural heritage domains, such as Art History, these techniques often encounter limitations if applied to domain-specific data. In this paper we present the main challenges that KE has to face on art-historical texts, by using as case study Giorgio Vasari's The Lives of The Artists. This paper discusses the following NLP tasks for art-historical texts, namely entity recognition and linking, coreference resolution, time extraction, motif extraction and artwork extraction. Several strategies to annotate art-historical data for these tasks and evaluate NLP models are also proposed.
- ItemOn the Impact of Temporal Representations on Metaphor Detection(Paris : European Language Resources Association (ELRA), 2022) Giorgio Ottolina; Matteo Palmonari; Manuel Vimercati; Mehwish Alam; Calzolari, Nicoletta; Béchet, Frédéric; Blache, Philippe; Choukri, Khalid; Cieri, Christopher; Declerck, Thierry; Goggi, Sara; Isahara, Hitoshi; Maegaard, Bente; Mariani, Joseph; Mazo, Hélène; Odijk, Jan; Piperidis, SteliosState-of-the-art approaches for metaphor detection compare their literal - or core - meaning and their contextual meaning using metaphor classifiers based on neural networks. However, metaphorical expressions evolve over time due to various reasons, such as cultural and societal impact. Metaphorical expressions are known to co-evolve with language and literal word meanings, and even drive, to some extent, this evolution. This poses the question of whether different, possibly time-specific, representations of literal meanings may impact the metaphor detection task. To the best of our knowledge, this is the first study that examines the metaphor detection task with a detailed exploratory analysis where different temporal and static word embeddings are used to account for different representations of literal meanings. Our experimental analysis is based on three popular benchmarks used for metaphor detection and word embeddings extracted from different corpora and temporally aligned using different state-of-the-art approaches. The results suggest that the usage of different static word embedding methods does impact the metaphor detection task and some temporal word embeddings slightly outperform static methods. However, the results also suggest that temporal word embeddings may provide representations of the core meaning of the metaphor even too close to their contextual meaning, thus confusing the classifier. Overall, the interaction between temporal language evolution and metaphor detection appears tiny in the benchmark datasets used in our experiments. This suggests that future work for the computational analysis of this important linguistic phenomenon should first start by creating a new dataset where this interaction is better represented.
- ItemThe Concept of Identifiability in ML Models(Setúbal : SciTePress - Science and Technology Publications, Lda., 2022) von Maltzan, Stephanie; Bastieri, Denis; Wills, Gary; Kacsuk, Péter; Chang, VictorRecent research indicates that the machine learning process can be reversed by adversarial attacks. These attacks can be used to derive personal information from the training. The supposedly anonymising machine learning process represents a process of pseudonymisation and is, therefore, subject to technical and organisational measures. Consequently, the unexamined belief in anonymisation as a guarantor for privacy cannot be easily upheld. It is, therefore, crucial to measure privacy through the lens of adversarial attacks and precisely distinguish what is meant by personal data and non-personal data and above all determine whether ML models represent pseudonyms from the training data.
- ItemImproving Zero-Shot Text Classification with Graph-based Knowledge Representations(Aachen, Germany : RWTH Aachen, 2022) Hoppe, Fabian; Hartig, Olaf; Seneviratne, OshaniInsufficient training data is a key challenge for text classification. In particular, long-tail class distributions and emerging, new classes do not provide any training data for specific classes. Therefore, such a zeroshot setting must incorporate additional, external knowledge to enable transfer learning by connecting the external knowledge of previously unseen classes to texts. Recent zero-shot text classifier utilize only distributional semantics defined by large language models and based on class names or natural language descriptions. This implicit knowledge contains ambiguities, is not able to capture logical relations nor is it an efficient representation of factual knowledge. These drawbacks can be avoided by introducing explicit, external knowledge. Especially, knowledge graphs provide such explicit, unambiguous, and complementary, domain specific knowledge. Hence, this thesis explores graph-based knowledge as additional modality for zero-shot text classification. Besides a general investigation of this modality, the influence on the capabilities of dealing with domain shifts by including domain-specific knowledge is explored.
- ItemExploring the Impact of Negative Sampling on Patent Citation Recommendation(Paris : CNRS, 2023) Dessi, Rima; Aras, Hidir; Alam, MehwishDue to the increasing number of patents being published every day, patent citation recommendations have become one of the challenging tasks. Since patent citations may lead to legal and economic consequences, patent recommendations are even more challenging as compared to scientific article citations. One of the crucial components of the patent citation algorithm is negative sampling which is also a part of many other tasks such as text classification, knowledge graph completion, etc. This paper, particularly focuses on proposing a transformer-based ranking model for patent recommendations. It further experimentally compares the performance of patent recommendations based on various state-of-the-art negative sampling approaches to measure and compare the effectiveness of these approaches to aid future developments. These experiments are performed on a newly collected dataset of US patents from Google patents.
- ItemDiving into Knowledge Graphs for Patents: Open Challenges and Benefits(Aachen, Germany : RWTH Aachen, 2023) Dessi, Danilo; Dessi, Rima; Alam, Mehwish; Trojahn, Cassia; Hertling, Sven; Pesquita, Catia; Aebeloe, Christian; Aras, Hidir; Azzam, Amr; Cano, Juan; Domingue, John; Gottschalk, Simon; Hartig, Olaf; Hose, Katja; Kirrane, Sabrina; Lisena, Pasquale; Osborne, Francesco; Rohde, Philipp; Steels, Luc; Taelman, Ruben; Third, Aisling; Tiddi, Ilaria; Türker, RimaTextual documents are the means of sharing information and preserving knowledge for a large variety of domains. The patent domain is also using such a paradigm which is becoming difficult to maintain and is limiting the potentialities of using advanced AI systems for domain analysis. To overcome this issue, it is more and more frequent to find approaches to transform textual representations into Knowledge Graphs (KGs). In this position paper, we discuss KGs within the patent domain, present its challenges, and envision the benefits of such technologies for this domain. In addition, this paper provides insights of such KGs by reproducing an existing pipeline to create KGs and applying it to patents in the computer science domain.