On the Stability Region of Multi-Queue Multi-Server Queueing Systems with Stationary Channel Distribution

Size: px
Start display at page:

Download "On the Stability Region of Multi-Queue Multi-Server Queueing Systems with Stationary Channel Distribution"

Transcription

1 On he Sabiliy Region of Muli-Queue Muli-Server Queueing Sysems wih Saionary Channel Disribuion Hassan Halabian, Ioannis Lambadaris, Chung-Horng Lung Deparmen of Sysems and Compuer Engineering, Carleon Universiy, Oawa, ON, Canada {hassanh, ioannis, arxiv:2.8v [cs.it] 6 Dec 20 Absrac In his paper, we characerize he sabiliy region of muli-queue muli-server MQMS queueing sysems wih saionary channel and packe arrival processes. Toward his, he necessary and sufficien condiions for he sabiliy of he sysem are derived under general arrival processes wih finie firs and second momens. We show ha when he arrival processes are saionary, he sabiliy region form is a polyope for which we explicily find he coefficiens of he linear inequaliies which characerize he sabiliy region polyope. I. INTRODUCTION Sabiliy region or nework capaciy region of a communicaion nework is he closure of he se of all arrival rae vecors for which here exiss a resource allocaion policy ha can sabilize he sysem [] [3]. Having he sabiliy region of a nework characerized by a se of convex inequaliies, we can obain a precise soluion for nework fairness opimizaion problems wih he general form of. Maximize: Subjec o: N f n r n n= r = r,r 2,...,r N Λ 0 r n λ n n =,2,...,N In, N is he number of raffic sources. By r = r,r 2,...,r N, we denoe he admied rae vecor, λ n is he inpu rae of each source n and Λ denoes he sabiliy region. Funcions f n r n are non-decreasing and concave uiliy funcions. The choice of f n r n deermine he desired fairness properies of he nework. The goal of his paper is o characerize he nework capaciy region of Muli-Queue Muli- Server MQMS queueing sysems wih saionary channel disribuion i.e., Λ for MQMS sysem. Such queueing sysems are used o model muliuser wireless neworks wih muliple orhogonal subchannels such as OFDMA access neworks. The resource allocaion in such neworks can be modelled as he server allocaion problem in muli-queue muli-server queueing sysems wih ime varying channel condiions [4] [9]. The sabiliy problem in wireless queueing neworks was mainly addressed in [] [3], [5], [9] []. In [3], he auhors inroduced he noion of capaciy region of a queueing nework. They considered a ime sloed sysem and assumed ha arrival processes are i.i.d. sequences and he queue lengh process is a Markov process. In [0], hey characerized he nework capaciy region of muli-queue single-server sysem wih ime varying ON-OFF conneciviies. They also proved ha for a symmeric sysem i.e., wih he same arrival and conneciviy saisics for all he queues, LCQ Longes Conneced Queue policy maximizes he capaciy region and also provides he opimal performance in erms of average queue occupancy or equivalenly average queueing delay. In [], [2] and [], he noion of nework capaciy region of a wireless nework was inroduced for more general arrival and queue lengh processes. The problem of server allocaion in muli-queue muli-server sysems wih ime varying conneciviies was mainly addressed in [4] [7], [9]. In [5], Maximum Weigh MW policy was proposed as a hroughpu opimal server allocaion policy for MQMS sysems wih saionary channel processes. However, in [5] he condiions on he arrival raffic o guaranee he sabiliy of MW were no explicily menioned. In our previous work [9], we characerized he nework capaciy region of muli-queue muli-server sysems wih ime varying ON-OFF channels. We also obained an upper bound for he average queueing delay of AS/LCQ Any Server/Longes Conneced Queue policy which is he hroughpu opimal server allocaion policy for such sysems. In his paper, we characerize he sabiliy region of muliqueue muli-server queueing sysem wih saionary channel and arrival processes. Toward his, he necessary and sufficien condiions for he sabiliy of he sysem are derived for general arrival processes wih finie firs and second momens. For saionary arrival processes, hese condiions esablish he nework sabiliy region of such sysems. Our conribuion in his work is o characerize he sabiliy region as a convex polyope specified by a finie se of linear inequaliies ha can be numerically abulaed and used o solve nework opimizaion problem. We furher inroduce an upper bound for he average queueing delay of MW policy which is a hroughpu opimal policy for MQMS sysems. The res of his paper is organized as follows. Secion II describes he model and noaion required hroughou he paper. In secion III, we discuss abou some preliminary definiions sabiliy definiion, polyope, ec. used in he paper. In secion IV, we will derive necessary and sufficien condiions for he sabiliy of our model and also find an upper bound for he average queue occupancy or average queueing delay. Secion V summarizes he conclusions of he paper. II. MODEL DESCRIPTION Before we proceed o describe he model, we inroduce basic noaions ofen used hroughou he paper. Oher no-

2 X A A 2 A N X 2 X N C K C C 2 C N C N 2 C NK Fig. : Muli-queue muli-server queueing sysem wih saionary channel disribuion aions are inroduced whenever i is necessary. Through his paper, all he vecors are considered o be row vecors. The ime average of a funcion f is denoed by f, i.e., f = lim τ=fτ. The operaor is used for enry-wise muliplicaion of wo marices. By K 0 K, we denoe a row vecor of size K whose elemens are all idenically equal o 0. The cardinaliy of a se is shown by. For any vecor α = α,α 2,...,α N and a nonempy index se U = {u,u 2,...,u U } {,2,...,N} and u < u 2 <... < u U, we define α U = α u,α u2,...,α u U. We consider a ime sloed queueing sysem wih equal lengh ime slos and equal lengh packes. The model consiss of a se of parallel queues N = {,2,...,N} and a se of idenical servers K = {,2,...,K} Figure. Each server can serve a mos one queue a each ime slo, i.e., we do no have server sharing in he sysem. A each ime slo, he capaciy of each link beween each queue n N and server k K is assumed o be C n,k packes/slo. We assume ha C n,k M where M = {m Z + m M} for given M. Therefore, a each ime slo, he channel sae may be expressed by an N K marix of C = C n,k,n N,k K,C n,k M. The channel process is defined as {C} = wih he sae space S. Noe ha S is a finie se wih S = M + NK. We label each elemen of S by a posiive ineger index s {,2,...,M + NK }. Suppose ha he channel sae marix associaed o he channel sae s is denoed by C s. The channel sae of he sysem is assumed o have saionary disribuion, wih saionary probabiliies π s = PrC = C s. Assume ha he arrival process o each queue n N a ime slo i.e., he number of packe arrivals during ime slo is represened by A n. Thus, he arrival vecor a ime slo is denoed by A = A,A 2,...,A N. Assume ha E[A 2 n ] < A2 max < for all. Each queue has an infinie buffer space. New arrivals are added o each queue a he end of each ime slo. Le X = X,...,X N be he queue lengh process vecor a he end of ime slo afer adding new arrivals o he queues. A server scheduling policy a each ime slo should decide on how o allocae servers from se K o he queues in se N. This mus be accomplished based on he available informaion abou he channel sae of he sysem a ime slo which is C and also he queue lengh process a he beginning of ime slo which is X. In oher words, a each ime slo, he scheduler has o deermine an allocaion 2 K marix I I where { I = I N K = I n,k,i n,k {0,} } N I n,k = k K. n= We can easily observe ha he queue lengh process evolves wih ime according o he following rule. X T = X T C I T K + +A T 2 where + is defined as follows: For an arbirary vecor v of size v, v + is a vecor of he same size whose i h elemen v + i = v i if v i 0 and zero oherwise. A. Srong Sabiliy III. BACKGROUND We begin wih inroducing he definiion of srong sabiliy in queueing sysems [], [2], []. Oher definiions can be found in [3], [0], [2]. Consider a discree ime single queue sysem wih an arrival process A and service process µ. Assume ha he arrivals are added o he sysem a he end of each ime slo. Hence, he queue lengh process X evolves wih ime according o he following rule. X = X µ + +A 3 Srong sabiliy is given by he following definiion []. Definiion : A queue saisfying he condiions above is called srongly sable if lim sup τ=0 E[Xτ] < 4 Naurally for a queueing sysem we have he following definiion []. Definiion 2: A queueing sysem is called o be srongly sable if all he queues in he sysem are srongly sable. In his paper, we use he srong sabiliy definiion and from now we use sabiliy and srong sabiliy inerchangeably. B. Some Fundamenal Conceps of Polyopes In his par, we will have a brief review on he noion of convex polyopes and some fundamenal properies of hem. These conceps are needed when describing he sabiliy region of MQMS sysem in secion IV. Definiion 3: A convex polyope is defined as he convex hull of a finie se of poins [3], [4]. According o he Weyl s Theorem [3], a polyope in R N always can be expressed by a se { x R N α l x T β l, l =,2,...,L } for some posiive ineger L and α l R N and β l R. Dimension Theorem [3]: For a polyope P R N, dimension of P is equal o N minus he maximum number of linearly independen equaions saisfied by all he poins in P. Definiion 4: An equaliy ax T b is called valid for polyope P if for every poin x 0 P, ax T 0 b. Definiion 5: A face of polyope P is defined as F = {x P ax T = b} where inequaliy ax T b is a valid inequaliy for P.

3 We call he hyperplane ax T 0 = b associaed o he valid inequaliy ax T 0 b a face defining hyperplane for P if is associaed face is no empy. In oher words, ax T 0 = b is a face defining hyperplane for P if i inersecs wih P on a leas one poin. Noe ha P has finiely many faces. However, he face defining hyperplanes of a polyope can be infinie. Definiion 6: A face of polyope P is a maximal face disinc from P [4]. In oher words, all faces of P wih dimension dimp are called faces of P. For polyope P = { x R N α l x T β l, l =,2,...,L } an inequaliy is redundan if polyope P is unchanged by removing he inequaliy. Redundancy Theorem in Polyopes: Face defining hyperplanes inequaliies describing faces of dimension less han dimp are redundan [3]. Redundancy heorem saes ha o describe a polyope compleely, only face defining hyperplanes inequaliies are sufficien. IV. NECESSARY AND SUFFICIENT CONDITIONS FOR THE STABILITY OF MQMS SYSTEM A. Necessary Condiions for he Sabiliy of MQMS Sysem We inroduce he deparure marix H N K = H n,k,n N,k K in which H n,k represens he oal number of packes served by server k from queue n a ime slo. Obviously H n,k C n,k. Thus, he deparure process from queue n a ime slo would be K k= H n,k. The following equaliy illusraes he evoluion of queue lengh process wih ime. X n = X n K H n,k +A n n N 5 k= Le G be he class of deerminisic policies in which a each sae of he sysem, each policy g G allocaes he servers according o a predeermined allocaion marix. Therefore, each deerminisic policy g is specified by S allocaion marices I s g, s S. Noe ha se I is a finie se and since he channel sae space is also finie, se G is finie. A deerminisic policy g will resul ino an average ransmission rae for each queue n. Le R n g denoe he ime averaged ransmission rae provided o queue n and R g := R g,rg 2,...,Rg N. I follows ha, T R g = π s C s I g K T 6 s S Each rae vecorr g deermines a single poin inr N +. Now, consider he convex hull of all he poins R g, g G in R N +, i.e., R = conv.hullr g. According o he above discussion and definiion of convex polyope, we can show ha he se of achievable ransmission rae vecors R is specified by a polyope. Henceforh, we denoe he achievable ransmission rae polyope by P. Noe ha convex hull represenaion of he sabiliy region may no be suiable o use in nework opimizaion problems like. Since i does no provide mahemaical saemens in a form o be used as he consrains in. In he following, s we will characerize he sabiliy region by a se of linear inequaliies. To inroduce he necessary condiions for he sabiliy of MQMS sysem we need o prove a series of Lemmas Lemmas o 5. In his paper, he proofs were skipped due o space limiaion. Lemma : If he MQMS sysem is srongly sable under a server allocaion policy, hen for any vecor α = α,α 2,...,α N R N + we have lim τ= αe[aτ] T = lim αe[hτ] T K. 7 τ= Lemma 2: If he MQMS sysem is srongly sable under a server allocaion policy, hen E[A] P. Lemma 3: If he MQMS sysem is srongly sable under a server allocaion policy, hen for all α R N + αe[a] T s Sπ s max αcs I T K As we can see, he number of inequaliies defined in 8 is infinie. Noe ha each inequaliy in 8 deermines a valid inequaliy for polyope P. I is no hard o show ha he hyperplanes associaed o he valid inequaliies of 8 are all face defining hyperplanes of polyope P. To see his, le I α denoe a se of allocaion marices of {I α s,s S} ha maximizes he righ hand side of 8, i.e., 8 I α s = argmax αc s I T K. 9 Noe ha I α is no unique and here may be more han one se of allocaion marices of I α whose elemens maximize αc s I T K. According o 6 and definiion of polyope P, s S π sc s Is α T K T P. On he oher hand, s S π sαc s Is αt K = α s S π sc s Is αt K. Thus, s S π sc s Is α T K T is locaed on he hyperplane associaed o 8. In oher words, he hyperplane associaed o 8 ouches polyope P. So, he se of inequaliies of 8 are all face defining hyperplanes of polyope P. According o redundancy heorem in polyopes [3], no all he face defining hyperplanes of a polyope are required o deermine a polyope compleely. The inequaliies corresponding o he faces of a polyope are jus sufficien o characerize a polyope. In he following, we will characerize he faces of polyope P. Le V denoe he se of vecors α R N + wih he following propery, i.e., V := { α R N + U N,U,α U 0 U,α U c 0 U c i U,j U c, m,n M, α i,α j,m,n 0 : α i m = α j n} 0 In oher words, a vecor α belongs o se V if for any pariioning of elemens of vecor α ino wo non-empy disjoin subvecors in which all he elemens of each vecor are no idenically equal o zero, here exiss a leas one nonzero elemen in each vecor, he raio of which is equal o raio of wo non-zero elemens of se M. To clarify he definiion of se V consider he following example. Example: Le M = {0,,2} and N = 4. Consider vecor α =,2,5,0. We can pariion α o α {,2} =,2 and

4 α {3,4} = 5,0. Noe ha here exis no elemens in α {,2} and α {3,4} whose raio is or 2 and herefore, α / V. Anoher example is he vecor α 2 = 0,2.5,0,0 in which for any pariioning of he vecor ino wo non-empy disjoin pars, one par will always have all he elemens idenically equal o zero. Therefore, α 2 V. In he following we will show ha any vecor in R N + V canno form a face defining hyperplane for polyope P and herefore he inequaliies derived by he vecors of se R N + V are redundan o characerize polyope P. Lemma 4: The hyperplane associaed o he valid inequaliy of 8 is no a face defining hyperplane of P if α R N + V. Se V is an infinie se. However, we can show ha se V is finie up o muliplicaion of vecors by { posiive scalars. To show his, we define se W = z Z + z = } N j= m j, m j M. Then, we consider he se W N = {α,α 2,...,α N α n W}. We can prove he following Lemma. Lemma 5: There exiss V W N such ha any vecor α V can be wrien as α = qβ for some β V and q > 0. M+N 2 N We can show ha W N = +. Since V N W N, herefore V W N excluding he vecor 0 N. We now inroduce he necessary condiions for he sabiliy of MQMS sysem wih saionary channel disribuions by he following heorem. Theorem : If here exiss a server allocaion policy under which he sysem is sable, hen αe[a] T s Sπ s max αcs I T K, α V. The proof follows from Lemmas o 5. Noe ha according o Theorem, in order o characerize polyope P, we have o specify all he elemens of se V which can be obained afer considering all possible vecors α W N 0 N and removing redundancies following 0. This can be done using numerical compuaions. We may also useα W N 0 N insead ofα V in. Alhough by using W N 0 N we may obain some redundan inequaliies, since W N 0 N < we sill have a finie number of inequaliies o describe polyope P. Table I depics V and W N for some simple cases of N = 2,3 and M =,2,3,4. TABLE I: V and W N for N = 2,3 and M =,2,3,4 V, W N M = M = 2 M = 3 M = 4 N = 2 3,3 5,8 9,5 2,24 N = 3 7,7 25,63 09, ,330 Corollary : For an MQMS sysem wih saionary arrival processes, we have E[A] = λ = λ,λ 2,...,λ N and he necessary condiions for he sabiliy of he sysem would be αλ T s Sπ s max αcs I T K, α V, 2 Corollary 2: For an MQMS sysem wih ON-OFF channels, we have W = {0, } and herefore he necessary condiions for he sabiliy of he sysem become αe[a] T s Sπ s max αcs I T K, αn {0,} 3 In a special case considered in [9] where he channels are modelled by independen Bernoulli random variables wih E[C n,k ] = p n,k, he necessary condiions for he sabiliy of he sysem are given by K E[A n τ] K p n,k Q N. 4 n Q k= n Q In his case, he oal number of inequaliies needed o describe he polyope P is equal o 2 N. B. Sufficien Condiions for he Sabiliy of MQMS Sysem Consider a server allocaion policy which deermines he allocaion marix a each ime slo by solving he following maximizaion problem. I = argmax X C IT K 5 This policy is called Maximum Weigh MW and was firs inroduced in [3], [5]. According o he consrains on allocaion marix I, we can easily conclude ha MW policy allocaes he servers by he following rule: A each ime slo, MW policy allocaes each server k o queue n who has he maximum X n C n,k. In he special case where he channels are ON-OFF, he policy is equivalen o AS/LCQ Any Server/Longes Conneced Queue inroduced in [9]. In he following, we derive sufficien condiions for he sabiliy of our model and prove ha MW sabilizes he sysem as long as condiion 6 is saisfied. An upper bound is also derived for he ime averaged expeced number of packes in he sysem. Theorem 2: The MQMS sysem is sable under MW if for all αe[a] T < s Sπ s max αcs I T K, α V 6 Furhermore, he following bound for he average expeced aggregae occupancy holds. lim sup N τ=0n= E[X n τ] NA2 max +MK2 2δ 7 where δ is he maximum posiive number such ha for all we have E[A]+δ N P. Corollary 3: For an MQMS sysem wih saionary arrival processes, we have E[A] = λ and he sufficien condiions for he sabiliy of he sysem under MW policy become αλ T < s S π smax αcs I T K, α V. According o Corollaries and 3 and he definiion of nework capaciy region, we can conclude ha for an MQMS sysem wih saionary channel disribuion and saionary arrival processes, he sabiliy region is characerized by 2. Consider an MQMS sysem wih ON-OFF channels. For such a sysem, he MW policy is equivalen o AS/LCQ policy inroduced in [9]. In AS/LCQ he policy akes an arbirary ordering of servers o be allocaed o he queues and hen for each server, AS/LCQ allocaes i o is longes conneced queue LCQ. Noe ha in such a sysem, W = {0,} and herefore we will have he following corollary.

5 Corollary 4: The MQMS sysem wih ON-OFF channels is sable under AS/LCQ if for all αe[a] T < s max αcs I s Sπ T K, αn {0,} 8 In a special case where he channels are modelled by independen Bernoulli random variables wih E[C n,k ] = p n,k, AS/LCQ sabilizes he sysem if K E[A n τ] < K p n,k Q N 9 n Q k= n Q C. Sabiliy Region for Fluid Model MQMS Sysems wih Saionary Coninuous Channel Disribuions We will consider a ime sloed fluid model MQMS sysem wih saionary channel disribuions. In his case, he amoun of work ha arrives ino and depars from he queues is considered o be a coninuous process. We also assume ha he channel sae of he link from each queue o each server is modelled by a coninuous random variable. The channel sae marix in he fluid model MQMS sysem is defined as C = C n,k,n N,k K,C n,k R +. We assume ha he channel sae follows a saionary disribuion f C c. f C is he join disribuions of all C n,k variables. We can easily check ha in he fluid model MQMS sysem, se V is equivalen o R N + as in he fluid model MQMS sysem, se M is replaced wih R +. Therefore, sabiliy region for he fluid model sysem is characerized by he following se of inequaliies. αλ T c n,k =0 c n,k =0 c,=0 max αc I T K f C c dc, dc n,k dc n,k α R N + 20 Noe ha in order o characerize he sabiliy region of he fluid model sysem we need o compue an infinie number of inegrals in 20. In fac, he sabiliy region of fluid model sysem is characerized by infinie number of half spaces which means ha he sabiliy region is a convex surface. In his case, depending on he channel disribuion and dimension of he sysem, we could characerize he sabiliy region by a limied number of non-linear inequaliies insead of infinie number of linear inequaliies as we show in he following example. Example: Consider a fluid model MQMS sysem wih wo queues and one server. Suppose ha he channel sae variables C, and C 2, are independen and follow exponenial disribuion wih means µ and µ 2, respecively. Such a modelling is used o model slow Rayleigh fading channels wih low SNR where he approximaionlog+x x is valid for small posiive x. We can show ha he sabiliy region for his example is described by λ 2 µ 2 λ 2 λ µ µ 2 for λ 0 and λ 2 0. The derivaion of 2 is skipped because of space limiaion. As we can see from equaion 2, he sabiliy region in his example is characerized by jus one non-linear inequaliy 2 and wo linear inequaliies λ 0 and λ 2 0. The sabiliy region for his example for µ = 2 and µ 2 = is illusraed in Figure 2. λ λ 2 µ 2 λ 2 λ µ µ = 2 and µ 2 = Fig. 2: Sabiliy region for µ = 2 and µ 2 = V. CONCLUSIONS In his paper, we characerized he sabiliy region polyope of muli-queue muli-server MQMS queueing sysems wih saionary channel and packe arrival processes by a finie se of linear inequaliies given by 2. We also argued ha in general i may be compuaionally hard o quanify se V from se W N. In his case, we can use se W N iself insead of V in 2 as V W N, alhough we may have some redundan inequaliies. We also considered he sabiliy region for a fluid model MQMS. In his case, we deermine he sabiliy region by an infinie se of linear inequaliies given by 20. Finally, by use of an example we showed ha depending on he channel disribuion and number of queues, we may characerize he sabiliy region by a finie se of non-linear inequaliies insead of infinie se of linear inequaliies. REFERENCES [] L. Georgiadis, M. J. Neely, and L. Tassiulas, Resource Allocaion and Cross Layer Conrol in Wireless Neworks. Now Publisher, [2] M. J. Neely, Dynamic power allocaion and rouing for saellie and wireless neworks wih ime varying channels, Ph.D. disseraion, Massachuses Insiue of Technology, LIDS, [3] L. Tassiulas and A. Ephremides, Sabiliy properies of consrained queueing sysems and scheduling policies for maximum hroughpu in mulihop radio neworks, IEEE Trans. Auo. Conrol, vol. 37, no. 2, pp , Dec [4] S. Kiipiyakul and T. Javidi, Delay-opimal server allocaion in muliqueue muli-server sysems wih ime-varying conneciviies, IEEE Trans. Inform. Theory, vol. 55, no. 5, pp , May [5] T. Javidi, Rae sable resource allocaion in ofdm sysems: from waerfilling o queue-balancing, in Proc. Alleron Conference on Communicaion, Conrol, and Compuing, Oc [6] S. Kiipiyakul and T. Javidi, Resource allocaion in ofdma wih imevarying channel and bursy arrivals, IEEE Commun. Le., vol., no. 9, pp , Sep [7] H. Al-Zubaidy, I. Lambadaris, and I. Viniois, Opimal resource scheduling in wireless muli-service sysems wih random channel conneciviy, in Proc. of IEEE Global Communicaions Conference GLOBECOM 2009, Honolulu, HI, USA, Nov [8] A. Gani, E. Modiano, and J. N. Tsisiklis, Opimal ransmission scheduling in symmeric communicaion models wih inermien conneciviy, IEEE Trans. Inform. Theory, vol. 53, no. 3, pp , Mar [9] H. Halabian, I. Lambadaris, and C.-H. Lung, Nework capaciy region of muli-queue muli-server queueing sysem wih ime varying conneciviies, in Proc. of IEEE In. Symp. on Inform. Theory ISIT 0, Ausin, TX, USA, June 200. [0] L. Tassiulas and A. Ephremides, Dynamic server allocaion o parallel queues wih randomly varying conneciviy, IEEE Trans. Inform. Theory, vol. 39, no. 2, pp , Mar [] M. J. Neely, E. Modiano, and C. E. Rohrs, Dynamic power allocaion and rouing for ime varying wireless neworks, IEEE Journal on Seleced Areas in Communicaions, Special Issue on Wireless Ad-hoc Neworks, vol. 23, no., pp , Jan [2] S. Asmussen, Applied Probabiliy and Queues. New York: Spring- Verlag, [3] J. Lee, A Firs Course in Combinaorial Opimizaion. Cambridge, UK: Cambridge Texs in Applied Mahemaics, Cambridge Universiy Press, [4] A. Schrijver, Theory of Linear and Ineger Programming. Chicheser: John Wiley and Sons, 986. µ λ

Optimal Server Assignment in Multi-Server

Optimal Server Assignment in Multi-Server Opimal Server Assignmen in Muli-Server 1 Queueing Sysems wih Random Conneciviies Hassan Halabian, Suden Member, IEEE, Ioannis Lambadaris, Member, IEEE, arxiv:1112.1178v2 [mah.oc] 21 Jun 2013 Yannis Viniois,

More information

5. Stochastic processes (1)

5. Stochastic processes (1) Lec05.pp S-38.45 - Inroducion o Teleraffic Theory Spring 2005 Conens Basic conceps Poisson process 2 Sochasic processes () Consider some quaniy in a eleraffic (or any) sysem I ypically evolves in ime randomly

More information

Lecture 20: Riccati Equations and Least Squares Feedback Control

Lecture 20: Riccati Equations and Least Squares Feedback Control 34-5 LINEAR SYSTEMS Lecure : Riccai Equaions and Leas Squares Feedback Conrol 5.6.4 Sae Feedback via Riccai Equaions A recursive approach in generaing he marix-valued funcion W ( ) equaion for i for he

More information

Vehicle Arrival Models : Headway

Vehicle Arrival Models : Headway Chaper 12 Vehicle Arrival Models : Headway 12.1 Inroducion Modelling arrival of vehicle a secion of road is an imporan sep in raffic flow modelling. I has imporan applicaion in raffic flow simulaion where

More information

T L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB

T L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB Elecronic Companion EC.1. Proofs of Technical Lemmas and Theorems LEMMA 1. Le C(RB) be he oal cos incurred by he RB policy. Then we have, T L E[C(RB)] 3 E[Z RB ]. (EC.1) Proof of Lemma 1. Using he marginal

More information

Exploiting Wireless Channel State Information for Throughput Maximization

Exploiting Wireless Channel State Information for Throughput Maximization Exploiing Wireless Channel ae Informaion for Throughpu Maximizaion V Tsibonis, L Georgiadis, L Tassiulas Absrac We consider he problem of scheduling packes over a number of channels wih ime varying conneciviy

More information

Lecture Notes 2. The Hilbert Space Approach to Time Series

Lecture Notes 2. The Hilbert Space Approach to Time Series Time Series Seven N. Durlauf Universiy of Wisconsin. Basic ideas Lecure Noes. The Hilber Space Approach o Time Series The Hilber space framework provides a very powerful language for discussing he relaionship

More information

Chapter 6. Systems of First Order Linear Differential Equations

Chapter 6. Systems of First Order Linear Differential Equations Chaper 6 Sysems of Firs Order Linear Differenial Equaions We will only discuss firs order sysems However higher order sysems may be made ino firs order sysems by a rick shown below We will have a sligh

More information

Optimality Conditions for Unconstrained Problems

Optimality Conditions for Unconstrained Problems 62 CHAPTER 6 Opimaliy Condiions for Unconsrained Problems 1 Unconsrained Opimizaion 11 Exisence Consider he problem of minimizing he funcion f : R n R where f is coninuous on all of R n : P min f(x) x

More information

Linear Response Theory: The connection between QFT and experiments

Linear Response Theory: The connection between QFT and experiments Phys540.nb 39 3 Linear Response Theory: The connecion beween QFT and experimens 3.1. Basic conceps and ideas Q: How do we measure he conduciviy of a meal? A: we firs inroduce a weak elecric field E, and

More information

2. Nonlinear Conservation Law Equations

2. Nonlinear Conservation Law Equations . Nonlinear Conservaion Law Equaions One of he clear lessons learned over recen years in sudying nonlinear parial differenial equaions is ha i is generally no wise o ry o aack a general class of nonlinear

More information

CHAPTER 2 Signals And Spectra

CHAPTER 2 Signals And Spectra CHAPER Signals And Specra Properies of Signals and Noise In communicaion sysems he received waveform is usually caegorized ino he desired par conaining he informaion, and he undesired par. he desired par

More information

Lecture 4 Notes (Little s Theorem)

Lecture 4 Notes (Little s Theorem) Lecure 4 Noes (Lile s Theorem) This lecure concerns one of he mos imporan (and simples) heorems in Queuing Theory, Lile s Theorem. More informaion can be found in he course book, Bersekas & Gallagher,

More information

Chapter 2. First Order Scalar Equations

Chapter 2. First Order Scalar Equations Chaper. Firs Order Scalar Equaions We sar our sudy of differenial equaions in he same way he pioneers in his field did. We show paricular echniques o solve paricular ypes of firs order differenial equaions.

More information

10. State Space Methods

10. State Space Methods . Sae Space Mehods. Inroducion Sae space modelling was briefly inroduced in chaper. Here more coverage is provided of sae space mehods before some of heir uses in conrol sysem design are covered in he

More information

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation Course Noes for EE7C Spring 018: Convex Opimizaion and Approximaion Insrucor: Moriz Hard Email: hard+ee7c@berkeley.edu Graduae Insrucor: Max Simchowiz Email: msimchow+ee7c@berkeley.edu Ocober 15, 018 3

More information

Basic definitions and relations

Basic definitions and relations Basic definiions and relaions Lecurer: Dmiri A. Molchanov E-mail: molchan@cs.u.fi hp://www.cs.u.fi/kurssi/tlt-2716/ Kendall s noaion for queuing sysems: Arrival processes; Service ime disribuions; Examples.

More information

Cash Flow Valuation Mode Lin Discrete Time

Cash Flow Valuation Mode Lin Discrete Time IOSR Journal of Mahemaics (IOSR-JM) e-issn: 2278-5728,p-ISSN: 2319-765X, 6, Issue 6 (May. - Jun. 2013), PP 35-41 Cash Flow Valuaion Mode Lin Discree Time Olayiwola. M. A. and Oni, N. O. Deparmen of Mahemaics

More information

arxiv: v1 [math.pr] 19 Feb 2011

arxiv: v1 [math.pr] 19 Feb 2011 A NOTE ON FELLER SEMIGROUPS AND RESOLVENTS VADIM KOSTRYKIN, JÜRGEN POTTHOFF, AND ROBERT SCHRADER ABSTRACT. Various equivalen condiions for a semigroup or a resolven generaed by a Markov process o be of

More information

Inventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions

Inventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions Muli-Period Sochasic Models: Opimali of (s, S) Polic for -Convex Objecive Funcions Consider a seing similar o he N-sage newsvendor problem excep ha now here is a fixed re-ordering cos (> 0) for each (re-)order.

More information

Ordinary Differential Equations

Ordinary Differential Equations Ordinary Differenial Equaions 5. Examples of linear differenial equaions and heir applicaions We consider some examples of sysems of linear differenial equaions wih consan coefficiens y = a y +... + a

More information

Stationary Distribution. Design and Analysis of Algorithms Andrei Bulatov

Stationary Distribution. Design and Analysis of Algorithms Andrei Bulatov Saionary Disribuion Design and Analysis of Algorihms Andrei Bulaov Algorihms Markov Chains 34-2 Classificaion of Saes k By P we denoe he (i,j)-enry of i, j Sae is accessible from sae if 0 for some k 0

More information

EXERCISES FOR SECTION 1.5

EXERCISES FOR SECTION 1.5 1.5 Exisence and Uniqueness of Soluions 43 20. 1 v c 21. 1 v c 1 2 4 6 8 10 1 2 2 4 6 8 10 Graph of approximae soluion obained using Euler s mehod wih = 0.1. Graph of approximae soluion obained using Euler

More information

Essential Microeconomics : OPTIMAL CONTROL 1. Consider the following class of optimization problems

Essential Microeconomics : OPTIMAL CONTROL 1. Consider the following class of optimization problems Essenial Microeconomics -- 6.5: OPIMAL CONROL Consider he following class of opimizaion problems Max{ U( k, x) + U+ ( k+ ) k+ k F( k, x)}. { x, k+ } = In he language of conrol heory, he vecor k is he vecor

More information

Diebold, Chapter 7. Francis X. Diebold, Elements of Forecasting, 4th Edition (Mason, Ohio: Cengage Learning, 2006). Chapter 7. Characterizing Cycles

Diebold, Chapter 7. Francis X. Diebold, Elements of Forecasting, 4th Edition (Mason, Ohio: Cengage Learning, 2006). Chapter 7. Characterizing Cycles Diebold, Chaper 7 Francis X. Diebold, Elemens of Forecasing, 4h Ediion (Mason, Ohio: Cengage Learning, 006). Chaper 7. Characerizing Cycles Afer compleing his reading you should be able o: Define covariance

More information

An Introduction to Malliavin calculus and its applications

An Introduction to Malliavin calculus and its applications An Inroducion o Malliavin calculus and is applicaions Lecure 5: Smoohness of he densiy and Hörmander s heorem David Nualar Deparmen of Mahemaics Kansas Universiy Universiy of Wyoming Summer School 214

More information

THE GENERALIZED PASCAL MATRIX VIA THE GENERALIZED FIBONACCI MATRIX AND THE GENERALIZED PELL MATRIX

THE GENERALIZED PASCAL MATRIX VIA THE GENERALIZED FIBONACCI MATRIX AND THE GENERALIZED PELL MATRIX J Korean Mah Soc 45 008, No, pp 479 49 THE GENERALIZED PASCAL MATRIX VIA THE GENERALIZED FIBONACCI MATRIX AND THE GENERALIZED PELL MATRIX Gwang-yeon Lee and Seong-Hoon Cho Reprined from he Journal of he

More information

Martingales Stopping Time Processes

Martingales Stopping Time Processes IOSR Journal of Mahemaics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765. Volume 11, Issue 1 Ver. II (Jan - Feb. 2015), PP 59-64 www.iosrjournals.org Maringales Sopping Time Processes I. Fulaan Deparmen

More information

Lower and Upper Bounds on FIFO Buffer Management in QoS Switches

Lower and Upper Bounds on FIFO Buffer Management in QoS Switches Lower and Upper Bounds on FIFO Buffer Managemen in QoS Swiches Mahias Engler Mahias Wesermann Deparmen of Compuer Science RWTH Aachen 52056 Aachen, Germany {engler,marsu}@cs.rwh-aachen.de Absrac We consider

More information

IMPLICIT AND INVERSE FUNCTION THEOREMS PAUL SCHRIMPF 1 OCTOBER 25, 2013

IMPLICIT AND INVERSE FUNCTION THEOREMS PAUL SCHRIMPF 1 OCTOBER 25, 2013 IMPLICI AND INVERSE FUNCION HEOREMS PAUL SCHRIMPF 1 OCOBER 25, 213 UNIVERSIY OF BRIISH COLUMBIA ECONOMICS 526 We have exensively sudied how o solve sysems of linear equaions. We know how o check wheher

More information

Application of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing

Application of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing Applicaion of a Sochasic-Fuzzy Approach o Modeling Opimal Discree Time Dynamical Sysems by Using Large Scale Daa Processing AA WALASZE-BABISZEWSA Deparmen of Compuer Engineering Opole Universiy of Technology

More information

3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon

3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon 3..3 INRODUCION O DYNAMIC OPIMIZAION: DISCREE IME PROBLEMS A. he Hamilonian and Firs-Order Condiions in a Finie ime Horizon Define a new funcion, he Hamilonian funcion, H. H he change in he oal value of

More information

Stability and Bifurcation in a Neural Network Model with Two Delays

Stability and Bifurcation in a Neural Network Model with Two Delays Inernaional Mahemaical Forum, Vol. 6, 11, no. 35, 175-1731 Sabiliy and Bifurcaion in a Neural Nework Model wih Two Delays GuangPing Hu and XiaoLing Li School of Mahemaics and Physics, Nanjing Universiy

More information

Matrix Versions of Some Refinements of the Arithmetic-Geometric Mean Inequality

Matrix Versions of Some Refinements of the Arithmetic-Geometric Mean Inequality Marix Versions of Some Refinemens of he Arihmeic-Geomeric Mean Inequaliy Bao Qi Feng and Andrew Tonge Absrac. We esablish marix versions of refinemens due o Alzer ], Carwrigh and Field 4], and Mercer 5]

