Digital Commons Network^™

Inclusion Theorems For Boundary Value Problems For Delay Differential Equations, Leon M. Hall

Masters Theses

"In this thesis existence and uniqueness of solutions to certain second and third order boundary value problems for delay differential equations is established. Sequences of upper and lower solutions similar to those used by Kovač and Savčenko are defined by means of an integral operator, and conditions are given under which these sequences converge monotonically from above and below to the unique solution of the problem. Some numerical examples for the second order case are presented. Existence and uniqueness is also proved for the case where the delay is a function of the solution as well as the independent variable"--Abstract, …

Integrability Of The Sums Of The Trigonometric Series 1/2 Aₒ + ∞ [Over] Σ [Over] N=1 AN Cos Nθ And ∞ [Over] Σ [Over] N=1 AN Sin Nθ, John William Garrett

Masters Theses

"The trigonometric series C = 1/2 aₒ + ∞ [over] Σ [over] [n=1] a[subscript n] cos nΘ and S = ∞ [over] Σ [over] n=1 a[subscript n] sin nΘ, where {a[subscript n]} monotonically decreases to zero both converge almost everywhere to functions f and g respectively. f (or g) is L iff C (or S) is the Fourier series of f (or g) iff term-by-term integration of C (or S) is valid. There are three equivalent conditions, each of which implies that C is the Fourier series of f...."--Abstract, page ii.

The History And Nature Of Pi, Karen A. Rand

Honors Capstones

No abstract provided.

Modeling The Visual Pathway For Interactive Diagnosis Of Visual Fields, Chiam Geoffrey Goldbogen

Doctoral Dissertations

"Visual fields are an important tool for the ophthalmologist in the detection, diagnosis, and monitoring of certain diseases and maladies of the visual pathway. The aim of the present research is to build a computer system which utilizes a learning machine to develop a mathematical model of the visual pathway. It is hoped that this system may be used in the field of ophthalmology as a teaching aid, or may assist in various aspects of diagnosis. Faults corresponding to blind or impaired areas of visual fields are extracted from medical records of a patient's condition. The structure of the model …

The Influence On A Finite Group Of The Cofactors And Subcofactors Of Its Subgroups, Larry R. Nyhoff

University Faculty Publications and Creative Works

The effect on a finite group G of imposing a condition 6 on its proper subgroups has been studied by Schmidt, Iwasawa, ltd, Huppert, and others. In this paper, the effect on G of imposing 6 on only the cofactor H/corGHor more generally, the subcofactor ///scorGH) of certain subgroups H of G is investigated, where corGH (scorGH) is the largest G-normal (07-subnormal) subgroup of H. It is shown, for example, that if (a) ///scorGH is p-nilpotent for all self-normalizing H> G, or if (b) ///scorGH is />-nilpotent for all abnormal H> G and p is odd or the p-Sylows …

Some Statistical Inferences For The Bivariate Exponential Distribution, Bruce Mohr Bemis

Doctoral Dissertations

"The bivariate exponential distribution is neither absolutely continuous nor discrete due to the property that there is a positive probability that the two random variables may be equal. Basic properties of the distribution are presented as well as methods of parameter estimation including maximum likelihood. The distribution is shown to satisfy the usual regularity conditions in spite of its possession of a singularity. The maximum likelihood estimates are asymptotically efficient. Two other methods of estimation are compared with the maximum likelihood method in terms of efficiency. Tests of the hypothesis that two random variables each have independent exponential distributions versus …

Characterizing Topologies By Classes Of Functions And Multifunctions, Alexander Hamlin Cramer

Doctoral Dissertations

"Topological spaces are characterized by the algebraic and topological structures of their classes of continuous selfmaps. The problem of determining the topology of a set given certain classes of multifunctions or relations is considered. The algebraic structure of the upper semicontinuous multifunctions is shown to determine the topology of T₁ spaces. A partial order for classes of topologies for the real numbers is defined and relationships between various classes are established"--Abstract, page ii.

I. Existence Of Eigenvalues For Integral Equations; Ii. A Collocation Method For Boundary Value Problems, Robert Dodd Russell

Mathematics & Statistics ETDs

I. The existence of eigenvalues is shown for certain classes of integral equations with continuous kernels. A number of interesting and useful results are thereby treated in a unified and relatively elementary way. The simplicity of these new proofs make the results accessible to introductory courses on the theory of integral equations.

II. Collocation with piecewise polynomial functions is developed as a method for solving two-point bour:rlary value problems. Convergence is shown for a general class of linear problems and a rather broad class of nonlinear problems. Some computational examples are presented to illustrate the wide applicability and efficiency of …

Studies In Borel Structures., Bhamidi Visweswara Rao Dr.

Doctoral Theses

