STOCHASTIC MODEL OF MANUFACTURING EQUIPMENT S MAINTENANCE PROCESSES

Size: px
Start display at page:

Download "STOCHASTIC MODEL OF MANUFACTURING EQUIPMENT S MAINTENANCE PROCESSES"

Transcription

1

2

3 STOHSTI MODEL OF MNUFTURING EQUIPMENT S MINTENNE PROESSES Pokorádi, L.; pokoradi@eng.unideb.hu bstract: From mathematical point of view, the manufacturing equipment s maintenance is a discrete state space stochastic process without after-effects so it can be approximated with a Markov-chain. fter setting up of transition probability matrix analysis of the process with system approach can be investigated with matrixalgebraic operations. The paper will be aimed to show the possibilities of use of Markov matrix in case of stationary maintenance processes. well-algorithmizable method for mathematical modeling of stationary stochastic industrial process will be shown. The shown modeling method can be used to estimate maintenance cost of investigated manufacturing equipment. Keywords: maintenance; maintenance management, stochastic modeling. INTRODUTION In case of production line operation by modification of maintenance technology, equipment s repairing time could be decreased, but it would procure the increasing of repairing cost. The task was to forecast the total repair cost if the new technology would be installed. The aims were to solve the task mentioned above and, in addition to develop a wellalgorithmizable method for this and similar problems. The solution and this paper has been inspired mainly by (Rohács & Simon, 989) and (Pokorádi, 8). The manufacturing system operation is a stochastic process based upon the equipment, their maintenance, their preparation, and also based upon the personnel carrying out repair, and upon the regulations. This process can be considered as a mathematically continuous time, discrete state space Markov-process, that can be approximated with a Markov-chain. The paper of El-Dancese dealt with a system of n-independent repairable units that can be described by a homogeneous continuous-time discrete-state Markov process (El-Dancese, 995). Transition probabilities matrix of the system had the form of a modified Kronecker sum of transition-rate matrices of its units was investigated. The mathematical basis of Markovprocesses can be read from books (Karlin & Taylor, 975) and (Korn, & Korn, 975). The paper will be aimed to show the possibilities of use of Markov matrix in case of stationary maintenance processes. wellalgorithmizable method for mathematical modeling of stationary stochastic industrial process will be shown. The shown modeling method is usable to estimate maintenance cost and available time of investigated manufacturing equipment. The paper will be organized as follows: Section shows the applied literatures and the main goals of investigation. Section words the Markov-processes shortly. Section 3 presents the maintenance processes. Section shows a case study for maintenance management decision. summation, conclusion and future work provide in the section 5.. MRKOV PROESSES stochastic processes η(t) whose development in the future is influenced by its development in the past only through its development in the present, that is stochastic process without aftereffects, is called Markov-process. If process η(t) during the investigated period can have an X value at any moment, it is called a continuous-time process. If η can only have some value at certain moments, the process is called a discrete-time one. stochastic process is considered to be of discrete state space, if the possible values of variable η constitute a finite set or a countable non-finite set. Finite or count non-finite stochastic process, that is the discrete state space one with no aftereffects, is called Markov-chain. In this case the hypothetical probability n, n ij = Pη n [ ( t ) = X η( t ) X ] P = j n i ()

4 is called transition probability which expresses the probability that n(t n ) = X j, supposing that n(t n ) = X i (Karlin & Taylor, 975). The limiting value n, n Pij β ij = lim () tn tn t t n is called transition probability (in this study: λ - failure and µ - repair) rate. 3. MINTENNE PROESSES The manufacturing system operation is a stochastic process based upon the equipment, their maintenance, their preparation, and also based upon the personnel carrying out repair, and upon the regulations. The operational process of technical system (which is the complex of events that happen to the system from its manufacturing to its discarding) is a random in time and frequency succession of socalled states of operation. This process can be described with the so called operational chain, which is, from mathematical point of view a Markov-chain (see Fig. ). n vector. The staying of the object of the operation in different states can also be characterized by the vector of costs of the staying in state of the operation. Knowing the characteristics above we are able to determine the total operational cost.. THE SE STUDY During a production line equipment s operation three main types of failures can be experienced. When the -type failures where repaired, the servicemen detect frequently that -type failure will occur shortly. Then, the -type failure repair is carried out. The statistical analysis of data has showed that the failure and repair rates have exponential featured distributions and independent on the operating time of the production line. The table. shows the main failure and repair data of investigated production line equipment. λ μ λ μ μ λ λ Figure. n operational chain (see Figure.) 3 When analyzing operational processes with the system approach, the actual succession of single states for equipment is no concern of ours. It is rather complicated to describe the whole operational process with an operational chain. In order to achieve a clearer survey it is advisable to describe the operational process as a directed graph. Within the graph of operation states are represented by the vertexes of the graph, and transitions from one state to another are represented by the directed edges of the graph (for example Fig. ). nalyzing the operational chain or the type graph, we assume that states are clearly marked, and transitions occur during zero- time. For characterization of transitions from one state to another we use their transition probability (failure or repair) rates. The probabilities of staying in states of operation can be arranged in a probability Figure. Graph of the maintenance Process Using of equipment; -type failure s repair; 3 -type failure s repair; -type failure s repair Table. Main Data of Statistical nalysis Failures -type -type -type MTF τ [hour] 5,6 39,35 96,5 Failure rate λ [hour - ] 6, ,79-3, - MTR τ [hour],, 6, Repair rate μ [hour - ] 9,8 -,5 -,63 - Mean Repairing ost [ ] λ v [hour - ],6