More information

Appendix 14.1 The optimal control problem and its solution using

Appendix 14.1 The optimal control problem and its solution using 1 Appendix 14.1 he opimal conrol problem and is soluion using he maximum principle NOE: Many occurrences of f, x, u, and in his file (in equaions or as whole words in ex) are purposefully in bold in order

More information

On Boundedness of Q-Learning Iterates for Stochastic Shortest Path Problems

On Boundedness of Q-Learning Iterates for Stochastic Shortest Path Problems MATHEMATICS OF OPERATIONS RESEARCH Vol. 38, No. 2, May 2013, pp. 209 227 ISSN 0364-765X (prin) ISSN 1526-5471 (online) hp://dx.doi.org/10.1287/moor.1120.0562 2013 INFORMS On Boundedness of Q-Learning Ieraes

More information

1 Review of Zero-Sum Games

1 Review of Zero-Sum Games COS 5: heoreical Machine Learning Lecurer: Rob Schapire Lecure #23 Scribe: Eugene Brevdo April 30, 2008 Review of Zero-Sum Games Las ime we inroduced a mahemaical model for wo player zero-sum games. Any

More information

Finish reading Chapter 2 of Spivak, rereading earlier sections as necessary. handout and fill in some missing details!

Finish reading Chapter 2 of Spivak, rereading earlier sections as necessary. handout and fill in some missing details! MAT 257, Handou 6: Ocober 7-2, 20. I. Assignmen. Finish reading Chaper 2 of Spiva, rereading earlier secions as necessary. handou and fill in some missing deails! II. Higher derivaives. Also, read his

