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 63601 - 63630 of 63829

Full-Text Articles in Entire DC Network

Remarks On Piecewise Polynomial Approximation, John R. Rice Sep 1975

Remarks On Piecewise Polynomial Approximation, 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 Sep 1975

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

Department of Computer Science Technical Reports

No abstract provided.


Reorganization Points For File Designs With Nonlinear Processing Costs, K. Sundar Das, T. J. Teorey, S. B. Yao Sep 1975

Reorganization Points For File Designs With Nonlinear Processing Costs, K. Sundar Das, T. J. Teorey, S. B. Yao

Department of Computer Science Technical Reports

No abstract provided.


Terminal Talk - The Wofford Connection - September 1975, Wofford College Computer Center Sep 1975

Terminal Talk - The Wofford Connection - September 1975, Wofford College Computer Center

Terminal Talk

No abstract provided.


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

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.


Two Models For Combinatory Logic, Luis E. Sanchis Jul 1975

Two Models For Combinatory Logic, Luis E. Sanchis

Electrical Engineering and Computer Science - Technical Reports

We consider in this paper two models of combinatoric logic in which the domain is the same : P(N) the power set of N = the set of non negative integers.


Some Insights Into Deterministic Scheduling Problems Involving Multiple Resources And Preemption, K. Omahen Jul 1975

Some Insights Into Deterministic Scheduling Problems Involving Multiple Resources And Preemption, K. Omahen

Department of Computer Science Technical Reports

No abstract provided.


An Endogenous Priority Model For Load Control In Combined Batch—Interactive Computer Systems, Carl E. Landwehr Jul 1975

An Endogenous Priority Model For Load Control In Combined Batch—Interactive Computer Systems, Carl E. Landwehr

Department of Computer Science Technical Reports

No abstract provided.


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

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 May 1975

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.


A Software Physics Analysis Of Akiyama's Debugging Data, Yasao Funami, M. H. Halstead May 1975

A Software Physics Analysis Of Akiyama's Debugging Data, Yasao Funami, M. H. Halstead

Department of Computer Science Technical Reports

No abstract provided.


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

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

Department of Computer Science Technical Reports

No abstract provided.


Some Distribution-Free Properties Of Throughput And Response Time, Peter J. Denning, Kevin C. Kahn May 1975

Some Distribution-Free Properties Of Throughput And Response Time, Peter J. Denning, Kevin C. Kahn

Department of Computer Science Technical Reports

No abstract provided.


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

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

Department of Computer Science Technical Reports

No abstract provided.


Capacity Bounds For Multi-Resource Queues, K. J. Omahen Mar 1975

Capacity Bounds For Multi-Resource Queues, K. J. Omahen

Department of Computer Science Technical Reports

No abstract provided.


Equational Logic And Equational Theories Of Algebras, Don Pigozzi Mar 1975

Equational Logic And Equational Theories Of Algebras, Don Pigozzi

Department of Computer Science Technical Reports

No abstract provided.


"Large Systems", Richard Ernest Bellman Feb 1975

"Large Systems", Richard Ernest Bellman

Special Collections: Oregon Public Speakers

No abstract provided.


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

"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.


"The Curious Behavior Of Complex Systems: Lessons From Biology", Heinz Von Foerster Feb 1975

"The Curious Behavior Of Complex Systems: Lessons From Biology", Heinz Von Foerster

Special Collections: Oregon Public Speakers

No abstract provided.


"Education For Managing Complexity", Harold A. Linstone Feb 1975

"Education For Managing Complexity", Harold A. Linstone

Special Collections: Oregon Public Speakers

No abstract provided.


"A Philosophy For Complexity", Charles West Churchman Feb 1975

"A Philosophy For Complexity", Charles West Churchman

Special Collections: Oregon Public Speakers

No abstract provided.


Terminal Talk - The Wofford Connection - February 1975, Wofford College Computer Center Feb 1975

Terminal Talk - The Wofford Connection - February 1975, Wofford College Computer Center

Terminal Talk

No abstract provided.


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

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 Jan 1975

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 Jan 1975

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 Jan 1975

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 Jan 1975

Optimization Among Provably Equivalent Programs, Paul Young

Department of Computer Science Technical Reports

No abstract provided.


The Algorithm Selection Problem, John R. Rice Jan 1975

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 Jan 1975

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 Jan 1975

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

Department of Computer Science Technical Reports

No abstract provided.