Digital Commons Network^™

A Comparison Of Two Evidential Reasoning Schemes, Sunny Lee

Department of Computer Science Technical Reports

No abstract provided.

Cascading Divide-And-Conquer: A Technique For Designing Parallel Algorithms, Mikhail J. Atallah, Richard Cole, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.

Some Experiments With Tcp/Ip Protocols Over An X.25 Network, John T. Korb, Craig E. Wills

Department of Computer Science Technical Reports

No abstract provided.

Closed-Network Duals Of Multiques With Application To Token-Passing Systems, Vernon J. Rego, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Meta-Level Programming: A Compiled Approach, Hamid Bacha

Electrical Engineering and Computer Science - Technical Reports

There has been some intense research lately focused on the area of meta-level inference systems. In logic programming, the limitations of Prolog are widely recognized and a meta-level approach has been suggested. Unfortunately, only meta-interpreters have been considered so far. Moreover, these meta-interpreters are often themselves written on top of a Prolog interpreter. These cascaded layers of interpreters result in an enormous slow down, rendering the resulting system practically useless for all but a small number of toy applications. This paper will report on the implementation of a fast incremental metaProlog compiler. In the process, it will explore some of …

A Routing Algorithm For Three Stage Rearrangeable Clos Networks, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

No abstract provided.

A Logic Programming Model Of The Game Of Sprouts, Ralph M. Butler, Selden Y. Trimble, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

The Game of Sprouts Has Intrigued Mathematicians for Nearly Twenty Years. This Paper Describes a Representation Scheme Which Simplifies Much of the Geometry of the Game. using This Representation, We Develop a Prolog Program Which Will Play Sprouts. It is Hoped that the Program Will Prove to Be a Useful Research Tool in Finding the Key to a Winning Strategy for Sprouts and that the Representation Will Serve as a Useful Model for Studying Planar Graphs.

A Logic Programming Model Of The Game Of Sprouts, Ralph M. Butler, Selden Y. Trimble, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

The Game of Sprouts Has Intrigued Mathematicians for Nearly Twenty Years. This Paper Describes a Representation Scheme Which Simplifies Much of the Geometry of the Game. using This Representation, We Develop a Prolog Program Which Will Play Sprouts. It is Hoped that the Program Will Prove to Be a Useful Research Tool in Finding the Key to a Winning Strategy for Sprouts and that the Representation Will Serve as a Useful Model for Studying Planar Graphs. © 1987, ACM. All Rights Reserved.

An Attribute-Grammar Implementation Of Government-Binding Theory, Nelson Correa

Electrical Engineering and Computer Science - All Scholarship

The syntactic analysis of languages with respect to Government binding (GB) grammar is a problem that has received relatively little attention until recently. This paper describes an attribute grammar specification of the Government binding theory. The paper focuses on the description of the attribution rules responsible for determining antecedent trace relations in phrase-structure trees, and on some theoretical implications of those rules for the GB model. The specification relies on a transformation-le variant of Government "binding theory, briefly discussed by Chomsky (1981), in which the rule move-a is replaced by an interpretive rule. Here the interpretive rule is specified by …

Sorting And Selecting In Rounds, Nicholas Pippenger

All HMC Faculty Publications and Research

We present upper bounds for sorting and selecting the median in a fixed number of rounds. These bounds match the known lower bounds to within logarithmic factors. They also have the merit of being “explicit modulo expansion”; that is, probabilistic arguments are used only to obtain expanding graphs, and when explicit constructions for such graphs are found, explicit algorithms for sorting and selecting will follow. Using the best currently available explicit constructions for expanding graphs, we present the best currently known explicit algorithms for sorting and selecting in rounds.

Nova University Doctor Of Education In Computer Education [1987], Nova University

Abraham S. Fischler College of Education and School of Criminal Justice College Archive

No abstract provided.

Organization For Collection Development In Medium-Sized Academic Libraries, Carol W. Cubberley

CCAC Theses and Dissertations

