Knowledge-intensive processes are widely used to recover from errors, handle exceptional cases and complaints, and to improve or adapt a process itself. In this context, evolved Business-Process Reengineering (BPR) techniques are changing to give some answers to this reality. In…

AbstractDue to aspect-oriented mechanisms explosion, their concepts arrive to distributed systems tackling concepts as security, persistence, or synchronization, especially in middleware approaches. Regarding distributed databases, the research has been focused mainly on object-oriented databases. Based on the great impact of…

EQUIVALENCE OF SOME STRINGS. THESE ARE LOWERCASE VERUS UPPERCASE MATCHING, MORPHOLOGICAL INFLECTION, DERIVATION, AND SYNONYMY OF WORDS: E.G. GIVE A QUERY COMPUTER, FIND COMPUTER COMPUTING, WORKSTATION. THE LATTER PROBLEMS ARE VERY IMPORTANT IN LANGUAGES WITH RICHER MORPHOLOGY AND LESS STABLE…

This paper describes an approach to On Line Analytical Processing (OLAP), expresed in the declarative programming paradigm.
We define a collection of functions that capture some of the functionality currently provided by multidimensional database product. This is done by defining…

When stakeholders are geographically distributed communication presents new challenges for software engineering community. In order to improve communication between stakeholders, we have previously proposed to apply learning style models to characterise the way people interact. In this work we enhance…

This document describes a research and development project - Semantic Web and Cooperative Problem Solving for Online Communities of Practice. The aim of the project is to build a system supporting Cooperative Problem Solving within the framework of online Communities…

The concept of “approximate” searching has applications in a vast number of fields. Some examples are non-traditional databases (e. g. storing images, fingerprints or audio clips, where the concept of exact search is of no use and we search instead…

THE GOAL OF THIS PAPER IS TO DOCUMENT THE USE OF TIME SERIES IN COLOR MATCHING. ALTHOUGH TIME SERIES ARE NOT COMMONLY USED FOR THIS PURPOSE, THE RESULTS OBTAINED, BASED ON THE PRINCIPLE OF SIMILARITY IN TIME SERIES USING THE…

Nowadays, data intensive applications are in constant demand and there is need of computing environments with better intelligent capabilities than those present in today's Database Management Systems (DBMS). To build such systems we need formalisms that can perform complicate inferences,…

This paper presents a data structure based on Sparse Spatial Selection (SSS) for similarity searching. An algorithm that tries periodically to adjust pivots to the use of database index is presented. This index is dynamic. In this way, it is…