Physical Sciences and Mathematics Commons^™

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.

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 …

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 …

Computer Implemented Synthesis Of Multiple Level Combinational Networks, Alfredo Caldwell

Masters Theses

The purpose of this investigation has been to implement, in the form of computer programs, two algorithms which are used in the synthesis of multiple level combinational networks. The algorithms implemented were devised by Professor Paul E. Wood, Jr., of M.I.T., and by Professor Eugene L. Lawler, of The University of Michigan. In the course of the investigation a more efficient way of implementing the two algorithms was discovered. The combined version of the algorithms takes advantage of the best features of the original algorithms.

In the synthesis of multiple level combinational networks minimal complexity is high desirable. The whole …

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.

Numerical Analysis - Final Report, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

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

Department of Computer Science Technical Reports

No abstract provided.

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.

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.

Syntax-Directed Documentation For Pl360, Harlan D. Mills

The Harlan D. Mills Collection

No abstract provided.

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

Terminal Talk

No abstract provided.

A Special Studies Paper On The General Mathematics Requirements At Ouachita Baptist University, Linda Gamble

Honors Theses

The object of this paper has been to study the opinions of graduates and present students about the required math hours (presently three hours) at Ouachita Baptist University. It has formerly been my opinion that this may be insufficient math background for many of our students going out seeking jobs. Many times the student, while still in college does not realize he may need more math but it may show up on graduate tests, in his occupational work, or personal matters such as income tax calculations, bookkeeping, or budgeting.

To compile the opinions of students on this subject a form …

A Special Studies Paper On Mathematics In Computer Programing, Linda Gamble

Honors Theses

The profession of programing has existed for two decades or longer. Computer programing and the organization of computer analysis have gone beyond the reach of careful clerks with high school education. There is a growing demand for persons who are competent researchers, experienced in the use of multivariate methods, and skilled as computer users and programers. Mathematics and engineering predominate. The programer should have a knowledge of mathematics and a familiarity with computer hardware and must understand the content of the problem to be solved.

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 …

Computer Programming, Gary Rice

Honors Theses

The chief advantage of the digital computer is that it can be instructed to perform complex or repetitive arithmetical operations in a very short period of time. Any sequence of operations which can be fully analyzed can theoretically be done by a computer. The method of instruction takes the form of various precisely defined computer languages. The programs to be discussed here were written in a Fortran language, Fortran being a contraction of Formula Translation. There are at least four variations of Fortran, but the differences are relatively minor. Fortran is basically intended for scientific and engineering purposes. The programs …

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.