At the University of Central Florida Library, the librarians with collection development assignments, and the Head of Collection Development, were frustrated in their attempts to fulfill their responsibilities. Those librarians did not report to the Department Head, but to other departments, and only a small percentage of their time was set aside for collection development. This meant that collection development duties frequently were deferred to other duties. There also was uncertainty about what duties could be expected of these librarians. Some functioned only as liaisons to academic departments, while others did extensive selection of material, wrote collection development policies, and …

Strategic Planning For A Special Library, Donald A. Guerriero

CCAC Theses and Dissertations

STRATEGIC PLANNING FOR A SPECIAL LIBRARY

The Technical and Management Information Center of the U.S. Defense Communications Agency is a special library providing worldwide library and information services in the subject fields of communications, electronics, command and control, and computer sciences. A project was designed with the objective of developing a strategic plan for this library. Long-range and strategic planning methods commonly used in business organizations were used. An extensive review of the literature on strategic planning was done to determine the best methods available for use in a special library environment. The methods used to develop the strategic plan …

Training For The Airland Battle With Modeling And Simulation On The Microcomputer, David Dean Holmes

Masters Theses

"This paper describes a methodology for modifying a combat training simulation model to include a comprehensive data structure and computer software, to allow the model to be implemented on a microcomputer. It begins by developing a topology for combat simulation models and proceeds to define a data structure suitable for describing military units and facilitating the varied aspects of the simulation. An eclectic approach to the development of the model and the implementing software is followed throughout. Appropriate aspects of a number of models are incorporated into a single model suitable for training military commanders and their staffs. PASCAL, a …

Mpj: A Proposed Java Message Passing Api And Environment For High Performance Computing, Mark Baker, Bryan Carpenter

Northeast Parallel Architecture Center

In this paper we sketch out a proposed reference implementation for message passing in Java (MPJ), an MPI-like API from the Message-Passing Working Group of the Java Grande Forum [1,2]. The proposal relies heavily on RMI and Jini for finding computational resources, creating slave processes, and handling failures. User-level communication is implemented efficiently directly on top of Java sockets.

The Slicing Extent Technique For Fast Ray Tracing, Sudhanshu Kumar Semwal

Retrospective Theses and Dissertations

A new technique for image generation using ray tracing is introduced. The “Slicing Extent Technique” (SET) partitions object space with slicing planes perpendicular to all three axes. Planes are divided into two dimensional rectangular cells, which contain pointers to nearby objects. Cell size and the space between slices varies, and is determined by the objects’ locations and orientations. Unlike oct-tree and other space-partitioning methods, SET is not primarily concerned with dividing space into mutually exclusive volume elements (‘voxels’) and identifying objects within each voxel. Instead, SET is based on analysis of projections of objects onto slicing planes. In comparison to …

Design And Performance Analysis Of A Relational Replicated Database Systems, Jon Gregory Hanson

Retrospective Theses and Dissertations

The hardware organization and software structure of a new database system are presented. This system, the relational replicated database system (RRDS), is based on a set of replicated processors operating on a partitioned database. Performance improvements and capacity growth can be obtained by adding more processors to the configuration. Based on designing goals a set of hardware and software design questions were developed. The system then evolved according to a five-phase process, based on simulation and analysis, which addressed and resolved the design questions. Strategies and algorithms were developed for data access, data placement, and directory management for the hardware …

Medial Axis Transform Using Ridge Following, Richard Mark Volkmann

Masters Theses

"The intent of this investigation has been to find a robust algorithm for generation of the medial axis transform (MAT). The MAT is an invertible, object centered, shape representation defined as the collection of the centers of disks contained in the shape but not in any other such disk. Its uses include feature extraction, shape smoothing, and data compression. MAT generating algorithms include brushfire, Voronoi diagrams, and ridge following. An improved implementation of the ridge following algorithm is given. Orders of the MAT generating algorithms are compared. The effects of the number of edges in the polygonal approximation, shape area, …

Intensional Reasoning About Knowledge, Oliver B. Popov

Doctoral Dissertations

