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

Digital Commons Network

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 62251 - 62280 of 63017

Full-Text Articles in Entire DC Network

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

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 Sep 1984

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 Aug 1984

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 Aug 1984

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 Aug 1984

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 Aug 1984

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 Aug 1984

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 Aug 1984

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 Aug 1984

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 Jul 1984

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 Jul 1984

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 Jul 1984

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 …


Ciegen: A System For Testing Knowledge Base Compilation Heuristics On A Microcomputer, Jayne D. Ward, Billy E. Gillett, Arlan R. Dekock Jul 1984

Ciegen: A System For Testing Knowledge Base Compilation Heuristics On A Microcomputer, Jayne D. Ward, Billy E. Gillett, Arlan R. Dekock

Computer Science Technical Reports

The expert system has proven itself to be a valuable aid in diagnosing and treating problems in domains requiring expertise. The commercial world has been alerted to this fact and the thrust is to make the expert system portable and available on small computers.

The goal of this research has been to lay the groundwork for a domain independent expert system builder on a microcomputer. The result of this effort was CIEGEN, a system consisting of a rule compiler, inference engine, and rule generator developed on the IBM PC. It is domain independent, responsible for transforming a knowledge base of …


Suboptimal Algorithms For Improvement Of Pipeline Through Insertion Of Delays, Sukhamoy Som Jul 1984

Suboptimal Algorithms For Improvement Of Pipeline Through Insertion Of Delays, Sukhamoy Som

Electrical & Computer Engineering Theses & Dissertations

Pipelining is now widely used in the design of high speed processors in order to overcome the intrinsic speed limitations imposed by the technology. For a good performance and avoidance of internal conflicts, the concurrent operations within different subunits of a pipeline architecture should be properly scheduled This scheduling problem is known to be intrinsically difficult" and a member of the "NP complete class of problems. The aim of this thesis is to develop heuristic suboptimal algorithms whose execution time is a polynomial function of the number of items to be scheduled. Insertion of delay is used as a basic …


Block Encoding Of Speech Spectral Principal Components, James R. Holland Jr. Jul 1984

Block Encoding Of Speech Spectral Principal Components, James R. Holland Jr.

Electrical & Computer Engineering Theses & Dissertations

A Karhunen-Loeve series expansion was used to block encode speech spectral principal components as a function of time. Each of ten principal components was first obtained as a linear combination of 2© speech spectral band energies. Using a fixed block length of 10 frames (0.128 s), the K-L basis vectors were computed separately for various speakers for each principal component. In all cases the resulting basis vectors were essentially a set of discrete cosine basis vectors. Synthesis of speech from the block encoded parameters showed that very little information is lost with up to 70% data reduction. The block encoding …


Dartmouth-Smalltalk: An Exercise In Implementation, Joon Sup Lee Jun 1984

Dartmouth-Smalltalk: An Exercise In Implementation, Joon Sup Lee

Computer Science Technical Reports

This report discusses a preliminary implementation of the Smalltalk-80 virtual machine for Vax/Unix.


Report Of The Workshop On Supercomputers And Symbolic Computation, Dennis S. Arnon Jun 1984

Report Of The Workshop On Supercomputers And Symbolic Computation, Dennis S. Arnon

Department of Computer Science Technical Reports

No abstract provided.


An Image Processing Software Package For The Laser Scanning Phase Modulation Microscope, William J. Murray Jun 1984

An Image Processing Software Package For The Laser Scanning Phase Modulation Microscope, William J. Murray

Computer Science Technical Reports

This thesis documents the most recent effort to develop a user-friendly image processing software package for the Laser Scanning Phase Modulation Microscope (LSPMM). The LSPMM is composed of three integrated subsystems, the Laser Scanning (LS) system, the Phase Modulation (PM) system, and Digital Image Acquisition (DIA) system. Under the control of the image processing software, the DIA system can receive and store the digital image data, display the image on a monochrome monitor, and process the image to provide the microscopist with quantitative information regarding the image. The implementation of this image processing software package required the specification of a …


A Graphical Representation Of An Executing Program, Sherry A. Lile, Arlan R. Dekock, John Bruce Prater, Darrow Finch Dawson Jun 1984

A Graphical Representation Of An Executing Program, Sherry A. Lile, Arlan R. Dekock, John Bruce Prater, Darrow Finch Dawson

Computer Science Technical Reports

