<C 2 2. λ 2 l. λ 1 l 1 < C 1

Size: px
Start display at page:

Download "<C 2 2. λ 2 l. λ 1 l 1 < C 1"

Transcription

1 Teecommunication Network Contro and Management (EE E694) Prof. A. A. Lazar Notes for the ecture of 7/Feb/95 by Huayan Wang (this document was ast LaT E X-ed on May 9,995) Queueing Primer for Muticass Optima Fow Contro In the previous ectures weintroduced the state dependent mode for optima decentraized ow contro in a muti-cass network, expained the concepts used there and outined an approach to sove the probem. We know that the probem has a neat soution which is a set of window poices. In this ecture we wi present a discussion of the appication of queueing theory to this probem. We consider a simpe case invoving two users (casses). We wi mainy cover three topics:. The equiibrium probabiities of a muti-cass M/M/ queue.. Norton's equivaent of the muti-cass system. 3. Soving Nash Equiibrium based on the Norton's equivaent. Equiibrium probabiities Reca that our state dependent ow contro probem is represented by Figure : <C N (FIFO) N < C whycu@ctr.coumbia.edu Figure : Mode for state dependent ow contro

2 EE E694: Lecture 4 The criterion used is : max E k T k Ek for user k, k. () We have to nd out the optima soution, which is the Nash equiibrium (see ecture 3 for the formuation of the probem). We focus on the midde queue of Figure. Note that there are two ows of trace feed into a botteneck queue, we ca it a muti-cass M/M/ queue. (FIFO) state X(x, x, x...) 3 Figure : The queueing system we have to contro Athough at rst ook it is quite simiar to an M/M/ queue, there is a signicant dierence which comes about because of packet dependent routing, i.e., the server has to distinguish between packets in order to decide where to route them. So the state of the muti-cass M/M/ queue is no onger simpy the numberofpackets in the system. In order to describe the state of a FCFS (rst come rst serve) queue with muti casses of trac it is necessary to specify the cass of the packets at each position. So the state of the queueing system of Figure is given by X (x x ::: x N ), where x i is the cass of the packet in position i and N is the tota number of packets in the queue. In our case here, we have ony two casses, then x i equas either or. We can think the state as a string. For exampe, one outcome of X ( :::) means the rst packet in the queueing system is cass packet, the second is cass, third cass, and so on. It is worthwhie noting that the string ength is variabe, and depends on how many packets are present inthe queueing system. The ength may gotoinnityifn is aowed to be innite. So soving these states expicity is very compicated. If we draw the state transition diagram, it is a two dimensiona Markov chain (see Figure 3). Note that in the state string, the eftmost one is going to depart, and an arriva goes to the rightmost position, then it is easy to write down the corresponding transition rates in Figure 3. Note that the state transition diagram often dispays singe transitions (bidirectiona transitions on the boundaries ony) and we certainy cannot expect the

3 EE E694: Lecture 4 3,,,,,,,,,,,,,,,,,,,, Figure 3: State transition diagram (fu information case) Markov chain to be reversibe. Let us ook at a pain M/M/ queue for a moment. Its state diagram has bidirectiona transitions between each pair of adjacent states. This Markov chain is reversibe and oca baance equations hod, which means rather than soving the goba baance equations for each state, we can draw vertica boundaries between each pair of adjacent states and equate the ow from eft to right across such a boundary to the ow from right to eft, which eads to a set of oca baance equations. Then it is very easy to get the product form soution of the M/M/ queue p n () n p, where p can be soved by the normaization equation. i- i i+ j- j j+ Goba baance boundary around a state Loca baance boundaries between states Figure 4: Baance boundaries for M/M/ queue Coming back to the state transition diagram of our probem, we cannot think of a vertica boundary between two states since there is ony one directiona ow to/from some states. And the diagram is so compicated (the number of states increases exponentiay with the number of packets) that it is dicut to sove

4 EE E694: Lecture 4 4 the goba baance equations. Note that if the queue is innitey arge, i.e., has unimited capacity, the goba baance equations are innite in number! To approach this kind of a probem (which arises very often in the network), a very usefu way is to PLUG in a GOOD GUESS. Quite naturay a good guess here is a product form soution. One way to obtain the product form soution is based on a method caed agebraic topoogica interpretation (ATI) of the product form soution (pease see reference [6] for more detai). This method expains why certain modes have a product form soution and why others do not, more importanty, itgives a constructive means for arriving at the product form soution. The basic idea is the reaization that the state transition diagrams of product form networks can be decomposed into an aggregation of eementary \buiding bocks" which do not interact with each other in a substantia way, andthuscanbesoved in isoation for the reative state probabiities. The product form soution, then, for a specic equiibrium state probabiity in terms of a reference probabiity is reay a recursion that patches together these buiding bock soutions aong a \path" from the state of interest back to the reference state which usuay is the state. To isoate the buiding bock and to construct the soution aong a path to a reference state is the essence of the product form soution. We wiook at this idea cosey using our probem as an exampe. Buiding bocks have a very important propertywhich is that they can be embedded into the overa state transition diagram without aecting the ow pattern of the rest of the diagram, except for a renormaization. It can be shown that a cycic ow, which is an isoated circuation in the form of a singe cyce is one kind of buiding bock. For exampe, consider the subset of the state transition diagram which consists of states f, (,),, (,)g, the state transition sequence! ( )!! ( )! is a cycic ow of ength four. By the property of buiding bocks, the conservation of this ow ateach adjacent state sti hods even when the edges are embedded into the overa state transition diagram. Thus the reative equiibrium probabiities for these states can be soved in isoation without considering the rest of the state transition diagram. Look at the rst two stages of our state transition diagram, we can separate them into six buiding bocks. Denote X as the equiibrium probabiity of state X, we can easiy write down the baance equations across the boundaries (see Figure 5). Then it is easy to sove the oca baance equations to get the equiibrium probabiities: :

5 EE E694: Lecture 4 5 (3), () π π () π π (5) (6) (3) π π (), (4) π π (), (7) (8) (5) π π (6) π π (7) π π Loca baance boundaries (4), (8) π π corresponding oca baance equations Figure 5: Buiding bocks for the state transition diagram By inspection, we can see that for a specic state, the product form soution coecient is just the product of the 's on the way towards the state from that specic state, over the product of corresponding numbers of 's. In the third stage, we can see there are two cycic ows of ength two (on the boundaries) and another two of ength six. For exampe f( )! ( )! ( )! ( )! ( )! ( )! ( )g is a cycic ow of ength six. It is not dicut to work out the equiibrium probabiities for that stage: : We can appy this method iterativey to sove a the states. One more thing we need to point out is that any pathbetween two states woud have produced the same resuts. It is not dicut to verify by an exampe (readers are encouraged to do it as an exercise). The idea is simiar to the concept of potentias in the circuit theory: Given a reference point, the potentia of each point on the circuit is xed no matter which oopyou choose to cacuate them. Now we are happy that our system has a nice product form soution. We can write down a the probabiities by inspection of the state diagram. The

