Open Access. Powered by Scholars. Published by Universities.®

Statistics and Probability Commons™

Open Access. Powered by Scholars. Published by Universities.®

Mathematics and Statistics Faculty Research & Creative Works

Discipline
Keyword
Publication Year

Articles 361 - 390 of 434

Full-Text Articles in Statistics and Probability

Ensuring The Satisfaction Of A Temporal Specification At Run-Time, Grace Tsai, Matt Insall, Bruce M. Mcmillin Jan 1995

Ensuring The Satisfaction Of A Temporal Specification At Run-Time, Grace Tsai, Matt Insall, Bruce M. Mcmillin

Mathematics and Statistics Faculty Research & Creative Works

A responsive computing system is a hybrid of real-time, distributed and fault-tolerant systems. In such a system, severe consequences can occur if the run-time behavior does not conform to the expected behavior or specifications. In this paper, we present a formal approach to ensure satisfaction of the specifications in the operational environment as follows. First we specify behavior of the systems using Interval Temporal Logic (ITL). Next we give algorithms for trace checking of programs in such systems. Finally, we present a fully distributed run-time evaluation system which causally orders the events of the system during its execution and checks …

Go to article

Right Angle Electrical Connector And Insertion Tool Therefor, Stephen L. Clark, Glenn J. Pontius Jan 1995

Right Angle Electrical Connector And Insertion Tool Therefor, Stephen L. Clark, Glenn J. Pontius

Mathematics and Statistics Faculty Research & Creative Works

Disclosed is a multi-row right angle connector and a press block for installing the connector on a mounting substrate without soldering the contact pins. The connector legs comprise "eye of the needle" compliant interfaces that make electrical contact with the interior surfaces of the substrate's plated through holes. The press block is designed for use with a four-row right angle receptacle and locates rows 2, 3, and 4 on respective true grid positions and serves as a means for transmitting force from an external press to the contact pin tails. The contact tails in rows 2, 3, and 4 have …

Go to article

Computing Χ² Values, John F. Dooley, Daniel C. St Clair, William E. Bond Dec 1994

Computing Χ² Values, John F. Dooley, Daniel C. St Clair, William E. Bond

Mathematics and Statistics Faculty Research & Creative Works

Textbooks and courses on numerical algorithms contain numerous examples which lead students to believe that the algorithm of choice for computing the zeros of a function f1994 is Newton's algorithm. In many of these courses little or no time is spent in providing students with "real world" experiences where Newton's method fails. The work presented in this paper describes a slow convergence problem encountered while trying to use Newton to estimate values for the 2 distributions. The problem occurred while the authors were trying to implement a well-known machine learning algorithm from the field of artificial intelligence. The function being …

Go to article

Using The Id3 Symbolic Classification Algorithm To Reduce Data Density, Barry Fiachsbart, Daniel C. St. Clair, Jeff Holland Apr 1994

Using The Id3 Symbolic Classification Algorithm To Reduce Data Density, Barry Fiachsbart, Daniel C. St. Clair, Jeff Holland

Mathematics and Statistics Faculty Research & Creative Works

Effective data reduction is mandatory for modeling complex domains. The work described here demonstrates how to use a symbolic classifier algorithm from machine learning to effectively reduce large amounts of data. The algorithm, Quirdan's ID3, uses input data records and corresponding classifications to produce a decision tree. The resulting tree can be used to classify previously unseen inputs. Alternatively, the attributes found in the tree can be used as the basis to develop other system modeling techniques such as neural networks or mathematical programming algorithms. This approach has been used to effectively reduce data from a large complex domain. The …

Go to article

Classification Characteristics Of Som And Art2, J. J. Aleshunas, Daniel C. St. Clair, William E. Bond Apr 1994

Classification Characteristics Of Som And Art2, J. J. Aleshunas, Daniel C. St. Clair, William E. Bond

Mathematics and Statistics Faculty Research & Creative Works

