Physical Sciences and Mathematics Commons^™

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.

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

Terminal Talk

No abstract provided.

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

Terminal Talk

No abstract provided.

Studies In Computational Linguistics No. 1, The Recognition Of Alphabets, Edward F. Storm

Electrical Engineering and Computer Science - Technical Reports

Formal parsing rules for programming languages often have machinery for recognizing identifiers, numerical constants, and other substrings whose internal structure is only marginally relevant to the language structure as a whole. In this note alphabets are introduced in which identifiers, constants, etc. are regarded as single symbols. An alphabet is thus constructed out of a finite set of characters, is identified as a regular language and a simple recognition algorithm is described, giving the language designer considerable latitude in his choice of alphabet.

A Note On "Axioms" For Computational Complexity And Computation Of Finite Functions, Paul R. Young

Department of Computer Science Technical Reports

No abstract provided.

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

Terminal Talk

No abstract provided.

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

Terminal Talk

No abstract provided.

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 …

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

Terminal Talk

No abstract provided.

Terminal Talk - The Wofford Connection - November 1969, Wofford College Computer Center

Terminal Talk

No abstract provided.

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

Department of Computer Science Technical Reports

No abstract provided.

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

Terminal Talk

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.

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

Terminal Talk

No abstract provided.

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

Terminal Talk

No abstract provided.

A Note On Dense And Nondense Families Of Complexity Classes, Paul R. Young

Department of Computer Science Technical Reports

No abstract provided.

A Translation Grammar For Algol 68, Victor B. Schneider

Department of Computer Science Technical Reports

No abstract provided.

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

Terminal Talk

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.