Digital Commons Network^™

An Algorithm For Minimizing The Riding Time Of Students On School Buses., Dennis Ray Morgan

Masters Theses

"This thesis presents an algorithm which selects from a given set of stops a subset of stops corresponding to a given bus which minimize the riding time of students in going to and from school. The time required in picking up students at their stops and delivering them to school is analyzed. An example is given which illustrates the formulation of a problem and the results obtained from the solution. Finally, the program which was used in the solution of the problem is given along with its implementation"-- Abstract, p. ii

Statistical Modelling Of Computer Systems: A Survey, Amrit L. Goel, Anand M. Joglekar

Electrical Engineering and Computer Science - Technical Reports

This paper briefly surveys the data dependent statistical methods useful for computer systems modelling. The techniques are classified according to their applicability toward comparison, tuning and design of computer systems. A review of papers dealing with statistical modelling of computer systems is presented and a comprehensive bibliography is included to provide a useful source of reference toward the present and potential applications of statistical methods for computer system modelling.

A Numerical Study Of Ordinary Differential Equations With Periodic Coefficients, Richard Bruce Schuessler

Masters Theses

"In this thesis a method for solving ordinary differential equations with periodic coefficients is derived. In addition, by utilization of Floquet theory, a theorem is given by which it is possible to determine the stability of the zero solution. Error bounds are given for the method and for the two dimensional case bounds are given for the error in the eigenvalues. Several numerical examples are given to illustrate the method"--Abstract, page ii.

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 …

Comparison Of Scatter Storage Techniques Using An Analysis Of Variance Model, Robert Lee Kitsch

Masters Theses

"An analysis of variance model is developed to determine if a significant difference exists between various scatter storage techniques. The model is a two-factor hierarchical mixed design with each combination of transformation and search method considered as a treatment. The data used in the analysis is obtained from a computer program which provides statistics on the number of probes needed to load the (k+l)st item into a table for the different treatments. An ANOVA table was then computed for various load factors.

A significant difference among the treatments was detected for load factors above .4. Comparison of individual treatments using …

Are The Needs Of Industry For Data Processing Programmers Being Adequately Supported By Technical Training Programs In Oklahoma, Dale I. Sare

Electronic Theses & Dissertations

In 1970 over 40,000 computers were in use in the United States and 1,000 more on order from manufacturers. Every major newspaper had published at least one news article or editorial about computers during 1970. These articles reported how computers function, the speed at which they function, their limitations and how they have, and are continuing to become, a complex part of the business world and social affairs of man.

Cephalometrics For The Oral Surgeon In The Diagnosis Of Facial Deformities, Frederick J. Mantz

Loma Linda University Electronic Theses, Dissertations & Projects

Surgical orthodontics presents a challenge to the oral surgeon. By the nature of the oral surgeon's training and discipline he should be the one best qualified to treat the surgical aspect of the surgical orthodontic case. The establishment of a proper diagnosis and means of communication between the oral surgeon and orthodontist are essential in achieving a good final result for the surgically treated case. Fortunately, a scientific method of diagnosis is available that can provide both specialties with a common language. Computerized cephalometric analysis can provide the diagnosis and link of communication for the discussion of goals and treatment. …

Digital Computer Solution Of Electromagnetic Transients In Large Power Systems, Bijan Navidbakhsh

Dissertations and Theses

This thesis is an introduction to the solution of electromagnetic transients by a combination of the Bergeran method of characteristics and the application of trapezoidal rule of integration.

Three test examples solved by digital computer illustrate the step by step solution and computer programming.

To compare this method with the Laplace transformation technique, a test problem solved by both methods and also digital computer is illustrated. In conclusion, the advantages and disadvantages of both methods are compared.

The Education Of A Computer: Development Of Computer-Assisted Instruction Of German Grammar, Karen Wintringham

Senior Scholar Papers

Characteristic of the acquisition of most skills, the learning of a foreign language requires formalized, systematic training. Computer-assisted instruction provides the necessary individualized drill with accompanying reinforcement. The "BASIC" CAI course, MODALS, represents the culmination of nine months of research and programming of the instruction of German modal auxiliaries; the complex of sixty seven interconnected sub -programs provide drill of all six modals in five different tenses. Subsequent to the in-class introduction of new lecture material concerning the modals, any student may then proceed to the computer terminal, there undertaking further study of the subject. MODALS lacks an answer recording …

Monte Carlo Simulation Of Confidence Intervals For Reliability, Kathryn Palisch Berkbigler

