A New Multivariate Markov Chain Model with Applications to Sales Demand Forecasting

Size: px
Start display at page:

Download "A New Multivariate Markov Chain Model with Applications to Sales Demand Forecasting"

Transcription

1 Iteratioal Coferece o Idustrial Egieerig ad Systems Maagemet IESM 2007 May 30 - Jue 2 BEIJING - CHINA A New Multivariate Markov Chai Model with Applicatios to Sales Demad Forecastig Wai-Ki CHING a, Li-Mi LI c, Tag LI d, Shu-Qi ZHANG b a Advaced Modelig ad Applied Computig Laboratory ad Departmet of Mathematics, The Uiversity of Hog Kog, Pokfulam Road, Hog Kog b Advaced Modelig ad Applied Computig Laboratory ad Departmet of Mathematics, The Uiversity of Hog Kog, Pokfulam Road, Hog Kog c Advaced Modelig ad Applied Computig Laboratory ad Departmet of Mathematics, The Uiversity of Hog Kog, Pokfulam Road, Hog Kog d Advaced Modelig ad Applied Computig Laboratory ad Departmet of Mathematics, The Uiversity of Hog Kog, Pokfulam Road, Hog Kog Abstract Markov chais are popular tools for modelig a lot of practical systems such as queueig systems, maufacturig systems ad categorical data sequeces Multiple categorical sequeces occur i may applicatios such as ivetory cotrol, fiace ad data miig I may situatios, oe would like to cosider multiple categorical sequeces together at the same time The reaso is that the data sequeces ca be correlated ad therefore by explorig their relatioships, oe ca develop better models I this paper, we propose a ew multivariate Markov chai model for modelig multiple categorical data sequeces We the test the proposed model with sythetic data ad apply it to practical sales demad data Key words: Ivetory, Markov Process, Multivariate Markov chais, Categorical Data Sequeces, Demad Predictio 1 Itroductio Categorical data sequeces (time series) have may applicatios i both applied scieces ad egieerig problems such as ivetory cotrol problemss [1,10,11], webpage predictio problems i data miig [12], credit risk problems i fiace [9] ad may others [2,6,8] Categorical data sequeces ca be modeled by usig Markov chais, see for istace [10,11,8] I may occasios, oe has to cosider multiple Markov chais (categorical sequeces) together at the same time, ie, to study the chais i a holistic maer rather tha idividually The reaso is that the chais (data sequeces) ca be correlated ad therefore the iformatio of other chais ca cotribute to explai the captured chai (data sequece) Thus by explorig these relatioships, oe ca develop better models We remark that the covetioal Markov chai model for s categorical data sequeces of m states has m s states The umber of parameters This paper was ot preseted at ay other revue Research supported i part by RGC Grats ad HKU CRCG Grats Correspodig author Li-Mi LI limili@hkusuahkuhk Fax (852) addresses: wchig@hkusuahkuhk (Wai-Ki CHING), limili@hkusuahkuhk (Li-Mi LI), litag@hkusuahkuhk (Tag LI), sqzhag@hkusuahkuhk (Shu-Qi ZHANG)

2 IESM 2007, BEIJING - CHINA, May 30 - Jue 2 (trasitio probabilities) icreases expoetially with respect to the umber of categorical sequeces Because of this large umber of parameters, people seldom use such kid of Markov chai models directly I view of this, Chig et al proposed a first-order multivariate Markov chai model i [10] for modelig the sales demads of multiple products i a soft drik compay Their model ivolves oly O(s 2 m 2 + s 2 ) umber of parameters where s is the umber of sequeces ad m is the umber of possible states The model ca capture both the itra- ad iter-trasitio probabilities amog the sequeces They also developed efficiet estimatio methods for solvig the model parameters ad applied the model to a problem of sales demad data sequeces A simplified multivariate Markov model based o [10] has also bee proposed i [13] where the umber of parameters is oly O(sm 2 + s 2 ) However, all the models [10,13] caot capture egative correlatios amog the data sequeces We will elaborate the meaig of positive ad egative correlatios shortly i the ext sectio Moreover, all the models have bee show to be statioary ad steady-state is assumed i the estimatio of model parameters Thus the estimatio methods have to be modified whe the give data sequeces are short I this paper, we propose a ew model which ca capture both positive ad egative correlatios amog the data sequeces The model ca also be adjusted to hadle the case whe the data sequeces are short easily The rest of the paper is orgaized as follows I Sectio 2, we propose the ew multivariate Markov model ad discuss some importat properties of the model I Sectio 3, we preset the method for the estimatio of model parameters I Sectio 4, we apply the model ad the method to some sythetic data ad practical sales demad data Fially, a summary is give i Sectio 5 to coclude the paper 2 The New Multivariate Markov Chai Model I this sectio, we first propose our ew multivariate Markov chai model ad the some of its properties The properties are importat for the estimatio of model parameters The followig multivariate Markov chai model has bee proposed i [10] The model assumes that there are s categorical sequeces ad each has m possible states i M = {1, 2,, m} Here we adopt the followig otatios as i [10] Let x (k) be the state vector of the kth sequece at time If the kth sequece is i State j at time the we write x (k) = e j = (0,, 0, }{{} 1, 0,,0) T jth etry The followig relatioships amog the sequeces are assumed: where x (j) +1 = λ jjp (jj) x (j) + k=1,k j λ jk P (jk) x (k) for j = 1, 2,,s, (1) λ jk 0, 1 j, k s ad λ jk = 1, for j = 1, 2,,s (2) k=1 Equatio (1) simply meas that the state probability distributio of the jth chai (sequece) at time ( + 1) depeds oly o the weighted average of P (jj) x (j) ad P (jk) x (k) Here P (ij) is the oe-step trasitio probability matrix of the states from the jth sequece to the states of the ith sequece I matrix form, oe may write x λ 11 P (11) λ 12 P (12) λ 1s P (1s) λ 21 P (21) λ 22 P (22) λ 2s P (2s) = λ s1 P (s1) λ s2 P (s2) λ ss P (ss) Qx

