Digital Commons Network^™

A Unified Model For Shared-Memory And Message-Passing Systems, Kenneth Goldman, Katherine Yelick

All Computer Science and Engineering Research

A unified model of distributed systems that accomodates both shared-memory and message-passing communication is proposed. An extension of the I/O automaton model of Lynch and Tuttle, the model provides a full range of types of atomic accesses to shared memory, from basic reads and writes to read-modify-write. In addition to supporting the specification and verification of shared memory algorithms, the unified model is particularly helpful for proving correspondences between atomic shared objects and invocation-response systems and for proving the correctness of systems that contain both message passing and shared memory (such as a network of shared-memory multiprocessors or a distributed …

Symphony: A Hardware, Operating System, And Protocol Processing Architecture For Distributed Multimedia Applications, Andreas D. Bovopoulos, R. Gopalakrishnan, Saied Hosseini

All Computer Science and Engineering Research

This paper explores the architectural requirements for computers to be able to process multimedia data streams such as video and audio. The I/O subsystem is shown to be a bottleneck, and a network backplane approach is suggested to alleviate this. The need to provide end-to-end performance guarantees requires predictable performance of intra-machine communication, and a schedulable bus with reservation is proposed to achieve this. In addition this requires operating system (OS) mechanisms to negotiate and enforce QoS requirements of applications. A real-time microkernel executive is proposed for each autonomous unit. Requirements for real-time microkernel exeutive is proposed for each autonomous …

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 …

The Extent Of Multimedia Computer Applications In The Business World, Mei Yee Lim

Honors Theses

The world, or at least I, was all agog when touch screens arrived. My initial contact with touch screens was at a science exhibition in Menara MPPJ, Petaling Jaya, Malaysia in July 1987. That particular exhibit, which encouraged visitors to participate and to experiment with, was a graphic program. Visitors could use their fingers to select the drawing tool or the color they want (which is something like the tools on a MacDraw screen on a Macintosh) and use their fingers to move around the screen to draw anything they want. That added to my fascination with the world of …

A Rule-Based System For Query Feedback, Hock C. Chan, Kwok-Kee Wei, Keng Siau

Research Collection School Of Computing and Information Systems

The authors propose a rule-based system which provides feedback in order to give the user a better understanding of the user's queries. This technique improves query accuracy and confidence. A rule-based expert system that pinpoints syntax errors is described. It suggests possible semantics errors and provides possible solutions, as well as the English translation for the queries. The system can be used for computer-aided training and in actual operations. The system was experimentally tested with a group of students.

Observation Of B0 Decay To Two Charmless Mesons, M. Battle, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

We report results from a search for the decays B0→π+π-, B0→K+π-, and B0→K+K-. We find 90% confidence level upper limits on the branching fractions, Bππ

Tau Decays With One Charged Particle Plus Multiple Π0'S, M. Procario, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

With the CLEO-II detector at the Cornell Electron Storage Ring, we have measured branching fractions for tau lepton decay into one-prong final states with multiple π0’s B0hnπ, normalized to the branching fraction for tau decay into one charged particle and a single π0. We find B0h2π/B0hπ=0.345±0.006±0.016, B0h3π/B0hπ=0.041 ±0.003±0.005, and B0h4π/B0hπ=0.006±0.002±0.002.

Measurement Of Charmless Semileptonic Decays Of B Mesons, Bartelt; J.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Observation Of The Charmed Baryon C+ And Measurement Of The Isospin Mass Splittings Of The C, Crawford, G.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Evidence For Penguin-Diagram Decays: First Observation Of B→K*(892)Γ, R. Ammar, M. Thulasidas

Research Collection School Of Computing and Information Systems

We have observed the decays B0→K*(892)0γ and B−→K*(892)−γ, which are evidence for the quark-level process b→sγ. The average branching fraction is (4.5±1.5±0.9)×10−5. This value is consistent with standard model predictions from electromagnetic penguin diagrams.

Search For Τ-→Γμ-: A Test Of Lepton Number Conservation, A. Bean, M. Thulasidas

Research Collection School Of Computing and Information Systems

A search for the lepton mumber violating decay of the τ lepton to the γμ final state has been performed with the CLEO II detector at the Cornell e+e− storage ring CESR. In a data sample that corresponds to an integrated luminosity of 1.55 fb−1, we observe no candidates in the signal region. We thus determine an upper limit of B(τ−→γμ−)

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.

Repository Evaluation Of Software Reuse: An Empirical Study, R. D. Banker, Robert J. Kauffman, D. Zweig

Research Collection School Of Computing and Information Systems

The use and benefits of repository evaluation of software reuse are illustrated through an analysis of the evolving repositories of two large firms that recently implemented integrated CASE development tools. The analysis shows that these tools have supported high levels of software reuse, but it also suggests that there remains considerable unexploited reuse potential. The findings indicate that organizational changes will be required before the full potential of the new technology can be realized.

Detection Of Skin Tumor Boundaries In Color Images, Fikret Erçal, M. Moganti, William V. Stoecker, Randy Hays Moss

Computer Science Faculty Research & Creative Works

A simple and yet effective method for finding the borders of tumors is presented as an initial step towards the diagnosis of skin tumors from their color images. The method makes use of an adaptive color metric from the red, green, and blue planes that contains information for discriminating the tumor from the background. Using this suitable coordinate transformation, the image is segmented. The tumor portion is then extracted from the segmented image and borders are drawn. Experimental results that verify the effectiveness of this approach are given

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 …

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, …

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. …

Performance Of Iterative Methods For Distributed Memory Processors, Dan C. Marintescu, John R. Rice, E. Vavallis

Department of Computer Science Technical Reports

No abstract provided.

Improved Global Routing Using ⋋-Geometry, Surendra Burman

Masters Theses

No abstract provided.

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 …

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 …

Creating And Manipulating A Domain-Specific Formal Object Base To Support A Domain-Oriented Application Composition System, Mary Anne Randour

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 is correctness before any programming language specific code is generated. This thesis investigated populating and manipulating the formal object base required by Architect. This object base is built using a domain- specific language (DSL) which serves as an interface between …

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 …

Entity-Relationship Versus Object-Oriented Modeling And The Underlying Dbms, Kevin J. Routhier

Theses and Dissertations

Despite the impressive accomplishments in relational database research, greater support is needed for persistence of the new types of data encountered with object-oriented programming. The concept of object-orientation is not new in the realm of programming; however, its utilization in database management systems is still immature. Regardless of this fact, there is an urgency for object-oriented database technology. With this increase in demand for the next generation databases comes the need to examine object-oriented data modeling versus the conventional entity-relationship modeling of relational database design. This thesis objective is to analyze both paradigms to determine if object-oriented modeling can significantly …

Management Of Simnet And Dis Entities In Synthetic Environments, Steven M. Sheasby

Theses and Dissertations

This thesis describes the techniques used to create an object manager utilized by an application program during a distributed interactive simulation. This work is currently utilized by a number of AFIT synthetic environment applications for use during a SIMNET exercise. An extensive review of distributed interactive simulations is presented. A discussion of the current distributed simulation protocol, SIMNET, is presented along with the future protocol standard, DIS. Finally, a brief discussion on dead reckoning and its importance during an exercise is presented. An analysis of the SIMNET and DIS protocols provided the basis for the creation of a series of …

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).

