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 20461 - 20490 of 20536

Full-Text Articles in Entire DC Network

A Software Science Analysis Of The Writing Of A Technical Paper, M. H. Halstead Aug 1977

A Software Science Analysis Of The Writing Of A Technical Paper, M. H. Halstead

Department of Computer Science Technical Reports

No abstract provided.


Potential Impacts Of Software Science On Software Life Cycle Management, M. H. Halstead Jul 1977

Potential Impacts Of Software Science On Software Life Cycle Management, M. H. Halstead

Department of Computer Science Technical Reports

No abstract provided.


A Quantitative Connection Between Computer Programs And Technical Prose, M. H. Halstead Apr 1977

A Quantitative Connection Between Computer Programs And Technical Prose, M. H. Halstead

Department of Computer Science Technical Reports

No abstract provided.


The Effect Of Numerical Integration In The Finite Element Approximation Of Hyperbolic Problems, Elias N. Houstis Apr 1977

The Effect Of Numerical Integration In The Finite Element Approximation Of Hyperbolic Problems, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.


Dual-Mode Sequential Logic For Function Independent Fault-Testing, Sumit Dasgupta, Carlos R.P. Hartmann, Luther D. Rudolph Mar 1977

Dual-Mode Sequential Logic For Function Independent Fault-Testing, Sumit Dasgupta, Carlos R.P. Hartmann, Luther D. Rudolph

Electrical Engineering and Computer Science - Technical Reports

This paper presents a method of using hardware redundancy to ease the problem of fault testing in sequential logic networks. Sequential logic networks are constructed using two kinds of dual-mode logic gates, one of which is specifically required to initialize a feedback loop to some logic value. Initially, it is shown that these networks can be tested for all single stuck-at-faults with six function-independent tests. Next, this method is generalized to detect large classes of multiple faults with six function-independent tests. In both cases, the network must have the proper number of extra inputs.


A Time- And Space-Efficient Garbage Compaction Algorithm, F. Lockwood Morris Feb 1977

A Time- And Space-Efficient Garbage Compaction Algorithm, F. Lockwood Morris

Electrical Engineering and Computer Science - Technical Reports

Given an area of storage containing scattered marked nodes, one may wish to rearrange them into a compact mass at one end of the area, meanwhile revising all pointers to marked nodes to show their new locations. An algorithm is here described which accomplishes this task in Iinear time relative to the size of the storage area, and in space of the order of one bit for each pointer. The algorithm operates by reversibly encoding the situation that a collection of locations point to a single location by a linear list, emanating from the pointed-to location, passing through the pointing …


Dual-Mode Combinational Logic For Function-Independent Fault Testing, Sumit Dasgupta Feb 1977

Dual-Mode Combinational Logic For Function-Independent Fault Testing, Sumit Dasgupta

Electrical Engineering and Computer Science - Technical Reports

This paper presents a method of using hardware redundancy to ease the problem of fault testing in combinational logic networks. Combinational logic networks are constructed using dual-mode logic gates. Initially, it is shown that these networks can be tested for all single stuck-at-faults using just two function-independent tests. This method is then extended to detect a large class of multiple faults with the same two function-independent tests.


Software For Numerical Computation, John R. Rice Jan 1977

Software For Numerical Computation, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Reliability Growth Apportionment, James K. Byers Jan 1977

Reliability Growth Apportionment, James K. Byers

Computer Science Faculty Research & Creative Works

A method is presented for apportioning reliability growth to the subsystems that make up a system in order to achieve the required reliability at least cost. Reliability growth apportionment is handled as an s-expected cost minimization problem subject to the constraint of meeting a system reliability requirement. The problem is formulated in terms of Duane's reliability growth model and is solved using geometric programming. The method can be useful in the early stages of system design to determine subsystem reliability growth that will allow a system reliability requirement to be met, and in the latter stages of system design when …


Some Results On Arithmetic Codes Of Composite Length, Tai-Yang Hwang, Carlos R.P. Hartmann Oct 1976

Some Results On Arithmetic Codes Of Composite Length, Tai-Yang Hwang, Carlos R.P. Hartmann

Electrical Engineering and Computer Science - Technical Reports

In this paper we present a new upper bound on the minimum distance of binary cyclic arithmetic codes of composite length. Two new classes of binary cyclic codes of composite length are introduced.


Data Types As Lattices: Retractions, Closures, And Projections, Luis E. Sanchis Oct 1976

Data Types As Lattices: Retractions, Closures, And Projections, Luis E. Sanchis

Electrical Engineering and Computer Science - Technical Reports

This paper considers the mathematical principals of lattice theory oriented toward the theory of computation.


Predicting The Number Of Bugs Expected In A Program Module, Linda M. Ottenstein, Victor B. Schneider, Maurice H. Halstead Oct 1976

Predicting The Number Of Bugs Expected In A Program Module, Linda M. Ottenstein, Victor B. Schneider, Maurice H. Halstead

Department of Computer Science Technical Reports

No abstract provided.


Piecewise Cubic Hermite Interpolation At The Gaussian Points, Elias N. Houstis, T. S. Papatheodorou Jul 1976

Piecewise Cubic Hermite Interpolation At The Gaussian Points, Elias N. Houstis, T. S. Papatheodorou

Department of Computer Science Technical Reports

No abstract provided.


A Computerized Marine Data And Information System-Endex/Oasis, Steven J. Tibbitt May 1976

A Computerized Marine Data And Information System-Endex/Oasis, Steven J. Tibbitt

Marine Affairs Theses and Major Papers

The volume of international and national environmental data and information in the marine, earth and atmospheric sciences has created the need to systematically organize, handle, manipulate, store and retrieve this material utilizing sophisticated computer hardware and provide the scientist, student, planner and decision-maker with the awareness and accessibility of available data and information. Consonant with the objectives outlined for NOAA and the need generated by the explosion of information and data in this area, the National Oceanic and Atmospheric Administration(NOAA), Environmental Data Service (EDS) and the National Oceanographic Data Center (NODC), have an ongoing development effort in the Envirorrmental Data …


An Algorithmic Approach To The Detection And Prevention Of Plagiarism, Karl J. Ottenstein Apr 1976

An Algorithmic Approach To The Detection And Prevention Of Plagiarism, Karl J. Ottenstein

Department of Computer Science Technical Reports

No abstract provided.


Statistical Computing - The Vanguard Of The Future Of Education, John R. Rice Apr 1976

Statistical Computing - The Vanguard Of The Future Of Education, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


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.


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 …


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 …


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


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


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

"A Philosophy For Complexity", Charles West Churchman

Special Collections: Oregon Public Speakers

No abstract provided.


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 …


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.


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.


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.


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 …


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 …