Physical Sciences and Mathematics Commons^™

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 …

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

Functions Returning Values Of Dynamic Size, Mark Sherman, Andy Hisgen, Jonathan Rosenberg, David Alex Lamb

Computer Science Technical Reports

Modern programming languages, such as Ada (Ichbiah 80), permit the definition of functions that return values whose size can not be determined until the function returns. This paper discusses five implementation techniques that can be used to implement this capability. Comparisons of the techniques are provided and guidelines for selecting a particular technique for a compiler are given.

Stack Package Implementing Tasks And Coroutines For Tml Pascal On The Macintosh, Mark Sherman

Computer Science Technical Reports

This disk contains the necessary TML Pascal and MDS Assembler files for implementing tasking and coroutines in TML Pascal Programs. Two example programs and brief documentation are provided. MDS format disk.

Macip Sources And Applications, Mark Sherman, Tim Maroney

Computer Science Technical Reports

The MacIP set consists of three disks, all single-sided, MFS formatted. Two disks contain the Lisa Pascal/Lisa Assembler sources for the network libraries and application programs; the third disk contains the runnable applications along with an AppleTalk configured system. The current version by Tim Maroney fixes all reported bugs mentioned in the MacIP Technical Report and includes the TCP library and Telnet program.

Maze Game For The Macintosh, Mark Sherman

Computer Science Technical Reports

Maze is a multiperson game using a broadcast protocol on the Macintosh. This disk contains the sources (in TML Pascal) for a Maze game.

Qdt (Quickdraw Terminal) Disks, Mark Sherman

Computer Science Technical Reports

This disk set consists of one disk containing a running version of QDT over a serial line, one disk containing a running version of QDT over Apple Talk (using KSP), and one disk containing the Lisa Pascal sources for creating QDT (either version).

Music Editor, Ed Grosz

Computer Science Technical Reports

This disk contains a simple music editor that creates resources that can be used directly by the Macintosh Sound Driver. The MFS formatted disk contains both the runnable program and the Lisa Object Pascal/MacApp Sources.

A Collection Of Mds Example Programs, Joe Bergin, Robert L. Scot Drysdale, Jerry Keough, Larry Gallagher, Vivian Sewelson, Mark Sherman

Computer Science Technical Reports

This MFS formatted disk contains a collection of example programs written for teaching machine architecture concepts using the Macintosh Development System. Sample programs illustrate how instructions can be treated as data, computer arithmetic, looping features, interrupt handling, coroutines, recursive subprograms and stack frames, traps and direct manipulation of the screen. In addition, a supervisor program is provided that implements basic, line-oriented input and output facilities for the 68000 assembly language programs on the Macintosh.

Digital Logic Simulator, John W. Scott

Computer Science Technical Reports

Logic is a Macintosh program that simulates discrete, digital logic circuits. The two disks contain an executable version of the program, MacApp sources and brief documentation (which is also available separately in hardcopy).

Instructions For Using Logic, John W. Scott

Computer Science Technical Reports

This document provides instructions on the use of "Logic", a digital logic simulator for the Macintosh written for Dartmouth students in the Machine Architecture and Digital Electronics courses.

Uses Of Generics In Ada, Mark Sherman

Computer Science Technical Reports

This paper discusses how Ada generic procedures and packages can be used in novel ways to provide general initialization of records, expressions using discriminants, record field hiding and explicit control of parameter binding.

Algorithms For Iterative Array Multiplication, Shinji Nakamura

Computer Science Technical Reports

Algorithms for the parallel multiplication of two n bit binary numbers by an iterative array of logic cells are discussed. The regular interconnection structures of the multiplier array cell elements, which are ideal for VLSI implementation, are described. The speed and hardware complexity of two new iterative array algorithms, both of which require n cell delays for one n by n bit multiplication, are compared with a straight-forward iterative array algorithm having a 2n cell delay and its higher radix version having an n cell delay.

A Practical, Distributed Environment For Macintosh Software Development, Mark Sherman, Ann Marks, Rob Collins, Heather Anderson, Jerry Godes, Denis Devlin, Leonid Spector, Vivian Sewelson

Computer Science Technical Reports

We describe a development environment we created for prototyping software for the Macintosh. The programs are developed and executed on a large time-shared computer but can use the full facilities of the Macintosh. By using this system, we combine the advantages of the large system, such as large amounts of disk storage and automatic file backups, with the advantages of the Macintosh, such as advanced graphics, mouse control and sound synthesis. We also describe several projects that used the distributed development system. We conclude with a description of our future plans for this environment.

Parallel Accessible Memory, Shinji Nakamura

Computer Science Technical Reports

A new design of a memory device which allows simultaneous access to more than one location is proposed. The unique feature of this multiple accessibility of the memory is realized by applying a binomial concentrator, a type of sparse crossbar interconnection network, to content-addressable memory. The organization of the memory system and the concentration network structure as well as the network characteristics are described along with a distributive control algorithm. Applications of the memory system to parallel processing environments are also included.

Havoc V.85 Software, David Cohn, Stephen Madancy

Computer Science Technical Reports

This disk contains alpha release 85 of the HAVOC system, with examples. It is written in C and 68000 assembler.