A Unified Model Of Program Behavior, Douglas T. Michel

Theses and Dissertations

This thesis is an attempt to account for and unify the three types of locality: temporal, spatial, and structural. A diverse sample of traces are used in measuring program behavior with respect to these localities and a model is presented which represents the memory references a program generates as it goes through execution. The model is validated by estimating, the entropy of a synthetically generated trace and comparing it with actual traces. The results indicate that there is more predictability contained in the original trace than what the model was able to capture. Different variations of the model were tried …

Version And Transaction Management In Osmagic: An Object-Oriented Database Implementation Of The Magic Vlsi Layout Design Tool, Gary M. Lightner

Theses and Dissertations

The goal of this thesis was to study the feasibility of using an object-oriented database management system to provide the functionality and performance needed to support a complex computer-aided design tool. We do this by modifying OSMagic, a prototype system of the Magic very large scale integrated (VLSI) circuit design tool implemented on the ObjectStore object- oriented database management system. OSMagic was changed to support three different interfaces to ObjectStore and to work in a networking environment. We then designed and examined the use of version and transaction management models as a means of addressing the weaknesses of the prototype …

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 …

Formalization And Transformation Of Informal Analysis Models Into Executive Refine™ Specifications, Mary M. Boom, Bradley D. Mallare

Theses and Dissertations

This research developed and implemented an automated technique for translating informal specifications into formal, executable specifications. A unified Abstract Model (UAM) was developed to combine the information contained in Entity Relationship, State Transition, and Data Flow Models into a concise, object-based representation. The UAM forms the basis for defining a formal language, the Object Modeling Language (OML), used to capture the information contained in the UAM. By using OML, we were able to develop an automated translation process to convert informal specifications into executable, formal specifications. The Software Refinery Development Environment enabled us to easily develop a parser that translates …