A bound on correlation immunity.
A category theory approach to conceptual data modeling
A characterization of the set of fixed points of the quicksort transformation.
A combinatorial topology approach of data consolidation.
A comparative study of microaggregation methods.
Microaggregation is a statistical disclosure control technique for microdata. Raw microdata (i.e. individual records) are grouped into small aggregates prior to publication. Each aggregate should contain at least k records to prevent disclosure of individual information. Fixed-size microaggregation consists of taking fixed-size microaggregates (size k). Data-oriented microaggregation (with variable group size) was introduced recently. Regardless of the group size, microaggregations on a multidimensional...
A comparison between local and global recoding algorithms for achieving microdata -sensitive -anonymity.
A computational perspective on network coding.
A data model for indexing and searching XML documents.
A database model for library material usage.
A first approach to the multipurpose relational database server.
In this paper, an architecture and an implementation of a multipurpose relational database server are proposed. This architecture enables classical queries to be executed, deductions to be made, and data mining operations to be performed on fuzzy or classical data. The proposal of this integration is to combine several ways of querying different types of data. In order to achieve this, a combination of existing meta-knowledge bases and new data catalog elements is presented. We also introduce a...
A Formal, Object-Oriented Approach to the Machine Interference Model
A fuzzy shape database to support conceptual design
A GA-P algorithm to automatically formulate extended Boolean queries for a fuzzy information retrieval system.
Although the fuzzy retrieval model constitutes a powerful extension of the Boolean one, being able to deal with the imprecision and subjectivity existing in the Information Retrieval process, users are not usually able to express their query requirements in the form of an extended Boolean query including weights. To solve this problem, different tools to assist the user in the query formulation have been proposed. In this paper, the genetic algorithm-programming technique is considered to build...
A generalisation of entity and referential integrity in relational databases
Entity and referential integrity are the most fundamental constraints that any relational database should satisfy. We re-examine these fundamental constraints in the context of incomplete relations, which may have null values of the types “value exists but is unknown” and “value does not exist”. We argue that in practice the restrictions that these constraints impose on the occurrences of null values in relations are too strict. We justify a generalisation of the said constraints wherein we use...
A Generalisation of Entity and Referential Integrity in Relational Databases
Entity and referential integrity are the most fundamental constraints that any relational database should satisfy. We re-examine these fundamental constraints in the context of incomplete relations, which may have null values of the types "value exists but is unknown" and "value does not exist" . We argue that in practice the restrictions that these constraints impose on the occurrences of null values in relations are too strict. We justify a generalisation of the said constraints wherein we use...
A hierarchy for circular codes
We first prove an extremal property of the infinite Fibonacci* word f: the family of the palindromic prefixes {hn | n ≥ 6} of f is not only a circular code but “almost” a comma-free one (see Prop. 12 in Sect. 4). We also extend to a more general situation the notion of a necklace introduced for the study of trinucleotides codes on the genetic alphabet, and we present a hierarchy relating two important classes of codes, the comma-free codes and the circular ones.
A limit theorem for “quicksort”
A limiting distribution for quicksort
A Logic Approach for Exceptions and Anomalies in Association Rules.
A method of constructing the frame of a directed graph
In web search engines, such as Google, the ranking of a particular keyword is determined by mathematical tools, e.g., Pagerank or Hits. However, as the size of the network increases, it becomes increasingly difficult to use keyword ranking to quickly find the information required by an individual user. One reason for this phenomenon is the interference of superfluous information with the link structure. The World Wide Web can be expressed as an enormous directed graph. The purpose of the present...