Computer Sciences Commons^™

Comparing Traditional Statistical Models With Neural Network Models: The Case Of The Relation Of Human Performance Factors To The Outcomes Of Military Combat, William Oliver Hedgepeth

Engineering Management & Systems Engineering Theses & Dissertations

Statistics and neural networks are analytical methods used to learn about observed experience. Both the statistician and neural network researcher develop and analyze data sets, draw relevant conclusions, and validate the conclusions. They also share in the challenge of creating accurate predictions of future events with noisy data.

Both analytical methods are investigated. This is accomplished by examining the veridicality of both with real system data. The real system used in this project is a database of 400 years of historical military combat. The relationships among the variables represented in this database are recognized as being hypercomplex and nonlinear.

The …

Software Reliability Issues: An Experimental Approach, Mary Ann Hoppa

Computer Science Theses & Dissertations

In this thesis, we present methodologies involving a data structure called the debugging graph whereby the predictive performance of software reliability models can be analyzed and improved under laboratory conditions. This procedure substitutes the averages of large sample sets for the single point samples normally used as inputs to these models and thus supports scrutiny of their performances with less random input data.

Initially, we describe the construction of an extensive database of empirical reliability data which we derived by testing each partially debugged version of subject software represented by complete or partial debugging graphs. We demonstrate how these data …

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 Linear-Time Recognition Algorithm For P4-Reducible Graphs, B. Jamison, S. Olariu

Computer Science Faculty Publications

The P₄-reducible graphs are a natural generalization of the well-known class of cographs, with applications to scheduling, computational semantics, and clustering. More precisely, the P₄-reducible graphs are exactly the graphs none of whose vertices belong to more than one chordless path with three edges. A remarkable property of P₄-reducible graphs is their unique tree representation up to isomorphism. In this paper we present a linear-time algorithm to recognize P₄-reducible graphs and to construct their corresponding tree representation.

Linear Time Optimization Algorithms For P4-Sparse Graphs, Beverly Jamison, Stephan Olariu

Computer Science Faculty Publications

Quite often, real-life applications suggest the study of graphs that feature some local density properties. In particular, graphs that are unlikely to have more than a few chordless paths of length three appear in a number of contexts. A graph G is P₄-sparse if no set of five vertices in G induces more than one chordless path of length three. P₄-sparse graphs generalize both the class of cographs and the class of P₄-reducible graphs. It has been shown that P₄-sparse graphs can be recognized in time linear in the size of the …

An Optimal Path Cover Algorithm For Cographs, R. Lin, S. Olariu

Computer Science Faculty Publications

The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. In this paper, we present an optimal algorithm for determining a minimum path cover for a cograph G. In case G has a Hamiltonian path (cycle) our algorithm exhibits the path (cycle) as well.

Autonomous Robot Navigation In Unknown Terrains Using Parallel Numerical Artificial Potential Fields, John C. Schneider

Computer Science Theses & Dissertations

We present a new artificial potential field formulation for resolution complete robot navigation that unifies the purely geometric path planning problem with the lower level force control problem. Our formulation is designed for numerical computation over a massively parallel mesh of processors and is responsive to newly discovered terrain features. It does not suffer from many of the problems commonly associated with potential fields and with adequate resolution provides provably correct, collision free convergence to the goal. In addition, our formulation supports many desirable, practical features required for implementation, such as bounded actuator torques, attainable incremental constructability, realizable computation and …

Biofeedback Gait Training Auditory Vs. Visual Techniques, Timothy D. Hiemenz

Electrical & Computer Engineering Theses & Dissertations

Training lower extremity amputees to walk normally is quite a difficult task. Amputees must wear a prosthesis so they can walk at all. This allows them some mobility, but their walking pattern may be unnatural. If their gait is temporally asymmetric, they need to exert more energy to move about. This research was initiated to help lower extremity amputees to walk more efficiently using biofeedback gait training. Two types of feedback were developed and tested to determine which method gave the most understandable feedback, validating its use in a clinical setting.

A normal gait cycle uses the lower limbs to …

Defining Locally Shared Memory Constructs For Special Purpose Parallel Architectures, David J. Nielsen

Electrical & Computer Engineering Theses & Dissertations

Locally shared memory systems offer significant advantages over other parallel processing systems for specific classes of problems. Locally shared memory systems tend to be easier to program because explicit passing of messages is not necessary. The goal in defining a locally shared memory system is to allow only a small number of processors access to any single memory. If this goal is met, locally shared memory systems provide an architecture which is relatively simple to implement.

To make shared memory architectures attractive to designers of special purpose parallel architectures, the architectures must be scalable. To be scalable, the number of …

Dynamic Task Scheduling For The Atamm Multicomputer Operating System Using Embedded Firmware On Microcontrollers, Sudhir Sastry

