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 62521 - 62550 of 63009

Full-Text Articles in Entire DC Network

A Tale Of Two Islands (A Fable), Peter J. Denning Jun 1980

A Tale Of Two Islands (A Fable), Peter J. Denning

Department of Computer Science Technical Reports

No abstract provided.


High Order Methods For Elliptic Partial Differential Equations With Singularities, Elias N. Houstis, John R. Rice Jun 1980

High Order Methods For Elliptic Partial Differential Equations With Singularities, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Effects Of Changes In Surface Water Regime And/Or Land Use On The Vertical Distribution Of Water Available For Wetland Vegetation: Dynamic Model Of The Zone Of Aeration (Appendix To Part 1 Of Completion Report For Project A-023-Ark), Robert N. Maccallum, R. A. Sims Jun 1980

Effects Of Changes In Surface Water Regime And/Or Land Use On The Vertical Distribution Of Water Available For Wetland Vegetation: Dynamic Model Of The Zone Of Aeration (Appendix To Part 1 Of Completion Report For Project A-023-Ark), Robert N. Maccallum, R. A. Sims

Arkansas Water Resources Center Technical Reports

Appendix to Part 1 of Completion Report for Project A-023-ARK


Computing Cyclic List Structures, F. Lockwood Morris, Jennifer Schwarz Jun 1980

Computing Cyclic List Structures, F. Lockwood Morris, Jennifer Schwarz

Electrical Engineering and Computer Science - Technical Reports

It is argued that list structures containing cycles are useful and unobjectionable Lisp entities. If this is so, it is desirable to have a means of computing them less foreign to the equational-definition style characteristic of Lisp than are the list-structure-altering primitives rplaca and rplacd. A notion is developed of a reasonable system of mutually recursive equations, guaranteed to have a unique solution in list structures. The notion is given in terms of the computations invoked by the equations, without reference to the forms of expressions appearing in them. A variety of programming examples are presented, including a curious implementation …


Principles, Preferences And Ideals For Computer Arithmetic, Thomas E. Hull, Christian H. Reinsch, John R. Rice Jun 1980

Principles, Preferences And Ideals For Computer Arithmetic, Thomas E. Hull, Christian H. Reinsch, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Principles Of Program Design Induced From Experience With Small, Public Programs, Douglas E. Comer Apr 1980

Principles Of Program Design Induced From Experience With Small, Public Programs, Douglas E. Comer

Department of Computer Science Technical Reports

No abstract provided.


Operating Systems Articles, Peter J. Denning, Dorothy E. Denning Apr 1980

Operating Systems Articles, Peter J. Denning, Dorothy E. Denning

Department of Computer Science Technical Reports

No abstract provided.


A Critique Of The Foundations Of Hoare-Style Programming Logics, Michael O'Donnell Apr 1980

A Critique Of The Foundations Of Hoare-Style Programming Logics, Michael O'Donnell

Department of Computer Science Technical Reports

No abstract provided.


A Dimensionality Reduction Algorithm For The Karhunen Loeve Transform, Salomi T. Charalambous Apr 1980

A Dimensionality Reduction Algorithm For The Karhunen Loeve Transform, Salomi T. Charalambous

Computational Modeling & Simulation Engineering Theses & Dissertations

The Karhunen Loeve Transform has conclusively been shown to be the optimum data compression algorithm for signals belonging to the same second order stationary process. Consequently, researchers have been searching for a fast implementation for the transform. Fast imple­mentation methods similar to those developed for other orthogonal transforms are generally not applicable to the Karhunen Loeve Transform (KLT). Also, since the basis vectors composing the transformation matrix of the KLT are the eigenvectors of the covariance matrix of the input process, they must be computed first. The research re­ ported here is an attempt to reduce the dimensionality of the …


Experience With Transporting Pascal To An Interactive Environment, Douglas E. Comer, John Garney Apr 1980

Experience With Transporting Pascal To An Interactive Environment, Douglas E. Comer, John Garney

Department of Computer Science Technical Reports

No abstract provided.


Operational Analysis Based On Minimal Information: A Hypothetical Case Study, Herb Schwetman Mar 1980

Operational Analysis Based On Minimal Information: A Hypothetical Case Study, Herb Schwetman

Department of Computer Science Technical Reports

No abstract provided.


Programming With Recursion, Dirk Siefkes Feb 1980

Programming With Recursion, Dirk Siefkes

Department of Computer Science Technical Reports

No abstract provided.


Low Contention Semaphores And Ready Lists, Peter J. Denning, T. Don Dennis, Jeffrey Brumfield Feb 1980

Low Contention Semaphores And Ready Lists, Peter J. Denning, T. Don Dennis, Jeffrey Brumfield

Department of Computer Science Technical Reports

No abstract provided.


Using The Purdue Procsy Terminal System (Fortran), Bob Brown Jan 1980

Using The Purdue Procsy Terminal System (Fortran), Bob Brown

Department of Computer Science Technical Reports

No abstract provided.


Using The Purdue Procsy Terminal System (Pascal), Bob Brown Jan 1980

Using The Purdue Procsy Terminal System (Pascal), Bob Brown

Department of Computer Science Technical Reports

No abstract provided.


An Information Theoretic Approach To The Construction Of Efficient Decision Trees, Jaime M. De Faria, Carlos R.P. Hartmann, Carl L. Gerberich, Pramod Varshney Jan 1980

An Information Theoretic Approach To The Construction Of Efficient Decision Trees, Jaime M. De Faria, Carlos R.P. Hartmann, Carl L. Gerberich, Pramod Varshney

Electrical Engineering and Computer Science - Technical Reports

