1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)

Size: px
Start display at page:

Download "1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)"

Transcription

1 6.3 / -- Communcaton Networks II (Görg) SS Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes (SP & MP) 4. Fnte State Markovan Processes 5. Analyss of Markovan servce systems 6. Queues for modelng of communcaton networks 7. M/G/ model 8. The model M/G//FCFS/NONPRE 9. The model M/G//FCFS/PRE

2 6.3 / 2 -- Communcaton Networks II (Görg) SS BCMP networks Baskett, Chandy, Muntz and Palacos extended n 975 the class of networks, for whch product form soluton s vald, to nclude also the networks wth: any fnte number of statons N any fnte number of user classes R arbtrary servce tme dstrbutons p, customers changng ther class wth probablty, r; j s p, r ; j, s : probablty, that a class r job after recevng ts servce at staton changes to class s and requres servce at staton j n open networks p 0; j, s denotes the arrval probablty (from outsde) to staton j, class s and p rn,; denotes the departure probablty from staton, class r.

3 6.3 / 3 -- Communcaton Networks II (Görg) SS The matrx P p r,;, js of the transton probabltes defnes a Markov chan wth states, that s determned through the par (,r). It s possble to map ths chan nto m ergodc (=rreducble) sub-chans E, E 2, K, E m, where 2 states t of a job bbelong to the same chan, only f the job can take both states wth a probablty >0. k r s the number of class r jobs n staton at network state S (see below). The number of jobs n each of the ergodc sub chans n the state S s gven by (6.3.34) 34) j r,2, K, K S E k j m r, E j ths quantty K S E j s always a constant tn closed networks. The total t number of jobs n the network at the state S can be calculated usng m K S E j K S j (6.3.35) 35) In open networks two dfferent generally state dependent arrval processes are assumed:

4 6.3 / 4 -- Communcaton Networks II (Görg) SS a) Jobs enter the network accordng to a non-homogeneous Posson process, whose arrval rate KS depends on all the combnatons of the system states correspondng to the total number of jobs n the system. A newly arrvng job enters the staton n class r wth fxed probablty, p 0;, r where t holds N R (6.3.36) p0 ;, r r b) Correspondng to the m transton sub-chans, the jobs enter the network over j ndependent non-homogeneous Posson processes wth the mean arrval rate K S E j, that depends on the network status that agan depends on the jobs already n the chan. An ncomng job of the j-th stream enters staton wth constant probablty p 0; r, where t holds: p (6.3.37) 0;, r j 2,, K, m r, E j,, K, S The network status S s defned through the vector S S S S, where 2 S N summarzes the condton, that s present at staton. These condtons are defned through the type of the staton.

5 6.3 / 5 -- Communcaton Networks II (Görg) SS Staton types Type : M/M/n - FCFS: Such statons contan n servers workng under the strategy FCFS. All the classes of jobs have the same servce tme dstrbuton. In addton, the mean servce tme of all the classes are equal. Type 2: M/G/ - PS: Such statons contan a sngle server, workng under the strategy processor sharng,.e. all the new ncomng jobs are served at the rate /k sec. Jobs belongng to dfferent classes are allowed to have dfferent and arbtrary servce tme dstrbutons. Type 3: M/G/ - no watng: Such statons have a free server (nfnte server) avalable for each of the new comng jobs, so that they never have to wat. The servce tme dstrbuton can be arbtrary and specfc to the class. Type 4: M/G/ - LCFS-PRE: Here the only avalable server works under the preemptve LCFS-strategy. The servce tme dstrbuton can be arbtrary and specfc to the class.

6 6.3 / 6 -- Communcaton Networks II (Görg) SS G-servce tme dstrbuton b For staton types 2, 3, 4, t s desrable for the servce tme to have a general (=G) servce tme dstrbuton b t wth a ratonal Laplace Transform. Snce Cox (955) t s known, that any dstrbuton wth a ratonal Laplace Transform can be reconstructed through a network of exponental phases. (compare secton 552).5.5.2). Fgure 6.6: 6: Phase model for G-dstrbuton The Laplace transform of the probablty densty of a random varable that conssts of phases s gven by,

7 6.3 / 7 -- Communcaton Networks II (Görg) SS n j 0 2 j j j l s aaa K a b l s l the ndces,r are omtted here for the sake of smplcty. It means: rl servce rate of M dstrbuton at the l-th step, l 2,, K, n for class r r n staton n r total number of exponental steps for class r n staton a rl probablty for job also gong through the (l+)-th step b probablty blt for completng the job after step l b rl Soluton for closed network problem In order to get the soluton for the statonary state probablty P(S), t s necessary to solve the followng system of equlbrum equatons, see equaton (4.3): S ' S P S' transton rate from S' to S P S transton rate out of S (6.3.4)

8 6.3 / 8 -- Communcaton Networks II (Görg) SS In addton, the condton of total probablty holds P S. For each transt (=routng) sub chan, the followng system of equatons hold for the unknowns : e r er p0; r ejs pjs; r (, r) E, e r js E k k S (6.3.42) where s nterpreted to be the relatve arrval rate of jobs n class r at staton. These equatons correspond to flow equatons n Jackson networks. When the sub chan E k s closed, then p 0 ;, r 0 for all, r E k and the number of jobs s constant. E k Theorem of BCMP For open, closed or partally closed networks, n whch each staton s of types to 4, the dstrbuton of the statonary state probabltes take the product form gven below, when they satsfy the system of equatons descrbed above:, 2, K, PS S S S GK ds F S N N (6.3.43)

9 6.3 / 9 -- Communcaton Networks II (Görg) SS where G(K) s the normalzaton constant, so that all the probabltes sum up to. N G( K) d( S) F ( S ), wth K K, K2, L, K R, K j s the total number N S K of jobs n class j n the network, j 2,, L, R. d(s) s a functon of the number of jobs n the network, and t s gven by: d S K S at arrval process a) 0 m K S E j at arrval process b) j =0 at closed network * : holds for open networks * * (6.3.44) F ( S)s a functon, that depends on type and state of the staton. The explct presentaton of the functons F ( S) not gven here, as ths product form soluton contans more detaled nformaton than often requred, e.g. the sequence of job classes n the queue of each staton. It also contans