Artificial neural network algorithms were originally designed to model human neural activities. They attempt to recreate the processes involved in such activities as learning, short term memory, and long-term memory. Two widely used unsupervised artificial neural network algorithms are the Self-Organizing Map (SOM) and Adaptive Resonance Theory (ART2). Each was designed to simulate a particular biological neural activity. Both can be used as unsupervised data classifiers. This paper compares performance characteristics of two unsupervised artificial neural network architectures; the SOM and the ART2 networks. The primary factors analyzed were classification accuracy, sensitivity to data noise, and sensitivity of the algorithm …

Go to article

Elimination Of Supply Harmonics: An Evolution Of Current Compensation And Active Filtering Methods, Stephen L. Clark, P. Famouri, W. L. Cooley Jan 1994

Elimination Of Supply Harmonics: An Evolution Of Current Compensation And Active Filtering Methods, Stephen L. Clark, P. Famouri, W. L. Cooley

Mathematics and Statistics Faculty Research & Creative Works

The price of the extensive use of power electronic devices is becoming clear: increasing harmonic "pollution." This survey takes a brief look at background information related to harmonics, including their sources, effects, and characteristics. Then, the evolution of the harmonics elimination approaches of current compensation and active filtering, which are becoming more feasible due to research and technological improvements, are discussed in order to give some insight into the directions that research is taking.

Go to article

Fixed Point Theorems For Non-Self Maps I, Troy L. Hicks, Unda Marie Sauga Jan 1994

Fixed Point Theorems For Non-Self Maps I, Troy L. Hicks, Unda Marie Sauga

Mathematics and Statistics Faculty Research & Creative Works

Suppose f:C→X where C is a closed subset of X. Necessary and sufficient conditions are given for f to have a fixed point. All results hold when X is complete metric space. Several results hold in a much more general setting. © 1994, Hindawi Publishing Corporation. All rights reserved.

Go to article

Feasibility Test Verification Method For Nonsymmetric Release Time Task Scheduling, R. G. Karl, T. L. Lo, Daniel C. St. Clair Jan 1993

Feasibility Test Verification Method For Nonsymmetric Release Time Task Scheduling, R. G. Karl, T. L. Lo, Daniel C. St. Clair

Mathematics and Statistics Faculty Research & Creative Works

This paper discusses problems associated with scheduling periodic task on a uniprocessor in a hard, real-time processing environment using a static-priority, preemptive-resume operating system. Task sets containing a single periodic task with two Ned release periocis of unequal length are examined. Ihe nonsymmetric scheduling algorithm is based on the rate monotonic scheduling algorithm which assigns higher task priorities to tasks with shorter release periods. me effects on processor utilization using two dirkrent priority assignment schemes are examined; one with task priorities sorted by the average release periods and the other with priorities sorted using the short nonsymmetric task period with …

Go to article

Fixed Points For Pairs Of Mappings In D-Complete Topological Spaces, Troy L. Hicks, B. E. Rhoades Jan 1993

Fixed Points For Pairs Of Mappings In D-Complete Topological Spaces, Troy L. Hicks, B. E. Rhoades

Mathematics and Statistics Faculty Research & Creative Works

Several important metric space fixed point theorems axe proved for a large class of non-metric spaces. In some cases, the metric space proofs need only minor changes. This is surprising since the distance function used need not be symmetric and need not satisfy the triangular inequality. © 1993, Hindawi Publishing Corporation. All rights reserved.

Go to article

The Next Linear Collider Test Accelerator, R. D. Ruth, C. Adolphsen, K. Bane, R. F. Boyce, D. L. Burke, R. Calin, G. Caryotakis, R. Cassel, Stephen L. Clark, H. Deruyter, K. Fant, R. Fuller, S. Heifets, H. Hoag, R. Humphrey, S. Kheifets, R. Koontz, N. M. Kroll, R. T. Lavine, G. A. Loew, A. Menegat, R. H. Miller, C. Nantista, J. M. Patterson, C. Pearson, R. Phillips, J. Rifkin, J. Spencer, S. Tantawi, K. A. Thompson, A. Vlieks, V. Vylet, J. W. Wang, P. B. Wilson, A. Yeremian, B. Youngman Jan 1993

