Summaries of certain spatial patterns retrieved from multidate remote-sensing data.
SXCCP+: Simple XML Concurrency Control Protocol for XML Database Systems
Tamaño medio de árboles simplificados.
Estudiamos la media y la varianza del tamaño de los árboles simplificados obtenidos a partir de árboles p-arios y generales. Se demuestra que ambos parámetros son lineales en el tamaño del input. Pero lo que creemos más interesante del artículo es la metodología seguida, que pensamos podría aplicarse al análisis de gran parte de algoritmos de simplificación sobre árboles. Tal técnica involucra un estudio de ciertas series de potencias formales, y la aplicación del teorema de Darboux-Polya para aproximaciones...
The application of generalised constraints to object-oriented database models.
A formal framework for a generalised object-oriented database model is presented, which is able to cope with fuzzy and uncertain information. This model is obtained as a generalisation of a crisp object-oriented database model, which is consistent with the ODMG de facto standard and is built upon an algebraic type system and a constraint system. Generalised constraints have been used to enforce integrity rules and to specify the formal semantics of the database model.
The brownian motion : a neglected tool for the complexity analysis of sorted tables manipulation
The calculus of an unnormalized relational model of data
The complexity of classification problems
The complexity of lexicographic sorting and searching
An asymptotically optimal sorting algorithm that uses component comparisons to lexicographically sort the set of -tuples is presented. This sorting algorithm builds the static data structure - the so called optimal lexicographic search tree - in which it is possible to perform member searching for an unknown -tuple in at most comparisons. The number of comparisons...
The Diamond Tool: a way of effective development and utilization of knowledge
This paper presents the Diamond Tool for knowledge management. The main objective of its specification and implementation was to create a universal and easily extendable tool for efficient work with knowledge. One of its extensions is the eTrium technology. The principal idea behind this technology is to represent explicitly the knowledge used by the information system by means of a knowledge agent built on the Diamond Tool – in contrary to current approaches, where knowledge is present implicitly...
The distribution of -ary search trees generated by van der Corput sequences.
The entropy and redundancy of normalized database structures
The factor automaton
This paper concerns searching substrings in a string using the factor automaton. The factor automaton is a deterministic finite automaton constructed to accept every substring of the given string. Nondeterministic factor automaton is used to achieve new operations on factor automata for searching in non-constant texts.
The height of -binary search trees.
The limiting common distribution of two leaf heights in a random binary tree
The passing of a rational expression to a nondeterministic finite automaton. (Passage d'une expression rationnelle à un automate fini non-déterministe.)
The server specification for information retrieval of bibliographic data.
The star clustering algorithm for static and dynamic information organization.
The Structure and complexity of interactive zero-knowledge proofs
The sum-product algorithm: algebraic independence and computational aspects
The sum-product algorithm is a well-known procedure for marginalizing an “acyclic” product function whose range is the ground set of a commutative semiring. The algorithm is general enough to include as special cases several classical algorithms developed in information theory and probability theory. We present four results. First, using the sum-product algorithm we show that the variable sets involved in an acyclic factorization satisfy a relation that is a natural generalization of probability-theoretic...
The use of fuzzy connectives to design real-coded genetic algorithms.
Genetic algorithms are adaptive methods that use principles inspired by natural population genetics to evolve solutions to search and optimization problems. Genetic algorithms process a population of search space solutions with three operations: selection, crossover and mutation. A great problem in the use of genetic algorithms is premature convergence; the search becomes trapped in a local optimum before the global optimum is found. Fuzzy logic techniques may be used for solving this problem. This...