More information

SUFFICIENT CONDITIONS FOR EXISTENCE SOLUTION OF LINEAR TWO-POINT BOUNDARY PROBLEM IN MINIMIZATION OF QUADRATIC FUNCTIONAL

SUFFICIENT CONDITIONS FOR EXISTENCE SOLUTION OF LINEAR TWO-POINT BOUNDARY PROBLEM IN MINIMIZATION OF QUADRATIC FUNCTIONAL HE PUBLISHING HOUSE PROCEEDINGS OF HE ROMANIAN ACADEMY, Series A, OF HE ROMANIAN ACADEMY Volume, Number 4/200, pp 287 293 SUFFICIEN CONDIIONS FOR EXISENCE SOLUION OF LINEAR WO-POIN BOUNDARY PROBLEM IN

More information

t is a basis for the solution space to this system, then the matrix having these solutions as columns, t x 1 t, x 2 t,... x n t x 2 t...

t is a basis for the solution space to this system, then the matrix having these solutions as columns, t x 1 t, x 2 t,... x n t x 2 t... Mah 228- Fri Mar 24 5.6 Marix exponenials and linear sysems: The analogy beween firs order sysems of linear differenial equaions (Chaper 5) and scalar linear differenial equaions (Chaper ) is much sronger

More information

Mean-square Stability Control for Networked Systems with Stochastic Time Delay

