Digital Commons Network^™

Decoding By Sequential Code Reduction, Luther D. Rudolph, Carlos R.P. Hartmann

Electrical Engineering and Computer Science - Technical Reports

A general decoding method for cyclic codes is presented which gives promise of substantially reducing the complexity of decoders at the cost of a modest increase in decoding time (or delay). Significant reductions in decoder complexity for binary cyclic finite-geometry codes are demonstrated, and two decoding options for the Golay code are presented.

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.

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.

Terminal Talk - The Wofford Connection - September 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.

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 …

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.

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 …

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 …

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.

Opset Program For Computerized Selection Of Watershed Parameter Values For The Stanford Watershed Model, Earnest Yuan-Shang Liou, L. Douglas James

KWRRI Research Reports

The advent of high-speed electronic computer made it possible to model complex hydrologic processes by mathematical expressions and thereby simulate streamflows from climatological data. The most widely used program is the Stanford Watershed Model, a digital parametric model of the land phase of the hydrologic cycle based on moisture accounting processes. It can be used to simulate annual or longer flow sequences at hourly time intervals. Due to its capability of simulating historical streamflows from recorded climatological data, it has a great potential in the planning and design of water resources systems. However, widespread use of the Stanford Watershed Model …

The Assignment Problem And A Suboptimal Solution Technique, William Barry Gregory

Masters Theses

"A technique is presented which finds a fast suboptimal solution to the assignment problem. This same technique is then applied to two large dynamic programming problems for which the optimal solution is not known. These examples illustrate how easily this technique can be applied and that it is better than most optimizing techniques because it is fast, cheap and only minor hand calculations are needed. The effect of different initial solutions and their value are compared and it is found that the initial solution is not as significant in a suboptimal technique as in an optimizing technique. The initial solution …

Developing An Optical Scanner Card For Computerized Football Scouting, Curtis Lowell Byrnes

All Master's Theses

The purpose of this study is to develop an optical scanner scouting card to use in conjunction with the computer for football scouting.

Modified Method Of Linear Associative Retrieval, James Donald Byrd

Masters Theses

"It is becoming increasingly important for those in decision making positions to have the most current and accurate data possible as related to their particular needs. Although there are several well known retrieval techniques available an intensified effort is being made at many installations to provide a retrieval system that will supply the demands of their own needs. One well known approach to the solution of information retrieval is linear associative retrieval. The solution that has been proposed requires several computer runs on some requests and therefore is very time consuming. The author has implemented a method to eliminate unnecessary …

Manipulation Of Data Structure In A Numerical Analysis Problem Solving Systems, Lawrence R. Symes

Department of Computer Science Technical Reports

No abstract provided.

A Note On The Free Distance Of A Convolutional Code, Alexander Miczo

Electrical Engineering and Computer Science - Technical Reports

A counterexample to a conjecture on the number of constraint lengths required to achieve the free distance of a rate l/n systematic convolutional code is presented.

A Translation Grammar For Algol 68, Victor B. Schneider

Department of Computer Science Technical Reports

No abstract provided.

Generalized Threshold Decoding Of Convolutional Codes, Luther D. Rudolph

Electrical Engineering and Computer Science - Technical Reports

It is shown that any rate l/b systematic convolutional code over GF(p) can be decoded up to its minimum distance with respect to the decoding constraint length by a one-step threshold decoder. It is further shown that this decoding method can be generalized in a natural way to allow “decoding” of a received sequence in its unquantized analog form.

A Comparison Of Some Numerical Integration Programs, J. Casaletto, M. Pickett, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Mathematical Problem Solving Language And Its Interpreter, Lawrence R. Symes

Department of Computer Science Technical Reports

No abstract provided.

A Polyalgorithm For The Automatic Solution Of Nonlinear Equations, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Evaluation Of Napss Expression Involving Polyalgorithms, Functions, Recursion, And Untyped Variables, Lawrence R. Symes

Department of Computer Science Technical Reports

No abstract provided.

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

Terminal Talk

No abstract provided.

Numerical Analysis For The Consumer, D. Dodson, J. Ewing, P. Miller, W. Nylin, E. Petarik, S. Prues

Department of Computer Science Technical Reports

No abstract provided.