It ts the nurposo of this chapter to collect together the problons that were acattored throughout the provious two chapters. This chaptor has sovon scctions. The first threo soc tions doal with the probloms that arc raised in or have c onnec tion witl: the topic of chaptor 1. The last tihree sectiona dcal with thc ne of chapter 2. Soction 4 stands mid- vay betweon bo tli, We ahall nunber the problomsi sorially and the nunber appears in bracko to. Wherover posaible wo shall includo somo dincuscion abcut the problcn involvod. There are no now rocults in thin chapter …

Goursat Problems For The Abstract Equation Urs = Lu, Walter J. Roth

Mathematics & Statistics ETDs

A Comparative Study Of Business Arithmetic Students: The Use Of Calculators Vs. Manual Computation, Marietta Crawford

Morehead State Theses and Dissertations

A thesis presented to the Business Education Graduate Committee at Morehead State University in partial fulfillment of the requirements for the Degree of Master of Business Education by Marietta Crawford on May 25, 1970.

Transitive Subgraphs Of Undirected And Directed Graphs., Charles C. Harner

Mathematics & Statistics ETDs

A graph G is transitive if it is transitive when considered as a relation; i.e., if the edges ab and be are in G, so is ac. In this paper, several natural questions concerning transitivity and related concepts are investigated.

Because the terminology and notation of graph theory is not standard, a brief section of definitions and notation is included in Section II. Section III is a study of the transitive cut number of a graph, the minimum number of edges which must be removed from the graph so that the remaining subgraph is transitive. Undirected graphs on n points …

Distribution Of The Sum Of Independent Unity-Truncated Logarithmic Series Variables, Russell James Wayland

Dissertations and Theses

Let X₁, X₂, ..., X_n be n independent and identically distributed random variables having the unity-truncated logarithmic series distribution with probability function given by f(x;θ) = αθ^X/x x ε T where α = [-log(1-θ) - θ]^-1, 0 < θ < 1, and T = {2,3,...,∞}. Define their sum as Z = X₁ + X₂ + ... + X_n.

We derive here the distribution of Z, denoted by p(z;n,θ), using the inversion formula for characteristic functions, in an explicit form in terms of a linear combination of Stirling numbers of the first kind. A recurrence relation for the probability function p(z;n,θ) is obtained …

An Introduction To And Discussion Of Automata And Sequential Machines, Joseph Philip Seab

Honors Capstones

No abstract provided.

Bayesian Estimate Of System Reliability, Naresh Shah

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

A Bayesian estimate of reliability for each component in the system of n-components, each exponentially distributed, is developed which utilizes the basic notion of loss in estimation theory. Here we assume that each component is independently dis­tributed. In reliability estimation, the loss associated with over­estimation is usually greater than the loss associated with under­estimation; and hence loss function can be a very useful tool. The prior distribution and loss function of reliability considered in this paper are flexible to be compatible with other situations in which reliability estimates are required. When the loss function is symmetric and no prior information …

A Survey In Mean Value Theorems, David A. Neuser

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

A variety of new mean value theorems are presented along with interesting proofs and generalizations of the standard theorems.

Three proofs are given for the ordinary Mean Value Theorem for derivatives, the third of which is interesting in that it is independent of of Rolle's Theorem. The Second Mean Value Theorem for derivatives is generalized, with the use of determinants, to three functions and also generalized in terms of n-th order derivatives.

Observing that under certain conditions the tangent line to the curve of a differentiable function passes through the initial point, we find a new type of mean value …

A Fortran List Processor (Flip), Karl A. Fugal

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

A series of Basic Assembler Language subroutines were developed and made available to the FORTRAN IV language processor which makes list processing possible in a flexible and easily understood way.

The subroutine will create and maintain list structures in the computer's core storage. The subroutines are sufficiently general to permit FORTRAN programmers to tailor list processing routines to their own individual requirements. List structure sizes are limited only by the amount of core storage available.

The Ideal And New Interval Topologies On Lattice Ordered Groups., Frieda Koster Holley

Mathematics & Statistics ETDs

In his 1967 edition of Lattice Theory, G. Birkhoff posed the question: "When is a directed group a topological group and a topological lattice in its new interval topology?'. This problem and the similar problem involving the ideal topology are investigated.

On Extremal Partitions Of Graphs, John A. Mitchem

Dissertations

No abstract provided.

Some External Problems And Charecterization In The Theory Of Graphs., Ramachandra Rao Dr.

Doctoral Theses

Graph theory has become such a well known and widely applied subject that it is not nocessary to give a general Introduetion to it. Instead ve eive helov a summary of the results of the thesis chapterwise.The study of extremal problems in Graph theory was started by Turan who deternined the minimum independence number of a graph on n vertices vith m edges. More recently Harary determined the maxinum conneetivity of a graph on n vortices vith m edges.In a paper concerning the degrees of the vertices of a graphy laktnd posed the following two problems : dotermin the maximum …

