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 20 of 55 for “"binary relations"”.
-
Tukey Morphisms Between Finite Binary Relations
Let A = (A−, A+, A) and B = (B−, B+, B) be relations. A morphism is a pair of maps φ− : B− → A− and φ+ : A+ → B+ such that for all b ∈ B− and a ∈ A+, φ−(b)Aa ⟹ bBφ+(a). We study the existence of morphisms between finite relations. The ultimate goal is to identify the conditions under which …
-
Adaptive Algorithms for Weighted Queries on Weighted Binary Relations and Labeled Trees
… on two different data structures: weighted binary relations and weighted multi-labeled trees. We propose adaptive algorithms to solve these queries and prove the measures of the complexity of these algorithms in terms of the high-level operations. We describe how these algorithms can be …
-
Siblings of Binary Relations: The Case of Direct Sums of Chains, NE-Free Posets and Trees
… conjecture and its alternate form for some binary relations. Thomasse's conjecture states that a countable relation has either one, countably many or continuum many siblings, up to isomorphism and the alternate form says that a relation of any cardinality has one or infinitely many siblings, …
-
On sets of first-order formulas axiomatizing representable relation algebras
… additional operations that generalize sets of binary relations that are closed under the operations union, intersection, complementation, composition, conversion, and identification. An (abstract) relation algebra is representable if it is isomorphic to such an algebra of binary relations. The …
-
SOME PROPERTIES OF BASIC ORDER RELATIONS IN THE ARITHMETIC OF RELATION ALGEBRAS
The theory of relations has been investigated by Peirce and Schröder, the works of the latter being extensive, albeit tedious to read. In 1941 Tarski gested that continued study of the theory of relations would be productive, that certain of the more important properties in that theory of relations …
-
Succinct Indexes
… indexes for various data types, namely strings, binary relations, multi-labeled trees and multi-labeled graphs, as well as succinct text indexes. For strings, binary relations and multi-labeled trees, when the operators in the ADTs are supported in constant time, our results are comparable to …
-
From Homologous Genes to Phylogenetic Species Trees
… of orthology, paralogy, and xenology imply binary relations on pairs of genes. These relations, in turn, convey meaningful phylogenetic information and allow the inference of plausible phylogenetic species trees. To this end, it is shown that orthology, paralogy, and xenology have to fulfill …
-
An Investigation into the Formal Representation of Normative Moral Theories
… for a wide range of moral theories that are binary and coherent. It was found that binary and coherent permissibility functions are representable by coherent binary relations over options and binary and coherent supererogation functions are representable by coherent binary relations over …
-
Representation techniques for relational languages and the worst case asymptotical time complexity behaviour of the related algorithms.
… on extensionally or intensionally represented binary relations. Those relational operations come from a relational language being designed at Naval Postgraduate School. One particular extensional representation technique and two intensional representation techniques are proposed. The above …
-
Green's relations in semigroups of functions
… chapters of this paper we characterize Green's relations in various semigroups of continuous functions . In the third chapter we use the above characterizations in an investigation of the functions contained in H- classes of idempotents . In the fourth chapter we look at semi group homomorphisms …
-
A formalization of logic in diagonal-free cylindric algebras
… logic can be formalized in the calculus of binary relations (a result due to Maddux and Tarski). Finally, we use these constructions to recursively define a translation function from the sentences of first-order logic to the equational theory of diagonal-free cylindric algebras of dimension …
-
Μελέτη μεθοδολογιών παραλληλισμού για την υλισμική απεικόνιση της άλγεβρας δυαδικών σχέσεων και κανόνων από δένδρα αποφάσεων
… objects can be viewed as interconnected forming relationships amongst them. A set of interconnected objects can also be considered as a set of pairs of objects, since the pairing implies a relation (connection) between the pair members. A binary relation is defined as a set of such object pairs. …
-
Space-Efficient Data Structures for Information Retrieval
… indexes, we present new results on representing binary relations in a space-efficient manner, and construction algorithms that use little space to achieve their goal. These two results have a wide range of applications. In particular, the representations for binary relations can be used as a …
-
Weak representation theory in the calculus of relations
… algebras are abstractions of collections of binary relations under the operations of union, intersection, complementation, relational composition, inversion, and identity. A relation algebra is called representable if it is isomorphic to such a collection of relations. An algebra is called …
-
Towards scalable hypergraph processing algorithms and their applications
Graphs are a natural model for representing binary relations. However, it is difficult to use graphs to capture non-binary relations such as communities of nodes. For example, graphs cannot accurately model protein complex networks since a protein complex might form in presence of more than two …
-
Semigroups of straight I-quotients: a general approach
… The first set of conditions is in terms of two binary relations and an associated partial order and the proof relies on the meet structure of the L-classes of inverse semigroups. The second set of conditions in terms of two binary relations and a ternary relation and the proof is purely …
-
Unavoidable Immersions and Intertwines of Graphs
The topological minor and the minor relations are well-studied binary relations on the class of graphs. A natural weakening of the topological minor relation is an immersion. An immersion of a graph H into a graph G is a map that injects the vertex set of H into the vertex set of G such that edges …
-
Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures
… its inverse, and the problem of representing a binary relation. These results are divided in two groups: lower bounds in the cell probe model and lower bounds in the indexing model. The cell probe model is the most natural and widely accepted framework for studying data structures. In this …
-
ReAlM - a system to manipulate relations
… can represent the relation algebra by concrete binary relations between sets, which means the algebra may be seen as an algebra of Boolean matrices. However, it is not possible to represent every relation algebra. It is well known that the smallest relation algebra that is not representable has …
-
Parallel query processing for cloud computing environments
… Reduce. With special focus on input, that is, binary relations and ”fat” relations. A multiway join algorithm is implemented on the two types of inputs and comparisons are made, where we find that "fat" relations achieve better process time due to the nature of these datasets. In the case of …
Page 1 of 3