6 EE E694: Lecture 4 6 average throughput, the average time deay, and other quantities of interest that characterize the queueing system of Figure can be computed in terms of these probabiities. But ook at the notation of our soution, we have to specify a the 's in the coecient since their super- and sub- scripts are a dierent! In the next section we wi show that for the purpose of computing averages needed in our optimization probem, it is sucient to consider the Norton's equivaent of this system. This approach reduces the notationa compexity of the equations invoved and masks the unnecessary detais and iuminates the structure of the soution to our probem. Norton's equivaent Simpy speaking, Norton theorem states that if we are interested in the endto-end properties (time deay and throughput) between two points S and D, we can repace the queueing network by a singe state dependent queue with no change in the statistic behavior between points S and D. Norton's equivaent (sometimes caed aggregation method) can provide an extremey vauabe simpication in most cases. The queueing mode described above provides a detaied state description. But as far as our controer concerned, since it is more reaistic to assume knowing how many packets are in the system (outstanding) rather than knowing the exact position of each packets in the system. As we mentioned in ecture 3, there is a trade o between information reduction and contro quaity. Based on this observation, we ook for a Norton's equivaent of the origina muti-cass queueing system by aggregating the appropriate states. We dene a set of states S( )by S( )fxj number of cass k packets k k g: Now we get a more compact state transition diagram: Let us work out the equiibrium probabiities and transition rates here. Denote p as the equiibrium probabiity ofstates( ), then Obviousy we have p X xs( ) x : p p p p p p + p p p :

7 EE E694: Lecture 4 7, /3 /,,, / /3, /3 /,, /, /3, Figure 6: State transition diagram after aggregation So the transition rate from S(,) to S(,) (or S(,)) is /, which makes sense because at state S(,), there are two packets in the system, the chance of each one of them getting served is one haf. Simiary, consider p p 3 p 3 p the transition rate from S(,) to S(,) is /3, whie from S(,) to S(,) is /3. By iteration, we can show that where p is given by: p + Y ; ( ; i ) ( j )p () XN XN i p : It is not dicut to see the intuition behind the equation where the binomia coecient comes because there are so many ways from state S( )to reach reference state, and the products specify the path. Note that the state probabiities of S( ) are aso of product form. In the end the state transition diagram after aggregation has transitions for cass and arrivas respectivey, and ( +), ( + ) for departures respectivey (see Figure 6). Observe the state transition diagram after aggregation, there are bidirectiona transitions between each pair of adjacent states, we can write the oca Y j

8 EE E694: Lecture 4 8 baance equations directy from the diagram : p p + (3) p p + : (4) Note that we start with a network (Figure 7), and we get its Norton's equivaent (Figure 8). (FIFO) state X(x, x, x...) 3 Figure 7: The origina queueing system ν + ν + state (, ) Figure 8: Norton's equivaent for the origina queueing system It is important to note that because of the existence of product form soution of the origina network, its Norton's equivaent aso has a product form soution! Athough we soved the Norton's equivaent expicity in this case, we woud ike introduce the mathematica structure of the aggregation procedure and provide a probabiistic interpretation for Norton's equivaent since it is used so often in the communication network that it is important to understand it very we. Observing the aggregation from Figure 7 to Figure 8, actuay there is an estimation procedure invoved here: Estimate the rate at which the server processes cass or packets in state ( ) (or equivaenty to say knowing and ), which is exacty the idea of Norton's equivaent in the set up of muti-cass queueing network. [] showed that the Norton's equivaent of muti-cass queueing network can be interpretated as a conditiona estimate. In our exampe here, assume that ( )isknown, dene k E[ k There are a tota of and cass and packets in the system respectivey ] (5)

9 EE E694: Lecture 4 9 where k is the instantaneous departure rate of cass k packets, k (x k) k + ( + > ): (6) where () is the indicator function. This is the actua service rate seen by the cass k packets. For exampe, for M/M/ queue the actua service rate is (n >), where n is the state of M/M/ queue. Pug into equation 5, we get k E[ k j ] (7) k E[ ( + > ) j ] (8) + k + ( + > ) (9) which is exacty what we worked out before. Notice that the service rate in the equivaentnetworkisnow cass dependent, which is sort of counter-intuitive, but it exacty ts the idea of the packet dependent routing we mentioned before. Now we wi show that in terms of computing average network throughput and time deay, using Norton's equivaent wi yied the same resut. E XN XN XN XN ( + )p () ( + > )( + )p + + () XN XN XN XN ( + > ) p () (x >) X xs( ) x (3) X a x (x >) x : (4) The ast expression is exacty the average throughput of the system in terms of the fu information states. We can work out the average deay in the same manner. Up to now whatwe end up with is Figure 8. But the rea situation is that user k ony has the partia information k,not( ). So the next step is to nd the service rate of the system as far as user k is concerned. Without oss of generaity, et us consider user here. Use the same technique as above, dene ^ E[ jthere are tota of cass packets in the system]: (5)

10 EE E694: Lecture 4 Then we get an equivaent system based on oca information (decentraization): Figure 9: Decentraized equivaent mode of the origina system In summary,we reduce our probem by atwo step procedure: state aggregation X (, ) information reduction knowing ess decentraization fu information what controer knows Figure : Two step procedure of information reduction Notice that we aggregate a the information into the service rate ^,which is certainy a function of since it is the interference. It can be proved that ^ does not depend on (pease see [4] for the proof), so we can appy our contro poicy based on the estimation of ^.Intuitivey it shoud be true since from the point of view of user, sending Poisson packets into the system shoud not aect the response of the system according to the Markovian property of the arrivas. And practicay speaking, it is a reasonabe approximation of the system. In the rea network we can estimate the service rate by observing the number of outstanding packets and the acknowedgements received. Now we wi show that in terms of computing average network throughput and time deay, using Norton's equivaent (Figure 9) wi get the same resut. Denote the margina probabiity P P as the probabiity that there are cass N packets in the system. Then p p. As far as user is concerned, E XN ^ p (6) XN E[ j ]p (7) XN XN p p p (8)

