Digital Commons Network^™

Adaptive Resonance Theory (Art): An Introduction, Lucien G. Heins, Daniel R. Tauritz

Computer Science Faculty Research & Creative Works

No abstract provided.

Error Estimates And Lipschitz Constants For Best Approximation In Continuous Function Spaces, M. Bartelt, W. Li

Mathematics & Statistics Faculty Publications

We use a structural characterization of the metric projection PG(f), from the continuous function space to its one-dimensional subspace G, to derive a lower bound of the Hausdorff strong unicity constant (or weak sharp minimum constant) for PG and then show this lower bound can be attained. Then the exact value of Lipschitz constant for PG is computed. The process is a quantitative analysis based on the Gâteaux derivative of PG, a representation of local Lipschitz constants, the equivalence of local and global Lipschitz constants for lower semicontinuous mappings, and construction …

A Mathematical Model Of Cycle Chemotherapy, J. C. Panetta, J. Adam

Mathematics & Statistics Faculty Publications

A mathematical model is used to discuss the effects of cycle-specific chemotherapy. The model includes a constraint equation which describes the effects of the drugs on sensitive normal tissue such as bone marrow. This model investigates both pulsed and piecewise-continuous chemotherapeutic effects and calculates the parameter regions of acceptable dose and period. It also identifies the optimal period needed for maximal tumor reduction. Examples are included concerning the use of growth factors and how they can enhance the cell kill of the chemotherapeutic drugs.

Ensuring The Satisfaction Of A Temporal Specification At Run-Time, Grace Tsai, Matt Insall, Bruce M. Mcmillin

Mathematics and Statistics Faculty Research & Creative Works

A responsive computing system is a hybrid of real-time, distributed and fault-tolerant systems. In such a system, severe consequences can occur if the run-time behavior does not conform to the expected behavior or specifications. In this paper, we present a formal approach to ensure satisfaction of the specifications in the operational environment as follows. First we specify behavior of the systems using Interval Temporal Logic (ITL). Next we give algorithms for trace checking of programs in such systems. Finally, we present a fully distributed run-time evaluation system which causally orders the events of the system during its execution and checks …

An Ada-Like Language To Facilitate Reliable Coding Of Low Cost Embedded Systems, Michael Collins

Theses : Honours

Due to a lack of operating system (0/S) support, it is more difficult to develop programs for embedded systems than for workstations. For those developing on a low budget, the problem is often further compounded by the necessity of using inappropriate, 0/S dependent, compilers. This study attempts to ascertain those elements of a High Level Language (HLL) which are absolutely necessary and implementable to produce reliable, efficient, embedded programs without the benefit of a large budget. The study is based upon the Ada philosophy as the Ada language incorporates many desirable features for modelling real-world problems in terms of embedded …

Implementation And Evaluation Of Enhanced Areal Interpolation Using Mapinfo And Mapbasic, Gordon Wragg

Theses : Honours

Many researchers today have a need to analyse data in a spatial context. An inherent problem is the mismatch of boundaries between the geographic regions for which data is collected and those regions for which the data is required. Often the solution is to interpolate data from one set of regions to another. This project examines and implements a method of areal interpolation that enables the user to use extra information in areal interpolation to increase the "intelligence ' of the process. This method of Enhanced Areal Interpolation uses a conditional Poisson distribution and the EM algorithm to provide estimated …

Hga: A Hardware-Based Genetic Algorithm, Stephen D. Scott, Ashok Samal, Sharad C. Seth

School of Computing: Conference and Workshop Papers

A genetic algorithm (GA) is a robust problem-solving method based on natural selection. Hardware's speed advantage and its ability to parallelize offer great rewards to genetic algorithms. Speedups of 1-3 orders of magnitude have been observed when frequently used software routines were implemented in hardware by way of reprogrammable field-programmable gate arrays (FPGAs). Reprogrammability is essential in a general-purpose GA engine because certain GA modules require changeability (e.g. the function to be optimized by the GA). Thus a hardware-based GA is both feasible and desirable. A fully functional hardware-based genetic algorithm (the HGA) is presented here as a proof-of-concept system. …

A Comprehensive, Automated Approach To Determining Sea Ice Thickness From Sar Data, Donna Haverkamp, Leen-Kiat Soh, Costas Tsatsoulis

School of Computing: Faculty Publications