The Next Linear Collider Test Accelerator, R. D. Ruth, C. Adolphsen, K. Bane, R. F. Boyce, D. L. Burke, R. Calin, G. Caryotakis, R. Cassel, Stephen L. Clark, H. Deruyter, K. Fant, R. Fuller, S. Heifets, H. Hoag, R. Humphrey, S. Kheifets, R. Koontz, N. M. Kroll, R. T. Lavine, G. A. Loew, A. Menegat, R. H. Miller, C. Nantista, J. M. Patterson, C. Pearson, R. Phillips, J. Rifkin, J. Spencer, S. Tantawi, K. A. Thompson, A. Vlieks, V. Vylet, J. W. Wang, P. B. Wilson, A. Yeremian, B. Youngman

Mathematics and Statistics Faculty Research & Creative Works

During the past several years, there has been tremendous progress on the development of the RF system and accelerating structures for a Next Linear Collider (NLC). Developments include high-power klystrons, RF pulse compression systems and damped/detuned accelerator structures to reduce wakefields. In order to integrate these separate development efforts into an actual X-band accelerator capable of accelerating the electron beams necessary for an NLC, we are building an NLC Test Accelerator (NLCTA). The goal of the NLCTA is to bring together all elements of the entire accelerating system by constructing and reliably operating an engineered model of a high-gradient linac …

Go to article

Prediction Intervals Based On Partial Observations For Some Discrete Distributions, Lee J. Bain, Jagdish K. Patel Jan 1993

Prediction Intervals Based On Partial Observations For Some Discrete Distributions, Lee J. Bain, Jagdish K. Patel

Mathematics and Statistics Faculty Research & Creative Works

Prediction limits of the following type are considered for the binomial, hypergeometric, and negative-binomial distributions. For the binomial distribution, suppose Xr successes have occurred in the first r trials, and based on this partial information it is desired to predict the total number of successes Xs (r < s), which will have occurred by trial s. Similar results are considered for the Poisson and negative-binomial distributions. The results are expressed in terms of well-known distributions which have been tabulated, but it is quite tedious to carry out the procedures based on available tables. Normal (Gaussian) approximations are provided which makes these methods convenient to apply. © 1993 IEEE

Go to article

Boundedness And Periodic Solutions In Infinite Delay Systems, Roger H. Hering Jan 1992

Boundedness And Periodic Solutions In Infinite Delay Systems, Roger H. Hering

Mathematics and Statistics Faculty Research & Creative Works

Liapunov methods are used to give conditions ensuring that solutions of infinite delay equations are uniformly bounded and uniformly ultimately bounded with respect to unbounded (Cg) initial function spaces; and the connection to proving existence of periodic solutions is examined. Several examples illustrate the application of these results, especially to integrodifferential equations. © 1992.

Go to article

Fixed Point Theorems For D-Complete Topological Spaces I, Troy L. Hicks Jan 1992

Fixed Point Theorems For D-Complete Topological Spaces I, Troy L. Hicks

Mathematics and Statistics Faculty Research & Creative Works

Generalizations of Banach's fixed point theorem are proved for a large class of non-metric spaces. These include d-complete symmetric (semi-metric) spaces and complete quasi-metric spaces. The distance function used need not be symmetric and need not satisfy the triangular inequality. © 1992, Hindawi Publishing Corporation. All rights reserved.

Go to article

Prediction Intervals, Based On Ranges And Waiting Times, For An Exponential Distribution, Laura Colangelo, Jagdish K. Patel Jan 1992

Prediction Intervals, Based On Ranges And Waiting Times, For An Exponential Distribution, Laura Colangelo, Jagdish K. Patel

Mathematics and Statistics Faculty Research & Creative Works

This article contains two prediction intervals applicable to a 2-parameter as well as a 1-parameter exponential distribution. One can be used to predict a future sample range on the basis of an observed sample range. Appropriate prediction factors are tabulated. The other can be used to predict a waiting time between two future successive failures on the basis of an observed waiting time between two previous successive failures. © 1992 IEEE

Go to article

Oscillations In Lotka-Volterra Systems Of Chemical Reactions, Roger H. Hering Jun 1990

