Results :: Search Electronic Theses and Dissertations (ETDs)

Your search for ETD Program Computer Science resulted in 23 match(es).

Back to search page

Genepart Algorithm, Clustering and Feature Selection for DNA Micro-Array Data: Author: Zhang, Weihua; Date: 2004-12-15; Program: Computer Science; Abstract: This paper provides the theoretical analysis of a new clustering and feature selection algorithm for the DNA micro-array data. This algorithm utilizes a branch and bound algorithm as the basic tool to quickly generate the optimal tissue sample partitions and select the gene subset which contributes the most to certain sample partition, it also combines the statistical probability method to identify important genes that have meaningful biological relationships to the classification or clustering problem. The proposed method combines feature selection and clustering processes and can be applied ...; Download File | View full details

Idact Transformation Manager: Author: Hay, Brian; Date: 2005-12-15; Program: Computer Science; Abstract: As scientific models and analysis tools become increasingly complex, they allow researchers to manipulate larger, richer, and more finely-grained datasets, often gathered from diverse sources. These complex models provide scientists with the opportunity to investigate phenomena in much greater depth, but this additional power is not without cost. Often this cost is expressed in the time required on the part of the researcher to find, gather, and transform the data necessary to satisfy the appetites of their data-hungry computation tools, and this is time that could clearly be better spent anal...; Download File | View full details

JavaCAVE: A 3D Immersive Environment in Java: Author: Milvich, Michael Lazar; Date: 2004-08-15; Program: Computer Science; Abstract: Three-dimensional immersive environments have traditionally been developed using the C and C++ programing language. Do to the increasing performance of the Java platform, the Java language is becoming more accepted for scientific and graphical applications. Currently developers who choose to use Java are being excluded from visualizing the results of their programs in a rich three-dimensional immersive environment. This thesis will work towards correcting this problem by implementing a Java library called JavaCAVE to control a CAVE™ immersive environment. In addition to being a Ja...; Download File | View full details

