Digital Commons Network^™

The Quick Instructional System, Sharon Fletcher

Department of Computer Science Technical Reports

No abstract provided.

Experiments With Computer Aided Self-Paced Instruction For Mathematical Programming Education, Thomas Ho, A. Ravindran, Arthur Sinensky

Department of Computer Science Technical Reports

No abstract provided.

A Methodology For The Determination And Communication Of Requirements For An Information Processing System, Carl Allen Singer

Open Access Dissertations

A Requirements Statement Methodology is developed and coupled with a solution to the database design problem. The need for the Requirements Statement Methodology is discussed with the viewpoint of management texts and systems design guidelines. The methodology is developed using forms, computer generated forms, a data dictionary and interactive dialogue. A detailed explanation of PSL (the Problem Statement Language) and PSA (Problem Statement Analyzer) in the context of the Requirements Statement Methodology is presented. A formal discussion of data base design, specifically record and set design, appears. A theoretical model to solve record design is developed and a hueristic and …

Statistical Computing - The Vanguard Of The Future Of Education, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

An Efficient Dft Algorithm Using The Walsh Transform, Albert P. Gerheim

Electrical & Computer Engineering Theses & Dissertations

The matrix transformation relating the sequency and frequency domains is derived. It is shown that these­ frequency-to-frequency conversion can be performed via a computationally efficient sparse matrix algorithm. The sequency-to-frequency algorithm can be used with a fast Hadamard transform to implement a discrete Fourier trans­ form. The efficiencies of this combined algorithm and a radix-two fast Fourier transform are compared.

The algorithm is applied to the sequency domain de­ sign of a Wiener digital filter. Improved computational efficiencies are achieved relative to the procedure de­veloped by Kahveci and Hall (9).

Certification Of Programs For Secure Information Flow, Dorothy E. Denning, Peter J. Denning

Department of Computer Science Technical Reports

No abstract provided.

Generalized Working Sets For Segment Reference Strings, Peter J. Denning, Donald R. Slutz

Department of Computer Science Technical Reports

No abstract provided.

The Definition Of Programming Languages, J. A. Robinson

Electrical Engineering and Computer Science - Technical Reports

There is no need to argue in favor of concise, clear, complete, consistent, descriptions of programming languages, nor to recite the cost in time, energy, money, and effectiveness which is incurred when a description falls short of these standards. Reliable, high-quality computer programming is impossible without a clear and precise understanding of the language in which the programs are written—this being true quite independently of the merits of a language as a language. In this study we tried to discover the current state of the methodology of definition of programming languages. We sought to separate the question (as far as …

Computer Layout And Design Of Grain Storage Facilities, Otto J. Loewer Jr., Thomas C. Bridges, Douglas G. Overhults

Biosystems and Agricultural Engineering Faculty Publications

No abstract provided.

Algorithmic Progress In Solving Partial Differential Equations, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Use Of Optical Character Recognition In The Invoice Processing System Of The Michigan Medicaid Program, Richard F. Burns

Masters Theses

No abstract provided.

An Experiment Comparing Fortran Programming Times With The Software Physics Hypothesis, R. D. Gordon, M. H. Halstead

Department of Computer Science Technical Reports

No abstract provided.

Algorithm - Adapt, Adaptive Smooth Curve Fitting, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Selection Of File Organization Using An Analytic Model, S. B. Yao, A. G. Merten

Department of Computer Science Technical Reports

No abstract provided.

An Optimum Symbol-By Symbol Decoding Rule For Linear Codes, Carlos R.P. Hartmann, Luther D. Rudolph

Electrical Engineering and Computer Science - Technical Reports

A decoding rule is presented which minimizes the probability of symbol error over a time-discrete memoryless channel for any linear error-correcting code when the code words are equiprobable. The complexity of this rule varies inversely with code rate, making the technique particularly attractive to high rate codes. Examples are given for both block and convolutional codes.

The Computation And Use Of Optimal Paging Curves, Peter J. Denning

Department of Computer Science Technical Reports

No abstract provided.

Some Results On The Weight Structure Of Cyclic Codes Of Composite Length, Carlos R.P. Hartmann, T. Y. Hwang

Electrical Engineering and Computer Science - Technical Reports

In this work we investigate the weight structure of cyclic codes of composite length n = n1n2, where n1 and n2 are relatively prime. The actual minimum distances of some classes of binary cyclic codes of composite length are derived. For other classes new lower bounds on the minimum distance are obtained. These new lower bounds improve on the BCH bound for a considerable number of binary cyclic codes.

Toward A Theoretical Basis For Estimating Programming Efforts, M. H. Halstead

Department of Computer Science Technical Reports

No abstract provided.

On The Computational Complexity Of Approximation Operators Ii, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

"The Ore Plan: A Practical Application Of The Systems Approach To Solid Waste Management In Oregon", Richard Duncan

Special Collections: Oregon Public Speakers

No abstract provided.

"A Philosophy For Complexity", Charles West Churchman

Special Collections: Oregon Public Speakers

No abstract provided.

Toacs : An Interactive Computer Graphic Display Model Of A Theaterwide On-Line Air Combat Simulation, Herman William Blick

Masters Theses

"On-line interactive graphics is a very effective research tool for examining the concepts, components and design parameters of theater warfare involving multiple aircraft. The aim of the present research is to design an on-line computer system which utilizes interactive graphic displays to develop a dynamic, two-sided mathematical model of theaterwide tactical fighter combat operations. The model, called TOACS, is very useful in simulating and evaluating airborne defense systems and the problems common to this type of simulation — such as the formulation of battle strategy for the commitment and guidance of interceptors against threat aircraft -- as well as those …

Optimization Among Provably Equivalent Programs, Paul Young

Department of Computer Science Technical Reports

No abstract provided.

Corrections To Some Errors In A Version Of Tsp: (Time Series Processor), Robert E. Lynch

Department of Computer Science Technical Reports

No abstract provided.

Skolem Rings And Their Varieties, J. R. Buchi, T. M. Owens

Department of Computer Science Technical Reports

No abstract provided.

Modeling And Performance Evaluation Of Physical Data Base Structures, S. B. Yao

Department of Computer Science Technical Reports

No abstract provided.

Optimal Compression Of Parsing Tables In A Parsergenerating System, V. B. Schneider, M. D. Mickunas

Department of Computer Science Technical Reports

No abstract provided.

Characterizing The Orders Changes By Program Translators, Margaret Shay, Paul Young

Department of Computer Science Technical Reports

No abstract provided.

Beginners Guide To Procsy, C. Anderson, K. Apeland, L. Breisacher, C. Canfield, T. Reiter

Department of Computer Science Technical Reports

No abstract provided.

Speedup In Parallel Algorithms For Adaptive Quadratures, James M. Lemme, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.