# Search

Now showing items 11-20 of 59

### 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.

### Discrete sets, free sequences and cardinal properties of topological spaces

(2009-07-01)

We study the influence of discrete sets and free sequences on cardinal properties of topological spaces. We focus mainly on the minimum number of discrete sets needed to cover a space X (denoted by dis(X)) and on reflection ...

### 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 ...

### Enclosings of Small Cycle Systems

(2009-04-28)

In 2003 Hurd and others considered the problem of enclosing a triple system TS(v; lambda)
in a triple system TS(v + s; lambda + m), focusing on smallest possible enclosings. In
the second chapter, their result is generalized ...

### 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 ...

### Palm Measure Invariance and Exchangeability for Marked Point Processes

(2008-09-09)

A random measure $\xi$ on a real interval $I$ is known to be exchangeable iff suitably reduced versions of the Palm distributions $Q_{t}$ are independent of $t \in I$. In this dissertation we prove a corresponding result ...