This paper documents an approach to sea ice classification through a combination of methods, both algorithmic and heuristic. The resulting system is a comprehensive technique, which uses dynamic local thresholding as a classification basis and then supplements that initial classification using heuristic geophysical knowledge organized in expert systems. The dynamic local thresholding method allows separation of the ice into thickness classes based on local intensity distributions. Because it utilizes the data within each image, it can adapt to varying ice thickness intensities to regional and seasonal charges and is not subject to limitations caused by using predefined parameters.

Interaction And Interdependency Of Software Engineering Methods And Visual Programming, Robert A. Touchton

UNF Graduate Theses and Dissertations

Visual Programming Languages and Visual Programming Tools incorporate non-procedural coding mechanisms that may duplicate, or perhaps even conflict with, the analysis and design mechanisms promulgated by the mainstream Software Engineering methodologies. By better understanding such duplication and conflict, software engineers can take proactive measures to accommodate and, ideally, eliminate them. Better still, there may be opportunities for synergy that can be exploited if one is looking for them.

This research explored, documented and classified the interactions and interdependencies, both positive (synergies) and negative (conflicts), between two closely related and rapidly evolving Computer Science subdisciplines: software engineering and visual programming. A …

A Study Of Voluntary Participation In Computer User Groups, Alan Engels

Electronic Theses & Dissertations

The purpose of this study was to determine ways to increase participation of members in Computer User Groups. The problem addressed was that a small select group, less than ten percent, in the Parsons Apple/Macintosh Users Group was doing ninety-five percent or more of the work. If this scenario does not change soon, the overworked and overburdened select few may suffer burnout and quit. Case in point, Joplin, MO, had a large Computer User Group, but about seven years ago, it vanished when the select few refused to serve anymore. The same process of decay and erosion has happened in …

A Portable Computer System For Recording Heart Sounds And Data Modeling Using A Backpropagation Neural Network, Erik Mark Hudson

UNF Graduate Theses and Dissertations

Cardiac auscultation is the primary tool used by cardiologists to diagnose heart problems. Although effective, auscultation is limited by the effectiveness of human hearing. Digital sound technology and the pattern classification ability of neural networks may offer improvements in this area. Digital sound technology is now widely available on personal computers in the form of sound cards. A good deal of research over the last fifteen years has shown that neural networks can excel in diagnostic problem solving. To date, most research involving cardiology and neural networks has focussed on ECG pattern classification. This thesis explores the prospects of recording …

Transplanting Manufacturing Power: Observations From Five Years At Fujitsu, Steven M. Miller

Research Collection School Of Computing and Information Systems

Within a factory, what are the underpinnings of manufacturing power? During my thirty-month residency at Fujitsu's factory in Oyama, Japan, I constantly reflected on this question. The standard view of a factory structure provided by an organization chart was inadequate for summarizing my observations.

Multiple Query Optimization With Depth-First Branch-And-Bound And Dynamic Query Ordering, Ee Peng Lim, Ahmet Cosar, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

In certain database applications such as deductive databases, batch query processing, and recursive query processing etc., usually a single query gets transformed into a set of closely related database queries. Also, great benefits can be obtained by executing a group of related queries all together in a single unified multi-plan instead of executing each query separately. In order to achieve this Multiple Query Optimization (MQO) identifies common task(s) (e.g. common subexpressions, joins, etc.) among a set of query plans and creates a single unified plan (multi-plan) which can be executed to obtain the required outputs for all queries at once. …

Production Of Excited Beauty States In Z Decays, D. Buskulic, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

A data sample of about 3.0 million hadronic Z decays collected by the ALEPH experiment at LEP in the years 1991 through 1994, is used to make an inclusive selection of B hadron events.

Improved Tau Polarisation Measurement, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

Using 22 pb−1 of data collected at LEP in 1992 on the peak of the Z resonance, the ALEPH collaboration has measured the polarisation of the tau leptons decaying intoevv¯,μvv¯evv¯,μvv¯,πν, ρν and a1 ν from their individual decay product distributions. The measurement of the tau polarisation as a function of the production polar angle yields the two parametersN τ andN e, where, in terms of the axial and vector couplingsg Al andg Vl,N l=2g Vl gAl/(g 2Vl+g2Al). This analysis follows to a large extent the methods devised for the 1990 and 1991 data but with improvements which bring a better …

