No description available.

Until recently, methodologies to extract sub-pixel information from remotely sensed data have focused on linear un-mixing models and so called fuzzy classifiers. Recent research has suggested that neural networks have the potential for providing sub- pixel information. Neural networks offer an attractive alternative as they are non- parametric, they are not restricted to any number of classes, they do not assume that the spectral signatures of pixel components mix linearly and they do not necessarily have to be trained with pure pixels. The thesis tests the validity of neural networks for extracting sub-pixel information using a combination of qualitative and quantitative analysis tools. Previously published experiments use data sets that are often limited in terms of numbers of pixels and numbers of classes. The data sets used in the thesis reflect the complexity of the landscape. Preparation for the experiments is canied out by analysing the data sets and establishing that the network is not sensitive to particular choices of parameters. Classification results using a conventional type of target with which to train the network show that the response of the network to mixed pixels is different from the response of the network to pure pixels. Different target types are then tested. Although targets which provide detailed compositional information produce higher accuracies of classification for subsidiary classes, there is a trade off between the added information and added complexity which can decrease classification accuracy. Overall, the results show that the network seems to be able to identify the classes that are present within pixels but not their proportions. Experiments with a very accurate data set show that the network behaves like a pattern matching algorithm and requires examples of mixed pixels in the training data set in order to estimate pixel compositions for unseen pixels. The network does not function like an unmixing model and cannot interpolate between pure classes.

Three Scenes in Dreamland is a 17-minute piece for mixed choir and instrumental ensemble. It consists of three movements: "Crystal Sky," "The Chanting Light" and "The Field Where I Was Born, Where I Died." Each movement uses a particular combination of the available instruments. The work is inspired by various aspects of Chinese culture and Buddhism, and certain possibilities of combining Western and non-Western musical elements are explored over the course of the three movements.

A mixed hypergraph is a triple H = (X; C;D), where X is the vertex set, and each of C;D is a list of subsets of X. A strict t-coloring is a onto mapping from X to {1, 2,…,t} such that each c belongs to C contains two vertices have a common value and each d belongs to D has two vertices have distinct values. If H has a strict t-coloring, then t belongs to S(H), such S(H) is called the feasible set of H, and k is a gap if there are a value larger than k and a value less than k in the feasible set but k is not. We find the minimum and maximum gap of a mixed hypergraph with more than 5 vertices. Then we consider two special cases of the gap of mixed hypergraphs. First, if the mixed hypergraphs is spanned by a complete bipartite graph, then the gap is decided by the size of bipartition. Second, the (l,m)-uniform mixed hypergraphs has gaps if l > m/2 >2, and we prove that the minimum number of vertices of a (l,m)-uniform mixed hypergraph which has gaps is (m/2)( l -1) + m.

Thesis (M.S.)--Oregon State University, 2008. / Printout. Includes bibliographical references (leaves 60-62). Also available on the World Wide Web.

Universiẗat, Diss., 2004--Kiel.

Thesis (Ph.D.)--University of Nebraska-Lincoln, 2008. / Title from title screen (site viewed Sept. 18, 2008). PDF text: ix, 175 p. ; 782 K. UMI publication number: AAT 3303507. Includes bibliographical references. Also available in microfilm and microfiche formats.

Thesis (M.S.)--University of Michigan, 1959.

Thesis (M.S.)--University of Michigan, 1959.

Thesis (M.S.)--Oregon State University, 2004. / Printout. Includes bibliographical references (leaves 71-72). Also available on the World Wide Web.