5 y modification of manufacturing technology, repairing time of -type failure can be decreased approximately till hours, but its cost is increased to around 5 Euros. The task was to forecast the total repair cost of the application of the new technology. The data analysis suggests that the process is stationary, and its Markov model can be written by following equations: = ( λ λ λ ) P μ P = λ P ( μ λ = λ P λ P ) P μ P = λ P μ P () when: P i is the probability of staying in the i-th state of the operation (see Figure.). During the solution of the system of equations () there is a problem, that the numerical algorithms provide (or can provide) the trivial solution. It is obvious that the concern of investigation is the solution different from the trivial one. ecause aim of the author was to develop a well-algorithmizable method for this problem, the system of equations with unknowns () was transformed into an system equations with 5 unknowns by equation 3 Σ = P i = i= μ P μ P P () of probability of total event space. Thus the system of equations has changed to ( λ λ λ ) λ λ λ μ ( μ λ ) λ μ μ μ μ 3. P P P = 3 P P Σ (3) The solution of the system of linear equations reached by any numerical algorithm will result in a solution of the system of equations () different from the trivial one. The solution of equation (3) by data of Table is following probabilities of the staying in states: P =,883 ; P =,86 ; P 3 =,38 ; P =,5696. Knowing the cost of different repairs, the total repairing cost: K Σ = T i= k i P i τ where: T investigated time-interval; k i cost of the i-th repair. i, () The total repairing cost of the present maintenance system for hours is: KΣ = = 77.88EURO.. 6. (5) For forecasting of the total repair cost if new technology the above calculation was completed by the following modification t = hours ; k = 5. Its results probabilities of the staying in states are P =,97 ; P =,9 ; P 3 =, ; P =,58, and total cost of modified maintenance system is: KΣ = =. 6EURO,, 6, (6) From the results mentioned above, the following conclusions can be drawn: the probability of staying in -type failure s repair state will decrease measurably (by.7 %); the probabilities of staying in other failures repair will increase slightly (by.38 and.8 %); These conclusions should be taken account during the organizing of the new maintenance system management. hours-related total repair cost will be reduced by Euros; the availability of the equipment will be increasing by.83 %, that generates more profit by improvement of the reliability and the productivity of the production line.

6 These positive economic consequences should be compared with installation cost of the new repairing technology. 5. LOSING REMRKS, FUTURE WORK The paper showed a well-algorithmizable method developed by the author for mathematical modeling of stationary stochastic industrial processes. The shown modeling method can be used to estimate maintenance cost of manufacturing systems or their equipment. The general conclusion of this paper is that the stationary Markov model of operational processes can be used to investigate maintenance systems. During prospective scientific research related to this field of mathematics and technical management science, the author will prepare other methods to investigate maintenance processes of technical systems. 6. REFERENES El-Damcese, M..(995), Markovian-Model for Systems with Independent Units, Microelectron. Reliab, Vol 35, No 7. pp Karlin, S. & Taylor H.M. (985), First ourse in Stochastic Processes, cademic Press, pp Korn, G.. & Korn, T.M. (975), Matematical Handbook for Scientists and Engineers, Műszaki Könyvkiadó, udapest, pp Pokorádi, L. (8), Systems and Processes Modeling, ampus Kiadó, Debrecen, pp.. (in Hungarian) Rohács, J. & Simon, I. (989), Handbook of irplanes and Helicopters Maintenance, Műszaki Könyvkiadó, udapest, pp. 53. (in Hungarian)

LECTURE 4. Last time: Lecture outline

LECTURE 4. Last time: Lecture outline LECTURE 4 Last time: Types of convergence Weak Law of Large Numbers Strong Law of Large Numbers Asymptotic Equipartition Property Lecture outline Stochastic processes Markov chains Entropy rate Random

More information

A linear algebraic method for pricing temporary life annuities

A linear algebraic method for pricing temporary life annuities A linear algebraic method for pricing temporary life annuities P. Date (joint work with R. Mamon, L. Jalen and I.C. Wang) Department of Mathematical Sciences, Brunel University, London Outline Introduction

More information

Mathematical model based on the product sales market forecast of markov forecasting and application

Mathematical model based on the product sales market forecast of markov forecasting and application vailable online www.ocpr.com Journal of hemical and harmaceutical Research, 2014, 6(6):1359-1365 Research rticle IN : 0975-7384 ODEN(U) : JR5 Mathematical model based on the product sales market forecast

More information

Application of Markov chain analysis to trend prediction of stock indices Milan Svoboda 1, Ladislav Lukáš 2

Application of Markov chain analysis to trend prediction of stock indices Milan Svoboda 1, Ladislav Lukáš 2 Proceedings of 3th International Conference Mathematical Methods in Economics 1 Introduction Application of Markov chain analysis to trend prediction of stock indices Milan Svoboda 1, Ladislav Lukáš 2

More information

Practice Problems for Homework #8. Markov Chains. Read Sections 7.1-7.3. Solve the practice problems below.

