Mathematics Commons^™

Random Ergodic Sequences And P-Occupancy Sets, Jacob Israel Reich

Mathematics & Statistics ETDs

In this paper we study the behavior of random probability measures...

A Metric Graph Structure For Information Retrieval, Karl Jerry Melendez

Mathematics & Statistics ETDs

Document retrieval systems accept a user request for information and respond with a list of documents which contain information relevant to the request. When the documents (or abstracts of the documents) are stored in a computer memory, a function can be defined which estimates the semantic distance between documents. If this function together with the set of documents forms a metric space, a graph, which I call a progressive graph, can be constructed to aid the search for the documents with relevant information.

Progressive graphs are studied and the search algorithms which use this graph structure are presented. The search …

Estimation Of Growth Curves By Least Square Splines, Dorothy Rybaczyk Pathak

Mathematics & Statistics ETDs

The primary object of this dissertation is to present some con­tributions to the theory of estimation of growth curves by least square splines in the presence of unknown unequal variances. The theoretical developments rest heavily on the standard least square theory and the theory of polynomial spline functions. A modifica­tion of the Aitken procedure of weighted least squares is used to estimate regression parameters. It is shown that this modification of the Aitken procedure does not unduly influence the nice least square properties of estimators so obtained; the estimators re­ main unbiased, consistent and asymptotically efficient.

The techniques developed in …

Levi Structures For Polynomial Ideals., Richard Michael Grassl

Mathematics & Statistics ETDs

Let R be the ring of polynomials in a denumerable set of independent indeterminates over a field F and let I be an ideal (Xo,x1,x2, ... ) in R. A Levi structure for I provides bases for I and R as vector spaces over F and an associated algorithm for determining whether an element of R is in I.

Such structures have been developed previously for certain principal differential ideals [i.e., ideals (Xc),x1 , ... ) with xj the j-th derivative of Xol in which the generator is homogeneous and isobaric and for a family of related ordinary ideals. The …

Branching Processes With Cataclysmic Environmental Changes., Juan F. Corona-BurgueñO

Mathematics & Statistics ETDs

In this dissertation we consider a continuous time branching process with a random environment in which the environment changes according to a continuous time Markov chain. The extinction problem for this model is posed and solved by two distinct methods: by the method of random evolutions of Griego and Hersh and by the results of Athreya and Karlin on branching processes with random environments. Limit theorems for the population size as well as a system of partial differential equations for the expected number of particles (as functions of time) are obtained.

Independence, Essential Independence And Zero Correlation Of Two Random Variables Conditioned On A Third., Chester Raymond Crain Jr.

Mathematics & Statistics ETDs

In a recent paper Stoughton Bell and William J. Zimmer defined three distinct types of conditional independence; which they call pointwise, intervalwise and strong; of two random variables given a third. They considered these and four closely related independence properties, and they examined the relationships among the 128 (=23+4) Boolean combinations. Bell and Zimmer also considered the kinds of assumptions in applied research that would give rise to each type of conditional independence.

