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

Digital Commons Network™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 26101 - 26130 of 27693

Full-Text Articles in Entire DC Network

Relaxing Synchronization In Distributed Simulated Annealing, Bruce M. Mcmillin, Chul-Eui Hong Jan 1995

Relaxing Synchronization In Distributed Simulated Annealing, Bruce M. Mcmillin, Chul-Eui Hong

Computer Science Faculty Research & Creative Works

This paper presents a cost error measurement scheme and relaxed synchronization method, for simulated annealing on a distributed memory multicomputer, which predicts the amount of cost error that an algorithm will tolerate. An adaptive error control method is developed and implemented on an Intel iPSC/2


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

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 Jan 1995

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 …


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 Jan 1995

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 …


A Linear-Time Recognition Algorithm For P4-Reducible Graphs, B. Jamison, S. Olariu Jan 1995

A Linear-Time Recognition Algorithm For P4-Reducible Graphs, B. Jamison, S. Olariu

Computer Science Faculty Publications

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


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

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.


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

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 P4-sparse if no set of five vertices in G induces more than one chordless path of length three. P4-sparse graphs generalize both the class of cographs and the class of P4-reducible graphs. It has been shown that P4-sparse graphs can be recognized in time linear in the size of the …


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

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 …


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

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.


First Measurement Of The Quark-To-Photon Fragmentation Function, D. Buskulic, Manoj Thulasidas Jan 1995

First Measurement Of The Quark-To-Photon Fragmentation Function, D. Buskulic, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

Earlier measurements at LEP of isolated hard photons in hadronic Z decays, attributed to radiation from primary quark pairs, have been extended in the ALEPH experiment to include hard photon production inside hadron jets. Events are selected where all particles combine democratically to form hadron jets, one of which contains a photon with a fractional energy z 0:7. After statistical subtraction of non-prompt photons, the quark-to-photon fragmentation function, D(z), is extracted directly from the measured 2-jet rate. By taking into account the perturbative contributions to D(z) obtained from an O(S ) QCD calculation, the unknown non-perturbative component of D(z) is …


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

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 Jan 1995

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 …


Software Reliability Issues: An Experimental Approach, Mary Ann Hoppa Jan 1995

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 …


Scheduling Of Parallel Jobs On Dynamic, Heterogenous Networks, Dan Clark, Jeremy Casas, Steve Otto, Robert Prouty, Jonathan Walpole Jan 1995

Scheduling Of Parallel Jobs On Dynamic, Heterogenous Networks, Dan Clark, Jeremy Casas, Steve Otto, Robert Prouty, Jonathan Walpole

Computer Science Faculty Publications and Presentations

In using a shared network of workstations for parallel processing, it is not only important to consider heterogeneity and differences in processing power between the workstations but also the dynamics of the system as a whole. In such a computing environment where the use of resources vary as other applications consume and release resources, intelligent scheduling of the parallel jobs onto the available resources is essential to maximize resource utilization. Despite this realization, however, there are few systems available that provide an infrastructure for the easy development and testing of these intelligent schedulers. In this paper, an infrastructure is presented …


A Proposal For A Development Platform For Microcontroller-Based Devices, Michael L. Wetton Jan 1995

A Proposal For A Development Platform For Microcontroller-Based Devices, Michael L. Wetton

Theses: Doctorates and Masters

This thesis is concerned with designing, implementing and testing a miniaturised temperature data logging device. Investigations demonstrated that a microcontroller could provide a low-cost single-chip solution to this problem and after a detailed review of 8-bit microcontrollers, the MC68HCll was chosen for this task. This document also includes discussion on an environment that was developed for creating and testing MC68HC11 software and the use of Motorola's evaluation boards. To ensure that the device was designed to software engineering standards an investigation into software engineering analysis techniques took place. This resulted in the Jackson Structured Programming (JSP) methodology being adapted to …


Optimizing Object Invocation Using Optimistic Incremental Specialization, Jon Inouye, Andrew P. Black, Charles Consel, Calton Pu, Jonathan Walpole Jan 1995

Optimizing Object Invocation Using Optimistic Incremental Specialization, Jon Inouye, Andrew P. Black, Charles Consel, Calton Pu, Jonathan Walpole

Computer Science Faculty Publications and Presentations

To make object invocation efficient, it is important to minimize overhead. In general, overhead is incurred in order to maintain transparency; with the advent of mobile computer systems, persistence, increasing security and privacy concerns, transparency becomes more expensive and overhead is increasing. Invocation mechanisms maintain transparency by finding objects, choosing communication media, performing data translation into common formats (e.g., XDR), marshalling arguments, encrypting confidential data, etc. Performing all of these operations on every invocation would lead to unacceptable performance, so designers often avoid operations by specializing object invocation for more restricted environments. For example, the Emerald compiler performs several optimizations …


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

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 Dec 1994

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 Dec 1994

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 Dec 1994

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.


Survey And Implementation Of Commercial Manual Controllers For A Generic Telerobotics Architecture, Thomas E. Deeter Dec 1994

Survey And Implementation Of Commercial Manual Controllers For A Generic Telerobotics Architecture, Thomas E. Deeter

Theses and Dissertations

The purpose of this study is to determine an input device for the Air Force's generic telerobotics architecture for large aircraft maintenance and repair. One area of concern is the human to machine interface, more specifically, which manual controller should be used for the specified tasks in this architecture. We mailed a survey to 68 companies in order to compile a list of possible input devices that the telerobotics architecture could use. 32 companies responded which gave me enough data to generate a list that described the physical traits of the input devices. We then divided the required tasks into …


Topologies Invariant Under A Group Action, Paul Bankston Dec 1994

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.


Toward Scalable Parallel Software: An Active Object Model And Library To Support Von Neumann Languages, George K. Thiruvathukal Dec 1994