Mean-square Stability Control for Networked Systems with Stochastic Time Delay JOURNAL OF SIMULAION VOL. 5 NO. May 7 Mean-square Sabiliy Conrol for Newored Sysems wih Sochasic ime Delay YAO Hejun YUAN Fushun School of Mahemaics and Saisics Anyang Normal Universiy Anyang Henan. 455

More information

Math 334 Fall 2011 Homework 11 Solutions

Math 334 Fall 2011 Homework 11 Solutions Dec. 2, 2 Mah 334 Fall 2 Homework Soluions Basic Problem. Transform he following iniial value problem ino an iniial value problem for a sysem: u + p()u + q() u g(), u() u, u () v. () Soluion. Le v u. Then

More information

Macroeconomic Theory Ph.D. Qualifying Examination Fall 2005 ANSWER EACH PART IN A SEPARATE BLUE BOOK. PART ONE: ANSWER IN BOOK 1 WEIGHT 1/3

Macroeconomic Theory Ph.D. Qualifying Examination Fall 2005 ANSWER EACH PART IN A SEPARATE BLUE BOOK. PART ONE: ANSWER IN BOOK 1 WEIGHT 1/3 Macroeconomic Theory Ph.D. Qualifying Examinaion Fall 2005 Comprehensive Examinaion UCLA Dep. of Economics You have 4 hours o complee he exam. There are hree pars o he exam. Answer all pars. Each par has