3 IESM 2007, BEIJING - CHINA, May 30 - Jue 2 We ote that this model oly allows positive correlatio amog the data sequeces as all the λ ij are assumed to be o-egative This meas a icrease i a state probability i ay oe of the sequeces at time ca oly icrease (but ever decrease) the state probabilities at time ( + 1) To exted the model so as to take care of the egative correlatios amog the data sequeces, our idea here is to use z +1 = 1 m 1 (1 x ) to model the case whe the state probability vector x is egatively correlated to the state probability vector z +1 Here 1 is the vector of all oes ad the factor (m 1) 1 is the ormalizatio costat ad the umber of possible states m 2 We propose the followig model for s data sequeces,,, I order to reduce the umber of parameters, i the proposed model, we assume that P (ij) = I whe i j This idea has bee used i [13] ad has bee show to be effective We the assume the followig relatioship amog the data sequeces: = Λ + }{{} P ositive correlated part + 1 m 1 Λ }{{} Negative correlated part where λ 1,1 P (11) λ 1,2 I λ 1,s I Λ + λ = 2,1 I λ 2,2 P (22) λ 2,s I λ s,1 I λ s,s 1 I λ s,s P (ss) ad λ 1, 1 P (11) λ 1, 2 I λ 1, s I Λ λ = 2, 1 I λ 2, 2 P (22) λ 2, s I λ s, 1 I λ s, s+1 I λ s, s P (ss) Here λ i,j 0 for i = 1, 2,,s ad j = ±1,, ±s ad λ i,j = 1 j= s

4 This is equivalet to x (+1) = H 1,1 H 1,2 H 1,s H = 2,1 H 2,2 H 2,s H s,1 H s,2 H s,s M s x () + b IESM 2007, BEIJING - CHINA, May 30 - Jue m 1 J 1, 1 J 1, 2 J 1, s 1 J 2, 1 J 2, 2 J 2, s 1 J s, 1 J s, s+1 J s, s 1 Here ad We ote that H ij = (λ i,j λi, j m 1 )P (ii) if i = j (λ i,j λi, j m 1 )I otherwise λ i, j P (ii) if i = j J ij = λ i, j I otherwise x (+1) = M 2 sx ( 1) + (I + M s )b = M 3 sx ( 2) + (I + M s + M 2 s )b where M 0 s = I = M (+1) s x (0) + Ms k b k=0 The model has a statioary distributio if for certai matrix orm (let us say M s ) we have M s < 1 Here give a real matrix M, I this case, we have We also ote that M = max M ij i lim x() = lim j=1 Ms k b = (I M s ) 1 b k=0 M s max 1 k s m λ k,k λ k, k (m 1) + λ k,i λ k, i (m 1) k i Therefore the smaller M s is the faster the covergece rate of the process will be Thus oe ca cotrol the coverget rate by settig a upper boud α < 1 by itroducig the extra costraits m λ k,k λ k, k (m 1) + λ k,i λ k, i (m 1) α for k i i = 1, 2,,s

5 3 Estimatio of Model Parameters IESM 2007, BEIJING - CHINA, May 30 - Jue 2 I this sectio, we propose efficiet methods for the estimatios of P (jj) ad λ jk For each data sequece, oe ca estimate the trasitio probability matrix by the followig method [10,11] Give a data sequece, oe ca cout the trasitio frequecies from oe arbitrary state to the other states Hece we ca costruct the trasitio frequecy matrix for the data sequece After makig a ormalizatio, the estimates of the trasitio probability matrices ca also be obtaied We ote that oe has to estimate O(s m 2 ) trasitio frequecy matrices for the multivariate Markov chai model The vector statioary vector x ca be estimated from proportio of the occurrece of each state i each of the sequeces Accordig to the idea at the ed of last sectio, if we take to be 1 we ca get the values of λ jk by solvig the followig optimizatio problem ([10,11]): subject to mi λ b j,k = k= s [ b j,k ˆx (j)] i i k=1 λ jk = 1, ( (λ j,k λ j, k m 1 ) jkˆx (k) + 1 ) m 1 λ j,k jk 1 j = 1, 2,,s λ jk 0, k = ±1,,±s, j = 1, 2,,s m λ k,k λ k, k (m 1) + λ k,i λ k, i (m 1) α for k i k = 1, 2,,s (3) Here 1 is the vector with all the etries beig equal to oe ad P (jj) if j = k jk = I if j k Problem (3) ca be formulated to s liear programmig problems as follows, see for istace [3, (p 221)] We remark that other vector orms such as 2 ad ca also be used but they have differet characteristics It is clear that the former will result i a quadratic programmig problem while will still result i a liear programmig problem, see for istace [3, (pp )] There is a well-kow fact that i approximatig data by usig a liear fuctio [3, (p 220)], 1 gives the most robust result While avoids gross discrepacies with the data as much as possible If the errors are kow to be ormally distributed the 2 is the best choice Fially we remark that the complexity of solvig a liear programmig problem or a quadratic programmig problem is O( 3 L) where is the umber of variables ad L is the umber of biary bits eeded to record all the data of the problem [4] 4 Numerical Examples I this sectio, we preset both sythetic data sequeces ad practical sales demad data sequeces to demostrate the effectiveess of the proposed model We first estimate all the trasitio probability matrices P (jj) ad the parameters λ ij by usig the method proposed i Sectio 3 To evaluate the performace ad effectiveess of the ew multivariate Markov chai model, we use BIC (Bayesia Iformatio Criterio) [5,7] as a idicator which is defied as BIC = 2L + q log, where m L = j=1 i 0,k 1, k s=1 i 0,k 1,,k s log I, (j)

6 IESM 2007, BEIJING - CHINA, May 30 - Jue 2 I = is the log-likelihood of the model, m l=1 k=1 (λ jk 1 m 1 λ j, k)p (jk) i 0,k l + 1 m 1 λ j, k (j) i 0,k 1,k 2,,k s = x (j) +1 (i 0)x 1 (k 1)x 2 (k 2) x s (k s) Here q is the umber of idepedet parameters, ad is the legth of the sequece The less the value of BIC, the better the model is For the sake of compariso, we also give the results for the model proposed by Chig et al i [10] 41 Sythetic Data Sequeces I this subsectio, we cosider two biary sequeces geerated by the followig model: Here ad x(1) Begiig with = λ 1,1P (11) λ 1,2 I λ 2,1 I λ 2,2 P (22) oe ca geerate sequeces of as follows: x(1) + λ 1, 1P (11) λ 1, 2 I λ 2, 1 I λ 2, 2 P (22) P (11) = ad P (22) = λ 1,1 = 04300, λ 1,2 = 00505, λ 1, 1 = 04401, λ 1, 2 = 00794, λ 2,1 = 00838, λ 2,2 = 03932, λ 2, 1 = 01187, λ 2, 2 = = (0, 1) T ad 0 = (1, 0) T, ad A : B : x(1) 1 We the apply our to these data sequeces ad compare it with the model i [10] The results are the reported i Table 1 Table 1 The BIC for Sythetic Data Sequeces Models BIC Multivariate Markov Model i [10] The New Model (α = 10) The New Model (α = 09) The New Model (α = 08) The New Model (α = 07) The New Model (α = 06) 42 Sales Demads Data Sequeces 42130e e e e e+003 I this subsectio, we preset some umerical results based o the sales demad data of a soft-drik compay i Hog Kog [10] The soft-drik compay actually facig a i-house problem of productio plaig ad ivetory cotrol A key issue is that the storage space of the cetral warehouse ofte fids itself full or ear capacity Product are categorized ito six possible states accordig to sales volume All products are labeled as either very fast-movig (very high sales volume), fast-movig, stadard, slow-movig, very slow-movig

7 IESM 2007, BEIJING - CHINA, May 30 - Jue 2 (low sales volume) or o sales volume The compay has a big customer ad would like to predict sales demad for this customer so as to miimize the i-house ivetory ad at same time maximize the demad satisfactio for this customer More importatly, the compay ca uderstad the sales patter of this customer ad the develop a marketig strategy to deal with this customer We expect sales demad sequeces geerated by the same customer to be correlated to each other Therefore by explorig these relatioships, we develop the multivariate Markov model for such demad sequeces, hece obtai better predictio rules We the build the multivariate Markov chai model based o the data i the Appedix of [10] Table 2 The BIC for Data sequeces A,B,C,D,E Models Multivariate Markov Model i [10] The New Model (α = 10) The New Model (α = 09) The New Model (α = 08) The New Model (α = 07) The New Model (α = 06) BIC 80215e e e e e e+003 The results above show the effectiveess of our simplified multivariate Markov model Oe ca see that the ew multivariate Markov model is much better tha the multivariate Markov model i [10] i fittig the sales demad data We remark that whe orm is used istead of 1 orm, i the LP, we still get similar results of BIC for both the sythetic data ad practical data 5 Summary I this paper, we propose a ew multi-dimesioal Markov chai model for modelig multiple categorical data sequeces We test the proposed model with both sythetic data ad practical sales demad data The ew model ca capture both positive ad egative correlatios amog the data sequeces The model ca also be adjusted to hadle the case whe the data sequeces are short easily 6 Appedix Sales Demad Sequeces of the Five Products (Take from [10]) Product A: Product B: Product C: Product D: Product E: =very fast-movig, 5 = fast-movig, 4 = stadard, 3 = slow-movig, 2 = very slow-movig ad 1= o sales volume Refereces [1] W Chig Markov modulated poisso processes for multi-locatio ivetory problems Iter J Prod Eco, 53: , 97

8 IESM 2007, BEIJING - CHINA, May 30 - Jue 2 [2] W Chig ad M Ng Markov Chais : Models, Algorithms ad Applicatios Spriger, 06 [3] V Chvátal Liear Programmig Freema, 83 [4] S Fag ad S Puthepura Liear Optimizatio ad Extesio : Theory ad Algorithms Pretice-Hall, 93 [5] J Kuha Aic ad bic comparisos of assumptios ad performace Sociological Methods ad Research, 33: , 04 [6] I MacDoald ad W Zucchii Hidde Markov ad Other Models for Discrete-valued Time Series Chapma & Hall, Lodo, 97 [7] A Raftery A model of higher-order markov chais J Royal Statist Soc, 47: , 85 [8] A Raftery ad S Tavare Estimatio ad modellig repeated patters i high order markov chais with the mixture trasitio distributio model Appl Statist, 43: , 94 [9] M Ng T Siu, W Chig ad E Fug O multivariate credibility approach for portfolio credit risk measuremet Quatitative Fiace, 5: , 05 [10] E Fug W Chig ad M Ng A multivariate markov chai model for categorical data sequeces ad its applicatios i demad predictio IMA J Maag Math, 13: , 02 [11] E Fug W Chig ad M Ng A higher-order markov model for the ewsboy s problem J Operat Res Soc, 54: , 03 [12] E Fug W Chig ad M Ng Higher-order markov chai models for categorical data sequeces Iter J Nav Res Logist, 51: , 04 [13] S Zhag W Chig ad M Ng O higher-dimesioal markov chai models to appear i Pacific Joural of Optimizatio, 06

Higher-Order Markov Chain Models for Categorical Data Sequences*

Higher-Order Markov Chain Models for Categorical Data Sequences* Higher-Order Markov Chai Models for Categorical Data Sequeces* Wai Ki Chig, Eric S. Fug, Michael K. Ng Departmet of Mathematics, The Uiversity of Hog Kog, Pokfulam Road, Hog Kog, People s Republic of Chia

More information

A New Solution Method for the Finite-Horizon Discrete-Time EOQ Problem

A New Solution Method for the Finite-Horizon Discrete-Time EOQ Problem This is the Pre-Published Versio. A New Solutio Method for the Fiite-Horizo Discrete-Time EOQ Problem Chug-Lu Li Departmet of Logistics The Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog Phoe: +852-2766-7410

More information

Random Matrices with Blocks of Intermediate Scale Strongly Correlated Band Matrices

Random Matrices with Blocks of Intermediate Scale Strongly Correlated Band Matrices Radom Matrices with Blocks of Itermediate Scale Strogly Correlated Bad Matrices Jiayi Tog Advisor: Dr. Todd Kemp May 30, 07 Departmet of Mathematics Uiversity of Califoria, Sa Diego Cotets Itroductio Notatio

More information

Optimally Sparse SVMs

Optimally Sparse SVMs A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but

More information

Control chart for number of customers in the system of M [X] / M / 1 Queueing system

Control chart for number of customers in the system of M [X] / M / 1 Queueing system Iteratioal Joural of Iovative Research i Sciece, Egieerig ad Techology (A ISO 3297: 07 Certified Orgaiatio) Cotrol chart for umber of customers i the system of M [X] / M / Queueig system T.Poogodi, Dr.

More information

A statistical method to determine sample size to estimate characteristic value of soil parameters

A statistical method to determine sample size to estimate characteristic value of soil parameters A statistical method to determie sample size to estimate characteristic value of soil parameters Y. Hojo, B. Setiawa 2 ad M. Suzuki 3 Abstract Sample size is a importat factor to be cosidered i determiig

More information

Expectation-Maximization Algorithm.

Expectation-Maximization Algorithm. Expectatio-Maximizatio Algorithm. Petr Pošík Czech Techical Uiversity i Prague Faculty of Electrical Egieerig Dept. of Cyberetics MLE 2 Likelihood.........................................................................................................

More information

High-dimensional Markov Chain Models for Categorical Data Sequences with Applications Wai-Ki CHING AMACL, Department of Mathematics HKU 19 March 2013

High-dimensional Markov Chain Models for Categorical Data Sequences with Applications Wai-Ki CHING AMACL, Department of Mathematics HKU 19 March 2013 High-dimensional Markov Chain Models for Categorical Data Sequences with Applications Wai-Ki CHING AMACL, Department of Mathematics HKU 19 March 2013 Abstract: Markov chains are popular models for a modelling

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

On an Application of Bayesian Estimation

On an Application of Bayesian Estimation O a Applicatio of ayesia Estimatio KIYOHARU TANAKA School of Sciece ad Egieerig, Kiki Uiversity, Kowakae, Higashi-Osaka, JAPAN Email: ktaaka@ifokidaiacjp EVGENIY GRECHNIKOV Departmet of Mathematics, auma

More information

Statistical Pattern Recognition

Statistical Pattern Recognition Statistical Patter Recogitio Classificatio: No-Parametric Modelig Hamid R. Rabiee Jafar Muhammadi Sprig 2014 http://ce.sharif.edu/courses/92-93/2/ce725-2/ Ageda Parametric Modelig No-Parametric Modelig

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

Intermittent demand forecasting by using Neural Network with simulated data

Intermittent demand forecasting by using Neural Network with simulated data Proceedigs of the 011 Iteratioal Coferece o Idustrial Egieerig ad Operatios Maagemet Kuala Lumpur, Malaysia, Jauary 4, 011 Itermittet demad forecastig by usig Neural Network with simulated data Nguye Khoa

More information

Optimization Methods MIT 2.098/6.255/ Final exam

Optimization Methods MIT 2.098/6.255/ Final exam Optimizatio Methods MIT 2.098/6.255/15.093 Fial exam Date Give: December 19th, 2006 P1. [30 pts] Classify the followig statemets as true or false. All aswers must be well-justified, either through a short

More information

The Perturbation Bound for the Perron Vector of a Transition Probability Tensor

The Perturbation Bound for the Perron Vector of a Transition Probability Tensor NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Liear Algebra Appl. ; : 6 Published olie i Wiley IterSciece www.itersciece.wiley.com. DOI:./la The Perturbatio Boud for the Perro Vector of a Trasitio

More information

IP Reference guide for integer programming formulations.

IP Reference guide for integer programming formulations. IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more

More information

Confidence interval for the two-parameter exponentiated Gumbel distribution based on record values

Confidence interval for the two-parameter exponentiated Gumbel distribution based on record values Iteratioal Joural of Applied Operatioal Research Vol. 4 No. 1 pp. 61-68 Witer 2014 Joural homepage: www.ijorlu.ir Cofidece iterval for the two-parameter expoetiated Gumbel distributio based o record values

More information

INFINITE SEQUENCES AND SERIES

INFINITE SEQUENCES AND SERIES 11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES 11.4 The Compariso Tests I this sectio, we will lear: How to fid the value of a series by comparig it with a kow series. COMPARISON TESTS

More information

Linear Regression Models

Linear Regression Models Liear Regressio Models Dr. Joh Mellor-Crummey Departmet of Computer Sciece Rice Uiversity johmc@cs.rice.edu COMP 528 Lecture 9 15 February 2005 Goals for Today Uderstad how to Use scatter diagrams to ispect

More information

Modeling and Estimation of a Bivariate Pareto Distribution using the Principle of Maximum Entropy

Modeling and Estimation of a Bivariate Pareto Distribution using the Principle of Maximum Entropy Sri Laka Joural of Applied Statistics, Vol (5-3) Modelig ad Estimatio of a Bivariate Pareto Distributio usig the Priciple of Maximum Etropy Jagathath Krisha K.M. * Ecoomics Research Divisio, CSIR-Cetral

More information

A RANK STATISTIC FOR NON-PARAMETRIC K-SAMPLE AND CHANGE POINT PROBLEMS

A RANK STATISTIC FOR NON-PARAMETRIC K-SAMPLE AND CHANGE POINT PROBLEMS J. Japa Statist. Soc. Vol. 41 No. 1 2011 67 73 A RANK STATISTIC FOR NON-PARAMETRIC K-SAMPLE AND CHANGE POINT PROBLEMS Yoichi Nishiyama* We cosider k-sample ad chage poit problems for idepedet data i a

More information

Achieving Stationary Distributions in Markov Chains. Monday, November 17, 2008 Rice University

Achieving Stationary Distributions in Markov Chains. Monday, November 17, 2008 Rice University Istructor: Achievig Statioary Distributios i Markov Chais Moday, November 1, 008 Rice Uiversity Dr. Volka Cevher STAT 1 / ELEC 9: Graphical Models Scribe: Rya E. Guerra, Tahira N. Saleem, Terrace D. Savitsky

More information

As metioed earlier, directly forecastig o idividual product demads usually result i a far-off forecast that ot oly impairs the quality of subsequet ma

As metioed earlier, directly forecastig o idividual product demads usually result i a far-off forecast that ot oly impairs the quality of subsequet ma Semicoductor Product-mix Estimate with Dyamic Weightig Scheme Argo Che, Ziv Hsia ad Kyle Yag Graduate Istitute of Idustrial Egieerig, Natioal Taiwa Uiversity Roosevelt Rd. Sec. 4, Taipei, Taiwa, 6 ache@tu.edu.tw

More information

Mathematical Modeling of Optimum 3 Step Stress Accelerated Life Testing for Generalized Pareto Distribution

Mathematical Modeling of Optimum 3 Step Stress Accelerated Life Testing for Generalized Pareto Distribution America Joural of Theoretical ad Applied Statistics 05; 4(: 6-69 Published olie May 8, 05 (http://www.sciecepublishiggroup.com/j/ajtas doi: 0.648/j.ajtas.05040. ISSN: 6-8999 (Prit; ISSN: 6-9006 (Olie Mathematical

More information

ROLL CUTTING PROBLEMS UNDER STOCHASTIC DEMAND

ROLL CUTTING PROBLEMS UNDER STOCHASTIC DEMAND Pacific-Asia Joural of Mathematics, Volume 5, No., Jauary-Jue 20 ROLL CUTTING PROBLEMS UNDER STOCHASTIC DEMAND SHAKEEL JAVAID, Z. H. BAKHSHI & M. M. KHALID ABSTRACT: I this paper, the roll cuttig problem

More information

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence of random variables. (telegram style notes) P.J.C. Spreij Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space

More information

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4 MATH 30: Probability ad Statistics 9. Estimatio ad Testig of Parameters Estimatio ad Testig of Parameters We have bee dealig situatios i which we have full kowledge of the distributio of a radom variable.

More information

An Intuitionistic fuzzy count and cardinality of Intuitionistic fuzzy sets

An Intuitionistic fuzzy count and cardinality of Intuitionistic fuzzy sets Malaya Joural of Matematik 4(1)(2013) 123 133 A Ituitioistic fuzzy cout ad cardiality of Ituitioistic fuzzy sets B. K. Tripathy a, S. P. Jea b ad S. K. Ghosh c, a School of Computig Scieces ad Egieerig,

More information

Integer Programming (IP)

Integer Programming (IP) Iteger Programmig (IP) The geeral liear mathematical programmig problem where Mied IP Problem - MIP ma c T + h Z T y A + G y + y b R p + vector of positive iteger variables y vector of positive real variables

More information

A collocation method for singular integral equations with cosecant kernel via Semi-trigonometric interpolation

A collocation method for singular integral equations with cosecant kernel via Semi-trigonometric interpolation Iteratioal Joural of Mathematics Research. ISSN 0976-5840 Volume 9 Number 1 (017) pp. 45-51 Iteratioal Research Publicatio House http://www.irphouse.com A collocatio method for sigular itegral equatios

More information

Generalized Semi- Markov Processes (GSMP)

Generalized Semi- Markov Processes (GSMP) Geeralized Semi- Markov Processes (GSMP) Summary Some Defiitios Markov ad Semi-Markov Processes The Poisso Process Properties of the Poisso Process Iterarrival times Memoryless property ad the residual

More information

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would

More information

THE KALMAN FILTER RAUL ROJAS

THE KALMAN FILTER RAUL ROJAS THE KALMAN FILTER RAUL ROJAS Abstract. This paper provides a getle itroductio to the Kalma filter, a umerical method that ca be used for sesor fusio or for calculatio of trajectories. First, we cosider

More information

Berry-Esseen bounds for self-normalized martingales

Berry-Esseen bounds for self-normalized martingales Berry-Essee bouds for self-ormalized martigales Xiequa Fa a, Qi-Ma Shao b a Ceter for Applied Mathematics, Tiaji Uiversity, Tiaji 30007, Chia b Departmet of Statistics, The Chiese Uiversity of Hog Kog,

More information

Recursive Algorithm for Generating Partitions of an Integer. 1 Preliminary

Recursive Algorithm for Generating Partitions of an Integer. 1 Preliminary Recursive Algorithm for Geeratig Partitios of a Iteger Sug-Hyuk Cha Computer Sciece Departmet, Pace Uiversity 1 Pace Plaza, New York, NY 10038 USA scha@pace.edu Abstract. This article first reviews the

More information

if j is a neighbor of i,

if j is a neighbor of i, We see that if i = j the the coditio is trivially satisfied. Otherwise, T ij (i) = (i)q ij mi 1, (j)q ji, ad, (i)q ij T ji (j) = (j)q ji mi 1, (i)q ij. (j)q ji Now there are two cases, if (j)q ji (i)q

More information

CHAPTER 10 INFINITE SEQUENCES AND SERIES

CHAPTER 10 INFINITE SEQUENCES AND SERIES CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece

More information

4. Partial Sums and the Central Limit Theorem

4. Partial Sums and the Central Limit Theorem 1 of 10 7/16/2009 6:05 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 4. Partial Sums ad the Cetral Limit Theorem The cetral limit theorem ad the law of large umbers are the two fudametal theorems

More information

EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY

EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA, 016 MODULE : Statistical Iferece Time allowed: Three hours Cadidates should aswer FIVE questios. All questios carry equal marks. The umber

More information

Provläsningsexemplar / Preview TECHNICAL REPORT INTERNATIONAL SPECIAL COMMITTEE ON RADIO INTERFERENCE

Provläsningsexemplar / Preview TECHNICAL REPORT INTERNATIONAL SPECIAL COMMITTEE ON RADIO INTERFERENCE TECHNICAL REPORT CISPR 16-4-3 2004 AMENDMENT 1 2006-10 INTERNATIONAL SPECIAL COMMITTEE ON RADIO INTERFERENCE Amedmet 1 Specificatio for radio disturbace ad immuity measurig apparatus ad methods Part 4-3:

More information

Statistical Fundamentals and Control Charts

Statistical Fundamentals and Control Charts Statistical Fudametals ad Cotrol Charts 1. Statistical Process Cotrol Basics Chace causes of variatio uavoidable causes of variatios Assigable causes of variatio large variatios related to machies, materials,

More information

The Poisson Distribution

The Poisson Distribution MATH 382 The Poisso Distributio Dr. Neal, WKU Oe of the importat distributios i probabilistic modelig is the Poisso Process X t that couts the umber of occurreces over a period of t uits of time. This

More information

Bounds for the Extreme Eigenvalues Using the Trace and Determinant

Bounds for the Extreme Eigenvalues Using the Trace and Determinant ISSN 746-7659, Eglad, UK Joural of Iformatio ad Computig Sciece Vol 4, No, 9, pp 49-55 Bouds for the Etreme Eigevalues Usig the Trace ad Determiat Qi Zhog, +, Tig-Zhu Huag School of pplied Mathematics,

More information

Stochastic Matrices in a Finite Field

Stochastic Matrices in a Finite Field Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices

More information

Markov Decision Processes

Markov Decision Processes Markov Decisio Processes Defiitios; Statioary policies; Value improvemet algorithm, Policy improvemet algorithm, ad liear programmig for discouted cost ad average cost criteria. Markov Decisio Processes

More information

Estimation of Backward Perturbation Bounds For Linear Least Squares Problem

Estimation of Backward Perturbation Bounds For Linear Least Squares Problem dvaced Sciece ad Techology Letters Vol.53 (ITS 4), pp.47-476 http://dx.doi.org/.457/astl.4.53.96 Estimatio of Bacward Perturbatio Bouds For Liear Least Squares Problem Xixiu Li School of Natural Scieces,

More information

Lecture 24: Variable selection in linear models

Lecture 24: Variable selection in linear models Lecture 24: Variable selectio i liear models Cosider liear model X = Z β + ε, β R p ad Varε = σ 2 I. Like the LSE, the ridge regressio estimator does ot give 0 estimate to a compoet of β eve if that compoet

More information

The Method of Least Squares. To understand least squares fitting of data.

The Method of Least Squares. To understand least squares fitting of data. The Method of Least Squares KEY WORDS Curve fittig, least square GOAL To uderstad least squares fittig of data To uderstad the least squares solutio of icosistet systems of liear equatios 1 Motivatio Curve

More information

1 Models for Matched Pairs

1 Models for Matched Pairs 1 Models for Matched Pairs Matched pairs occur whe we aalyse samples such that for each measuremet i oe of the samples there is a measuremet i the other sample that directly relates to the measuremet i

More information

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1 EECS564 Estimatio, Filterig, ad Detectio Hwk 2 Sols. Witer 25 4. Let Z be a sigle observatio havig desity fuctio where. p (z) = (2z + ), z (a) Assumig that is a oradom parameter, fid ad plot the maximum

More information

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i

More information

Lecture 10: Universal coding and prediction

Lecture 10: Universal coding and prediction 0-704: Iformatio Processig ad Learig Sprig 0 Lecture 0: Uiversal codig ad predictio Lecturer: Aarti Sigh Scribes: Georg M. Goerg Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved

More information

Definitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients.

Definitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients. Defiitios ad Theorems Remember the scalar form of the liear programmig problem, Miimize, Subject to, f(x) = c i x i a 1i x i = b 1 a mi x i = b m x i 0 i = 1,2,, where x are the decisio variables. c, b,

More information

TCOM 501: Networking Theory & Fundamentals. Lecture 3 January 29, 2003 Prof. Yannis A. Korilis

TCOM 501: Networking Theory & Fundamentals. Lecture 3 January 29, 2003 Prof. Yannis A. Korilis TCOM 5: Networkig Theory & Fudametals Lecture 3 Jauary 29, 23 Prof. Yais A. Korilis 3-2 Topics Markov Chais Discrete-Time Markov Chais Calculatig Statioary Distributio Global Balace Equatios Detailed Balace

More information

Properties and Hypothesis Testing

Properties and Hypothesis Testing Chapter 3 Properties ad Hypothesis Testig 3.1 Types of data The regressio techiques developed i previous chapters ca be applied to three differet kids of data. 1. Cross-sectioal data. 2. Time series data.

More information

Machine Learning Theory (CS 6783)

Machine Learning Theory (CS 6783) Machie Learig Theory (CS 6783) Lecture 2 : Learig Frameworks, Examples Settig up learig problems. X : istace space or iput space Examples: Computer Visio: Raw M N image vectorized X = 0, 255 M N, SIFT

More information

Preponderantly increasing/decreasing data in regression analysis

Preponderantly increasing/decreasing data in regression analysis Croatia Operatioal Research Review 269 CRORR 7(2016), 269 276 Prepoderatly icreasig/decreasig data i regressio aalysis Darija Marković 1, 1 Departmet of Mathematics, J. J. Strossmayer Uiversity of Osijek,

More information

The Phi Power Series

The Phi Power Series The Phi Power Series I did this work i about 0 years while poderig the relatioship betwee the golde mea ad the Madelbrot set. I have fially decided to make it available from my blog at http://semresearch.wordpress.com/.

More information

Similarity Solutions to Unsteady Pseudoplastic. Flow Near a Moving Wall

Similarity Solutions to Unsteady Pseudoplastic. Flow Near a Moving Wall Iteratioal Mathematical Forum, Vol. 9, 04, o. 3, 465-475 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.988/imf.04.48 Similarity Solutios to Usteady Pseudoplastic Flow Near a Movig Wall W. Robi Egieerig

More information

Fastest mixing Markov chain on a path

Fastest mixing Markov chain on a path Fastest mixig Markov chai o a path Stephe Boyd Persi Diacois Ju Su Li Xiao Revised July 2004 Abstract We ider the problem of assigig trasitio probabilities to the edges of a path, so the resultig Markov

More information

Product Mix Problem with Radom Return and Preference of Production Quantity. Osaka University Japan

Product Mix Problem with Radom Return and Preference of Production Quantity. Osaka University Japan Product Mix Problem with Radom Retur ad Preferece of Productio Quatity Hiroaki Ishii Osaka Uiversity Japa We call such fiace or idustrial assets allocatio problems portfolio selectio problems, ad various

More information

Evapotranspiration Estimation Using Support Vector Machines and Hargreaves-Samani Equation for St. Johns, FL, USA

Evapotranspiration Estimation Using Support Vector Machines and Hargreaves-Samani Equation for St. Johns, FL, USA Evirometal Egieerig 0th Iteratioal Coferece eissn 2029-7092 / eisbn 978-609-476-044-0 Vilius Gedimias Techical Uiversity Lithuaia, 27 28 April 207 Article ID: eviro.207.094 http://eviro.vgtu.lt DOI: https://doi.org/0.3846/eviro.207.094

More information

Chapter 9 - CD companion 1. A Generic Implementation; The Common-Merge Amplifier. 1 τ is. ω ch. τ io

Chapter 9 - CD companion 1. A Generic Implementation; The Common-Merge Amplifier. 1 τ is. ω ch. τ io Chapter 9 - CD compaio CHAPTER NINE CD-9.2 CD-9.2. Stages With Voltage ad Curret Gai A Geeric Implemetatio; The Commo-Merge Amplifier The advaced method preseted i the text for approximatig cutoff frequecies

More information

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would

More information

An Algebraic Elimination Method for the Linear Complementarity Problem

An Algebraic Elimination Method for the Linear Complementarity Problem Volume-3, Issue-5, October-2013 ISSN No: 2250-0758 Iteratioal Joural of Egieerig ad Maagemet Research Available at: wwwijemret Page Number: 51-55 A Algebraic Elimiatio Method for the Liear Complemetarity

More information

( a) ( ) 1 ( ) 2 ( ) ( ) 3 3 ( ) =!

( a) ( ) 1 ( ) 2 ( ) ( ) 3 3 ( ) =! .8,.9: Taylor ad Maclauri Series.8. Although we were able to fid power series represetatios for a limited group of fuctios i the previous sectio, it is ot immediately obvious whether ay give fuctio has

More information

Approximate Confidence Interval for the Reciprocal of a Normal Mean with a Known Coefficient of Variation

Approximate Confidence Interval for the Reciprocal of a Normal Mean with a Known Coefficient of Variation Metodološki zvezki, Vol. 13, No., 016, 117-130 Approximate Cofidece Iterval for the Reciprocal of a Normal Mea with a Kow Coefficiet of Variatio Wararit Paichkitkosolkul 1 Abstract A approximate cofidece

More information

Kolmogorov-Smirnov type Tests for Local Gaussianity in High-Frequency Data

Kolmogorov-Smirnov type Tests for Local Gaussianity in High-Frequency Data Proceedigs 59th ISI World Statistics Cogress, 5-30 August 013, Hog Kog (Sessio STS046) p.09 Kolmogorov-Smirov type Tests for Local Gaussiaity i High-Frequecy Data George Tauche, Duke Uiversity Viktor Todorov,

More information

Computational Tutorial of Steepest Descent Method and Its Implementation in Digital Image Processing

Computational Tutorial of Steepest Descent Method and Its Implementation in Digital Image Processing Computatioal utorial of Steepest Descet Method ad Its Implemetatio i Digital Image Processig Vorapoj Pataavijit Departmet of Electrical ad Electroic Egieerig, Faculty of Egieerig Assumptio Uiversity, Bagkok,

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013. Large Deviations for i.i.d. Random Variables

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013. Large Deviations for i.i.d. Random Variables MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013 Large Deviatios for i.i.d. Radom Variables Cotet. Cheroff boud usig expoetial momet geeratig fuctios. Properties of a momet

More information

A Semi-tensor Product Approach for Probabilistic Boolean Networks

A Semi-tensor Product Approach for Probabilistic Boolean Networks A Semi-tesor Product Approach for Probabilistic Boolea Networks Xiaoqig Cheg, Yusha Qiu, Wepi Hou ad Wai-Ki Chig Advaced Modelig ad Applied Computig Laboratory Departmet of Mathematics The Uiversity of

More information

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled 1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how

More information

1 Approximating Integrals using Taylor Polynomials

1 Approximating Integrals using Taylor Polynomials Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................

More information

On Nonsingularity of Saddle Point Matrices. with Vectors of Ones

On Nonsingularity of Saddle Point Matrices. with Vectors of Ones Iteratioal Joural of Algebra, Vol. 2, 2008, o. 4, 197-204 O Nosigularity of Saddle Poit Matrices with Vectors of Oes Tadeusz Ostrowski Istitute of Maagemet The State Vocatioal Uiversity -400 Gorzów, Polad

More information

Simulation of Discrete Event Systems

Simulation of Discrete Event Systems Simulatio of Discrete Evet Systems Uit 9 Queueig Models Fall Witer 2014/2015 Uiv.-Prof. Dr.-Ig. Dipl.-Wirt.-Ig. Christopher M. Schlick Chair ad Istitute of Idustrial Egieerig ad Ergoomics RWTH Aache Uiversity

More information

On forward improvement iteration for stopping problems

On forward improvement iteration for stopping problems O forward improvemet iteratio for stoppig problems Mathematical Istitute, Uiversity of Kiel, Ludewig-Mey-Str. 4, D-24098 Kiel, Germay irle@math.ui-iel.de Albrecht Irle Abstract. We cosider the optimal

More information

Journal of Multivariate Analysis. Superefficient estimation of the marginals by exploiting knowledge on the copula

Journal of Multivariate Analysis. Superefficient estimation of the marginals by exploiting knowledge on the copula Joural of Multivariate Aalysis 102 (2011) 1315 1319 Cotets lists available at ScieceDirect Joural of Multivariate Aalysis joural homepage: www.elsevier.com/locate/jmva Superefficiet estimatio of the margials

More information

CHAPTER 4 BIVARIATE DISTRIBUTION EXTENSION

CHAPTER 4 BIVARIATE DISTRIBUTION EXTENSION CHAPTER 4 BIVARIATE DISTRIBUTION EXTENSION 4. Itroductio Numerous bivariate discrete distributios have bee defied ad studied (see Mardia, 97 ad Kocherlakota ad Kocherlakota, 99) based o various methods

More information

Bayesian and E- Bayesian Method of Estimation of Parameter of Rayleigh Distribution- A Bayesian Approach under Linex Loss Function

Bayesian and E- Bayesian Method of Estimation of Parameter of Rayleigh Distribution- A Bayesian Approach under Linex Loss Function Iteratioal Joural of Statistics ad Systems ISSN 973-2675 Volume 12, Number 4 (217), pp. 791-796 Research Idia Publicatios http://www.ripublicatio.com Bayesia ad E- Bayesia Method of Estimatio of Parameter

More information

Mixtures of Gaussians and the EM Algorithm

Mixtures of Gaussians and the EM Algorithm Mixtures of Gaussias ad the EM Algorithm CSE 6363 Machie Learig Vassilis Athitsos Computer Sciece ad Egieerig Departmet Uiversity of Texas at Arligto 1 Gaussias A popular way to estimate probability desity

More information

Lecture 22: Review for Exam 2. 1 Basic Model Assumptions (without Gaussian Noise)

Lecture 22: Review for Exam 2. 1 Basic Model Assumptions (without Gaussian Noise) Lecture 22: Review for Exam 2 Basic Model Assumptios (without Gaussia Noise) We model oe cotiuous respose variable Y, as a liear fuctio of p umerical predictors, plus oise: Y = β 0 + β X +... β p X p +

More information

Lecture 19: Convergence

Lecture 19: Convergence Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may

More information

Alternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n.

Alternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n. 0_0905.qxd //0 :7 PM Page SECTION 9.5 Alteratig Series Sectio 9.5 Alteratig Series Use the Alteratig Series Test to determie whether a ifiite series coverges. Use the Alteratig Series Remaider to approximate

More information

Approximating the ruin probability of finite-time surplus process with Adaptive Moving Total Exponential Least Square

Approximating the ruin probability of finite-time surplus process with Adaptive Moving Total Exponential Least Square WSEAS TRANSACTONS o BUSNESS ad ECONOMCS S. Khotama, S. Boothiem, W. Klogdee Approimatig the rui probability of fiite-time surplus process with Adaptive Movig Total Epoetial Least Square S. KHOTAMA, S.

More information

Random Variables, Sampling and Estimation

Random Variables, Sampling and Estimation Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig

More information

If, for instance, we were required to test whether the population mean μ could be equal to a certain value μ

If, for instance, we were required to test whether the population mean μ could be equal to a certain value μ STATISTICAL INFERENCE INTRODUCTION Statistical iferece is that brach of Statistics i which oe typically makes a statemet about a populatio based upo the results of a sample. I oesample testig, we essetially

More information

Computation of Error Bounds for P-matrix Linear Complementarity Problems

Computation of Error Bounds for P-matrix Linear Complementarity Problems Mathematical Programmig mauscript No. (will be iserted by the editor) Xiaoju Che Shuhuag Xiag Computatio of Error Bouds for P-matrix Liear Complemetarity Problems Received: date / Accepted: date Abstract

More information

Goodness-of-Fit Tests and Categorical Data Analysis (Devore Chapter Fourteen)

Goodness-of-Fit Tests and Categorical Data Analysis (Devore Chapter Fourteen) Goodess-of-Fit Tests ad Categorical Data Aalysis (Devore Chapter Fourtee) MATH-252-01: Probability ad Statistics II Sprig 2019 Cotets 1 Chi-Squared Tests with Kow Probabilities 1 1.1 Chi-Squared Testig................

More information

Please do NOT write in this box. Multiple Choice. Total

Please do NOT write in this box. Multiple Choice. Total Istructor: Math 0560, Worksheet Alteratig Series Jauary, 3000 For realistic exam practice solve these problems without lookig at your book ad without usig a calculator. Multiple choice questios should

More information

There is no straightforward approach for choosing the warmup period l.

There is no straightforward approach for choosing the warmup period l. B. Maddah INDE 504 Discrete-Evet Simulatio Output Aalysis () Statistical Aalysis for Steady-State Parameters I a otermiatig simulatio, the iterest is i estimatig the log ru steady state measures of performace.

More information

RAINFALL PREDICTION BY WAVELET DECOMPOSITION

RAINFALL PREDICTION BY WAVELET DECOMPOSITION RAIFALL PREDICTIO BY WAVELET DECOMPOSITIO A. W. JAYAWARDEA Departmet of Civil Egieerig, The Uiversit of Hog Kog, Hog Kog, Chia P. C. XU Academ of Mathematics ad Sstem Scieces, Chiese Academ of Scieces,

More information

Chandrasekhar Type Algorithms. for the Riccati Equation of Lainiotis Filter

Chandrasekhar Type Algorithms. for the Riccati Equation of Lainiotis Filter Cotemporary Egieerig Scieces, Vol. 3, 00, o. 4, 9-00 Chadrasekhar ype Algorithms for the Riccati Equatio of Laiiotis Filter Nicholas Assimakis Departmet of Electroics echological Educatioal Istitute of

More information

Recurrence Relations

Recurrence Relations Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The

More information

CS284A: Representations and Algorithms in Molecular Biology

CS284A: Representations and Algorithms in Molecular Biology CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by

More information

BIOS 4110: Introduction to Biostatistics. Breheny. Lab #9

BIOS 4110: Introduction to Biostatistics. Breheny. Lab #9 BIOS 4110: Itroductio to Biostatistics Brehey Lab #9 The Cetral Limit Theorem is very importat i the realm of statistics, ad today's lab will explore the applicatio of it i both categorical ad cotiuous

More information

Scheduling under Uncertainty using MILP Sensitivity Analysis

Scheduling under Uncertainty using MILP Sensitivity Analysis Schedulig uder Ucertaity usig MILP Sesitivity Aalysis M. Ierapetritou ad Zheya Jia Departmet of Chemical & Biochemical Egieerig Rutgers, the State Uiversity of New Jersey Piscataway, NJ Abstract The aim

More information

Chapter 2 Descriptive Statistics

Chapter 2 Descriptive Statistics Chapter 2 Descriptive Statistics Statistics Most commoly, statistics refers to umerical data. Statistics may also refer to the process of collectig, orgaizig, presetig, aalyzig ad iterpretig umerical data

More information

6.883: Online Methods in Machine Learning Alexander Rakhlin

6.883: Online Methods in Machine Learning Alexander Rakhlin 6.883: Olie Methods i Machie Learig Alexader Rakhli LECTURES 5 AND 6. THE EXPERTS SETTING. EXPONENTIAL WEIGHTS All the algorithms preseted so far halluciate the future values as radom draws ad the perform

More information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 Calculus II Basic Convergence Tests for Series MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real

More information

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects

More information