The area of total coloring is a more recent and less studied area than vertex and edge coloring, but recently, some attention has been given to the Total Coloring Conjecture, which states that each graph's total chromatic number xT is no greater...
In some previous papers, feed forward configurations of realizing second order all pass transfer functions with complex poles by adding some configurations to a first order circuit are discussed. In this dissertation, the above idea extended to...
The field of graph theory has been indubitably influenced by the study of planar graphs. This thesis, consisting of five chapters, is a historical account of the origins and development of concepts pertaining to planar graphs and their...
Given a metric space (K, d), the hyperspace of K is defined by H(K) = {F c K: F is compact, F ≠ 0}. H(K) is itself a metric space under the Hausdorff metric dH. Hyperspaces have been extensively studied by topologists since the 1970's, but the...
We formulate an integro-difference model to predict the growth and spatial
spread of a perennial plant population with an age-structured seed bank. We allow
the seeds in the bank to be of any age, producing an infinite system of equations.
The...
Outerplanar graphs are planar graphs that have a plane embedding in which each vertex lies on the boundary of the exterior region. An outerplanar graph is maximal outerplanar if the graph obtained by adding an edge is not outerplanar. Maximal...
Accelerated life testing; Reliability (Engineering); Service life (Engineering)
This dissertation is focused on finding lower confidence limits for the reliability of systems consisting of Wei bull components when the reliability demonstration testing (RDT) is conducted with zero failures. The usual methods for the parameter...
A k-term quasi-progression of diameter d is a sequence {Xl,... ,xk} for which there exists a positive integer l such that l < Xi-Xi-1 < l+d, for all i = 2, ... ,k. Quasi-progressions may be thought of as arithmetic progressions with a certain...
A connected matching in a graph is a set of disjoint edges such that, for any pair of these edges, there is another edge of the graph incident to both of them. This dissertation investigates two problems related to finding large connected matchings...
In a nonlocally compact Polish abelian group G, we will consider two notions of smallness of subsets of G. Those subsets of G which are topologically small are said to be meager, and those which are measure-theoretically small are Haar null. We...
Three main theorems due to Fenichel are fundamental tools in the exploration
of geometric singular perturbation theory. This expository paper attempts
to provide an introduction to the concepts stated in Fenichel's theorems and provide
illustrative...
The Combinatorial Nullstellensatz can be used to solve certain problems in combinatorics. However, one of the major complications in using the Combinatorial Nullstellensatz is ensuring that there exists a nonzero monomial. This dissertation looks...
Standard regularity assumptions for regression models are not satisfied in segmented regression models with an unknown change point, and consequently standard asymptotic results and inferential methods for confidence estimation are not applicable....
In this dissertation, we study the performance evaluation of two automated warehouse material handling (MH) technologies - automated storage/retrieval system (AS/RS) and autonomous vehicle storage/retrieval system (AVS/RS). AS/RS is a traditional...
Marginal inference for waiting times in multi-stage time-to-event models is complicated by right censoring of observations as well as the prior history of events in the model. In general, complications arise due to the evolution of the censoring...
The classification of self-dual codes has been an extremely active area in
coding theory since 1972 [33]. A particularly interesting class of self-dual codes
is those of Type II which have high minimum distance (called extremal or...
The revolution in information technology and the explosion in the use of computing devices in people's everyday activities has forever changed the perspective of the data mining and machine learning fields. The enormous amounts of easily...
Regression analysis is a statistical method used to relate a variable of interest, typically y (the dependent variable), to a set of independent variables, usually, X1, X2,...,Xn . The goal is to build a model that assists statisticians in...
Many important applications require the discovery of items which have occurred frequently. Knowledge of these items is commonly used in anomaly detection and network monitoring tasks. Effective solutions for this problem focus mainly on reducing...
In this study, the author examined the relationship of probability misconceptions
to algebra, geometry, and rational number misconceptions and investigated the potential
of probability instruction as an intervention to address misconceptions in all...
