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 26491 - 26520 of 27690

Full-Text Articles in Entire DC Network

Formal Method For Scheduling, Routing And Communication Protocol, Lenore Mullin, S. A. Thibault, D. R. Dooling, E. A. Sandberg Jan 1993

Formal Method For Scheduling, Routing And Communication Protocol, Lenore Mullin, S. A. Thibault, D. R. Dooling, E. A. Sandberg

Computer Science Faculty Research & Creative Works

The PRAM model has been shown to be an optimal design for emulating both loose and tightly coupled multiprocessors for unit time operations. When virtual processors are required, multiplexing work to available processors is employed. This introduces a form of latency incurred by operating system overhead. Further complications arise when bandwidth creates bottlenecking of work units. G.E. Blelloch (1989) showed how to add parallel prefix operations (scans) to an extended PRAM model which uses unit step, not time operations. This paper shows how the psi) calculus can be used to group work units, i.e., pipelining the work units, so that …


Optimal Greedy Algorithms For Indifference Graphs, Peter J. Looges, Stephan Olariu Jan 1993

Optimal Greedy Algorithms For Indifference Graphs, Peter J. Looges, Stephan Olariu

Computer Science Faculty Publications

A fundamental problem in social sciences and management is understanding and predicting decisions made by individuals, various groups, or the society as a whole. In this context, one important concept is the notion of indifference. We characterize the class of indifference graphs, that is, graphs which arise in the process of quantifying indifference relations. In particular, we show that these graphs are characterized by the existence of a special ordering of their vertices. As it turns out, this ordering leads naturally to optimal greedy algorithms for a number of computational problems, including coloring, finding a shortest path between two vertices, …


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

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 …


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

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 …


Study Of D0 Decays Into K̄0 And K̄*0, M. Procario, M. Thulasidas Jan 1993

Study Of D0 Decays Into K̄0 And K̄*0, M. Procario, M. Thulasidas

Research Collection School Of Computing and Information Systems

Using the CLEO II detector at CESR we have studied D0 decays into final states with a ¯K0 or ¯K*0, and have measured branching ratios for the decay modes D0→(¯K0¯K*0)π0, η, η′. These results are compared with predictions of various charm decay models, and contributions of final-state interactions are discussed.


Weapon System Integration For The Afit Virtual Cockpit, William E. Gerhard Jr. Jan 1993

Weapon System Integration For The Afit Virtual Cockpit, William E. Gerhard Jr.

Theses and Dissertations

The Air Force Institute of Technology is continuing research in the Virtual Cockpit. The Virtual Cockpit makes use of high performance graphics workstations, Virtual Environment technology, and Distributed Interactive Simulation network protocols to create a flight simulator based on the capabilities of the McDonnell Douglas F-15E Strike Eagle. The work presented in this thesis focuses on the design and implementation issues for integrating a weapons delivery capability. Weapons simulated include: RADAR and IR guided air- to-air missiles, gravity and precision guided bombs, and a 20mm cannon. Virtual Environment displays used include: color NTSC and monochrome high resolution helmet mounted displays …


Practical Prefetching Techniques For Multiprocessor File Systems, David Kotz, Carla Schlatter Ellis Jan 1993

Practical Prefetching Techniques For Multiprocessor File Systems, David Kotz, Carla Schlatter Ellis

Dartmouth Scholarship

Improvements in the processing speed of multiprocessors are outpacing improvements in the speed of disk hardware. Parallel disk I/O subsystems have been proposed as one way to close the gap between processor and disk speeds. In a previous paper we showed that prefetching and caching have the potential to deliver the performance benefits of parallel file systems to parallel applications. In this paper we describe experiments with practical prefetching policies that base decisions only on on-line reference history, and that can be implemented efficiently. We also test the ability of these policies across a range of architectural parameters.


Revisiting The Edge Of Chaos: Evolving Cellular Automata To Perform Computations, Melanie Mitchell, Peter T. Hraber, James P. Crutchfield Jan 1993

Revisiting The Edge Of Chaos: Evolving Cellular Automata To Perform Computations, Melanie Mitchell, Peter T. Hraber, James P. Crutchfield

Computer Science Faculty Publications and Presentations

No abstract provided.


An Investigation Of Methodologies For Software Development Prototyping, Susan M. Jones Jan 1993

An Investigation Of Methodologies For Software Development Prototyping, Susan M. Jones

Theses: Doctorates and Masters

The computer industry has a poor record of system development using the traditional life-cycle approach. The main cause of user dissatisfaction is the unacceptably large amount of time between specification and delivery of a system. In addition, users have limited opportunity to influence how the system will look when implemented once development has commenced. With the advent of 4GLs, system development using a prototyping approach has become a viable option. This has reduced the development tlme significantly and, together with the use of prototyping, has allowed users to become more involved in the development process. However, this change in the …