Map Labeling with Circles: Author: Jiang, Minghui; Date: 2005-05-15; Program: Computer Science; Abstract: We study two geometric optimization problems motivated by cartographic applications: Map Labeling with Uniform Circles (MLUC) and Map Labeling with Uniform Circle Pairs (MLUCP). We show that the decision problems of both MLUC and MLUCP are NP-hard, and that the related optimization problems for maximizing the label sizes are NP-hard to approximate within factor 1.0349. We design approximation algorithms with constant performance guarantees for the two problems: for MLUC, we present a (3 + ε)-approximation and a (2.98 + ε)-approximation; for MLUCP, a (1.5+�µ...; Download File | View full details

Metaprogramming Bioinformatics in the Postgenomic Era: Author: Ohler, Nathaniel Tobias; Date: 2006-05-15; Program: Computer Science; Abstract: The number of bioinformatics programs available is continuously growing, along with the knowledge required to run each individual program. As more programs become available, more complex combinations of these programs are being used by scientists. Workflow engines attempt to remove repetitive procedures from these combinations by saving and executing any group of the programs as one larger "meta-program". The output of one program is automatically directed to the input of another thereby creating a "flow" of "work". The first part of this project is the desi...; Download File | View full details

Missing Text Reconstruction: Author: Glassy, Louis Zoe; Date: 2004-08-15; Program: Computer Science; Abstract: Missing-text reconstruction (MTR) is a new application of text-oriented pattern recognition. The goal of MTR is to reconstruct documents in which fragments of original text are missing. Using n-gram models of the document's source language, the MTR algorithm makes sets of hypotheses of the missing text, and combines these sets with a probability combining rule to form the best supported reconstruction of the missing text. A prototype software system (mitre) was developed as a proof-of-concept for the MTR techniques discussed....; Download File | View full details

Object Mapping with Java Annotations: Author: Frederickson, Clint Michael; Date: 2005-05-15; Program: Computer Science; Abstract: Java applications often need to store data in external data sources. Large amounts of time can be spent developing solutions to integrate specific data sources into the application. The process of mapping object-oriented data to data sources can lead to a fragile system that can not handle incremental changes to the data or the integration of new data sources cleanly. Java 1.5 introduced a metadata facility called annotations into the Java language. Annotations can be used to describe data in a general way such that it can be mapped onto various types of data sources easily. The annotations ar...; Download File | View full details

Terrain Based Routing Protocol for Sparse Ad-Hoc Intermittent Network (TRAIN): Author: Dawra, Gaurav; Date: 2005-12-15; Program: Computer Science; Abstract: Traditionally, routing protocols for ad-hoc networks have been developed without taking into consideration the effects of the surrounding environment. In this thesis, we propose and investigate a new approach of terrain and location based routing and its effect on the routing layer on sparse ad-hoc networks. This approach is particularly important for sparse networks, where relatively large node separations can result in periods of disconnectivity. Terrain blockage compounds the problem, as the likelihood of inter node communication is further diminished. We anticipate that terrain and locatio...; Download File | View full details

Visualizing the Pumping Lemma for Regular Languages: Author: Cogliati, Joshua Joseph; Date: 2004-08-15; Program: Computer Science; Abstract: The pumping lemma for regular languages and its application are among the more difficult concepts students encounter in an introductory theory of computing course. The pumping lemma is used to prove that particular languages are not regular. Traditional methods of teaching the pumping lemma seem inadequate for helping average students learn this concept. In this thesis we describe a set of software tools that help students visualize the pumping lemma for regular language. The Java programming language was used to create active learning animations of various aspects of the pumping lemma that ru...; Download File | View full details

Design and Application of the Kentucky Microarray Analysis Suite: Author: Raghavan, Vijay Anand; Date: 2006-12-15; Program: Computer Science; Abstract: In recent years, microarrays have become the most widely used standard in the study of gene expression. The biggest problem in microarray data analysis is the dimensionality of the data, compared to other more traditional biomedical research methods. The inherent nature of the data, and the problems associated with the microarray data analysis, has led to the development of many methods for microarray data analysis. Microarray data analysis methods are commonly classified into Class Discovery methods e.g. clustering, Class Comparison methods e.g. predicting differentially expressed genes, and ...; Download File | View full details

Animating the Conversion of Nondeterministic Finite State Automata to Deterministic Finite State Automata: Author: Merryman, William Patrick; Date: 2007-05-15; Program: Computer Science; Abstract: Many students may find the conversion of non-deterministic finite state automata into deterministic finite state automata to be difficult. Since standard Computers are deterministic by nature, it is beneficial to understand how to convert nondeterministic finite state automata into equivalent deterministic versions. This conversion process is often inadequately presented in traditional textbooks, though, as static presentations rarely capture the dynamics of the process. This thesis provides a Java applet that will help students better understand the conversion, and may help teachers to better...; Download File | View full details

Solving Sudoku Puzzles with the Cougaar Agent Architecture: Author: Emery, Michael Ray; Date: 2007-08-15; Program: Computer Science; Abstract: The Cougaar distributed agent architecture, originally a DARPA-funded research project, provides a platform for developing distributed agent systems. Testing its ability to solve complex problems using a large number of agents in an interesting topic of research. In this thesis, the Cougaar distributed agent architecture is studied from the standpoint of Sudoku. Through analysis and experimentation, insight is gained into both the properties and weaknesses of Cougaar. Cougaar's performance when solving Sudoku puzzles is then compared with other Sudoku solving techniques. The Cougaar agent app...; Download File | View full details

An Autonomic Software Architecture for Distributed Applications: Author: Fuad, Mohammad Muztaba; Date: 2007-08-15; Program: Computer Science; Abstract: Autonomic computing is a grand challenge in computing that aims to produce software that has the properties of self-configuration, self-healing, self-optimization and self-protection. Adding such autonomic properties into existing applications is immensely useful for redeploying them in an environment other than they were developed for. Such transformed applications can be redeployed in different dynamic environments without the user making changes to the application. However, creating such autonomic software entities is a significant challenge not only because of the amount of code transforma...; Download File | View full details

Visualizing the Minimization of a Deterministic Finite State Automaton: Author: Kshatriya Jagannath, Rajini Singh; Date: 2007-12-15; Program: Computer Science; Abstract: The minimization of deterministic finite state automata is one of the challenging concepts that students of an introductory theory of computation course must master. The minimization algorithm identifies redundant states that may occur in any deterministic finite state automaton and combines them in order to minimize the total number of states. Traditional textbooks provide a static presentation of this process. The average student seems to grasp the process better if it is presented dynamically. In this thesis we visualize every step of a minimization algorithm in sequence through a Java appl...; Download File | View full details

Channel Assignment for Throughput Improvement in Multi-Radio Wireless Mesh Networks: Author: Tenneti, Shivaram Venkata; Date: 2007-12-15; Program: Computer Science; Abstract: Wireless mesh networks offer many advantages in terms of connectivity and reliability. They provide multiple paths between nodes and are self healing. Traditionally, wireless mesh networks were typically used with nodes equipped with a single radio. There are however, limitations in single radio wireless mesh network, such as lower throughput and its limited use of the available wireless channels. This thesis focuses on the Hybrid Channel Allocation scheme which efficiently utilizes multiple wireless interfaces to achieve better throughput thereby increasing the network capacity. In this thesi...; Download File | View full details

A Fast Layered Alternative to Kriging: Author: Thiesen, Michael Jerome; Date: 2007-12-15; Program: Computer Science; Abstract: Empirically gathered scientific data often comes in the form of scattered locations, each with an associated measurement. Visualizing scattered data is challenging because we need to estimate the measured values at many regularly spaced intervals in order to render the data to modern displays. Kriging is a common technique for visualizing scattered data that produces high quality output, but is often too slow for large data sets. In this thesis I present Layered Interpolation, an alternative to Kriging based on the idea of fitting fractal noise functions to scattered data. This technique produ...; Download File | View full details

FP-growth approach for document clustering: Author: Akbar, Monika; Date: 2008-05-15; Program: Computer Science; Abstract: Since the amount of text data stored in Computer repositories is growing every day, we need more than ever a reliable way to group or categorize text documents. Most of the existing document clustering techniques use a group of keywords from each document to cluster the documents. In this thesis, we have used a sense based approach to cluster documents instead of using only the frequency of the keywords. We use relationships between the keywords to cluster the documents. The relationships are retrieved from the WordNet ontology and represented in the form of a graph. The document-graphs, which...; Download File | View full details

Performance evaluation of routing protocols for QOS support in rural mobile ad hoc networks: Author: Bohannan, Chad Brian; Date: 2008-05-15; Program: Computer Science; Abstract: We evaluate several routing protocols, and show that the use of bandwidth and delay estimation can provide throughput and delay guarantees in Mobile Ad Hoc Networks (MANETs). This thesis describes modifications to the Dynamic Source Routing (DSR) protocol to implement the Quality Aware Source Routing (QASR) network routing protocol operating on an 802.11e link layer. QASR network nodes exchange node location and flow reservation data periodically to provide information necessary to model and estimate both the available bandwidth and the end-to-end delay of available routes during route discove...; Download File | View full details

Achieving self-managed deployment in a distributed environment via utility functions: Author: Deb, Debzani; Date: 2008-05-15; Program: Computer Science; Abstract: This dissertation presents algorithms and mechanisms that enable self-managed, scalable and efficient deployment of large-scale scientific and engineering applications in a highly dynamic and unpredictable distributed environment. Typically these applications are composed of a large number of distributed components and it is important to meet the computational power and network bandwidth requirements of those components and their interactions. However satisfying these requirements in a large-scale, shared, heterogeneous, and highly dynamic distributed environment is a significant challenge. As...; Download File | View full details

Apriori approach to graph-based clustering of text documents: Author: Hossain, Mahmud Shahriar; Date: 2008-05-15; Program: Computer Science; Abstract: This thesis report introduces a new technique of document clustering based on frequent senses. The developed system, named GDClust (Graph-Based Document Clustering) [1], works with frequent senses rather than dealing with frequent keywords used in traditional text mining techniques. GDClust presents text documents as hierarchical document-graphs and uses an Apriori paradigm to find the frequent subgraphs, which reflect frequent senses. Discovered frequent subgraphs are then utilized to generate accurate sense-based document clusters. We propose a novel multilevel Gaussian minimum support strat...; Download File | View full details

An information retrieval system for images from the trace satellite: Author: Lamb, Robert Ray; Date: 2008-05-15; Program: Computer Science; Abstract: The ability to identify particular features and structures, such as faces or types of scenery in images, is a topic with many available applications and potential solutions. In this paper we discuss solar images and the results of our preliminary investigation of techniques that can be used to identify solar phenomena in images from the TRACE satellite. Being able to automatically identify various phenomena in solar images is of great interest for scientists studying phenomena on the sun. A set of characteristics that can be quickly extracted from solar images needs to be acquired. These chara...; Download File | View full details

Automated radio network design using ant colony optimization: Author: Sharkey, Jeffrey Allen; Date: 2008-05-15; Program: Computer Science; Abstract: Radio networks can provide reliable communication for rural intelligent transportation systems (ITS). Engineers manually design these radio networks by selecting tower locations and equipment while meeting a series of constraints such as coverage, bandwidth, maximum delay, and redundancy, all while minimizing network cost. As network size and constraints grow, the design process can quickly become overwhelming. In this thesis we model the network design problem (NDP) as a generalized Steiner tree-star (GSTS) problem. Any solution to the minimum Steiner tree (MST) problem on a constructed GSTS ...; Download File | View full details

The grid overlay system model: Author: Junkert, Levi Daniel; Date: 2009-05-15; Program: Computer Science; Abstract: The grid overlay system model is a new technique for forming a grid computing model for research computing. In this method we construct a grid that is dynamically allocated from a set of resources in a unique and progressive manner. This new system model allows for construction of virtual environments for execution of applications on many diverse shared resources. The system can dynamically scale to create a range of resources from a single machine to a virtual cluster of machines. This model provides a virtual container that can run legacy and customized software in an emulated environment or...; Download File | View full details

Back to search page

print-friendly page | mobile-friendly page