Electrical & Computer Engineering Theses & Dissertations

A dynamic task scheduling strategy for the distributed processing of large grain dataflow algorithms using embedded firmware on an ATAMM testbed consisting of interconnected microcontrollers is presented in this thesis. The ODU/NASA developed Algorithm to Architecture Mapping Model, ATAMM, uses marked graph models to specify data and control flow for the execution of iterative, deterministic large grain dataflow algorithms in a multicomputing environment. The testbed consists of a bank of four 68HC11 microcontrollers that communicate over a token bus. The token bus arbitration scheme used is contention free and well suited for real-time computing applications. The execution of data flow …

The World Wide Web And Technology Transfer At Nasa Langley Research Center, Michael L. Nelson, David J. Bianco

Computer Science Faculty Publications

NASA Langley Research Center (LaRC) began using the World Wide Web (WWW) in the summer of 1993, becoming the first NASA installation to provide a Center-wide home page. This coincided with a reorganization of LaRC to provide a more concentrated focus on technology transfer to both aerospace and non-aerospace industry. Use of the WWW and NCSA Mosaic not only provides automated information dissemination, but also allows for the implementation, evolution and integration of many technology transfer applications. This paper describes several of these innovative applications, including the on-line presentation of the entire Technology Opportunities Showcase (TOPS), an industrial partnering showcase …

World Wide Web Implementation Of The Langley Technical Report Server, Michael L. Nelson, Gretchen L. Gottlich, David J. Bianco

Computer Science Faculty Publications

On January 14, 1993, NASA Langley Research Center (LaRC) made approximately 130 formal, 'unclassified, unlimited' technical reports available via the anonymous FTP Langley Technical Report Server (LTRS). LaRC was the first organization to provide a significant number of aerospace technical reports for open electronic dissemination. LTRS has been successful in its first 18 months of operation, with over 11,000 reports distributed and has helped lay the foundation for electronic document distribution for NASA. The availability of World Wide Web (WWW) technology has revolutionized the Internet-based information community. This paper describes the transition of LTRS from a centralized FTP site to …

Electronic Document Distribution: Design Of The Anonymous Ftp Langley Technical Report Server, Michael L. Nelson, Gretchen L. Gottlich

Computer Science Faculty Publications

An experimental electronic dissemination project, the Langley Technical Report Server (LTRS), has been undertaken to determine the feasibility of delivering Langley technical reports directly to the desktops of researchers worldwide. During the first six months, over 4700 accesses occurred and over 2400 technical reports were distributed. This usage indicates the high level of interest that researchers have in performing literature searches and retrieving technical reports at their desktops. The initial system was developed with existing resources and technology. The reports are stored as files on an inexpensive UNIX workstation and are accessible over the Internet. This project will serve as …

A Strategy For Electronic Dissemination Of Nasa Langley Technical Publications, Donna G. Roper, Mary K. Mccaskill, Scott D. Holland, Joanne L. Walsh, Michael L. Nelson, Susan L. Adkins, Manjula Y. Ambur, Bryan A. Campbell

Computer Science Faculty Publications

To demonstrate NASA Langley Research Center's relevance and to transfer technology to external customers in a timely and efficient manner, Langley has formed a working group to study and recommend a course of action for the electronic dissemination of technical reports (EDTR). The working group identified electronic report requirements (e.g., accessibility, file format, search requirements) of customers in U.S. industry through numerous site visits and personal contacts. Internal surveys were also used to determine commonalities in document preparation methods. From these surveys, a set of requirements for an electronic dissemination system was developed. Two candidate systems were identified and evaluated …

A Greedy Hypercube-Labeling Algorithm, D. Bhagavathi, C. E. Grosch, S. Olariu

Computer Science Faculty Publications

Due to its attractive topological properties, the hypercube multiprocessor has emerged as one of the architectures of choice when it comes to implementing a large number of computational problems. In many such applications, Gray-code labelings of the hypercube are a crucial prerequisite for obtaining efficient algorithms. We propose a greedy algorithm that, given an n-dimensional hypercube H with N=2² nodes, returns a Gray-code labeling of H, that is, a labeling of the nodes with binary strings of length n such that two nodes are neighbors in the hypercube if, and only if, their labels differ in exactly …

Cyclo-Static Scheduling Of Large Grain Dataflow Algorithms On A Local Area Atamm Multicomputing Testbed, Sudeepto Roy

Electrical & Computer Engineering Theses & Dissertations