Practice Problems for Homework #8. Markov Chains. Read Sections 7.1-7.3. Solve the practice problems below. Practice Problems for Homework #8. Markov Chains. Read Sections 7.1-7.3 Solve the practice problems below. Open Homework Assignment #8 and solve the problems. 1. (10 marks) A computer system can operate

More information

A Markovian Model for Investment Analysis in Advertising

A 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 information

MODELING CUSTOMER RELATIONSHIPS AS MARKOV CHAINS. Journal of Interactive Marketing, 14(2), Spring 2000, 43-55

MODELING CUSTOMER RELATIONSHIPS AS MARKOV CHAINS. Journal of Interactive Marketing, 14(2), Spring 2000, 43-55 MODELING CUSTOMER RELATIONSHIPS AS MARKOV CHAINS Phillip E. Pfeifer and Robert L. Carraway Darden School of Business 100 Darden Boulevard Charlottesville, VA 22903 Journal of Interactive Marketing, 14(2),

More information

3.2 Roulette and Markov Chains

3.2 Roulette and Markov Chains 238 CHAPTER 3. DISCRETE DYNAMICAL SYSTEMS WITH MANY VARIABLES 3.2 Roulette and Markov Chains In this section we will be discussing an application of systems of recursion equations called Markov Chains.

More information

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2. Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

More information

Analysis of a Production/Inventory System with Multiple Retailers

Analysis of a Production/Inventory System with Multiple Retailers Analysis of a Production/Inventory System with Multiple Retailers Ann M. Noblesse 1, Robert N. Boute 1,2, Marc R. Lambrecht 1, Benny Van Houdt 3 1 Research Center for Operations Management, University

More information

Statistics in Retail Finance. Chapter 6: Behavioural models

Statistics in Retail Finance. Chapter 6: Behavioural models Statistics in Retail Finance 1 Overview > So far we have focussed mainly on application scorecards. In this chapter we shall look at behavioural models. We shall cover the following topics:- Behavioural

More information

Modeling and Performance Evaluation of Computer Systems Security Operation 1

Modeling and Performance Evaluation of Computer Systems Security Operation 1 Modeling and Performance Evaluation of Computer Systems Security Operation 1 D. Guster 2 St.Cloud State University 3 N.K. Krivulin 4 St.Petersburg State University 5 Abstract A model of computer system

More information

Systems of Linear Equations

Systems of Linear Equations Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and

More information

LS.6 Solution Matrices

LS.6 Solution Matrices LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions

More information

UNCERTAINTIES OF MATHEMATICAL MODELING

UNCERTAINTIES OF MATHEMATICAL MODELING Proceedings of the 12 th Symposium of Mathematics and its Applications "Politehnica" University of Timisoara November, 5-7, 2009 UNCERTAINTIES OF MATHEMATICAL MODELING László POKORÁDI University of Debrecen

More information

CHAPTER 7 STOCHASTIC ANALYSIS OF MANPOWER LEVELS AFFECTING BUSINESS 7.1 Introduction

CHAPTER 7 STOCHASTIC ANALYSIS OF MANPOWER LEVELS AFFECTING BUSINESS 7.1 Introduction CHAPTER 7 STOCHASTIC ANALYSIS OF MANPOWER LEVELS AFFECTING BUSINESS 7.1 Introduction Consider in this chapter a business organization under fluctuating conditions of availability of manpower and business

More information

DATA ANALYSIS II. Matrix Algorithms

DATA ANALYSIS II. Matrix Algorithms DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where

More information

STRATEGIC CAPACITY PLANNING USING STOCK CONTROL MODEL

STRATEGIC CAPACITY PLANNING USING STOCK CONTROL MODEL Session 6. Applications of Mathematical Methods to Logistics and Business Proceedings of the 9th International Conference Reliability and Statistics in Transportation and Communication (RelStat 09), 21

More information

Master s Theory Exam Spring 2006

Master 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 information

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional 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 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

More information

Alessandro Birolini. ineerin. Theory and Practice. Fifth edition. With 140 Figures, 60 Tables, 120 Examples, and 50 Problems.

Alessandro Birolini. ineerin. Theory and Practice. Fifth edition. With 140 Figures, 60 Tables, 120 Examples, and 50 Problems. Alessandro Birolini Re ia i it En ineerin Theory and Practice Fifth edition With 140 Figures, 60 Tables, 120 Examples, and 50 Problems ~ Springer Contents 1 Basic Concepts, Quality and Reliability Assurance

More information

Largest Fixed-Aspect, Axis-Aligned Rectangle

Largest Fixed-Aspect, Axis-Aligned Rectangle Largest Fixed-Aspect, Axis-Aligned Rectangle David Eberly Geometric Tools, LLC http://www.geometrictools.com/ Copyright c 1998-2016. All Rights Reserved. Created: February 21, 2004 Last Modified: February

More information

THE BONUS-MALUS SYSTEM MODELLING USING THE TRANSITION MATRIX

THE BONUS-MALUS SYSTEM MODELLING USING THE TRANSITION MATRIX 1502 Challenges of the Knowledge Society Economics THE BONUS-MALUS SYSTEM MODELLING USING THE TRANSITION MATRIX SANDRA TEODORESCU * Abstract The motor insurance is an important branch of non-life insurance

More information

