Statistics and Probability Commons^™

Orthogonal Polynomials, Measures And Recurrence Relations, Joanne Dombrowski, Paul Nevai

Mathematics and Statistics Faculty Publications

Properties of measures associated with orthogonal polynomials are investigated in terms of the coefficients of the three term recurrence formula satisfied by the orthogonal polynomials.

L(P) Estimates For Maximal Functions And Hilbert-Transforms Along Flat Convex Curves In R(2), Hasse Carlsson, Michael Christ, Antonio Cordoba, Javier Duoandikoetxea, Jose L. Rudio De Francia, Jim Vance, Stephen Wainger, David Weinberg

Mathematics and Statistics Faculty Publications

No abstract provided.

On Weighted Integrability Of Trigonometric Series And L¹-Convergence Of Fourier Series, William O. Bray, Caslav V. Stanojević

Mathematics and Statistics Faculty Research & Creative Works

Result concerning integrability of f(x)L(l/x)(g(x)L(l/x)), where f(x)(g(x)) is the pointwise limit of certain cosine (sine) series and L(•) is slowly vary in the sense of Karamata [5] is proved. Our result is an excludedďcase in more classical results (see [4]) and also generalizes a result of G. A. Fomin [1]. Also a result of Fomin and Telyakovskii [6] concerning L1-convergence of Fourier series is generalized. Both theorems make use of a generalized notion of quasi-monotone sequences. © 1986 American Mathematical Society.

Banach Spaces Of Functions Analytic In A Polydisc, Leon M. Hall

Mathematics and Statistics Faculty Research & Creative Works

This paper is concerned with functions of several complex variables analytic in the unit polydisc. Certain Banach spaces to which these functions might belong are defined and some relationships between them are developed. The space of linear functionals for the Banach space of functions analytic in the open unit polydisc and continuous on the unit torus is then described in terms of analytic functions using an extension of the Hadamard product.

Reliable Computation In The Presence Of Noise, Nicholas Pippenger

All HMC Faculty Publications and Research

This talk concerns computation by systems whose components exhibit noise (that is, errors committed at random according to certain probabilistic laws). If we aspire to construct a theory of computation in the presence of noise, we must possess at the outset a satisfactory theory of computation in the absence of noise.

A theory that has received considerable attention in this context is that of the computation of Boolean functions by networks (with perhaps the strongest competition coming from the theory of cellular automata; see [G] and [GR]). The theory of computation by networks associates with any two sets Q and …

Estimation In Truncated Exponential Family Of Distributions, Laxman M. Hegde

Mathematics & Statistics Theses & Dissertations

Estimating the parameters of a truncated distribution is a well known problem in statistical inference. The non-existence of the maximum likelihood estimator (m.l.e.) with positive probability in certain truncated distributions is not well known. To mention a few results in the literature:

(i) Deemer and Votaw 1955 show that the maximum likelihood estimator does not exist in a truncated negative exponential distribution on 0,T , T > 0 known, whenever the sample mean x (GREATERTHEQ) T/2.

(ii) Broeder 1955 shows that the maximum likelihood estimator of the scale parameter of a truncated gamma distribution, with the shape parameter being known, becomes …

On The Mean Time Between Failures For Repairable Systems, Max Engelhardt, Lee J. Bain

Geosciences and Geological and Petroleum Engineering Faculty Research & Creative Works

Much of the recent work on modeling repairable systems involves Poisson processes with nonconstant intensity functions, viz, nonhomogeneous Poisson processes. Since times between failures are not identically distributed when the process is nonhomogeneous, it is not clear what concept should take the place of the mean time between failures in assessing the reliability of a repairable system. A number of alternate concepts can be found in the literature. We investigate the relationship between two of the most frequently considered alternatives: the reciprocal of the intensity function, and the mean waiting time from t until the next failure. Theorem 1 states …

Mathematical Programming Model Of Western Australian Dairy Farms, G R. Olney, D A. Falconer

Animal production and livestock research reports

A profit maximising mathematical programming dairy farm model has been developed which determines the most profitable management strategies for the full year. This model was initially an extension of the one used in the Western Australian Dairy Feed Management Service (DFMS) which determines the most profitable ration to feed for a specific period, the milk yield per cow and the number of cows to milk. The DFMS is useful for formulating a ration for a specific period, particularly during summer on non-irrigated farms in Western Australia when complete hand feeding is required, but it cannot be used to determine optimum …

A Sensitivity Analysis Of The Coefficients For The Transformation Of The Electrocardiographic Orthogonal Three-Lead System (Frank) To The Standard Twelve-Lead System, Rasa Ona Draugelis

Loma Linda University Electronic Theses, Dissertations & Projects

The SENSITIVITY ANALYSIS is performed on the transformation coefficients of the Frank XYZ signals generating standard 12-lead ECG with respect to diagnosis. The analysis is adapted for the individual waveform and per each lead. The disease/abnormality categories are described in terms of discrete pattern classes based on criteria used by Marquette Electronics, Inc. The nonlinear global sensitivity analysis method developed by Shuler, et al, is selected for this project. The diagnostic change in the waveform is denoted by a distance measurement from the pattern class boundary corresponding to the best-experimental coefficient estimates (Dower coefficients) to the alternate coefficient specification measurement …

