Digital Commons Network^™

Entity Identification In Database Integration, Ee Peng Lim, Jaideep Srivastava, Satya Prabhakar, James Richardson

Research Collection School Of Computing and Information Systems

The objective of entity identification is to determine the correspondence between object instances from more than one database. Entity identification at the instance level, assuming that schema level heterogeneity has been resolved a priori, is examined. Soundness and completeness are defined as the desired properties of any entity identification technique. To achieve soundness, a set of identity and distinctness rules are established for entities in the integrated world. The use of extended key, which is the union of keys, and possibly other attributes, from the relations to be matched, and its corresponding identify rule are proposed to determine the equivalence …

Optimal Parallel Hypercube Algorithms For Polygon Problems, Mikhail J. Atallah, Danny Z. Chen

Department of Computer Science Technical Reports

No abstract provided.

Parallel Electronic Prototyping Of Physical Objects, Poting Wu, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Comparison Of Imsl/Idl With The Imsl Math Library And Exponet Graphics, Xingkang Fu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Building A Large Scale Distributed Object System For A Multilingual Programming Environment, Patrick A. Muckelbauer, Vincent F. Russo

Department of Computer Science Technical Reports

No abstract provided.

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 …

Integrating Theory And Practice In Parallel File Systems, Thomas H. Cormen, David Kotz

Computer Science Technical Reports

Several algorithms for parallel disk systems have appeared in the literature recently, and they are asymptotically optimal in terms of the number of disk accesses. Scalable systems with parallel disks must be able to run these algorithms. We present a list of capabilities that must be provided by the system to support these optimal algorithms: control over declustering, querying about the configuration, independent I/O, turning off file caching and prefetching, and bypassing parity. We summarize recent theoretical and empirical work that justifies the need for these capabilities.

Comprehension Of Literate Programs By Novice And Intermediate Programmers, Christopher Forrest Bertholf

Dissertations and Theses

The studies reported herein compare comprehension of Lit style literate programs to that of traditional modular programs documented by embedded comments. Novice and intermediate programmers participated in three experiments designed to determine the comprehensibility of literate programs written using a language-independent system for abstraction-oriented literate programming compared with programs written using traditional modular programming techniques (traditional modular programs). Programs were written in either the C or FORTRAN programming language. Half of the subjects in each group received a literate program, while the other half received a traditional modular program with embedded documentation. Subjects received a problem specification, input and output …

Back-Face Culling Applied To Collision Detection Of Polyhedra, George Vanĕček

Department of Computer Science Technical Reports

No abstract provided.

Supporting Distributed Transaction Dependencies And Security Constraints: A Knowledge Base Approach, Noureddine Boudriga, Omran Bukhres

Department of Computer Science Technical Reports

No abstract provided.

Multidatabase Atomic Commitment Protocols: A Taxonomy And Unified Approach, Ahmed K. Elmagarmid, James G. Mullen

Department of Computer Science Technical Reports

No abstract provided.

Dynamic Id3: A Symbolic Learning Algorithm For Many-Valued Attribute Domains, Roger Gallion, Chaman Sabharwal, Daniel C. St. Clair, William E. Bond

Computer Science Faculty Research & Creative Works

Quinlan's ID3 machine learning algorithm induces classification trees (rules) from a set of training examples. The algorithm is extremely effective when training examples are composed of attributes whose values are taken from small discrete domains. The classification accuracy of ID3-produced trees on domains whose attributes are many-valued tends to be marginal due to the large number of possible values which may be associated with each attribute. Attempts to solve this problem by a priori grouping of attribute values into distinct subsets has met with limited success. The dynamic ID3 algorithm improves the performance of ID3 on this type of problem …

An Immersive Synthetic Environment For Observation And Interaction With A Large Volume Of Interest, Rex G. Haddix Iii

Theses and Dissertations

This thesis addresses the initial development of a Synthetic Battlebridge System designed to provide the user with a synthetic three- dimensional view of moving and stationary vehicles dispersed over a hundred thousand cubic mile volume. The system contains provisions to allow a user to view the battlefield either in the Polhemus LookingGlass™ fiber optic based high resolution head mounted display, a standard CRT, or through the Fake Space Labs BOOM2M™ high resolution monochrome display. Users can also video tape a session in the Synthetic Battlebridge System. A voice recognition system provides user interaction to the Synthetic Battlebridge System. Using a …

