On the Loop Homology of a Certain Complex of RNA Structures

In this paper, we establish a topological framework of τ-structures to quantify the evolutionary transitions between two RNA sequence–structure pairs. τ-structures developed here consist of a pair of RNA secondary structures together with a non-crossing partial matching between the two backbones. The loop complex of a τ-structure captures the intersections of loops in both secondary structures. We compute the loop homology of τ-structures. We show that only the zeroth, first and second homology groups are free. In particular, we prove that the rank of the second homology group equals the number γ of certain arc-components in a τ-structure and that the rank of the first homology is given by γ−χ+1, where χ is the Euler characteristic of the loop complex.

On the Loop Homology of a Certain Complex of RNA Structures

In this paper we establish a topological framework of τ-structures to quantify the evolutionary transitions between two RNA sequence-structure pairs. τ-structures developed here consist of a pair of RNA secondary structures together with a non-crossing partial matching between the two backbones. The loop complex of a τ-structure captures the intersections of loops in both secondary structures. We compute the loop homology of τ-structures. We show that only the zeroth, first and second homology groups are free. In particular, we prove that the rank of the second homology group equals the number γ of certain arc-components in a τ-structure, and the rank of the first homology is given by γ−χ+1, where χ is the Euler characteristic of the loop complex.

Detection and localization of partial audio matches in various application scenarios

In this paper, we describe various application scenarios for archive management, broadcast/stream analysis, media search and media forensics which require the detection and accurate localization of unknown partial audio matches within items and datasets. We explain why they cannot be addressed with state-of-the-art matching approaches based on fingerprinting, and propose a new partial matching algorithm which can satisfy the relevant requirements. We propose two distinct requirement sets and hence two variants / settings for our proposed approach: One focusing on lower time granularity and hence lower computational complexity, to be able to deal with large datasets, and one focusing on fine-grain analysis for small datasets and individual items. Both variants are tested using distinct evaluation sets and methodologies and compared with a popular audio matching algorithm, thereby demonstrating that the proposed algorithm achieves convincing performance for the relevant application scenarios beyond the current state-of-the-art.

An Empirical Evaluation of Prediction by Partial Matching in Assembly Assistance Systems

Industrial assistive systems result from a multidisciplinary effort that integrates IoT (and Industrial IoT), Cognetics, and Artificial Intelligence. This paper evaluates the Prediction by Partial Matching algorithm as a component of an assembly assistance system that supports factory workers, by providing choices for the next manufacturing step. The evaluation of the proposed method was performed on datasets collected within an experiment involving trainees and experienced workers. The goal is to find out which method best suits the datasets in order to be integrated afterwards into our context-aware assistance system. The obtained results show that the Prediction by Partial Matching method presents a significant improvement with respect to the existing Markov predictors.