This paper proposes an extended negative selection algorithm for anomaly detection. Unlike previously proposed negative selection algorithms which directly construct detectors in the complementary space of self-data space, our approach first evolves a number of common schemata through coevolutionary genetic algorithm in self-data space, and then constructs detectors in the complementary space o...

Many interoperable database systems o er the possibility of de ning integrated schemata on top of heterogeneous databases. A very important challenge for these interoperable database systems is to maintain the autonomy of the component databases while preserving the correct semantics of the integrated schemata. This paper presents a mechanism that responds automatically to design changes made i...

Conceptual level database design should be managed independently of its implementation. Therefore, once a conceptual level schema has been completed, some transformation methods must exist which can be used in the construction of an implementation level design supported by the target model (e.g., relational, object-oriented, network). This paper provides a method for the transformation of conce...

A DGA is a genetic algorithm with novel features: relational schemata. These structures allow a more natural expression of relations existing between loci. Indeed, schemata in standard genetic algorithms can only specify values for each locus. Relational schemata are based on the notion of duality: a schema can be represented by two strings. The intent of this paper is to show the superiority o...

We present architectural schemata, visual “roadmaps” that provide a lucid picture of the design of object oriented programs. Construed in a formal language, architectural schemata can contribute significantly to the comprehensibility of large systems and provide a rigorous framework to their analysis. We present LePUS, a formal language for the specification of object oriented architectures. We...

The parsing schemata formalism allows us to describe parsing algorithms in a simple way by capturing their fundamental semantics while abstracting low-level detail. In this work, we present a compilation technique allowing the automatic transformation of parsing schemata to executable implementations of their corresponding algorithms. Taking a simple description of a schema as input, our techni...

Causal inferences about sparsely observed objects are often supported by causal schemata, or systems of abstract causal knowledge. We present a hierarchical Bayesian framework that learns simple causal schemata given only raw data as input. Given a set of objects and observations of causal events involving some of these objects, our framework simultaneously discovers the causal type of each obj...

The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamental semantics while abstracting low-level detail. In this work, we present a compilation technique allowing the automatic transformation of parsing schemata to efficient executable implementations of their corresponding algorithms. Our technique is general enough to be...

A logic is presented for reasoning on iterated sequences of formulæ over some given base language. The considered sequences, or schemata, are defined inductively, on some algebraic structure (for instance the natural numbers, the lists, the trees etc.). A proof procedure is proposed to relate the satisfiability problem for schemata to that of finite disjunctions of base formulæ. It is shown tha...