An Application-Oriented Approach To Distributed Error-Detecting Branch & Bound, Aggie Y. Sun, Hanan Lutfiyya, Bruce Mcmillin Dec 1992

An Application-Oriented Approach To Distributed Error-Detecting Branch & Bound, Aggie Y. Sun, Hanan Lutfiyya, Bruce Mcmillin

Computer Science Technical Reports

An important aspect which is often overlooked in software _design of distributed environments is that of fault tolerance. Many methodologies in the past have attempted to provide fault tolerance efficiently, but have never been successful at eliminating explicit time and space redundancy. One approach is the Application-Oriented Fault Tolerance Paradigm, which provides fault tolerance by examining the behavior and properties of the application and deriving executable assertions for the detection of faults. Previous work has demonstrated the feasibility of the application-oriented fault tolerance paradigm for various applications. However, the executable assertions were guided by the natural constraints of the problem. …


Improved Global Routing Using ⋋-Geometry, Surendra Burman Dec 1992

Improved Global Routing Using ⋋-Geometry, Surendra Burman

Masters Theses

No abstract provided.


A Synthetic Environment For Satellite Modeling And Satellite Orbital Motion, David L. Pond Dec 1992

A Synthetic Environment For Satellite Modeling And Satellite Orbital Motion, David L. Pond

Theses and Dissertations

Analysts tasked to study satellites moving in space must often rely on photographs to conduct their analysis. Often these photographs do not adequately represent how satellites move in space, their spatial relationships, or their interaction with other satellites. What analysts need is a three- dimensional synthetic environment that depicts satellites as they actually move and interact in space. This thesis addresses the early development of the Satellite Modeler (SM), a system that allows analysts to study, satellite motion and maneuvering of computer aided design (CAD) models of those satellites in a three-dimensional orbit. The system contains equipment that allows analysts …


Eztex: A Graphical User Interface System For Latex, Ravi K. Kosaraju Dec 1992

Eztex: A Graphical User Interface System For Latex, Ravi K. Kosaraju

Masters Theses

No abstract provided.


Efficient Derivation And Approximations Of Cepstral Coefficients For Speech Coding, Kimberly A. Limcangco Dec 1992

Efficient Derivation And Approximations Of Cepstral Coefficients For Speech Coding, Kimberly A. Limcangco

Theses and Dissertations

A new formulation is presented for the calculation of cepstral coefficients directly from measured sine wave amplitudes and frequencies of speech waveforms. Approximations to these cepstral coefficients are shown to be suitable for operation in a real-time speech coding environment. These results were encoded in the C programming language and then evaluated through experiments that were conducted on the McAulay-Quatieri Sinusoidal Transform Coder (STC).


Etann Hardware Implementation For Radar Emitter Identification, James B. Calvin Jr. Dec 1992

Etann Hardware Implementation For Radar Emitter Identification, James B. Calvin Jr.

Theses and Dissertations

This study investigated classification of 30 radar emitters with 16 signal features using Intel's 80170NX chip, the Electronically Trainable Analog Neural Network (ETANN). Software tools were developed to characterize the ETANN sigmoidal transfer function for use in a custom simulator, known as Neural Graphics. Neural Graphics operates on a Silicon Graphics workstation. The Intel Neural Network Training System simulators were used in early experiments, but were found to be inefficient in training on data used in this research. Using a modified Neural Graphics simulator, single chip and multi-chip experiments were performed to provide benchmark results prior to performing chip-in-loop training. …


A Generic Template Extractor (Gentex) In C For Vlsi Design Verification, Kenneth J. Mcclellan Jr. Dec 1992

A Generic Template Extractor (Gentex) In C For Vlsi Design Verification, Kenneth J. Mcclellan Jr.

Theses and Dissertations

The problem of VLSI design verification through circuit extraction was analyzed. The problems of creating a simple template format, the permutability of pins, maintaining connectivity, and performance were focused on. A generic template extractor (GENTEX) was developed in the C programming language for use as a testbed to find solutions to these problems. Six different extraction algorithms were tested with GENTEX and compared based on performance. EDIF translation programs were used to interface with GENTEX on both the input and output sides. One translation program converted an EDIF representation of a schematic into the template format used by GENTEX. The …


A Theory Of Global Concurrency Control In Multidatabase Systems, Aidong Zhang, Ahmed K. Elmagarmid Dec 1992

A Theory Of Global Concurrency Control In Multidatabase Systems, Aidong Zhang, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.


An Integrated Simulation Model Development Environment For Slam Ii Using Object-Oriented Paradigm, Rizvan Erol Dec 1992

An Integrated Simulation Model Development Environment For Slam Ii Using Object-Oriented Paradigm, Rizvan Erol