More information

EE 315 Notes. Gürdal Arslan CLASS 1. (Sections ) What is a signal?

EE 315 Notes. Gürdal Arslan CLASS 1. (Sections ) What is a signal? EE 35 Noes Gürdal Arslan CLASS (Secions.-.2) Wha is a signal? In his class, a signal is some funcion of ime and i represens how some physical quaniy changes over some window of ime. Examples: velociy of

More information

non -negative cone Population dynamics motivates the study of linear models whose coefficient matrices are non-negative or positive.

non -negative cone Population dynamics motivates the study of linear models whose coefficient matrices are non-negative or positive. LECTURE 3 Linear/Nonnegaive Marix Models x ( = Px ( A= m m marix, x= m vecor Linear sysems of difference equaions arise in several difference conexs: Linear approximaions (linearizaion Perurbaion analysis

More information

MODULE 3 FUNCTION OF A RANDOM VARIABLE AND ITS DISTRIBUTION LECTURES PROBABILITY DISTRIBUTION OF A FUNCTION OF A RANDOM VARIABLE

MODULE 3 FUNCTION OF A RANDOM VARIABLE AND ITS DISTRIBUTION LECTURES PROBABILITY DISTRIBUTION OF A FUNCTION OF A RANDOM VARIABLE Topics MODULE 3 FUNCTION OF A RANDOM VARIABLE AND ITS DISTRIBUTION LECTURES 2-6 3. FUNCTION OF A RANDOM VARIABLE 3.2 PROBABILITY DISTRIBUTION OF A FUNCTION OF A RANDOM VARIABLE 3.3 EXPECTATION AND MOMENTS

More information

Mixing times and hitting times: lecture notes

Mixing times and hitting times: lecture notes Miing imes and hiing imes: lecure noes Yuval Peres Perla Sousi 1 Inroducion Miing imes and hiing imes are among he mos fundamenal noions associaed wih a finie Markov chain. A variey of ools have been developed

More information

The Asymptotic Behavior of Nonoscillatory Solutions of Some Nonlinear Dynamic Equations on Time Scales

The Asymptotic Behavior of Nonoscillatory Solutions of Some Nonlinear Dynamic Equations on Time Scales Advances in Dynamical Sysems and Applicaions. ISSN 0973-5321 Volume 1 Number 1 (2006, pp. 103 112 c Research India Publicaions hp://www.ripublicaion.com/adsa.hm The Asympoic Behavior of Nonoscillaory Soluions

More information

The L p -Version of the Generalized Bohl Perron Principle for Vector Equations with Infinite Delay

The L p -Version of the Generalized Bohl Perron Principle for Vector Equations with Infinite Delay Advances in Dynamical Sysems and Applicaions ISSN 973-5321, Volume 6, Number 2, pp. 177 184 (211) hp://campus.ms.edu/adsa The L p -Version of he Generalized Bohl Perron Principle for Vecor Equaions wih

More information

An random variable is a quantity that assumes different values with certain probabilities.

An random variable is a quantity that assumes different values with certain probabilities. Probabiliy The probabiliy PrA) of an even A is a number in [, ] ha represens how likely A is o occur. The larger he value of PrA), he more likely he even is o occur. PrA) means he even mus occur. PrA)