Ada: A New Programming Language., Daniel C. St. Clair

Mathematics and Statistics Faculty Research & Creative Works

In an attempt to control defense software costs while maintaining system reliability, the DOD (Department of Defense) has sponsored the development of a new programming language, called Ada. While Ada supports many of the features found in Fortran and Pascal, it has additional features making it easier and more reliable to use in large complex engineering software systems. Currently, the DOD is requiring that many new defense software systems be written in Ada. The author reviews the history of Ada's development and examines the primary constructs of the language. The philosophy behind Ada program design is reviewed by designing and …

Cramer Type Large Deviations For Generalized Rank Statistics, Munsup Seoh, Stegan S. Ralescu, Madan L. Puri

Mathematics and Statistics Faculty Publications

A Cramer type large deviation theorem is proved under alternatives as well as under hypothesis for the generalized linear rank statistic which includes as special cases (unsigned) linear rank statistics, signed linear rank statistics, linear combination of functions of order statistics, and a rank combinatorial statistic.

Monte Carlo Simulation Of The Game Of Twenty-One, Douglas E. Loer

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

The purpose of this paper is to demonstrate the application of computer simulation to the game of Twenty-One to predict a player's expected return from the game. Twenty-One has traditionally been one of the most popular casino games and has attracted much effort to accurately estimate the house's true advantage. Probability theory has been tried, but the thousands of different combinations of cards possible in all hands throughout the entire pack make it practically impossible to apply probability theory without overlooking some possibilities. For this reason, Twenty-One is a perfect candidate for simulation. By blocking several simulations, normal theory can …

Comparison Of Bootstrap And Jacknife Statistical Procedures, Amanuel Gobena

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

This report compares the bootstrapping to jacknifing statistical procedures in terms in bias, confidence interval and estimation of median. Related literature have been reviewed. A bootstrap allows a researcher to get an approximation to the distribution of possibly complicated statistical summaries. It is based on random sampling with replacement from experimental units. Jacknife has also been in operation prior to bootstrapping statistical procedure. The jacknife divides the data into subgroups and obtains partial estimates of these subgroups by omitting one subgroup at a time. When both of these statistical resampling procedures are compared the bootstrap has less bias, more accurate …

Multiple Shooting, Monique St-Maurice

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

The purpose of this report was to study the Multiple Shooting method, a numerical method to solve boundary value ordinary differential equation. A FORTRAN program was written to solve the specific problem.

y'' = -y, y(0) = 0, y(π/2) = 1

on a microcomputer, using the microsoft FORTRAN compiler and the 8087 coprocessor.

U.S. Input-Output Data: A 1984 Update, Ronald E. Miller

Accounts and Data

This paper calls attention to the U.S. national input-output data for 1977 and the U.S. multiregional input-output data for the same year; both of these data sets became available during 1984. In particular, the commodity-by- industry accounting scheme which underpins both the 1972 and 1977 U.S. national models (as well as the U.S. 1977 multiregional model), is contrasted with the industry-by-industry approach of the original Leontief framework, which was the basis of the pre-1972 U.S. national tables.

Expressive Power In First Order Topology, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

A first order representation (f.o.r.) in topology is an assignment of finitary relational structures of the same type to topological spaces in such a way that homeomorphic spaces get sent to isomorphic structures. We first define the notions "one f.o.r. is at least as expressive as another relative to a class of spaces" and "one class of spaces is definable in another relative to an f.o.r.", and prove some general statements. Following this we compare some well-known classes of spaces and first order representations. A principal result is that if X and Y are two Tichonov spaces whose posets of …

Perturbation Of Periodic Boundary-Conditions, Larry Turyn

Mathematics and Statistics Faculty Publications