A strategy for cyclo-statically scheduling deterministic large grain dataflow (LGDF) algorithms for distributed execution on loosely coupled multicomputer architectures is presented in this research. The computational paradigm used is the ODU/NASA developed Algorithm To Architecture Mapping Model (ATAMM), which consists of marked graphs and Gantt chart representations that model the iterative execution of deterministic LGDF algorithms for different values of throughput and computation time. It is postulated that the behavior of these algorithms could be represented by the aggregate execution of an ensemble of cyclically shifted threads of a specific node sequence. Assuming the existence of one or more such …

A Framework For Data Sharing In Computer Supported Cooperative Environments, Mohamed Youssef Eltoweissy

Computer Science Theses & Dissertations

Concurrency control is an indispensable part of any information sharing system. Co-operative work introduces new requirements for concurrency control which cannot be met using existing applications and database management systems developed for non-cooperative environments. The emphasis of concurrency control in conventional database management systems is to keep users and their applications from inadvertently corrupting data rather than support a workgroup develop a product together. This "insular" approach is necessary because applications that access the database have been built with the assumptions that they have exclusive access to the data they manipulate and that users of these applications are generally oblivious …

Multilevel Parallel Communications, Sanjay Khanna

Computer Science Theses & Dissertations

The research reported in this thesis investigates the use of parallelism at multiple levels to realize high-speed networks that offer advantages in throughput, cost, reliability, and flexibility over alternative approaches. This research specifically considers use of parallelism at two levels: the "upper" level and the "lower" level. At the upper level, N protocol processors perform functions included in the transport and network layers. At the lower level, M channels provide data and physical layer functions. The resulting system provides very high bandwidth to an application. A key concept of this research is the use of replicated channels to provide a …

Real Time Texture Analysis From The Parallel Computation Of Fractal Dimension, Halford I. Hayes Jr.

Computer Science Theses & Dissertations

The discrimination of texture features in an image has many important applications: from detection of man-made objects from a surrounding natural background to identification of cancerous from healthy tissue in X-ray imagery. The fractal structure in an image has been used with success to identify these features but requires unacceptable processing time if executed sequentially.

The paradigm of data parallelism is presented as the best method for applying massively parallel processing to the computation of fractal dimension of an image. With this methodology, and sufficient numbers of processors, this computation can reach real time speeds necessary for many applications. A …

Resource Utilization Model For The Algorithm To Architecture Mapping Model, Rakesh R. Patel

Electrical & Computer Engineering Theses & Dissertations

The analytical model for resource utilization, and the variable node time and conditional node model for the enhanced ATAMM model for a real-time data flow architecture, is presented in this research. The Algorithm To Architecture Mapping Model, ATAMM, is a Petri net based graph theoretic model developed at Old Dominion University, and is capable of modeling the execution of large-grained algorithms on a real-time data flow architecture. Using the resource utilization model, the resource envelope may be obtained directly from a given graph and, consequently, the maximum number of required resources may be evaluated. The node timing diagram for one …

A Performance Prediction Model For A Fault-Tolerant Computer During Recovery And Restoration, Rodrigo A. Obando

Electrical & Computer Engineering Theses & Dissertations

The modeling and design of a fault-tolerant multiprocessor system is addressed in this dissertation. In particular, the behavior of the system during recovery and restoration after a fault has occurred is investigated. Given that a multicomputer system is designed using the Algorithm to Architecture To Mapping Model (ATAMM) model, and that a fault (death of a computing resource) occurs during its normal steady-state operation, a model is presented as a viable research tool for predicting the performance bounds of the system during its recovery and restoration phases. Furthermore, the bounds of the performance behavior of the system during this transient …

Fast Fourier Transforms On Distributed Memory Parallel Machines, Anshu Dubey

Computer Science Theses & Dissertations

One issue which is central in developing a general purpose subroutine on a distributed memory parallel machine is the data distribution. It is possible that users would like to use the subroutine with different data distributions. Thus there is a need to design algorithms on distributed memory parallel machines which can support a variety of data distributions. In this dissertation we have addressed the problem of developing such algorithms to compute the Discrete Fourier Transform (DFT) of real and complex data. The implementations given in this dissertation work for a class of data distributions commonly encountered in scientific applications, known …

Time-Optimal Algorithms On Meshes With Multiple Broadcasting, Dharmavani Bhagavathi

Computer Science Theses & Dissertations

The mesh-connected computer architecture has emerged as a natural choice for solving a large number of computational tasks in image processing, computational geometry, and computer vision. However, due to its large communication diameter, the mesh tends to be slow when it comes to handling data transfer operations over long distances. In an attempt to overcome this problem, mesh-connected computers have recently been augmented by the addition of various types of bus systems. One such system known as the mesh with multiple broadcasting involves enhancing the mesh architecture by the addition of row and column buses. The mesh with multiple broadcasting …

Recognition Of Quadric Surfaces From Range Data: An Analytical Approach, Ivan X. D. D'Cunha