11 EE E694: Lecture 4 XN XN p : (9) The ast expression is exacty the average throughput for user if we use the rst step Norton's equivaent (see Figure 8). Simiary we can work out the average time deay. So we showed that the mode of Figure 9 is indeed equivaent to the origina system in terms of statistic properties (average throughput and time deay). 3 Nash equiibrium We showed that the origina probem Figure is equivaent to considering the two separate queues, each of the form: κ κ <C k k k < N k Figure : Decentraized equivaent mode of the origina system We want to optimize the ow contro under the criterion: max E k T k Ek for user k, k,. Remember in ecture, we aready soved this probem in the M/M/ case. But note in this case the service rate is no onger a constant, here^ k is state dependent. Fortunatey it can be proved by inear programming that the optima ow contro poicy is sti window type. For user k, the optima ow contro is of the form: k k 8 < : c k k m k <L k k L k k >L k for some L k <N k, k m ck, k (See ecture 3). Nash equiibrium is a pair of windows! It is a very neat resut: whatever other users do, user k aways uses window poicy, but the window size depends on the network oad. Now we soved our probem. But there are sti ots of question marks eft. Athough it can be shown that Nash equiibrium is unique respect to one window poicy (if a other users are frozen), but dynamicy, the soution is not unique. Each user has to tune its own window size according to other users. So can we

12 EE E694: Lecture 4 compute the Nash equiibrium in this case? How canwe appy it in the rea networks? Either we have tohave a good estimator to estimate the rate, or we can write some agorithms to try to nd the optima soution. Peope did ots of work on it and there do exist some decentraized agorithms. But there is sti many probems associated with the agorithm: Is it convergent? Is it convergent to exacty Nash equiibrium? How to dea with od data due to deay... We wi tak about these in more detai in the next ecture. References [] M.-T. T. Hsiao and A. A. Lazar, \Botteneck Modeing and Decentraized Optima Fow Contro II. Individua Objectives," in Proceedings of the 9 th Conference on Information Sciences and Systems, (Batimore, MD), Mar [] M.-T. T. Hsiao and A. A. Lazar, \An Extension to Norton's Equivaent," vo. 5, pp. 4{4, 989. [3] M.-T. T. Hsiao and A. A. Lazar, \Optima Fow Contro of Muticass Queueing Networks with Partia Information," IEEE Trans. Autom. Contro, vo. 35, pp. 855{86, Juy 99. [4] M.-T. T. Hsiao and A. A. Lazar, \Optima Decentraized Fow Contro of Markovian Queueing Networks with Mutipe Controers," Performance Evauation, vo. 3, no. 3, pp. 8{4, 99. [5] Y. A. Koriis and A. A. Lazar, \On the Existence of Equiibria in Noncooperative Optima Fow Contro," in Proceedings of the ITC Sponsored Seminar, (Bangaore, India), pp. 43{5, Indian Institute of Science, November 993. [6] T. G. Robertazzi, Computer Networks and Systems { Queueing Theory and Performance Evauation. NewYork: Springer-Verag, 994.

Stochastic Complement Analysis of Multi-Server Threshold Queues. with Hysteresis. Abstract

Stochastic Complement Analysis of Multi-Server Threshold Queues. with Hysteresis. Abstract Stochastic Compement Anaysis of Muti-Server Threshod Queues with Hysteresis John C.S. Lui The Dept. of Computer Science & Engineering The Chinese University of Hong Kong Leana Goubchik Dept. of Computer

More information

CS229 Lecture notes. Andrew Ng

CS229 Lecture notes. Andrew Ng CS229 Lecture notes Andrew Ng Part IX The EM agorithm In the previous set of notes, we taked about the EM agorithm as appied to fitting a mixture of Gaussians. In this set of notes, we give a broader view

More information

Separation of Variables and a Spherical Shell with Surface Charge

Separation of Variables and a Spherical Shell with Surface Charge Separation of Variabes and a Spherica She with Surface Charge In cass we worked out the eectrostatic potentia due to a spherica she of radius R with a surface charge density σθ = σ cos θ. This cacuation

More information

A Brief Introduction to Markov Chains and Hidden Markov Models

A Brief Introduction to Markov Chains and Hidden Markov Models A Brief Introduction to Markov Chains and Hidden Markov Modes Aen B MacKenzie Notes for December 1, 3, &8, 2015 Discrete-Time Markov Chains You may reca that when we first introduced random processes,

More information

A. Distribution of the test statistic

A. Distribution of the test statistic A. Distribution of the test statistic In the sequentia test, we first compute the test statistic from a mini-batch of size m. If a decision cannot be made with this statistic, we keep increasing the mini-batch

More information

Throughput Optimal Scheduling for Wireless Downlinks with Reconfiguration Delay

Throughput Optimal Scheduling for Wireless Downlinks with Reconfiguration Delay Throughput Optima Scheduing for Wireess Downinks with Reconfiguration Deay Vineeth Baa Sukumaran vineethbs@gmai.com Department of Avionics Indian Institute of Space Science and Technoogy. Abstract We consider

More information

Cryptanalysis of PKP: A New Approach

Cryptanalysis of PKP: A New Approach Cryptanaysis of PKP: A New Approach Éiane Jaumes and Antoine Joux DCSSI 18, rue du Dr. Zamenhoff F-92131 Issy-es-Mx Cedex France eiane.jaumes@wanadoo.fr Antoine.Joux@ens.fr Abstract. Quite recenty, in

More information

MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES

MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES Separation of variabes is a method to sove certain PDEs which have a warped product structure. First, on R n, a inear PDE of order m is

More information

Asynchronous Control for Coupled Markov Decision Systems

Asynchronous Control for Coupled Markov Decision Systems INFORMATION THEORY WORKSHOP (ITW) 22 Asynchronous Contro for Couped Marov Decision Systems Michae J. Neey University of Southern Caifornia Abstract This paper considers optima contro for a coection of

More information

Multi-server queueing systems with multiple priority classes

Multi-server queueing systems with multiple priority classes Muti-server queueing systems with mutipe priority casses Mor Harcho-Bater Taayui Osogami Aan Scheer-Wof Adam Wierman Abstract We present the first near-exact anaysis of an M/PH/ queue with m > 2 preemptive-resume

More information

Math 124B January 31, 2012

Math 124B January 31, 2012 Math 124B January 31, 212 Viktor Grigoryan 7 Inhomogeneous boundary vaue probems Having studied the theory of Fourier series, with which we successfuy soved boundary vaue probems for the homogeneous heat

More information

MARKOV CHAINS AND MARKOV DECISION THEORY. Contents

MARKOV CHAINS AND MARKOV DECISION THEORY. Contents MARKOV CHAINS AND MARKOV DECISION THEORY ARINDRIMA DATTA Abstract. In this paper, we begin with a forma introduction to probabiity and expain the concept of random variabes and stochastic processes. After

More information

Bayesian Learning. You hear a which which could equally be Thanks or Tanks, which would you go with?

Bayesian Learning. You hear a which which could equally be Thanks or Tanks, which would you go with? Bayesian Learning A powerfu and growing approach in machine earning We use it in our own decision making a the time You hear a which which coud equay be Thanks or Tanks, which woud you go with? Combine

More information

LECTURE NOTES 9 TRACELESS SYMMETRIC TENSOR APPROACH TO LEGENDRE POLYNOMIALS AND SPHERICAL HARMONICS

LECTURE NOTES 9 TRACELESS SYMMETRIC TENSOR APPROACH TO LEGENDRE POLYNOMIALS AND SPHERICAL HARMONICS MASSACHUSETTS INSTITUTE OF TECHNOLOGY Physics Department Physics 8.07: Eectromagnetism II October 7, 202 Prof. Aan Guth LECTURE NOTES 9 TRACELESS SYMMETRIC TENSOR APPROACH TO LEGENDRE POLYNOMIALS AND SPHERICAL

More information

Explicit overall risk minimization transductive bound

Explicit overall risk minimization transductive bound 1 Expicit overa risk minimization transductive bound Sergio Decherchi, Paoo Gastado, Sandro Ridea, Rodofo Zunino Dept. of Biophysica and Eectronic Engineering (DIBE), Genoa University Via Opera Pia 11a,

More information

Gauss Law. 2. Gauss s Law: connects charge and field 3. Applications of Gauss s Law

Gauss Law. 2. Gauss s Law: connects charge and field 3. Applications of Gauss s Law Gauss Law 1. Review on 1) Couomb s Law (charge and force) 2) Eectric Fied (fied and force) 2. Gauss s Law: connects charge and fied 3. Appications of Gauss s Law Couomb s Law and Eectric Fied Couomb s

