Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"Transitive relation"”.
-
Groups in Which Commutativity Is a Transitive Relation
… G is called a CT-group if commutativity is a transitive relation on the set of non-identity elements of G. This dissertation is concerned with the class of CT-groups. Finite and locally finite CT-groups are studied in detail with structure theorems given in both solvable and insolvable cases. …
-
The Relative Control of Component Dimensions of Compound Tactile Stimuli in Equivalence Relations.
… a series of 48 posttest trials for the derived relations of symmetry and transitivity and 24 probes assessing the relative control associated with the tactual dimensions of shape and texture for the transitive relation. A Student's - t test was used to analyze male and female differences in …
-
A Coupling-Complexity Metric Suite for Predicting Software Quality
… of a method invocation chain through the transitive relation of invocations involved in a coupling. This results in a measure that identifies objects that are coupled to highly complex methods or method invocation chains. The metrics were implemented as an Eclipse Plug-in and an analysis …
-
Combinatorial aspects of finite topological spaces via the representation theory of the symmetric group
… on Top(Xn) to an action on the set of reflexive, transitive relation on Xn. We use this presentation to find orbits, O ⊂ Top(Xn), such that CO is an algebra faithful representations, and orbits that are in bijection with orbits of the action of Sn on the set of Young tabloids.
-
An Efficient Method for Representing and Computing Transitive Closure over Temporal Relations
… This approach provides a rich set of temporal relations for reasoning over events and changes in state. The full temporal algebra is NP-complete however. The algorithm developed by Allen executes in 0(n3) time but only ensures consistency between any three intervals. This research presents an …
-
Mapping programs to equations
… statements, by means of the concept of invariant relation; an invariant relation is a reflexive transitive relation that links program states separated by an arbitrary number of iterations.</p><p>But the function derived for large and complex programs may be too unwieldy to be useful, not unlike …
-
The Equivalence "t" on ω-Orthodox Semigroups.
If X is a subset of a semigroup, E(X) will denote the set of idempotents of X. A regular semigroup S will be termed an w-orthodox semigroup if E(S) is an ω-chain of rectangular bands (Ennen, the non-negative integers).
-
Massively parallel reasoning in transitive relationship hierarchies
… developed and implemented a massively parallel transitive closure reasoner, called Hydra, that can dynamically assimilate any transitive, binary relation and efficiently answer queries using the transitive closure of all those relations. Within certain limitations, we achieve constant-time …
-
Inventories, monetary factors, and propagation of cycles
… is a disagreement among economists about the relation between inventories and certain macroeconomic variables such as interest rate and prices. The differences in the results among the economists are mainly related to how to investigate this relation or which model to use to study this …