Finding Largest Empty Circles With Location Constraints, L Paul Chew, Robert L. Scot Drysdale

Computer Science Technical Reports

Let S be a set of n points in the plane and let CH(S) represent the convex hull of S. The Largest Empty Circle (LEC) problem is the problem of finding the largest circle centered with CH(S) such that no point of S lies within the circle. Shamos and Hoey (SH75) outlined an algorithm for solving this problem in time O(n log n) by first computing the Voronoi diagram, V(S), in time O(n log n), then using V(S) and CH(S) to compute the largest empty circle in time O(n). In a recent paper [Tou83], Toussaint pointed out some problems with …

Binary Trees (V. 2.1 -- September 25, 1985), John Glenn

Computer Science Technical Reports

Binary Tree is a program that uses animation to illustrate insertion, deletion and searching of nodes in a binary search tree. Pre-order, in-order, and post-order tree walks are supported. Binary Tree can also perform a recursive descent parse of arithmetic expressions and show the resulting abstract syntax tree. Lisa Pascal source and application available on a single-sided, MFS format microdisk.

A Distributed Strategy For Resource Allocation, Ann Kratzer

Computer Science Technical Reports

In this paper, we present a decentralized algorithm for determining how resources should be allocated to sites. This algorithm is general in the sense that it can be used for allocating different kinds of resources. This algorithm can be applied either statically, used on a quiescent system, or used dynamically as the system runs. Throughout, we consider only systems in which a resource has a fixed cost associated with it regardless of where it may be located (i.e. the system is homogeneous).

Task Queues: A General Model For The Implementation Of Communications Protocols, Ann Kratzer

Computer Science Technical Reports

When any computer communications network is built, its communications protocol must always be implemented. The protocol is implementetd on the switching nodes of the network. The node software must respond in real time to events generated external to the switching node. Thus, the software running on a switching node constitutes a concurrent program; this complicates the design, implementation and testing of the switching node software. The task queue model presented in this paper defines a structure for this software that facilitates the design, implementation and testing of communications protocols.

The Pairwise Intersection Problem For Monotone Polygons, David B. Levine

Computer Science Technical Reports

Geometric intersection problems arise in a number of areas of computer science including graphics and VLSI design rule checking. Previous work has concentrated on solving the pairwise intersection problem for line segments and iso-oriented rectangles. This thesis extends that work by presenting efficient algorithms to solve the pairwise intersection problem for monotone polygons. For general segments, the problem has been solved in O(N+I)*logN) time using a sweeping line technique, where N is the number of segments and I is the number of intersections reported. We combine this technique with approaches taken to solve the iso-oriented rectangle problem to yield an …

View 3: A Programming Environment For Distributed Programming, Ann Kratzer

Computer Science Technical Reports

View 3 is an experimental programming environment to support the development and use of distributed programs. It builds upon three major concepts. First, distributed programs and distributed processes are basic objects. Second, the port mechanism allows a process to exchange information with another process, a file or an I/O device without concern for the type of the object on the other end of the port. Third, test and use of distributed programs are facilitated by the user interface program screen format that allows the user to control both the format and contents of the physical terminal.

Producing Software Using Tools In A Workstation Environment, Mark Sherman, Robert L. Scot Drysdale

Computer Science Technical Reports

We discuss how we taught students to build and use translation, interpretive, editing and monitoring tools in an undergraduate software engineering course. Students used the tools on low-cost workstations (Macintoshes) to build large, group projects. The students' projects used all available features of workstation environments, including graphics, windows, fonts, mice, networks, and sound generators. We found that 1) the use of tools increased student productivity, 2) a shift in a data structure and algorithm topics is needed to cover material relevant for workstation environments, 3) new topics in system design are required for a workstation environment, 4) traditional material can …

An Algorithm For Resource Allocation Requiring Low Overhead Communication, Ann Marks

Computer Science Technical Reports

A heuristic algorithm for allocating resource units to sites in a distributed system is presented. Starting with a given allocation of sites, the algorithm performs a series of optimizations involving pairs of sites in an attempt to improve the worst pair-wise imbalance present in the system; termination occurs when no further improvement is possible. After outlining the general form of the algorithm, which effectively defines an entire family of algorithms, we present theoretical results that speak to the performance of the algorithm as measured in the number of optimizations that can be done, the amount of control communication required and …

Using Low-Cost Workstations To Investigate Computer Networks And Distributed Systems, Mark Sherman, Ann Marks

Computer Science Technical Reports

A quality education in contemporary computer science requires that students gain experience with realistic systems. Many efforts at bringing empirical computer science to undergraduates focus on rather old technologies, for example, building a compiler or simulating a disk scheduler. Although efforts are being made to use some newer technologies, the efforts are concentrating on teaching traditional material in a new medium. However, the medium itself -- networked workstations in a server environment -- is worthy of exploration by undergraduate students in a laboratory setting. At Dartmouth, we developed a Computer Network Laboratory to let students experiment with computer networks, protocols …

A Network Package For The Macintosh Using The Dod Internet Protocols, Mark Sherman

Computer Science Technical Reports

This memo describes the design, implementation and use of the MacIP libraries and programs for running DoD Internet Protocols on the Macintosh over Apple Talk. It is preliminary documentation and out of date, but it is all that exists.