Digital Commons Network^™

Decide : How Much Superphosphate, G A. Robertson, J. W. Bowden, N. J. Halse

Journal of the Department of Agriculture, Western Australia, Series 4

* A 400 per cent increase in ihe price of superphosphate has reduced the economic optimum rates of super for crops and pastures in 1975.

* Many factors, both biological and economic, must be taken into account in determining the rate of superphosphate to apply.

• DECIDE, a model developed by CSIRO and the Department of Agriculture, provides a formal system in which all these factors can be considered.

• DECIDE is based on the results of all research on superphosphate carried out in Western Australia. However, each farmer's own knowledge of his farm, the soils, crops and animals is …

Media Thefts Vs. An Electronic Security System: A Cost Comparison, Bonnie Jensen

Graduate Research Papers

The purpose of this research is to compare the costs of media losses in selected Iowa high schools with the cost of an electronic security system; to survey whether media specialists feel than an electronic security system might improve services and rapport by allowing freer accessibility to media without fear of heavy theft.

System Reliability: Exact Bayesian Intervals Compared With Fiducial Intervals, Kathryn P. Berkbigler, James K. Byers

Computer Science Faculty Research & Creative Works

This paper compares numerically two different, widely used lower limit estimates for the reliability of a series system: Bayesian limits and fiducial limits. The fiducial limits are obtained by Monte Carlo simulation because of its simplicity and ease of computer programming. Subsystem failures are s-independent and exponentially distributed; life test data are available for estimating the failure rate of each system. Copyright © 1975 by The Institute of Electrical and Electronics Engineers, Inc.

On The Limits Of Text File Compression, V. Y. Shen, M. H. Halstead

Department of Computer Science Technical Reports

No abstract provided.

Optimization Among Provably Equivalent Programs, Paul Young

Department of Computer Science Technical Reports

No abstract provided.

The Algorithm Selection Problem, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Study Of Program Locality And Lifetime Functions, Peter J. Denning, Kevin C. Kahn

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.

Estimating Response Time For Auxiliary Memory Configurations With Multiple Movable-Head Disk Modules, K. Omahen

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.

The Essential Design Criterion For Computer Languages: Software Science, M. H. Halstead

Department of Computer Science Technical Reports

No abstract provided.

Collocation Methods For Linear Elliptic Problems, Elias N. Houstis

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.

An L=S Criterion For Optimal Multiprogramming, Peter J. Denning, Kevin C. Kahn

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.

Analysis & Applications Of The Delay Cycle For The M/M/C Queueing System, K. Omahen, V. Marathe

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.

Using The Methodology Of Natural Science To Understand Software, M. H. Halstead

Department of Computer Science Technical Reports

No abstract provided.

High Order Fast Elliptic Equation Solver, Elias N. Houstis, T. S. Papatheordorou

Department of Computer Science Technical Reports

No abstract provided.

The Difficulty Of Optimum Index Solution, Douglas E. Comer

Department of Computer Science Technical Reports

No abstract provided.

A Queueing Model For A Multiprocessor System With Partitioned Memory, K. Omahen, V. Marathe

Department of Computer Science Technical Reports

No abstract provided.

A Teaching Aid To Simulate The Requirements Statement Process, Thomas I. M. Ho, Benn Konsynski, J. F. Nunamaker

Department of Computer Science Technical Reports

No abstract provided.

Development, Evaluation & Selection Of Methods For Elliptic Partial Differential Equations, E. N. Hnoustis, Robert E. Lynch, T. S. Papatheodorou, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

One Address Computers Are Faster And Use Less Memory Space To Execute Arithmetic Assignment Statements, Victor Schneider, Bradford Wade

Department of Computer Science Technical Reports

No abstract provided.

A Model Of Data Structures Commonly Used In Programming Languages And Data Base Management Systems, William L. Honig

Computer Science: Faculty Publications and Other Works

This thesis claims that contemporary data structures can be understood and studied with an intelligible model which captures their essential differences and similarities and, further, that such a model is an appropriate basis for a top-down description method for data structures. To define the scope of the model, the data structures included in 21 programming languages and data base management systems have been tabulated. Each individual data structure is illustrated with an example drawn from a published paper or a working computer program. This mélange of data structures is divided into three classes (aggregates, associations , and files) and each …

An Algorithm For Finding All Isomorphisms Of Two Graphs, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

No abstract provided.

Computational Models Of Learning., Kenneth Jesse Marse

Masters Theses

"An investigation is made into the use of techniques which would normally be described as learning if encountered in a human being. A literature review of several subject areas including game-playing computer programs, automatic control systems, pattern recognition methods, and biological modeling is performed, with the purpose of extracting and examining those processes which exhibit learning. A general model of the type of learning most widely utilized in these areas is constructed and used to compare and contrast specific models which describe the learning techniques employed. Some specific models which do not exhibit learning as described by the general model …

An Analysis Of A Network Of Finite-Queue, Multiple-Server Facilities., Juanita Kaye Shukers Grau

Masters Theses

"An algorithm for listing all possible steady states and for generating the transition matrix for a series of finite-queue, multiple-server facilities is described. This algorithm is compared to a previously developed one. The new algorithm is better since it works for multiple servers and does not require an extra pseudo-facility. Using the list of states and the matrix generated by the new algorithm, exact steady state probabilities can be calculated. Then the probabilities can be used to obtain system statistics which cannot be calculated otherwise"-- Abstract, p. ii