Optimal Hiring of Cloud Servers A. Stephen McGough, Isi Mitrani. EPEW 2014, Florence

Optimal Hiring of Cloud Servers A. Stephen McGough, Isi Mitrani. EPEW 2014, Florence Optimal Hiring of Cloud Servers A. Stephen McGough, Isi Mitrani EPEW 2014, Florence Scenario How many cloud instances should be hired? Requests Host hiring servers The number of active servers is controlled

More information

Diablo Valley College Catalog 2014-2015

Diablo Valley College Catalog 2014-2015 Mathematics MATH Michael Norris, Interim Dean Math and Computer Science Division Math Building, Room 267 Possible career opportunities Mathematicians work in a variety of fields, among them statistics,

More information

Hydrodynamic Limits of Randomized Load Balancing Networks

Hydrodynamic Limits of Randomized Load Balancing Networks Hydrodynamic Limits of Randomized Load Balancing Networks Kavita Ramanan and Mohammadreza Aghajani Brown University Stochastic Networks and Stochastic Geometry a conference in honour of François Baccelli

More information

D-Policy for a Production Inventory System with Perishable Items

D-Policy for a Production Inventory System with Perishable Items Chapter 6 D-Policy for a Production Inventory System with Perishable Items 6.1 Introduction So far we were concentrating on invenory with positive (random) service time. In this chapter we concentrate

More information

A Profit-Maximizing Production Lot sizing Decision Model with Stochastic Demand

A Profit-Maximizing Production Lot sizing Decision Model with Stochastic Demand A Profit-Maximizing Production Lot sizing Decision Model with Stochastic Demand Kizito Paul Mubiru Department of Mechanical and Production Engineering Kyambogo University, Uganda Abstract - Demand uncertainty

More information

Markovian Process and Novel Secure Algorithm for Big Data in Two-Hop Wireless Networks

Markovian Process and Novel Secure Algorithm for Big Data in Two-Hop Wireless Networks Markovian Process and Novel Secure Algorithm for Big Data in Two-Hop Wireless Networks K. Thiagarajan, Department of Mathematics, PSNA College of Engineering and Technology, Dindigul, India. A. Veeraiah,

More information

SALEM COMMUNITY COLLEGE Carneys Point, New Jersey 08069 COURSE SYLLABUS COVER SHEET. Action Taken (Please Check One) New Course Initiated

SALEM COMMUNITY COLLEGE Carneys Point, New Jersey 08069 COURSE SYLLABUS COVER SHEET. Action Taken (Please Check One) New Course Initiated SALEM COMMUNITY COLLEGE Carneys Point, New Jersey 08069 COURSE SYLLABUS COVER SHEET Course Title Course Number Department Linear Algebra Mathematics MAT-240 Action Taken (Please Check One) New Course Initiated

More information

An Effective Risk Avoidance Scheme for the EigenTrust Reputation Management System

An Effective Risk Avoidance Scheme for the EigenTrust Reputation Management System An Effective Risk Avoidance Scheme for the EigenTrust Reputation Management System Takuya Nishikawa and Satoshi Fujita Department of Information Engineering, Hiroshima University Kagamiyama 1-4-1, Higashi-Hiroshima,

More information

Performance Analysis of a Telephone System with both Patient and Impatient Customers

Performance Analysis of a Telephone System with both Patient and Impatient Customers Performance Analysis of a Telephone System with both Patient and Impatient Customers Yiqiang Quennel Zhao Department of Mathematics and Statistics University of Winnipeg Winnipeg, Manitoba Canada R3B 2E9

More information

Linear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc.

Linear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc. 1. Introduction Linear Programming for Optimization Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc. 1.1 Definition Linear programming is the name of a branch of applied mathematics that

More information

SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

SHARP 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 information

1/3 1/3 1/3 0.4 0.4 0.4 0.4 0.4 0.4 0.4 0 1 2 3 4 5 6 7 8 0.6 0.6 0.6 0.6 0.6 0.6 0.6

1/3 1/3 1/3 0.4 0.4 0.4 0.4 0.4 0.4 0.4 0 1 2 3 4 5 6 7 8 0.6 0.6 0.6 0.6 0.6 0.6 0.6 HOMEWORK 4: SOLUTIONS. 2. A Markov chain with state space {, 2, 3} has transition probability matrix /3 /3 /3 P = 0 /2 /2 0 0 Show that state 3 is absorbing and, starting from state, find the expected

More information

Statistics Graduate Courses

Statistics Graduate Courses Statistics Graduate Courses STAT 7002--Topics in Statistics-Biological/Physical/Mathematics (cr.arr.).organized study of selected topics. Subjects and earnable credit may vary from semester to semester.

More information

IEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS

IEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS IEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS There are four questions, each with several parts. 1. Customers Coming to an Automatic Teller Machine (ATM) (30 points)

More information

Math 202-0 Quizzes Winter 2009

Math 202-0 Quizzes Winter 2009 Quiz : Basic Probability Ten Scrabble tiles are placed in a bag Four of the tiles have the letter printed on them, and there are two tiles each with the letters B, C and D on them (a) Suppose one tile

More information

Experiments on the local load balancing algorithms; part 1

Experiments on the local load balancing algorithms; part 1 Experiments on the local load balancing algorithms; part 1 Ştefan Măruşter Institute e-austria Timisoara West University of Timişoara, Romania maruster@info.uvt.ro Abstract. In this paper the influence

