The proportional hazards model developed by Cox (1972) is by far the most widely used method for regression analysis of censored survival data. Application of the Cox model to more general event history data has become ...

This thesis proposed two nonparametric statistical tests, based on the Kolmogorov-Smirnov distance and L2 mallows disatnce. To implement the proposed tests, nonparametric bootstrap method is employed to approximate the ...

This thesis represents an attempt to generalize the classical Theory of Optimal Design to popular regression models, based on Rational and Spline approximations. The problem of finding optimal designs for such models can ...

Constrained codes have been used in data storage systems, such as magnetic tapes, CD’s and DVD’s, in order to reduce the likelihood of errors by predictable noise. The study of constrained codes is based on the study of ...

Motivated by the longest increasing subsequence problem, we examine sundry topics at the interface of enumerative/algebraic combinatorics and random matrix theory. We begin with an expository account of the increasing ...

We consider various infinite series and examine their arithmetic nature. Series of interest are of the form $$\sum_{n =0}^{\infty} \frac{f(n)A(n)}{B(n)}, \;\;\;\; \sum_{n \in \mathbb{Z}}\frac{f(n)A(n)}{B(n)}, \;\;\;\; ...

Data recorded from Voyager 2 in 1979 during closest approach to Jupiter is prepared and analyzed for evidence of Jovian modal forcing. Comparisons are drawn between the data set in question and previously performed ...

We construct classical tilting objects in derived categories of equivariant sheaves on quasi-projective varieties, which give equivalences with derived categories of modules over algebras. Our applications include a ...

It was conjectured in the early 1950¡¯s that the empirical spectral distribution (ESD) of an $n \times n$ matrix whose entries are independent and identically distributed with mean zero and variance one, normalized by ...

In this thesis we describe how the balancing of the $\operatorname{Tor}$ functor can be used to compute the minimal free resolution of a graded module $M$ over the polynomial ring $B=\mathbb{K}[X_0,\dots,X_m]$ ($\mathbb{K}$ ...