Digital Commons Network^™

Blas, Linear, Algebra Modules And Supercomputers Parvec Workshop #4, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

An Analysis Of The Effect Of Network Load And Topology On The Performance Of Concurrency Control Algorithm In Distributed Database Systems, Anoop Singhal, Amit P. Sheth, Ming T. Liu

Kno.e.sis Publications

Earlier studies in the performance analysis of concurrency control algorithms in distributed database systems (DDBS) have assumed that the message transmission time between any two nodes of a network is constant. Hence they disregard the effect of communication subnet related parameters such as network traffic, network topology, the capacity of transmission channels and the size of messages transmitted. In this paper an analytical model is used to estimate the delays in transmission channels for a DDBS in a long haul network. The analysis shows that the constant transmission time assumption cannot be justified in many cases and that response time …

Survey Of Routing Algorithms For Computer Networks, Lu Yu, Thomas J. Sager

Computer Science Technical Reports

This thesis gives a general discussion of routing for computer networks, followed by an overview of a number of typical routing algorithms used or reported in the past few years. Attention is mainly focused on distributed adaptive routing algorithms for packet switching (or message switching) networks. Algorithms for major commercial networks (or network architectures) are reviewed as well, for the convenience of comparison.

Artificial Intelligence: Myths And Realities, Hugo D'Alarcao

Bridgewater Review

Artificial intelligence the name conjures images of mechanical monsters, the Golem, Dr. Frankenstein’s creation and the rebellious computer Hal. We have always been fascinated by the possibility of creating a machine in our image, but this fascination is often accompanied by apprehension. We fear losing control of our creation and suspect that it might turn against us. It is this duality, this conflict between the desire to create and the fear of the consequences of the creation that has been so successfully exploited by writers. It is also, in part, this fascination that has recently brought the field of Artificial …

Norms For An Information Age, Willis J. Alberda

Pro Rege

No abstract provided.

Resolution Algorithms In A Parallel Processing Environment, Paula Beth Brandman Hencken

Masters Theses

An ever increasing number of processors are becoming available to the multiprocessor user. For faster response and efficient utilization of parallel processing systems it is necessary to develop parallel algorithms to solve a single problem.

This paper evaluates the complexity of resolution algorithms run in a parallel processing environment. An overview of parallel processing is presented along with a discussion of general resolution and resolution-refutation systems. An analysis of the complexity required by different control strategies to perform resolution programing is presented using both uniprocessor and multiprocessor systems.

Optimal Placement For Multi-Terminal Nets, Mikhail J. Atallah, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

The Tilde Project, Douglas E. Comer, John T. Korb, Thomas Murtagh, Walter Tichy

Department of Computer Science Technical Reports

No abstract provided.

Computing The Convex Hull Of Line Intersections, Mikhail Atallah

Department of Computer Science Technical Reports

No abstract provided.

Smart Recompilation, Walter F. Tichy, Mark C. Baker

Department of Computer Science Technical Reports

No abstract provided.

Ellpack: An Evolving Problem Solving Environment, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

The Algebraic Degree Of Geometric Optimization Problems, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Perturbation Analysis Of The Limit Cycle Of The Free Van Der Pol Equation, Mohammad Dadfar, James Geer, Carl M. Andersen

Computer Science Faculty Publications

. A power series expansion in the damping parameter E of the limit cycle U(t; E) of the free van der Pol equation Ul + E( U2 _1) U + U =0 is constructed and analyzed. Coefficients in the expansion are computed up to 0(E24) in exact rational arithmetic using the symbolic manipulation system MACSYMA and up to O(E163) using a FORTRAN program. The series is analyzed using Pade approximants. The convergence of the series for the maximum amplitude of the limit cycle is limited by two pairs of complex conjugate singularities in the complex e-plane. These singularities are the …

Software Metrics Data Collection, Appendices 4-6, T. J. Yu, Brian A. Nejmeh

Department of Computer Science Technical Reports

No abstract provided.

A Tensor Product Generalized Adi Method For The Method Of Planes, Wayne R. Dyksen

Department of Computer Science Technical Reports

No abstract provided.

An Overview Of The Dash Intelligent Terminal Project, John T. Korb

Department of Computer Science Technical Reports

No abstract provided.

Design Of Infrasound-Detection System Via Adaptive Lmstde Algorithm, Camille S. Khalaf

Electrical & Computer Engineering Theses & Dissertations

A proposed solution to an aviation safety problem is based on passive detection of turbulent weather phenomena through their infrasonic emission. This thesis describes a system design that is adequate for detection and bearing evaluation of infrasounds. An array of four sensors, with the appropriate hardware, is used for the detection part. Bearing evaluation is based on estimates of time delays between sensor outputs. The generalized cross correlation (GCC), as the conventional time-delay estimation (TOE) method, is first reviewed. An adaptive TUt approach, using the least mean square (LMS) algorithm, is then discussed. A comparison between the two techniques is …