More information

Orthogonal Rational Functions, Associated Rational Functions And Functions Of The Second Kind

Orthogonal Rational Functions, Associated Rational Functions And Functions Of The Second Kind Proceedings of he World Congress on Engineering 2008 Vol II Orhogonal Raional Funcions, Associaed Raional Funcions And Funcions Of The Second Kind Karl Deckers and Adhemar Bulheel Absrac Consider he sequence

More information

Math 315: Linear Algebra Solutions to Assignment 6

Math 315: Linear Algebra Solutions to Assignment 6 Mah 35: Linear Algebra s o Assignmen 6 # Which of he following ses of vecors are bases for R 2? {2,, 3, }, {4,, 7, 8}, {,,, 3}, {3, 9, 4, 2}. Explain your answer. To generae he whole R 2, wo linearly independen

More information

Variational Iteration Method for Solving System of Fractional Order Ordinary Differential Equations

Variational Iteration Method for Solving System of Fractional Order Ordinary Differential Equations IOSR Journal of Mahemaics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 1, Issue 6 Ver. II (Nov - Dec. 214), PP 48-54 Variaional Ieraion Mehod for Solving Sysem of Fracional Order Ordinary Differenial

More information

We just finished the Erdős-Stone Theorem, and ex(n, F ) (1 1/(χ(F ) 1)) ( n

We just finished the Erdős-Stone Theorem, and ex(n, F ) (1 1/(χ(F ) 1)) ( n Lecure 3 - Kövari-Sós-Turán Theorem Jacques Versraëe jacques@ucsd.edu We jus finished he Erdős-Sone Theorem, and ex(n, F ) ( /(χ(f ) )) ( n 2). So we have asympoics when χ(f ) 3 bu no when χ(f ) = 2 i.e.

More information

Chapter 2. Models, Censoring, and Likelihood for Failure-Time Data

Chapter 2. Models, Censoring, and Likelihood for Failure-Time Data Chaper 2 Models, Censoring, and Likelihood for Failure-Time Daa William Q. Meeker and Luis A. Escobar Iowa Sae Universiy and Louisiana Sae Universiy Copyrigh 1998-2008 W. Q. Meeker and L. A. Escobar. Based

More information

Control of computer chip semi-conductor wafer fabs

Control of computer chip semi-conductor wafer fabs Conrol of compuer chip semi-conducor wafer fabs Cos: x9 $ Reurn: years Cycle ime: 6 weeks WIP: 6, wafers, 8x6 $ Challenge: Conrol he queues a ~5 work seps Conrol of Manufacuring Sysems:! Sochasic racking

More information

Let us start with a two dimensional case. We consider a vector ( x,

Let us start with a two dimensional case. We consider a vector ( x, Roaion marices We consider now roaion marices in wo and hree dimensions. We sar wih wo dimensions since wo dimensions are easier han hree o undersand, and one dimension is a lile oo simple. However, our

More information

Oscillation of an Euler Cauchy Dynamic Equation S. Huff, G. Olumolode, N. Pennington, and A. Peterson

Oscillation of an Euler Cauchy Dynamic Equation S. Huff, G. Olumolode, N. Pennington, and A. Peterson PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON DYNAMICAL SYSTEMS AND DIFFERENTIAL EQUATIONS May 4 7, 00, Wilmingon, NC, USA pp 0 Oscillaion of an Euler Cauchy Dynamic Equaion S Huff, G Olumolode,

More information

International Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN

International Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN Inernaional Journal of Scienific & Engineering Research, Volume 4, Issue 10, Ocober-2013 900 FUZZY MEAN RESIDUAL LIFE ORDERING OF FUZZY RANDOM VARIABLES J. EARNEST LAZARUS PIRIYAKUMAR 1, A. YAMUNA 2 1.

More information

SPECTRAL EVOLUTION OF A ONE PARAMETER EXTENSION OF A REAL SYMMETRIC TOEPLITZ MATRIX* William F. Trench. SIAM J. Matrix Anal. Appl. 11 (1990),

SPECTRAL EVOLUTION OF A ONE PARAMETER EXTENSION OF A REAL SYMMETRIC TOEPLITZ MATRIX* William F. Trench. SIAM J. Matrix Anal. Appl. 11 (1990), SPECTRAL EVOLUTION OF A ONE PARAMETER EXTENSION OF A REAL SYMMETRIC TOEPLITZ MATRIX* William F Trench SIAM J Marix Anal Appl 11 (1990), 601-611 Absrac Le T n = ( i j ) n i,j=1 (n 3) be a real symmeric

More information

The consumption-based determinants of the term structure of discount rates: Corrigendum. Christian Gollier 1 Toulouse School of Economics March 2012

The consumption-based determinants of the term structure of discount rates: Corrigendum. Christian Gollier 1 Toulouse School of Economics March 2012 The consumpion-based deerminans of he erm srucure of discoun raes: Corrigendum Chrisian Gollier Toulouse School of Economics March 0 In Gollier (007), I examine he effec of serially correlaed growh raes

More information

Online Appendix to Solution Methods for Models with Rare Disasters

Online Appendix to Solution Methods for Models with Rare Disasters Online Appendix o Soluion Mehods for Models wih Rare Disasers Jesús Fernández-Villaverde and Oren Levinal In his Online Appendix, we presen he Euler condiions of he model, we develop he pricing Calvo block,

More information

ODEs II, Lecture 1: Homogeneous Linear Systems - I. Mike Raugh 1. March 8, 2004

ODEs II, Lecture 1: Homogeneous Linear Systems - I. Mike Raugh 1. March 8, 2004 ODEs II, Lecure : Homogeneous Linear Sysems - I Mike Raugh March 8, 4 Inroducion. In he firs lecure we discussed a sysem of linear ODEs for modeling he excreion of lead from he human body, saw how o ransform

More information

A Primal-Dual Type Algorithm with the O(1/t) Convergence Rate for Large Scale Constrained Convex Programs

A Primal-Dual Type Algorithm with the O(1/t) Convergence Rate for Large Scale Constrained Convex Programs PROC. IEEE CONFERENCE ON DECISION AND CONTROL, 06 A Primal-Dual Type Algorihm wih he O(/) Convergence Rae for Large Scale Consrained Convex Programs Hao Yu and Michael J. Neely Absrac This paper considers

More information

Technical Report Doc ID: TR March-2013 (Last revision: 23-February-2016) On formulating quadratic functions in optimization models.

Technical Report Doc ID: TR March-2013 (Last revision: 23-February-2016) On formulating quadratic functions in optimization models. Technical Repor Doc ID: TR--203 06-March-203 (Las revision: 23-Februar-206) On formulaing quadraic funcions in opimizaion models. Auhor: Erling D. Andersen Convex quadraic consrains quie frequenl appear

More information

Robust estimation based on the first- and third-moment restrictions of the power transformation model

Robust estimation based on the first- and third-moment restrictions of the power transformation model h Inernaional Congress on Modelling and Simulaion, Adelaide, Ausralia, 6 December 3 www.mssanz.org.au/modsim3 Robus esimaion based on he firs- and hird-momen resricions of he power ransformaion Nawaa,

More information

Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems

Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems 1 Sable Scheduling Policies for Maximizing Throughpu in Generalized Consrained Queueing Sysems Prasanna Chaporar, Suden Member, IEEE, Saswai Sarar, Member, IEEE Absrac We consider a class of queueing newors

More information

( ) ( ) if t = t. It must satisfy the identity. So, bulkiness of the unit impulse (hyper)function is equal to 1. The defining characteristic is

( ) ( ) if t = t. It must satisfy the identity. So, bulkiness of the unit impulse (hyper)function is equal to 1. The defining characteristic is UNIT IMPULSE RESPONSE, UNIT STEP RESPONSE, STABILITY. Uni impulse funcion (Dirac dela funcion, dela funcion) rigorously defined is no sricly a funcion, bu disribuion (or measure), precise reamen requires

More information

Pade and Laguerre Approximations Applied. to the Active Queue Management Model. of Internet Protocol

Pade and Laguerre Approximations Applied. to the Active Queue Management Model. of Internet Protocol Applied Mahemaical Sciences, Vol. 7, 013, no. 16, 663-673 HIKARI Ld, www.m-hikari.com hp://dx.doi.org/10.1988/ams.013.39499 Pade and Laguerre Approximaions Applied o he Acive Queue Managemen Model of Inerne

More information

Introduction to Probability and Statistics Slides 4 Chapter 4

Introduction to Probability and Statistics Slides 4 Chapter 4 Inroducion o Probabiliy and Saisics Slides 4 Chaper 4 Ammar M. Sarhan, asarhan@mahsa.dal.ca Deparmen of Mahemaics and Saisics, Dalhousie Universiy Fall Semeser 8 Dr. Ammar Sarhan Chaper 4 Coninuous Random

More information

t 2 B F x,t n dsdt t u x,t dxdt

t 2 B F x,t n dsdt t u x,t dxdt Evoluion Equaions For 0, fixed, le U U0, where U denoes a bounded open se in R n.suppose ha U is filled wih a maerial in which a conaminan is being ranspored by various means including diffusion and convecion.

More information

d 1 = c 1 b 2 - b 1 c 2 d 2 = c 1 b 3 - b 1 c 3

d 1 = c 1 b 2 - b 1 c 2 d 2 = c 1 b 3 - b 1 c 3 and d = c b - b c c d = c b - b c c This process is coninued unil he nh row has been compleed. The complee array of coefficiens is riangular. Noe ha in developing he array an enire row may be divided or

More information

Families with no matchings of size s

Families with no matchings of size s Families wih no machings of size s Peer Franl Andrey Kupavsii Absrac Le 2, s 2 be posiive inegers. Le be an n-elemen se, n s. Subses of 2 are called families. If F ( ), hen i is called - uniform. Wha is

More information

Then. 1 The eigenvalues of A are inside R = n i=1 R i. 2 Union of any k circles not intersecting the other (n k)

Then. 1 The eigenvalues of A are inside R = n i=1 R i. 2 Union of any k circles not intersecting the other (n k) Ger sgorin Circle Chaper 9 Approimaing Eigenvalues Per-Olof Persson persson@berkeley.edu Deparmen of Mahemaics Universiy of California, Berkeley Mah 128B Numerical Analysis (Ger sgorin Circle) Le A be

More information

Section 3.5 Nonhomogeneous Equations; Method of Undetermined Coefficients

Section 3.5 Nonhomogeneous Equations; Method of Undetermined Coefficients Secion 3.5 Nonhomogeneous Equaions; Mehod of Undeermined Coefficiens Key Terms/Ideas: Linear Differenial operaor Nonlinear operaor Second order homogeneous DE Second order nonhomogeneous DE Soluion o homogeneous

More information

RANDOM LAGRANGE MULTIPLIERS AND TRANSVERSALITY

RANDOM LAGRANGE MULTIPLIERS AND TRANSVERSALITY ECO 504 Spring 2006 Chris Sims RANDOM LAGRANGE MULTIPLIERS AND TRANSVERSALITY 1. INTRODUCTION Lagrange muliplier mehods are sandard fare in elemenary calculus courses, and hey play a cenral role in economic

More information

Stochastic Structural Dynamics. Lecture-6

Stochastic Structural Dynamics. Lecture-6 Sochasic Srucural Dynamics Lecure-6 Random processes- Dr C S Manohar Deparmen of Civil Engineering Professor of Srucural Engineering Indian Insiue of Science Bangalore 560 0 India manohar@civil.iisc.erne.in

More information

di Bernardo, M. (1995). A purely adaptive controller to synchronize and control chaotic systems.

di Bernardo, M. (1995). A purely adaptive controller to synchronize and control chaotic systems. di ernardo, M. (995). A purely adapive conroller o synchronize and conrol chaoic sysems. hps://doi.org/.6/375-96(96)8-x Early version, also known as pre-prin Link o published version (if available):.6/375-96(96)8-x

More information

POSITIVE SOLUTIONS OF NEUTRAL DELAY DIFFERENTIAL EQUATION

POSITIVE SOLUTIONS OF NEUTRAL DELAY DIFFERENTIAL EQUATION Novi Sad J. Mah. Vol. 32, No. 2, 2002, 95-108 95 POSITIVE SOLUTIONS OF NEUTRAL DELAY DIFFERENTIAL EQUATION Hajnalka Péics 1, János Karsai 2 Absrac. We consider he scalar nonauonomous neural delay differenial

More information

Decentralized Stochastic Control with Partial History Sharing: A Common Information Approach

Decentralized Stochastic Control with Partial History Sharing: A Common Information Approach 1 Decenralized Sochasic Conrol wih Parial Hisory Sharing: A Common Informaion Approach Ashuosh Nayyar, Adiya Mahajan and Demoshenis Tenekezis arxiv:1209.1695v1 [cs.sy] 8 Sep 2012 Absrac A general model

More information

Solutions to Assignment 1

Solutions to Assignment 1 MA 2326 Differenial Equaions Insrucor: Peronela Radu Friday, February 8, 203 Soluions o Assignmen. Find he general soluions of he following ODEs: (a) 2 x = an x Soluion: I is a separable equaion as we

More information

Resource Allocation in Visible Light Communication Networks NOMA vs. OFDMA Transmission Techniques

Resource Allocation in Visible Light Communication Networks NOMA vs. OFDMA Transmission Techniques Resource Allocaion in Visible Ligh Communicaion Neworks NOMA vs. OFDMA Transmission Techniques Eirini Eleni Tsiropoulou, Iakovos Gialagkolidis, Panagiois Vamvakas, and Symeon Papavassiliou Insiue of Communicaions

More information

On Oscillation of a Generalized Logistic Equation with Several Delays

On Oscillation of a Generalized Logistic Equation with Several Delays Journal of Mahemaical Analysis and Applicaions 253, 389 45 (21) doi:1.16/jmaa.2.714, available online a hp://www.idealibrary.com on On Oscillaion of a Generalized Logisic Equaion wih Several Delays Leonid

More information

12: AUTOREGRESSIVE AND MOVING AVERAGE PROCESSES IN DISCRETE TIME. Σ j =

12: AUTOREGRESSIVE AND MOVING AVERAGE PROCESSES IN DISCRETE TIME. Σ j = 1: AUTOREGRESSIVE AND MOVING AVERAGE PROCESSES IN DISCRETE TIME Moving Averages Recall ha a whie noise process is a series { } = having variance σ. The whie noise process has specral densiy f (λ) = of

More information

Asymptotic Equipartition Property - Seminar 3, part 1

Asymptotic Equipartition Property - Seminar 3, part 1 Asympoic Equipariion Propery - Seminar 3, par 1 Ocober 22, 2013 Problem 1 (Calculaion of ypical se) To clarify he noion of a ypical se A (n) ε and he smalles se of high probabiliy B (n), we will calculae

More information

Games Against Nature

Games Against Nature Advanced Course in Machine Learning Spring 2010 Games Agains Naure Handous are joinly prepared by Shie Mannor and Shai Shalev-Shwarz In he previous lecures we alked abou expers in differen seups and analyzed

More information

Supplement for Stochastic Convex Optimization: Faster Local Growth Implies Faster Global Convergence

Supplement for Stochastic Convex Optimization: Faster Local Growth Implies Faster Global Convergence Supplemen for Sochasic Convex Opimizaion: Faser Local Growh Implies Faser Global Convergence Yi Xu Qihang Lin ianbao Yang Proof of heorem heorem Suppose Assumpion holds and F (w) obeys he LGC (6) Given

More information

Vanishing Viscosity Method. There are another instructive and perhaps more natural discontinuous solutions of the conservation law

Vanishing Viscosity Method. There are another instructive and perhaps more natural discontinuous solutions of the conservation law Vanishing Viscosiy Mehod. There are anoher insrucive and perhaps more naural disconinuous soluions of he conservaion law (1 u +(q(u x 0, he so called vanishing viscosiy mehod. This mehod consiss in viewing

More information

Block Diagram of a DCS in 411

Block Diagram of a DCS in 411 Informaion source Forma A/D From oher sources Pulse modu. Muliplex Bandpass modu. X M h: channel impulse response m i g i s i Digial inpu Digial oupu iming and synchronizaion Digial baseband/ bandpass

More information

Empirical Process Theory

Empirical Process Theory Empirical Process heory 4.384 ime Series Analysis, Fall 27 Reciaion by Paul Schrimpf Supplemenary o lecures given by Anna Mikusheva Ocober 7, 28 Reciaion 7 Empirical Process heory Le x be a real-valued

More information

On Measuring Pro-Poor Growth. 1. On Various Ways of Measuring Pro-Poor Growth: A Short Review of the Literature

On Measuring Pro-Poor Growth. 1. On Various Ways of Measuring Pro-Poor Growth: A Short Review of the Literature On Measuring Pro-Poor Growh 1. On Various Ways of Measuring Pro-Poor Growh: A Shor eview of he Lieraure During he pas en years or so here have been various suggesions concerning he way one should check

More information

MATH 128A, SUMMER 2009, FINAL EXAM SOLUTION

MATH 128A, SUMMER 2009, FINAL EXAM SOLUTION MATH 28A, SUMME 2009, FINAL EXAM SOLUTION BENJAMIN JOHNSON () (8 poins) [Lagrange Inerpolaion] (a) (4 poins) Le f be a funcion defined a some real numbers x 0,..., x n. Give a defining equaion for he Lagrange

More information

Intelligent Packet Dropping for Optimal Energy-Delay Tradeoffs in Wireless Downlinks

Intelligent Packet Dropping for Optimal Energy-Delay Tradeoffs in Wireless Downlinks PROC. OF 4TH INT. SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS NETWORKS (WIOPT), APRIL 2006 1 Inelligen Packe Dropping for Opimal Energy-Delay Tradeoffs in Wireless Downlinks

More information

Optima and Equilibria for Traffic Flow on a Network

Optima and Equilibria for Traffic Flow on a Network Opima and Equilibria for Traffic Flow on a Nework Albero Bressan Deparmen of Mahemaics, Penn Sae Universiy bressan@mah.psu.edu Albero Bressan (Penn Sae) Opima and equilibria for raffic flow 1 / 1 A Traffic

More information

Monotonic Solutions of a Class of Quadratic Singular Integral Equations of Volterra type

Monotonic Solutions of a Class of Quadratic Singular Integral Equations of Volterra type In. J. Conemp. Mah. Sci., Vol. 2, 27, no. 2, 89-2 Monoonic Soluions of a Class of Quadraic Singular Inegral Equaions of Volerra ype Mahmoud M. El Borai Deparmen of Mahemaics, Faculy of Science, Alexandria

More information

Monochromatic Infinite Sumsets

Monochromatic Infinite Sumsets Monochromaic Infinie Sumses Imre Leader Paul A. Russell July 25, 2017 Absrac WeshowhahereisaraionalvecorspaceV suchha,whenever V is finiely coloured, here is an infinie se X whose sumse X+X is monochromaic.

More information

Representation of Stochastic Process by Means of Stochastic Integrals

Representation of Stochastic Process by Means of Stochastic Integrals Inernaional Journal of Mahemaics Research. ISSN 0976-5840 Volume 5, Number 4 (2013), pp. 385-397 Inernaional Research Publicaion House hp://www.irphouse.com Represenaion of Sochasic Process by Means of

More information

Exercises: Similarity Transformation

Exercises: Similarity Transformation Exercises: Similariy Transformaion Problem. Diagonalize he following marix: A [ 2 4 Soluion. Marix A has wo eigenvalues λ 3 and λ 2 2. Since (i) A is a 2 2 marix and (ii) i has 2 disinc eigenvalues, we

More information

GCD AND LCM-LIKE IDENTITIES FOR IDEALS IN COMMUTATIVE RINGS

GCD AND LCM-LIKE IDENTITIES FOR IDEALS IN COMMUTATIVE RINGS GCD AND LCM-LIKE IDENTITIES FOR IDEALS IN COMMUTATIVE RINGS D. D. ANDERSON, SHUZO IZUMI, YASUO OHNO, AND MANABU OZAKI Absrac. Le A 1,..., A n n 2 be ideals of a commuaive ring R. Le Gk resp., Lk denoe

More information

0.1 MAXIMUM LIKELIHOOD ESTIMATION EXPLAINED

0.1 MAXIMUM LIKELIHOOD ESTIMATION EXPLAINED 0.1 MAXIMUM LIKELIHOOD ESTIMATIO EXPLAIED Maximum likelihood esimaion is a bes-fi saisical mehod for he esimaion of he values of he parameers of a sysem, based on a se of observaions of a random variable

More information