Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

2008

University of Tennessee, Knoxville

Computer Sciences

Articles 1 - 7 of 7

Full-Text Articles in Physical Sciences and Mathematics

Sb-Corla: Schema-Based Constructivist Robot Learning Architecture, Yifan Tang Dec 2008

Sb-Corla: Schema-Based Constructivist Robot Learning Architecture, Yifan Tang

Doctoral Dissertations

This dissertation explores schema-based robot learning. I developed SB-CoRLA (Schema- Based, Constructivist Robot Learning Architecture) to address the issue of constructivist robot learning in a schema-based robot system. The SB-CoRLA architecture extends the previously developed ASyMTRe (Automated Synthesis of Multi-team member Task solutions through software Reconfiguration) architecture to enable constructivist learning for multi-robot team tasks. The schema-based ASyMTRe architecture has successfully solved the problem of automatically synthesizing task solutions based on robot capabilities. However, it does not include a learning ability. Nothing is learned from past experience; therefore, each time a new task needs to be assigned to a new …


Scalable Graph Algorithms With Applications In Genetics, Yun Zhang Dec 2008

Scalable Graph Algorithms With Applications In Genetics, Yun Zhang

Doctoral Dissertations

Graph theoretical approaches have been widely used to solve problems arising in bioinformatics and genomic analysis. In particular, enumeration problems such as maximal clique and maximal biclique finding are cores for addressing many biological problems, such as the integration of genome mapping data. However, the enumeration problems may become computation and memory bot- tlenecks for genome-scale elucidation of biological networks due to their NP-hard nature and the huge memory requirements.

Therefore, this research is interested in developing exact, scalable, and efficient algorithms for these biological problems. The Clique Enumerator including a maximal clique enumeration algo- rithm and its parallel …


Scalable, Data- Intensive Network Computation, Huadong Liu Aug 2008

Scalable, Data- Intensive Network Computation, Huadong Liu

Doctoral Dissertations

To enable groups of collaborating researchers at different locations to effectively share large datasets and investigate their spontaneous hypotheses on the fly, we are interested in de- veloping a distributed system that can be easily leveraged by a variety of data intensive applications. The system is composed of (i) a number of best effort logistical depots to en- able large-scale data sharing and in-network data processing, (ii) a set of end-to-end tools to effectively aggregate, manage and schedule a large number of network computations with attendant data movements, and (iii) a Distributed Hash Table (DHT) on top of the generic …


Addressing Challenges In A Graph-Based Analysis Of High-Throughput Biological Data, Andy D. Perkins Aug 2008

Addressing Challenges In A Graph-Based Analysis Of High-Throughput Biological Data, Andy D. Perkins

Doctoral Dissertations

Graph-based methods used in the analysis of DNA microarray technology can be powerful tools in the elucidation of biological relationships. As these methods are developed and applied to various types of data, challenges arise that test the limits of current algorithms. These challenges arise in all phases of data analysis: data normalization, modeling biological networks, and interpreting results. Spectral graph theory methods are investigated as means of threshold selection, a key step in constructing graphical models of biological data. Also important in constructing graphs is the selection of an appropriate gene-gene similarity metric, and an overview of similarity profiles for …


Using Automated Task Solution Synthesis To Generate Critical Junctures For Management Of Planned And Reactive Cooperation Between A Human-Controlled Blimp And An Autonomous Ground Robot, Christopher M. Reardon Aug 2008

Using Automated Task Solution Synthesis To Generate Critical Junctures For Management Of Planned And Reactive Cooperation Between A Human-Controlled Blimp And An Autonomous Ground Robot, Christopher M. Reardon

Masters Theses

This thesis documents the use of an approach for automated task solution synthesis that algorithmically and automatically identifies periods during which a team of less-than-fully capable robots benefit from tightly-coupled, coordinated, cooperative behavior.

I test two hypotheses: 1) That a team’s performance can be increased by cooperating during certain specific periods of a mission and 2) That these periods can be identified automatically and algorithmically. I also demonstrate how identification of cooperative periods can be performed both off-line prior to the application and reactively during mission execution.

I validate these premises in a real-world experiment using a human-piloted Unmanned Aerial …


L-Encoder: Video Transcoding In The Logistical Network, Harold Thomas Gonzales Jul 2008

L-Encoder: Video Transcoding In The Logistical Network, Harold Thomas Gonzales

Masters Theses

Transcoding, the transformation of digital information from one encoding format to another, is a prominent operation in the realm of digital video and audio. This process of changing the encoding formats of multimedia files and streams is now a common task for many users due in part to the prevalence of portable media players and consumer electronic devices for digital media, which place constraints on the file and stream formats they can play. The transcoding process is often both data and compute intensive due to both the large data requirements of modern media formats from sources such as HDTV and …


A Finite State Machine Approach To Cluster Identification Using The Hoshen-Kopelman Algorithm, Matthew L. Aldridge May 2008

A Finite State Machine Approach To Cluster Identification Using The Hoshen-Kopelman Algorithm, Matthew L. Aldridge

Doctoral Dissertations

The purpose of this study was to develop an efficient finite state machine implementation of the eponymous Hoshen-Kopelman cluster identification algorithm using the nearest-eight neighborhood rule suitable to applications such as computer modeling for landscape ecology. The implementation presented in this study was tested using both actual land cover maps, as well as randomly generated data similar to those in the original presentation of the Hoshen-Kopelman algorithm for percolation analysis. The finite state machine implementation clearly outperformed a straightforward adaptation of the original Hoshen-Kopelman algorithm on either data type. Research was also conducted to explore the finite state machine's performance …