Digital Commons Network^™

On Learning Of Functions Refutably, Sanjay Jain, Efim Kinber, Rolf Wiehagen, Thomas Zeugmann

School of Computer Science & Engineering Faculty Publications

Learning of recursive functions refutably informally means that for every recursive function, the learning machine has either to learn this function or to refute it, that is to signal that it is not able to learn it. Three modi of making precise the notion of refuting are considered. We show that the corresponding types of learning refutably are of strictly increasing power, where already the most stringent of them turns out to be of remarkable topological and algorithmical richness. Furthermore, all these types are closed under union, though in different strengths. Also, these types are shown to be different with …

Machine Learning Approaches For Determining Effective Seeds For K -Means Algorithm, Kaveephong Lertwachara

Doctoral Dissertations

In this study, I investigate and conduct an experiment on two-stage clustering procedures, hybrid models in simulated environments where conditions such as collinearity problems and cluster structures are controlled, and in real-life problems where conditions are not controlled. The first hybrid model (NK) is an integration between a neural network (NN) and the k-means algorithm (KM) where NN screens seeds and passes them to KM. The second hybrid (GK) uses a genetic algorithm (GA) instead of the neural network. Both NN and GA used in this study are in their simplest-possible forms.

In the simulated data sets, I investigate two …

Stupid Columnsort Tricks, Geeta Chaudhry, Thomas H. Cormen

Computer Science Technical Reports

Leighton's columnsort algorithm sorts on an $r \times s$ mesh, subject to the restrictions that $s$ is a divisor of~$r$ and that $r \geq 2s^2$ (so that the mesh is tall and thin). We show how to mitigate both of these restrictions. One result is that the requirement that $s$ is a divisor of~$r$ is unnecessary; columnsort sorts correctly whether or not $s$ divides~$r$. We present two algorithms that, as long as $s$ is a perfect square, relax the restriction that $r \geq 2s^2$; both reduce the exponent of~$s$ to~$3/2$. One algorithm requires $r \geq 4s^{3/2}$ if $s$ divides~$r$ and …

Relaxing The Problem-Size Bound For Out-Of-Core Columnsort, Geeta Chaudhry, Elizabeth A. Hamon, Thomas H. Cormen

Computer Science Technical Reports

Previous implementations of out-of-core columnsort limit the problem size to $N \leq \sqrt{(M/P)^3 / 2}$, where $N$ is the number of records to sort, $P$ is the number of processors, and $M$ is the total number of records that the entire system can hold in its memory (so that $M/P$ is the number of records that a single processor can hold in its memory). We implemented two variations to out-of-core columnsort that relax this restriction. Subblock columnsort is based on an algorithmic modification of the underlying columnsort algorithm, and it improves the problem-size bound to $N \leq (M/P)^{5/3} / 4^{2/3}$ …

User Interface Improvement For Mlpq System, Shasha Wu

School of Computing: Dissertations, Theses, and Student Research

This thesis describes the experience of migrating the MLPQ constraint database system, a complex standalone Multiple Document Interface (MDI) application, to a server-based remote accessible application. Centralized, standalone MDI application is a common style for personal software products in Windows. For a database management system, server-based, thin-client computing is a more popular infrastructure. Migrating an existing standalone constraint database application to be a web accessible constraint database server is the main goal of this thesis. This migration process provides a method for the constraint database system to collaborate with other specific applications. We rebuild the desktop MLPQ constraint database system …

Identifying Patterns In Dna Change, Jason R. Gilder, Dan E. Krane, Travis E. Doom, Michael L. Raymer

Kno.e.sis Publications

Now that a draft sequence of the human genome is nearly complete, questions regarding both the information contained within our genetic blueprints as well as the manner in which that information content changes over time can be addressed in ways that had not previously been possible. By their very nature, some of the nucleotide sequences present within our genome allow detailed examination of the mode and pattern of evolution that has shaped our genetic instructions over time spans of tens of millions of years. Alu repeats are one example. Using these relatively short, ubiquitous DNA sequences we explore the problem …

The Modelcamera: A Hand-Held Device For Interactive Modeling, Voicu Popescu, Elisha Sacks, Gleb Bahmotov

Department of Computer Science Technical Reports

No abstract provided.

Vbet: A Vm-Based Emulation Testbed, Xuxian Jiang, Dongyan Xu

Department of Computer Science Technical Reports

No abstract provided.

