Computer Sciences Commons^™

Method And Apparatus For Performing Hashing Operations Using Galois Field Multiplication, John L. Carter, George Markowsky, Mark N. Wegman

Computer Science Faculty Research & Creative Works

The invention comprises a method and apparatus for performing a hashing operation on an N bit number under control of a prespecified N bit hashing constant which comprises performing N/K finite field partial multiplications of the object to be hashed by the hashing constant, utilizing K logic and combinatorial circuits all of which operate in parallel to completely evaluate the number in N/K operations.

Another feature of the present invention is that the hashing constant loaded into the system may be changed at will with a resultant changing of the hashing characteristics to suit a particular class of objects to …

Proportional Advancement From Regional Programming Contests, John R. Metzner

Computer Science Faculty Research & Creative Works

No abstract provided.

Reduced Set Of Phages For Typing Salmonellae, Melvin Gershman, George Markowsky

Computer Science Faculty Research & Creative Works

A set composed of 27 phages is described for differentiating Salmonella spp. representative of groups A, B, C₁, C₂, D₁, D₂, E₁, E₂, E₃, E₄, G₁, K, and N. All of the 1,245 cultures used in this effort were typable and were differentiated on the basis of the 420 phage patterns observed. All results were reproducible. Characteristic phage patterns were produced by a variety of Salmonella serovars isolated from campus incidents and a number of hospital, family, restaurant, and processing plant outbreaks …

The Subjective Nature Of Programming Complexity, Daniel G. Mcnicholl, Kenneth I. Magel

Computer Science Faculty Research & Creative Works