10 6.3 / 0 -- Communcaton Networks II (Görg) SS more nformaton than meanngful, e.g. the probablty for crossng of each phase of the Cox-model. The two smplfed versons shown below, descrbe only the boundary dstrbutons, that result once the states that are not nterestng es are added together. e These smplfcatons s make t easy to calculate especally the normalzaton constant G(K) and allows to make nterestng conclusons. BCMP - erson We defne a summarzed state for a closed BCMP network, namely the number of jobs n each class at each staton: S ( S, S2,... S N ) wth S k, k, K, k 2 R (6.3.46) (6.3.47) where the number of jobs n class r n staton s denoted by k r. Under these condtons the statonary state probablty dstrbuton s gven by:

11 6.3 / -- Communcaton Networks II (Görg) SS P S d S g S G K where t holds: N wth GK g S N ( ) ( ) N S K g S k R k r k! e Type r r b ( k ) k r! k r R e r k! Type 2, 4 r k r! r k r R e r Type 3 r k! r r R (6.3.49) wth b( k) obtaned from the equaton (6.2.28). k kr gves here the r total number of jobs belongng to all the classes n staton. The vstng frequences e r s determned from equaton (6.3.42) wth p 0, r 0. We can see, that P(S) depends only on the expected values of the servce tme dstrbuton. b t

12 6.3 / 2 -- Communcaton Networks II (Görg) SS BCMP erson 2 We consder an open BCMP network wth the lmtaton, that the parameters of the arrval process and the servce rate of the statons reman constant, that s ndependent of the queue length. S k, k 2, K, k N s the network state, where s the total number of jobs belongng to any class at staton. The statonary dstrbuton of state probabltes s now k pk PS N (6.3.50) wth p ( k ) k ( ) Typ, 2, und 4 ( n ) k e Typ 3 k! (6.3.5)

13 6.3 / 3 -- Communcaton Networks II (Görg) SS and s the load at the staton wth R r r (6.3.52) r L r er r er r r r Typ ( n ) Typ 2, 3, 4 ;! (6.3.52a) Statons of types, 2 and 4 behave as N ndependent M/M/ models. Type 3 as an M/G/ model. For type statons wth more than one server n, equatons (6..6) and (6..9) can be used to calculate the probabltes p( k).

14 6.3 / 4 -- Communcaton Networks II (Görg) SS Results From the statonary state probabltes we can determne the followng performance measures as expected values: Load at ndvdual statons Throughput at each staton, for each of the job classes mean queue length L for each class and staton t L Q mean watng and system tme for each class and staton The models can be very complcated n these cases. In order to obtan numercal values for the statonary state probabltes, frst G(K) must be calculated. Ths needs complcated calculatons, because the total state space should be taken nto consderaton. In the lterature there are correspondng proposals, that dffer n algorthm and thus also n the volume of mathematcal operatons. However, such algorthms are not handled here.

15 6.3 / 5 -- Communcaton Networks II (Görg) SS For the calculaton of the throughput, system load and the mean system tme we also need the normalzaton constants for dfferent numbers of jobs n the network, n addton to,, K, G K G K K2 K R a) Throughput In a closed network wth K r class r jobs r, K,, r e r GK, K, K R GK K K K. R s the throughput of class r jobs at staton. The soluton of the system of equatons for the chans s here denoted by e r. If the chan s open, the results from the Jackson network contnues to hold. (6.3.53) For state ndependent,.e. constant servce rates of all 4 types, t holds: r r (6.3.55) r wth r beng the throughput as shown above. For statons consstng of n > dentcal servers wth constant servce rates, the followng holds

16 6.3 / 6 -- Communcaton Networks II (Görg) SS r r n r (6.3.56) r where s determned d from the above equaton for statons t of type 2. For statons of type or type 4 t s necessary to go through the relatonshp for. b) Mean system tme, watng tme and queue length r The mean system tme for class r jobs n staton s the mean tme span from the arrval of job to staton to ts completon at the same staton. r s the throughput of class r jobs at staton and L r s the mean number of class r jobs at staton. From Lttle s law, we get: r Lr r (6.3.57) If staton s of type 3 and has a server for each of the class r jobs, then the jobs don t have to wat there. Then /. From equaton ( ) follows: L r r r r r

17 6.4 / 7 -- Communcaton Networks II (Görg) SS r L r G K, K, K G K, K, K, K, K e R r R r (6.3.58) Thus the mean watng tme works out to: W r r r (6.3.59) From ths, usng Lttle s law, we get the mean number n system to be: L W Q r r r 6.4 Mean value analyss Applcable for the models, that have product form solutons, especally ll for the closed networks wth many chans h and djb jobs Calculaton of normalzaton constants become redundant Calculaton of product terms s not requred

18 6.4 / 8 -- Communcaton Networks II (Görg) SS As the product terms are not calculated, followng changes n comparson to the earler methods become evdent: State probabltes bl and the mean values can be obtaned. Dsadvantage: large memory requrements compared to product form soluton usng sutable algorthms. All ntermedate t results need to be smultaneously present n determnaton of the fnal results. Applcable also for non-product form networks. The results are accurate only asymptotcally, are usually good n closed networks. Smplfcaton: recursve soluton s replaced by an teratve soluton Smplfcaton: recursve soluton s replaced by an teratve soluton. Ths leads to a smple calculaton and to good results after a relatvely small number of teratons.

19 6.4 / 9 -- Communcaton Networks II (Görg) SS Ths recursve technque s llustrated here for the smple case of a sngle server (no parallel servers) per staton. Three equatons buld the base for ths: k L k k (6.4.60) k k k N (6.4.6) L k k k (6.4.62) The second equaton s obtaned by applyng Lttle s law n general ( L ) and the thrd equaton s also from Lttle, as appled to the -th staton.

