Application of Queuing Theory to Waiting Time of Out-Patients in Hospitals.
|
|
- Corey Powers
- 6 years ago
- Views:
Transcription
1 Applcaton of Queung Theory to Watng Tme of Out-Patents n Hosptals. R.A. Adeleke *, O.D. Ogunwale, and O.Y. Hald. Department of Mathematcal Scences, Unversty of Ado-Ekt, Ado-Ekt, Ekt State, Ngera. E-mal: waleod@yahoo.com ABSTRACT Ths paper consders the watng of patents n unversty health centers as a sngle-channel queung system wth Posson arrvals and exponental servce rate where arrvals are handled on a frst come frst serve bass. Hence, the m/m/ queung system s however proposed. The average number of patents, the average tme spent by each patent as well as the probablty of arrval of patents nto the queung system wll be obtaned. (Keywords: sngle channel queung system, Posson arrvals, exponental servce rates) INTRODUCTION The exstence of any naton s a functon of the survval of ts ctzens and n turn a functon of adequate health care programs of ts ctzenry. Health, no doubt has a great nfluence on the economy. As a result, the government establshed hosptals, prmary health care centers, federal medcal centers, unversty teachng hosptals, and so on, to mprove the health care of Ngerans at affordable cost. Also, several health polces and laws were formulated and adopted to make these aforementoned centers functonal. These health polces also brought about the establshment of global and local health organzaton such as World Health Organzaton (WHO). Unted Natons Internatonal Chldren Emergency Fund (UNICEF) and a host of others. Despte all these efforts, t should be noted that, there are stll some avodable problems whch undermne ther success of ths sector. One of the most frequent of them s the problem of watng lnes (queues) found n hosptals. Queung s a very volatle stuaton whch cause unnecessary delay and reduce the servce effectveness of establshments. Apart from the tme wasted, t also leads to breakdown of law and order. Many lves and property had been lost n queues at fllng statons n the past. Queues n hosptals often have severe consequences. For nstance, delay n treatment of asthma, dabetes, and cardac dsease patents often lead to complcatons and eventual death. (The World Bank Illustrated Home Medcal Encyclopeda, 998). In lght of ths, there s need for a crtcal evaluaton of patent watng tme as well as reducng or elmnatng t. METHODOLOGY Data on arrval tmes, tme servce begns, tme servce ends, and departure tme of 00 patents was collected over 4 days. Ths data wll enable us to obtan the arrval rate, the servce rate, and the traffc ntensty of the patents usng results from the brth and death model (whch s synonymous to arrval and departure). MODEL SPECIFICATION The m/m/ Queue (Sngle-Channel Queung System). In ths queung system, the customers arrve accordng to a Posson process wth rate. The tme t takes to serve every customer s an exponental random varable wth parameter μ. The servce tmes are mutually ndependent and further ndependent of the nter arrval tmes. When a customer enters an empty system, hs servce starts at once and f the system s nonempty, the ncomng customer jons the queue. The Pacfc Journal of Scence and Technology 70
2 When a servce completon occurs, a customer from the queue f any, enters the servce faclty at once to get served. THEOREM The process ( X( t), t 0) process wth brth rate death rate μ μ. s a brth and death 0 and Proof Because of the exponental dstrbuton of the nter arrval tmes and of the servce tmes, t s obvous that ( X( t), t 0) s a Markov process. On the other hand, snce the probablty of havng two events (departure and arrval) n the nterval f tme (, tt+ h) s 0( h). We therefore have: PXt [ ( + h) + Xt ( ) ] h+ 0( h) 0 PXt [ ( + h) Xt ( ) ] μh+ 0( h) PXt [ ( + h) Xt () ] ( + μ) h+ 0( h) PXt [ ( + h) Xt ( ) ] h+ 0( h), 0 PXt [ ( + h) Xt ( ) ] 0( h), j () Ths shows that ( X( t), t 0) s a brth and death process. Suppose π (), 0s the densty functon of the number of customers n the system at a steady-state, the balanced equaton for ths brth and death process s: π(0) μ π() Generally, () ( + μπ ) ( ) π( ) + μπ( + ) We defne μ (3) (4) referred to as the traffc ntensty called the mean quantty of work brought to the system per unt tme. A drect applcaton of (4) yelds a statonary queue-length densty functon of an m/m/ queue gven by: π() ( ), 0, < (5) Therefore, the stablty condton < smply says that the system s stable f the work that s brought to the system per unt tme s strctly smaller than the processng rate. It s noteworthy that the queue wll empty nfntely many tmes when the system s stable. That s, 0 from (5) π (0) > 0 (6) We observe that (5) whch s the densty functon of the queue length n a steady-state s a geometrc dstrbuton. We then fnd, Ex ( ) (7) called the mean number of customers. The Pacfc Journal of Scence and Technology 7
3 We also observe that Ex ( ) as, so that n practce f the system s not stable, then the queue wll explode. We also fnd from (5) that: V( x) ( ) (8) Agan, we fnd from (5) that the probablty that the queue exceed say customers n steady-state s Px ( ) (9) We adopt a sngle-channel queung system (m/m/) wth Posson arrvals and exponental servce rate and arrvals are handled on a frst come frst serve bass. In ths queung system, the average arrval rate s less than the average servce rate (.e., < μ ). If < μ, there would be an unendng queue. The followng formulas are developed for ths system. The average number of customers on the queue at any gven tme s: t (0) The average number of customers watng to be served at any tme t s: () The average number of customers n the system s: () The average tme n queue (before servce s rendered) s: μ( ) (3) The average tme n the system (on queue and recevng servce) s: μ( ) RESULTS (4) The arrval tmes as well as the tme servce began and ended for 00 patents n the Unversty of Ado-Ekt, Health Center were observed and recorded between 8.00am and 5.00pm. A total of 4days were used for the data collecton. The watng tmes and servce tmes were obtaned by subtractng arrval tme from the tme servce began for each day. Smlarly, servce tme was found by subtractng tme servce began from when t ended. Therefore: Total watng tmes 945 mnutes Total servce tmes 798 mnutes taken place n 945 mns and servce was rendered n 798 mns. Ths follows the arrval of 00 patents We arrve at the followng;. The arrval rate total of patents total watng tmes The Pacfc Journal of Scence and Technology 7
4 . The servce rate total no of patents 00 μ 0.53 total servce tmes Thus, traffc ntensty μ 4. The average number of patents queue The average number of patents n queue when queue exst The average number of patents n the systems The average tme n queue [before servce s rendered mn utes μ( ) Alternatvely, we calculate t as Average no of patents n the system the servce rate mn utes The average tme of the system (on queue and recevng treatment) mn utes μ( ) 9. Average tme of servce Average tme n the system average tme n queue 8 mnutes 0. The probablty of queueng on arrval Traffc ntensty μ. The probablty of not queung on arrval n. The probablty that there are n patent n the system ( ) patents n the systems Hence, the probablty that there are The Pacfc Journal of Scence and Technology 73
5 n 3. The probablty that there are more than n patents n the system s. Hence, the probablty that there are more than patents n the system s DISCUSSION OF RESULTS The traffc ntensty s the probablty of patents queung on arrval whch clearly ndcates a hgher possblty of patents watng for treatment snce the doctor s busy renderng servce to a patent that has earler arrved. Ths also shows that the servce n the health centre s not 00% effcent. It then follows that there wll always be queue snce result (8) s greater than (7). That s the average tme n the queue system (both on queue recevng servce) s greater than the average tme n queue before servce s rendered. CONCLUSION AND RECOMMENDATION The queue theory s a useful statstcal technque for solvng pecular problems. Its applcatons n the organzaton are ndspensable. The queung problems encountered at the Unversty of Ado- Ekt Health Centre s smlar to what s encountered n older centers as well as other government hosptals across the country. Excessve waste of tme n the hosptals or health centers may lead to patents health complcatons and n some cases eventual death whch may be avoded. n attendng to patents and hence the servce effcency. REFERENCES. Churchman, G.W., R.C. Ackoff, and F.C. Arnoff Introducton to Operaton Research. John Wlley and Sons: New York, NY. pp Ignzo, J.P. 98. Lnear Programmng n Sngle and Multple objectve Systems. Prentce-Hall Eagle Wood Clffs, NJ. 3. Adeleke, R.A., C.E. Adeby, and O. Aknyem. 006l Applcaton of Queueng theory to Omega Bank PLC, Ado- Ekt, Ngera. : Taha, H.A Operaton Research: An Introducton, Fourth Edton. Macmllan Publshng: New York, NY. pp SUGGESTED CITATION Adeleke, R.A., O.D. Ogunwale, and O.Y. Hald Applcaton of Queung Theory to Watng Tme of Out-Patents n Hosptals. Pacfc Journal of Scence and Technology. 0(): Pacfc Journal of Scence and Technology As a result, t s recommended that more doctors should be deployed to these centers so as to convert the sngle-channel queung unts to multchannel queung unts. Ths wll offer servce on arrval. It s also recommended that more health care centers should be created to take care of all categores of patents (students or members of staff) n the unversty communty. Agan, more paramedcal offcers should be deployed to these centers. Ths wll take care of patents prelmnary tests or servce before they see the doctors. Ths wll reduce the servce tme spent by the doctors The Pacfc Journal of Scence and Technology 74
Analysis of Discrete Time Queues (Section 4.6)
Analyss of Dscrete Tme Queues (Secton 4.6) Copyrght 2002, Sanjay K. Bose Tme axs dvded nto slots slot slot boundares Arrvals can only occur at slot boundares Servce to a job can only start at a slot boundary
More informationCS-433: Simulation and Modeling Modeling and Probability Review
CS-433: Smulaton and Modelng Modelng and Probablty Revew Exercse 1. (Probablty of Smple Events) Exercse 1.1 The owner of a camera shop receves a shpment of fve cameras from a camera manufacturer. Unknown
More informationIntroduction to Continuous-Time Markov Chains and Queueing Theory
Introducton to Contnuous-Tme Markov Chans and Queueng Theory From DTMC to CTMC p p 1 p 12 1 2 k-1 k p k-1,k p k-1,k k+1 p 1 p 21 p k,k-1 p k,k-1 DTMC 1. Transtons at dscrete tme steps n=,1,2, 2. Past doesn
More informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
More information6. Stochastic processes (2)
Contents Markov processes Brth-death processes Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 Markov process Consder a contnuous-tme and dscrete-state stochastc process X(t) wth state space
More informationMarkov chains. Definition of a CTMC: [2, page 381] is a continuous time, discrete value random process such that for an infinitesimal
Markov chans M. Veeraraghavan; March 17, 2004 [Tp: Study the MC, QT, and Lttle s law lectures together: CTMC (MC lecture), M/M/1 queue (QT lecture), Lttle s law lecture (when dervng the mean response tme
More information6. Stochastic processes (2)
6. Stochastc processes () Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 6. Stochastc processes () Contents Markov processes Brth-death processes 6. Stochastc processes () Markov process
More informationTCOM 501: Networking Theory & Fundamentals. Lecture 7 February 25, 2003 Prof. Yannis A. Korilis
TCOM 501: Networkng Theory & Fundamentals Lecture 7 February 25, 2003 Prof. Yanns A. Korls 1 7-2 Topcs Open Jackson Networks Network Flows State-Dependent Servce Rates Networks of Transmsson Lnes Klenrock
More informationAssignment 5. Simulation for Logistics. Monti, N.E. Yunita, T.
Assgnment 5 Smulaton for Logstcs Mont, N.E. Yunta, T. November 26, 2007 1. Smulaton Desgn The frst objectve of ths assgnment s to derve a 90% two-sded Confdence Interval (CI) for the average watng tme
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationMeenu Gupta, Man Singh & Deepak Gupta
IJS, Vol., o. 3-4, (July-December 0, pp. 489-497 Serals Publcatons ISS: 097-754X THE STEADY-STATE SOLUTIOS OF ULTIPLE PARALLEL CHAELS I SERIES AD O-SERIAL ULTIPLE PARALLEL CHAELS BOTH WITH BALKIG & REEGIG
More informationEquilibrium Analysis of the M/G/1 Queue
Eulbrum nalyss of the M/G/ Queue Copyrght, Sanay K. ose. Mean nalyss usng Resdual Lfe rguments Secton 3.. nalyss usng an Imbedded Marov Chan pproach Secton 3. 3. Method of Supplementary Varables done later!
More informationCS 798: Homework Assignment 2 (Probability)
0 Sample space Assgned: September 30, 2009 In the IEEE 802 protocol, the congeston wndow (CW) parameter s used as follows: ntally, a termnal wats for a random tme perod (called backoff) chosen n the range
More informationApplied Stochastic Processes
STAT455/855 Fall 23 Appled Stochastc Processes Fnal Exam, Bref Solutons 1. (15 marks) (a) (7 marks) The dstrbuton of Y s gven by ( ) ( ) y 2 1 5 P (Y y) for y 2, 3,... The above follows because each of
More informationNotes prepared by Prof Mrs) M.J. Gholba Class M.Sc Part(I) Information Technology
Inverse transformatons Generaton of random observatons from gven dstrbutons Assume that random numbers,,, are readly avalable, where each tself s a random varable whch s unformly dstrbuted over the range(,).
More informationLecture 16 Statistical Analysis in Biomaterials Research (Part II)
3.051J/0.340J 1 Lecture 16 Statstcal Analyss n Bomaterals Research (Part II) C. F Dstrbuton Allows comparson of varablty of behavor between populatons usng test of hypothess: σ x = σ x amed for Brtsh statstcan
More informationSuggested solutions for the exam in SF2863 Systems Engineering. June 12,
Suggested solutons for the exam n SF2863 Systems Engneerng. June 12, 2012 14.00 19.00 Examner: Per Enqvst, phone: 790 62 98 1. We can thnk of the farm as a Jackson network. The strawberry feld s modelled
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationUncertainty and auto-correlation in. Measurement
Uncertanty and auto-correlaton n arxv:1707.03276v2 [physcs.data-an] 30 Dec 2017 Measurement Markus Schebl Federal Offce of Metrology and Surveyng (BEV), 1160 Venna, Austra E-mal: markus.schebl@bev.gv.at
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationQueuing system theory
Elements of queung system: Queung system theory Every queung system conssts of three elements: An arrval process: s characterzed by the dstrbuton of tme between the arrval of successve customers, the mean
More informationSOLVING CAPACITATED VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS BY GOAL PROGRAMMING APPROACH
Proceedngs of IICMA 2013 Research Topc, pp. xx-xx. SOLVIG CAPACITATED VEHICLE ROUTIG PROBLEMS WITH TIME WIDOWS BY GOAL PROGRAMMIG APPROACH ATMII DHORURI 1, EMIUGROHO RATA SARI 2, AD DWI LESTARI 3 1Department
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationNetwork of Markovian Queues. Lecture
etwork of Markovan Queues etwork of Markovan Queues ETW09 20 etwork queue ed, G E ETW09 20 λ If the frst queue was not empty Then the tme tll the next arrval to the second queue wll be equal to the servce
More informationAnalysis of Queuing Delay in Multimedia Gateway Call Routing
Analyss of Queung Delay n Multmeda ateway Call Routng Qwe Huang UTtarcom Inc, 33 Wood Ave. outh Iseln, NJ 08830, U..A Errol Lloyd Computer Informaton cences Department, Unv. of Delaware, Newark, DE 976,
More informationTAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES
TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES SVANTE JANSON Abstract. We gve explct bounds for the tal probabltes for sums of ndependent geometrc or exponental varables, possbly wth dfferent
More informationOrder Full Rate, Leadtime Variability, and Advance Demand Information in an Assemble- To-Order System
Order Full Rate, Leadtme Varablty, and Advance Demand Informaton n an Assemble- To-Order System by Lu, Song, and Yao (2002) Presented by Png Xu Ths summary presentaton s based on: Lu, Yngdong, and Jng-Sheng
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationDistributions /06. G.Serazzi 05/06 Dimensionamento degli Impianti Informatici distrib - 1
Dstrbutons 8/03/06 /06 G.Serazz 05/06 Dmensonamento degl Impant Informatc dstrb - outlne densty, dstrbuton, moments unform dstrbuton Posson process, eponental dstrbuton Pareto functon densty and dstrbuton
More informationRandom Partitions of Samples
Random Parttons of Samples Klaus Th. Hess Insttut für Mathematsche Stochastk Technsche Unverstät Dresden Abstract In the present paper we construct a decomposton of a sample nto a fnte number of subsamples
More informationSee Book Chapter 11 2 nd Edition (Chapter 10 1 st Edition)
Count Data Models See Book Chapter 11 2 nd Edton (Chapter 10 1 st Edton) Count data consst of non-negatve nteger values Examples: number of drver route changes per week, the number of trp departure changes
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationCHAPTER 6 GOODNESS OF FIT AND CONTINGENCY TABLE PREPARED BY: DR SITI ZANARIAH SATARI & FARAHANIM MISNI
CHAPTER 6 GOODNESS OF FIT AND CONTINGENCY TABLE Expected Outcomes Able to test the goodness of ft for categorcal data. Able to test whether the categorcal data ft to the certan dstrbuton such as Bnomal,
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationProblem Set 9 - Solutions Due: April 27, 2005
Problem Set - Solutons Due: Aprl 27, 2005. (a) Frst note that spam messages, nvtatons and other e-mal are all ndependent Posson processes, at rates pλ, qλ, and ( p q)λ. The event of the tme T at whch you
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
More informationA Multi-Stage Queue Approach to Solving Customer Congestion Problem in a Restaurant
Open Journal of Statstcs, 08, 8, 30-36 http://www.scrp.org/ournal/os ISSN Onlne: 6-798 ISSN Prnt: 6-78X A Mult-Stage Queue Approach to Solvng Customer Congeston Problem n a Restaurant Adegoe S. Aboye,
More informationA Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach
A Bayes Algorthm for the Multtask Pattern Recognton Problem Drect Approach Edward Puchala Wroclaw Unversty of Technology, Char of Systems and Computer etworks, Wybrzeze Wyspanskego 7, 50-370 Wroclaw, Poland
More informationANSWERS CHAPTER 9. TIO 9.2: If the values are the same, the difference is 0, therefore the null hypothesis cannot be rejected.
ANSWERS CHAPTER 9 THINK IT OVER thnk t over TIO 9.: χ 2 k = ( f e ) = 0 e Breakng the equaton down: the test statstc for the ch-squared dstrbuton s equal to the sum over all categores of the expected frequency
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationExercises of Chapter 2
Exercses of Chapter Chuang-Cheh Ln Department of Computer Scence and Informaton Engneerng, Natonal Chung Cheng Unversty, Mng-Hsung, Chay 61, Tawan. Exercse.6. Suppose that we ndependently roll two standard
More informationTransient results for M/M/1/c queues via path counting. M. Hlynka*, L.M. Hurajt and M. Cylwa
Int. J. Mathematcs n Operatonal Research, Vol. X, No. X, xxxx 1 Transent results for M/M/1/c queues va path countng M. Hlynka*, L.M. Hurajt and M. Cylwa Department of Mathematcs and Statstcs, Unversty
More informationComparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method
Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationChapter 9: Statistical Inference and the Relationship between Two Variables
Chapter 9: Statstcal Inference and the Relatonshp between Two Varables Key Words The Regresson Model The Sample Regresson Equaton The Pearson Correlaton Coeffcent Learnng Outcomes After studyng ths chapter,
More informationEstimation: Part 2. Chapter GREG estimation
Chapter 9 Estmaton: Part 2 9. GREG estmaton In Chapter 8, we have seen that the regresson estmator s an effcent estmator when there s a lnear relatonshp between y and x. In ths chapter, we generalzed the
More informationNon-Mixture Cure Model for Interval Censored Data: Simulation Study ABSTRACT
Malaysan Journal of Mathematcal Scences 8(S): 37-44 (2014) Specal Issue: Internatonal Conference on Mathematcal Scences and Statstcs 2013 (ICMSS2013) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES Journal
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationOn the Throughput of Clustered Photolithography Tools:
On the hroughput of lustered Photolthography ools: Wafer Advancement and Intrnsc Equpment Loss Maruth Kumar Mutnur James R. Morrson, Ph.D. September 23, 2007 Presentaton Outlne Motvaton Model : Synchronous
More informationComputing MLE Bias Empirically
Computng MLE Bas Emprcally Kar Wa Lm Australan atonal Unversty January 3, 27 Abstract Ths note studes the bas arses from the MLE estmate of the rate parameter and the mean parameter of an exponental dstrbuton.
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationLecture 10: May 6, 2013
TTIC/CMSC 31150 Mathematcal Toolkt Sprng 013 Madhur Tulsan Lecture 10: May 6, 013 Scrbe: Wenje Luo In today s lecture, we manly talked about random walk on graphs and ntroduce the concept of graph expander,
More informationChapter 13: Multiple Regression
Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
More informationALGORITHM FOR THE CALCULATION OF THE TWO VARIABLES CUBIC SPLINE FUNCTION
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I. CUZA DIN IAŞI (S.N.) MATEMATICĂ, Tomul LIX, 013, f.1 DOI: 10.478/v10157-01-00-y ALGORITHM FOR THE CALCULATION OF THE TWO VARIABLES CUBIC SPLINE FUNCTION BY ION
More information4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA
4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected
More informationTraffic Signal Timing: Basic Principles. Development of a Traffic Signal Phasing and Timing Plan. Two Phase and Three Phase Signal Operation
Traffc Sgnal Tmng: Basc Prncples 2 types of sgnals Pre-tmed Traffc actuated Objectves of sgnal tmng Reduce average delay of all vehcles Reduce probablty of accdents by mnmzng possble conflct ponts Objectves
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationA LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS. Dr. Derald E. Wentzien, Wesley College, (302) ,
A LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS Dr. Derald E. Wentzen, Wesley College, (302) 736-2574, wentzde@wesley.edu ABSTRACT A lnear programmng model s developed and used to compare
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationUncertain Models for Bed Allocation
www.ccsenet.org/ghs Global Journal of Health Scence Vol., No. ; October 00 Uncertan Models for Bed Allocaton Lng Gao (Correspondng author) College of Scence, Guln Unversty of Technology Box 733, Guln 54004,
More informationColor Rendering Uncertainty
Australan Journal of Basc and Appled Scences 4(10): 4601-4608 010 ISSN 1991-8178 Color Renderng Uncertanty 1 A.el Bally M.M. El-Ganany 3 A. Al-amel 1 Physcs Department Photometry department- NIS Abstract:
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have
More informationEconomics 130. Lecture 4 Simple Linear Regression Continued
Economcs 130 Lecture 4 Contnued Readngs for Week 4 Text, Chapter and 3. We contnue wth addressng our second ssue + add n how we evaluate these relatonshps: Where do we get data to do ths analyss? How do
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More informationMaximizing Overlap of Large Primary Sampling Units in Repeated Sampling: A comparison of Ernst s Method with Ohlsson s Method
Maxmzng Overlap of Large Prmary Samplng Unts n Repeated Samplng: A comparson of Ernst s Method wth Ohlsson s Method Red Rottach and Padrac Murphy 1 U.S. Census Bureau 4600 Slver Hll Road, Washngton DC
More informationMarket structure and Innovation
Market structure and Innovaton Ths presentaton s based on the paper Market structure and Innovaton authored by Glenn C. Loury, publshed n The Quarterly Journal of Economcs, Vol. 93, No.3 ( Aug 1979) I.
More informationTHE SUMMATION NOTATION Ʃ
Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the
More informationNegative Binomial Regression
STATGRAPHICS Rev. 9/16/2013 Negatve Bnomal Regresson Summary... 1 Data Input... 3 Statstcal Model... 3 Analyss Summary... 4 Analyss Optons... 7 Plot of Ftted Model... 8 Observed Versus Predcted... 10 Predctons...
More informationMATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)
1/16 MATH 829: Introducton to Data Mnng and Analyss The EM algorthm (part 2) Domnque Gullot Departments of Mathematcal Scences Unversty of Delaware Aprl 20, 2016 Recall 2/16 We are gven ndependent observatons
More informationModelli Clamfim Equazione del Calore Lezione ottobre 2014
CLAMFIM Bologna Modell 1 @ Clamfm Equazone del Calore Lezone 17 15 ottobre 2014 professor Danele Rtell danele.rtell@unbo.t 1/24? Convoluton The convoluton of two functons g(t) and f(t) s the functon (g
More informationLecture 4: November 17, Part 1 Single Buffer Management
Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input
More informationCase Study of Markov Chains Ray-Knight Compactification
Internatonal Journal of Contemporary Mathematcal Scences Vol. 9, 24, no. 6, 753-76 HIKAI Ltd, www.m-har.com http://dx.do.org/.2988/cms.24.46 Case Study of Marov Chans ay-knght Compactfcaton HaXa Du and
More informationAdvanced Topics in Optimization. Piecewise Linear Approximation of a Nonlinear Function
Advanced Tocs n Otmzaton Pecewse Lnear Aroxmaton of a Nonlnear Functon Otmzaton Methods: M8L Introducton and Objectves Introducton There exsts no general algorthm for nonlnear rogrammng due to ts rregular
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
More informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple
More informationFUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM
Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL
More informationMAKING A DECISION WHEN DEALING WITH UNCERTAIN CONDITIONS
Luca Căbulea, Mhaela Aldea-Makng a decson when dealng wth uncertan condtons MAKING A DECISION WHEN DEALING WITH UNCERTAIN CONDITIONS. Introducton by Luca Cabulea and Mhaela Aldea The decson theory offers
More informationDeparture Process from a M/M/m/ Queue
Dearture rocess fro a M/M// Queue Q - (-) Q Q3 Q4 (-) Knowledge of the nature of the dearture rocess fro a queue would be useful as we can then use t to analyze sle cases of queueng networs as shown. The
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationPERFORMANCE OF MULTICLASS MARKOVIAN QUEUEING NETWORKS VIA PIECEWISE LINEAR LYAPUNOV FUNCTIONS 1
The Annals of Appled Probablty 2001, Vol. 11, No. 4, 1384 1428 PERFORMANCE OF MULTICLASS MARKOVIAN QUEUEING NETWORKS VIA PIECEWISE LINEAR LYAPUNOV FUNCTIONS 1 By Dmtrs Bertsmas, Davd Gamarnk and John N.
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationUNIVERSITY OF TORONTO Faculty of Arts and Science. December 2005 Examinations STA437H1F/STA1005HF. Duration - 3 hours
UNIVERSITY OF TORONTO Faculty of Arts and Scence December 005 Examnatons STA47HF/STA005HF Duraton - hours AIDS ALLOWED: (to be suppled by the student) Non-programmable calculator One handwrtten 8.5'' x
More informationChat eld, C. and A.J.Collins, Introduction to multivariate analysis. Chapman & Hall, 1980
MT07: Multvarate Statstcal Methods Mke Tso: emal mke.tso@manchester.ac.uk Webpage for notes: http://www.maths.manchester.ac.uk/~mkt/new_teachng.htm. Introducton to multvarate data. Books Chat eld, C. and
More informationLectures on Stochastic Stability. Sergey FOSS. Heriot-Watt University. Lecture 5. Monotonicity and Saturation Rule
Lectures on Stochastc Stablty Sergey FOSS Herot-Watt Unversty Lecture 5 Monotoncty and Saturaton Rule Introducton The paper of Loynes [8] was the frst to consder a system (sngle server queue, and, later,
More informationExample: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationPROBABILITY PRIMER. Exercise Solutions
PROBABILITY PRIMER Exercse Solutons 1 Probablty Prmer, Exercse Solutons, Prncples of Econometrcs, e EXERCISE P.1 (b) X s a random varable because attendance s not known pror to the outdoor concert. Before
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationAS-Level Maths: Statistics 1 for Edexcel
1 of 6 AS-Level Maths: Statstcs 1 for Edecel S1. Calculatng means and standard devatons Ths con ndcates the slde contans actvtes created n Flash. These actvtes are not edtable. For more detaled nstructons,
More information