Producing High-Quality Visualizations Of Large-Scale Simulations, Voicu Popescu, Chris M. Hoffmann, Dami Kilic, Mete Sozen, Scott Meador

Department of Computer Science Technical Reports

No abstract provided.

A Combinatorial Technique For Face Detection Based On Color And Statistical Analysis, Harishwaran Hariharan

Electrical & Computer Engineering Theses & Dissertations

Automatic detection of faces from video sequences is an important task in security applications. The number, location, size and orientation of human faces in a video frame are unpredictable and can vary from frame to frame. A face detection algorithm for color images in the presence of varying lighting conditions and complexity in background relying upon color and statistical analysis is presented in this thesis. The new method detects skin regions over the entire image and then classifies the skin regions as faces and non-faces. Segmentation of skin regions is performed by a novel color space merging procedure named Integrated …

A Framework Of Cooperating Agents Hierarchies For Local-Area Mobility Support, Ayman Adel Abdel Hamid

Computer Science Theses & Dissertations

Host mobility creates a routing problem in the Internet, where an IP address reflects the network's point of attachment. Mobile IP, relying on a mapping between a home address and a care-of address, and a home registration process, is widely accepted as a solution for the host mobility problem in wide-area mobility scenarios. However, its home registration requirement, upon each change of point of attachment, makes it unsuitable to handle local-area mobility, resulting in large handoff latencies, increased packet loss, and disrupted services. In this dissertation, we introduce a local-area mobility support framework for IPv4 based on the deployment of …

Development Of Kohonen Neural Network Application As A Pattern Recognition System For An Electronic Nose, Lori Lynn Evesque

Masters Theses

Electronic noses are used to identify and characterize unknown odors in industry. Chemometrics and neural network algorithms are used as pattern recognition systems for these devices. Experimentation with Kohonen clustering as the pattern recognition system for electronic noses was not noted prior to 1997. [BEG] This thesis investigated the use of a Kohonen neural network algorithm as a clustering algorithm for electronic nose data using the chemometrics algorithms built into the electronic nose as a performance standard. A secondary aim was to improve the clustering and identification capabilities of the Kohonen network.

The unsupervised Kohonen network was not able to …

Avoiding Deadlock In A Multi-Processor Enviroment, Beth Davis

Honors Capstone Projects and Theses

No abstract provided.

Automatic Speaker Identification Using Reusable And Retrainable Binary-Pair Partitioned Neural Networks, Ashutosh Mishra

Electrical & Computer Engineering Theses & Dissertations

This thesis presents an extension of the work previously done on speaker identification using Binary Pair Partitioned (BPP) neural networks. In the previous work, a separate network was used for each pair of speakers in the speaker population. Although the basic BPP approach did perform well and had a simple underlying algorithm, it had the obvious disadvantage of requiring an extremely large number of networks for speaker identification with large speaker populations. It also requires training of networks proportional to the square of the number of speakers under consideration, leading to a very large number of networks to be trained …

Efficient Computation Of Location Depth Contours By Methods Of Computational Geometry, Kim Miller, Suneeta Ramaswami, Peter Rousseeuw, J. Antoni Sellarès, Diane Souvaine, Ileana Streinu, Anja Struyf

Computer Science: Faculty Publications

The concept of location depth was introduced as a way to extend the univariate notion of ranking to a bivariate configuration of data points. It has been used successfully for robust estimation, hypothesis testing, and graphical display. The depth contours form a collection of nested polygons, and the center of the deepest contour is called the Tukey median. The only available implemented algorithms for the depth contours and the Tukey median are slow, which limits their usefulness. In this paper we describe an optimal algorithm which computes all bivariate depth contours in O(n 2) time and space, using topological sweep …

Transport Discovery In Wireless Multi-Transport Environments, Shannon B. Barnes, Charles D. Knutson, Ryan W. Woodings

Faculty Publications

In order to utilize multiple transports, devices must discover common mechanisms for communication, a procedure we call Multi-Transport Discovery. The Multi-Transport Discovery algorithm presented in this paper is a four-phase procedure (Transport Probing, Transport Querying, Address-to-Device Mapping, and Transport Accessibility) that can discover common transports within a multi-transport environment. Transport Probing uses a transport-dependent device discovery mechanism to discover an initial link. Transport Querying communicates over the probed link to query additional transports. Address-to-Device Mapping correctly correlates each transport to a remote device. Finally, Transport Accessibility periodically ascertains link availability during an application session.

