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

Computer Sciences Commons

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

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 62821 - 62850 of 63010

Full-Text Articles in Computer Sciences

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.


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

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

Mathematics, Physics, and Computer Science Faculty Articles and Research

No abstract provided.


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

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 …


On The Benefactive Feature In Transitivity, Dale Ellen Gaucas Dec 1974

On The Benefactive Feature In Transitivity, Dale Ellen Gaucas

Electrical Engineering and Computer Science - Technical Reports

An elaboration on the transitivity system network introduced by M. A. K. Halliday is developed. This extension consists of a separate feature system network for the participant role of “beneficiary”. The formulation of the proposed grammar rules to conjoin this network and Halliday's is facilitated by building up the transitivity network to describe "systemically” and uniquely each type of benefactive and range clause presented by Halliday. Systemic descriptions of these clauses are given as examples throughout the discussion.


The Algorithm Selection Problem Iii - Approximation Theory Machinery, John R. Rice Dec 1974

The Algorithm Selection Problem Iii - Approximation Theory Machinery, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Tree Structures Construction Using Hit Ratios, S. B. Yao Nov 1974

Tree Structures Construction Using Hit Ratios, S. B. Yao

Department of Computer Science Technical Reports

No abstract provided.


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

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

Terminal Talk

No abstract provided.


Statistical Modelling Of Computer Systems: A Review, Amrit L. Goel, Anand M. Joglekar Sep 1974

Statistical Modelling Of Computer Systems: A Review, Amrit L. Goel, Anand M. Joglekar

Electrical Engineering and Computer Science - Technical Reports

This paper briefly reviews the data dependent statistical methods useful for computer systems modelling. The techniques are classified according to their applicability toward comparison, tuning and design of computer systems. A review of publications dealing with statistical modeling of computer systems is presented and a comprehensive bibliography is included to provide a useful source of reference toward the present and potential applications of statistical methods for computer system modelling.


A Measure Of Structural Complexity For Context-Free Grammars, D. A. Workman Sep 1974

A Measure Of Structural Complexity For Context-Free Grammars, D. A. Workman

Department of Computer Science Technical Reports

No abstract provided.


A Non-Procedural High-Level Language For Automated Design Of Application Systems, J. F. Nunamaker Sep 1974

A Non-Procedural High-Level Language For Automated Design Of Application Systems, J. F. Nunamaker

Department of Computer Science Technical Reports

No abstract provided.


Analysis Of Unsteady Flow Toward Artesian Wells By Three-Dimensional Finite Elements, Yang H. Huang, Shen-Jyh Wu Aug 1974

Analysis Of Unsteady Flow Toward Artesian Wells By Three-Dimensional Finite Elements, Yang H. Huang, Shen-Jyh Wu

KWRRI Research Reports

A three-dimensional finite element computer program was developed for analyzing unsteady flow toward artesian wells. The program is designed especially for determining the drawdown around an artesian well penetrating fully or partially a nonhomogeneous and anisotropic aquifer of irregular shape and cross section. It can also be used as a general program for aquifer simulation and evaluation. A major advantage of the program lies in the minimum amount of input data required. By assuming the top and bottom boundaries of the aquifer as two arbitrary planes, the aquifer will be divided into six- or eight-node elements, and their nodal coordinates …


Selectively Defined Subsystems, Dorothy E. Denning, Peter J. Denning, G. Scott Graham Jul 1974

Selectively Defined Subsystems, Dorothy E. Denning, Peter J. Denning, G. Scott Graham

Department of Computer Science Technical Reports

No abstract provided.


Requirements Statement Language Principles For Automatic Programming, Thomas I. M. Ho, J. F. Nunamaker Jul 1974

Requirements Statement Language Principles For Automatic Programming, Thomas I. M. Ho, J. F. Nunamaker

Department of Computer Science Technical Reports

No abstract provided.


Comments On A Linear Paging Model, Peter J. Denning Jul 1974

Comments On A Linear Paging Model, Peter J. Denning

Department of Computer Science Technical Reports

No abstract provided.


Adaptive Approximation, John R. Rice Jun 1974

Adaptive Approximation, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Multiprogrammed Memory Management, Peter J. Denning, G. Scott Graham Jun 1974

Multiprogrammed Memory Management, Peter J. Denning, G. Scott Graham

Department of Computer Science Technical Reports

No abstract provided.