More information

5.5. Solving linear systems by the elimination method

5.5. Solving linear systems by the elimination method 55 Solving linear systems by the elimination method Equivalent systems The major technique of solving systems of equations is changing the original problem into another one which is of an easier to solve

More information

MODELING CUSTOMER RELATIONSHIPS AS MARKOV CHAINS

MODELING CUSTOMER RELATIONSHIPS AS MARKOV CHAINS AS MARKOV CHAINS Phillip E. Pfeifer Robert L. Carraway f PHILLIP E. PFEIFER AND ROBERT L. CARRAWAY are with the Darden School of Business, Charlottesville, Virginia. INTRODUCTION The lifetime value of

More information

Markov random fields and Gibbs measures

Markov random fields and Gibbs measures Chapter Markov random fields and Gibbs measures 1. Conditional independence Suppose X i is a random element of (X i, B i ), for i = 1, 2, 3, with all X i defined on the same probability space (.F, P).

More information

Optimal proportional reinsurance and dividend pay-out for insurance companies with switching reserves

Optimal proportional reinsurance and dividend pay-out for insurance companies with switching reserves Optimal proportional reinsurance and dividend pay-out for insurance companies with switching reserves Abstract: This paper presents a model for an insurance company that controls its risk and dividend

More information

Performance Analysis of a Selected System in a Process Industry

Performance Analysis of a Selected System in a Process Industry Research Article International Journal of Current Engineering and Technology E-ISSN 2277 4106, P-ISSN 2347-5161 2014 INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Performance

More information

SPECTRAL POLYNOMIAL ALGORITHMS FOR COMPUTING BI-DIAGONAL REPRESENTATIONS FOR PHASE TYPE DISTRIBUTIONS AND MATRIX-EXPONENTIAL DISTRIBUTIONS

SPECTRAL POLYNOMIAL ALGORITHMS FOR COMPUTING BI-DIAGONAL REPRESENTATIONS FOR PHASE TYPE DISTRIBUTIONS AND MATRIX-EXPONENTIAL DISTRIBUTIONS Stochastic Models, 22:289 317, 2006 Copyright Taylor & Francis Group, LLC ISSN: 1532-6349 print/1532-4214 online DOI: 10.1080/15326340600649045 SPECTRAL POLYNOMIAL ALGORITHMS FOR COMPUTING BI-DIAGONAL

More information

Row Echelon Form and Reduced Row Echelon Form

Row Echelon Form and Reduced Row Echelon Form These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation

More information

4.5 Linear Dependence and Linear Independence

4.5 Linear Dependence and Linear Independence 4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then

More information

Some Research Problems in Uncertainty Theory

Some Research Problems in Uncertainty Theory Journal of Uncertain Systems Vol.3, No.1, pp.3-10, 2009 Online at: www.jus.org.uk Some Research Problems in Uncertainty Theory aoding Liu Uncertainty Theory Laboratory, Department of Mathematical Sciences

More information

Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations

Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations 56 Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations Florin-Cătălin ENACHE

More information

Linear Programming I

Linear Programming I Linear Programming I November 30, 2003 1 Introduction In the VCR/guns/nuclear bombs/napkins/star wars/professors/butter/mice problem, the benevolent dictator, Bigus Piguinus, of south Antarctica penguins

More information

Performance of Cloud Computing Centers with Multiple Priority Classes

Performance of Cloud Computing Centers with Multiple Priority Classes 202 IEEE Fifth International Conference on Cloud Computing Performance of Cloud Computing Centers with Multiple Priority Classes Wendy Ellens, Miroslav Živković, Jacob Akkerboom, Remco Litjens, Hans van

More information

AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC

AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC W. T. TUTTE. Introduction. In a recent series of papers [l-4] on graphs and matroids I used definitions equivalent to the following.

More information

Testing Simple Markov Structures for Credit Rating Transitions

Testing Simple Markov Structures for Credit Rating Transitions Testing Simple Markov Structures for Credit Rating Transitions Nicholas M. Kiefer and C. Erik Larson OCC Economics Working Paper 2004-3 Abstract Models abound that analyze changes in credit quality. These

More information

STOCHASTIC ANALYSIS OF AN AIR CONDITION COOLING SYSTEM MODEL

STOCHASTIC ANALYSIS OF AN AIR CONDITION COOLING SYSTEM MODEL Journal of Reliability and Statistical Studies; ISSN (Print) 09-804 (Online)9-5666 Vol. 4 Issue 1 (011) 95-106 STOCHASTIC ANALYSIS OF AN AIR CONDITION COOLING SYSTEM MODEL Rakesh Gupta1 Punam Phartyal

More information

The Joint Distribution of Server State and Queue Length of M/M/1/1 Retrial Queue with Abandonment and Feedback

The Joint Distribution of Server State and Queue Length of M/M/1/1 Retrial Queue with Abandonment and Feedback The Joint Distribution of Server State and Queue Length of M/M/1/1 Retrial Queue with Abandonment and Feedback Hamada Alshaer Université Pierre et Marie Curie - Lip 6 7515 Paris, France Hamada.alshaer@lip6.fr

More information

Random access protocols for channel access. Markov chains and their stability. Laurent Massoulié.

