Digital Commons Network^™

Terminal Talk - The Wofford Connection - February 1972, Wofford College Computer Center

Terminal Talk

No abstract provided.

Some Results On The Best Match Problem, Luther D. Rudolph, Kishan Mehrotra, Ralph J. Longobardi

Electrical Engineering and Computer Science - Technical Reports

The "best-match problem" is concerned with the complexity of finding the best match between a randomly chosen query word and the members of a randomly chosen set of data words. Of principal interest is whether it is possible to significantly reduce the search time required, as compared to exhaustive comparison, by use of memory redundancy (file structure). Minskv and Papert conjecture that "the speed-up values of large memory redundancies is very small, and for large data sets with long word lengths there are no practical alternatives to large searches that inspect large parts of memory". For this report we present …

A Methodology For The Design And Optimization Of Information Processing Systems, J. F. Nunamaker

Department of Computer Science Technical Reports

No abstract provided.

A Note On Orders Of Enumeration, John Helm, Albert Meyer, Paul Young

Department of Computer Science Technical Reports

No abstract provided.

Computerized Registration For High Schools, Kenneth Lee Fore

Masters Theses

"The guidance personnel in a high school are often burdened with the duty of hand scheduling the student's courses. Using the computer as a sub-optimizing tool in the registration of students, however, can cut scheduling time dramatically and relieve the guidance department of an onerous chore. The technique described in this investigation uses a conflict matrix that schedules the student's request and keeps the class load level within the course sections. A search of the schedule array for each course request may uncover a conflict. If no conflict occurs the course is scheduled and the remaining courses for this student …

The Myhill Functor, Input-Reduced Machines, And Generalised Krohn-Rhodes Theory, Robert H. Yacobellis

Computer Science: Faculty Publications and Other Works

No abstract provided.

Terminal Talk - The Wofford Connection - December 1971, Wofford College Computer Center

Terminal Talk

No abstract provided.

Symmetric Binary B-Trees: Data Structure And Algorithms For Random And Sequential Information Processing, Rudolf Bayer

Department of Computer Science Technical Reports

No abstract provided.

Terminal Talk - The Wofford Connection - October 1971, Wofford College Computer Center

Terminal Talk

No abstract provided.

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

Terminal Talk

No abstract provided.

Terminal Talk - The Wofford Connection - August 1971, Wofford College Computer Center

Terminal Talk

No abstract provided.

An Axiom System For The Weak Monadic Second Order Theory Of Two Successors, Dirk Siefkes

Department of Computer Science Technical Reports

No abstract provided.

A Simplex Algorithm - Gradient Projection Method For Nonlinear Programming, L. Duane Pyle

Department of Computer Science Technical Reports

No abstract provided.

Terminal Talk - The Wofford Connection - June 1971, Wofford College Computer Center

Terminal Talk

No abstract provided.

Unsteady Flow Toward Partially Penetrating Artesian Wells, Y. H. Huang

KWRRI Research Reports

A numerical method programmed for a high-speed computer was developed for determining the drawdown around an artesian well. A salient feature of the program is that it can be used for both fully and partially penetrating wells in either infinite or finite aquifers. The method Involves the application of finite difference equations to the well-known heat equation using a graded network. A comparison of the finite difference solutions with those obtained from the close-form formulas of Muskat, Theis, and Hantush indicates the validity of the method. A comparison between the finite difference solutions and the drawdowns measured on a sand …

Terminal Talk - The Wofford Connection- May 1971, Wofford College Computer Center

Terminal Talk

No abstract provided.

A Computerized Study Of Midpalatal Suture Expansion, Clelan G. Ehrler

Loma Linda University Electronic Theses, Dissertations & Projects

An investigation has been conducted to consider the effects of midpalatal suture expansion on the cranial-facial complex. Nine patients were treated that had constricted maxillae. Data was obtained from frontal and lateral headplate radiographs which were taken at four intervals during treatment. The Rocky Mountain Data Systems diagnosis was utilized to interpret the radiographic data.

The data from the nine cases were averaged to obtain a composit [sic] change at each of the four times.

Examination of the lateral headplate data revealed that no permanent significant alteration occurred to the positions of the mandible or maxilla in a vertical or …

Terminal Talk - The Wofford Collection - March 1971, Wofford College Computer Center

Terminal Talk

No abstract provided.

Terminal Talk - The Wofford Connection February 1971, Wofford College Computer Center

Terminal Talk

No abstract provided.

Terminal Talk - The Wofford Connection - January 1971, Wofford College Computer Center

Terminal Talk

No abstract provided.

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 …

A Bayes Rule For The Symmetric Multiple Comparisons Problem, Aban Nawabi

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

Many procedures have been proposed for the symmetric multiple comparisons problem in recent years. These include a "protected" least significant difference procedure due to Fisher (FSD), a multiple range rule by Duncan, and HSD (honest significant difference) procedure by Tukey, and a procedure for testing all contrasts by Scheffe.

The tests which are mentioned above are either comparison-wise or experiment-wise approaches. The probability of Type I error is intended to be a for all comparisons made when an experiment-wise approach is used. Whereas, the probability of Type I error referred to each comparison is a comparison-wise approach. Both approaches can …

Behavioral Styles Of Computer Programmers - Revisited, Edward M. Cross

Information Technology & Decision Sciences Faculty Publications

This paper describes the second phase of a continuing research project concerned with the attributes associated with membership and success in the computer programming occupation.   The second phase of this research has differed some-what, both in intent and practice, from the first phase. First, the initial purpose of the study was to test an approach to job analysis which included the application of the principal instrument used in the study, the JAIM, or Job Analysis and Interest Measurement.1 The use of computer programmers as the subject group was the result of the investigator's previous career as a systems analyst and …

On Maximally Parallel Schemata, Robert M. Keller

All HMC Faculty Publications and Research

A model for parallel computation called a schema is presented. This model is similar to that presented in the recent work of Karp and Miller. Section 1 presents a description of the model, and some results on the characterization of computations within it. Section 2 summarizes some results on determinacy and equivalence. Section 3 presents a formalization of the property of maximal parallelism in schemata. Several alternate characterizations are shown to be equivalent for certain classes. Section 4 presents results on the complexity of a maximally parallel schema equivalent to a given schema.

Some Results On The Distance Properties Of Convolutional Codes, Luther D. Rudolph, Alexander Miczo

Electrical Engineering and Computer Science - Technical Reports

Rate 1/2 binary convolutional codes are analyzed and a lower bound on free distance in terms of the minimum distances of two associated cyclic codes ìs derived. Next, the complexity of computing the free distance is discussed and a counterexample to a conjecture on the relationship of row distance to free distance for systematic codes Ìs presented. Finally, an improved Gilbert bound for definite decoding is derived.

A One Pass Algorithm For Compiling Algol 68 Declarations, Victor B. Schneider

Department of Computer Science Technical Reports

No abstract provided.

Numerical Analysis - Final Report, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

On The Number Of Registers Needed To Evaluate Arithmetic Expressions, Victor Schneider

Department of Computer Science Technical Reports

No abstract provided.

Terminal Talk - The Wofford Connection - August 1970, Wofford College Computer Center

Terminal Talk

No abstract provided.

Terminal Talk - The Wofford Connection - July 1970, Wofford College Computer Center

Terminal Talk

No abstract provided.