Theory Of Equitable Quality Level And Errors- Areas Under The Operating Characteristic Curves Of Lot Acceptance Sampling Plans., M. T. Subramanya Dr.

Doctoral Theses

This monograph deals with the theory of Equitable Quality Level and error-areas under the operating characte- ristic curves of lot acceptance sampling plans. A brief sumnary of the contents is given in Sections 1.2b (pages 15-16) and 2.9 (pages 107-111). A fairly good idea of the topics considored in this monograph can be obtained from the detailod list of contents given in pagos iv- xi.Most of the results given in the monograph are new and have not been published anywhe re. They are based on author's own research work and are contained in his doctoral dissertation.Most of the work connected …

Some Contributions To The Analysis Of Circular Data., J. S. Rao Dr.

Doctoral Theses

In many diverae scientifie fields, one cones serose experimente where the basie variable unter obaervation ia a direction. We ahall be conoerned, throughout this theais, only with diraations in two-dimensions and wo refer to such a collection of directione an 'circular data or dimenstionl data. In order to make a statintical analyaie of circular data, the first prerequisite is to put thom in a quantitative form. One way of doing thie is to represent the directiona anglea no aaured d thre apeet to eone mui tably choscn sero direation. Al ternately, einee a direetion han no nagni- tude, it can …

Calculus And The Computer: A Conservative Approach, Melvin Henriksen

All HMC Faculty Publications and Research

This paper describes a program for making the use of numerical methods an integral part of the freshman college course in single variable calculus.

Simple Algebraic Extensions And Characteristics Polynomials, Don Stokes

Journal of the Arkansas Academy of Science

No abstract provided.

The General Linear Group Related Groups, J. William Beck

Masters Theses

No abstract provided.

A Heuristic Algorithm For Determining A Constructive Suboptimal Solution To The Combinatorial Problem Of Facility Allocation, Harry Kerry Edwards

Doctoral Dissertations

"The major problem in plant layout is to determine the most economical relative location of facilities. There are two distinct types of suboptimal solutions to this combinatorial problem: construction and improvement. The writer has developed Modular Allocation Technique (MAT) which is the first useful construction suboptimal technique. The MAT general algorithm, a theorem relating the MAT solution to the optimal solution and an example problem are given. A computer program has been written that will apply MAT to the allocation problem for a maximum of 40 facilities. Results are given to demonstrate how MAT solutions may be used as initial …

Completeness And Related Topics In A Quasi-Uniform Space, John Warnock Carlson

Doctoral Dissertations

"Completions and a strong completion of a quasi-uniform space are constructed and examined. It is shown that the trivial completion of a T₀ space is T₀ . Examples are given to show that a T₁ space need not have a T₁ strong completion and a T₂ space need not have a T₂ completion. The nontrivial completion constructed is shown to be T₁ if the space is T₁ and the quasi-uniform structure is the Pervin structure. It is shown that a space can be uniformizable and admit a strongly complete quasi-uniform structure and not admit a complete uniform structure. Several counter-examples …

Search Algorithms For The Simple Plant Location Problem, John Bruce Prater

Doctoral Dissertations

"Two algorithms are developed, one exact, one approximate, for finding solutions to the simple plant location problem. Theorems are proved which give sufficient conditions for the inclusion of a plant in the optimal solution. The exact algorithm which is developed is similar to the Branch and Bound method. The approximate technique consists of a directed search through the solution tree for the problem, followed by terminal iterations. The terminal iterations are justified by empirical results obtained from a preliminary version of the technique and a theorem which is proved. Statistics from the results of applying the algorithm to a large …

An Elementary Mathematics Curriculum Study To Determine If Achievement And Attitude Can Be Influenced By A Textbook Adoption, Elsie M. Railey

All Master's Theses

There is on the market a wide range of contemporary mathematics textbooks available. Textbooks approach mathematics differently and there is a variation in terms of the amount of time allocated to a topic, the development of elementary concepts and laws of arithmetic, and the amount of drill and repetition. The sequential development of the texts follows closely, but the scope and content differ significantly. Specifically, it is the purpose of this study to determine if there is a significant difference between series, as opposed to those in another mathematics series, in the variables of attitude and achievement. The two textbooks …

Heuristic Algorithms For The Generalized Vehicle Dispatch Problem, Leland Ray Miller

Doctoral Dissertations

"A heuristic algorithm, called the sweep algorithm, is developed for the vehicle dispatch problem with distance and load constraints for each vehicle. A mathematical development and a step procedure for the sweep algorithm is given. Also given are eight problems and their solutions derived by the sweep algorithm. The solutions for this algorithm are compared with solutions from other vehicle dispatch algorithms, and the sweep algorithm is found to give better results for almost every problem. Various modifications are also presented for the sweep algorithm. A mathematical formulation is given for the vehicle dispatch problem with arbitrary cost functions at …