Six Copyright Theories For The Protection Of Computer Object Programs, I. Trotter Hardy

Faculty Publications

No abstract provided.

A Tensor Product Generalized Adi Method For Ellipic Problems On Cylindrical Domains With Holes, Wayne R. Dyksen

Department of Computer Science Technical Reports

No abstract provided.

Tensor Product Generalized Adi Methods For Elliptic Problems, Wayne R. Dyksen

Department of Computer Science Technical Reports

No abstract provided.

A Name Resolution Model For Distributed Systems, Douglas E. Comer, Larry J. Peterson

Department of Computer Science Technical Reports

No abstract provided.

A Note On Finding A Maximum Empty Rectangle, Mikhail J. Atallah, Greg N. Frederickson

Department of Computer Science Technical Reports

No abstract provided.

A Guide To The Poker Mapping Preprocessor, Fran Berman, Mike Goodrich, Chuck Koelbel, Bill Robison, Karen Showell

Department of Computer Science Technical Reports

No abstract provided.

Edge Grammars: Decidability Results And Formal Language Issues, Francine Berman, Gregory Shannon

Department of Computer Science Technical Reports

No abstract provided.

A Simple Method For Organizing Nearly Optimal Binary Search Trees, Joy L. Henderson, John R. Metzner

Computer Science Technical Reports

Improving the efficiency of retrieving information concerns users of computer systems involved in many applications- One way of addressing this concern is to organize a sorted sequence into a binary search tree. Knuth's Algorithm K is a bottom-up organization algorithm that always constructs a binary tree which minimizes average search time. However, the cost of executing Algorithm K is prohibitive for a large tree. The aim of this work is to find a less costly method of organizing sorted sequences into nearly-optimal binary search trees.

We present a top-down organization method which yields better average search times than top-down methods …

The Design And Implementation Of The Programming Language Natural, Alan L. Sparks, Thomas J. Sager, Arlan R. Dekock

Computer Science Technical Reports

This paper reports progress on the development of the programming language Natural, currently under design by Dr. Thomas J. Sager at the University of Missouri--Rolla. Natural is a very high-level language with a mathematical flavor, and includes several concepts relatively uncommon in programming language design.

The text also discusses an implementation on the IBM Personal Computer of Mini-Natural, a subset of Natural, and presents examples of programs written in Mini-Natural.

Evolution Plots Of Software Metrics From A Program Construction Experiment (Summer-83) (Thesis), Andrew Shenq-Yen Want

Department of Computer Science Technical Reports

No abstract provided.

Color Computer Graphics As Applied To Introductory Calculus Instruction, Kathy B. Windhorst, Ralph E. Lee

Computer Science Technical Reports

The use of computer graphics to support and enhance the presentation of introductory calculus concepts is described.

Computer graphics provides more accurate graph sketching, consistent presentations and the ability to develop mathematical models incrementally. The addition of extensive use of color aids even more, adding contrast, color keying, dimensionality, and interest to an illustration.

Ten lessons have been designed, developed, and evaluated. They employ a set of subroutines which interface to the NBC APC microcomputer graphics software. These lessons as developed and evaluated may be used interactively in the classroom or by individuals, or noninteractively in the classroom by the …

Simulated Performance Of A Reduction-Based Multiprocessing System, Robert M. Keller, Frank C. H. Lin

All HMC Faculty Publications and Research

Multiprocessing systems have the potential for increasing system speed over what is now offered by device technology. They must provide the means of generating work for the processors, getting the work to processors, and coherently collecting the results from the processors. For most applications, they should also ensure the repeatability of behavior, i.e., determinacy, speed-independence, or elimination of "critical races." Determinacy can be destroyed, for example, by permitting-in separate, concurrent processes statements such as "x: = x + 1" and "if x = 0 then… else…", which share a common variable. Here, there may be a critical race, in that …

A Focus Of Attention Algorithm For Expert Systems, Kevin W. Whiting, Arlan R. Dekock, John Bruce Prater

Computer Science Technical Reports

This research is primarily concerned with increasing the performance of expert systems. A refined focus of attention strategy and its affect on performance are discussed. Early expert systems used a brute force approach to process the knowledge base. Each production rule in the knowledge base was evaluated each cycle. More recently, processing efficiency has been increased by focusing the attention of the inference engine on a subset of the rules by "filtering" for further testing, only rules that could possibly fire given the current content of the context base. Focus of attention as developed in this research increases performance over …