Masters Theses

An integrated simulation model development environment was implemented to assist the modeler by automating certain activities of simulation modeling. The system included interactive model definition, experimental design, automatic simulation program generation in SLAM II. Object-oriented paradigm at software development stage was extensively used to conceptualize the structure, and rules of the SLAM II language in order to generate efficient, and modular program code. The present system targeted modeling of various probabilistic inventory control system problems. The remarkable advantages of the system were rapid model development time, and achieving reliable program code without requiring any knowledge in SLAM II. Object-oriented programming …


Solution To A Multicriteria Aircraft Routing Problem Utilizing Parallel Search Techniques, James J. Grimm Iii Dec 1992

Solution To A Multicriteria Aircraft Routing Problem Utilizing Parallel Search Techniques, James J. Grimm Iii

Theses and Dissertations

Pilots select routes based on factors such as threats, fuel, time on target, distance, and refueling points. This is a time consuming task. This thesis presents the software engineering synthesis of a software tool, based on a parallelized A* search algorithm, to select routes. For simplicity only threats and distance are used. A centralized open list is used with one processor managing the list while the other processors perform the node expansions. This decomposition result in a dynamically load balanced system. A number of parameters are changed to study their impact on the execution time. The use of a branch …


Ada Implementation Of An Object Data Repository, Stephen P. Perucca Dec 1992

Ada Implementation Of An Object Data Repository, Stephen P. Perucca

Theses and Dissertations

The many benefits of object-oriented software development such as encapsulation and extendibility have inspired numerous models of the object- oriented paradigm. Rumbaugh's Object Modeling Technique (OMT) is an object- oriented model that uses three submodels. The object, dynamic, and functional submodels of the OMT describe the data, behavioral, and processing aspects of a system by using entity-relationship, state-transition, and data flow models. Cross-links relate how the three submodels tie together. Two metamodels (models of models) of the OMT are developed using the OMT methodology and notation. The essential data elements of the OMT are abstracted into a data metamodel, and …


Power Analysis In Flexible Automation, Nathan A. Titus Dec 1992

Power Analysis In Flexible Automation, Nathan A. Titus

Theses and Dissertations

The performance of an automation or robotic device can be measured in terms of its power efficiency. Screw theory is used to mathematically define the task instantaneously with two screws. The task wrench defines the effect of the device on its environment, and the task twist describes the motion of the device. The tasks can be separated into three task types: kinetic, manipulative, and reactive. Efficiency metrics are developed for each task type. The output power is strictly a function of the task screws, while device input power is shown to be a function of the task, the device Jacobian, …


Object-Oriented Analysis, Design, And Implementation Of The Saber Wargame, David S. Douglass Dec 1992

Object-Oriented Analysis, Design, And Implementation Of The Saber Wargame, David S. Douglass

Theses and Dissertations

Saber is a two-sided, air and land war game that simulates decisions made of commanders at the theater-level. It is being developed by the Air Force Institute of Technology for the Air Force Wargaming center at Maxwell AFB, Alabama. Saber models conventional, chemical, and nuclear warfare between aggregated air and land forces. It also portrays the effects of logistics, satellites, weather, terrain, and intelligence which add to the realism of the Saber war game. The Saber war game has three main components, the preprocessor. which is responsible for scenario development and pregame activities, the simulation. the guts of the war …


A Vhdl Interpreter For Model-Based Diagnoses, David R. Griffin Dec 1992

A Vhdl Interpreter For Model-Based Diagnoses, David R. Griffin

Theses and Dissertations

Model-based reasoning permits diagnostic applications to be written without waiting for someone to become an 'expert' of the system. For model-based diagnostics, there must be a model to reason from. This thesis explores using a VHDL description of the system as that model. A system based around a VHDL interpreter was written specifically for a model-based diagnostic algorithm. Currently, the diagnostic system uses an algorithm by Dries. This algorithm was derived from Scarl's Full Consistency Algorithm. The system was designed to be modular so that different diagnostic techniques could be implemented. It is divided into three parts: a VHDL parser, …


A User Interface To A True 3-D Display Device, Bruce A. Hobbs Dec 1992

A User Interface To A True 3-D Display Device, Bruce A. Hobbs

Theses and Dissertations

This thesis describes an interactive interface to a true three dimensional, real-dm dynamic graphic display, the TI Omniview™. The system generates true 3-D images of volumetric data and objects. The TI Omniview is a cylindrical volumetric laser display that uses a rotating double-helix translucent disk to fill the display cylinder. Voxels are illuminated on the 2-D surface. The rotational speed of the disk allows the viewer to fuse the 2-D images into a true 3-D image. The interface provides the user with a quick and flexible means of manipulating the image generated, the sub-volume displayed, and the resulting 3-D image. …


