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

Software Engineering Commons™

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

Old Dominion University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 61 - 72 of 72

Full-Text Articles in Software Engineering

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

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=22 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 …

Go to article

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

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.

Go to article

Single Object Detection Using Multiple Sensors With Unknown Noise Distributions, Shaofen Chen May 1992

Single Object Detection Using Multiple Sensors With Unknown Noise Distributions, Shaofen Chen

Computer Science Theses & Dissertations

We consider the design of an object classification system that identifies single objects using a system of sensors; each sensor outputs a random vector, according to an unknown (noise) probability distribution, in response to a sensed object. We consider a special class of systems, called the linearly separable systems, where the error-free sensor outputs corresponding to distinct objects can be mapped into disjoint intervals on real line. Given a set of sensor outputs corresponding to known objects, we show that a detection rule αemp that approaches the correct rule with a high probability can be computed. We show …

Go to article

A Case Study In Software Reuse: The Rntds Architecture, Barry J. Stevens Dec 1991

A Case Study In Software Reuse: The Rntds Architecture, Barry J. Stevens

Computer Science Theses & Dissertations

It has been asserted that the most significant gains in software productivity will come from increased levels of software reuse. Some economic models for predicting savings through software reuse exist, but none are based on actual project experience. This paper surveys those models and presents the results of a case study, the Restructured Naval Tactical Data Systems (RNTDS) architecture, in the light of those models. According to the models, software reuse via the RNTDS architecture has enabled the production of fourteen major computer programs at five to twenty-one percent of the cost to create them without software reuse. Organizational characteristics …

Go to article

A Mergeable Double-Ended Priority Queue, S. Olariu, Z. Wen Jan 1991

A Mergeable Double-Ended Priority Queue, S. Olariu, Z. Wen

Computer Science Faculty Publications

An implementation of a double-ended priority queue is discussed. This data structure referred to as min–max–pair heap can be built in linear time; the operations Delete-min, Delete-max and Insert take O(log n) time, while Find-min and Find-max run in O(1) time. In contrast to the min-max heaps, it is shown that two min–max–pair heaps can be merged in sublinear time. More precisely, two min–max–pair heaps of sizes n and k can be merged in time O(log (n/k) * log k).

Go to article

A Software Design Tool For Predictable Performance In Real-Time, Data Flow Architectures, Brij Mohan V. Mandala Oct 1990

A Software Design Tool For Predictable Performance In Real-Time, Data Flow Architectures, Brij Mohan V. Mandala

Electrical & Computer Engineering Theses & Dissertations

A software design tool which aids in the performance evaluation and selection of operating points for an algorithm implemented in ATAMM defined data flow architectures is presented in this thesis. ATAMM (Algorithm To Architecture Mapping Model) is a new graph theoretic model developed by researchers at Old Dominion University and the NASA-Langley Research Center. ATAMM is capable of modeling the execution of large-grained algorithms on distributed data flow architectures. A software tool is required for predicting the performance, determining the resource requirements and for selecting suitable operating points for an ATAMM based system. The ATAMM Design Tool presented in this …

Go to article

Pipelining Data Compression Algorithms, R. L. Bailey, R. Mukkamala Jan 1990

Pipelining Data Compression Algorithms, R. L. Bailey, R. Mukkamala

Computer Science Faculty Publications

Many different data compression techniques currently exist. Each has its own advantages and disadvantages. Combining (pipelining) multiple data compression techniques could achieve better compression rates than is possible with either technique individually. This paper proposes a pipelining technique and investigates the characteristics of two example pipelining algorithms. Their performance is compared with other well-known compression techniques.

Go to article

Efficient Schemes To Evaluate Transaction Performance In Distributed Database Systems, R. Mukkamala, S. C. Bruell Jan 1990

Efficient Schemes To Evaluate Transaction Performance In Distributed Database Systems, R. Mukkamala, S. C. Bruell

Computer Science Faculty Publications

Database designers and researchers often need efficient schemes to evaluate transaction performance. In this paper, we chose two important performance measures: the average number of nodes accessed and the average number of data items accessed per node by a transaction in a distributed database system. We derive analytical expressions to evaluate these metrics. For general applicability, we consider partially replicated distributed database systems. Our first set of analytic results are closed-form expressions for these two measures. These are based on some fairly restrictive simplifying assumptions. When these assumptions are relaxed, no closed-form expressions exist for these averages. Hence, we develop …

Go to article

Automatically Generating Functional Tests From Specifications - A Knowledge Based Constraint Logical Programming Approach, Ji Chen Jan 1989

Automatically Generating Functional Tests From Specifications - A Knowledge Based Constraint Logical Programming Approach, Ji Chen

Computer Science Theses & Dissertations

Recent experimental results indicate that functional testing is one of the most effective methods in detecting certain classes of faults. Very little work has been done in automating functional testing. This thesis research develops a method, called hierarchical partition, for automating functional testing. The key to our approach is the utilization of a pre-existing knowledge base about the domain of discourse. Several approaches to knowledge organiza­tion are discussed along with the resulting effects on the quantity and quality of functional tests produced. This research is an application and development of Generic Constraint Logic Programming and the Knowledge Driven …

Go to article

Generic Specifications In Lil And In Ada Via Analogies, George Chester Harrison May 1986

Generic Specifications In Lil And In Ada Via Analogies, George Chester Harrison

Computer Science Theses & Dissertations

We address the problem of .making verifiable specifications in generic program units in the Ada Programming Language*. We illustrate the methodologies of LIL proposed by Joseph Goguen and Justify the use of such a specification languages using analogy programming originally proposed by Nachum Dershowitz. The work in these areas is new and noticeably incomplete. We address our concern about the reusability of Ada software in a programming environment that includes a specification language like LIL. * Ada is a registered trademark of the U.S. Government (Ada Joint Program Office)

Go to article

Design Of Multivariable Feedback Control Systems Via Spectral Assignment, Mohsen Marefat Oct 1985

Design Of Multivariable Feedback Control Systems Via Spectral Assignment, Mohsen Marefat

Electrical & Computer Engineering Theses & Dissertations

During the past 15 year s significant advances have been made towards developing viable synthesis- techniques for multivariable feedback control systems. The entire aggregate of this theoretical work has been reviewed and consolidated. Diverse notations have been standardized into a single system. A two-step design philosophy for spectral assignment has been developed which first meets stability and time response requirements by assigning eigenvalues and eigenvector s and then provides for attainment of secondary objectives without significant deviation from the initial assignment. Finally, a computer-aided design package has been created to streamline the process of mathematical calculation and to allow users …

Go to article

Color Display Of Vowel Spectra As A Training Aid For The Deaf, Amir Jalali Jagharghi Jul 1985

Color Display Of Vowel Spectra As A Training Aid For The Deaf, Amir Jalali Jagharghi

Electrical & Computer Engineering Theses & Dissertations

The objective of this research was to develop a transformation for mapping speech parameters to color parameter. This transformation is done in real-time, and the resulting color parameter are continuously displayed on a color monitor. This visual speech display is to be used as a speech articulation training aid for the deaf. The conversion of speech acoustic signals into speech parameter was accomplished using special -purpose electronics. The real-time conversion of speech parameter to display parameter was controlled by an 8086/8088 microprocessor operating in an S-100 bus structure. The coefficients of the Karhunen-Loeve series expansion of speech power spectra were …

Go to article

First Prev