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 89 for “"finite sets"”.
-
Combinatorics of finite sets
… represent the subset lattice of (n) with sets ordered by inclusion. A collection I of subsets of (n) is called an ideal if every subset of a member of I is also in I. An intersecting family S in 2$\sp{\lbrack n\rbrack }$ is called a star if there exists an element of (n) belonging to every …
-
Multiple Target Tracking Using Random Finite Sets
… and detection of dynamic objects. Two random finite sets filters are developed to track the extracted dynamic objects. First, the Occupancy Grid (OG) Gaussian Mixture (GM) Probability Hypothesis Density (PHD) filter jointly tracks the target kinematic states and a modified occupancy grid map …
-
Spacecraft Relative Navigation Using Random Finite Sets
… thesis demonstrates the feasibility of random finite set (RFS) filters for spacecraft relative navigation and pose estimation. A generalized RPO scenario is formulated as a simultaneous localization and mapping (SLAM) problem, in which an observer spacecraft seeks to simultaneously estimate the …
-
Clones over Finite Sets and Minor Conditions
… of all clones of operations over a finite set is one of the goals at the heart of universal algebra. In 1921 Post provided a full description of the lattice of all clones over a two-element set. However, over the following years, it has been shown that a similar classification seems …
-
Random finite sets for multitarget tracking with applications
… of targets present and their states from noisy sets of measurements. The difficulty of the multitarget tracking problem is that the number of targets present can change as targets appear and disappear while the sets of measurements may contain false alarms and measurements of true targets may be …
-
Multi-Robot Active Information Gathering Using Random Finite Sets
… we utilize filtering algorithms based on random finite sets to simultaneously estimate the number of objects and their locations within the environment without the need to explicitly consider data association. Using the resulting estimates they receive, robots choose actions that maximize the …
-
The Axiom of Choice for Collections of Finite Sets
Some implications among finite versions of the Axiom of Choice are considered. In the first of two chapters some theorems are proven concerning the dependence or independence of these implications on the theory ZFU, the modification of ZF which permits the existence of atoms. The second chapter …
-
Sampling Laws for Stochastically Constrained Simulation Optimization on Finite Sets
… of selecting an optimal system from among a finite set of competing systems, based on a "stochastic" objective function and subject to multiple "stochastic" constraints. In this context, we characterize the asymptotically optimal sample allocation that maximizes the rate at which the …
-
Constrained dynamic programming inference of Markov networks from finite sets of sample strings
… machine inference of structural models from finite sets of sample strings. The extension has focused on modifying a key algorithm, the dynamic programming technique, to make it less costly and to thus make resulting applications more practical.</p> <p>Two major modifications of the dynamic …
-
Free Groups in Homotopy Type Theory - Free Groups as Filtered Colimits
… First, the free group is constructed for finite sets in the expected manner. This construction is then used as, secondly, the free group of an arbitrary set X is constructed as a filtered colimit of finite sets with maps into X. This necessitates showing that this comma category of finite …
-
Computing the Goodwillie-Taylor tower for discrete modules
A functor from finite sets to chain complexes is called atomic if it is completely determined by its value on a particular set. We present a new resolution for these atomic functors, which allows us to easily compute their Goodwillie polynomial approximations. By a rank filtration, any functor from …
-
Hyperfinite transversal theory
… is a subset of the cartesian product of two finite sets X and Y. A matching f of $\Gamma$ is a 1-1 function f which is a subset of $\Gamma$ and which has the same domain as $\Gamma$.) The graph $\Gamma$ can be thought of as a finite family of finite sets $\{\Gamma(x) : {x}{\in}{X})\}$. Thus, …
-
A General Duality Theory for Clones
… and apply it to obtain new results for clones on finite sets.
-
On groups and initial segments in nonstandard models of Peano Arithmetic
This thesis concerns M-finite groups and a notion of discrete measure in models of Peano Arithmetic. First we look at a measure construction for arbitrary non-M-finite sets via suprema and infima of appropriate M-finite sets. The basic properties of the measures are covered, along with …
-
Combinatorial Laplacians on Complexes
… for these operators, extends the construction to finite ∆-sets, and applies the resulting Laplacian to finite semigroups. For simplicial complexes, we obtain higher-dimensional analogues of several upper bounds for the largest graph Laplacian eigenvalue, including average-degree, square-root, and …
-
On counting problems in nonstandard models of Peano arithmetic with applications to groups
… in Peano arithmetic (PA) allow complicated finite objects such as groups to be encoded in a model \(M\) ╞ PA. We call such coded objects \(M\) -finite. This thesis concerns \(M\) -finite abelian groups, and counting problems for \(M\)-finite groups. We define a notion of cardinality for …
Page 1 of 5