FalseAlarm and NonDetection Probabilities for Online Quality Control via HMM


 Randall Malone
 1 years ago
 Views:
Transcription
1 Int. Journal of Math. Analysis, Vol. 6, 2012, no. 24, FalseAlarm and NonDetection Probabilities for Online Quality Control via HMM C.C.Y. Dorea a,1, C.R. Gonçalves a, P.G. Medeiros b and W.B. Santos a a Universidade de Brasilia BrasiliaDF, Brazil b Universidade Federal do Rio Grande do Norte NatalRN, Brazil Abstract Online quality control during production calls for monitoring produced items according to some prescribed strategy. It is reasonable to assume the existence of system internal nonobservable variables so that the carried out monitoring is only partially reliable. In this note, under the setting of a Hidden Markov Model (HMM) and assuming that the evolution of the internal state changes are governed by a twostate Markov chain, we derive estimates for falsealarm and nondetection malfunctioning probabilities. Kernel density methods are used to approximate the stable regime density and the stationary probabilities. As a side result, alternative monitoring strategies are proposed. Mathematics Subject Classification: 60J20, 60J10, 90B30 Keywords: Hidden Markov model; Falsealarm; Kernel density methods 1. Introduction Limited by the cost function a sampling interval m is selected and classical online quality control during production adopts the procedure of monitoring the sequence of items, independently produced, by examining a single item at every m produced items. Based on the quality requirements and on the distribution of the examined variable a control region C is prespecified. If the examined item satisfies the control limits, the process is said to be in 1 Corresponding author : Research partially supported by CNPq, CAPES, FAPDF and FINATEC.
2 1154 C.C.Y. Dorea, C.R. Gonçalves, P.G. Medeiros and W.B. Santos control and the production continues; otherwise, the process is declared out of control and the production is stopped for adjustments. After adjustments the production is resumed and it is in control again. At each stoppage a new production cycle is defined (see, for example, [4]). Suppose now the internal working status of the system is nonobservable and may change from a good working condition (on control) to a deteriorating status (out of control). In [2] it is proposed a model where these changes are governed by a twostate Markov chain {θ n } n 0. When θ n = 0 the process is said to be in control at time n; and, if θ n = 1 the process is out of control. In their proposal, an observable random variable X n, related to characteristics of interest, is examined at every m produced items. It is assumed that X n has a Gaussian distribution, N (μ, σ 2 ), with μ = μ θn. And values of m as well as the parameter d of the control region C =(μ 0 dσ, μ 0 + dσ) were determined by considering a given cost function to be minimized. Here, in the framework of a Hidden Markov Model (HMM), we compute and propose estimation techniques for the falsealarm and nondetection probabilities. Falsealarm occurs if the observed variable falls outside the control region but the nonobservable internal system state is 0, a good working state. When the opposite occurs we have a nondetection situation. It is assumed that all the working (good) states are lumped together as state 0 and the deteriorating states are gathered as state 1. A Markov chain {θ n } n 0 describes the evolution of the state of the production system. Associated with this chain we observe a sequence of conditionally independent random variables {X n } n 1, with the distribution of each X n depending on the corresponding state θ n. This process {θ n,x n } is generally referred to as a HMM. More specifically, we have P (X n+1 A X 1,...,X n,θ 0,...,θ n )=P (X n+1 A θ n ) (1) and n P (X 1 A 1,...,X n A n θ 1,...,θ n )= P (X j A j θ j ). (2) j=1 In section 2, we treat the special case where the transition matrix of {θ n } as well as the conditional densities of X n given θ n are known, but not necessarily Gaussian densities. For any initial distribution of θ 0, Proposition 1 and Proposition 2 give the falsealarm and the nondetection probabilities. As a side result, upper bounds for the sampling interval m are proposed. In section 3, we assume that the transition probabilities of the hidden chain {θ n } are unknown. Based on the observable sample X 1,...,X n kernel density methods are used to approximate the stable regime density. Theorem
3 HMM for online quality control analysis shows that the limiting stable density is a mixture of densities, which in the particular case treated in [2] reduces to NORMIX (mixture of normal densities). Corollary 1 provide an estimate for the stationary distribution of {θ n } and leads to an alternative monitoring strategy that takes into account the falsealarm situations. And the estimates for falsealarm and nondetection probabilities can be found in Corollary Falsealarm and Nondetection For the HMM process {θ n,x n } assume that the chain {θ n } has known transition probabilities given by ( ) 1 p p P = ɛ 1 ɛ 0 <p<1, ɛ > 0 and p + ɛ<1. (3) The conditional distribution of X n given θ n are also known and based on this distribution a control region C is preselected. It is assumed that P (X n A θ n = i) = f(x i)dx, 0 <q 0 = f(x 0)dx < 1 and 0 <q 1 = C c f(x 1)dx < 1. C c (4) If the sampling interval m = 1, the online quality monitoring adopts the following strategy : items X 1,X 2,... are inspected and verified whether X 1 C, X 2 C,...; maintenance is required at time n if X 1 C,...,X n 1 C and X n / C. Thus we can define the alert times by τ X = inf{k : k 1,X k / C}. Falsealarm occurs at time k if τ X = k but the nonobservable internal system state is 0, a good working state. Let τ θ be defined as the first time, after time 0, the system reaches state 1, A τ θ = inf{k : k 1,θ k =1}. (5) Then falsealarm and nondetection correspond, respectively, to the events (τ X < τ θ ) and (τ X > τ θ ). Let P ν denote the probability when the initial
4 1156 C.C.Y. Dorea, C.R. Gonçalves, P.G. Medeiros and W.B. Santos distribution of θ 0 is ν. Similarly, let P 0 and P 1 denote the probability when θ 0 = 0 and θ 0 = 1 respectively. Proposition 1. Let ν be the initial distribution of θ 0. Then the falsealarm probability is given by (1 p)q 0 P ν (τ X <τ θ )=ν(0) 1 (1 p)(1 q 0 ) + ν(1) ɛq 0 (6) 1 (1 p)(1 q 0 ) and the nondetection probability is given by p(1 q 1 ) P ν (τ X >τ θ )=ν(0) 1 (1 p)(1 q 0 ) + ν(1)[q 0(1 ɛ)+(1 q 0 )p](1 q 1 ). 1 (1 p)(1 q 0 ) (7) Proof. (i) For θ 0 = 0 we have from (3) and (4) P 0 (τ X =1,τ θ > 1) = P 0 (θ 1 =0,X 1 / C) =(1 p)q 0 and from (1) and (2) we have for k 2 P 0 (τ X = k, τ θ >k) = P 0 (X 1 C,,X k 1 C, X k / C, θ 1 = = θ k =0) = k 1 P 0 (θ 1 = = θ k = 0)[ P (X j C θ j = 0)]P (X k / C θ k =0) It follows that j=1 = (1 p)[(1 p)(1 q 0 )] k 1 q 0. P 0 (τ X <τ θ )= Similarly, if θ 0 = 1 we have and for k 2 (1 p)q 0 1 (1 p)(1 q 0 ). P 1 (τ X =1,τ θ > 1) = P (θ 1 =0 θ 0 =1)P (X 1 / C θ 1 =0)=ɛq 0 And (6) follows. (ii) To prove (7) note that and for k 2 P 1 (τ X = k, τ θ >k)=ɛ[(1 p)(1 q 0 )] k 1 q 0. P 0 (τ X = τ θ =1)=P (θ 1 =1 θ 0 =0)P (X 1 / C θ 1 =1)=pq 1 P 0 (τ X = τ θ = k) = [(1 p)(1 q 0 )] k 1 pq 1.
5 HMM for online quality control analysis 1157 Moreover, P 1 (τ X = τ θ =1)=(1 ɛ)q 1 and for k 2 P 1 (τ X = τ θ = k) =ɛ(1 q 0 )[(1 p)(1 q 0 )] k 2 pq 1. It follows that pq 1 P ν (τ X = τ θ )=ν(0) 1 (1 p)(1 q 0 ) + ν(1)[q 0(1 ɛ)+(1 q 0 )p]q 1. 1 (1 p)(1 q 0 ) This along with (6) give us (7). Now, assume that a single item is inspected at every m items produced. Then for m 2 we can define and and τ (m) X = inf{km : k 1,X km / C}. (8) Using the same type of arguments as above we get P 0 (τ (m) X = km, τ θ >km) = (1 p) km (1 q 0 ) k 1 q 0 = (1 p) m [(1 p) m (1 q 0 )] k 1 q 0 P 1 (τ (m) X = km, τ θ >km)=ɛ(1 p) m 1 [(1 p) m (1 q 0 )] k 1 q 0. Moreover, P 0 (τ (m) X = τ θ = km) = [(1 p) m (1 q 0 )] k 1 (1 p) m 1 pq 1 P 1 (τ (m) X = τ θ = km) = [(1 p) m (1 q 0 )] k 1 ɛ(1 p) m 2 pq 1. Proposition 2. Let ν be the initial distribution of θ 0. Assume that the monitoring strategy has sampling interval m. Then the falsealarm probability is given by P ν (τ (m) X <τ (1 p) m q 0 θ)=ν(0) 1 (1 p) m (1 q 0 ) + ν(1) ɛ(1 p) m 1 q 0 1 (1 p) m (1 q 0 ) (9)
6 1158 C.C.Y. Dorea, C.R. Gonçalves, P.G. Medeiros and W.B. Santos and for m 2 the nondetection probability is given by P ν (τ (m) X >τ θ) = ν(0) 1 (1 p)m 1 +(1 p) m 1 p(1 q 1 ) 1 (1 p) m (1 q 0 ) + ν(1) 1 (1 p)m (1 q 0 ) ɛ(1 p) m 2 [(1 p)q 0 + pq 1 ]. 1 (1 p) m (1 q 0 ) (10) Next, we propose upper bounds for the sampling interval m. Wemay assume that the process starts at good working conditions (θ 0 =0,X 0 C). Our aim is to detect whether the chain {θ n } has changed to state 1. A trivial upper bound is given by the mean changing time from state 0 to state 1. From (3) and (5) we have m kp(τ θ = k θ 0 =0)= k(1 p) k 1 p = 1 p. k 1 k 1 Since {θ n } is nonobservable, the designed monitoring strategy relies on the observable process {X n }. Taking this into account one should choose m smaller so that in average we will detect the first time the process {θ n,x n } reaches the alert zone. Alert occurs at time k if either X k C c or θ k =1. And this can be expressed by τ A = inf{k : k 1, (θ k,x k ) A}. where A =({0} C c ) ({1} C) ({1} C c ). Since P ((θ k+1,x k+1 ) A c (θ k,x k ) A c )=(1 p)(1 q 0 ), the expected first hitting time in alert zone is given by m E(τ A θ 0 =0,X 0 C) = 3. Estimation Results 1 1 (1 p)(1 q 0 ). In this section we assume that the hidden Markov chain {θ n } has transition matrix P of the form (3), but unknown. As for the process {X n }, we assume that the conditional densities are known and satisfy condition (4). Note that since all entries of P are strictly positive, {θ n } is an ergodic chain and the stationary (limiting) distribution exists, πp = π, π(0) = ɛ p + ɛ and π(1) = p p + ɛ. (11)
7 HMM for online quality control analysis 1159 Define the mixture density function f(x) = π(0)f(x 0) + π(1)f(x 1). (12) Then, in some sense, f( ) represents the density of {X n } when the process reaches some stable regime. Mixture models have been well recognized as useful in many practical applications. It is a popular modelbased approach to dealing with data in the presence of population heterogeneity, in the sense that, data consist of unlabelled observations, each of which is thought to belong to one of the distinct classes. For a comprehensive list of applications and literature survey in this area see, for example, [3]. Though we are assuming known conditional densities, the stable regime density (12) may indicate which type of distribution one should assume for the variables X n as well as which control region C one should select. Results from [1] show that, based on the observable sample X 1,...,X n, kernel density methods can be successfully used to estimate the stable regime density. For a probability density K on R define ˆf n (x) = 1 nh n k=1 K( X k x ),h= h n 0,nh n as n. (13) h Typically one takes K( ) either a Gaussian density or an uniform density centered at x. Using these results we have Theorem 1 which allows us to make inference on P. Its proof will be postponed to the end of this section. Theorem 1. Assume that the process {θ n,x n } satisfies (3) and (4) and let ν be any initial distribution of θ 0. Then given δ>0 there exist c 1 = c 1 (δ) > 0 and c 2 = c 2 (δ) > 0 such that P ν ( ˆf n (y) f(y) dy δ) c 1 exp{ c 2 n} (14) and almost surely (a.s.) lim n ˆf n (y) f(y) dy = 0 a.s. (15) Next, we estimate the stationary probabilities (11). Choose x so that f(x 0) f(x 1) and define ˆf n (x ) f(x 1) ˆπ n (0) = f(x 0) f(x 1) and ˆπ n(1) = 1 ˆπ n (0). (16)
8 1160 C.C.Y. Dorea, C.R. Gonçalves, P.G. Medeiros and W.B. Santos From (15) it follows that, Corollary 1. For any initial distribution of θ 0 we have with probability 1, ˆπ n (0) π(0) and ˆπ n (1) π(1) as n. (17) This result suggests an alternative online control procedure that will take into account the falsealarm situations. Let ˆf n (m) (x )= 1 n K( X km x ). nh h Then, from (15) we have lim n k=1 (m) ˆf n (x ) f(x ) a.s. (m) Thus, with ˆf n (x ) in place of ˆf n (x ) in (16) we get (17). It follows that the posterior distribution P (θ nm =0 X m,...,x nm ) can be approximated by ˆf n ˆP (m) (x ) f(x 1) f(x 0) (θ nm =0 X m,...,x nm )= f(x 0) f(x 1) ˆf n (m) (x ). Monitoring Strategy. Assume that the conditional densities f( 0) and f( 1) are both known. Suppose that the control region C and the sampling interval m have been preselected. Let τ (m) X be defined by (8) and let 0 <η<1 be a given significance level. Then intervention is carried out at time nm if τ (m) X = nm and ˆP (θnm =0 Xm,...,Xnm) <η. From (16) we can also estimate falsealarm and nondetection probabilities. Observe that, in longrun, the falsealarm can be computed as P (θ km =0 X km / C) = P (X km / C θ km =0)P (θ km =0). P (X km / C) But P (X km / C θ km =0)=q 0 and by (11) we have lim P (θ km =0)=π(0). n From Theorem 1 with f( ) given by (12) we have lim P (X km / C) = f(x)dx. n C c Similarly, we have for nondetection P (θ km =1 X km C) = P (X km C θ km =1)P (θ km =1). P (X km C)
9 HMM for online quality control analysis 1161 These results can be summarized by: Corollary 2. For any initial distribution of θ 0 we have with probability 1, q 0ˆπ n (0) ˆf C c n (x)dx P (falsealarm) and (1 q 1)ˆπ n (1) C ˆf P (nondetection). (18) n (x)dx Proof of Theorem 1. Enough to verify that the hypotheses of Theorem 2 and Corollary 1 from [1] are satisfied. First, we shown that {θ n } is is uniformly ergodic, that is, there exists 0 <ρ<1 such that From (3) we have, ɛ P n = p + ɛ P n ij π(j) ρ n i, j =0, 1. (19) + p(1 p ɛ)n p + ɛ ɛ p ɛ)n ɛ(1 p + ɛ p + ɛ p p ɛ)n p(1 p + ɛ p + ɛ p p ɛ)n + ɛ(1 p + ɛ p + ɛ and from (11) we get (19) by taking ρ =1 p ɛ. Next, we show that {θ n } satisfies the φmixing condition : A F k and B Fk+n P π (A B) P π (A)P π (B) φ(n)p π (A) (20) with n 1 φ(n) < and σalgebras defined by F n = σ(θ 0,...,θ n ) and F n = σ(θ n,θ n+1,...). Note that for A =(θ 0 = a 0,...,θ k = a k ), B =(θ k+n = b k+n,...) and P π (A) > 0 we have and P π (B A) =P π (B θ k = a k )=P n a k b k+n P π (θ k+n+1 = b k+n+1,... θ k+n = b k+n ) It follows that P π (B) =π(b k+n )P π (θ k+n+1 = b k+n+1,... θ k+n = b k+n ). P π (B A) P π (B) P n a k b k+n π(b k+n ) ρ n = φ(n) and (20) is satisfied. References :
10 1162 C.C.Y. Dorea, C.R. Gonçalves, P.G. Medeiros and W.B. Santos [1] Dorea, C.C.Y. and Zhao, L.C. (2002)  Nonparametric density estimation in Hidden Markov Models, Statis. Inference for Stoch. Processes, vol. 5, [2] Ho, L.L.; Medeiros, P.G. and Borges, W. (2007)  An alternative model for online quality monitoring for variables, Intern. Jour. of Production Economics, vol. 107, [3] McLachlan, G.L. and Peel, D. (2000)  Finite Mixture Models,John Wiley, New York. [4] Taguchi, G.; Elsayed, E.D. and Hsiang, T. (1989)  Quality Engineering in Production Systems, McGrawHill, New York. Received: November, 2011
Monte Carlobased statistical methods (MASM11/FMS091)
Monte Carlobased statistical methods (MASM11/FMS091) Jimmy Olsson Centre for Mathematical Sciences Lund University, Sweden Lecture 6 Sequential Monte Carlo methods II February 3, 2012 Changes in HA1 Problem
More informationNonparametric adaptive age replacement with a onecycle criterion
Nonparametric adaptive age replacement with a onecycle criterion P. CoolenSchrijner, F.P.A. Coolen Department of Mathematical Sciences University of Durham, Durham, DH1 3LE, UK email: Pauline.Schrijner@durham.ac.uk
More informationTHE CENTRAL LIMIT THEOREM TORONTO
THE CENTRAL LIMIT THEOREM DANIEL RÜDT UNIVERSITY OF TORONTO MARCH, 2010 Contents 1 Introduction 1 2 Mathematical Background 3 3 The Central Limit Theorem 4 4 Examples 4 4.1 Roulette......................................
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 19967 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationMonte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMS091)
Monte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMS091) Magnus Wiktorsson Centre for Mathematical Sciences Lund University, Sweden Lecture 5 Sequential Monte Carlo methods I February
More informationProperties of BMO functions whose reciprocals are also BMO
Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a nonnegative BMOfunction w, whose reciprocal is also in BMO, belongs to p> A p,and
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationCHAPTER 5. Product Measures
54 CHAPTER 5 Product Measures Given two measure spaces, we may construct a natural measure on their Cartesian product; the prototype is the construction of Lebesgue measure on R 2 as the product of Lebesgue
More informationCycle transversals in bounded degree graphs
Electronic Notes in Discrete Mathematics 35 (2009) 189 195 www.elsevier.com/locate/endm Cycle transversals in bounded degree graphs M. Groshaus a,2,3 P. Hell b,3 S. Klein c,1,3 L. T. Nogueira d,1,3 F.
More informationUniversal Algorithm for Trading in Stock Market Based on the Method of Calibration
Universal Algorithm for Trading in Stock Market Based on the Method of Calibration Vladimir V yugin Institute for Information Transmission Problems, Russian Academy of Sciences, Bol shoi Karetnyi per.
More informationON THE EXISTENCE AND LIMIT BEHAVIOR OF THE OPTIMAL BANDWIDTH FOR KERNEL DENSITY ESTIMATION
Statistica Sinica 17(27), 2893 ON THE EXISTENCE AND LIMIT BEHAVIOR OF THE OPTIMAL BANDWIDTH FOR KERNEL DENSITY ESTIMATION J. E. Chacón, J. Montanero, A. G. Nogales and P. Pérez Universidad de Extremadura
More informationThe Ergodic Theorem and randomness
The Ergodic Theorem and randomness Peter Gács Department of Computer Science Boston University March 19, 2008 Peter Gács (Boston University) Ergodic theorem March 19, 2008 1 / 27 Introduction Introduction
More informationSection 6.4: Work. We illustrate with an example.
Section 6.4: Work 1. Work Performed by a Constant Force Riemann sums are useful in many aspects of mathematics and the physical sciences than just geometry. To illustrate one of its major uses in physics,
More informationHow to Gamble If You Must
How to Gamble If You Must Kyle Siegrist Department of Mathematical Sciences University of Alabama in Huntsville Abstract In red and black, a player bets, at even stakes, on a sequence of independent games
More informationMonte Carlobased statistical methods (MASM11/FMS091)
Monte Carlobased statistical methods (MASM11/FMS091) Jimmy Olsson Centre for Mathematical Sciences Lund University, Sweden Lecture 5 Sequential Monte Carlo methods I February 5, 2013 J. Olsson Monte Carlobased
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationAverage System Performance Evaluation using Markov Chain
Designing high performant Systems: statistical timing analysis and optimization Average System Performance Evaluation using Markov Chain Weiyun Lu Supervisor: Martin Radetzki Sommer Semester 2006 Stuttgart
More informationFurther Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1
Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing
More informationON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION. E. I. Pancheva, A. GacovskaBarandovska
Pliska Stud. Math. Bulgar. 22 (2015), STUDIA MATHEMATICA BULGARICA ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION E. I. Pancheva, A. GacovskaBarandovska Smirnov (1949) derived four
More informationNotes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand
Notes V General Equilibrium: Positive Theory In this lecture we go on considering a general equilibrium model of a private ownership economy. In contrast to the Notes IV, we focus on positive issues such
More informationP (A) = lim P (A) = N(A)/N,
1.1 Probability, Relative Frequency and Classical Definition. Probability is the study of random or nondeterministic experiments. Suppose an experiment can be repeated any number of times, so that we
More informationROLLING HORIZON PROCEDURES FOR THE SOLUTION OF AN OPTIMAL REPLACEMENT
REVISTA INVESTIGACIÓN OPERACIONAL VOL 34, NO 2, 105116, 2013 ROLLING HORIZON PROCEDURES FOR THE SOLUTION OF AN OPTIMAL REPLACEMENT PROBLEM OF nmachines WITH RANDOM HORIZON Rocio Ilhuicatzi Roldán and
More informationDefinition: Suppose that two random variables, either continuous or discrete, X and Y have joint density
HW MATH 461/561 Lecture Notes 15 1 Definition: Suppose that two random variables, either continuous or discrete, X and Y have joint density and marginal densities f(x, y), (x, y) Λ X,Y f X (x), x Λ X,
More informationSome stability results of parameter identification in a jump diffusion model
Some stability results of parameter identification in a jump diffusion model D. Düvelmeyer Technische Universität Chemnitz, Fakultät für Mathematik, 09107 Chemnitz, Germany Abstract In this paper we discuss
More informationNotes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
More information1. (First passage/hitting times/gambler s ruin problem:) Suppose that X has a discrete state space and let i be a fixed state. Let
Copyright c 2009 by Karl Sigman 1 Stopping Times 1.1 Stopping Times: Definition Given a stochastic process X = {X n : n 0}, a random time τ is a discrete random variable on the same probability space as
More informationAdaptive Search with Stochastic Acceptance Probabilities for Global Optimization
Adaptive Search with Stochastic Acceptance Probabilities for Global Optimization Archis Ghate a and Robert L. Smith b a Industrial Engineering, University of Washington, Box 352650, Seattle, Washington,
More informationMATH 10: Elementary Statistics and Probability Chapter 5: Continuous Random Variables
MATH 10: Elementary Statistics and Probability Chapter 5: Continuous Random Variables Tony Pourmohamad Department of Mathematics De Anza College Spring 2015 Objectives By the end of this set of slides,
More informationMaster s Theory Exam Spring 2006
Spring 2006 This exam contains 7 questions. You should attempt them all. Each question is divided into parts to help lead you through the material. You should attempt to complete as much of each problem
More informationSome Research Problems in Uncertainty Theory
Journal of Uncertain Systems Vol.3, No.1, pp.310, 2009 Online at: www.jus.org.uk Some Research Problems in Uncertainty Theory aoding Liu Uncertainty Theory Laboratory, Department of Mathematical Sciences
More informationx a x 2 (1 + x 2 ) n.
Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number
More informationLOGNORMAL MODEL FOR STOCK PRICES
LOGNORMAL MODEL FOR STOCK PRICES MICHAEL J. SHARPE MATHEMATICS DEPARTMENT, UCSD 1. INTRODUCTION What follows is a simple but important model that will be the basis for a later study of stock prices as
More informationIrreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients
DOI: 10.2478/auom20140007 An. Şt. Univ. Ovidius Constanţa Vol. 221),2014, 73 84 Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients Anca
More informationAbout the inverse football pool problem for 9 games 1
Seventh International Workshop on Optimal Codes and Related Topics September 61, 013, Albena, Bulgaria pp. 15133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute
More informationThe positive minimum degree game on sparse graphs
The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University
More informationThe Expectation Maximization Algorithm A short tutorial
The Expectation Maximiation Algorithm A short tutorial Sean Borman Comments and corrections to: emtut at seanborman dot com July 8 2004 Last updated January 09, 2009 Revision history 2009009 Corrected
More informationJointly Distributed Random Variables
Jointly Distributed Random Variables COMP 245 STATISTICS Dr N A Heard Contents 1 Jointly Distributed Random Variables 1 1.1 Definition......................................... 1 1.2 Joint cdfs..........................................
More information{f 1 (U), U F} is an open cover of A. Since A is compact there is a finite subcover of A, {f 1 (U 1 ),...,f 1 (U n )}, {U 1,...
44 CHAPTER 4. CONTINUOUS FUNCTIONS In Calculus we often use arithmetic operations to generate new continuous functions from old ones. In a general metric space we don t have arithmetic, but much of it
More informationTesting predictive performance of binary choice models 1
Testing predictive performance of binary choice models 1 Bas Donkers Econometric Institute and Department of Marketing Erasmus University Rotterdam Bertrand Melenberg Department of Econometrics Tilburg
More informationLectures 56: Taylor Series
Math 1d Instructor: Padraic Bartlett Lectures 5: Taylor Series Weeks 5 Caltech 213 1 Taylor Polynomials and Series As we saw in week 4, power series are remarkably nice objects to work with. In particular,
More informationOn the mathematical theory of splitting and Russian roulette
On the mathematical theory of splitting and Russian roulette techniques St.Petersburg State University, Russia 1. Introduction Splitting is an universal and potentially very powerful technique for increasing
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationF. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)
Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationHT2015: SC4 Statistical Data Mining and Machine Learning
HT2015: SC4 Statistical Data Mining and Machine Learning Dino Sejdinovic Department of Statistics Oxford http://www.stats.ox.ac.uk/~sejdinov/sdmml.html Bayesian Nonparametrics Parametric vs Nonparametric
More informationRESULTANT AND DISCRIMINANT OF POLYNOMIALS
RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results
More informationThe fundamental group of the Hawaiian earring is not free (International Journal of Algebra and Computation Vol. 2, No. 1 (1992), 33 37) Bart de Smit
The fundamental group of the Hawaiian earring is not free Bart de Smit The fundamental group of the Hawaiian earring is not free (International Journal of Algebra and Computation Vol. 2, No. 1 (1992),
More informationMetric Spaces Joseph Muscat 2003 (Last revised May 2009)
1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of
More informationThe Exponential Distribution
21 The Exponential Distribution From DiscreteTime to ContinuousTime: In Chapter 6 of the text we will be considering Markov processes in continuous time. In a sense, we already have a very good understanding
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions
More informationA Markovian Model for Investment Analysis in Advertising
Proceedings of the Seventh Young Statisticians Meeting Andrej Mrvar (Editor) Metodološki zvezki, 21, Ljubljana: FDV, 2003 A Markovian Model for Investment Analysis in Advertising Eugenio Novelli 1 Abstract
More informationDiscrete Convolution and the Discrete Fourier Transform
Discrete Convolution and the Discrete Fourier Transform Discrete Convolution First of all we need to introduce what we might call the wraparound convention Because the complex numbers w j e i πj N have
More informationSome ergodic theorems of linear systems of interacting diffusions
Some ergodic theorems of linear systems of interacting diffusions 4], Â_ ŒÆ êæ ÆÆ Nov, 2009, uà ŒÆ liuyong@math.pku.edu.cn yangfx@math.pku.edu.cn 1 1 30 1 The ergodic theory of interacting systems has
More informationLimits and Continuity
Math 20C Multivariable Calculus Lecture Limits and Continuity Slide Review of Limit. Side limits and squeeze theorem. Continuous functions of 2,3 variables. Review: Limits Slide 2 Definition Given a function
More informationOptimal proportional reinsurance and dividend payout for insurance companies with switching reserves
Optimal proportional reinsurance and dividend payout for insurance companies with switching reserves Abstract: This paper presents a model for an insurance company that controls its risk and dividend
More informationMonte Carlobased statistical methods (MASM11/FMS091)
Monte Carlobased statistical methods (MASM11/FMS091) Magnus Wiktorsson Centre for Mathematical Sciences Lund University, Sweden Lecture 6 Sequential Monte Carlo methods II February 7, 2014 M. Wiktorsson
More informationOn a comparison result for Markov processes
On a comparison result for Markov processes Ludger Rüschendorf University of Freiburg Abstract A comparison theorem is stated for Markov processes in polish state spaces. We consider a general class of
More information4. Expanding dynamical systems
4.1. Metric definition. 4. Expanding dynamical systems Definition 4.1. Let X be a compact metric space. A map f : X X is said to be expanding if there exist ɛ > 0 and L > 1 such that d(f(x), f(y)) Ld(x,
More informationMathematics for Econometrics, Fourth Edition
Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents
More informationHow performance metrics depend on the traffic demand in large cellular networks
How performance metrics depend on the traffic demand in large cellular networks B. B laszczyszyn (Inria/ENS) and M. K. Karray (Orange) Based on joint works [1, 2, 3] with M. Jovanovic (Orange) Presented
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More information1 Prior Probability and Posterior Probability
Math 541: Statistical Theory II Bayesian Approach to Parameter Estimation Lecturer: Songfeng Zheng 1 Prior Probability and Posterior Probability Consider now a problem of statistical inference in which
More informationMath 370/408, Spring 2008 Prof. A.J. Hildebrand. Actuarial Exam Practice Problem Set 3 Solutions
Math 37/48, Spring 28 Prof. A.J. Hildebrand Actuarial Exam Practice Problem Set 3 Solutions About this problem set: These are problems from Course /P actuarial exams that I have collected over the years,
More informationSome Problems of SecondOrder Rational Difference Equations with Quadratic Terms
International Journal of Difference Equations ISSN 09736069, Volume 9, Number 1, pp. 11 21 (2014) http://campus.mst.edu/ijde Some Problems of SecondOrder Rational Difference Equations with Quadratic
More informationTHE BANACH CONTRACTION PRINCIPLE. Contents
THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,
More information= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
More informationTutorial on variational approximation methods. Tommi S. Jaakkola MIT AI Lab
Tutorial on variational approximation methods Tommi S. Jaakkola MIT AI Lab tommi@ai.mit.edu Tutorial topics A bit of history Examples of variational methods A brief intro to graphical models Variational
More information9 More on differentiation
Tel Aviv University, 2013 Measure and category 75 9 More on differentiation 9a Finite Taylor expansion............... 75 9b Continuous and nowhere differentiable..... 78 9c Differentiable and nowhere monotone......
More informationTHE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING
THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING 1. Introduction The BlackScholes theory, which is the main subject of this course and its sequel, is based on the Efficient Market Hypothesis, that arbitrages
More informationLecture 6: Discrete & Continuous Probability and Random Variables
Lecture 6: Discrete & Continuous Probability and Random Variables D. Alex Hughes Math Camp September 17, 2015 D. Alex Hughes (Math Camp) Lecture 6: Discrete & Continuous Probability and Random September
More informationB. Maddah ENMG 501 Engineering Management I 03/17/07
B. Maddah ENMG 501 Engineering Management I 03/17/07 Discrete Time Markov Chains (3) Longrun Properties of MC (Stationary Solution) Consider the twostate MC of the weather condition in Example 4. P 0.5749
More informationAn Introduction to Basic Statistics and Probability
An Introduction to Basic Statistics and Probability Shenek Heyward NCSU An Introduction to Basic Statistics and Probability p. 1/4 Outline Basic probability concepts Conditional probability Discrete Random
More informationGeneral Theory of Differential Equations Sections 2.8, 3.13.2, 4.1
A B I L E N E C H R I S T I A N U N I V E R S I T Y Department of Mathematics General Theory of Differential Equations Sections 2.8, 3.13.2, 4.1 Dr. John Ehrke Department of Mathematics Fall 2012 Questions
More informationLÉVYDRIVEN PROCESSES IN BAYESIAN NONPARAMETRIC INFERENCE
Bol. Soc. Mat. Mexicana (3) Vol. 19, 2013 LÉVYDRIVEN PROCESSES IN BAYESIAN NONPARAMETRIC INFERENCE LUIS E. NIETOBARAJAS ABSTRACT. In this article we highlight the important role that Lévy processes have
More information( ) = P Z > = P( Z > 1) = 1 Φ(1) = 1 0.8413 = 0.1587 P X > 17
4.6 I company that manufactures and bottles of apple juice uses a machine that automatically fills 6 ounce bottles. There is some variation, however, in the amounts of liquid dispensed into the bottles
More informationHackingproofness and Stability in a Model of Information Security Networks
Hackingproofness and Stability in a Model of Information Security Networks Sunghoon Hong Preliminary draft, not for citation. March 1, 2008 Abstract We introduce a model of information security networks.
More informationIs a Brownian motion skew?
Is a Brownian motion skew? Ernesto Mordecki Sesión en honor a Mario Wschebor Universidad de la República, Montevideo, Uruguay XI CLAPEM  November 2009  Venezuela 1 1 Joint work with Antoine Lejay and
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationPrinciple of Data Reduction
Chapter 6 Principle of Data Reduction 6.1 Introduction An experimenter uses the information in a sample X 1,..., X n to make inferences about an unknown parameter θ. If the sample size n is large, then
More informationRandom graphs with a given degree sequence
Sourav Chatterjee (NYU) Persi Diaconis (Stanford) Allan Sly (Microsoft) Let G be an undirected simple graph on n vertices. Let d 1,..., d n be the degrees of the vertices of G arranged in descending order.
More informationTHIS paper deals with a situation where a communication
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 44, NO. 3, MAY 1998 973 The Compound Channel Capacity of a Class of FiniteState Channels Amos Lapidoth, Member, IEEE, İ. Emre Telatar, Member, IEEE Abstract
More informationSeparation Properties for Locally Convex Cones
Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An ndimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0534405967. Systems of Linear Equations Definition. An ndimensional vector is a row or a column
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationUNIT I: RANDOM VARIABLES PART A TWO MARKS
UNIT I: RANDOM VARIABLES PART A TWO MARKS 1. Given the probability density function of a continuous random variable X as follows f(x) = 6x (1x) 0
More informationThe Exponential Family
The Exponential Family David M. Blei Columbia University November 3, 2015 Definition A probability density in the exponential family has this form where p.x j / D h.x/ expf > t.x/ a./g; (1) is the natural
More informationUsing pivots to construct confidence intervals. In Example 41 we used the fact that
Using pivots to construct confidence intervals In Example 41 we used the fact that Q( X, µ) = X µ σ/ n N(0, 1) for all µ. We then said Q( X, µ) z α/2 with probability 1 α, and converted this into a statement
More informationDetekce změn v autoregresních posloupnostech
Nové Hrady 2012 Outline 1 Introduction 2 3 4 Change point problem (retrospective) The data Y 1,..., Y n follow a statistical model, which may change once or several times during the observation period
More informationThe Conference Call Search Problem in Wireless Networks
The Conference Call Search Problem in Wireless Networks Leah Epstein 1, and Asaf Levin 2 1 Department of Mathematics, University of Haifa, 31905 Haifa, Israel. lea@math.haifa.ac.il 2 Department of Statistics,
More informationNotes on Continuous Random Variables
Notes on Continuous Random Variables Continuous random variables are random quantities that are measured on a continuous scale. They can usually take on any value over some interval, which distinguishes
More informationQuasistatic evolution and congested transport
Quasistatic evolution and congested transport Inwon Kim Joint with Damon Alexander, Katy Craig and Yao Yao UCLA, UW Madison Hard congestion in crowd motion The following crowd motion model is proposed
More informationPrimality  Factorization
Primality  Factorization Christophe Ritzenthaler November 9, 2009 1 Prime and factorization Definition 1.1. An integer p > 1 is called a prime number (nombre premier) if it has only 1 and p as divisors.
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by MenGen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationOnline Appendix to Stochastic Imitative Game Dynamics with Committed Agents
Online Appendix to Stochastic Imitative Game Dynamics with Committed Agents William H. Sandholm January 6, 22 O.. Imitative protocols, mean dynamics, and equilibrium selection In this section, we consider
More informationMATH 425, PRACTICE FINAL EXAM SOLUTIONS.
MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator
More informationPROBLEM SET 7: PIGEON HOLE PRINCIPLE
PROBLEM SET 7: PIGEON HOLE PRINCIPLE The pigeonhole principle is the following observation: Theorem. Suppose that > kn marbles are distributed over n jars, then one jar will contain at least k + marbles.
More information