# Search

Now showing items 21-30 of 161

### Semi-Supervised Classification Techniques in Big Data Text Analytics

(2013-04-22)

Imagine that you are trying to read everything you got in 2011 as soon as possible. That will take the first three months of 2012. How can we get access to the vast unstructured literature, automatically process it, ...

### Topics in Edge Regular Graphs

(2014-07-24)

A graph, G, is edge-regular with parameters (n,d,lambda) if G is regular of degree d on n vertices and for all u, v in V(G) such that uv is in E(G), the order of the intersection of N(u) and N(v) is lambda, where N(v) ...

### Model Order Reduction

(2014-11-24)

Model Order Reduction (MOR) is a wide area, and it has many techniques. In this thesis, we focus on Krylov subspaces method and Proper Orthogonal Decomposition (POD).We show some details about these two methods. A MATLAB ...

### Nonlocal Dispersal Equations and Convergence to Random Dispersal Equations

(2014-05-15)

This dissertation is devoted to the study of the dynamics of nonlocal and random dispersal evolution equations.
Dispersal evolution equations are widely used to model the diffusions of organisms or individuals in many ...

### On the derivation algebras of parabolic Lie algebras with applications to zero product determined algebras

(2014-07-11)

This dissertation builds upon and extends previous work completed by the author and his advisor in [5].
A Lie algebra g is said to be zero product determined if for each bilinear map φ: g × g → V that satisfies φ(x, y) = ...

### The Stone-Čech Compactification and the Number of Pairwise Nonhomeomorphic Subcontinua of β[0,∞)\[0,∞)

(2014-05-02)

An introduction to the Stone-Čech compactification $\beta X$ of a normal topological space $X$ is given. The method of invariantly embedding linear orders into ultrapowers is used to find $2^{\mathfrak{c}}$ pairwise ...

### 3-Cycle Systems and Structure within Graph Decompositions

(2014-07-24)

An $H$-decomposition of a graph $G$ is a partition of the edge set $E(G)$ such that each element of the partition induces a subgraph isomorphic to $H$. A packing or cover of $\lambda K_n$ (with triples) is an ordered pair ...

### Integral closures

(2010-07-06)

The q^th-power algorithm from Leonard [3], [4], and Leonard and Pellikaan [1] is a
recent and efficient method of computing the integral closure of a ring in its field of fractions.
Previously, the q^th-power algorithm ...

### Evading Triangles without a map

(2010-01-06)

We divise a heuristic which enables a traveler to traverse the plane from a start point S to a target point T while evading unknown obstacles. The obstacles are assumed to be equilateral triangles which are all translates ...

### Convexity of Generalized Numerical Ranges Associated with SU(n) and SO(n)

(2010-05-20)

We give a new proof of a result of Tam on the convexity of the generalized numerical
range associated with the classical Lie groups SO(n). We also provide a connection between
the result and the convexity of the classical ...