Digital Commons Network^™

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 …

Finding Fixed Point Combinators Using Prolog, Richard Rankin, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

A Powerful New Strategy, Called the Kernel Method, Has Been Developed by Larry Wos and William McCune at Argonne National Laboratories, to Study Various Fixed-Point Properties within Certain Classes of Applicative Systems. We Present a Very Simple Prolog Reasoning System, Named JIST, Which Incorporates Both Stages of the Kernel Method into a Single Unified Program. Furthermore, the Prolog Tool Has Been Extended to Run within a Distributed Environment using the Linda Protocol.

An Intelligent Approach To Discrete Sampling Of Parametric Curves, Chaman Sabharwal

Computer Science Faculty Research & Creative Works

In graphics and animation applications, two of the problems are: (1) representation of an analytic curve by a discrete set of sampled points and (2) determining the similarity between two parametric curves. It is necessary to measure the accuracy of approximation and to have a metric to calculate the disparity between two parametric curves. Both of these problems have been associated with the reparameterization of the curves with respect to arc length. One of the methods uses Gaussian Quadrature to determine the arc length parameterization [Guenter and Parent 1990], while another interesting technique is a simple approximation method [Fritsch and …

A Hybrid Genetic Algorithm For An Np-Complete Problem With An Expensive Evaluation Function, Richard Rankin, Ralph W. Wilkerson, Geoff Harris, Jo Spring

Computer Science Faculty Research & Creative Works

In This Paper, a Non-Standard Hybrid Genetic Algorithm is Presented. the Approach is Non-Standard in that It Violates Some of the Common Attributes Associated with Genetic Algorithms in the Literature. the Algorithm Presented Uses Local Maxima to Locate the Global Maximum Value, Uses Haploid Chromosomes with Dominance Mating Instead of Crossover, Generates One Offspring Per Set of Parents, Has No Specific Mutation Operator, and is Designed for Rapid Convergence. When Applied to an NP-Complete Problem, the Results of This Hybrid Algorithm Are Shown to Be Very Successful in Reducing the Complexity of the Problem.

Recovering 3d Image Parameters From Corresponding Two 2d Images, Chaman Sabharwal

Computer Science Faculty Research & Creative Works

An improved algorithm for computing the three-dimensional structure of a scene from pair of stereo images is given. The spatial relationship between the two images is not known, only the "corresponding" points in the two images are known. This problem of 3D scene reconstruction involves: (1) establishing a one-to-one correspondence between the image plane stereo pairs corresponding to the spatial points-'the correspondence problem', and (2) determining the relative orientation of the two image planes and the depth relation of spatial points with respect to the image planes. This paper assumes the first problem solved [Usikov et al. 1991] and addresses …

Object-Oriented Database Access From Ada, Li Chou

Theses and Dissertations

Ada embodies many modern software engineering principles, namely, modifiability, efficiency, reliability, and understandability. Its powerful data abstraction allows programmers to easily model objects in the real world. A database management system (DBMS) provides long term storage. It provides a convenient and efficient environment to manipulate data. Currently, with Ada access to a DBMS is typically done through the use of a language extension and a preprocessor to convert the extensions to library calls appropriate for the DBMS. However, these systems are limited on more complex applications, such as computer-aided engineering design. Object-oriented design (OOD) is a new way of thinking …

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 …

A Distributed Object-Oriented Database Application Design, Hsin-Feng Edward Wu

Theses and Dissertations

The purpose of this study is to analyze and develop a distributed object-oriented database management system (DOODBMS) application to support parallel software development of the Parallel Algorithms and Applications Group (PAAG) at AFIT. By following the software lifecycle of object-oriented paradigm, this thesis investigation is intended to generate requirements analysis, design, implementation, user interface design and implementation, and integration of the database application with the user interface. ITASCA, an existing DOODBMS platform, has been chosen to prototype the application for its distribution functionalities and object-oriented modeling power. The user interface of the database application is based on X-window OSF/Motif front-end …

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 …

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 …

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 …

Simulated Annealing And Optimal Codes, Gary R. Greenfield

Department of Math & Statistics Technical Report Series

Following standard notation, an (n, m, d) code C denotes a binary code C which has length n, size m, and Hamming distance d. According to Hill [6] the “main coding theory problem” is to optimize one of these three parameters when the other two are held fixed. The usual version of this optimization problem is to find the largest code for a given length and given minimum distance. This is the problem we shall consider, thus making it clear what we mean by an “optimal code.”

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.

Smooth Splines Over Irregular Meshes Built From Few Polynomial Pieces Of Low Degree, Jörg Peters

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.

Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih

Computer Science: Faculty Publications and Other Works

We give algorithms to minimize density for channels with terminals that are movable subject to certain constraints. The main cases considered are channels with linear order constraints, channels with linear order constraints and separation constraints, channels with movable modules containing fixed terminals, and channels with movable modules and terminals. In each case, previous results for running time and space are improved by a factor of L/lg n and L , respectively, where L is the channel length and n is the number of terminals.

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 …

The Ksr1: Experimentation And Modeling Of Poststore, Amy Apon, E Rosti, E Smirni, T D. Wagner, M Madhukar, L W. Dowdy

Publications

Kendall Square Research introduced the KSRl system in 1991. The architecture is based on a ring of rings of 64bit microprocessors. It is a distributed, shared memory system and is scalable. The memory structure is unique and is the key to understanding the system. Different levels of caching eliminates physical memory addressing and leads to the ALLCACHE TM scheme. Since requested data may be found in any of several caches, the initial access time is variable. Once pulled into the local (sub)cache, subsequent access times are fixed and minimal. Thus, the KSRl is a Cache-Only Memory Architecture (COMA) system. 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.

A Generalization Of The Trie Data Structure, Richard H. Connelly, F. Lockwood Morris

Electrical Engineering and Computer Science - Technical Reports

Tries, a form of string-indexed look-up structure, are generalized to permit indexing by terms built according to an arbitrary signature. The construction is parametric with respect to the type of data to be stored as values; this is essential, because the recursion which defines tries appeals from one value type to others. "Trie" (for any fixed signature) is then a functor, and the corresponding look-up function is a natural isomorphism. The trie functor is in principle definable by the "initial fixed point" semantics of Smyth and Plotkin. We simplify the construction, however, by introducing the "category-cpo", a class of category …

Graphical Evolution Experiments In Artificial Life, Gary R. Greenfield

Department of Math & Statistics Technical Report Series

Larry Yaeger's alife simulation running on a Silicon Graphics Iris Workstation is called Poly World. Our description of PolyWorld is based on notes taken during an oral presentation and video demonstration given in the Artificial Life Panel Session of SIGGRAPH '92: In PolyWorld the visual organisms roam on a bounded two dimensional grid. The organisms "brains" are small neural nets enabling the organisms to control their external visual appearance and to perceive the external world by processing pixmaps. The simulation controls for total energy while striving to explore competition and self-organization. Genes present are for size, strength, maximum speed, mutation …

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.

Rowdlas User's Guide, H. Byun, Elias N. Houstis, E. A. Vavalis

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

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 …

A Comparison Of Integration Architectures, Amar Mahidadia

Theses

This paper presents GenSIF, a Generic Systems Integration Framework. GenSIF features a pre-planned development process on a domain-wide basis and facilitates system integration and project coordination for very large, complex and distributed systems. Domain analysis, integration architecture design and infrastructure design are identified as the three main components of GenSIF. In the next step we map Beilcore's OSCA interoperability architecture, ANSA, IBM's SAA and Bull's DCM into GenSIF. Using the GenSIF concepts we compare each of these architectures.

GenSIF serves as a general framework to evaluate and position specific architecture. The OSCA architecture is used to discuss the impact of …