Masters Theses

"A computer program which computes fiducial confidence intervals for reliability by Monte Carlo simulation has been written. The program has the capability of computing these intervals for general systems of series, parallel, and mixed series and parallel subsystems which have failure time distributions which are either exponential, Weibull, gamma, normal, or lognormal.

Comparison of the simulation technique with a Bayesian technique for computing confidence intervals in the case of a series of exponentially distributed components shows that the two methods agree quite well when a fiducial prior distribution for reliability is used in the Bayesian technique. A uniform prior distribution …

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 …

Moment-Curvature-Thrust Relationships In Hybrid Members, Douglas Wrenn Fiala

Dissertations and Theses

In order to overcome the difficulties encountered in closed form solutions, moment-curvature-thrust relationships are developed for hybrid and nonhybrid cross sections utilizing an open form method. The use of horizontal sectors permits the inclusion of residual stresses and/or nonbilinear stress-strain relationships, if desired. Theoretical and experimental data are compared. Applications to circular tubes and other cross sections are discussed. Results indicate that open form solutions are feasible for calculating moment-curvature-thrust data. Hybrid cross sections are easily treated by open form solutions.

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 …

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.

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 …

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 …

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.

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.

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 …

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 …

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.

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.

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.

A Comparison Of Three Numerical Techniques Used For The Solution Of The Two-Point Boundary Value Problem, William Richard Krall

Masters Theses

"Three numerical approximation techniques, called the Initial step, Shooting, and Direct Finite Difference Techniques, respectively, are compared and discussed as they apply to the solution of both linear and non-linear boundary-value problems of the form y"=f(x,y,y') with endpoint conditions y(x_o)=y_o and y(x_n)=y_n. The techniques are compared with respect to speed and accuracy by comparing the solution of each problem considered four times, each time for a different increment value, and comparing the errors at four pivotal points chosen at equally spaced distances over the domain of the function, to give an indication of …

A Development Of Regression Models For Predicting Temperature, Salinity And Sound Velocity In Sea Water, Darwin Wayne Brown

Masters Theses

"There are in existence today some reasonably good numerical procedures for predicting sound velocity, but these procedures require that certain initial data such as temperature and salinity be given before a sound velocity may be computed. Eliminating the need for on-location observations of temperature and salinity, which are used in computing sound velocity, was the primary objective of this study. Stepwise multiple regression was applied in the search for suitable models to predict temperature and salinity, and ultimately sound entirely in terms of controllable variables, such as latitude, longitude, depth, and day-of-year"--Abstract, page ii.

Comparative Analysis Of Polynomial Root Finding Techniques, Charles Ray O'Daniel

Masters Theses

"The purpose of this study was to investigate and recommend various methods instrumental in finding the roots of a polynomial p(x) = 0. Many different methods are present today, and each has its advantages and disadvantages.

Through thorough investigation, the author has ascertained the key methods to be the method of Bisection, the Newton-Raphson method, and the Bairstow method. Special support in the form of algebraic theorems on the locations and kind of roots are extremely helpful. This combination of theorems and methods provides assurance, speed, and the ability to obtain complex roots.

The Bisnewbar method developed by this author …

Comparative Analysis Of Numerical Integration Techniques, Edward Lee Sartore

Masters Theses

"When integrating numerically, if the integrand can be expressed exactly as a polynomial of degree n, over a finite interval; then either Simpson's rule, Romberg integration, Legendre-Gauss or Jacobi-Gauss quadrature formulas provide good results. However, if the integrand can not be expressed exactly as an nth degree polynomial, then perhaps it can be expressed as a function f(x) divided by √1-x ², or as a function g(x) times (1-x)^α (l+x)^ß , where α and ß are some real numbers >1, or as a function h(x) times one. If this is the case then the Chebyshev-Gauss, Jacobi-Gauss, and …

A Study Of The Development Of A Heuristic Program That Solves Symbolic Laplace Transformation Problems, Arthur E. Zackrison

Masters Theses

"A medium-speed general purpose digital computer (IBM 1620 Model II) was programmed to solve symbolic Laplace transformation problems. Although the applied mathematician and modern engineer has many uses for the symbolic solution of a problem, the potential of symbolic manipulation by a computer has not yet been sufficiently developed to help them because of many problems. This paper discusses the program and based on the author’s experience with it’s [sic] performance, clarifies the position of several of these difficulties and reaches some conclusions concerning computer solution of such problems"--Abstract, page ii.