20 6.4 / Communcaton Networks II (Görg) SS Further: k k k number of avalable jobs n network, k=,2,...,k mean sojourn tme (response tme) n staton for k jobs n network. Servce rate of staton as a functon of the number of jobs L L k mean number of jobs n staton, =,2,...,N mean number of jobs n staton for the case, that there s one job less n the network k throughput accordng to Lttle for k crculatng jobs N k total system tme for statons, that are n a sngle chan, n case of k jobs n network From these three equatons, we can buld the recursve algorthm for calculaton of. We always start wth. k, k und L k L 0 0 We frst begn for k= and proceed one by one up to k=k.

21 6.4 / 2 -- Communcaton Networks II (Görg) SS Example 64: 6.4.: The followng cyclc network s gven wth 2s, 2 3s and K=3. Fgure 6.7: Cyclc queung network. Iteraton. k= L L L () () L

22 6.4 / Communcaton Networks II (Görg) SS Iteraton 2. k=2 2 L L ( 2) ( 2) L L Iteraton 3. k= L L ( 3 ) ( 3 ) L L

23 6.4 / Communcaton Networks II (Görg) SS Applcaton for more general networks The recursve method presented above can be appled to more general networks through some modfcatons to the three basc equatons. Then the followng equatons become vald: k L k type, 2, 4 type 3 ( n ) (6.4.63) e N e p j j j (6.4.64) k Gk ( ) k k N G ( k ) ( k) L k k k (6.4.65) (6.4.65a) (6.4.66) In addton to the already ntroduced quanttes followng quanttes are also needed: e total servce tme at staton

24 6.4 / Communcaton Networks II (Görg) SS e mean number of vsts made by a job to staton between two consecutve vsts to any other staton * These three equatons, along wth the same set of ntal assumptons L ( 0) 0, G( 0) allow recursve calculatons l for any network. After completon of the teraton, we get the normalzng constant G(K), that, makes the calculaton of state probabltes possble usng equaton (6.2.29) Pk ( ) GK ( ) N k. Now let us take R dfferent closed streams (Routng chans) n place of one. However, there s the lmtaton, that the jobs cannot change ther class wthn the chan. That means, jobs n a chan always have at staton the same servce tme dstrbuton (wthout loosng the generalty!). After completon of chan ndces r, we get the recursve equatons n the followng form (r=,2,...,r): r r ( k ) r L k br for statons of type, 2, 4 ( n= ) r for statons of type 3 k r r Q( r) ( k) N k r r ( k) (6.4.67) (6.4.68)

25 6.4 / Communcaton Networks II (Görg) SS L k ( k) ( k) r r r L ( k ) = L ( k) L ( k) rr() r R r r (6.4.69) (6.4.70) It also holds r k mean system tme of a job n chan r at staton between two consecutve vsts of an arbtrarly selected staton * L ( k b ) r mean number of jobs n staton wth one job less n chan r L L r ( k ) ( k ) mean number of jobs n chan r n staton wth populaton k n network mean number of jobs n staton wth populaton k n network r e r r total servce tme of a job n chan r at staton e N e p j, compare e, relatve arrval rate of jobs n chan r at r jr jr r

26 6.4 / Communcaton Networks II (Görg) SS k b k, k,, k,, k r 2 r R e r staton, can be obtaned from ths equaton apart from a proportonalty constant; no change of classes! K K populatons vector from network wth one job less n chan r r k Q(r) R() r =,2,...,R throughput n chan r wth populaton k n network set of statons vsted by chan r set of chans that vst staton countng ndex for chans

27 6.4 / Communcaton Networks II (Görg) SS Example A closed network wth N = 4 statons and R = 2 classes. Jobs are not allowed to change ther classes. Fgure 6.8: Closed network of queues.

28 6.4 / Communcaton Networks II (Görg) SS staton type 2 M/G/-PS 4 M/G/-LCFS-PRE 4 M/G/-LCFS-PRE 3 M/G/-no watng r r r= r= N, From the system of equatons er e p (mean number of vsts of a j jr jr r class r job to the -th staton) we determne:

29 6.4 / Communcaton Networks II (Görg) SS Class : Class 2: e e p e p e p 2 2; 3 3; 4 4; e2 e2 p2;2 e22 p22;2 e32 p32;2 e42 p42;2 e e p 2 ; e e p ; e e p 3 ; e e p ; e4 e p ; e e p. Iteraton k, k2 0 Class : Mean system tme e r,0 wth r r,0 k0,0,0 2 k 20,0,0 3 k 30,0, ; wth k ,0 0

30 6.4 / Communcaton Networks II (Görg) SS Throughput: Mean number of jobs: 0, r L L L L 0, , , 0, 0, 022., 0, 0, Iteraton 2 k 0, k Class 2: Mean system tme , 2 0, , , 4. 8

31 6.4 / 3 -- Communcaton Networks II (Görg) SS Throughput: 2 Mean number of jobs: L L L L 0, , , r 0, 0, 0, , 0, 0, Iteraton 3 k ; k 2 ;, (wg.typ 3- Staton) 24. ;, L 0, 695. ;, L 0, , L 0, 87. ;, L 0, , L 0, 4. 03;, L 0, , (wg.typ 3- Staton) ,, ; 2,,

32 6.4 / Communcaton Networks II (Görg) SS L L,,, ; L,,, L,,, ; L,,, L,,, ; L,,, L Iteraton 4 k 2 ; k 0,, ;,,, , 0 L, ; 2, 0 L, , L 0, 448. ; 20, , 4 20, L 20, 20, 20, ; L 20, 20, 20, L 20, 20, 20, 09. ; L 20, 20, 20, Iteraton 5 k 0, k , L 0, ; 02, L 0, , 2 L 0, ; 0,