Toward Scalable Parallel Software: An Active Object Model And Library To Support Von Neumann Languages, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

Scalable parallel processing has been proposed as the technology scientists and engineers can use today to solve the problems of tomorrow. Many computational Grand Challenge problems require between two and three orders of magnitude than can be provided with the scalable parallel hardware of the early nineteen-nineties. While hardware continues to become more scalable and cheaper, software is not advancing at the same pace and remains a very expensive part of systems development.

A great deal of emphasis on software technology to support scalable parallel processing is placed on von Neumann languages. One of two approaches is common: (a) augment …


Space Modeler: An Expanded, Distributed, Virtual Environment For Space Visualization, John C. Vanderburgh Dec 1994

Space Modeler: An Expanded, Distributed, Virtual Environment For Space Visualization, John C. Vanderburgh

Theses and Dissertations

The Space Modeler is the first truly immersive virtual environment that models the solar system, models satellites in near-Earth orbit, and can operate in a Distributed Interactive Simulation (DIS) environment. It increases the capabilities of the 1993 Satellite Modeler by expanding the physical limits of the environment and by implementing a new three-dimensional user interface. Satellite orbits are modeled using NASA two line element sets. The positions of the Sun, Moon and planets are computed using an algorithm based on planetary orbital element sets using a linear polynomial fit. For higher precision, the planetary orbits can be computed using an …


Embedology And Neural Estimation For Time Series Prediction, Robert E. Garza Dec 1994

Embedology And Neural Estimation For Time Series Prediction, Robert E. Garza

Theses and Dissertations

Time series prediction has widespread application, ranging from predicting the stock market to trying to predict future locations of scud missiles. Recent work by Sauer and Casdagli has developed into the embedology theorem, which sets forth the procedures for state space manipulation and reconstruction for time series prediction. This includes embedding the time series into a higher dimensional space in order to form an attractor, a structure defined by the embedded vectors. Embedology is combined with neural technologies in an effort to create a more accurate prediction algorithm. These algorithms consist of embedology, neural networks, Euclidean space nearest neighbors, and …


A General Object Model Transformation System, John P. Mullaney Dec 1994

A General Object Model Transformation System, John P. Mullaney

Theses and Dissertations

Cecil and Fullenkamp developed a program that transforms knowledge captured in an object-model in one environment into a different object-model in a different environment. This program worked well for the intended purpose, but if one of the object-models is replaced by a different object-model then this transformation program has to be re-engineered. As the object-modeling paradigm becomes more prevalent, many systems are experiencing this problem. The primary goal of this research was to determine what reusable knowledge could be extracted from these types of program and used to build a general object-model transformer that generalizes such transformation programs. Toward this …


Analytic Performance Models For Parallel Discrete Event Battlefield Simulation With Conservative Synchronization, James B. Hiller Dec 1994

Analytic Performance Models For Parallel Discrete Event Battlefield Simulation With Conservative Synchronization, James B. Hiller

Theses and Dissertations

This study investigated the development and use of analytic models for performance analysis of parallel discrete event battlefield simulation using conservative synchronization. A simulation architecture with layered application, simulation, and host machine services provided the model development basis. Simulation entities were modeled with set-theoretic definitions. Deterministic performance models using these definitions were developed for event prediction, scheduling, and execution in sequential battlefield simulation. The sequential model was expanded to include relative bounds for overhead factors introduced when the simulation is spatially decomposed for a parallel distributed memory machine. Comparison of sequential and parallel models instantiated for a simulation with uniform …


Modeiing Operational Task Assignment In Air Force Wing Command And Control, Robert J. Hunt Dec 1994

Modeiing Operational Task Assignment In Air Force Wing Command And Control, Robert J. Hunt

Theses and Dissertations

This research investigated the feasibility of applying software engineering technology to the Air Force wing command and control (C2) domain. As part of this research, domain analysis and object-oriented techniques were investigated and a specific approach was chosen to analyze the domain. Analysis of the domain resulted in an object-oriented domain model that captured the key objects, operations, and associations, and behavior of wing C2. The domain model was used to design and implement a prototype software tool that enables wing decision makers to assign resources to mission tasks and to make assessments about automation's impact on wing C2 operations.


Unification Of Larch And Z-Based Object Models To Support Algebraically-Based Design Refinement: The Z Perspective, Kathleen M. Wabiszewski Dec 1994

Unification Of Larch And Z-Based Object Models To Support Algebraically-Based Design Refinement: The Z Perspective, Kathleen M. Wabiszewski

Theses and Dissertations

This research established a foundation for formalizing the evolution of based object models to theories, part of a dual approach for formally extending object-oriented analysis models using the Z and LARCH languages. For the initial phase, a comprehensive, consistent, and correct Z language parser was implemented within the SOFTWARE REFINERY™ Programming Environment. The Z parser produced abstract syntax trees (ASTs) of objects, thereby forming the basis for analyzing the similarities and differences between the based and LARCH-based object representations. The second phase used the analysis of the two languages to identify fundamental core constructs that consisted of similar syntactic and …


Factors In Human-Computer Interface Design (A Pilot Study), Susan Stewart Dec 1994

Factors In Human-Computer Interface Design (A Pilot Study), Susan Stewart

Theses and Dissertations

The DoD has budgeted over $9.8 billion for 1995 for information technology, yet many government office workers let their existing systems sit idle. This thesis explores why these computers are sitting idle. This researcher's initial hypothesis was that certain features of the human-computer interface can positively or negatively affect efficiency, retention, and satisfaction level of workers. Although some research is being done in this area, interfaces continue to be of poor quality, especially in the DoD, where long procurement cycles, forced purchases, and limited budgets result in out-of-date software. Intuitively most programmers know the human-computer interface impacts on a person's …