Digital Commons Network^™

Sparse Trees With A Given Degree Sequence, Ao Shen

Electronic Theses and Dissertations

In this thesis, we consider the properties of sparse trees and summarized a certain class of trees under some constraint (including with a given degree sequence, with given number of leaves, with given maximum degree, etc.) which have maximum Wiener index and the minimum number of subtrees at the same time. Wiener index is one of the most important topological indices in chemical graph theory. Steiner k�� Wiener index can be regarded as the generalization of Wiener index, when k = 2, Steiner Wiener index is the same as Wiener index. Steiner k�� Wiener index of a tree T is …

Optimal Supply Delivery Under Military Specific Constraints, Talena Fletcher

Electronic Theses and Dissertations

Through-out military history, the need to safely and effectively allocate resources to various military operations was a task of extreme importance. Satisfying the needs of multiple consumers by optimally pairing with appropriate suppliers falls into the category of vehicle routing problems (VRP), which has been intensively studied over the years. In general, finding the optimal solution to VRP is known to be NP-hard. The proposed solutions rely on mathematical programming and the size of the problems that can be optimally solved is typically limited. In military settings, balancing the needs of multiple consumers with the current operational environment has always …

Old English Character Recognition Using Neural Networks, Sattajit Sutradhar

Electronic Theses and Dissertations

Character recognition has been capturing the interest of researchers since the beginning of the twentieth century. While the Optical Character Recognition for printed material is very robust and widespread nowadays, the recognition of handwritten materials lags behind. In our digital era more and more historical, handwritten documents are digitized and made available to the general public. However, these digital copies of handwritten materials lack the automatic content recognition feature of their printed materials counterparts. We are proposing a practical, accurate, and computationally efficient method for Old English character recognition from manuscript images. Our method relies on a modern machine learning …

A Journey To The Adic World, Fayadh Kadhem

Electronic Theses and Dissertations

The first idea of this research was to study a topic that is related to both Algebra and Topology and explore a tool that connects them together. That was the entrance for me to the “adic world”. What was needed were some important concepts from Algebra and Topology, and so they are treated in the first two chapters.

The reader is assumed to be familiar with Abstract Algebra and Topology, especially with Ring theory and basics of Point-set Topology.

The thesis consists of a motivation and four chapters, the third and the fourth being the main ones. In the third …

A Survey Of Clustering Analysis And Clustering Analysis In Graphs, Raven D. Gilmore

Electronic Theses and Dissertations

Clustering analysis is an important topic in data mining, where data points that are similar to each other are grouped together. Graph clustering deals with clustering analysis of data points that correspond to vertices on a graph. We first survey some most well known algorithms for clustering analysis. Then for graph clustering we note that one of the fundamental factors is the distance measure between vertices. We further examine various known venues for defining such measures and propose some others.

Survey Of Results On The Schrodinger Operator With Inverse Square Potential, Richardson Saint Bonheur

Electronic Theses and Dissertations

In this paper we present a survey of results on the Schrodinger operator with Inverse ¨ Square potential, L_a= −∆ + a/|x|^2 , a ≥ −( d−2/2 )^2. We briefly discuss the long-time behavior of solutions to the inter-critical focusing NLS with an inverse square potential(proof not provided). Later we present spectral multiplier theorems for the operator. For the case when a ≥ 0, we present the multiplier theorem from Hebisch [12]. The case when 0 > a ≥ −( d−2/2 )^2 was explored in [1], and their proof will be presented for completeness. No improvements on the sharpness …