33 6.4 / Communcaton Networks II (Görg) SS , , 05.,,, ;,,, L 02, 02, 02, ; L 02, 02, 02, L 02, 02, 02, ; L 02, 02, 02, Iteraton 6 k, k 2; 2 2 (, ) 2 2 (, ) = L 2 ( 02, ) =,353; 2 2 = 2 L (,) L 2 (,) = 2,577 (, ) 3 2 = L ( 02, ) = 2,65; 22 2 = 22 L 2(,) L 22 (,) =2, (, ) (, ) = L ( 02, ) = 5,07; 32 2 = L (,) L (,) = 5, (, ) (, 2) = = 2,4; 42 (, 2) = 42 = 4,8 4 (, 2 ) 2 = 4 = 0,094; 094; = = 03 0,3 2 (, ) 2 (, 2) 4 2(,2)

34 6.4 / Communcaton Networks II (Görg) SS L (,) 2 L 2 (, 2 ) L 3 (,) 2 3 =,2) (,2) = 0,237; L 2 (,) 2 = = 2 2 0,34 ( (,2) ( 2 (,2) (,) 2 (,) 2 2(,2) 22 (,2) = = 09 0,979; 9 L 22 (,) 2 = =0, = ( 2, ) 3 ( 2, ) = 0,4588; L 32 ( 2, ) = 2 ( 2, ) 32 ( 2, ) = 0,68 L 4 (,) 2 (,) 2 (,) 2 = (,) 2 4 (,) 2 = 0,29; L 42 (,) 2 = 2 42 = 0,62 0,9994 And so on, tll the requred number of jobs for each chan s reached. Ths procedure s applcable only for cases wth a lmted number of chans and jobs per chan. Otherwse, the memory requrement and the calculaton R effort become too heavy. Both these are of the order k r r. The calculaton effort s as same as that s requred n soluton of the product form expresson wth applcaton of effcent algorthms. Here, we have no accuracy problems, n contrast t to the other case. 2

35 6.4 / Communcaton Networks II (Görg) SS

Recurrence. 1 Definitions and main statements

Recurrence. 1 Definitions and main statements Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.

More information

What is Candidate Sampling

What is Candidate Sampling What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

More information

Calculation of Sampling Weights

Calculation of Sampling Weights Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample

More information

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

More information

An Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems

An Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems STAN-CS-73-355 I SU-SE-73-013 An Analyss of Central Processor Schedulng n Multprogrammed Computer Systems (Dgest Edton) by Thomas G. Prce October 1972 Techncal Report No. 57 Reproducton n whole or n part

More information

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ). REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

More information

Efficient Project Portfolio as a tool for Enterprise Risk Management

Efficient Project Portfolio as a tool for Enterprise Risk Management Effcent Proect Portfolo as a tool for Enterprse Rsk Management Valentn O. Nkonov Ural State Techncal Unversty Growth Traectory Consultng Company January 5, 27 Effcent Proect Portfolo as a tool for Enterprse

More information

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by 6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng

More information

Basic Queueing Theory M/M/* Queues. Introduction

Basic Queueing Theory M/M/* Queues. Introduction Basc Queueng Theory M/M/* Queues These sldes are created by Dr. Yh Huang of George Mason Unversty. Students regstered n Dr. Huang's courses at GMU can ake a sngle achne-readable copy and prnt a sngle copy

More information

Analysis of Energy-Conserving Access Protocols for Wireless Identification Networks

Analysis of Energy-Conserving Access Protocols for Wireless Identification Networks From the Proceedngs of Internatonal Conference on Telecommuncaton Systems (ITC-97), March 2-23, 1997. 1 Analyss of Energy-Conservng Access Protocols for Wreless Identfcaton etworks Imrch Chlamtac a, Chara

More information

Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits

Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.

More information

The OC Curve of Attribute Acceptance Plans

The OC Curve of Attribute Acceptance Plans The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4

More information

Loop Parallelization

Loop Parallelization - - Loop Parallelzaton C-52 Complaton steps: nested loops operatng on arrays, sequentell executon of teraton space DECLARE B[..,..+] FOR I :=.. FOR J :=.. I B[I,J] := B[I-,J]+B[I-,J-] ED FOR ED FOR analyze

More information

How Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence

How Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence 1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh

More information

This paper concerns the evaluation and analysis of order

This paper concerns the evaluation and analysis of order ORDER-FULFILLMENT PERFORMANCE MEASURES IN AN ASSEMBLE- TO-ORDER SYSTEM WITH STOCHASTIC LEADTIMES JING-SHENG SONG Unversty of Calforna, Irvne, Calforna SUSAN H. XU Penn State Unversty, Unversty Park, Pennsylvana

More information

CALL ADMISSION CONTROL IN WIRELESS MULTIMEDIA NETWORKS

CALL ADMISSION CONTROL IN WIRELESS MULTIMEDIA NETWORKS CALL ADMISSION CONTROL IN WIRELESS MULTIMEDIA NETWORKS Novella Bartoln 1, Imrch Chlamtac 2 1 Dpartmento d Informatca, Unverstà d Roma La Sapenza, Roma, Italy novella@ds.unroma1.t 2 Center for Advanced

More information

PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12

PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12 14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed

More information

How To Calculate The Accountng Perod Of Nequalty

How To Calculate The Accountng Perod Of Nequalty Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.

More information

PERRON FROBENIUS THEOREM

PERRON FROBENIUS THEOREM PERRON FROBENIUS THEOREM R. CLARK ROBINSON Defnton. A n n matrx M wth real entres m, s called a stochastc matrx provded () all the entres m satsfy 0 m, () each of the columns sum to one, m = for all, ()

More information

On the Optimal Control of a Cascade of Hydro-Electric Power Stations

On the Optimal Control of a Cascade of Hydro-Electric Power Stations On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;

More information

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.

More information

Product-Form Stationary Distributions for Deficiency Zero Chemical Reaction Networks

Product-Form Stationary Distributions for Deficiency Zero Chemical Reaction Networks Bulletn of Mathematcal Bology (21 DOI 1.17/s11538-1-9517-4 ORIGINAL ARTICLE Product-Form Statonary Dstrbutons for Defcency Zero Chemcal Reacton Networks Davd F. Anderson, Gheorghe Cracun, Thomas G. Kurtz

More information

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Luby s Alg. for Maximal Independent Sets using Pairwise Independence Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

More information

v a 1 b 1 i, a 2 b 2 i,..., a n b n i.

v a 1 b 1 i, a 2 b 2 i,..., a n b n i. SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are

More information

THE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek

THE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo

More information

Risk Model of Long-Term Production Scheduling in Open Pit Gold Mining

Risk Model of Long-Term Production Scheduling in Open Pit Gold Mining Rsk Model of Long-Term Producton Schedulng n Open Pt Gold Mnng R Halatchev 1 and P Lever 2 ABSTRACT Open pt gold mnng s an mportant sector of the Australan mnng ndustry. It uses large amounts of nvestments,

More information

+ + + - - This circuit than can be reduced to a planar circuit

+ + + - - This circuit than can be reduced to a planar circuit MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to

More information

Activity Scheduling for Cost-Time Investment Optimization in Project Management

Activity Scheduling for Cost-Time Investment Optimization in Project Management PROJECT MANAGEMENT 4 th Internatonal Conference on Industral Engneerng and Industral Management XIV Congreso de Ingenería de Organzacón Donosta- San Sebastán, September 8 th -10 th 010 Actvty Schedulng

More information

How To Understand The Results Of The German Meris Cloud And Water Vapour Product

How To Understand The Results Of The German Meris Cloud And Water Vapour Product Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller

More information

Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts

Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)

More information

Brigid Mullany, Ph.D University of North Carolina, Charlotte

Brigid Mullany, Ph.D University of North Carolina, Charlotte Evaluaton And Comparson Of The Dfferent Standards Used To Defne The Postonal Accuracy And Repeatablty Of Numercally Controlled Machnng Center Axes Brgd Mullany, Ph.D Unversty of North Carolna, Charlotte

More information

1 Example 1: Axis-aligned rectangles

1 Example 1: Axis-aligned rectangles COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton

More information

MAC Layer Service Time Distribution of a Fixed Priority Real Time Scheduler over 802.11

MAC Layer Service Time Distribution of a Fixed Priority Real Time Scheduler over 802.11 Internatonal Journal of Software Engneerng and Its Applcatons Vol., No., Aprl, 008 MAC Layer Servce Tme Dstrbuton of a Fxed Prorty Real Tme Scheduler over 80. Inès El Korb Ecole Natonale des Scences de

More information

An Alternative Way to Measure Private Equity Performance

An Alternative Way to Measure Private Equity Performance An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate

More information

Traffic-light a stress test for life insurance provisions

Traffic-light a stress test for life insurance provisions MEMORANDUM Date 006-09-7 Authors Bengt von Bahr, Göran Ronge Traffc-lght a stress test for lfe nsurance provsons Fnansnspetonen P.O. Box 6750 SE-113 85 Stocholm [Sveavägen 167] Tel +46 8 787 80 00 Fax

More information

A Performance Analysis of View Maintenance Techniques for Data Warehouses

A Performance Analysis of View Maintenance Techniques for Data Warehouses A Performance Analyss of Vew Mantenance Technques for Data Warehouses Xng Wang Dell Computer Corporaton Round Roc, Texas Le Gruenwald The nversty of Olahoma School of Computer Scence orman, OK 739 Guangtao

More information

Stochastic epidemic models revisited: Analysis of some continuous performance measures

Stochastic epidemic models revisited: Analysis of some continuous performance measures Stochastc epdemc models revsted: Analyss of some contnuous performance measures J.R. Artalejo Faculty of Mathematcs, Complutense Unversty of Madrd, 28040 Madrd, Span A. Economou Department of Mathematcs,

More information

SUPPLIER FINANCING AND STOCK MANAGEMENT. A JOINT VIEW.

SUPPLIER FINANCING AND STOCK MANAGEMENT. A JOINT VIEW. SUPPLIER FINANCING AND STOCK MANAGEMENT. A JOINT VIEW. Lucía Isabel García Cebrán Departamento de Economía y Dreccón de Empresas Unversdad de Zaragoza Gran Vía, 2 50.005 Zaragoza (Span) Phone: 976-76-10-00

More information

Calculating the high frequency transmission line parameters of power cables

Calculating the high frequency transmission line parameters of power cables < ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,

More information

Risk-based Fatigue Estimate of Deep Water Risers -- Course Project for EM388F: Fracture Mechanics, Spring 2008

Risk-based Fatigue Estimate of Deep Water Risers -- Course Project for EM388F: Fracture Mechanics, Spring 2008 Rsk-based Fatgue Estmate of Deep Water Rsers -- Course Project for EM388F: Fracture Mechancs, Sprng 2008 Chen Sh Department of Cvl, Archtectural, and Envronmental Engneerng The Unversty of Texas at Austn

More information

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange

More information

Stochastic Protocol Modeling for Anomaly Based Network Intrusion Detection

Stochastic Protocol Modeling for Anomaly Based Network Intrusion Detection Stochastc Protocol Modelng for Anomaly Based Network Intruson Detecton Juan M. Estevez-Tapador, Pedro Garca-Teodoro, and Jesus E. Daz-Verdejo Department of Electroncs and Computer Technology Unversty of

More information

The Power of Slightly More than One Sample in Randomized Load Balancing

The Power of Slightly More than One Sample in Randomized Load Balancing The Power of Slghtly More than One Sample n Randomzed oad Balancng e Yng, R. Srkant and Xaohan Kang Abstract In many computng and networkng applcatons, arrvng tasks have to be routed to one of many servers,

More information

Fair and Efficient User-Network Association Algorithm for Multi-Technology Wireless Networks

Fair and Efficient User-Network Association Algorithm for Multi-Technology Wireless Networks Far and Effcent User-Network Assocaton Algorthm for Mult-Technology Wreless Networks Perre Coucheney, Cornne Touat and Bruno Gaujal INRIA Rhône-Alpes and LIG, MESCAL project, Grenoble France, {perre.coucheney,

More information

Extending Probabilistic Dynamic Epistemic Logic

Extending Probabilistic Dynamic Epistemic Logic Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set

More information

Section 5.4 Annuities, Present Value, and Amortization

Section 5.4 Annuities, Present Value, and Amortization Secton 5.4 Annutes, Present Value, and Amortzaton Present Value In Secton 5.2, we saw that the present value of A dollars at nterest rate per perod for n perods s the amount that must be deposted today

More information

Performance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application

Performance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application Internatonal Journal of mart Grd and lean Energy Performance Analyss of Energy onsumpton of martphone Runnng Moble Hotspot Applcaton Yun on hung a chool of Electronc Engneerng, oongsl Unversty, 511 angdo-dong,

More information

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel

More information

Dynamic Fleet Management for Cybercars

Dynamic Fleet Management for Cybercars Proceedngs of the IEEE ITSC 2006 2006 IEEE Intellgent Transportaton Systems Conference Toronto, Canada, September 17-20, 2006 TC7.5 Dynamc Fleet Management for Cybercars Fenghu. Wang, Mng. Yang, Ruqng.

More information

On the Interaction between Load Balancing and Speed Scaling

On the Interaction between Load Balancing and Speed Scaling On the Interacton between Load Balancng and Speed Scalng Ljun Chen and Na L Abstract Speed scalng has been wdely adopted n computer and communcaton systems, n partcular, to reduce energy consumpton. An

More information

8 Algorithm for Binary Searching in Trees

8 Algorithm for Binary Searching in Trees 8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the

More information

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson

More information

RequIn, a tool for fast web traffic inference

RequIn, a tool for fast web traffic inference RequIn, a tool for fast web traffc nference Olver aul, Jean Etenne Kba GET/INT, LOR Department 9 rue Charles Fourer 90 Evry, France Olver.aul@nt-evry.fr, Jean-Etenne.Kba@nt-evry.fr Abstract As networked

More information

where the coordinates are related to those in the old frame as follows.

where the coordinates are related to those in the old frame as follows. Chapter 2 - Cartesan Vectors and Tensors: Ther Algebra Defnton of a vector Examples of vectors Scalar multplcaton Addton of vectors coplanar vectors Unt vectors A bass of non-coplanar vectors Scalar product

More information

Traffic State Estimation in the Traffic Management Center of Berlin

Traffic State Estimation in the Traffic Management Center of Berlin Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D-763 Karlsruhe, Germany phone ++49/72/965/35, emal peter.vortsch@ptv.de Peter Möhl, PTV AG,

More information

Robust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School

Robust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School Robust Desgn of Publc Storage Warehouses Yemng (Yale) Gong EMLYON Busness School Rene de Koster Rotterdam school of management, Erasmus Unversty Abstract We apply robust optmzaton and revenue management

More information

Implementation of Deutsch's Algorithm Using Mathcad

Implementation of Deutsch's Algorithm Using Mathcad Implementaton of Deutsch's Algorthm Usng Mathcad Frank Roux The followng s a Mathcad mplementaton of Davd Deutsch's quantum computer prototype as presented on pages - n "Machnes, Logc and Quantum Physcs"

More information

Enterprise Master Patient Index

Enterprise Master Patient Index Enterprse Master Patent Index Healthcare data are captured n many dfferent settngs such as hosptals, clncs, labs, and physcan offces. Accordng to a report by the CDC, patents n the Unted States made an

More information

Conversion between the vector and raster data structures using Fuzzy Geographical Entities

Conversion between the vector and raster data structures using Fuzzy Geographical Entities Converson between the vector and raster data structures usng Fuzzy Geographcal Enttes Cdála Fonte Department of Mathematcs Faculty of Scences and Technology Unversty of Combra, Apartado 38, 3 454 Combra,

More information

BERNSTEIN POLYNOMIALS

BERNSTEIN POLYNOMIALS On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful

More information

An Intelligent Policy System for Channel Allocation of Information Appliance

An Intelligent Policy System for Channel Allocation of Information Appliance Tamkang Journal of Scence and Engneerng, Vol. 5, No., pp. 63-68 (2002) 63 An Intellgent Polcy System for Channel Allocaton of Informaton Applance Cheng-Yuan Ku, Chang-Jnn Tsao 2 and Davd Yen 3 Department

More information

THE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES

THE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES The goal: to measure (determne) an unknown quantty x (the value of a RV X) Realsaton: n results: y 1, y 2,..., y j,..., y n, (the measured values of Y 1, Y 2,..., Y j,..., Y n ) every result s encumbered

More information

An MILP model for planning of batch plants operating in a campaign-mode

An MILP model for planning of batch plants operating in a campaign-mode An MILP model for plannng of batch plants operatng n a campagn-mode Yanna Fumero Insttuto de Desarrollo y Dseño CONICET UTN yfumero@santafe-concet.gov.ar Gabrela Corsano Insttuto de Desarrollo y Dseño

More information

Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT

Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the

More information

A Lyapunov Optimization Approach to Repeated Stochastic Games

A Lyapunov Optimization Approach to Repeated Stochastic Games PROC. ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, OCT. 2013 1 A Lyapunov Optmzaton Approach to Repeated Stochastc Games Mchael J. Neely Unversty of Southern Calforna http://www-bcf.usc.edu/

More information

Vasicek s Model of Distribution of Losses in a Large, Homogeneous Portfolio

Vasicek s Model of Distribution of Losses in a Large, Homogeneous Portfolio Vascek s Model of Dstrbuton of Losses n a Large, Homogeneous Portfolo Stephen M Schaefer London Busness School Credt Rsk Electve Summer 2012 Vascek s Model Important method for calculatng dstrbuton of

More information

RELIABILITY, RISK AND AVAILABILITY ANLYSIS OF A CONTAINER GANTRY CRANE ABSTRACT

RELIABILITY, RISK AND AVAILABILITY ANLYSIS OF A CONTAINER GANTRY CRANE ABSTRACT Kolowrock Krzysztof Joanna oszynska MODELLING ENVIRONMENT AND INFRATRUCTURE INFLUENCE ON RELIABILITY AND OPERATION RT&A # () (Vol.) March RELIABILITY RIK AND AVAILABILITY ANLYI OF A CONTAINER GANTRY CRANE

More information

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting Causal, Explanatory Forecastng Assumes cause-and-effect relatonshp between system nputs and ts output Forecastng wth Regresson Analyss Rchard S. Barr Inputs System Cause + Effect Relatonshp The job of

More information

Modeling and Analysis of 2D Service Differentiation on e-commerce Servers

Modeling and Analysis of 2D Service Differentiation on e-commerce Servers Modelng and Analyss of D Servce Dfferentaton on e-commerce Servers Xaobo Zhou, Unversty of Colorado, Colorado Sprng, CO zbo@cs.uccs.edu Janbn We and Cheng-Zhong Xu Wayne State Unversty, Detrot, Mchgan

More information

Joint Scheduling of Processing and Shuffle Phases in MapReduce Systems

Joint Scheduling of Processing and Shuffle Phases in MapReduce Systems Jont Schedulng of Processng and Shuffle Phases n MapReduce Systems Fangfe Chen, Mural Kodalam, T. V. Lakshman Department of Computer Scence and Engneerng, The Penn State Unversty Bell Laboratores, Alcatel-Lucent

More information

Single and multiple stage classifiers implementing logistic discrimination

Single and multiple stage classifiers implementing logistic discrimination Sngle and multple stage classfers mplementng logstc dscrmnaton Hélo Radke Bttencourt 1 Dens Alter de Olvera Moraes 2 Vctor Haertel 2 1 Pontfíca Unversdade Católca do Ro Grande do Sul - PUCRS Av. Ipranga,

More information

PKIS: practical keyword index search on cloud datacenter

PKIS: practical keyword index search on cloud datacenter Park et al. EURASIP Journal on Wreless Communcatons and Networkng 20, 20:64 http://jwcn.euraspjournals.com/content/20//64 RESEARCH Open Access PKIS: practcal keyword ndex search on cloud datacenter Hyun-A

More information

The Greedy Method. Introduction. 0/1 Knapsack Problem

The Greedy Method. Introduction. 0/1 Knapsack Problem The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton

More information

A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña

A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION

More information

Stochastic Games on a Multiple Access Channel

Stochastic Games on a Multiple Access Channel Stochastc Games on a Multple Access Channel Prashant N and Vnod Sharma Department of Electrcal Communcaton Engneerng Indan Insttute of Scence, Bangalore 560012, Inda Emal: prashant2406@gmal.com, vnod@ece.sc.ernet.n

More information

Fragility Based Rehabilitation Decision Analysis

Fragility Based Rehabilitation Decision Analysis .171. Fraglty Based Rehabltaton Decson Analyss Cagdas Kafal Graduate Student, School of Cvl and Envronmental Engneerng, Cornell Unversty Research Supervsor: rcea Grgoru, Professor Summary A method s presented

More information

On the Approximation Error of Mean-Field Models

On the Approximation Error of Mean-Field Models On the Approxmaton Error of Mean-Feld Models Le Yng School of Electrcal, Computer and Energy Engneerng Arzona State Unversty Tempe, AZ 85287 le.yng.2@asu.edu ABSTRACT Mean-feld models have been used to

More information

Section 5.3 Annuities, Future Value, and Sinking Funds

Section 5.3 Annuities, Future Value, and Sinking Funds Secton 5.3 Annutes, Future Value, and Snkng Funds Ordnary Annutes A sequence of equal payments made at equal perods of tme s called an annuty. The tme between payments s the payment perod, and the tme

More information

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,

More information

INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS

INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS 21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech-2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS

More information

Addendum to: Importing Skill-Biased Technology

Addendum to: Importing Skill-Biased Technology Addendum to: Importng Skll-Based Technology Arel Bursten UCLA and NBER Javer Cravno UCLA August 202 Jonathan Vogel Columba and NBER Abstract Ths Addendum derves the results dscussed n secton 3.3 of our

More information

Many e-tailers providing attended home delivery, especially e-grocers, offer narrow delivery time slots to

Many e-tailers providing attended home delivery, especially e-grocers, offer narrow delivery time slots to Vol. 45, No. 3, August 2011, pp. 435 449 ssn 0041-1655 essn 1526-5447 11 4503 0435 do 10.1287/trsc.1100.0346 2011 INFORMS Tme Slot Management n Attended Home Delvery Nels Agatz Department of Decson and

More information

taposh_kuet20@yahoo.comcsedchan@cityu.edu.hk rajib_csedept@yahoo.co.uk, alam_shihabul@yahoo.com

taposh_kuet20@yahoo.comcsedchan@cityu.edu.hk rajib_csedept@yahoo.co.uk, alam_shihabul@yahoo.com G. G. Md. Nawaz Al 1,2, Rajb Chakraborty 2, Md. Shhabul Alam 2 and Edward Chan 1 1 Cty Unversty of Hong Kong, Hong Kong, Chna taposh_kuet20@yahoo.comcsedchan@ctyu.edu.hk 2 Khulna Unversty of Engneerng

More information

行 政 院 國 家 科 學 委 員 會 補 助 專 題 研 究 計 畫 成 果 報 告 期 中 進 度 報 告

行 政 院 國 家 科 學 委 員 會 補 助 專 題 研 究 計 畫 成 果 報 告 期 中 進 度 報 告 行 政 院 國 家 科 學 委 員 會 補 助 專 題 研 究 計 畫 成 果 報 告 期 中 進 度 報 告 畫 類 別 : 個 別 型 計 畫 半 導 體 產 業 大 型 廠 房 之 設 施 規 劃 計 畫 編 號 :NSC 96-2628-E-009-026-MY3 執 行 期 間 : 2007 年 8 月 1 日 至 2010 年 7 月 31 日 計 畫 主 持 人 : 巫 木 誠 共 同

More information

NPAR TESTS. One-Sample Chi-Square Test. Cell Specification. Observed Frequencies 1O i 6. Expected Frequencies 1EXP i 6

NPAR TESTS. One-Sample Chi-Square Test. Cell Specification. Observed Frequencies 1O i 6. Expected Frequencies 1EXP i 6 PAR TESTS If a WEIGHT varable s specfed, t s used to replcate a case as many tmes as ndcated by the weght value rounded to the nearest nteger. If the workspace requrements are exceeded and samplng has

More information

A DATA MINING APPLICATION IN A STUDENT DATABASE

A DATA MINING APPLICATION IN A STUDENT DATABASE JOURNAL OF AERONAUTICS AND SPACE TECHNOLOGIES JULY 005 VOLUME NUMBER (53-57) A DATA MINING APPLICATION IN A STUDENT DATABASE Şenol Zafer ERDOĞAN Maltepe Ünversty Faculty of Engneerng Büyükbakkalköy-Istanbul

More information

Section C2: BJT Structure and Operational Modes

Section C2: BJT Structure and Operational Modes Secton 2: JT Structure and Operatonal Modes Recall that the semconductor dode s smply a pn juncton. Dependng on how the juncton s based, current may easly flow between the dode termnals (forward bas, v

More information

Relay Secrecy in Wireless Networks with Eavesdropper

Relay Secrecy in Wireless Networks with Eavesdropper Relay Secrecy n Wreless Networks wth Eavesdropper Parvathnathan Venktasubramanam, Tng He and Lang Tong School of Electrcal and Computer Engneerng Cornell Unversty, Ithaca, NY 14853 Emal : {pv45, th255,

More information

SPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background:

SPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background: SPEE Recommended Evaluaton Practce #6 efnton of eclne Curve Parameters Background: The producton hstores of ol and gas wells can be analyzed to estmate reserves and future ol and gas producton rates and

More information

Optimal outpatient appointment scheduling

Optimal outpatient appointment scheduling Health Care Manage Sc (27) 1:217 229 DOI 1.17/s1729-7-915- Optmal outpatent appontment schedulng Gudo C. Kaandorp Ger Koole Receved: 15 March 26 / Accepted: 28 February 27 / Publshed onlne: 23 May 27 Sprnger

More information

Value Driven Load Balancing

Value Driven Load Balancing Value Drven Load Balancng Sherwn Doroud a, Esa Hyytä b,1, Mor Harchol-Balter c,2 a Tepper School of Busness, Carnege Mellon Unversty, 5000 Forbes Ave., Pttsburgh, PA 15213 b Department of Communcatons

More information

An Evaluation of the Extended Logistic, Simple Logistic, and Gompertz Models for Forecasting Short Lifecycle Products and Services

An Evaluation of the Extended Logistic, Simple Logistic, and Gompertz Models for Forecasting Short Lifecycle Products and Services An Evaluaton of the Extended Logstc, Smple Logstc, and Gompertz Models for Forecastng Short Lfecycle Products and Servces Charles V. Trappey a,1, Hsn-yng Wu b a Professor (Management Scence), Natonal Chao

More information

Viscosity of Solutions of Macromolecules

Viscosity of Solutions of Macromolecules Vscosty of Solutons of Macromolecules When a lqud flows, whether through a tube or as the result of pourng from a vessel, layers of lqud slde over each other. The force f requred s drectly proportonal

More information

To Fill or not to Fill: The Gas Station Problem

To Fill or not to Fill: The Gas Station Problem To Fll or not to Fll: The Gas Staton Problem Samr Khuller Azarakhsh Malekan Julán Mestre Abstract In ths paper we study several routng problems that generalze shortest paths and the Travelng Salesman Problem.

More information

Scatter search approach for solving a home care nurses routing and scheduling problem

Scatter search approach for solving a home care nurses routing and scheduling problem Scatter search approach for solvng a home care nurses routng and schedulng problem Bouazza Elbenan 1, Jacques A. Ferland 2 and Vvane Gascon 3* 1 Département de mathématque et nformatque, Faculté des scences,

More information

Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network *

Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819-840 (2008) Data Broadcast on a Mult-System Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,

More information

Period and Deadline Selection for Schedulability in Real-Time Systems

Period and Deadline Selection for Schedulability in Real-Time Systems Perod and Deadlne Selecton for Schedulablty n Real-Tme Systems Thdapat Chantem, Xaofeng Wang, M.D. Lemmon, and X. Sharon Hu Department of Computer Scence and Engneerng, Department of Electrcal Engneerng

More information

Quantitative Modeling and Analysis with FMC-QE

Quantitative Modeling and Analysis with FMC-QE Hasso Plattner Insttut für Softwaresystemtechnk an der Unverstät Potsdam Quanttatve Modelng and Analyss wth FMC-QE Dssertaton zur Erlangung des akademschen Grades Doktor der Ingeneurwssenschaften (Dr.-Ing.

More information

ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING

ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 610-519-4390,

More information

SIMULATION OF INVENTORY CONTROL SYSTEM FOR SUPPLY CHAIN PRODUCER WHOLESALER CLIENT IN EXTENDSIM ENVIRONMENT

SIMULATION OF INVENTORY CONTROL SYSTEM FOR SUPPLY CHAIN PRODUCER WHOLESALER CLIENT IN EXTENDSIM ENVIRONMENT SIMULATION OF INVENTOY CONTOL SYSTEM FO SUPPLY CHAIN PODUCE WHOLESALE CLIENT IN EXTENDSIM ENVIONMENT Eugene Kopytov and Avars Muravjovs Transport and Telecommuncaton Insttute, Lomonosov Street, ga, LV-09,

More information