An Iterative Loop Matching Approach To The Prediction Of Rna Secondary Structures With Pseudoknots, Jianhua Ruan, Weixiong Zhang

All Computer Science and Engineering Research

Motivation: Pseudoknots have generally been excluded from the prediction of RNA secondary structures due to the difficulty in modeling and complexity in computing. Although several dynamic programming algorithms exist for the prediction of pseudoknots using thermodynamic approaches, they are neither reliable nor efficient. On the other hand, comparative methods are more reliable, but are often done in an ad hoc manner and require expert intervention. Maximum weighted matching (Tabaska et. al, Bioinformatics, 14:691-9, 1998), an algorithm for pseudoknot prediction with comparative analysis, suffers from low prediction accuracy in many cases. Here we present an algorithm, iterative loop matching, for predict-ing …

Ontology-Based Extraction Of Rdf Data From The World Wide Web, Timothy Adam Chartrand

Theses and Dissertations

The simplicity and proliferation of the World Wide Web (WWW) has taken the availability of information to an unprecedented level. The next generation of the Web, the Semantic Web, seeks to make information more usable by machines by introducing a more rigorous structure based on ontologies. One hinderance to the Semantic Web is the lack of existing semantically marked-up data. Until there is a critical mass of Semantic Web data, few people will develop and use Semantic Web applications. This project helps promote the Semantic Web by providing content. We apply existing information-extraction techniques, in particular, the BYU ontologybased data-extraction …

Providing The Third Dimension: High-Resolution Multibeam Sonar As A Tool For Archaeological Investigations - An Example From The D-Day Beaches Of Normandy, Larry A. Mayer, Brian R. Calder, J S. Schmidt, C Malzone

Center for Coastal and Ocean Mapping

In general, marine archaeological investigations begin in the archives, using historic maps, coast surveys, and other materials, to define submerged areas suspected to contain potentially significant historical sites. Following this research phase, a typical archaeological survey uses sidescan sonar and marine magnetometers as initial search tools. Targets are then examined through direct observation by divers, video, or photographs. Magnetometers can demonstrate the presence, absence, and relative susceptibility of ferrous objects but provide little indication of the nature of the target. Sidescan sonar can present a clear image of the overall nature of a target and its surrounding environment, but the …

Adaptive Transmission Power For Optimal Energy Reliable Multi-Hop Wireless Communication, Suman Banerjee, Archan Misra

Research Collection School Of Computing and Information Systems

We define a transmission power adaptation-based routing technique that finds optimal paths for minimum energy reliable data transfer in multi-hop wireless networks. This optimal choice of the transmission power depends on the link distance between the two nodes and the channel characteristics. Typical energy efficient routing techniques use a transmission power such that the received signal power at the destination minimally exceeds a desired threshold signal strength level. In this paper we argue that such a choice of the transmission power does not always lead to optimal energy routes, since it does not consider differences in the receiver noise levels. …

Creating And Modifying Dynamic Animation Sequences Using The Tgt_Toolkit, Ross Gore

Department of Math & Statistics Technical Report Series

Creating and modifying the dynamic animation sequences within the TGT_Toolkit is not for the faint of heart. This report contains advice, guidelines and refers to an example of how I went about constructing the dynamic animation sequences within the Linked Lists Tutorial. I have identified three major areas of that seem to be common to all dynamic animation sequences, but distinct from simply extending TGT_Slide as most other slides do; these areas are: dynamically creating animation configurations, providing "undo" and slide saving functionality and sequencing saved slides once they are properly configured. In these areas "slide saving" and "saved slides" …

Dynamic Trust Production Based On Based On Interaction Sequence, Yuhui Zhong, Yi Lu, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

Explicit Building-Block Multiobjective Genetic Algorithms: Theory, Analysis, And Developing, Jesse B. Zydallis

Theses and Dissertations

This dissertation research emphasizes explicit Building Block (BB) based MO EAs performance and detailed symbolic representation. An explicit BB-based MOEA for solving constrained and real-world MOPs is developed the Multiobjective Messy Genetic Algorithm II (MOMGA-II) which is designed to validate symbolic BB concepts. The MOMGA-II demonstrates that explicit BB-based MOEAs provide insight into solving difficult MOPs that is generally not realized through the use of implicit BB-based MOEA approaches. This insight is necessary to increase the effectiveness of all MOEA approaches. In order to increase MOEA computational efficiency parallelization of MOEAs is addressed. Communications between processors in a parallel MOEA …