This thesis describes the rationale for a computer program used as a teaching aid, as well as, the design, development, and implementation of that computer program. The program is a prototype that displays, line by line, a graphical depiction of a BASIC program being executed. Icons are used to represent FOR-NEXT loops, the contents of variables, I/O, and other programming elements. The internal logic associated with the Arithmetic-Logic Unit is also represented. The purpose is to produce an environment where the student may visualize the processes occurring in memory by viewing a symbolic portrayal of an executing program. The example …


Expressive Power In First Order Topology, Paul Bankston Jun 1984

Expressive Power In First Order Topology, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

A first order representation (f.o.r.) in topology is an assignment of finitary relational structures of the same type to topological spaces in such a way that homeomorphic spaces get sent to isomorphic structures. We first define the notions "one f.o.r. is at least as expressive as another relative to a class of spaces" and "one class of spaces is definable in another relative to an f.o.r.", and prove some general statements. Following this we compare some well-known classes of spaces and first order representations. A principal result is that if X and Y are two Tichonov spaces whose posets of …


Modeling A Token Ring With Non-Exhaustive Service, André B. Bondi May 1984

Modeling A Token Ring With Non-Exhaustive Service, André B. Bondi

Department of Computer Science Technical Reports

No abstract provided.


Modeling The Effect Of Local Area Network Contention On The Performance Of Host Computers, André B. Bondi May 1984

Modeling The Effect Of Local Area Network Contention On The Performance Of Host Computers, André B. Bondi

Department of Computer Science Technical Reports

No abstract provided.


Towards A Distributed File System, Walter F. Tichy, Zuwang Ruan May 1984

Towards A Distributed File System, Walter F. Tichy, Zuwang Ruan

Department of Computer Science Technical Reports

No abstract provided.


Vector C—A Vector Processing Language, Kuo-Cheng Li, Herb Schwetman May 1984

Vector C—A Vector Processing Language, Kuo-Cheng Li, Herb Schwetman

Department of Computer Science Technical Reports

No abstract provided.


The Optimal Trajectory Modelling Of Robot Manipulators, Mary Claire Miller, Chung You Ho, Arlan R. Dekock May 1984

The Optimal Trajectory Modelling Of Robot Manipulators, Mary Claire Miller, Chung You Ho, Arlan R. Dekock

Computer Science Technical Reports

Greater robot capability can be achieved through the use of robot manipulator control systems. Crucial to the success of these control systems is the optimal trajectory modelling of the path traced by the end- effector. To create this optimal path the utilization of B-Spline curve functions will be investigated, and compared to Cubic Spline curve functions.


An Experimental Study Of The Effects Of Modularity On Resource Consumption In Software Development, Alan D. Christiansen, Arlan R. Dekock, John Bruce Prater May 1984

An Experimental Study Of The Effects Of Modularity On Resource Consumption In Software Development, Alan D. Christiansen, Arlan R. Dekock, John Bruce Prater

Computer Science Technical Reports

Many authors have encouraged the use of modular programming techniques in software development. In fact, there is almost total agreement within industrial and academic circles that modularity is a desirable feature of any software package. Unfortunately, the desirability of modular design is almost always voiced without support from experimental evidence.

This paper consists of an experiment comparing the resource consumption of programmers based on the modularity practices employed during the design and programming phases of software development. The experiment tests the effectiveness of modularity in reducing psychological complexity of software.

The results of the research show that in some cases …


Performance Bounds For Multiclass Models, Teemu Kerola, Herbert D. Schwetman May 1984

Performance Bounds For Multiclass Models, Teemu Kerola, Herbert D. Schwetman

Department of Computer Science Technical Reports

No abstract provided.


Data Structures For On-Line Updating Of Minimum Spanning Trees, With Applications, Greg N. Frederickson May 1984

Data Structures For On-Line Updating Of Minimum Spanning Trees, With Applications, Greg N. Frederickson

Department of Computer Science Technical Reports

No abstract provided.


The Bluff Machine (Single Module Version), John T. Korb May 1984

The Bluff Machine (Single Module Version), John T. Korb

Department of Computer Science Technical Reports

No abstract provided.


Learning Computer Logic Architectures On Apple Ii System, Falah Reda Al-Saffar Apr 1984

Learning Computer Logic Architectures On Apple Ii System, Falah Reda Al-Saffar

Masters Theses

For this thesis seven computer-assisted instruction packages have been designed to illustrate the design of electronic circuits of gates , the logic of combinational and sequential circuits, and integrated and magnetic core memories.

The programs in these packages have been written in the Pascal computer language on an Apple II microcomputer and stored on a double-sided floppy disk.