Oscillations In Lotka-Volterra Systems Of Chemical Reactions, Roger H. Hering

Mathematics and Statistics Faculty Research & Creative Works

For a chemical reaction system modeled by x =k1Ax -k2x2 -k3xy +k4y2, y =k3xy -k4y2 -k5y +k6B, it is shown that for each positive choice of parameters k1A, B there exists a unique stationary state which is globally asymptotically stable in the positive quadrant. A criterion for the non-existence of periodic solutions is given for the generalized Lotka-Volterra system:x = f(x)h(x, y), y. © 1990 J.C. Baltzer AG, Scientific Publishing Company.

Go to article

Robustness & Precision Of Parametric & Distribution-Free Tolerance Limits For Two Lifetime Distributions, Wei Kei Shiue, Lee J. Bain Jan 1989

Robustness & Precision Of Parametric & Distribution-Free Tolerance Limits For Two Lifetime Distributions, Wei Kei Shiue, Lee J. Bain

Mathematics and Statistics Faculty Research & Creative Works

Exact parametric tolerance limits or confidence limits on reliability are not available for the gamma distribution, and it is, difficult to determine approximate methods which are accurate for all parameter values. The precision lost by using the distribution-free tolerance-limit method based on the first order statistic, compared to using an approximate gamma tolerance limit method is studied. The robustness of the approximate gamma tolerance limit when the true model is Weibull and the robustness of a Weibull tolerance limit when the true model is gamma are also studied. The efficiency of the distribution-free method ranges from about 0.60 to 0.90 …

Go to article

Periodic Points For Homeomorphisms Of Hereditarily Decomposable Chainable Continua, W. T. Ingram Jan 1989

Periodic Points For Homeomorphisms Of Hereditarily Decomposable Chainable Continua, W. T. Ingram

Mathematics and Statistics Faculty Research & Creative Works

In this paper it is shown that homeomorphisms of hereditarily decomposable chainable continua cannot have periodic points whose periods are not powers of two. Examples show that for each power of two there is a hereditarily decomposable chainable continuum and a homeomorphism of it which has a periodic point of period that power of two. © 1989 American Mathematical Society.

Go to article

Sharp Lower Bounds For A Generalized Jensen Inequality, A. K. Rigler, S. Y. Trimble, R. S. Varga Jan 1989

Sharp Lower Bounds For A Generalized Jensen Inequality, A. K. Rigler, S. Y. Trimble, R. S. Varga

Mathematics and Statistics Faculty Research & Creative Works

No abstract provided.

Go to article

Impedance Controlled Connector Interface, Stephen L. Clark Jan 1989

Impedance Controlled Connector Interface, Stephen L. Clark

Mathematics and Statistics Faculty Research & Creative Works

A connector interface for electrically mating a multi-row connector with a printed circuit board is defined by a flex circuit in the form of laminated polyimide layers having conductive traces for each interconnect pair with connection fields at the opposite ends of the traces for electrical connection to the terminal pins on the connector and the conductive pads or pins on the circuit board. The conductive traces are all of equal length to provide equal resistance and impedance paths for each of the circuit interconnects.

Go to article

Concerning Periodic Points In Mappings Of Continua, W. (William) T. (Thomas) Ingram Oct 1988

Concerning Periodic Points In Mappings Of Continua, W. (William) T. (Thomas) Ingram

Mathematics and Statistics Faculty Research & Creative Works

In this paper we present some conditions which are sufficient for a mapping to have periodic points. © 1988 American Mathematical Society.

Go to article

Computer Science—A Mathematical Science And Accreditation, Frank Garnett Walters Sep 1988

Computer Science—A Mathematical Science And Accreditation, Frank Garnett Walters

Mathematics and Statistics Faculty Research & Creative Works

No abstract provided.

Go to article

Recruiting More Computer Science Students - What To Do After The "Glamour" Has Gone Away?, William E. Mcbride, James Calhoun, James Richards, Harriet Taylor, Frank Garnett Walters Feb 1988

Recruiting More Computer Science Students - What To Do After The "Glamour" Has Gone Away?, William E. Mcbride, James Calhoun, James Richards, Harriet Taylor, Frank Garnett Walters

