In this paper a new, general and exact schema theory for genetic programming is presented. The theory includes a microscopic schema theorem applicable to crossover operators which replace a subtree in one parent with a subtree from the other parent to produce the offspring. A more macroscopic schema theorem is also provided which is valid for crossover operators in which the probability of sele...

A new genetic search strategy involving chromosome differentiation into two classes and a restricted form of crossover operation is defined. Its application to multi-dimensional pattern recognition problems is studied. Superiority of the classifier is established for four sets of different artificial and real-life data. Schema analysis is provided. © 1997 Published by Elsevier Science B.V.

In this paper we present an evolution of the DTD++ schema language for XML documents. The original DTD++ language provided support for a large and significant subset of XML Schema while maintaining a syntax closely resembling DTDs: thus the expressive power of XML Schema and the readability of DTDs were both supported in a modular architecture that could rely on a number of validating engine fo...

Mediation of Cohesive Clues in Simultaneous Interpreting: A Perspective of Interactive Embodiment and Mental Coherence Gao Wei Heriot-Watt University Abstract Based on interactive embodiment and mental coherence of cognitive linguistics (CL) (Lakoff1987, 1999; Langacker 2000, Zwaan2000, Wang Yin 2006) and also Relevance Theory (RT) (Sperber and Wilson 1986, 1995), this paper aims to reveal how ...

The problem of supporting temporal schema versioning has been extensively studied in the context of the relational model. In the object-oriented environment, previous works were devoted to the study of the different aspects of schema evolution or (non-temporal) versioning in branching models, due to the traditional origination of the object-oriented model from CAD/CAM and CIM. Nowadays, the com...

Schema matching is the task of automatically computing correspondences between schema elements. A multitude of schema matching approaches exists for various scenarios using syntactic, semantic, or instance information. The schema matching problem is aggravated by the fact that models to be matched are often represented in different modeling languages, e.g. OWL, XML Schema, or SQL DDL. Consequen...

Supporting legacy applications when the database schema evolves represents a long-standing challenge of practical and theoretical importance. Recent work has produced algorithms and systems that automate the process of data migration and query adaptation; however, the problems of evolving integrity constraints and supporting legacy updates under schema and integrity constraints evolution are si...