This paper treats the problem of construction of efficient decision trees. Construction of optimal decision trees is an NP-complete problem and, therefore, a heuristic approach for the design of efficient decision trees is considered. The approach is based on information theoretic concepts and the proposed algorithm provides us with a simple procedure for the construction of near-optimal decision trees.


Comparative Schematology And Pebbling With Auxiliary Pushdowns, Nicholas J. Pippenger Jan 1980

Comparative Schematology And Pebbling With Auxiliary Pushdowns, Nicholas J. Pippenger

All HMC Faculty Publications and Research

This paper has three claims to interest. First, it combines comparative schematology with complexity theory. This combination is capable of distinguishing among Strong's “languages of maximal power,” a distinction not possible when comparative schematology is based on computability considerations alone, and it is capable of establishing exponential disparities in running times, a capability not currently possessed by complexity theory alone. Secondly, this paper inaugurates the study of pebbling with auxiliary pushdowns, which bears to plain pebbling the same relationship as Cook's study of space-bounded machines with auxiliary pushdowns bears to plain space-bounded machines. This extension of pebbling serves as the …


Design And Use Of A Computerized Test Generating Program, Edward Schaefer, Laurence A. Marschall Jan 1980

Design And Use Of A Computerized Test Generating Program, Edward Schaefer, Laurence A. Marschall

Physics and Astronomy Faculty Publications

An easy-to-use set of programs for the computerized generation of multiple-choice and easy examinations in an introductory astronomy course is described. The programs allow the user to establish files of test questions and to rapidly assemble printed copies of examinations suitable for photocopying. Written in ALGOL for a Burroughs B6700 computer, the programs can, in principle, be implemented on large mainframe computers or on microcomputers of a size increasingly available to physics departments. The advantages and costs of computerized test generation are discussed.


On The Evaluation Of Powers And Monomials, Nicholas Pippenger Jan 1980

On The Evaluation Of Powers And Monomials, Nicholas Pippenger

All HMC Faculty Publications and Research

Let $y_1 , \cdots ,y_p $ be monomials over the indeterminates $x_1 , \cdots ,x_q $. For every $y = (y_1 , \cdots ,y_p )$ there is some minimum number $L(y)$ of multiplications sufficient to compute $y_1 , \cdots ,y_p $ from $x_1 , \cdots ,x_q $ and the identity 1. Let $L(p,q,N)$ denote the maximum of $L(y)$ over all $y$ for which the exponent of any indeterminate in any monomial is at most $N$. We show that if $p = (N + 1^{o(q)} )$ and $q = (N + 1^{o(p)} )$, then $L(p,q,N) = \min \{ p,q\} \log N …


Nova University Graduate Education Module (Gem) Master's And Educational Specialist Degrees Computer Applications [No Date], Nova University Jan 1980

Nova University Graduate Education Module (Gem) Master's And Educational Specialist Degrees Computer Applications [No Date], Nova University

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

No abstract provided.


Economic Comparison Of Alternative Burley Tobacco Harvesting Practices By Computer, Thomas C. Bridges, Larry G. Wells, George A. Duncan, John N. Walker Jan 1980

Economic Comparison Of Alternative Burley Tobacco Harvesting Practices By Computer, Thomas C. Bridges, Larry G. Wells, George A. Duncan, John N. Walker

Biosystems and Agricultural Engineering Faculty Publications

The computer model CATCH (Computer Analysis of Tobacco Cutting and Housing) was developed to provide the individual tobacco producer with management information concerning alternative methods of harvesting burley tobacco. CATCH utilizes specific producer in-puts to analyze 24 alternative burley production systems and presents up to four economic rankings containing costs, equipment and labor for each system. The economic rankings aid the producer in decision making with regard to his own operation.


On Increasing Confidence In Confidence Intervals, Peter J. Denning Jan 1980

On Increasing Confidence In Confidence Intervals, Peter J. Denning

Department of Computer Science Technical Reports

No abstract provided.


Testing Network-Of-Queues Software, Herb Schwetman Jan 1980

Testing Network-Of-Queues Software, Herb Schwetman

Department of Computer Science Technical Reports

No abstract provided.


Independence Results In Computer Science, Deborah Joseph, Paul Young Jan 1980

Independence Results In Computer Science, Deborah Joseph, Paul Young

Department of Computer Science Technical Reports

No abstract provided.


Theft And Conspiracy In The Take-Grant Protection Model, Lawrence Snyder Jan 1980

Theft And Conspiracy In The Take-Grant Protection Model, Lawrence Snyder

Department of Computer Science Technical Reports

No abstract provided.


Models For Verifiers, Francine Berman Jan 1980

Models For Verifiers, Francine Berman

Department of Computer Science Technical Reports

No abstract provided.


The Power Of Parallelism Automatic Program Synthesis, Carl H. Smith Jan 1980

The Power Of Parallelism Automatic Program Synthesis, Carl H. Smith

Department of Computer Science Technical Reports

No abstract provided.


Is Mathematical Software A Legitimate Research Area?, John R. Rice Jan 1980

Is Mathematical Software A Legitimate Research Area?, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Implementing The Mean Value Algorithm For The Solution Of Queueing Network Models, Herb Schwetman Jan 1980

Implementing The Mean Value Algorithm For The Solution Of Queueing Network Models, Herb Schwetman

Department of Computer Science Technical Reports

No abstract provided.


Personal Key, Group Keys, And Master Keys, Dorothy E. Denning, Fred B. Schneider Jan 1980

Personal Key, Group Keys, And Master Keys, Dorothy E. Denning, Fred B. Schneider

Department of Computer Science Technical Reports

No abstract provided.