Digital Commons Network^™

Mica: Prototyping An Expert System Consultant, Joseph Howard Marchal, Arlan R. Dekock

Computer Science Technical Reports

The United States, as the world's largest producer and consumer of scrap and flake mica, has an obvious economic interest in applications of artificial intelligence technology that would expedite beneficiation of mica. In the fall of 1985, personnel of the Tuscaloosa and Rolla research centers of the Bureau of Mines and of the University of Missouri-Rolla, Institute for Artificial Intelligence started the following long term research project: Develop an Expert System Consultant for the three basic stages of mica beneficiation: Stage 1: characterization of the material; Stage 2: treatment to obtain a concentrate; and Stage 3: evaluation of the resulting …

Genesis Of An Expert System For Umr Degree Auditing, Ruth Sue Dare, Arlan R. Dekock

Computer Science Technical Reports

This paper describes the features, design, and development of an expert system for degree auditing at the University of Missouri--Rolla. It summarizes artificial intelligence as it is known today while specifically addressing expert systems. It describes selected expert systems currently in existence.

The present audit procedure utilized at the University of Missouri--Rolla is discussed. A description is given of the design and development of an expert system, written in LISP, to conduct a degree audit. Finally there are concluding remarks which include an analysis of the system and a discussion of possible system enhancement.

A Computerized Audio-Visual Speech Model, Joaquin Alberto Vila Ruiz, Arlan R. Dekock

Computer Science Technical Reports

This thesis describes an expert system able to animate (graphically) and reproduce (acoustically) a text in any language which uses the Latin alphabet. A rule editor has been developed to create and modify the set of letter-to-sound rules of the target language. A parser has been implemented to apply the set of rules and translate text-to-speech. Each phoneme has a unique sound and thus requires its particular positioning of the vocal organs which are displayed in two different projections: a front view and a profile cross view of a human face in synchronization with the output sounds of the speech …

Centre For Computer Aided Management: An Overview, V B Kaujalagi

IIMB Management Review

No abstract provided.

A Compiler For A Two-Dimensional Programming Language, Julie Wing Kam Choi

All Computer Science and Engineering Research

A visual programming language is presented. This language uses interactive graphics to convey notion such as subroutine, recursion, block structure, parallel and serial processing to school children. Currently the system is interpreter based. To overcome the inefficiency of the interpreter based system, a compiler is implemented for this language. This report gives an overview of the compiler and the details about the parser, semantic analyzer and the code generator. Finally, a performance comparison between the interpreter based system and the compiler based system is given.

Parallelism In Solving Pdes, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Multi-Flex Machines Preliminary Report, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

New Clique And Independent Set Algorithms For Circle Graphs, Alberto Apostolico, Mikhail J. Atallah, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

On Distributions Of Run-Times In Distributed Systems, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.

Optimal Three-Dimensional Layouts Of Complete Binary Trees, Ajay K. Gupta, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

Partitioning Pde Computations: Methods And Performance Evaluation, Catherine E. Houstis, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Progressive Coding And Transmission Of Digital Diagnostic Pictures, Sharaf E. Elnahas, Kou-Hu Tsou, Jerome R. Cox, Rexford L. Hill, R. Gilbert Jost

All Computer Science and Engineering Research

In radiology, as a result if the increased utilization of digital imaging modalities, such as computed tomography (CT) and magnetic resonance imaging (MRI), over a third of the images produced in a typical radiology department are currently in digital form, and this percentage is steadily increasing, Image compression provides a means for the economical storage and efficient transmission of these diagnostic pictures. The level of coding distortion than can be accepted for clinical diagnosis purposes is not yet well-defined. In this paper we introduce some constraints on the design of existing transform codes in order to achieve progressive image transmission …

Quick Ceph™, A Computer Program For Cephalometric Analysis And Treatment Planning, Günther Blaseio

Loma Linda University Electronic Theses, Dissertations & Projects

The quantification of cephalometric radiographs is an integral part of orthodontic treatment planning. Numerous computer programs have been designed to digitize headfilms and to provide accurate graphic output and exact measurements. Yet these early systems were either huge, bulky and expensive or were limited in their practical use. The aim of this development was to combine modern computer and electronic equipment with advanced software engineering. The result is a universal cephalometric program written in the computer language "C" with presently seven standard and virtually limitless user definable analyses, growth forecasting, mouse-driven interactive VTO, arch length calculation, superimpositions, table of values …

A Five Year Plan For Excellence, Mikhail J. Atallah, Douglas E. Comer, Herbert E. Dunsmore, Greg N. Frederickson, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Logarithmic Time Parallel Algorithm For Partitioning, Costas S. Iliopoulos

Department of Computer Science Technical Reports

No abstract provided.

There Is A Planar Graph Almost As Good As The Complete Graph, L Paul Chew

Dartmouth Scholarship