One of the more difficult problems confronting software engineers today is the construction of accurate predictive models of the software development process, [21,[8] and [93. It has long been recognized that one of the most essential elements of any successful model of this process is a quantification of the complexity of software systems. During the past several years a great deal of work has been performed by researchers such as Halstead [3], McCab [5], and others in an attempt to develop metrics which adequately capture the complexity of software systems. Yet one very important aspect of software development complexity seems …

A Theory Of Small Program Complexity, Kenneth I. Magel

Computer Science Faculty Research & Creative Works

Small programs are those which are written and understood by one. person. Large software systems usually consist of many small programs. The complexity of a small program is a prediction of how difficult it would be for someone to understand the program. This complexity depends of three factors: (1) the size and interelationships of the program itself; (2) the size and interelationships of the internal model of the program's purpose held by the person trying to understand the program; and (3) the complexity of the mapping between the model and the program. A theory of small program complexity based on …

An Approximation Theory For Conjugate Surfaces And Solutions Of Elliptic Multiple Integral Problems: Application To Numerical Solutions Of Generalized Laplace's Equation, John Gregory, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

An Approximation Theory is Given for a Class of Elliptic Quadratic Forms Which Include the Study of Conjugate Surfaces for Elliptic Multiple Integral Problems. These Ideas Follow from the Quadratic Form Theory of Hestenes, Applied to Multiple Integral Problems by Dennemeyer, and Extended with Applications for Approximation Problems by Gregory. the Application of This Theory to a Variety of Approximation Problem Areas in This Setting is Given. These Include Conjugate Surfaces and Conjugate Solutions in the Calculus of Variations, Oscillation Problems for Elliptic Partial Differential Equations, Eigenvalue Problems for Compact Operators, Numerical Approximation Problems, And, Finally, the Intersection of These …

A Topological Analysis Of The Complexity Of Computer Programs With Less Than Three Binary Branches, Warren Harrison, Kenneth I. Magel

Computer Science Faculty Research & Creative Works

No abstract provided.

Recommendations For Master's Level Programs In Computer Science: A Report Of The Acm Curriculum Committee On Computer Science, Kenneth I. Magel, Richard H. Austing, Alfs Berztiss, Gerald L. Engel, John Wesley Hamblen, A. A.J. Hoffmann, Robert Mathis

Computer Science Faculty Research & Creative Works

The ACM Committee on Curriculum in Computer Science has spent two years investigating master's degree programs in Computer Science. This report contains the conclusions of that effort. Recommendations are made concerning the form, entrance requirements, possible courses, staffing levels, intent, library resources, and computing resources required for an academic, professional, or specialized master's degree. These recommendations specify minimum requirements which should be met by any master's programs. The Committee believes that the details of a particular master's program should be determined and continually updated by the faculty involved. A single or a small number of model programs are not as …

Regular Expressions In A Program Complexity Metric, Kenneth I. Magel

Computer Science Faculty Research & Creative Works

No abstract provided.

A Complexity Measure Based On Nesting Level, Warren A. Harrison, Kenneth I. Magel

Computer Science Faculty Research & Creative Works

No abstract provided.

A Suggested Course In Introductory Computer Programming, Warren A. Harrison, Kenneth I. Magel

Computer Science Faculty Research & Creative Works

Introductory programming courses have long been a popular topic of discussion. Often it is either the only computer course a student takes, or it is the foundation upon which all further training in computer science is built. The usual goal of such a course is to introduce the student to the use of a computer to solve simple problems in his or her particular discipline. Generally, the method of presenting the material may be separated into two distinct schools of thought, which we have termed the "Black Box School of Thought" and the "White Box School of Thought". In this …

The Double Eigenvalue Problem; Including Numerical Solutions, John Gregory, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

No abstract provided.

A Graded Bibliography On Macro Systems And Extensible Languages, John R. Metzner

Computer Science Faculty Research & Creative Works

No abstract provided.

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 …

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 …

System Reliability: Exact Bayesian Intervals Compared With Fiducial Intervals, Kathryn P. Berkbigler, James K. Byers

Computer Science Faculty Research & Creative Works

This paper compares numerically two different, widely used lower limit estimates for the reliability of a series system: Bayesian limits and fiducial limits. The fiducial limits are obtained by Monte Carlo simulation because of its simplicity and ease of computer programming. Subsystem failures are s-independent and exponentially distributed; life test data are available for estimating the failure rate of each system. Copyright © 1975 by The Institute of Electrical and Electronics Engineers, Inc.

Bayesian Confidence Limits For The Reliability Of Mixed Cascade And Parallel Independent Exponential Subsystems, James K. Byers, Ronald W. Skeith, Melvin D. Springer

Computer Science Faculty Research & Creative Works

This paper deals with the theoretical problem of deriving Bayesian confidence intervals for the reliability of a system consisting of both cascade and parallel subsystems where each subsystem is independent and has an exponential failure probability density function (pdf). This approach is applicable when test data are available for each individual subsystem and not for the entire system. The Mellin integral transform is used to analyze the system in a step-by-step procedure until the posterior pdf of the system reliability is obtained. The posterior cumulative distribution function is then obtained in the usual manner by integrating the pdf, which serves …

Finite Dimensional Group Rings, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

A Ring is Right Finite Dimensional If It Contains No Infinite Direct Sum of Right Ideals. We Prove that If a Group G is Finite, Free Abelian, or Finitely Generated Abelian, then a Ring R is Right Finite Dimensional If and Only If the Group Ring RG is Right Finite Dimensional. a Ring R is a Self-Injective Cogenerator Ring If Rn is Injective and RR is a Cogenerator in the Category of Unital Right /{-Modules; This Means that Each Right Unital A-Module Can Be Embedded in a Direct Product of Copies of R. Let G Be a Finite Group Where …

Bayesian Confidence Limits For The Reliability Of Mixed Exponential And Distribution-Free Cascade Subsystems, Melvin D. Springer, James K. Byers

Computer Science Faculty Research & Creative Works

The problem treated here is the theoretical one of deriving exact Bayesian confidence intervals for the reliability of a system consisting of some independent cascade subsystems with exponential failure probability density functions (pdf) mixed with other independent cascade subsystems whose failure pdf's are unknown. The Mellin integral transform is used to derive the posterior pdf of the system reliability. The posterior cumulative distribution function (cdf) is then obtained in the usual manner by integrating the pdf, which serves the dual purpose of yielding system reliability confidence limits while at the same time providing a check on the derived pdf. A …