Deterministic Intracellular Modeling, Jacqueline B. Young

Theses and Dissertations

The United States Air Force is interested in the potential side effects at the cellular level from exposure to mission-essential chemicals. Presently, Air Force toxicology studies are conducted to help shed light in identifying potential hazards to workers. However, it takes a considerable amount of money, resources, and time to obtain and analyze experimental results from toxicology studies. The necessity for innovative methods that enable researchers to more effectively generate and analyze data is apparent.

A Three-Dimensional Heads-Up Primary Navigation Reference Display For Paratroopers Performing High Altitude High Open Jumps, Brian A. Balazs

Theses and Dissertations

The Department of Defense (DoD) relies on the para-dropping of resources to meet different objectives in order to accomplish missions during peace-time, war-time, or military operations other than war. The resources dropped to the ground via parachute range from supplies and equipment to the most valued asset, people. Tactics have been developed to increase the safety of troops parachuting into areas of conflict. These tactics include high-altitude high-opening (HAHO) jumping and night jumping. HAHO jumping allows paratroopers to travel large distances in the air away from the path of the delivering aircraft. While night jumping, done with the aid of …

A Visual Language For Composable Simulation Scenarios, Carolyn R. Bartley

Theses and Dissertations

Modeling and Simulation plays an important role in how the Air Force trains and fights, Scenarios are used in simulation to give users the ability to specify entities and behaviors that should be simulated by a model: however, building and understanding scenarios can be a difficult and time-consuming process, furthermore, as composable simulations become more prominent, the need for a common descriptor for simulation scenarios has become evident. In order to reduce the complexity of creating and understanding simulation scenarios, a visual language was created, The research on visual languages presented in this thesis examines methods of visually specifying the …

Reverse Geographic Location Of A Computer Node, Clinton G. Carr Iii

Theses and Dissertations

The determination of methods by which a user is able to locate his computer when that user does not know his current location, termed "homestation", will provide the Air Force an advantage over its adversaries. The methods are a combination of different mathematical techniques that enable the user to manipulate data to minimize the effects of delay caused by various factors on the network. The techniques use the smallest round trip time obtained from the ping utility. This time is then converted into miles and plotted on a map of the United States. The methods used to solve this problem …

An Artificial Immune System Strategy For Robust Chemical Spectra Classification Via Distributed Heterogeneous Sensors, Mark A. Esslinger

Theses and Dissertations

The timely detection and classification of chemical and biological agents in a wartime environment is a critical component of force protection in hostile areas. Moreover, the possibility of toxic agent use in heavily populated civilian areas has risen dramatically in recent months. This thesis effort proposes a strategy for identifying such agents vis distributed sensors in an Artificial Immune System (AIS) network. The system may be used to complement "electronic" nose ("E-nose") research being conducted in part by the Air Force Research Laboratory Sensors Directorate. In addition, the proposed strategy may facilitate fulfillment of a recent mandate by the President …

Performance Evaluation And Analysis Of Effective Range And Data Throughput For Unmodified Bluetooth Communication Devices, Timothy F. Kneeland

Theses and Dissertations

The DoD and the Air Force continually seek to incorporate new technology in an effort to improve communication, work effectiveness, and efficiency. Office devices utilizing Bluetooth technology simplify device configuration and communication. They provide a means to communicate wirelessly over short distances thereby eliminating the need for different vendor specific cables and interfaces. One of the key concerns involved in incorporating new communication technology is security; the fundamental security concern of wireless communication is interception. Studies focusing on IEEE 802.11b have shown vulnerability zones around many DoD installations that reflect the ranges at which wireless communications using the 802.11b standard …

Implementing An Information Retrieval And Visualization Framework For Heterogeneous Data Types, Andrew J. Kowalchuk

Theses and Dissertations

In today's information focused world, there is no lack of entities focused on information gathering. However, there is still a widespread epidemic of information starvation in the Department of Defense (DoD). This starvation is attributed to the lack of interoperability between information gatherers and information consumers. To alleviate this problem, the DoD has put forth a vision of a Joint Battlespace Infosphere (JBI). This research proposes a framework for sharing and finding resources in a JBI. The framework uses an extensible metadata specification, agent technology, and the Control of Agent Based Systems (CoABS). It provides several tools for publication and …