Given a set S of points in the plane, there is a triangulation of S such that a path found within this triangulation has length bounded by a constant times the straight-line distance between the endpoints of the path. Specifically, for any two points a and b of S there is a path along edges of the triangulation with length less that sqrt(10) times [ab], where [ab] is the straight-line Euclidean distance between a and b. The triangulation that has this property is the L1 metric Delauney triangulation for the set S. This result can be applied to motion planning …

Algebraic Geometry For Computer-Aided Geometric Design, Thomas W. Sederberg, Ronald N. Goldman

Faculty Publications

Classical algebraic geometry has been virtually ignored in computer-aided geometric design. However, because it deals strictly with algorithms, it is really more suited to this field than is modern algebraic geometry, which introduces abstractions far removed from the algorithmic nature of computer-aided design. This tutorial examines resultants, curve implicitization, curve inversion, and curve intersection. Discussion follows a series of examples simple enough for those with only a modest algebra background to follow.

Making Mail Friendlier: Adding Macintosh Features And Multimedia Documents In Unix Mail, John R. Meier

Dartmouth College Undergraduate Theses

This paper describes a Macintosh application which acts as a front-end to Unix mail. Features of the Macintosh interface such as icons, menus, and windows replace the command driven interface. Complicated editing commands are replaced with mouse selection and cut, copy, and paste. Message can be composed of text, pictures, and any Macintosh file, because they are encoded into plain text, sent through the mail system,and then unencoded by the receiving end. The designs of the mail server and communications interface are such that mail servers and communications other than Unix mail and a serial line may be easily implemented.

Optimal Cost Parallel Algorithms For Lexicographical Ordering, Costas S. Iliopoulos

Department of Computer Science Technical Reports

No abstract provided.

Stability Conditions For Multidimensional Queueing Systems And Applications To Analysis Of Computer Systems, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Convergence Of O(H**4) Cubic Spline Collocation Methods For Elliptic Partial Differential Equations, Elias N. Houstis, E. A. Vavalis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Some Remarks On Uniformly Bounded Markov Chains: Stability Analysis, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Quadratic-Spline Collocation Methods For Two Point Boundary Value Problems, Elias N. Houstis, C. C. Christara, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Application Of Modified Predicate Transition Nets To Modeling And Simulation Of Communication Protocols, Chuang Lin, Dana Cristian Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Generation Of Configuration Spaces Iii: The Case Of Moving Algebraic Curves, Changerjit Bajaj, Myung-Soo Kim

Department of Computer Science Technical Reports

No abstract provided.

Analytic Modelling Of Cyclic Service Systems And Their Application To Token-Passing Local Networks, Vernon J. Rego, Lionel M. Ni

Department of Computer Science Technical Reports

No abstract provided.

Data Structure For The Use Of Patterns In The Perceptual Ordering Of The Game Of Chess, Russ L. Hanna, Arlan R. Dekock

Computer Science Technical Reports

It is well known that the way one perceives a problem can influence the difficulty of solving the problem in a profound way. In the case of computer chess playing programs, one finds that most programs perceive the game in much the same way. They are all based on Shannon's original proposal for chess playing programs. His approach was to generate all of the possible combinations of moves up to a certain number of plays and then a subset of all combinations to a deeper level thereafter. Each of these moves would then be evaluated as to its relative worth. …

A Semantic Basis For Parallel Algorithm Design, Roger E. Eggen, John R. Metzner

Computer Science Technical Reports

As computing demands increase, emphasis is being placed on parallel architectures- To efficiently use parallel machines, software must be designed to take advantage of these machines. This research concentrates on an abstraction of algorithm design to permit the expression of parallel programs. The abstraction emphasizes thought about algorithms at a high level as opposed to algorithm implementation at a statement level. A model based on data flow allows algorithm expression using flow diagrams. The model specifies operating system requirements that support parallel programming at a module level. Paths are used to carry data between modules. Data enter modules through ports. …

Generic Specifications In Lil And In Ada Via Analogies, George Chester Harrison

Computer Science Theses & Dissertations

We address the problem of .making verifiable specifications in generic program units in the Ada Programming Language*. We illustrate the methodologies of LIL proposed by Joseph Goguen and Justify the use of such a specification languages using analogy programming originally proposed by Nachum Dershowitz. The work in these areas is new and noticeably incomplete. We address our concern about the reusability of Ada software in a programming environment that includes a specification language like LIL. * Ada is a registered trademark of the U.S. Government (Ada Joint Program Office)

Direct Simulation From A Model Specification Language, Richard Pimentel

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The purpose of this thesis was to develop a program that would accept, as input, a finite set of algebraic equations and simple if-then conditional expressions that model a natural system, and then produce a continuous computer simulation with graphics and tabular output. The equations and conditionals can be in any order and key elements can be missing. The program can be used to run existing models or as a development tool to produce immediate prototypic computer simulations through synergistic man-machine interactions.

The theoretical aspects of automatic program generation were discussed, as well as the architectural design of the system. …