Toward Reusable Graphics Components In Ada, Sam-Kyu Lim

Theses and Dissertations

This thesis demonstrates and illustrates a way of developing reusable graphics software components in Ada associated with a C++/C library. The work was carried out using object-oriented software development techniques that were used to analyze, design and implement a partial flight simulator. The objective of this thesis was to present a way of building reusable software components with Ada in a graphics application environment. An object-oriented approach was taken in the development of a set of reusable graphics software components for a flight simulator domain. A selection of a set of reusable software components came from domain analysis. These components …

Rendering The Out-The-Window View For The Afit Virtual Cockpit, W. Dean Mccarty

Theses and Dissertations

The Air Force Institute of Technology (AFIT) is developing a distributed interactive flight simulator, the Virtual Cockpit, using commercial graphics workstations and helmet mounted displays. The Virtual Cockpit communicates with other simulators via local and long-haul networks using the SIMNET protocol. The work reported in this thesis focuses on developing the terrain database for the synthetic environment and on rendering the pilot's view of the database. There are many different file formats for describing 3- dimensional geometric polygonal objects. An analysis of three formats, AFIT GEOM, the Naval Postgraduate School (NPS) DRP, and Software Systems' Flight, is presented. Each file …

Development Of A Visual System Interface To Support A Domain-Oriented Application Composition System, Timothy L. Weide

Theses and Dissertations

This research designed and prototyped a visual system interface to generate, display, and modify domain-oriented application specifications. A visual system interface, called the Architect Visual System Interface (AVSI), supplements a text-based environment, called Architect, previously developed by two other students. 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. This thesis investigates visual techniques for populating, manipulating, viewing, and composing these software application specifications within the formal object base scheme required …

Matching Points To Lines: Sonar-Based Localization For The Psubot, Kevin Blythe Stanton

Dissertations and Theses

The PSUBOT (pronounced pea-es-you-bought) is an autonomous wheelchair robot for persons with certain disabilities. Its use of voice recognition and autonomous navigation enable it to carry out high level commands with little or no user assistance. We first describe the goals, constraints, and capabilities of the overall system including path planning and obstacle avoidance. We then focus on localization-the ability of the robot to locate itself in space. Odometry, a compass, and an algorithm which matches points to lines are each employed to accomplish this task. The matching algorithm (which matches "points" to "lines") is the main contribution to this …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 2, February 1993, 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.

Decentralized Global Transaction Management In Multidatabase Systems, Aidong Zhang, Jiansan Chen, Ahmed K. Elmagarmid, Omran Bukhres

Department of Computer Science Technical Reports

No abstract provided.

Symbolic Methods In Computer Graphics And Geometric Modeling (Ph.D. Thesis), Andrew Vasanth Royappa

Department of Computer Science Technical Reports

No abstract provided.

An Interactive X-Window Based User Interface For The Xox Solid Modeling Library, Poting Wu, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

New Algorithms For Minimizing The Longest Wire Length During Circuit Compaction, Susanne E. Hambrusch, Hung-Yi Tu

Department of Computer Science Technical Reports

No abstract provided.

A Petri Net Toolkit For Parallel Program Debugging, Potla Kishore Reddy

Theses

An effective debugger must support the language and operating system resource abstractions that are available to the programmer. Earlier debuggers worked at the machine architecture level: they dealt with machine instructions and registers. Current debuggers, designed for single process debugging, permit access to program variables and breakpoints and single-stepping at the level of high-level language statements. Eventhough the current debuggers, are already implemented to be a powerful tool, they still cannot do a job of parallel debugger.

In this thesis, a computer simulation system has been established by Petri Nets execution providing a convenient and friendly interface as it allows …

Systems Integration In Pharmaceutical Industry Using Object-Oriented Expert System Technology, Korrapolu Reddy

Theses

SPHINX is an object-oriented expert system addressed to solve the burning problems of pharmaceutical industry. SPHINX stands for Systems integration in PHarmaceutical INdustry using object-oriented eXpert system technology.