Electrical & Computer Engineering Theses & Dissertations

In this dissertation, a new technique based on analytic geometry for the recognition and description of three-dimensional quadric surfaces from range images is presented. Beginning with the explicit representation of quadrics, a set of ten coefficients are determined for various three-dimensional surfaces. For each quadric surface, a unique set of two-dimensional curves which serve as a feature set is obtained from the various angles at which the object is intersected with a plane. Based on a discriminant method, each of the curves is classified as a parabola, circle, ellipse, hyperbola, or a line. Each quadric surface is shown to be …

The Use Of A Factory Simulation To Evaluate A Flexible Control Structure For Integrated Manufacturing, Ling Ling Pan

Engineering Management & Systems Engineering Theses & Dissertations

Once a control structure for an integrated manufacturing system is decided upon, manufacturing activities are limited by that structure. A flexible control structure is presented as an approach for accommodating a variety of manufacturing activities, without being limited to a single control structure. A flexible control structure is one that allows multiple types of control structure in the manufacturing process. For example, both hierarchical and non-hierarchical structures may be used in a flexible structure. The properties of a flexible control structure are discussed from the point of view of graph theory.

Control structures for automated manufacturing are difficult to evaluate …

Temporal Model Of An Optically Pumped Co-Doped Solid State Laser, T. G. Wangler, J. J. Swetits, A. M. Buoncristiani

Mathematics & Statistics Faculty Publications

Currently, research is being conducted on the optical properties of materials associated with the development of solid-state lasers in the 2 micron region. In support of this effort, a mathematical model describing the energy transfer in a holmium laser sensitized with thulium is developed. In this paper, we establish some qualitative properties of the solution of the model, such as non-negativity, boundedness, and integrability. A local stability analysis is then performed from which conditions for asymptotic stability are obtained. Finally, we report on our numerical analysis of the system and how it compares with experimental results.

Design And Implementation Of Fuzzy Logic Controllers. Thesis Final Report, 27 July 1992 - 1 January 1993, Osama A. Abihana, Oscar R. Gonzalez

Electrical & Computer Engineering Faculty Publications

The main objectives of our research are to present a self-contained overview of fuzzy sets and fuzzy logic, develop a methodology for control system design using fuzzy logic controllers, and to design and implement a fuzzy logic controller for a real system. We first present the fundamental concepts of fuzzy sets and fuzzy logic. Fuzzy sets and basic fuzzy operations are defined. In addition, for control systems, it is important to understand the concepts of linguistic values, term sets, fuzzy rule base, inference methods, and defuzzification methods. Second, we introduce a four-step fuzzy logic control system design procedure. The design …

The Dynamics Of Growth-Factor-Modified Immune-Response To Cancer Growth: One-Dimensional Models, J. A. Adam

Mathematics & Statistics Faculty Publications

By characterizing the effect of tumor growth factors as deviations from normal logistic-type growth rates, the spatio-temporal dynamics for a one-dimensional model of cancer growth incorporating immune response are studied. The growth rates considered are classified respectively as normal, activated, inhibited and delay activated. The homogeneous steady states are defined by relative extrema of a ''free energy'' function V(x) for each of the above four cases. This function is of particular importance in studying the coexistence of tumoral and cancer-free steady states, and in identifying the nature (progressive or regressive) of travelling wave solutions to the nonlinear partial differential equation …

A Comparison Of Queueing, Cluster And Distributed Computing Systems, Joseph A. Kaplan, Michael L. Nelson

Computer Science Faculty Publications

Using workstation clusters for distributed computing has become popular with the proliferation of inexpensive, powerful workstations. Workstation clusters offer both a cost effective alternative to batch processing and an easy entry into parallel computing. However, a number of workstations on a network does not constitute a cluster. Cluster management software is necessary to harness the collective computing power. A variety of cluster management and queuing systems are compared: Distributed Queueing Systems (DQS), Condor, Load Leveler, Load Balancer, Load Sharing Facility (LSF - formerly Utopia), Distributed Job Manager (DJM), Computing in Distributed Networked Environments (CODINE), and NQS/Exec. The systems differ in …

Intel Nx To Pvm 3.2 Message Passing Conversion Library, Trey Arthur, Michael L. Nelson

Computer Science Faculty Publications

NASA Langley Research Center has developed a library that allows Intel NX message passing codes to be executed under the more popular and widely supported Parallel Virtual Machine (PVM) message passing library. PVM was developed at Oak Ridge National Labs and has become the defacto standard for message passing. This library will allow the many programs that were developed on the Intel iPSC/860 or Intel Paragon in a Single Program Multiple Data (SPMD) design to be ported to the numerous architectures that PVM (version 3.2) supports. Also, the library adds global operations capability to PVM. A familiarity with Intel NX …