More information

T.C. Banwell, S. Galli. {bct, Telcordia Technologies, Inc., 445 South Street, Morristown, NJ 07960, USA

T.C. Banwell, S. Galli. {bct, Telcordia Technologies, Inc., 445 South Street, Morristown, NJ 07960, USA ON THE SYMMETRY OF THE POWER INE CHANNE T.C. Banwe, S. Gai {bct, sgai}@research.tecordia.com Tecordia Technoogies, Inc., 445 South Street, Morristown, NJ 07960, USA Abstract The indoor power ine network

More information

AST 418/518 Instrumentation and Statistics

AST 418/518 Instrumentation and Statistics AST 418/518 Instrumentation and Statistics Cass Website: http://ircamera.as.arizona.edu/astr_518 Cass Texts: Practica Statistics for Astronomers, J.V. Wa, and C.R. Jenkins, Second Edition. Measuring the

More information

6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17. Solution 7

6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17. Solution 7 6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17 Soution 7 Probem 1: Generating Random Variabes Each part of this probem requires impementation in MATLAB. For the

More information

Stochastic Automata Networks (SAN) - Modelling. and Evaluation. Paulo Fernandes 1. Brigitte Plateau 2. May 29, 1997

Stochastic Automata Networks (SAN) - Modelling. and Evaluation. Paulo Fernandes 1. Brigitte Plateau 2. May 29, 1997 Stochastic utomata etworks (S) - Modeing and Evauation Pauo Fernandes rigitte Pateau 2 May 29, 997 Institut ationa Poytechnique de Grenobe { IPG Ecoe ationae Superieure d'informatique et de Mathematiques

More information

VI.G Exact free energy of the Square Lattice Ising model

VI.G Exact free energy of the Square Lattice Ising model VI.G Exact free energy of the Square Lattice Ising mode As indicated in eq.(vi.35), the Ising partition function is reated to a sum S, over coections of paths on the attice. The aowed graphs for a square

More information

Chemical Kinetics Part 2

Chemical Kinetics Part 2 Integrated Rate Laws Chemica Kinetics Part 2 The rate aw we have discussed thus far is the differentia rate aw. Let us consider the very simpe reaction: a A à products The differentia rate reates the rate

More information

Scalable Spectrum Allocation for Large Networks Based on Sparse Optimization

Scalable Spectrum Allocation for Large Networks Based on Sparse Optimization Scaabe Spectrum ocation for Large Networks ased on Sparse Optimization innan Zhuang Modem R&D Lab Samsung Semiconductor, Inc. San Diego, C Dongning Guo, Ermin Wei, and Michae L. Honig Department of Eectrica

More information

Lecture Note 3: Stationary Iterative Methods

Lecture Note 3: Stationary Iterative Methods MATH 5330: Computationa Methods of Linear Agebra Lecture Note 3: Stationary Iterative Methods Xianyi Zeng Department of Mathematica Sciences, UTEP Stationary Iterative Methods The Gaussian eimination (or

More information

Reliability: Theory & Applications No.3, September 2006

Reliability: Theory & Applications No.3, September 2006 REDUNDANCY AND RENEWAL OF SERVERS IN OPENED QUEUING NETWORKS G. Sh. Tsitsiashvii M.A. Osipova Vadivosto, Russia 1 An opened queuing networ with a redundancy and a renewa of servers is considered. To cacuate

More information

STA 216 Project: Spline Approach to Discrete Survival Analysis

STA 216 Project: Spline Approach to Discrete Survival Analysis : Spine Approach to Discrete Surviva Anaysis November 4, 005 1 Introduction Athough continuous surviva anaysis differs much from the discrete surviva anaysis, there is certain ink between the two modeing

More information

Unconditional security of differential phase shift quantum key distribution

Unconditional security of differential phase shift quantum key distribution Unconditiona security of differentia phase shift quantum key distribution Kai Wen, Yoshihisa Yamamoto Ginzton Lab and Dept of Eectrica Engineering Stanford University Basic idea of DPS-QKD Protoco. Aice

More information

C. Fourier Sine Series Overview

C. Fourier Sine Series Overview 12 PHILIP D. LOEWEN C. Fourier Sine Series Overview Let some constant > be given. The symboic form of the FSS Eigenvaue probem combines an ordinary differentia equation (ODE) on the interva (, ) with a

More information

XSAT of linear CNF formulas

XSAT of linear CNF formulas XSAT of inear CN formuas Bernd R. Schuh Dr. Bernd Schuh, D-50968 Kön, Germany; bernd.schuh@netcoogne.de eywords: compexity, XSAT, exact inear formua, -reguarity, -uniformity, NPcompeteness Abstract. Open

More information

Age of Information: The Gamma Awakening

Age of Information: The Gamma Awakening Age of Information: The Gamma Awakening Eie Najm and Rajai Nasser LTHI, EPFL, Lausanne, Switzerand Emai: {eie.najm, rajai.nasser}@epf.ch arxiv:604.086v [cs.it] 5 Apr 06 Abstract Status update systems is

More information

Copyright information to be inserted by the Publishers. Unsplitting BGK-type Schemes for the Shallow. Water Equations KUN XU

Copyright information to be inserted by the Publishers. Unsplitting BGK-type Schemes for the Shallow. Water Equations KUN XU Copyright information to be inserted by the Pubishers Unspitting BGK-type Schemes for the Shaow Water Equations KUN XU Mathematics Department, Hong Kong University of Science and Technoogy, Cear Water

More information

Problem Set 6: Solutions

Problem Set 6: Solutions University of Aabama Department of Physics and Astronomy PH 102 / LeCair Summer II 2010 Probem Set 6: Soutions 1. A conducting rectanguar oop of mass M, resistance R, and dimensions w by fas from rest

More information

Chemical Kinetics Part 2. Chapter 16

Chemical Kinetics Part 2. Chapter 16 Chemica Kinetics Part 2 Chapter 16 Integrated Rate Laws The rate aw we have discussed thus far is the differentia rate aw. Let us consider the very simpe reaction: a A à products The differentia rate reates

More information

Nonlinear Analysis of Spatial Trusses

Nonlinear Analysis of Spatial Trusses Noninear Anaysis of Spatia Trusses João Barrigó October 14 Abstract The present work addresses the noninear behavior of space trusses A formuation for geometrica noninear anaysis is presented, which incudes

More information

FOURIER SERIES ON ANY INTERVAL

FOURIER SERIES ON ANY INTERVAL FOURIER SERIES ON ANY INTERVAL Overview We have spent considerabe time earning how to compute Fourier series for functions that have a period of 2p on the interva (-p,p). We have aso seen how Fourier series

More information

Centralized Coded Caching of Correlated Contents

Centralized Coded Caching of Correlated Contents Centraized Coded Caching of Correated Contents Qianqian Yang and Deniz Gündüz Information Processing and Communications Lab Department of Eectrica and Eectronic Engineering Imperia Coege London arxiv:1711.03798v1

More information

A Novel Learning Method for Elman Neural Network Using Local Search

A Novel Learning Method for Elman Neural Network Using Local Search Neura Information Processing Letters and Reviews Vo. 11, No. 8, August 2007 LETTER A Nove Learning Method for Eman Neura Networ Using Loca Search Facuty of Engineering, Toyama University, Gofuu 3190 Toyama

More information

Applied Nuclear Physics (Fall 2006) Lecture 7 (10/2/06) Overview of Cross Section Calculation

Applied Nuclear Physics (Fall 2006) Lecture 7 (10/2/06) Overview of Cross Section Calculation 22.101 Appied Nucear Physics (Fa 2006) Lecture 7 (10/2/06) Overview of Cross Section Cacuation References P. Roman, Advanced Quantum Theory (Addison-Wesey, Reading, 1965), Chap 3. A. Foderaro, The Eements

More information

Lecture 9. Stability of Elastic Structures. Lecture 10. Advanced Topic in Column Buckling

Lecture 9. Stability of Elastic Structures. Lecture 10. Advanced Topic in Column Buckling Lecture 9 Stabiity of Eastic Structures Lecture 1 Advanced Topic in Coumn Bucking robem 9-1: A camped-free coumn is oaded at its tip by a oad. The issue here is to find the itica bucking oad. a) Suggest

More information

An approximate method for solving the inverse scattering problem with fixed-energy data

An approximate method for solving the inverse scattering problem with fixed-energy data J. Inv. I-Posed Probems, Vo. 7, No. 6, pp. 561 571 (1999) c VSP 1999 An approximate method for soving the inverse scattering probem with fixed-energy data A. G. Ramm and W. Scheid Received May 12, 1999

More information

Lecture 6: Moderately Large Deflection Theory of Beams

Lecture 6: Moderately Large Deflection Theory of Beams Structura Mechanics 2.8 Lecture 6 Semester Yr Lecture 6: Moderatey Large Defection Theory of Beams 6.1 Genera Formuation Compare to the cassica theory of beams with infinitesima deformation, the moderatey

More information

Power Control and Transmission Scheduling for Network Utility Maximization in Wireless Networks

Power Control and Transmission Scheduling for Network Utility Maximization in Wireless Networks ower Contro and Transmission Scheduing for Network Utiity Maximization in Wireess Networks Min Cao, Vivek Raghunathan, Stephen Hany, Vinod Sharma and. R. Kumar Abstract We consider a joint power contro

More information

Stochastic Automata Networks: Product Forms and Iterative Solutions.

Stochastic Automata Networks: Product Forms and Iterative Solutions. INSTITUT NATIONAL DE REHERHE EN INFORMATIQUE ET EN AUTOMATIQUE Stochastic Automata Networks: Product Forms and Iterative Soutions. rigitte Pateau and Wiiam J. Stewart N 2939 2 juiet 996 THÈME apport de

More information

BALANCING REGULAR MATRIX PENCILS

BALANCING REGULAR MATRIX PENCILS BALANCING REGULAR MATRIX PENCILS DAMIEN LEMONNIER AND PAUL VAN DOOREN Abstract. In this paper we present a new diagona baancing technique for reguar matrix pencis λb A, which aims at reducing the sensitivity

More information

A Survey on Delay-Aware Resource Control. for Wireless Systems Large Deviation Theory, Stochastic Lyapunov Drift and Distributed Stochastic Learning

A Survey on Delay-Aware Resource Control. for Wireless Systems Large Deviation Theory, Stochastic Lyapunov Drift and Distributed Stochastic Learning A Survey on Deay-Aware Resource Contro 1 for Wireess Systems Large Deviation Theory, Stochastic Lyapunov Drift and Distributed Stochastic Learning arxiv:1110.4535v1 [cs.pf] 20 Oct 2011 Ying Cui Vincent

More information

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 15, NO. 2, FEBRUARY

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 15, NO. 2, FEBRUARY IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 5, NO. 2, FEBRUARY 206 857 Optima Energy and Data Routing in Networks With Energy Cooperation Berk Gurakan, Student Member, IEEE, OmurOze,Member, IEEE,

More information

Intuitionistic Fuzzy Optimization Technique for Nash Equilibrium Solution of Multi-objective Bi-Matrix Games

Intuitionistic Fuzzy Optimization Technique for Nash Equilibrium Solution of Multi-objective Bi-Matrix Games Journa of Uncertain Systems Vo.5, No.4, pp.27-285, 20 Onine at: www.jus.org.u Intuitionistic Fuzzy Optimization Technique for Nash Equiibrium Soution of Muti-objective Bi-Matri Games Prasun Kumar Naya,,

More information

Equilibrium of Heterogeneous Congestion Control Protocols

Equilibrium of Heterogeneous Congestion Control Protocols Equiibrium of Heterogeneous Congestion Contro Protocos Ao Tang Jiantao Wang Steven H. Low EAS Division, Caifornia Institute of Technoogy Mung Chiang EE Department, Princeton University Abstract When heterogeneous

More information

Problem set 6 The Perron Frobenius theorem.

Problem set 6 The Perron Frobenius theorem. Probem set 6 The Perron Frobenius theorem. Math 22a4 Oct 2 204, Due Oct.28 In a future probem set I want to discuss some criteria which aow us to concude that that the ground state of a sef-adjoint operator

More information

An Algorithm for Pruning Redundant Modules in Min-Max Modular Network

An Algorithm for Pruning Redundant Modules in Min-Max Modular Network An Agorithm for Pruning Redundant Modues in Min-Max Moduar Network Hui-Cheng Lian and Bao-Liang Lu Department of Computer Science and Engineering, Shanghai Jiao Tong University 1954 Hua Shan Rd., Shanghai

More information

12.2. Maxima and Minima. Introduction. Prerequisites. Learning Outcomes

12.2. Maxima and Minima. Introduction. Prerequisites. Learning Outcomes Maima and Minima 1. Introduction In this Section we anayse curves in the oca neighbourhood of a stationary point and, from this anaysis, deduce necessary conditions satisfied by oca maima and oca minima.

More information

Appendix for Stochastic Gradient Monomial Gamma Sampler

Appendix for Stochastic Gradient Monomial Gamma Sampler 3 4 5 6 7 8 9 3 4 5 6 7 8 9 3 4 5 6 7 8 9 3 3 3 33 34 35 36 37 38 39 4 4 4 43 44 45 46 47 48 49 5 5 5 53 54 Appendix for Stochastic Gradient Monomia Gamma Samper A The Main Theorem We provide the foowing

More information

Competitive Diffusion in Social Networks: Quality or Seeding?

Competitive Diffusion in Social Networks: Quality or Seeding? Competitive Diffusion in Socia Networks: Quaity or Seeding? Arastoo Fazei Amir Ajorou Ai Jadbabaie arxiv:1503.01220v1 [cs.gt] 4 Mar 2015 Abstract In this paper, we study a strategic mode of marketing and

More information

8 Digifl'.11 Cth:uits and devices

8 Digifl'.11 Cth:uits and devices 8 Digif'. Cth:uits and devices 8. Introduction In anaog eectronics, votage is a continuous variabe. This is usefu because most physica quantities we encounter are continuous: sound eves, ight intensity,

More information

Expectation-Maximization for Estimating Parameters for a Mixture of Poissons

Expectation-Maximization for Estimating Parameters for a Mixture of Poissons Expectation-Maximization for Estimating Parameters for a Mixture of Poissons Brandon Maone Department of Computer Science University of Hesini February 18, 2014 Abstract This document derives, in excrutiating

More information

LECTURE NOTES 8 THE TRACELESS SYMMETRIC TENSOR EXPANSION AND STANDARD SPHERICAL HARMONICS

LECTURE NOTES 8 THE TRACELESS SYMMETRIC TENSOR EXPANSION AND STANDARD SPHERICAL HARMONICS MASSACHUSETTS INSTITUTE OF TECHNOLOGY Physics Department Physics 8.07: Eectromagnetism II October, 202 Prof. Aan Guth LECTURE NOTES 8 THE TRACELESS SYMMETRIC TENSOR EXPANSION AND STANDARD SPHERICAL HARMONICS

More information

Lobontiu: System Dynamics for Engineering Students Website Chapter 3 1. z b z

Lobontiu: System Dynamics for Engineering Students Website Chapter 3 1. z b z Chapter W3 Mechanica Systems II Introduction This companion website chapter anayzes the foowing topics in connection to the printed-book Chapter 3: Lumped-parameter inertia fractions of basic compiant

More information

SEMINAR 2. PENDULUMS. V = mgl cos θ. (2) L = T V = 1 2 ml2 θ2 + mgl cos θ, (3) d dt ml2 θ2 + mgl sin θ = 0, (4) θ + g l

SEMINAR 2. PENDULUMS. V = mgl cos θ. (2) L = T V = 1 2 ml2 θ2 + mgl cos θ, (3) d dt ml2 θ2 + mgl sin θ = 0, (4) θ + g l Probem 7. Simpe Penduum SEMINAR. PENDULUMS A simpe penduum means a mass m suspended by a string weightess rigid rod of ength so that it can swing in a pane. The y-axis is directed down, x-axis is directed

More information

Solution of Wave Equation by the Method of Separation of Variables Using the Foss Tools Maxima

Solution of Wave Equation by the Method of Separation of Variables Using the Foss Tools Maxima Internationa Journa of Pure and Appied Mathematics Voume 117 No. 14 2017, 167-174 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-ine version) ur: http://www.ijpam.eu Specia Issue ijpam.eu Soution

More information

(1 ) = 1 for some 2 (0; 1); (1 + ) = 0 for some > 0:

(1 ) = 1 for some 2 (0; 1); (1 + ) = 0 for some > 0: Answers, na. Economics 4 Fa, 2009. Christiano.. The typica househod can engage in two types of activities producing current output and studying at home. Athough time spent on studying at home sacrices

More information

NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION

NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION Hsiao-Chang Chen Dept. of Systems Engineering University of Pennsyvania Phiadephia, PA 904-635, U.S.A. Chun-Hung Chen

More information

Arbitrary Throughput Versus Complexity Tradeoffs in Wireless Networks using Graph Partitioning

Arbitrary Throughput Versus Complexity Tradeoffs in Wireless Networks using Graph Partitioning University of Pennsyvania SchoaryCommons Departmenta Papers (ESE) Department of Eectrica & Systems Engineering November 2006 Arbitrary Throughput Versus Compexity Tradeoffs in Wireess Networks using Graph

More information

Atomic Hierarchical Routing Games in Communication Networks

Atomic Hierarchical Routing Games in Communication Networks Atomic Hierarchica Routing Games in Communication etworks Vijay Kambe, Eitan Atman, Rachid E-Azouzi Vinod Sharma Dept. of Industria Engineering Management, IIT - Kharagpur, West Benga, India Maestro group,

More information

Robust Sensitivity Analysis for Linear Programming with Ellipsoidal Perturbation

Robust Sensitivity Analysis for Linear Programming with Ellipsoidal Perturbation Robust Sensitivity Anaysis for Linear Programming with Eipsoida Perturbation Ruotian Gao and Wenxun Xing Department of Mathematica Sciences Tsinghua University, Beijing, China, 100084 September 27, 2017

More information

More Scattering: the Partial Wave Expansion

More Scattering: the Partial Wave Expansion More Scattering: the Partia Wave Expansion Michae Fower /7/8 Pane Waves and Partia Waves We are considering the soution to Schrödinger s equation for scattering of an incoming pane wave in the z-direction

More information

Appendix for Stochastic Gradient Monomial Gamma Sampler

Appendix for Stochastic Gradient Monomial Gamma Sampler Appendix for Stochastic Gradient Monomia Gamma Samper A The Main Theorem We provide the foowing theorem to characterize the stationary distribution of the stochastic process with SDEs in (3) Theorem 3

More information

Turbo Codes. Coding and Communication Laboratory. Dept. of Electrical Engineering, National Chung Hsing University

Turbo Codes. Coding and Communication Laboratory. Dept. of Electrical Engineering, National Chung Hsing University Turbo Codes Coding and Communication Laboratory Dept. of Eectrica Engineering, Nationa Chung Hsing University Turbo codes 1 Chapter 12: Turbo Codes 1. Introduction 2. Turbo code encoder 3. Design of intereaver

More information

PHYS 110B - HW #1 Fall 2005, Solutions by David Pace Equations referenced as Eq. # are from Griffiths Problem statements are paraphrased

PHYS 110B - HW #1 Fall 2005, Solutions by David Pace Equations referenced as Eq. # are from Griffiths Problem statements are paraphrased PHYS 110B - HW #1 Fa 2005, Soutions by David Pace Equations referenced as Eq. # are from Griffiths Probem statements are paraphrased [1.] Probem 6.8 from Griffiths A ong cyinder has radius R and a magnetization

More information

Rate-Distortion Theory of Finite Point Processes

Rate-Distortion Theory of Finite Point Processes Rate-Distortion Theory of Finite Point Processes Günther Koiander, Dominic Schuhmacher, and Franz Hawatsch, Feow, IEEE Abstract We study the compression of data in the case where the usefu information

More information

The Group Structure on a Smooth Tropical Cubic

The Group Structure on a Smooth Tropical Cubic The Group Structure on a Smooth Tropica Cubic Ethan Lake Apri 20, 2015 Abstract Just as in in cassica agebraic geometry, it is possibe to define a group aw on a smooth tropica cubic curve. In this note,

More information

Asymptotic Properties of a Generalized Cross Entropy Optimization Algorithm

Asymptotic Properties of a Generalized Cross Entropy Optimization Algorithm 1 Asymptotic Properties of a Generaized Cross Entropy Optimization Agorithm Zijun Wu, Michae Koonko, Institute for Appied Stochastics and Operations Research, Caustha Technica University Abstract The discrete

More information

Coded Caching for Files with Distinct File Sizes

Coded Caching for Files with Distinct File Sizes Coded Caching for Fies with Distinct Fie Sizes Jinbei Zhang iaojun Lin Chih-Chun Wang inbing Wang Department of Eectronic Engineering Shanghai Jiao ong University China Schoo of Eectrica and Computer Engineering

More information

$, (2.1) n="# #. (2.2)

$, (2.1) n=# #. (2.2) Chapter. Eectrostatic II Notes: Most of the materia presented in this chapter is taken from Jackson, Chap.,, and 4, and Di Bartoo, Chap... Mathematica Considerations.. The Fourier series and the Fourier

More information

Srednicki Chapter 51

Srednicki Chapter 51 Srednici Chapter 51 QFT Probems & Soutions A. George September 7, 13 Srednici 51.1. Derive the fermion-oop correction to the scaar proagator by woring through equation 5., and show that it has an extra

More information

DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM

DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM MIKAEL NILSSON, MATTIAS DAHL AND INGVAR CLAESSON Bekinge Institute of Technoogy Department of Teecommunications and Signa Processing

More information

V.B The Cluster Expansion

V.B The Cluster Expansion V.B The Custer Expansion For short range interactions, speciay with a hard core, it is much better to repace the expansion parameter V( q ) by f( q ) = exp ( βv( q )), which is obtained by summing over

More information

Automobile Prices in Market Equilibrium. Berry, Pakes and Levinsohn

Automobile Prices in Market Equilibrium. Berry, Pakes and Levinsohn Automobie Prices in Market Equiibrium Berry, Pakes and Levinsohn Empirica Anaysis of demand and suppy in a differentiated products market: equiibrium in the U.S. automobie market. Oigopoistic Differentiated

More information

Sequential Decoding of Polar Codes with Arbitrary Binary Kernel

Sequential Decoding of Polar Codes with Arbitrary Binary Kernel Sequentia Decoding of Poar Codes with Arbitrary Binary Kerne Vera Miosavskaya, Peter Trifonov Saint-Petersburg State Poytechnic University Emai: veram,petert}@dcn.icc.spbstu.ru Abstract The probem of efficient

More information

(Refer Slide Time: 2:34) L C V

(Refer Slide Time: 2:34) L C V Microwave Integrated Circuits Professor Jayanta Mukherjee Department of Eectrica Engineering Indian Intitute of Technoogy Bombay Modue 1 Lecture No 2 Refection Coefficient, SWR, Smith Chart. Heo wecome

More information

Quantum Mechanical Models of Vibration and Rotation of Molecules Chapter 18

Quantum Mechanical Models of Vibration and Rotation of Molecules Chapter 18 Quantum Mechanica Modes of Vibration and Rotation of Moecues Chapter 18 Moecuar Energy Transationa Vibrationa Rotationa Eectronic Moecuar Motions Vibrations of Moecues: Mode approximates moecues to atoms

More information

Convergence Property of the Iri-Imai Algorithm for Some Smooth Convex Programming Problems

Convergence Property of the Iri-Imai Algorithm for Some Smooth Convex Programming Problems Convergence Property of the Iri-Imai Agorithm for Some Smooth Convex Programming Probems S. Zhang Communicated by Z.Q. Luo Assistant Professor, Department of Econometrics, University of Groningen, Groningen,

More information

4 1-D Boundary Value Problems Heat Equation

4 1-D Boundary Value Problems Heat Equation 4 -D Boundary Vaue Probems Heat Equation The main purpose of this chapter is to study boundary vaue probems for the heat equation on a finite rod a x b. u t (x, t = ku xx (x, t, a < x < b, t > u(x, = ϕ(x

More information

ON DEVIATIONS FROM THE MAXIMUM IN A STOCHASTIC PROCESS. Catherine A. Macken. Howard M. Taylor. June 23, Cornell University

ON DEVIATIONS FROM THE MAXIMUM IN A STOCHASTIC PROCESS. Catherine A. Macken. Howard M. Taylor. June 23, Cornell University ON DEVIATIONS FROM THE MAXIMUM IN A STOCHASTIC PROCESS By Catherine A. Macken Howard M. Tayor June 23, 1975 Corne University Ithaca, New York 14853 Revised - October 21, 1975 ABSTRACT Let T be the first

More information

Lecture 6 Povh Krane Enge Williams Properties of 2-nucleon potential

Lecture 6 Povh Krane Enge Williams Properties of 2-nucleon potential Lecture 6 Povh Krane Enge Wiiams Properties of -nuceon potentia 16.1 4.4 3.6 9.9 Meson Theory of Nucear potentia 4.5 3.11 9.10 I recommend Eisberg and Resnik notes as distributed Probems, Lecture 6 1 Consider

More information

STABLE GRAPHS BENJAMIN OYE

STABLE GRAPHS BENJAMIN OYE STABLE GRAPHS BENJAMIN OYE Abstract. In Reguarity Lemmas for Stabe Graphs [1] Maiaris and Sheah appy toos from mode theory to obtain stronger forms of Ramsey's theorem and Szemeredi's reguarity emma for

More information

arxiv:hep-ph/ v1 15 Jan 2001

arxiv:hep-ph/ v1 15 Jan 2001 BOSE-EINSTEIN CORRELATIONS IN CASCADE PROCESSES AND NON-EXTENSIVE STATISTICS O.V.UTYUZH AND G.WILK The Andrzej So tan Institute for Nucear Studies; Hoża 69; 00-689 Warsaw, Poand E-mai: utyuzh@fuw.edu.p

More information

6 Wave Equation on an Interval: Separation of Variables

6 Wave Equation on an Interval: Separation of Variables 6 Wave Equation on an Interva: Separation of Variabes 6.1 Dirichet Boundary Conditions Ref: Strauss, Chapter 4 We now use the separation of variabes technique to study the wave equation on a finite interva.

More information

14 Separation of Variables Method

14 Separation of Variables Method 14 Separation of Variabes Method Consider, for exampe, the Dirichet probem u t = Du xx < x u(x, ) = f(x) < x < u(, t) = = u(, t) t > Let u(x, t) = T (t)φ(x); now substitute into the equation: dt

More information

An explicit Jordan Decomposition of Companion matrices

An explicit Jordan Decomposition of Companion matrices An expicit Jordan Decomposition of Companion matrices Fermín S V Bazán Departamento de Matemática CFM UFSC 88040-900 Forianópois SC E-mai: fermin@mtmufscbr S Gratton CERFACS 42 Av Gaspard Coriois 31057

More information

Distributed Optimization With Local Domains: Applications in MPC and Network Flows

Distributed Optimization With Local Domains: Applications in MPC and Network Flows Distributed Optimization With Loca Domains: Appications in MPC and Network Fows João F. C. Mota, João M. F. Xavier, Pedro M. Q. Aguiar, and Markus Püsche Abstract In this paper we consider a network with

More information

ESCI 340 Physical Meteorology Radiation Lesson 5 Terrestrial Radiation and Radiation Balance Dr. DeCaria

ESCI 340 Physical Meteorology Radiation Lesson 5 Terrestrial Radiation and Radiation Balance Dr. DeCaria ECI 30 Physica Meteoroogy Radiation Lesson 5 errestria Radiation and Radiation Baance Dr. DeCaria References: Atmospheric cience: An Introductory urvey, Waace and Hobbs An Introduction to Atmospheric Radiation,

More information

Reichenbachian Common Cause Systems

Reichenbachian Common Cause Systems Reichenbachian Common Cause Systems G. Hofer-Szabó Department of Phiosophy Technica University of Budapest e-mai: gszabo@hps.ete.hu Mikós Rédei Department of History and Phiosophy of Science Eötvös University,

More information

Discrete Techniques. Chapter Introduction

Discrete Techniques. Chapter Introduction Chapter 3 Discrete Techniques 3. Introduction In the previous two chapters we introduced Fourier transforms of continuous functions of the periodic and non-periodic (finite energy) type, as we as various

More information

Physics 566: Quantum Optics Quantization of the Electromagnetic Field

Physics 566: Quantum Optics Quantization of the Electromagnetic Field Physics 566: Quantum Optics Quantization of the Eectromagnetic Fied Maxwe's Equations and Gauge invariance In ecture we earned how to quantize a one dimensiona scaar fied corresponding to vibrations on

More information

Statistical Learning Theory: A Primer

Statistical Learning Theory: A Primer Internationa Journa of Computer Vision 38(), 9 3, 2000 c 2000 uwer Academic Pubishers. Manufactured in The Netherands. Statistica Learning Theory: A Primer THEODOROS EVGENIOU, MASSIMILIANO PONTIL AND TOMASO

More information

22.615, MHD Theory of Fusion Systems Prof. Freidberg Lecture 2: The Moment Equations

22.615, MHD Theory of Fusion Systems Prof. Freidberg Lecture 2: The Moment Equations .615, MHD Theory of Fusion ystems Prof. Freidberg Lecture : The Moment Equations Botzmann-Maxwe Equations 1. Reca that the genera couped Botzmann-Maxwe equations can be written as f q + v + E + v B f =

More information

Combining reaction kinetics to the multi-phase Gibbs energy calculation

Combining reaction kinetics to the multi-phase Gibbs energy calculation 7 th European Symposium on Computer Aided Process Engineering ESCAPE7 V. Pesu and P.S. Agachi (Editors) 2007 Esevier B.V. A rights reserved. Combining reaction inetics to the muti-phase Gibbs energy cacuation

More information

Higher dimensional PDEs and multidimensional eigenvalue problems

Higher dimensional PDEs and multidimensional eigenvalue problems Higher dimensiona PEs and mutidimensiona eigenvaue probems 1 Probems with three independent variabes Consider the prototypica equations u t = u (iffusion) u tt = u (W ave) u zz = u (Lapace) where u = u

More information

SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS

SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS ISEE 1 SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS By Yingying Fan and Jinchi Lv University of Southern Caifornia This Suppementary Materia

More information

V.B The Cluster Expansion

V.B The Cluster Expansion V.B The Custer Expansion For short range interactions, speciay with a hard core, it is much better to repace the expansion parameter V( q ) by f(q ) = exp ( βv( q )) 1, which is obtained by summing over

More information