Random access protocols for channel access. Markov chains and their stability. Laurent Massoulié. Random access protocols for channel access Markov chains and their stability laurent.massoulie@inria.fr Aloha: the first random access protocol for channel access [Abramson, Hawaii 70] Goal: allow machines

More information

State Space Time Series Analysis

State Space Time Series Analysis State Space Time Series Analysis p. 1 State Space Time Series Analysis Siem Jan Koopman http://staff.feweb.vu.nl/koopman Department of Econometrics VU University Amsterdam Tinbergen Institute 2011 State

More information

A QUEUEING-INVENTORY SYSTEM WITH DEFECTIVE ITEMS AND POISSON DEMAND. bhaji@usc.edu

A QUEUEING-INVENTORY SYSTEM WITH DEFECTIVE ITEMS AND POISSON DEMAND. bhaji@usc.edu A QUEUEING-INVENTORY SYSTEM WITH DEFECTIVE ITEMS AND POISSON DEMAND Rasoul Hai 1, Babak Hai 1 Industrial Engineering Department, Sharif University of Technology, +98-1-66165708, hai@sharif.edu Industrial

More information

INDIRECT INFERENCE (prepared for: The New Palgrave Dictionary of Economics, Second Edition)

INDIRECT INFERENCE (prepared for: The New Palgrave Dictionary of Economics, Second Edition) INDIRECT INFERENCE (prepared for: The New Palgrave Dictionary of Economics, Second Edition) Abstract Indirect inference is a simulation-based method for estimating the parameters of economic models. Its

More information

The Basics of FEA Procedure

The Basics of FEA Procedure CHAPTER 2 The Basics of FEA Procedure 2.1 Introduction This chapter discusses the spring element, especially for the purpose of introducing various concepts involved in use of the FEA technique. A spring

More information

A Markovian model of the RED mechanism solved with a cluster of computers

A Markovian model of the RED mechanism solved with a cluster of computers Annales UMCS Informatica AI 5 (2006) 19-27 Annales UMCS Informatica Lublin-Polonia Sectio AI http://www.annales.umcs.lublin.pl/ A Markovian model of the RED mechanism solved with a cluster of computers

More information

UNCOUPLING THE PERRON EIGENVECTOR PROBLEM

UNCOUPLING THE PERRON EIGENVECTOR PROBLEM UNCOUPLING THE PERRON EIGENVECTOR PROBLEM Carl D Meyer INTRODUCTION Foranonnegative irreducible matrix m m with spectral radius ρ,afundamental problem concerns the determination of the unique normalized

More information

Introduction to Markov Chain Monte Carlo

Introduction to Markov Chain Monte Carlo Introduction to Markov Chain Monte Carlo Monte Carlo: sample from a distribution to estimate the distribution to compute max, mean Markov Chain Monte Carlo: sampling using local information Generic problem

More information

Hardware Implementation of Probabilistic State Machine for Word Recognition

Hardware Implementation of Probabilistic State Machine for Word Recognition IJECT Vo l. 4, Is s u e Sp l - 5, Ju l y - Se p t 2013 ISSN : 2230-7109 (Online) ISSN : 2230-9543 (Print) Hardware Implementation of Probabilistic State Machine for Word Recognition 1 Soorya Asokan, 2

More information

Single item inventory control under periodic review and a minimum order quantity

Single item inventory control under periodic review and a minimum order quantity Single item inventory control under periodic review and a minimum order quantity G. P. Kiesmüller, A.G. de Kok, S. Dabia Faculty of Technology Management, Technische Universiteit Eindhoven, P.O. Box 513,

More information

Alabama Department of Postsecondary Education

Alabama Department of Postsecondary Education Date Adopted 1998 Dates reviewed 2007, 2011, 2013 Dates revised 2004, 2008, 2011, 2013, 2015 Alabama Department of Postsecondary Education Representing Alabama s Public Two-Year College System Jefferson

More information

Random variables P(X = 3) = P(X = 3) = 1 8, P(X = 1) = P(X = 1) = 3 8.

Random variables P(X = 3) = P(X = 3) = 1 8, P(X = 1) = P(X = 1) = 3 8. Random variables Remark on Notations 1. When X is a number chosen uniformly from a data set, What I call P(X = k) is called Freq[k, X] in the courseware. 2. When X is a random variable, what I call F ()

More information

Inference on Phase-type Models via MCMC

Inference on Phase-type Models via MCMC Inference on Phase-type Models via MCMC with application to networks of repairable redundant systems Louis JM Aslett and Simon P Wilson Trinity College Dublin 28 th June 202 Toy Example : Redundant Repairable

More information

Linearly Independent Sets and Linearly Dependent Sets

Linearly Independent Sets and Linearly Dependent Sets These notes closely follow the presentation of the material given in David C. Lay s textbook Linear Algebra and its Applications (3rd edition). These notes are intended primarily for in-class presentation

More information

MATHEMATICAL METHODS OF STATISTICS

MATHEMATICAL METHODS OF STATISTICS MATHEMATICAL METHODS OF STATISTICS By HARALD CRAMER TROFESSOK IN THE UNIVERSITY OF STOCKHOLM Princeton PRINCETON UNIVERSITY PRESS 1946 TABLE OF CONTENTS. First Part. MATHEMATICAL INTRODUCTION. CHAPTERS

