The search session has expired. Please query the service again.
Coalgebras have been proposed as formal basis for the semantics of objects in the sense of object-oriented programming. This paper shows that this semantics provides a smooth interpretation for subtyping, a central notion in object-oriented programming. We show that different characterisations of behavioural subtyping found in the literature can conveniently be expressed in coalgebraic terms. We also investigate the subtle difference between behavioural subtyping and refinement.
Coalgebras have been proposed as formal basis for the semantics of
objects in the sense of object-oriented programming.
This paper shows that this semantics provides a smooth
interpretation for subtyping,
a central notion in object-oriented programming.
We show that different characterisations of
behavioural subtyping
found in the literature can conveniently be expressed in coalgebraic terms.
We also investigate the subtle difference between
behavioural subtyping and refinement.
An evolutionary algorithm formalism has been forwarded in a previous research, and implemented in the system GIGANTEC: Genetic Induction for General Analytical Non-numeric Task Evolution Compiler [Bad98][Bad99]. A dynamical model is developed to analyze the behaviour of the algorithm. The model is dependent in its analysis on classical Compilers Theory, Game Theory and Markov Chains and its convergence characteristics. The results conclude that a limiting state is reached, which is independent of...
We combine a new data model, where the random classification is subjected to rather weak restrictions which in turn are based on the Mammen−Tsybakov [E. Mammen and A.B. Tsybakov, Ann. Statis. 27 (1999) 1808–1829; A.B. Tsybakov, Ann. Statis. 32 (2004) 135–166.] small margin conditions, and the statistical query (SQ) model due to Kearns [M.J. Kearns, J. ACM 45 (1998) 983–1006] to what we refer to as PAC + SQ model. We generalize the class conditional constant noise (CCCN) model introduced by Decatur...
Among several alternative viewpoints for building software quality metrics, evaluating the consistency between different models in a software specification or implementation appears to be fruitful. An obvious difficulty is that different models are usually expressed by means of different concepts, and then, confronting heterogeneous representations is not straightforward. In this paper, we propose a solution for measuring the consistency between the architecture and the communication models. After...
Among several alternative viewpoints for building software quality metrics, evaluating the consistency between different models
in a software specification or implementation appears to be fruitful.
An obvious difficulty is that different models are usually expressed
by means of different concepts, and then, confronting heterogeneous
representations is not straightforward.
In this paper, we propose a solution for measuring the
consistency between the architecture and the communication models.
After...
We study in this paper the electromagnetic field generated in a conductor by an alternating current density. The resulting interface problem (see Bossavit (1993)) between the metal and the dielectric medium is treated by a mixed–FEM and BEM coupling method. We prove that our BEM-FEM formulation is well posed and that it leads to a convergent Galerkin method.
We study in this paper the electromagnetic field generated in a
conductor by an alternating current density. The resulting
interface problem (see Bossavit (1993)) between the metal and the
dielectric medium is treated by a mixed–FEM and BEM coupling
method. We prove that our BEM-FEM formulation is well posed and
that it leads to a convergent Galerkin method.
A generalization of the homogenization process needed for the neural implementation of multi-adjoint logic programming (a unifying theory to deal with uncertainty, imprecise data or incomplete information) is presented here. The idea is to allow to represent a more general family of adjoint pairs, but maintaining the advantage of the existing implementation recently introduced in [6]. The soundness of the transformation is proved and its complexity is analysed. In addition, the corresponding generalization...
When Henri Cohen and his coworkers set out to write PARI twenty years ago, GP was an afterthought. While GP has become the most commonly used interface to the PARI library by a large margin, both the gp interpretor and the GP language are primitive in design. Paradoxically, while gp allows to handle very high-level objects, GP itself is a low-level language coming straight from the seventies.We rewrote GP as a compiler/evaluator pair, implementing several high-level features (statically scoped variables,...
A new method for applying grammar based Genetic Programming to learn fuzzy rule based classifiers from examples is proposed. It will produce linguistically understandable, rule based definitions in which not all features are sent in the antecedents. A feature selection is implicit in the algorithm. Since both surface and deep structure will be learned, standard grammar based GP is not applicable to this problem. We have adapted GA-P algorithms, a method formerly defined as an hybrid between GA and...
Currently displaying 1 –
20 of
48