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

Physical Sciences and Mathematics Commons™

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

Computer Sciences

1993

Computer Science Faculty Research & Creative Works

Articles 1 - 8 of 8

Full-Text Articles in Physical Sciences and Mathematics

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

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.

Go to article

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

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 …

Go to article

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

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.

Go to article

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

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 …

Go to article

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

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 …

Go to article

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 …

Go to article

Functional Representation And Reasoning About The F/A-18 Aircraft Fuel System, M. Pegah, J. Sticklen, William E. Bond Jan 1993

Functional Representation And Reasoning About The F/A-18 Aircraft Fuel System, M. Pegah, J. Sticklen, William E. Bond

Computer Science Faculty Research & Creative Works

Functional reasoning, a subfield of model-based reasoning, is discussed. This approach uses abstractions of a device's purpose to index behaviors that achieve that purpose. Functional modeling, a variation on this method, also uses simulation as a core reasoning strategy. The complex causal knowledge of a device along functional lines is decomposed, then a causal story of how the device will operate in a particular situation given stated boundary conditions is composed. The application of the functional approach to modeling the fuel system of a F/A-18 aircraft is described. The representation of the F/A-18 fuel system includes 89 component devices, 92 …

Go to article

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

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

Go to article