Digital Commons Network^™

Center For Computer Based Learning--Relational Data Base Management On Unix 1985, Nova University

College of Engineering and Computing Course Catalogs

The Center for Computer-Based Learning was formed in 1983 and began offering online programs in 1985. The publication date of this item is approximate and should be considered as published during the mid to late 1980s.

Center For Computer Based Learning--Statistics For The Professional 1985, Nova University

College of Engineering and Computing Course Catalogs

The Center for Computer-Based Learning was formed in 1983 and began offering online programs in 1985. The publication date of this item is approximate and should be considered as published during the mid to late 1980s.

Doctor Of Arts In Information Systems, Nova University

College of Engineering and Computing Course Catalogs

The Center for Computer-Based Learning was formed in 1983 and began offering online programs in 1985. The publication date of this item is approximate and should be considered as published during the mid to late 1980s.

Information Sciences A Computer-Based Course Unix 1985, Nova University

College of Engineering and Computing Course Catalogs

No abstract provided.

Graduate Bulletin, 1985-1987 (1985), Moorhead State University

Graduate Bulletins (Catalogs)

No abstract provided.

Nova University Doctor Of Education In Computer Education An Online Program For Professional Success [No Date], Nova University

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

No abstract provided.

The Role Of The Computer In Society Some Aspects Of Person-Machine Interaction, Robert Clarence Hallman

Theses and Dissertations (Comprehensive)

In Community Psychology, we assume that people at the grassroots can learn to help themselves if they are offered the means of understanding a problem and helped to discover the strategies needed to resolve it. Micro-computer technology is currently at a cultural crossroads: a technology in search of new applications. To date, research and concerns around the role of the computer in society have taken the macro view, being predominantly sociologically, politically, and economically oriented. The purpose of the present study was to bring these issues to the individual level and to examine some variables at the person-computer interface. In …

A Parallel Branch And Bound Algorithm For Integer Linear Programming Models, Rochelle L. Boehning

Doctoral Dissertations

"A parallel branch and bound algorithm is developed for use with MIMD computers to study the efficiency of parallel processors on general integer linear programming problems. The Haldi and IBM test problems and a System Design model are used in the implementation of the algorithm. Initially the algorithm solves the Haldi and IBM test problems on a single processor computer which simulates a multiple processor computer. The algorithm is then implemented on the Denelcor HEP multiprocessor using two of the IBM problems to compare the results of the simulation to the results using an MIMD computer. Finally the algorithm is …

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 …

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.

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

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.

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

Faculty Publications

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 …

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

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 …

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 …

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 …

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

Department of Computer Science Technical Reports

No abstract provided.

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 …

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

Department of Computer Science Technical Reports

No abstract provided.

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

Department of Computer Science Technical Reports

No abstract provided.