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 16 of 16 for “"Distributive Law"”.
-
Theory and practice of coordination algorithms exploiting the generalised distributive law
… more detail, max-sum is based on the generalised distributive law (GDL), a well known algebraic framework that has been used in disciplines such as artificial intelligence, machine learning and statistical physics, to derive effective algorithms to solve optimisation problems. Our iv contribution …
-
A monadic theory of point processes
… that this composition also forms a monad using a distributive law for monads. We also explore distributive laws for infinite point processes, where an infinite point process on <em>X</em> is a random stream of elements in <em>X</em>. We show that while there is no distributive law showing the …
-
2-categories and cyclic homology
The topic of this thesis is the application of distributive laws between comonads to the theory of cyclic homology. The work herein is based on the three papers 'Cyclic homology arising from adjunctions', 'Factorisations of distributive laws', and 'Hochschild homology, lax codescent,and duplicial …
-
Two different instructional procedures for a multiplication algorithm and their transfer effects to a higher-order algorithm
… problems via the application of the distributive law. After this readiness phase was completed, students were randomly assigned to either a Tl or T2 treatment group. The Tl subjects were taught a rote-type standard multiplication algorithm for determining the solution of 2 x 1 and 3 x …
-
On the non-compositionality of monads via distributive laws
… sometimes be composed to form composite monads. Distributive laws ensure that such composite monads capture the full behaviour of both their components, creating a lifting of the component monads to the appropriate Kleisli or Eilenberg-Moore categories. However, for a given pair of monads there …
-
Radicals in near-rings
… of commutativity of addition and the right distributive law is called a near-ring. This thesis is intended as a survey of radicals in near-rings, and an organization of the theory which has been developed to date. Because of the absence of the right distributive law, the zero element of a …
-
A Kleene Theorem and Decision Problems for Probability and Angelic Nondeterminism
… problem, chiefly due to the provable lack of a distributive law between the powerset and Giry monads. This thesis focuses on the theory of a version of probabilistic Kleene al- gebra with angelic nondeterminism and the corresponding class of automata. This approach implements semantics via …
-
Pseudomonads, Relative Monads and Strongly Finitary Notions of Multicategory
… of his proof of the equivalence between pseudodistributive laws and liftings of pseudomonads to 2-categories of pseudoalgebras. Secondly, we introduce the notion of a distributive law between a relative monad and a monad. We call this a relative distributive law and define it in any 2- category …
-
New Message Passing Methods for Min-Max and Sum-Product Inference
Message passing algorithms powered by the distributive law of mathematics are efficient in finding approximate solutions to NP-hard inference problems. This thesis proposes new message passing algorithms to enable and improve performance in two important modes of inference. First is min-max …
-
The Factoradic Integers
… the usual rules of arithmetic with a modified distributive law. The basic algebra of such mathematical structures is examined; this leads to the consideration of the integers as a metric space under the "factoradic metric", i.e., the integers equipped with a distance function defined by …
-
Commutative, idempotent groupoids and the constraint satisfaction problem
… the variety of CI-groupoids satisfying the self-distributive law x(yz)=(xy)(xz), and show that they are tractable. Varieties of CI-groupoids satisfying other identities strictly weaker than associativity are also considered, and shown to be tractable.</p>
-
Arboreal covers over relational structures
… e.g. pathwidth.</p> <p> - We show that coKleisli laws of functorial operations over game comonads recover Feferman-Vaught-Mostowski theorems. Feferman-Vaught-Mostowski theorems are a basic tool used to show when a operation that combines structures preserves logical equivalence. </p> <p> - One of …
-
Decentralised coordination of smart distribution networks using message passing
… manner using algorithms based on the generalised distributive law; in particular the max-sum algorithm. We go on to show that max-sum applied naively in this setting performs a large number of redundant computations. To address this issue, we present both a discrete and a continuous novel …
-
Composing classical and quantum relaxations of CSP and structure isomorphism
… theory.<br><br>A key focus is the exploration of distributive laws, the existence of which enables the combination of comonads and monads, potentially leading to novel relaxations of CSP and structure isomorphism that integrate ideas from different domains. We establish a no-go theorem, showing …
-
Speeding up GDL-based distributed constraint optimization algorithms in cooperative multi-agent systems
… Specifically, we identify that Generalized Distributive Law (GDL) based inference algorithms have a number of axiomatic benefits, and as such, are suited to deploy in practical multi-agent settings. However, scalability remains a widely acknowledged challenge for these algorithms owing to a …
-
Existential completion and pseudo-distributive laws: an algebraic approach to the completion of doctrines
… by the theory of the pseudo-monads and pseudo-distributive laws. Every completions of doctrines is then formalized by a pseudo-monad, and then combinations of these are studied by the analysis of the pseudo-distributive laws. The starting point are the works of Maietti and Rosolini, in which …