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 63571 - 63600 of 63772

Full-Text Articles in Entire DC Network

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.


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

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

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

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


Computational Models Of Learning., Kenneth Jesse Marse Jan 1975

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

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


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 …


Toacs : An Interactive Computer Graphic Display Model Of A Theaterwide On-Line Air Combat Simulation, Herman William Blick Jan 1975

Toacs : An Interactive Computer Graphic Display Model Of A Theaterwide On-Line Air Combat Simulation, Herman William Blick

Masters Theses

"On-line interactive graphics is a very effective research tool for examining the concepts, components and design parameters of theater warfare involving multiple aircraft. The aim of the present research is to design an on-line computer system which utilizes interactive graphic displays to develop a dynamic, two-sided mathematical model of theaterwide tactical fighter combat operations. The model, called TOACS, is very useful in simulating and evaluating airborne defense systems and the problems common to this type of simulation — such as the formulation of battle strategy for the commitment and guidance of interceptors against threat aircraft -- as well as those …


A Study Of The Effects Of Numerical Error Propagated Through Several Independent Stages: An Electron Optics Simulation., William Donald Webster Jan 1975

A Study Of The Effects Of Numerical Error Propagated Through Several Independent Stages: An Electron Optics Simulation., William Donald Webster

Masters Theses

"Presented is a study, combining numerical methods in a series of stages whereby each stage provides input data to its successor. A model problem from electron optics ii is studied in which a potential field is computed, gradient vectors calculated, and trajectory equations solved. Error effects in each stage is assessed for its influence on the final results of the numerical process mimicking the model problem. Error analysis is given in Appendix A. Finally, the superiority of Spline approximations for estimating derivatives is demonstrated"-- Abstract, p. ii


Using Ibm's Information Management System To Implement A Relational Data Base, Melvin Arthur Rushton Jan 1975

Using Ibm's Information Management System To Implement A Relational Data Base, Melvin Arthur Rushton

Masters Theses

"A relational model of data has been the topic of several papers which deal with the question of the underlying design philosophy of data base systems. E. F. Codd, C. J. Date, and others have discussed the application of relation theory to formatted data, the objectives of such an approach, normalization of relations, and languages for manipulating the model (data sublanguages). Few papers have delt with storage constructs or access techniques for a relational data base. Indeed, it was not necessary that they do so, for the user of such a system is only concerned with the information available in …


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.