Mathematics and Statistics Faculty Research & Creative Works

The moderator will first focus on the question: "Are enrollments actually declining in computer science programs across this country?" He will report the results of his surveys which indicate there has been a definite downturn in enrollment over the past two years. The panelists will then discuss what is being done at their schools to recruit students and to meet this new challenge of declining enrollments.

Go to article

Recruiting More Computer Science Students—What To Do After The “Glamour” Has Gone Away?, William E. Mcbride, James Calhoun, James L. Richards, Harriet G. Taylor, Frank Garnett Walters Feb 1988

Recruiting More Computer Science Students—What To Do After The “Glamour” Has Gone Away?, William E. Mcbride, James Calhoun, James L. Richards, Harriet G. Taylor, Frank Garnett Walters

Mathematics and Statistics Faculty Research & Creative Works

The moderator will first focus on the question: "Are enrollments actually declining in computer science programs across this country?" He will report the results of his surveys which indicate there has been a definite downturn in enrollment over the past two years. The panelists will then discuss what is being done at their schools to recruit students and to meet this new challenge of declining enrollments. © 1988, ACM. All rights reserved.

Go to article

Structure Of Fourier And Fourier-Stieltjes Coefficients Of Series With Slowly Varying Convergence Moduli, Časlav V. Stanojević Jan 1988

Structure Of Fourier And Fourier-Stieltjes Coefficients Of Series With Slowly Varying Convergence Moduli, Časlav V. Stanojević

Mathematics and Statistics Faculty Research & Creative Works

No abstract provided.

Go to article

A Fixed Point Theorem Revisited, Alberta Bollenbacher, Troy L. Hicks Jan 1988

A Fixed Point Theorem Revisited, Alberta Bollenbacher, Troy L. Hicks

Mathematics and Statistics Faculty Research & Creative Works

A version of a theorem commonly referred to as Caristi's Theorem is given. It has an elementary constructive proof, and it includes many generalizations of Banach's fixed point theorem. Several examples illustrate the diversity that can occur. © 1988 American Mathematical Society.

Go to article

Generalized Homogeneity Of Finite And Of Countable Topological Spaces, J. J. Charatonik, W. J. Charatonik Jan 1988

Generalized Homogeneity Of Finite And Of Countable Topological Spaces, J. J. Charatonik, W. J. Charatonik

Mathematics and Statistics Faculty Research & Creative Works

Finite and countable topological spaces are investigated which are homogeneous, homogeneous with respect to open mappings or with respect to continuous ones. It is shown that for finite spaces all three concepts of homogeneity coincide, while for countable or for uncountable ones they are distinct. Some characterization of countable spaces that are homogeneous in either sense are found for the metric setting.

Go to article

Generalizations Of The Sidon-Telyakovskii Theorem, Caslav V. Stanojevic, Vera B. Stanojevic Jan 1987

Generalizations Of The Sidon-Telyakovskii Theorem, Caslav V. Stanojevic, Vera B. Stanojevic

Mathematics and Statistics Faculty Research & Creative Works

The well-known Sidon-Telyakovskii integrability condition is considerably lightened as follows. © 1987 American Mathematical Society.

Go to article

Typically Real Functions And Typically Real Derivatives, S. Y. Trimble Jan 1987

Typically Real Functions And Typically Real Derivatives, S. Y. Trimble

Mathematics and Statistics Faculty Research & Creative Works

Sufficient conditions, in terms of typically real derivatives, are given which force functions to be univalent. © 1987, Hindawi Publishing Corporation. All rights reserved.

Go to article

Three Partition Refinement Algorithms, Robert Paige L., Robert Endre Tarjan Jan 1987

Three Partition Refinement Algorithms, Robert Paige L., Robert Endre Tarjan

Mathematics and Statistics Faculty Research & Creative Works

We present improved partition refinement algorithms for three problems: lexicographic sorting, relational coarsest partition, and double lexical ordering. Our double lexical ordering algorithm uses a new, efficient method for unmerging two sorted sets.

Go to article

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

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.

Go to article

First Prev Next Last