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 29 for “"Cartesian product"”.
-
Second-order sub-array Cartesian product split-plot design
… design referred to as second-order sub-array Cartesian product split-plot design. This new form of design is an alternative to ineffective split-plot designs that are currently in use by the manufacturing and quality control community. The design is economical, the prediction variance of the …
-
Query Optimization for Relational Database Systems
… develops a new algorithm for computing the Cartesian product and join of large relations which attempts to take maximum advantage of available main-memory buffer space.
-
Domination in graphs: Vizing's conjecture
… states that the domination number of the Cartesian product of two graphs is at least as large as the product of the domination numbers of the two factor graphs. The aim of this thesis is to study the various approaches implemented by researchers over the years in an attempt to prove (or …
-
Topological Operations for Genus Distributions and Embeddings of Graphs
… to treat one graph. We then consider the Cartesian product, dot product and extended dot product which are designed to be applied between two graphs. Face-contraction, vertex-splitting, vertex-augment, pearl-making, bouquet-making and face-expansion are discussed to achieve partial genus …
-
Mathematical Modelling of Novel Ultrasonic Transducers with Fractal-Like Geometries
… designs. The structures considered are the Cartesian product of two Sierpinski gasket lattices and the Cartesian product of two Sierpinski carpet lattices. These structures are utilised to obtain the theoretical operating characteristics for novel devices.
-
The Cover Time of Random Walks on Graph
… of a pair of graphs, and the cover time of their Cartesian product. This extends previous work on special cases of the Cartesian product, in particular, the square of a graph. We show that when one of the factors is in some sense larger than the other, its cover time dominates, and can become …
-
Volume Formula and Intersection Pairings of N-fold Reduced Products
… compact connected Lie group. An N-fold reduced product of G is the symplectic quotient of the Hamiltonian system of the Cartesian product of N coadjoint orbits of G under diagonal coadjoint action of G. Under appropriate assumptions, it is a symplectic orbifold. Using the technique of nonabelian …
-
Induced path number for the complementary prism of a grid graph
… called prism edges. The graph grid(n,m) is the Cartesian product of P_n with P_m. In this thesis we will give an overview of a selection of important results in determining rho(G) of various graphs, we will then provide proofs for determining the exact value of rho(CP(grid(n,m))) for specific …
-
Hyperfinite transversal theory
… (A bipartite graph $\Gamma$ 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) …
-
Starkiller : a static type inferencer and compiler for Python
… type inference algorithm is based on the Cartesian Product Algorithm but has been significantly modified to support a radically different language. It includes an External Type Description Language that enables extension authors to document how their foreign code extensions interact with …
-
A controlled experiment to identify and test a representative primitive set of user object-oriented cursor actions
… A primitive task set consisting of the Cartesian product of specific elements of the four categories listed above was proposed based on observation of user tasks and a cursor action benchmark task set was developed to measure a user's performance for each element of the set of primitive …
-
Lower Bounds and Algorithms for Searching Networks
… formula for the fast search number of the cartesian product of an Eulerian graph and a path. We also give formulas for the fast search number of variants of the cartesian product. We present an upper bound on the fast search number of hypercubes, and extend the results to a broader class of …
-
Methods for Computing Genus Distribution Using Double-Rooted Graphs
… to be of valence two). I define partials and productions, and I use these as follows: (i) to compute the genus distribution of a graph obtained through the vertex amalgamation of a double-rooted graph with a single-rooted graph, and to show how these can be used to obtain recurrences for the …
-
Graph factorization and pseudofactorization with applications to hypercube embeddings
… a graph is broken up into smaller graphs whose Cartesian product it is isomorphic to or is an isometric subgraph of, respectively. We show that the same or slightly modified versions of the techniques used for this process in the context of unweighted graphs also work for weighted graphs. While …
-
Influence modeling of complex stochastic processes
… the state space of such behaviors is often a Cartesian product of a large number of constituent probability spaces, and is exponentially large. A sample for those stochastic processes is normally composed of a large collection of heterogeneous constituent samples. How to combine those …
-
Matchings, Connectivity, and Eigenvalues in Regular Graphs
… We also study $r$-dynichromatic number of the cartesian product of paths and cycles.
-
Global dynamic optimization
(cont.) on a set composed of the Cartesian product between the parameter bounds and the state bounds. Furthermore, I show that the solution of the differential equations is affine in the parameters. Because the feasible set is convex pointwise in time, the standard result that a convex function …
-
Weakly enriched higher categories
… categories; when the monoidal structure is the Cartesian product we also show that this is equivalent to the homotopy theory of enriched Segal categories. Moreover, we prove that the homotopy theory of ([infinity], n)-categories enriched in spaces, obtained by iterating our enrichment procedure, …
-
On the Pebbling Numbers of Graphs
… of graph as Class 0. Another result is for the Cartesian product of a clique K2 and a graph G the pebbling number has the upper bound of 2ƒ(G ) + n/2 - 1/2. Finally we use the idea of a spanning tree to prove that for any graph G with n vertices and diameter d, there exists an upper bound ƒ(G ) …
-
Methods for Rigorous Uncertainty Quantification with Application to a Mars Atmosphere Model
… of probability bounds analysis and the Cartesian product propagation method for Dempster-Shafer structures under certain dependency conditions are proven. It is also conclusively demonstrated that there exist some probability bounds problems in which the best-possible bounds on …
Page 1 of 2