When developing a system in Model-driven Engineering (MDE), developers change the same diagram in parallel. These changes generate different versions that may conflict. Conflicts can be syntactic, related to the structure of the diagram, or semantic, related to the meaning of the diagram. The detection of semantic conflicts in diagrams should take into consideration both the syntax and semantic...

In this paper observational equivalence for so-called Jordan networks, which are a special class of recurrent networks, is analysed. We show this type of neural nets to belong to a wider class of mixed networks and use the description of observational equivalence available for the latter class for obtaining the respective results for the rst class. nonlinear systems, recurrent neural nets, stru...

Subjects were exposed to a word-picture association training phase in which each of 2 arbitrary nonsense syllables printed in blue and red font, respectively, were paired with either sexual or aversive photographic images. Subjects were then exposed to an equivalence training procedure that led to the formation of 2 3-member equivalence relations, each containing 1 of the 2 nonsense syllables i...

This paper presents an analysis of a simple tree-structured disjoint set Union-Find algorithm, and shows that this algorithm requires between n and 2n steps on the average to execute a sequence of n Union and Find instructions, assuming that each pair of existing classes is equally likely to be merged by a Union instruction. Union-Find algorithms are useful in the solution to a number of proble...

An equivalence is a binary relational system A = (A, ρA) where ρA is an equivalence relation on A. A simple expansion of an equivalence is a system of the form (Aa1 an) were A is an equivalence and a1, . . . , an are members of A. It is shown that the Fraenkel–Carnap question when restricted to the class of equivalences or to the class of simple expansions of equivalences has a positive answer:...

The main concept of this classification is that graphs belonging to the same equivalence class have similar topological properties. Graphs are called homotopy equivalent if one of them can be converted to the other one by contractible transformations. A basic representative and complexity of a homotopy equivalence class are defined and investigated. Finding a basic representative within a homot...

This short paper introduces a method for verifying equivalence classes for module/unit testing. This is achieved using a two-layer covering array, in which some or all values of a primary covering array represent equivalence classes. A second layer covering array of the equivalence class values is computed, and its values substituted for the equivalence class names in the primary array. It is s...

We consider groups and equivalence relations with infinitely many ends and the problem of selecting one end in a uniform manner. In general a non-amenable equivalence relation may have infinitely many ends and yet admit a Borel function selecting from each class a single end; however, we show that in the presence of an invariant Borel probability measure, the equivalence having infinitely many ...