An Investigation Of Discovery-Based Learning In The Route Planning Domain, Freeman A. Kilpatrick Jr. Dec 1992

An Investigation Of Discovery-Based Learning In The Route Planning Domain, Freeman A. Kilpatrick Jr.

Theses and Dissertations

This thesis presents MAVERICK, a Discovery-Based learning (DBL) system designed to learn maneuvers in the route planning domain. DBL was originally designed to learn in domains for which little domain knowledge exists. This thesis proposes using it in domains for which knowledge exists, but the acquisition of this knowledge is difficult or time-consuming because of the knowledge acquisition bottleneck. The operation of the DBL process in MAVERICK was investigated to determine the potential utility of such a system to a real- world Air Force problem in the domain of aircraft route planning. MAVERICK worked well in its limited domain, and …


Generalization And Parallelization Of Messy Genetic Algorithms And Communication In Parallel Genetic Algorithms, Laurence D. Merkle Dec 1992

Generalization And Parallelization Of Messy Genetic Algorithms And Communication In Parallel Genetic Algorithms, Laurence D. Merkle

Theses and Dissertations

Genetic algorithms (GA) are highly parallelizable, robust semi- optimization algorithms of polynomial complexity. The most commonly implemented GAs are 'simple' GAs (SGAs). Reproduction, crossover, and mutation operate on solution populations. Deceptive and GA-hard problems are provably difficult for simple GAs. Messy GAs (MGA) are designed to overcome these limitations. The MGA is generalized to solve permutation type optimization problems. Its performance is compared to another MGA's, an SGA's, and a permutation SGA's. Against a fully deceptive problem the generalized MGA (GMGA) consistently performs better than the simple GA. Against an NP-complete permutation problem, the GMGA performs better than the other …


Examining A Layered Approach To Function And Design Representation For Reusable Software Components, Paul D. Siebels Dec 1992

Examining A Layered Approach To Function And Design Representation For Reusable Software Components, Paul D. Siebels

Theses and Dissertations

This effort examined ways to improve the effectiveness of reusable software libraries. The main area of investigation was in improving the user interface by finding better ways to present the software components to potential re-users. The first aspect which was considered was finding an effective representation for reusable software components. A set of criteria was developed for evaluating the effectiveness of software representations. The criteria consisted of generality, expressiveness, understandability, consistency, and resolution. The second aspect which was considered was how to present the software component information to the user to facilitate finding the appropriate component for reuse. A representation …


An Intelligent Real-Time System Architecture Implemented In Ada, Michael A. Whelan Dec 1992

An Intelligent Real-Time System Architecture Implemented In Ada, Michael A. Whelan

Theses and Dissertations

Conventional real-time systems are fully deterministic allowing for off-line, optimal, task scheduling under all circumstances. Real-time intelligent systems add non-deterministic task execution times and non- deterministic task sets for scheduling purposes. Non-deterministic task sets force intelligent real-time systems to trade-off execution time with solution quality during run-time and perform dynamic task scheduling. Four basic design considerations addressing those tradeoffs have been identified: control reasoning, focus of attention, parallelism, and algorithm efficacy. Non-real- time intelligent systems contain an environment sensor, a model of the environment, a reasoning process, and a large collection of procedural processes. Real-time intelligent systems add to these …


Creating And Manipulating Formalized Software Architectures To Support A Domain-Oriented Application Composition System, Cynthia G. Anderson Dec 1992

Creating And Manipulating Formalized Software Architectures To Support A Domain-Oriented Application Composition System, Cynthia G. Anderson

Theses and Dissertations

This research investigated technology which enables sophisticated users to specify, generate, and maintain application software in domain-oriented terms. To realize this new technology, a development environment, called Architect, was designed and implemented. Using canonical formal specifications of domain objects, Architect rapidly composes these specifications into a software application and executes a prototype of that application as a means to demonstrate its correctness before any programming language specific code is generated. Architect depends upon the existence of a formal object base (or domain model) which was investigated by another student in related research. The research described in this thesis relied on …


A Model For Determining Task Set Schedulability In The Presence Of System Effects, Rusty O. Baldwin Dec 1992

A Model For Determining Task Set Schedulability In The Presence Of System Effects, Rusty O. Baldwin

Theses and Dissertations

This research developed a parameterized model that accounts for system overhead and determines when an Ada runtime environment can no longer successfully execute a given Ada task set and still meet all deadlines. The Ada Compiler Evaluation Capability benchmark was used to characterize an actual runtime environment. Using that data, a generic model of a preemptive, rate monotonic priority based runtime system was developed which accounts for overhead due to clock updates, context switching, task suspension, and synchronization. Validation was based on the Hartstone benchmark. First, the benchmark was executed using, the actual runtime environment. Then, those results were compared …