More information

Security Risk Management via Dynamic Games with Learning

Security Risk Management via Dynamic Games with Learning Security Risk Management via Dynamic Games with Learning Praveen Bommannavar Management Science & Engineering Stanford University Stanford, California 94305 Email: bommanna@stanford.edu Tansu Alpcan Deutsche

More information

QUANTIZED INTEREST RATE AT THE MONEY FOR AMERICAN OPTIONS

QUANTIZED INTEREST RATE AT THE MONEY FOR AMERICAN OPTIONS QUANTIZED INTEREST RATE AT THE MONEY FOR AMERICAN OPTIONS L. M. Dieng ( Department of Physics, CUNY/BCC, New York, New York) Abstract: In this work, we expand the idea of Samuelson[3] and Shepp[,5,6] for

More information

METHODOLOGICAL CONSIDERATIONS OF DRIVE SYSTEM SIMULATION, WHEN COUPLING FINITE ELEMENT MACHINE MODELS WITH THE CIRCUIT SIMULATOR MODELS OF CONVERTERS.

METHODOLOGICAL CONSIDERATIONS OF DRIVE SYSTEM SIMULATION, WHEN COUPLING FINITE ELEMENT MACHINE MODELS WITH THE CIRCUIT SIMULATOR MODELS OF CONVERTERS. SEDM 24 June 16th - 18th, CPRI (Italy) METHODOLOGICL CONSIDERTIONS OF DRIVE SYSTEM SIMULTION, WHEN COUPLING FINITE ELEMENT MCHINE MODELS WITH THE CIRCUIT SIMULTOR MODELS OF CONVERTERS. Áron Szûcs BB Electrical

More information

What is Linear Programming?

What is Linear Programming? Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to

More information

TABLE OF CONTENTS. GENERAL AND HISTORICAL PREFACE iii SIXTH EDITION PREFACE v PART ONE: REVIEW AND BACKGROUND MATERIAL

TABLE OF CONTENTS. GENERAL AND HISTORICAL PREFACE iii SIXTH EDITION PREFACE v PART ONE: REVIEW AND BACKGROUND MATERIAL TABLE OF CONTENTS GENERAL AND HISTORICAL PREFACE iii SIXTH EDITION PREFACE v PART ONE: REVIEW AND BACKGROUND MATERIAL CHAPTER ONE: REVIEW OF INTEREST THEORY 3 1.1 Interest Measures 3 1.2 Level Annuity

More information

Load Balancing and Switch Scheduling

Load Balancing and Switch Scheduling EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load

More information

THE SCHEDULING OF MAINTENANCE SERVICE

THE SCHEDULING OF MAINTENANCE SERVICE THE SCHEDULING OF MAINTENANCE SERVICE Shoshana Anily Celia A. Glass Refael Hassin Abstract We study a discrete problem of scheduling activities of several types under the constraint that at most a single

More information

South Carolina College- and Career-Ready (SCCCR) Pre-Calculus

South Carolina College- and Career-Ready (SCCCR) Pre-Calculus South Carolina College- and Career-Ready (SCCCR) Pre-Calculus Key Concepts Arithmetic with Polynomials and Rational Expressions PC.AAPR.2 PC.AAPR.3 PC.AAPR.4 PC.AAPR.5 PC.AAPR.6 PC.AAPR.7 Standards Know

More information

Continuous Compounding and Discounting

Continuous Compounding and Discounting Continuous Compounding and Discounting Philip A. Viton October 5, 2011 Continuous October 5, 2011 1 / 19 Introduction Most real-world project analysis is carried out as we ve been doing it, with the present

More information

OPTIMIZED PERFORMANCE EVALUATIONS OF CLOUD COMPUTING SERVERS

OPTIMIZED PERFORMANCE EVALUATIONS OF CLOUD COMPUTING SERVERS OPTIMIZED PERFORMANCE EVALUATIONS OF CLOUD COMPUTING SERVERS K. Sarathkumar Computer Science Department, Saveetha School of Engineering Saveetha University, Chennai Abstract: The Cloud computing is one

More information

USE OF EIGENVALUES AND EIGENVECTORS TO ANALYZE BIPARTIVITY OF NETWORK GRAPHS

USE OF EIGENVALUES AND EIGENVECTORS TO ANALYZE BIPARTIVITY OF NETWORK GRAPHS USE OF EIGENVALUES AND EIGENVECTORS TO ANALYZE BIPARTIVITY OF NETWORK GRAPHS Natarajan Meghanathan Jackson State University, 1400 Lynch St, Jackson, MS, USA natarajan.meghanathan@jsums.edu ABSTRACT This

More information

Analysis of an Artificial Hormone System (Extended abstract)

Analysis of an Artificial Hormone System (Extended abstract) c 2013. This is the author s version of the work. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purpose or for creating

More information

Reinforcement Learning

Reinforcement Learning Reinforcement Learning LU 2 - Markov Decision Problems and Dynamic Programming Dr. Martin Lauer AG Maschinelles Lernen und Natürlichsprachliche Systeme Albert-Ludwigs-Universität Freiburg martin.lauer@kit.edu

More information

CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010 CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected

More information

This exposition of linear programming

This exposition of linear programming Linear Programming and the Simplex Method David Gale This exposition of linear programming and the simplex method is intended as a companion piece to the article in this issue on the life and work of George

