# Search

Now showing items 1-10 of 14

### Stochastic Differential Equations: A Dynamical Systems Approach

(2008-09-09)

The relatively new subject of stochastic differential equations has increasing impor-
tance in both theory and applications. The subject draws upon two main sources, prob-
ability/stochastic processes and differential ...

### On the existence of even and k-divisible-matchings

(2008-09-09)

The concept of an an even matching was first introduced by Billington and Hoffman.
They were used to find gregarious 4-cycle decompositions of $K_{8t(a),b}$ with a and b odd.
Their paper contains even matchings of type ...

### Path and Cycle Decompositions

(2008-09-09)

A $G$-design is a partition of edge set of K_v in which each element induces a copy of G. The existence of G-designs with the additional property that they contain no proper subsystems has been
previously settled when G ...

### 4-cycles systems of line graphs of complete multipartite graphs

(2008-09-09)

Here we investigate the necessary and sufficient conditions for the existence of 4 - cycle systems of the line graphs of complete multipartite graphs.

### Robust Partial Least Squares for Regression and Classification

(2009-02-23)

Partial Least Squares (PLS) is a class of methods for modeling relations between sets of observed variables ...

### Inverse Limit Spaces

(2009-02-23)

This paper is a vast survey of inverse limit spaces. After defining an inverse limit on continuous bonding functions, we prove important theorems about inverse limits, provide examples, and explore various generalizations ...

### Factorwise Rigidity Involving Hereditarily Indecomposable Spaces

(2009-02-23)

The Cartesian product of two spaces is called factorwise rigid if any self homeomorphism is a product homeomorphism. In 1983, D. Bellamy and J. Lysko proved that the Cartesian product of two pseudo-arcs is factorwise rigid. ...

### Time Dependent Queuing Systems

(2009-02-23)

Using elementary probability theory, we establish limiting probabilities for the queue length of a queuing system whose arrivals follow a nonhomogeneous Poisson process and are served by a single server whose services also ...

### The QR Algorithm for Eigenvalue Estimation: Theory and Experiments

(2009-02-23)

In this thesis, we explore one of the most important numerical algorithms ever invented,
the QR algorithm for computing matrix eigenvalues. First, we describe out notations and
mathematical symbols used throughout the ...

### Some Necessary Conditions for List Colorability of Graphs and a Conjecture on Completing Partial Latin Squares

(2008-09-09)

Let C be an infinite set of symbols, F the collection of finite subsets of C. A function
L is a list assignment to a graph G if L assigns to each vertex of G a finite subset of C.
A proper L-coloring occurs when adjacent ...