Various problems that American pharmaceutical industries are facing have been explained. Using the revolutionary object-oriented concepts and the powerful expert systems technology, it has been shown how a prescription can be written to solve all the problems of pharmaceutical industries. A problem "Minimizing the wastage of Interferon" has been taken to demonstrate the power of Object-oriented Expert System technology.

A Sign-To-Speech Translation System, Koka Veera Raghava Rao

School of Computing: Dissertations, Theses, and Student Research

This thesis describes sign-to-speech translation using neural networks. Sign language translation is an interesting but difficult problem for which neural network techniques seem promising because of their ability to adjust to the user's hand movements, which is not possible to do by most other techniques. However, even using neural networks and artificial sign languages, the translation is hard, and the best-known system, that of Fels & Hinton (1993), is capable of translating only 66 root words and 203 words including their conjugations. This research improves their results to 790 root signs and 2718 words including their conjugations while preserving a …

Intermediate Code Generation For Portable Scalable, Compilers. Architecture Independent Data Parallelism: The Preliminaries, Lenore Mullin, C. Chang, S. Huang, Matthias Mayer, N. Nemer, C. Ramakrishna

Computer Science Technical Reports

This paper introduces the goals of the Portable, Scalable, Architecture Independent (PSI) Compiler Project for Data Parallel Languages at the University of Missouri-Rolla. A goal of this project is to produce a subcompiler for data parallel scientific programming languages such as HPF(High Performance Fortran) where the input grammar is translated to a three-address code intermediate language. Ultimately we plan to integrate our work into automated synthesis systems for scientific programming because we feel that it should not be necessary to learn complicated programming techniques to use multiprocessor computers or networks of computers effectively. This paper shows how to compile a …

The Computation Of Supersonic Combustor Flows Using Multi-Computers, Bruce M. Mcmillin, Eric Jui-Lin Lu, Larry Reeves

Computer Science Technical Reports

An explicit computational fluid dynamics (CFD) computer code with parallel processing capability has been developed for the purpose of simulating internal high-speed reacting flows. The code solves the three-dimensional Navier-Stokes equations for compressible flows. The CFD code can be executed on either sequential (single processor) computers or multi-computers (multiple processor machines with distributed memory and message passing between processors). The parallel implementation involves homogeneous domain decomposition between processors with message passing needed only between neighbor processors. The code is validated for a compression ramp, an expansion ramp, a viscous flat plate, and a viscous flat plate with wall injection. These …

Static And Runtime Scheduling Of Unstructured Communication, Sanjay Ranka, Jyu-Chun Wang

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

With the advent of new routing methods, the distance to which a message is sent is becoming relatively less and less important. Thus assuming no link contention, permutation seems to be an efficient collective communication primitive. All-to-many communication is required for solving a large class of irregular and loosely synchronous problems on distributed memory MIMD machines. In this paper we present several algorithms for decomposing all-to-many personalized communication into a set of disjoint partial permutations. These partial permutations avoid node contention and/or link contention. We discuss several algorithms and study their effectiveness both from the view of static scheduling as …

Architectural Support For High-Performance Distributed Computing, Jongbaek Park, Salim Hariri

Electrical Engineering and Computer Science - All Scholarship

The emergence of high speed networks and the proliferation of high performance workstations have attracted a lot of interest in workstation-based distributed computing. Current trend in local area networks is toward higher communication bandwidth as we progress from Ethernet networks that operate at 10 Mbit/sec to higher speed networks that can operate in Gbit/sec range. Also, current workstations are capable of delivering tens and hundreds of Megaflops of computing power. By using a cluster of such high-performance workstations and the high-speed networks, a high-performance distributed computing environment could be built in cost-effective manner as an alternative of supercomputing platform. However, …

Runtime Compilation Techniques For Data Partitioning And Communication Schedule Reuse, Ravi Ponnusamy, Joel Saltz, Alok Choudhary

Northeast Parallel Architecture Center

In this paper, we describe two new ideas by which HPF compiler can deal with irregular computations effectively. The first mechanism invokes a user specified mapping procedure via a set of compiler directives. The directives allow the user to use program arrays to describe graph connectivity, spatial location of army elements and computational load. The second is a simple conservative method that in many cases enables a compiler to recognize that it is possible to reuse previously computed results from inspectors (e.g. communication schedules, loop iteration partitions, information that associates off-processor data copies with on-processor buffer locations). We present performance …