I have searched published texts and papers in probabil­ity and statistics for the three types of conditional inde­pendence. The type considered by Alfred Renyi [Foundations of Probability …

The Numerical Solution Of The Generalized Eigenvalue Problem For Rectangular Matrices, Charles Henry Burris Jr.

Mathematics & Statistics ETDs

This paper studies the Generalized Eigenvalue Problem Ax=λBx for real, rectangular matrices A and B. Several current algorithms for solving this problem are examined, most of which involve a determination of the rank of B, or one of its submatrices. An example is given in which such a decision cannot be made without introducing unnecessary error into the problem. The QZR Algorithm is then introduced as an algorithm which uses unitary transformations to reduce the matrices to a prescribed canonical form. This canonical form provides the information necessary for making decisions about rank. Since A and B can be non …

A Method Of Moments Applied To An Invariant Imbedding Solution Of A Certain Class Of Fredholm Integral Equations., Grenfell Paul Boicourt

Mathematics & Statistics ETDs

This dissertation first develops a method for solving the integral equation when y(z') is a constant and then extends it to the case where y(z') is a step function. The solution of the integral equation is achieved by solving the integro differential invariant imbedding equations derived from the integral equation by varying the limits of integration. The imbedding equations are solved using a moment method which reduces the calculation to an initial value problem. Proofs of the existence and convergence of the method are given. In the case where y(z') is a constant, the solution of the integral equation is …

Line Critical Point Determining And Point Distinguishing Graphs.Geodetic Orientations Of Complete K-Partite Graphs., Larry Dean Gassman

Mathematics & Statistics ETDs

I. Sumner defined a graph to be point determining if and only if distinct points have distinct neighborhoods and he has characterized connected line-critical point determining graphs. Here a short alternate proof of his characterization is provided and arbitrary line-critical point determining graphs are then characterized. Next line-critical point distinguishing graphs are considered; a graph is point distinguishing if and only if it is the complement of a point determining graph. Finally line-critical graphs that are both point determining and point distinguishing are characterized.

II. Ore defined a graph to be geodetic if and only if there is a unique …

Estimation Of Probability Functions Using Splines., Douglas Wade Hill

Mathematics & Statistics ETDs

In this paper, three classes of spline functions are applied to the problem of estimating probability distribution and density functions. In each case, it is shown that the spline function approximating the sample cumulative distribution function converges almost surely to the unknown distribution, F, given that F has at least two continuous derivatives. If F has three or more continuous derivatives, the derivative of the spline converges to the density function. For polynomial splines of sufficiently high degree if F has k continuous derivative, the rate of convergence for the j-th derivative is shown to be 0(hk-j-1/2) where h is …

A General Lr(K) Parser Building Algorithm, Thomas Joshua Sager

Mathematics & Statistics ETDs

The problem is to find an efficient algorithm that, given the productions of a context-free grammar G, will discover whether G is LR(k) for given k and if it is build an efficient parser for G . The algorithm is given in Section 8. It is essentially a synthesis of the best parts of Knuth's and DeRemer's algorithms. On simple LR(k) grarranars it yields a result equivalent to DeRemer's algorithm, and like Knuth's algorithm it will work on all LR(k) grammars.

Convergence Lattices, Armando Rosario Gingras

Mathematics & Statistics ETDs

This study is concerned with complete lattices in which order convergence coincides with topological convergence with respect to the order topology. Such lattices are termed convergence lattices. After a brief discussion of topology on lattices (Introduction), some preliminary results concerning order convergence and the order topology are presented (Section 1). Several theorems characterizing convergence lattices are presented in Section 2. There it is shown that every neighborhood of a point of a convergence lattice contains an interval that is also a neighborhood of the point. It is also shown that each complete chain, each arbitrary product of convergence lattices, and …

Backward And Forward Equations For Random Evolutions., Manuel Keepler

Mathematics & Statistics ETDs

Let V= [v(t),t>=0] be a separable right continuous Markov hain with state space [1,…,N], stationary transition probabilities Pij(t) and infinitesimal matrix Q=(Qij). Let [Ti(t),t>=0, i=1,…,N] be a family of strongly continuous uniformly bounded semigroups of bounded linear operators on a Banach space B. Ai is the infinitesimal generator of T1.

Adaptive Prediction Of Stationary Time Series By Modified Conjugate Direction Methods, James Otto Friel

Mathematics & Statistics ETDs

We consider the problem of obtaining finite memory linear one-step predictors for a non-deterministic weakly stationary stochastic process {u_t : t = 0, ± 1, ± 2, ± ···} which have minimum mean square error. If φ(k) = Ɛ u_t u_t+k is the (unknown) covariance function for the process this problem reduces to solving the system of linear equations φ x = φ where φ = (φ(1), φ(2), ..., φ(d)), φ = (φ(i - j)) i, j = 1, 2, ..., d. Two iterative procedures are developed for producing a sequence of estimators {x_n}_{n=1 …}

Uniform Convergence Of Lacunary Fourier Series, Julio Edgardo Barety

Mathematics & Statistics ETDs

Let G be a compact group and its dual group which we suppose to be countable. We suppose that S = {_n}_n≥0 is a non-decreasing sequence of finite subsets of having the property that = . If F is the topological dual of a homogeneous Banach space B provided with its norm topology, one can then define in a natural way convergence in norm in F with respect to the sequence S. With F one can associate two Banach spaces F_b and F_c consisting of those elements of F whose Fourier series has bounded …

Patricia-Ii Two Level Overlayed Indexes For Large Libraries., James Leon Clark

Mathematics & Statistics ETDs

PATRICIA is a Practical Algorithm To Retrieve Informa­tion Coded In Alphanumeric. The library index built by PATRICIA is entirely core resident. PATRICIA-II extends PATRICIA by building both a lower index and an upper index. This allows for the indexing of a much larger library. The lower index is core resident and the upper index is divided into upper pages which are stored on disk. At any given time only the lower index and one upper page are in core. Upper pages reference only themselves, not each other. In addition to these innovations, PATRICIA-II retains all of the features of its …

Application Of Fast Poisson Solvers To The Numerical Approzimation Of Parabolic Problems., Billy Lewis Buzbee

Mathematics & Statistics ETDs

Let T be a positive constant, let D^n be the interior of the unit hypercube in R^n with boundary ∂D^n, let a(t;x1,x2,…,xn) be a strictly positive funtion, and consider the parabolic problem ut= ∇*a ∇u + s(t;x1,x2,…,xn) in D^nx[0,T]

Where

U(t)=0 on ∂D^nx[0,T]

And

U(0)=f

This report compares three A-stable marching procedures for approximating this problem by finite differences. The procedures considered are the pure explicit procedure (APX) with 6t sufficiently restricted to insure A-stability, the pure implicit procedure (PM) or backwards difference equation, and a recently developed pure implicit procedure (SOC) which is second order correct in time and …

Some Problems In Combinatorial Number Theory., Frank Ernest Higgins

Mathematics & Statistics ETDs

In this paper we consider three unrelated problems in combinational number theory. The first of these pertains to minimal residual polynomials, the second to certain group factorizations and the third to the addition of positive integers in their Zeckendorf representations.

In section II We show that for any given positive integer m there exists a unique integer monic polynomial P of least degree and whose coefficients satisfy certain inequalities with the property that m divides P(x) for every integer x. This polynomial is called the minimal residual polynomial modulo m. We then show that this polynomial assumes various forms which …

Isopathic Graphs And Airport Graphs, Kim T. Rawlinson

Mathematics & Statistics ETDs

This paper explores two kinds of graphs, isopathic graphs and air­ port graphs. A distance property of graphs in general is also examined.

Isopathic graphs are graphs in which every maximal path has the same length. The major theorem of this section characterizes isopathic graphs as extended stars, bipartite or hamiltonian. There is then a discussion of the latter two classes of isopathic graphs.

At the end of Section I, there is an introduction to isopathic di­graphs, a natural concern after an exposure to isopathic graphs.

Airport graphs, more appropriately snob graphs, can be thought of in the following way. …

Branches And Completions For Real Algebraic Curves, Arthur E. Bukowski

Mathematics & Statistics ETDs

Let Q be a real ideal in a commutative ring A over an ordered field k. Do the classical results of cummutative rings hold for the ideal Q, the realradical of Q, and the real primes of A? We deal with these questions in Section 1. We prove that the minimal realprimes of Q are the minimal primes of Hence the minimal real primes of A are the minimal primes of some a_iϵ A}. A finitely generated realsimple ring isin fact a field and so any maximal realideal in a finitely generated ring A|k is a maximal ideal. …

Operators As Elements In A Partially Ordered Linear Algebra., Edward Wayne Davenport

Mathematics & Statistics ETDs

R. DeMarr {unpublished) has begun a study of linear operators as elements in a Dedekind O-complete partially ordered linear algebra {dsc-pola). The order structure necessary to produce elements in a dsc-pola which behave as specific operators on a specific space of functions is studied.

A Maximum Principle For Time-Lag Control Problems With Bounded States, Gary R. Bunce

Mathematics & Statistics ETDs

A maximum principle is obtained for control problems involving system equations with a constant time lag in the control and state variables. The arcs under consideration are subject to constraints of the form

The results are obtained using the method of M. R. Hestenes.

Some Applications Of Decompositions Of The Identity To Ordered Vector Spaces., John Annulis

Mathematics & Statistics ETDs

We study decompositions of the identity (for definition see Vulikh [13]) in Dedekind a-complete vector lattices. In Chapter 1, we define and develop a notion of continuous elements with respect to a decomposition of the identity. We shall also develop a spectral theory for these elements. In Chapter 2, two Stieltjes-type type integrals are defined with respect to decompositions of the identity. The relationship of these integrals to the continuous elements is then explored. In Chapter 3, we prove two results in ordered vector spaces. The first result is that every infinite dimensional Dedekind complete vector lattice has a base …

A Maximum Principle For An Optimal Control Problem With Integral Constraints., Vernon Bakke

Mathematics & Statistics ETDs

In this problem necessary conditions are obtained for an optimal control problem ·whose state variables are given in terms of integral equations. The conditions are obtained separately for Volterra equations and Fredholm equations. The main result for each case is the maximum principle and multiplier rule. For the Volterra equations, transversality conditions are obtained.

Convergence Rates For The Central Limit Theorem For Random Sums, Christopher E. Olson

Mathematics & Statistics ETDs

Let (X_i} be a sequence of independent, identically-distributed random variables with EX²_i < ꝏ and E(X_i - EX_i)² = 1.

On Some Special Classes Of Partially Ordered Linear Algebras., Taen-Yu Dai

Mathematics & Statistics ETDs

R. DeMarr (unpublished) has begun a study of Banach algebras as subalgebras of partially ordered linear algebras which are Dedekind a -complete. In [3] he has shown that the real Banach algebra of norm-bounded linear operators (mapping a real Banach space into itself) can be made into a partially ordered linear algebra which is Dedekind a -complete. This leads us to study a more gen­eralized function algebra by using the order structure. In this paper from analytical point of view we will study some special classes of partially ordered linear algebras which are Dedekind a -complete. In chapter 1 we …

Stacking Methods And Mixing Properties Of Measure-Preserving Transformations., Sarah Lee Meyer Christiansen

Mathematics & Statistics ETDs

In this paper we study ergodic and mixing properties of transformations. Stacking methods are employed to construct the transformations used in this paper. Number theoretical methods are developed and used to study mixing properties. Two new mixing properties B-mixing and S-mixing are defined, and are shown to be between partial mixing and weak mixing. Finally a transformation is constructed which is weak mixing but not S-mixing, and hence not partially mixing. Several applications to additive number theory are given.

Random Evolutions On Diffusion Processes, Donald Quiring

Mathematics & Statistics ETDs

Let {V(t,ω), t ≥ O, ω ε Ω} be a diffusion process on the real line with infinitesimal operator 1/2σ²(⋅)D² + m(⋅)D. Markov processes {V_n, n = 1,2,....} on the real line are constructed in such a way that the paths of V_n are step functions with jump size n^-1/2 and

P_O [lim sup |V_n(s)-V(s)| = 0] =1

n∞ 0≤s≤t,

where P_O assigns probability one to paths starting at the origin at t = 0.

Let {T_V(t), t≥0, vε R} be a family of linear contraction operators …

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 …

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

Mathematics & Statistics ETDs