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

Physical Sciences and Mathematics Commons™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 57631 - 57660 of 57897

Full-Text Articles in Physical Sciences and Mathematics

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

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

Department of Computer Science Technical Reports

No abstract provided.

Go to article

On The Derivation Of Lattice Structured Information Flow Policies, Dorothy E. Denning, Peter J. Denning, G. Scott Graham Mar 1976

On The Derivation Of Lattice Structured Information Flow Policies, Dorothy E. Denning, Peter J. Denning, G. Scott Graham

Department of Computer Science Technical Reports

No abstract provided.

Go to article

System Analysis Perspectives, Thomas I. M. Ho Mar 1976

System Analysis Perspectives, Thomas I. M. Ho

Department of Computer Science Technical Reports

No abstract provided.

Go to article

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

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

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Weak Type Multipliers For Hankel Transforms, William C. Connett, Alan L. Schwartz Feb 1976

Weak Type Multipliers For Hankel Transforms, William C. Connett, Alan L. Schwartz

UMSL Emeritus

The main result of this paper is that weak type multiplier theorems for Jacobi expansions yield weak type multiplier theorems for Hankel transforms.

In recent papers the authors studied multiplier theorems for ultraspherical and Jacobi expansions. An interesting paper of Igari suggested a new approach to multiplier theorems that used asymptotics instead of the elaborate machinery used earlier.

This paper extends the method of Igari to give the first weak type multiplier theorem for Hankel transforms. This extension is important in itself and because this method together with the authors’ results for Jacobi multipliers will generalize to the “radial” functions …

Go to article

Facility Costs Of Centralized Grain Storage Systems Utilizing Computer Design, Otto J. Loewer Jr., Thomas C. Bridges, Douglas G. Overhults Jan 1976

Facility Costs Of Centralized Grain Storage Systems Utilizing Computer Design, Otto J. Loewer Jr., Thomas C. Bridges, Douglas G. Overhults

Biosystems and Agricultural Engineering Faculty Publications

The item considered most often when estimating the cost of a grain storage facility is capacity. Of equal or greater importance is daily harvest rate. Other important considerations include drying method, materials handling equipment, energy cost, facility arrangement, labor requirements, grain quality and management ability. Only through a comparison of facilities which offer similar capacity, capability and convenience can the purchaser obtain his best system.

Go to article

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

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.

Go to article

Terminal Talk - The Wofford Connection - January 1976, Wofford College Computer Center Jan 1976

Terminal Talk - The Wofford Connection - January 1976, Wofford College Computer Center

Terminal Talk

No abstract provided.

Go to article

The Definition Of Programming Languages, J. A. Robinson Jan 1976

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 …

Go to article

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

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

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Using A Programmable Calculator To Introduce Fundamental Concepts Of Assembly Language Programming, H. D. Schwetman Dec 1975

Using A Programmable Calculator To Introduce Fundamental Concepts Of Assembly Language Programming, H. D. Schwetman

Department of Computer Science Technical Reports

No abstract provided.

Go to article

The Dependence Of Operating System Size Upon Allocatable Resources, Atilla Elci Dec 1975

The Dependence Of Operating System Size Upon Allocatable Resources, Atilla Elci

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Computer Manpower In The United States - Supply And Demand, John Wesley Hamblen Dec 1975

Computer Manpower In The United States - Supply And Demand, John Wesley Hamblen

Computer Science Faculty Research & Creative Works

At a time when new departments of computer science, data processing, information science, information systems, etc. are being created and existing departments are trying to grow and compete with more established disciplines for scarce resources, it seems imperative that we attempt to keep abreast of the needs of industry and government for the graduates of these programs. This need must be monitored and matched against the production of graduates at all appropriate levels. The author has assembled extensive data on the latter over the past eight years while at the Southern Regional Education Board in Atlanta, GA (USA) during the …

Go to article

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

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

Masters Theses

No abstract provided.

Go to article

The Hodie Method: A Brief Introduction With Summary Of Computational Properties, Robert E. Lynch, John R. Rice Nov 1975

The Hodie Method: A Brief Introduction With Summary Of Computational Properties, Robert E. Lynch, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Go to article

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

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.

Go to article

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

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

Department of Computer Science Technical Reports

No abstract provided.

Go to article

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.

Go to article

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.

Go to article

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.

Go to article

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.

Go to article

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.

Go to article

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.

Go to article

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.

Go to article

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.

Go to article

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.

Go to article

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.

Go to article

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.

Go to article

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.

Go to article

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.

Go to article

First Prev Next Last