The h-TechSight Knowledge Management Portal (KMP) enables support for knowledgeintensive industries in monitoring information resources on the Web, as an important factor in business competitiveness. The portal contains tools for identification of concepts and terms from an ontology relevant to the user’s interests, and enables the user to monitor them over time. It also contains tools for onto...

This article depicts the idea of service based Knowledge Management and introduces a method to design an Enterprise Knowledge Management System (E-KMS). We assume that each organisation already uses an E-KMS but only few organisations are aware of it and even less organisations design their E-KMS properly to manage their internal processes. These internal processes of an E-KMS are seen as Knowl...

In [BCGM01] we have generalized the Knuth-Morris-Pratt (KMP) pattern matching algorithm and defined a nonconventional kind of RAM, the MP–RAMs which model more closely the microprocessor operations, and designed an O(n) on-line algorithm for solving the serial episode matching problem on MP–RAMs when there is only one single episode. We here give two extensions of this algorithm to the case whe...

The aim of this work is to incorporate constraints into the partial evaluation procedure in order to obtain further specialisation through greater (constraint-based) information propagation. We incorporate constraints into the algorithm for the partial evaluation of the Escher language, a functional logic language based on rewriting. The preliminary implementation of the partial evaluator uses ...

Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Orthogonal) Matching Pursuit (OMP) [16]. The algorithm is based on the geometry of the polar polytope where at each step a basis function is chosen by finding the maximal vertex using a path-following method. The algorithmic comp...

In this paper we propose a new algorithm called MEPda (Motif Extraction algorithm based on Push-down automata) to solve the problem of finding patterns containing loops. These loop-patterns or loop-motifs are very known and used in many domains, especially in mathematics and bioinformatics. MEPda meant to find these kinds of patterns by using pushdown automata as a mechanism of matching process...

Given a text T and a pattern P over alphabet Σ, the classic exact matching problem searches for all occurrences of pattern P in text T . Unlike exact matching problem, order-preserving pattern matching (OPPM) considers the relative order of elements, rather than their real values. In this paper, we propose an efficient algorithm for OPPM problem using the “duel-and-sweep” paradigm. Our algorith...

This paper describes our recent studies on string pattern matching in compressed texts mainly from practical viewpoints. The aim is to speed up the string pattern matching task, in comparison with an ordinary search over the original texts. We have successfully developed (1) an AC type algorithm for searching in Huffman encoded files, and (2) a KMP type algorithm and (3) a BM type algorithm for...