More information

1.2 Solving a System of Linear Equations

1.2 Solving a System of Linear Equations 1.. SOLVING A SYSTEM OF LINEAR EQUATIONS 1. Solving a System of Linear Equations 1..1 Simple Systems - Basic De nitions As noticed above, the general form of a linear system of m equations in n variables

More information

A Review And Evaluations Of Shortest Path Algorithms

A Review And Evaluations Of Shortest Path Algorithms A Review And Evaluations Of Shortest Path Algorithms Kairanbay Magzhan, Hajar Mat Jani Abstract: Nowadays, in computer networks, the routing is based on the shortest path problem. This will help in minimizing

More information

Bias in the Estimation of Mean Reversion in Continuous-Time Lévy Processes

Bias in the Estimation of Mean Reversion in Continuous-Time Lévy Processes Bias in the Estimation of Mean Reversion in Continuous-Time Lévy Processes Yong Bao a, Aman Ullah b, Yun Wang c, and Jun Yu d a Purdue University, IN, USA b University of California, Riverside, CA, USA

More information

FEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL

FEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL FEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL STATIsTICs 4 IV. RANDOm VECTORs 1. JOINTLY DIsTRIBUTED RANDOm VARIABLEs If are two rom variables defined on the same sample space we define the joint

More information

2x + y = 3. Since the second equation is precisely the same as the first equation, it is enough to find x and y satisfying the system

2x + y = 3. Since the second equation is precisely the same as the first equation, it is enough to find x and y satisfying the system 1. Systems of linear equations We are interested in the solutions to systems of linear equations. A linear equation is of the form 3x 5y + 2z + w = 3. The key thing is that we don t multiply the variables

More information

Introduction to time series analysis

Introduction to time series analysis Introduction to time series analysis Margherita Gerolimetto November 3, 2010 1 What is a time series? A time series is a collection of observations ordered following a parameter that for us is time. Examples

More information

Linear Algebra Notes

Linear Algebra Notes Linear Algebra Notes Chapter 19 KERNEL AND IMAGE OF A MATRIX Take an n m matrix a 11 a 12 a 1m a 21 a 22 a 2m a n1 a n2 a nm and think of it as a function A : R m R n The kernel of A is defined as Note

More information

ESTIMATION OF CLAIM NUMBERS IN AUTOMOBILE INSURANCE

ESTIMATION OF CLAIM NUMBERS IN AUTOMOBILE INSURANCE Annales Univ. Sci. Budapest., Sect. Comp. 42 (2014) 19 35 ESTIMATION OF CLAIM NUMBERS IN AUTOMOBILE INSURANCE Miklós Arató (Budapest, Hungary) László Martinek (Budapest, Hungary) Dedicated to András Benczúr

More information

Point and Interval Estimates

Point and Interval Estimates Point and Interval Estimates Suppose we want to estimate a parameter, such as p or µ, based on a finite sample of data. There are two main methods: 1. Point estimate: Summarize the sample by a single number

More information

Performance Evaluation and Prediction of IT-Outsourcing Service Supply Chain based on Improved SCOR Model

Performance Evaluation and Prediction of IT-Outsourcing Service Supply Chain based on Improved SCOR Model Performance Evaluation and Prediction of IT-Outsourcing Service Supply Chain based on Improved SCOR Model 1, 2 1 International School of Software, Wuhan University, Wuhan, China *2 School of Information

More information

Generating Random Samples from the Generalized Pareto Mixture Model

Generating Random Samples from the Generalized Pareto Mixture Model Generating Random Samples from the Generalized Pareto Mixture Model MUSTAFA ÇAVUŞ AHMET SEZER BERNA YAZICI Department of Statistics Anadolu University Eskişehir 26470 TURKEY mustafacavus@anadolu.edu.tr

More information

A FUZZY LOGIC APPROACH FOR SALES FORECASTING

A FUZZY LOGIC APPROACH FOR SALES FORECASTING A FUZZY LOGIC APPROACH FOR SALES FORECASTING ABSTRACT Sales forecasting proved to be very important in marketing where managers need to learn from historical data. Many methods have become available for

More information

Effective Bandwidth of Multiclass Markovian Traffic Sources and Admission Control With Dynamic Buffer Partitioning

Effective Bandwidth of Multiclass Markovian Traffic Sources and Admission Control With Dynamic Buffer Partitioning 1524 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 51, NO. 9, SEPTEMBER 2003 Effective Bandwidth of Multiclass Markovian Traffic Sources and Admission Control With Dynamic Buffer Partitioning Yu Cheng, Student

More information

The continuous and discrete Fourier transforms

The continuous and discrete Fourier transforms FYSA21 Mathematical Tools in Science The continuous and discrete Fourier transforms Lennart Lindegren Lund Observatory (Department of Astronomy, Lund University) 1 The continuous Fourier transform 1.1

More information

DATA VERIFICATION IN ETL PROCESSES

DATA VERIFICATION IN ETL PROCESSES KNOWLEDGE ENGINEERING: PRINCIPLES AND TECHNIQUES Proceedings of the International Conference on Knowledge Engineering, Principles and Techniques, KEPT2007 Cluj-Napoca (Romania), June 6 8, 2007, pp. 282

More information