We consider perturbations of the problem (*) - x'' + bx = lambda ax, x(0) - x(1) = 0 = x'(0) - x'(1) both by changes of the boundary conditions and by addition of nonlinear terms. We assume that at lambda = lambda 0 there are two linearly independent solutions of the unperturbed problem (*) and that a(dot) is bounded away from zero. When only the boundary conditions are perturbed either the Hill’s discriminant or the method of Lyapunov–Schmidt reduces the problem to 0 = det ((lambda - lambda 0)A - epsilon …

Approximate Tolerance Limits And Confidence Limits On Reliability For The Gamma Distribution, Lee J. Bain, Max Engelhardt, Wei Kei Shiue

Mathematics and Statistics Faculty Research & Creative Works

No abstract provided.

A Note On Irreducibility And Weak Covering Properties, Joe Mashburn

Mathematics Faculty Publications

A space X is irreducible if every open cover of X has a minimal open refinement. Interest in irreducibility began when Arens and Dugendji used this property to show that metacompact countably compact spaces are compact. It was natural, then, to find out what other types of spaces would be irreducible and therefore compact in the presence of countable compactness or Lindelof in the presence of N₁-compactness. …

It is shown in this paper that T₁ δθ -refinable spaces and T1 weakly δθ-refinable spaces are irreducible. Since examples of Lindelof spaces that are neither T₁ nor …

The Least Fixed Point Property For Ω-Chain Continuous Functions, Joe Mashburn

Mathematics Faculty Publications

A partially ordered set P is ω-chain complete if every countable chain (including the empty set) in P has a supremum. … Notice that an ω-chain continuous function must preserve order. P has the (least) fixed point property for ω-chain continuous functions if every ω-chain continuous function from P to itself has (least) fixed point.

It has been shown that a partially ordered set does not have to be ω-chain complete to have the least fixed point property for ω-chain continuous functions. This answers a question posed by G. Plotkin in 1978. I.I. Kolodner has shown that an ω-chain complete …

Coarse Topologies In Nonstandard Extensions Via Separative Ultrafilters, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

No abstract provided.

Topological Extensions And Subspaces Of Ηα-Sets, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

The η_x-sets of Hausdorff have large compactifications (of cardinality ≽ exp(α); and of cardinality ≽ exp(exp(2^<α)) in the Stone-Čech case). If Q_α denotes the unique (when it exists) η_α -set of cardinality α, then Q_α can be decomposed (= partitioned) into homeomorphs of any prescribed nonempty subspace; moreover the subspaces of Q_α can be characterized as those which arc regular T₁, of cardinality and weight ≼ α, whose topologies are closed under < α intersections.

On The First Passage Time Distribution For A Class Of Markov Chains, Mark Brown, Narasinga Rao Chaganty

Mathematics & Statistics Faculty Publications

Consider a stochastically monotone chain with monotone paths on a partially ordered countable set S. Let C be an increasing subset of S with finite complement. Then the first passage-time from i ∈ S to C is shown to be IFRA (increasing failure rate on the,av;rage). Several applications are presented including coherent systems, shock models, and convolutions of IFRA distributions.

The Lebesgue Integral As The Almost Sure Limit Of Random Riemann Sums, John C. Keffer, Caslav V. Stanojevic

Mathematics and Statistics Faculty Research & Creative Works

A method is given for generating random intermediate points for a sequence of partitions. For the corresponding random Riemann sums it is shown that they converge almost surely to the Lebesgue integral. © 1982 American Mathematical Society.

Tauberian Conditions For V-Convergence Of Fourier Series, Caslav V. Stanojevic

Mathematics and Statistics Faculty Research & Creative Works

It is proved that Fourier series with asymptotically even coefficients and satisfying (formula present here), for some 1 < p < 2, con­verge in L1-norm if and only if (formula present here), where En(t) =Σk=0neiktRecent results of Stanojevic [1], Bojanic and Stanojevic [2], and Goldberg and Stanojevic [3] are special cases of some corollaries to the main theorem. © 1982 American Mathematical Society.

Conjugate Type Boundary Value Problems For Functional-Differential Equations, P. W. Eloe, L. J. Grimm

Mathematics and Statistics Faculty Research & Creative Works

No abstract provided.

A Class Of L¹-Convergence, R. Bojan1c, C. V. Stanojevic

Mathematics and Statistics Faculty Research & Creative Works

It is proved that if the Fourier coefficients (an) of /E L!(0, ir) satisfy (*)L" kp\Aan\p = o(l), for some 1

< 2, then \\sn- f\\ = o(l), if and only if a" lg n * o(l). For cosine trigonometric series with coefficients of bounded variation and satisfying (*) it is proved that a necessary and sufficient condition for the series to be a Fourier series is (an) E 6, where G is the Garrett-Stanojevic [4] class. © 1982 American Mathematical Society.

A Note On Fixed-Point Theorems, Troy L. Hicks, M. D. Humphries

Mathematics and Statistics Faculty Research & Creative Works

In an earlier note, S. P. Singh gave an extension of a theorem of Brosowski in a normed linear space setting. Variants of this theorem are considered in the context of strictly convex, reflexive, and inner product spaces. © 1982.

Evidence Of Intrinsic Double Acceptor In Gaas, Phil Won Yu, W. C. Mithel, M. G. Mier, S. S. Li, Weizhen Wang

Mathematics and Statistics Faculty Publications

Acceptors present in undoped p‐type conducting GaAs have been studied with photoluminescence, temperature‐dependent Hall measurements, deep level transient spectroscopy, and spark source mass spectrometry. It is shown that p‐type conduction is due to presence of the shallow acceptor C_As and the cation antisite double acceptor Ga_As. The first and second ionization energies determined for Ga_As are 77 and 230 meV from the valence‐band edge.

Sequential Probability Ratio Tests For The Shape Parameter Of A Nonhomogeneous Poisson Process, Lee J. Bain, Max Engelhardt

Mathematics and Statistics Faculty Research & Creative Works

Sequential probability ratio tests for the shape parameter of one or more nonhomogeneous Poisson processes, with power intensity functions, are provided. The tests can be performed when the scale parameter is an unknown nuisance parameter; the effective loss of not knowing the scale parameter is one observation per process. The resulting tests can be expressed in terms of the maximum likelihood estimators of the shape parameters for the usual fixed sample procedure. A further advantage of the present approach is that the scale parameters for different processes, in the multiple sample procedures, need not be equal. Approximations for the operating …