Adaptive Resonance Associative Map, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

This article introduces a neural architecture termed Adaptive Resonance Associative Map (ARAM) that extends unsupervised Adaptive Resonance Theory (ART) systems for rapid, yet stable, heteroassociative learning. ARAM can be visualized as two overlapping ART networks sharing a single category field. Although ARAM is simpler in architecture than another class of supervised ART models known as ARTMAP, it produces classification performance equivalent to that of ARTMAP. As ARAM network structure and operations are symmetrical, associative recall can be performed in both directions. With maximal vigilance settings, ARAM encodes pattern pairs explicitly as cognitive chunks and thus guarantees perfect storage and recall …

Finding Connected Components On A Scan Line Array Processor, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

This paper provides a new approach to labeling the connected components of an n x n image on a scan line array processor (comprised of n processing elements). Variations of this approach yield an algorithm guaranteed to complete in o(n lg n) time as well as algorithms likely to approach O(n) time for all or most images. The best previous solutions require using a more complicated architecture or require Omega(n lg n) time. We also show that on a restricted version of the architecture, any algorithm requires Omega(n lg n) time in the worst case.

A Taxonomy Of Workgroup Computing Applications, Warren Von Worley

CCAC Theses and Dissertations

The goal of workgroup computing is to help individuals and groups efficiently perform a wide range of functions on networked computer systems (Ellis, Gibbs, & Rein, 1991). Early workgroup computing tools were designed for limited functionality and group interaction (Craighill, 1992). Current workgroup computing applications do not allow enough control of group processes and they provide little correlation between various workgroup computing application areas (Rodden and Blair, 1991). An integrated common architecture may produce more effective workgroup computing applications. Integrating common support functions into a common framework will avoid duplication of these functions for each workgroup computing application (Pastor & …

Multicriteria Mission Route Planning Using A Parallel A* Search, Michael S. Gudaitis

Theses and Dissertations

The Mission Route Planning (MRP) Problem falls into the general class of multicriteria path search problems. Multiple criteria are evaluated to select an optimal aircraft mission route through a hostile environment. Criteria for distance travelled and radar exposure are combined into a single cost function for route evaluation. Radar calculations are performed dynamically. The A* search algorithm is applied to the MRP problem, and a parallel implementation is developed and tested. A unique combination of distributed OPEN lists with a global CLOSED list strategy produced fast execution times on the Paragon. Test cases for scenarios with 15 radars took less …

Computing Χ² Values, John F. Dooley, Daniel C. St Clair, William E. Bond

Mathematics and Statistics Faculty Research & Creative Works

Textbooks and courses on numerical algorithms contain numerous examples which lead students to believe that the algorithm of choice for computing the zeros of a function f1994 is Newton's algorithm. In many of these courses little or no time is spent in providing students with "real world" experiences where Newton's method fails. The work presented in this paper describes a slow convergence problem encountered while trying to use Newton to estimate values for the 2 distributions. The problem occurred while the authors were trying to implement a well-known machine learning algorithm from the field of artificial intelligence. The function being …

Program Modeling And Control Synthesis For Robotic Manipulators, Ramiz N. Ballou, Arlan R. Dekock, David D. Ardayfio

Computer Science Technical Reports

The control and programming methodology of industrial robots is becoming increasingly important. The speed and accuracy of data generation, and the performance of the robot are considered the most important factors in robotics control. This paper presents and discusses algorithms that solve for the inverse solution for a given point in space at a very high speed based on the top down abstract method. The algorithms are independent of any specific type of manipulator configuration or programming language. The algorithms were implemented for the IBM-PC™ using the FORTRAN language to control the Armdroid™ robot. The program generates 500 sets of …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 10, December 1994, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A fourteen page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Improving Intrusion Detection In Unix-Based Networks, David R. Landry

Theses and Dissertations

Computer security has not kept pace with the rapid growth of networked systems. Through its connection to the Internet, the Department of Defense is vulnerable to computer-based attacks. Current intrusion detection systems are still unproven, too complicated, or too costly for most system security officers to implement. The attack methods used by system intruders are known and can be represented as groups of commands called attack signatures. This thesis investigates methods for detecting intruders by monitoring command usage. Testing was conducted in both controlled and uncontrolled circumstances. With controlled testing, it was shown that 7 of the 11 signatures could …

Topologies Invariant Under A Group Action, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

We study links between faithful group actions on a set and topologies on that set. In one direction, a group action has its invariant topologies (so we may regard members of the action to be homeomorphisms relative to those topologies); in the other direction, a topology has its preserving group actions (i.e., the subgroups of the homeomorphism group of the topology). This two-way passage allows us to discuss topological features of group actions as well as symmetry features of topologies.

An Analysis Of Bayesian Networks As Classifiers, Gregory C. Ahlquist

Theses and Dissertations

An analysis of Bayesian networks as classifiers is presented. This analysis results in an algorithm and several tools related to Bayesian network classifiers. The tools calculate and display the decision regions for two level Bayesian network classifiers. They collectively provide an approach to analyze the effects of changing network parameters on the network's decision regions. The algorithm defines a Bayesian network classifier to solve traditional classification problems. The algorithm is data driven, meaning that the resulting Bayesian network classifier is uniquely tuned to the classification problem at hand. Also, the algorithm contains procedures for defining the topology of a Bayesian …

Generalized Probabilistic Reasoning And Empirical Studies On Computational Efficiency And Scalability, Eric P. Baenen

Theses and Dissertations

Expert Systems are tools that can be very useful for diagnostic purposes, however current methods of storing and reasoning with knowledge have significant limitations. One set of limitations involves how to store and manipulate uncertain knowledge: much of the knowledge we are dealing with has some degree of uncertainty. These limitations include lack of complete information, not being able to model cyclic information and limitations on the size and complexity of the problems to be solved. If expert systems are ever going to be able to tackle significant real world problems then these deficiencies must be corrected. This paper describes …

Artificially Intelligent Air Combat Simulation Agents, Daniel E. Gisselquist

Theses and Dissertations

The Advanced Research Projects Agency (ARPA), in an effort to improve military simulations, has proposed a standard for Distributed Interactive Simulation (DIS). This network protocol will allow dissimilar applications to communicate simulation information. In the field of air combat, this will allow pilots in remote simulators to fly in a common simulation. The success of this standard is dependent on applications being able to work within that standard, as well as a large variety of Computer Generated Forces (CGFs) to complement interactive forces. CGFs are needed to help simulate the large combat scenarios that can only occur in wartime. By …

Unification Of Larch And Z-Based Object Models To Support Algebraically-Based Design Refinement: The Larch Perspective, Catherine J. Lin

Theses and Dissertations

This research describes the feasibility of developing object-oriented LARCH specifications, part of a dual approach for formally extending object-oriented analysis models using LARCH and Z. The first phase consisted of two steps establishing a set of transformation heuristics for algebraically representing object models and implementing a robust LARCH parser. The LARCH parser produced abstract syntax trees ASTs of objects forming the basis for analyzing the similarities and differences between Z-based and LARCH-based object representations. The second phase used the analysis of LARCH and Z to identify fundamental core constructs in the languages and abstract syntax trees. These core constructs consisted …

Next Generation Real-Time Systems: Investigating The Potential Of Partial-Solution Tasks, Robert E. J. Caley

Theses and Dissertations

While the cyclic executive and fixed-priority scheduling strategies have been sufficient to handle traditional real- time requirements. they are insufficient for dealing with the complexities of next-generation real-time systems. New methods of intelligent control must be developed for guaranteeing on-time task completion for real-time systems that are faced with unpredictable and dynamically changing requirements. Implementing real-time processes as partial-solution tasks is one technique that may be beneficial. This type of task. when combined with intelligent control, has the potential for increasing pre-runtime schedulability, system maintainability. and runtime robustness. This research investigates the benefits of partial-solution tasks by experimentally measuring the …

The Photo-Realistic Afit Virtual Cockpit, Milton E. Diaz

Theses and Dissertations

The Air Force Institute of Technology (AFIT) has pursued research in virtual environments since 1988. This research expands the current capabilities of the AFIT Virtual Cockpit (VC) by increasing the realism of the cockpit environment and improving the pilot's command interface. Realism is improved creating console elements from texture maps and polygonal models; these elements include working dials, switches and circuit breakers. The pilot command interface is improved in part by adapting the AFIT Information Pod using a two-dimensional mouse input to the virtual three-dimensional environment. This immersive virtual environment is also improved by modifications to the Head Mounted Display …