"As demands and ambitions increase in Artificial Intelligence, the need for formal systems that facilitate a study and a simulation of a machine cognition has become an inevitability. This paper explores and developes the foundations of a formal system for propositional reasoning about knowledge. The semantics of every meaningful expression in the system is fully determined by its intension, the set of complexes in which the expression is confirmed. The knowledge system is based on three zeroth-order theories of epistemic reasoning for consciousness, knowledge and entailed knowledge. The results presented in the paper determine the soundness and the completeness of …

Impact Of Automation On Process Control Decision-Making, Steven M. Miller, Susan R. Bereiter

Research Collection School Of Computing and Information Systems

This paper investigates changes in the process control of a vehicle assembly plant which had been modernized from a principally manual procedure to one that uses programmable automation extensively. Process control is defined as the information flow and decision-making required to perform basic process operations. We investigate the effects of implementing a computer-integrated production system on the amount and types of process control decision-making and on the distribution of process control decision-making between humans and machines. After automation, the emphasis on decisions regarding product quality specifications increased and the emphasis on decisions related to flexibility in handling a variety of …

A Proposed C Language Binding For The Graphical Kernel System-3d, Mark Gerard Bolten

Masters Theses

"This thesis introduces a proposed C language binding definition for the International Standards Organization's draft international standard of the Graphical Kernel System-3D. This work augments the earlier C language binding of the two dimensional version of the Graphical Kernel System commonly known as GKS. The proposed function interface will provide a basis for, if not a final, C language binding for the three dimensional version of the Graphical Kernel System"--Abstract, page ii.

The Cypress Network, Douglas E. Comer, Thomas Narten, Rajendra Yuavatkar

Department of Computer Science Technical Reports

No abstract provided.

A General Design Tool For Computer Directories, Edward J. Peeler

Masters Theses

The primary objective of a directory is to organize information for efficient retrieval. There are many techniques that can be applied to the design of a directory. One particularly useful technique employs the use of inverted files on range attributes. The technique provides an effective directory for a variety of applications and for very large databases. This paper examines the technique and describes the implementation of a general design tool based on these principles.

Efficient Message Routing In Planar Networks, Greg N. Frederickson, Ravi Janardan

Department of Computer Science Technical Reports

No abstract provided.

Do We Really Know What Makes Educational Software Effective? A Call For Empirical Research On Effectiveness, Karen Jolicoeur, Dale E. Berger

CGU Faculty Publications and Research

Empirical information on specific factors that make educational software effective in reaching instructional objectives would be of considerable value. The authors describe the current state of evaluation research with educational software and discuss how popular software review methods fall short of meeting our need to know how well specific programs work.

Computers And The Nature Of Man: A Historian's Perspective On Controversies About Artificial Intelligence, Judith V. Grabiner

Pitzer Faculty Publications and Research

The purpose of the present paper is to provide a historical perspective on recent controversies, from Turing's time on, about artificial intelligence, and to make clear that these are in fact controversies about the nature of man. First, I shall briefly review three recent controversies about artificial intelligence, controversies over whether computers can think and over whether people are no more than information-processing machines. These three controversies were each initiated by philosophers who, irrespective of what the programs of their time actually did, viewed with alarm the argument that if a machine can think, a thinking being is just a …

Cache Coherence In Distributed Systems (Thesis), Christopher Angel Kent

Department of Computer Science Technical Reports

No abstract provided.

An Investigation Into The Numeric Solution Of Linear Recurrence Relations, Dennis Lee Kapenga

Masters Theses

This is an investigation of the use of some techniques from numerical linear algebra in solving linear recurrence relations.

The classic methods of Oliver and Lozier are compared with several alternatives. These alternatives center on using advances in the theory of numerical linear algebra, computer software, and raw computer performance which have been made in the 15 years since the original research into linear recurrence relations was done.

A set of test examples is presented to provide a basis to compare solution methods. This set of examples was selected to allow experiments associated with the Poincare class of recurrence relations. …

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 …

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

IIMB Management Review

No abstract provided.