Comparing Plan Recognition Algorithms Through Standard Plan Libraries

Plan recognition deals with reasoning about the goals and execution process of an actor, given observations of its actions. It is one of the fundamental problems of AI, applicable to many domains, from user interfaces to cyber-security. Despite the prevalence of these approaches, they lack a standard representation, and have not been compared using a common testbed. This paper provides a first step towards bridging this gap by providing a standard plan library representation that can be used by hierarchical, discrete-space plan recognition and evaluation criteria to consider when comparing plan recognition algorithms. This representation is comprehensive enough to describe a variety of known plan recognition problems and can be easily used by existing algorithms in this class. We use this common representation to thoroughly compare two known approaches, represented by two algorithms, SBR and Probabilistic Hostile Agent Task Tracker (PHATT). We provide meaningful insights about the differences and abilities of these algorithms, and evaluate these insights both theoretically and empirically. We show a tradeoff between expressiveness and efficiency: SBR is usually superior to PHATT in terms of computation time and space, but at the expense of functionality and representational compactness. We also show how different properties of the plan library affect the complexity of the recognition process, regardless of the concrete algorithm used. Lastly, we show how these insights can be used to form a new algorithm that outperforms existing approaches both in terms of expressiveness and efficiency.

Towards an Ontology-driven Intellectual Properties reuse for Systems On Chip design

Intellectual Properties reuse has gained widespread acceptance in System-On-Chip design to manage the complexity and shorten the time-to-market. However the need for a standard representation that permits IPs classification, characterization, and integration is still a big challenge. To address this problem, we propose to develop an IPs reuse specific ontology that facilitates IPs reuse at many levels of abstraction and independently from any design language or tool. Our ontology is built using the Protégé-OWL tool

A proteomics sample metadata representation for multiomics integration and big data analysis

The amount of public proteomics data is rapidly increasing but there is no standardized format to describe the sample metadata and their relationship with the dataset files in a way that fully supports their understanding or reanalysis. Here we propose to develop the transcriptomics data format MAGE-TAB into a standard representation for proteomics sample metadata. We implement MAGE-TAB-Proteomics in a crowdsourcing project to manually curate over 200 public datasets. We also describe tools and libraries to validate and submit sample metadata-related information to the PRIDE repository. We expect that these developments will improve the reproducibility and facilitate the reanalysis and integration of public proteomics datasets.

Ten simple rules for making a vocabulary FAIR

We present ten simple rules that support converting a legacy vocabulary—a list of terms available in a print-based glossary or in a table not accessible using web standards—into a FAIR vocabulary. Various pathways may be followed to publish the FAIR vocabulary, but we emphasise particularly the goal of providing a globally unique resolvable identifier for each term or concept. A standard representation of the concept should be returned when the individual web identifier is resolved, using SKOS or OWL serialised in an RDF-based representation for machine-interchange and in a web-page for human consumption. Guidelines for vocabulary and term metadata are provided, as well as development and maintenance considerations. The rules are arranged as a stepwise recipe for creating a FAIR vocabulary based on the legacy vocabulary. By following these rules you can achieve the outcome of converting a legacy vocabulary into a standalone FAIR vocabulary, which can be used for unambiguous data annotation. In turn, this increases data interoperability and enables data integration.

SEMANTIC AND CONTEXTUAL KNOWLEDGE REPRESENTATION USING INTER - LINGUA FOR AUTOMATED ASSESSMENT OF STRUCTURED C++ PROGRAM

The process of automatic evaluation of a structured C++ program has the first and foremost requirement of specifying the developed structural C++ program in a standard, generalized and unified format. This generalized and standard representation of the program needs to incorporate the specification in terms of semantics as per the language features used and also the contextual binding in regards of the program definition as perceived and desired by the subject expert. Hence an inter - lingua which can represent the semantic and contextual knowledge of the developed structured C++ program will be the first and foremost requirement towards the process of automated assessment and grading of a structured C++ program.The work presented here is published for patent at Patent Office Branch, Mumbai, India with the reference number E-12/215/2021/MUM and application number 202121000796.

On Modular Vector Invariant Fields

Let [Formula: see text] be a finite field of any characteristic and [Formula: see text] be the general linear group over [Formula: see text]. Suppose W denotes the standard representation of [Formula: see text], and [Formula: see text] acts diagonally on the direct sum of W and its dual space W∗. Let G be any subgroup of [Formula: see text]. Suppose the invariant field [Formula: see text], where [Formula: see text] in [Formula: see text] are homogeneous invariant polynomials. We prove that there exist homogeneous polynomials [Formula: see text] in the invariant ring [Formula: see text] such that the invariant field [Formula: see text] is generated by [Formula: see text] over [Formula: see text].

Computational tools for drawing, building and displaying carbohydrates: a visual guide

Drawing and visualisation of molecular structures are some of the most common tasks carried out in structural glycobiology, typically using various software. In this perspective article, we outline developments in the computational tools for the sketching, visualisation and modelling of glycans. The article also provides details on the standard representation of glycans, and glycoconjugates, which helps the communication of structure details within the scientific community. We highlight the comparative analysis of the available tools which could help researchers to perform various tasks related to structure representation and model building of glycans. These tools can be useful for glycobiologists or any researcher looking for a ready to use, simple program for the sketching or building of glycans.

Decomposition and classification of length functions

We study decompositions of length functions on integral domains as sums of length functions constructed from overrings. We find a standard representation when the integral domain admits a Jaffard family, when it is Noetherian and when it is a Prüfer domains such that every ideal has only finitely many minimal primes. We also show that there is a natural bijective correspondence between singular length functions and localizing systems.