Asynchronous Control for Coupled Markov Decision Systems
|
|
- Douglas Houston
- 6 years ago
- Views:
Transcription
1 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 separate Marov decision systems that operate asynchronousy over their own state spaces. Decisions at each system affect: (i) the time spent in the current state, (ii) a vector of penaties incurred, and (iii) the next-state transition probabiities. An exampe is a networ of smart devices that perform separate tass but share a common wireess channe. The mode can aso be appied to data center scheduing and to various types of cyber-physica networs. The combined state space grows exponentiay with the number of systems. However, a simpe strategy is deveoped where each system maes separate decisions. Tota compexity grows ony ineary in the number of systems, and the resuting performance can be pushed arbitrariy cose to optima. I. INTRODUCTION This paper considers contro for a coection of couped systems. Each system is a semi-marov decision process that operates in continuous time over its own state space. Decisions at each system affect the time spent in each state, the transition probabiities to the next state, and a vector of penaties or rewards. The systems are couped through constraints on the sum of time averages of their penaties and rewards. An exampe is a coection of smart devices that repeatedy perform compex tass such as image or video processing, compression, or other types of computation. These tass may aso generate or request data for wireess transmission. Each device has a state space that corresponds to different tas functions and/or different energy saving modes of operation. Decisions in each state affect energy expenditure, computation time, and the amount of data generated or requested for wireess communication. The state transition times are not synchronized across devices. Further, the devices are couped through the muti-access constraints of the wireess networ. This presents a chaenging and important probem of asynchronous contro of couped Marov decision systems. Such probems aso arise in data center scheduing and in contro of cyber-physica networs. This paper demonstrates that optimaity can be achieved by separate controers at each system. Whie the size of the combined state space vector grows exponentiay in the number of systems, the soution compexity grows ony ineary. Indeed, the compexity of the controer at each system depends on the size of its own state space. Thus, the soution can be used even when the number of systems is arge, say, or, provided that the state space of each system is sma. In Section IV a noninear program for the optima contro poicy is derived. The probem is non-convex and has frac- This materia is supported in part by one or more of: the NSF Career grant CCF , the Networ Science Coaborative Technoogy Aiance sponsored by the U.S. Army Research Laboratory W9NF tiona terms with different denominators. This is more compex than a inear program or a inear fractiona program. Genera probems of this type are intractabe. However, the probem under study has specia structure that aows an optima soution. It is shown to be equivaent to a inear program via a noninear change of variabes. This change of variabes is inspired by techniques used in ]2] to sove inear fractiona programs associated with (singe) unconstrained semi-marov decision systems. The current wor can be viewed as a generaization of ]2] to the case of mutipe asynchronous systems with mutipe couped constraints. The inear programming formuation assumes a underying probabiities of the system are nown. Section V treats a more compex scenario where each system can observe a vector of random events with possiby unnown probabiity distribution (such as a vector of wireess channe states used for opportunistic transmission). Learning-based approaches to discrete time Marov decision probems are considered in 3] using a 2-timescae anaysis and in 4] using poicy gradients. The current paper taes a different approach that utiizes Lyapunov optimization theory. It buids on the Lyapunov method for optimizing renewa systems in 5] and semi- Marov decision systems in 6]. The resut in 6] treats a singe Marov system and uses a more compex bisection routine to evauate a drift-pus-penaty ratio expression. The current paper uses a change of variabes that resuts in a driftpus-penaty expression without a ratio, and hence does not require a bisection step. The current paper is aso reated to recent wor in 7] that treats asynchronous scheduing at a data center. The wor in 7] deveops an onine poicy for asynchronous contro, but treats a simper cass of systems that do not have an embedded Marov structure. II. SYSTEM MODEL Consider a coection of S separate Marovian systems, where S is a positive integer. Define S ={,..., S}. Each system s S has a finite state space K and operates in continuous time. The timeine for each system is segmented into bac-to-bac intervas caed frames. Each frame represents the time spent in one state. The size of each frame can vary depending on random events and contro actions. Let {T } r= be the sequence of frame sizes for system s, where r is a frame index in the set {,, 2,...}. Frame boundaries are not necessariy synchronized across systems. Let be the state of system s during frame r. At the beginning of each frame r, the system observes a random event ω that taes vaues in some abstract event space Ω. It then chooses a contro action α A, where A is
2 INFORMATION THEORY WORKSHOP (ITW) 22 2 an abstract set of possibe actions for system s. The 3-tupe (, ω, α ) determines: The frame size T. A vector of L + penaties for frame r, for some nonnegative integer L. This penaty vector has the form: = (, y,..., y L ) The next-state transition probabiities P (assuming that i = is the current state for system s). These are given by functions ˆT ( ), ŷ ( ), ˆP ( ): T = ˆT (, ω, α ) = ŷ (, ω, α ) {,,..., L} P i,j = ˆP i,j (ω, α ) i, j K A. Assumptions For simpicity of exposition, assume that for each s S, the sets A and Ω are finite. Assume that the ω processes are independent across systems. Further, for each system s S, the processes {ω } r= are independent and identicay distributed (i.i.d.) across frames r {,, 2,...}. For each ω Ω, define π (ω) =P rω = ω]. The transition probabiities are non-negative and satisfy the foowing for a (, ω, α ): j K ˆP ( ) = s S, i K The frame sizes are assumed to be bounded by some positive minimum and maximum vaues T min and T max for a (, ω, α ): T min ˆT ( ) T max The penaties can be positive, negative, or zero (negative penaties can be used to represent rewards), and are bounded by some finite minimum and maximum vaues,min, y,max for a (, ω, α ):,min ŷ B. Optimization Objective ( ),max The time average penaty of type {,,..., L} incurred by system s up to frame R is given by: R r= y R r= T Mutipying the numerator and denominator of the above expression by /R and taing a imit as R gives an expression for the time average penaty of type in system s: where and T T = im R R R r= y R R r= T is a frame average that is defined: = im R R is defined simiary. R r= y At the beginning of the rth frame for system s, the controer observes the random event ω and chooses an action α A. The goa is to design decision-maing poicies for each system so that the resuting time averages sove the foowing optimization probem: T () c d T {,..., L} (2) α A s S, r {,, 2,...} (3) where c, d are given rea numbers for {,..., L} and s S. It is assumed throughout that the constraints of probem ()-(3) are feasibe. For simpicity, it is assumed that each system s S has a state K that is positive recurrent under any stationary poicy for choosing α. This occurs, for exampe, when each state has a positive probabiity of returning to state under any (ω, α ). This assumption is not crucia, but simpifies some technica detais. In particuar, it can be shown that it ensures the initia states of the system do not affect optimaity. Such a state often naturay exists when systems have an ide state that is returned to infinitey often. III. AN EXAMPLE NETWORK OF SMART DEVICES Consider a networ of M wireess smart devices. Each device contains two embedded chips: a processing chip and a communication chip. The processing chip operates over variabe ength frames and is used for computation and tas processing. The communication chip operates over fixed frame sizes and is used for wireess transmission and reception over one of L possibe transmission ins. The processing chip at each device m {,..., M} is assumed to have three states: K (m) = {ide, processing mode, processing mode 2} The different states can represent different functionaities or tass that the chip performs, and/or different energy-saving modes that affect computation time and energy expenditure. Let A (m) be an abstract space of processing actions for each device m {,..., M}. For simpicity, assume there is no random event process ω (m) for these chips. The action α (m) at device m affects the energy expenditure e (m), the frame duration T (m), transition probabiities to the next state, and generates b (m) bits for transmission over in : e (m) = ê (m) ( (m), α (m) ) T (m) = ˆT (m) ( (m), α (m) ) b (m) = ˆb (m) ( (m), α (m) ) {,..., L} Finay, define an (M + )th system that represents a of the L wireess ins. This system operates in discrete time with fixed frame sizes T (M+) = for a r {,, 2,...}, and has ony one Marov state (M+) = for a r {,, 2,...} (so that system M + has no Marov dynamics). However, this system has a time-varying channe state process ω (M+) = (η,..., η L ), where η represents the state of wireess channe on frame r. Let A (M+) represent
3 INFORMATION THEORY WORKSHOP (ITW) 22 3 the set of transmission/reception contro actions on each frame (for exampe, this set might restrict the networ to transmit over ony one in per frame). Let e (M+) and µ be the energy expended and bits transmitted over in on frame r: e (M+) = ê (M+) (ω (M+), α (M+) ) µ = ˆµ (ω (M+), α (M+) ) {,..., L} The goa is to operate each system to minimize tota average power expenditure subject to transmission rate constraints: M m= e (M+) + M m= e(m) (4) T (m) b (m) T (m) µ {,..., L} (5) α (m) A (m) (6) where the fina constraint α (m) A (m) hods for a m {,..., M + } and a r {,, 2,...}. IV. THE NONLINEAR PROGRAM TRANSFORMED To begin, first assume there are no random event processes ω. It can be shown that the probem ()-(3) can be soved by stationary and randomized agorithms (see reated resuts in 8]9]2]). Specificay, each system s S observes its current state and independenty chooses a contro action α according to a probabiity distribution p (α): ] P r α = α = = p (α ) The p (α ) probabiities are non-negative and sum to : α A p (α ) = K The fraction of frames that system s spends in each state under this poicy can be viewed as a steady state distribution that satisfies a goba baance equation. A standard tric is to define variabes φ (, α) that intuitivey represent the steady state probabiity that system s is in state and chooses action α. They shoud satisfy (see, for exampe, ]8]9]2]): α A φ (, α) = i K,α A φ (i, α) ˆP i (α) (7) φ (, α) (8) K,α A φ (, α) = (9) where (7) is for a K, and (8) is for a K, α A. Constraint (7) can be interpreted as a baance equation. Its eft-hand-side represents the steady state probabiity that system s is in state. Its right-hand-side represents the probabiity of transitioning into state in the next frame. It shoud be noted that this steady state is with respect to frame averages (corresponding to the steady state of the embedded Marov chain), and is not the same as the time average steady state (which woud aso incude the time spent in each state). Given vaues φ (, α) that satisfy (7)-(9), one can define a stationary randomized poicy by: p φ (, α) (α ) = β A φ (, β) This gives rise to the foowing noninear program for computing the optima stationary poicy for probem ()-(3): ],α φ (,α)ŷ (,α),α φ (,α) ˆT () (,α) ],α φ (,α)ŷ (,α) d c,α φ (,α) ˆT (,α) {,..., L} () φ (, α) satisfies (7)-(9) (2) where the summations,α above are understood to be over K, α A. The above probem has variabes φ (, α) and constants c, d, ŷ (, α), ˆT (, α). The constraints (7)-(9) are inear in the variabes φ (, α). The probem aso invoves fractiona terms where the numerators and denominators are inear functions of the variabes φ (, α). Probems with fractiona terms with different denominators are non-convex and are generay intractabe. However, a fractiona terms in the probem above have the same denominator for each system s S. This property is expoited in the first resut beow, which transforms the probem via a noninear change of variabes. This change of variabes is inspired by simiar techniques in ]2] which treat (singe) unconstrained semi-marov systems. Consider the foowing inear program defined over new variabes γ (, α) for s S, K, α A :,α γ (, α)ŷ (, α) (3),α γ (, α)c ŷ (, α) d {,..., L} (4) α γ (, α) = i,α γ (i, α) ˆP i (α) (5) γ (, α) (6),α γ (, α) ˆT (, α) = (7) where summations α and,α are understood to be over α A and K. The constraints (5) are for a s S, K, the constraints (6) are for a s S, K, α A, and the constraints (7) are for a s S. Theorem : The optima objective function vaue is the same for the origina probem ()-(2) and the new probem (3)-(7). Further, if γ (, α) are variabes that sove the new probem, then the foowing variabes φ (, α) sove the origina probem: φ γ (, α) (, α) = (8) i K,β K γ (i, β) Proof: Let φ (, α) be vaues that sove the origina probem ()-(2), and et V origina be the vaue of the optima objective function: V origina =,α φ (, α)ŷ ] (, α),α φ (, α) ˆT (9) (, α) Define: γ φ (, α) (, α) = i K,β A φ (i, β) ˆT (i, β) (2)
4 INFORMATION THEORY WORKSHOP (ITW) 22 4 and note that because the ˆT (, α) vaues are stricty positive and the φ (, α) vaues are non-negative and sum to, the denominator in (2) must be positive. Because the φ (, α) vaues satisfy the constraints ()-(2), it can be shown that the γ (, α) vaues defined by (2) satisfy the constraints (4)-(7). Indeed, the definition of γ (, α) in (2) immediatey impies constraint (7), non-negativity of φ (, α) immediatey impies (6), and dividing the constraint (7) by i K,β A φ (i, β) ˆT (i, β) impies (5). Finay, substituting (2) into () and using (7) impies constraint (4). Further, by substituting (2) into (9) it is easy to see that the objective function associated with these γ (, α) variabes is equa to V origina. It foows that the optima objective function vaue of the new probem is ess than or equa to V origina, that is, V new V origina, where V new is defined as the minimum objective function vaue (3) for the new probem. Now et γ (, α) represent optima variabes that sove the new probem (3)-(7), and define φ (, α) according to (8). By simiar substitutions, it can be seen that these φ (, α) vaues satisfy the constraints ()-(2) of the origina probem and produce an objective function vaue in () that is equa to V new. Hence, V new = V origina, and these φ (, α) vaues are optima for the origina probem. Theorem transforms the origina noninear probem into a inear program with variabes γ (, α). Reca that there are S systems. Suppose each system has at most K max states and an action space size of at most A max, for some positive numbers K max and A max. Thus, the tota number of variabes γ (, α) is at most SK max A max, which grows ineary in the number of systems. It is easy to see that the number of constraints of the inear program (3)-(7) aso grows ineary in the number of systems. The tota compexity is essentiay the same as the compexity associated with each system separatey soving its own Marov decision probem on its own state space. V. LYAPUNOV OPTIMIZATION The previous section soves for the optima conditiona probabiities p (α ), but does not treat cases when there are observed random events ω. For such cases, one needs conditiona probabiities p (α ω, ). The number of ω vectors can be enormous, in which case it is not practica to consider estimating the probabiities of each and computing the optima p (α ω, ) probabiities. However, Lyapunov optimization can treat reated probems of optimizing time averages in systems with random events, without nowing the probabiities of these events and regardess of the cardinaity of the event space 5]]2]3]. Rather than attempting to compute the optima probabiities for every possibe event, the Lyapunov poicies mae onine decisions based on greediy minimizing a drift-pus-penaty expression. Recent wor in 6] extends this by deveoping an onine poicy for a (singe) semi-marov decision system, provided that certain target information is given. Specificay, suppose that for each system s S, one is given vaues P, y,, T that respectivey represent desired targets for the fraction of time the embedded Marov chain transitions from i to j, the average type penaties incurred whie in state, and the average time spent in state. Then one can use the onine poicy of Section IV in 6] to contro the system and meet these targets, without requiring the probabiity distribution for the random events ω. In the foowing, a Lyapunov-based agorithm for computing the optima targets corresponding to the asynchronous contro probem ()-(3) is deveoped. A. The Time Average Probem As in 6], consider a modified coection of systems with no Marov dynamics, where state variabes for system s can be chosen as decision variabes every frame r. Define the foowing attributes q for a s S and i, j K : q = i ˆP (ω, α ) (2) where i is an indicator function that is if = i, and ese. Let i be its frame average. The probem ()-(3) can be transformed as (compare with Section III in 6]): (22) T c d T {,..., L} (23) = i K q i (24) K (25) α A (26) is chosen before ω is nown (27) where (24) hods for a s S, K, and (25)-(27) hod for a s S, r {,, 2,...}. The objective function (22) is identica to (), and the constraints (23) and (26) are the same as (2)-(3). Constraint (24) is a baance equation simiar to (7) and, together with (25) and (27), ensures the resuting time averages can actuay be achieved on the Marov decision system. Constraint (27) is subte, and ensures the decisions are independent of ω. Now consider the foowing transformed probem, simiar in spirit to the transformation of the previous section: For each system s S, define new variabes θ that are chosen every frame r {,, 2,...} over the interva /T max, /T min ]. Consider the probem: θ (28) c θ d {,..., L} (29) θ = i K θ q i (3) θ T = (3) K (32) α A (33) /T max θ /T min (34) is chosen before ω is nown (35) where frame averages θ θ R = im R R are defined: r= θ
5 INFORMATION THEORY WORKSHOP (ITW) 22 5 and frame averages θ T, θ q i, θ are defined simiary. It can be shown that the origina probem (22)-(27) and the new probem (28)-(35) have the same optima objective function vaue (proof omitted for brevity). Further, the soution to the new probem can be used to construct optima targets P, y,, T for the origina probem as foows: y, = θ y θ B. Virtua Queues, T = θ T θ, P = θ q θ i Using the drift-pus-penaty technique of 5], the constraints (29)-(3) are treated with virtua queues Z, H, J for {,..., L}, s S, K : ] Z r + ] = max Z + c θ d, r + ] = H + θ θ q i i K H J r + ] = J + θ T C. The Drift-Pus-Penaty Agorithm For a given parameter V, define f (, ω, α) by: D. Discussion The above agorithm seects α and θ without nowedge of the distribution of ω. Seection of requires evauation of the expectation in (36). This decision is trivia in specia cases such as that given in Section III, where the systems s S that have random event processes ω are -state systems (without Marov dynamics) for which one aways seects =, and the systems that have Marov dynamics do not have ω processes (so that the expectation in (36) reduces to the deterministic minimum). In the genera case, the expectation (36) can be efficienty estimated based on a coection of past sampes of ω, as justified by the max-weight earning framewor of 4]. The agorithm above can be viewed as an offine agorithm for computing desired targets and finding the optima time average quantities given a sampe sequence of observed {ω } r= vaues for each system. In an onine impementation where such a sampe sequence is graduay observed, the agorithm acts over virtua frames that run sower than the actua system. Specificay, the operations required on the rth virtua frame cannot be performed unti the ω vaue for each system s is observed. Each observed vaue is stored in memory as needed. The resuting weighted averages achieved in this virtua system act as progressivey updated targets that are passed into an onine agorithm such as 6] that runs separatey on each actua system. f (, ω, α) =V ŷ (, ω, α) + L = Z c +H j K H j +J ˆT (, ω, α) ŷ (, ω, α) ˆP j (ω, α) Define g (θ,, ω, α) =θf (, ω, α). Define B as the set of a (θ, α) vaues that satisfy /T max θ /T min, α A. At the beginning of each frame r and for each s S, observe virtua queues and perform the foowing: ( seection) Choose as the index K that minimizes the foowing (breaing ties arbitrariy): E { min (θ,α) B g (θ,, ω, α) } (36) where the expectation above is with respect to the randomness of ω. (α, θ seection) Once the decision is made, observe the actua ω and choose α as the minimizer of f (, ω, α) over a α A, breaing ties arbitrariy. Then chose θ by: θ = { T min T max if f (, ω, α ) otherwise (Virtua Queue Update) Update the virtua queues according to the update equations in Section V-B. The resuting agorithm satisfies a constraints whenever it is possibe to do so, and yieds an objective function that differs by O(/V ) from optima, with a corresponding poynomia convergence time tradeoff with V 5]. REFERENCES ] B. Fox. Marov renewa programming by inear fractiona programming. Siam J. App. Math, vo. 4, no. 6, Nov ] H. Mine and S. Osai. Marovian Decision Processes. American Esevier, New Yor, 97. 3] V. S. Borar. An actor-critic agorithm for constrained Marov decision processes. Systems and Contro Letters (Esevier), vo. 54, pp , 25. 4] F. J. Vázquez Abad and V. Krishnamurthy. Poicy gradient stochastic approximation agorithms for adaptive contro of constrained time varying marov decision processes. Proc. IEEE Conf. on Decision and Contro, Dec ] M. J. Neey. Stochastic Networ Optimization with Appication to Communication and Queueing Systems. Morgan & Caypoo, 2. 6] M. J. Neey. Onine fractiona programming for Marov decision systems. Proc. Aerton Conf. on Communication, Contro, and Computing, Sept. 2. 7] M. J. Neey. Asynchronous scheduing for energy optimaity in systems with mutipe servers. Proc. 46th Conf. on Information Sciences and Systems (CISS), March 22. 8] M. L. Puterman. Marov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiey & Sons, 25. 9] E. Atman. Constrained Marov Decision Processes. Boca Raton, FL, Chapman and Ha/CRC Press, 999. ] S. Ross. Introduction to Probabiity Modes. Academic Press, 8th edition, Dec. 22. ] L. Georgiadis, M. J. Neey, and L. Tassiuas. Resource aocation and cross-ayer contro in wireess networs. Foundations and Trends in Networing, vo., no., pp. -49, 26. 2] M. J. Neey, E. Modiano, and C. Li. Fairness and optima stochastic contro for heterogeneous networs. IEEE/ACM Transactions on Networing, vo. 6, no. 2, pp , Apri 28. 3] L. Tassiuas and A. Ephremides. Dynamic server aocation to parae queues with randomy varying connectivity. IEEE Transactions on Information Theory, vo. 39, no. 2, pp , March ] M. J. Neey, S. T. Rager, and T. F. La Porta. Max weight earning agorithms for scheduing in unnown environments. IEEE Transactions on Automatic Contro, to appear.
Optimal Control of Assembly Systems with Multiple Stages and Multiple Demand Classes 1
Optima Contro of Assemby Systems with Mutipe Stages and Mutipe Demand Casses Saif Benjaafar Mohsen EHafsi 2 Chung-Yee Lee 3 Weihua Zhou 3 Industria & Systems Engineering, Department of Mechanica Engineering,
More informationMARKOV 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 informationA 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 informationAn Adaptive Opportunistic Routing Scheme for Wireless Ad-hoc Networks
An Adaptive Opportunistic Routing Scheme for Wireess Ad-hoc Networks A.A. Bhorkar, M. Naghshvar, T. Javidi, and B.D. Rao Department of Eectrica Engineering, University of Caifornia San Diego, CA, 9093
More informationThroughput 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 informationMaximizing Sum Rate and Minimizing MSE on Multiuser Downlink: Optimality, Fast Algorithms and Equivalence via Max-min SIR
1 Maximizing Sum Rate and Minimizing MSE on Mutiuser Downink: Optimaity, Fast Agorithms and Equivaence via Max-min SIR Chee Wei Tan 1,2, Mung Chiang 2 and R. Srikant 3 1 Caifornia Institute of Technoogy,
More informationArbitrary 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 informationPrimal and dual active-set methods for convex quadratic programming
Math. Program., Ser. A 216) 159:469 58 DOI 1.17/s117-15-966-2 FULL LENGTH PAPER Prima and dua active-set methods for convex quadratic programming Anders Forsgren 1 Phiip E. Gi 2 Eizabeth Wong 2 Received:
More informationExpectation-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 informationA. 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 informationSeparation 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 informationPower 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 informationCS229 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 informationAsymptotic 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 informationEfficiently Generating Random Bits from Finite State Markov Chains
1 Efficienty Generating Random Bits from Finite State Markov Chains Hongchao Zhou and Jehoshua Bruck, Feow, IEEE Abstract The probem of random number generation from an uncorreated random source (of unknown
More information<C 2 2. λ 2 l. λ 1 l 1 < C 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
More informationCombining 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 informationStochastic 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 informationDelay Analysis of Maximum Weight Scheduling in Wireless Ad Hoc Networks
1 Deay Anaysis o Maximum Weight Scheduing in Wireess Ad Hoc Networks ong Bao e, Krishna Jagannathan, and Eytan Modiano Abstract This paper studies deay properties o the weknown maximum weight scheduing
More informationBP neural network-based sports performance prediction model applied research
Avaiabe onine www.jocpr.com Journa of Chemica and Pharmaceutica Research, 204, 6(7:93-936 Research Artice ISSN : 0975-7384 CODEN(USA : JCPRC5 BP neura networ-based sports performance prediction mode appied
More informationA 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 informationScalable 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 informationA Statistical Framework for Real-time Event Detection in Power Systems
1 A Statistica Framework for Rea-time Event Detection in Power Systems Noan Uhrich, Tim Christman, Phiip Swisher, and Xichen Jiang Abstract A quickest change detection (QCD) agorithm is appied to the probem
More informationA NOTE ON QUASI-STATIONARY DISTRIBUTIONS OF BIRTH-DEATH PROCESSES AND THE SIS LOGISTIC EPIDEMIC
(January 8, 2003) A NOTE ON QUASI-STATIONARY DISTRIBUTIONS OF BIRTH-DEATH PROCESSES AND THE SIS LOGISTIC EPIDEMIC DAMIAN CLANCY, University of Liverpoo PHILIP K. POLLETT, University of Queensand Abstract
More informationStatistical 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 informationNEW 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 informationEfficient Generation of Random Bits from Finite State Markov Chains
Efficient Generation of Random Bits from Finite State Markov Chains Hongchao Zhou and Jehoshua Bruck, Feow, IEEE Abstract The probem of random number generation from an uncorreated random source (of unknown
More informationOptimal Distributed Scheduling under Time-varying Conditions: A Fast-CSMA Algorithm with Applications
Optima Distributed Scheduing under Time-varying Conditions: A Fast-CSMA Agorithm with Appications Bin Li and Atia Eryimaz Abstract Recenty, ow-compexity and distributed Carrier Sense Mutipe Access (CSMA)-based
More informationReliability: 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 informationDIGITAL 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 informationLecture 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 informationIEEE 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 informationTarget Location Estimation in Wireless Sensor Networks Using Binary Data
Target Location stimation in Wireess Sensor Networks Using Binary Data Ruixin Niu and Pramod K. Varshney Department of ectrica ngineering and Computer Science Link Ha Syracuse University Syracuse, NY 344
More informationSchedulability Analysis of Deferrable Scheduling Algorithms for Maintaining Real-Time Data Freshness
1 Scheduabiity Anaysis of Deferrabe Scheduing Agorithms for Maintaining Rea-Time Data Freshness Song Han, Deji Chen, Ming Xiong, Kam-yiu Lam, Aoysius K. Mok, Krithi Ramamritham UT Austin, Emerson Process
More informationMore 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 informationExploring the Throughput Boundaries of Randomized Schedulers in Wireless Networks
Exporing the Throughput Boundaries of Randomized Scheduers in Wireess Networks Bin Li and Atia Eryimaz Abstract Randomization is a powerfu and pervasive strategy for deveoping efficient and practica transmission
More informationRate-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 informationCentralized 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 informationAvailable online at ScienceDirect. IFAC PapersOnLine 50-1 (2017)
Avaiabe onine at www.sciencedirect.com ScienceDirect IFAC PapersOnLine 50-1 (2017 3412 3417 Stabiization of discrete-time switched inear systems: Lyapunov-Metzer inequaities versus S-procedure characterizations
More informationStochastic 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 informationAn 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 informationLinear Network Coding for Multiple Groupcast Sessions: An Interference Alignment Approach
Linear Network Coding for Mutipe Groupcast Sessions: An Interference Aignment Approach Abhik Kumar Das, Siddhartha Banerjee and Sriram Vishwanath Dept. of ECE, The University of Texas at Austin, TX, USA
More informationXSAT 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 informationStochastic Variational Inference with Gradient Linearization
Stochastic Variationa Inference with Gradient Linearization Suppementa Materia Tobias Pötz * Anne S Wannenwetsch Stefan Roth Department of Computer Science, TU Darmstadt Preface In this suppementa materia,
More informationPHYS 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 informationOnline Load Balancing on Related Machines
Onine Load Baancing on Reated Machines ABSTRACT Sungjin Im University of Caifornia at Merced Merced, CA, USA sim3@ucmerced.edu Debmaya Panigrahi Duke University Durham, NC, USA debmaya@cs.duke.edu We give
More informationSchedulability Analysis of Deferrable Scheduling Algorithms for Maintaining Real-Time Data Freshness
1 Scheduabiity Anaysis of Deferrabe Scheduing Agorithms for Maintaining Rea- Data Freshness Song Han, Deji Chen, Ming Xiong, Kam-yiu Lam, Aoysius K. Mok, Krithi Ramamritham UT Austin, Emerson Process Management,
More information6.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 informationCryptanalysis 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 informationMATH 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 informationUniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly conp-complete
Uniprocessor Feasibiity of Sporadic Tasks with Constrained Deadines is Strongy conp-compete Pontus Ekberg and Wang Yi Uppsaa University, Sweden Emai: {pontus.ekberg yi}@it.uu.se Abstract Deciding the feasibiity
More informationA proposed nonparametric mixture density estimation using B-spline functions
A proposed nonparametric mixture density estimation using B-spine functions Atizez Hadrich a,b, Mourad Zribi a, Afif Masmoudi b a Laboratoire d Informatique Signa et Image de a Côte d Opae (LISIC-EA 4491),
More informationEnsemble Online Clustering through Decentralized Observations
Ensembe Onine Custering through Decentraized Observations Dimitrios Katseis, Caroyn L. Bec and Mihaea van der Schaar Abstract We investigate the probem of onine earning for an ensembe of agents custering
More informationIterative Decoding Performance Bounds for LDPC Codes on Noisy Channels
Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channes arxiv:cs/060700v1 [cs.it] 6 Ju 006 Chun-Hao Hsu and Achieas Anastasopouos Eectrica Engineering and Computer Science Department University
More informationMulti-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 informationAccelerated Dual Descent for Constrained Convex Network Flow Optimization
52nd IEEE Conference on Decision and Contro December 10-13, 2013. Forence, Itay Acceerated Dua Descent for Constrained Convex Networ Fow Optimization Michae Zargham, Aejandro Ribeiro, Ai Jadbabaie Abstract
More informationT.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 informationNew Efficiency Results for Makespan Cost Sharing
New Efficiency Resuts for Makespan Cost Sharing Yvonne Beischwitz a, Forian Schoppmann a, a University of Paderborn, Department of Computer Science Fürstenaee, 3302 Paderborn, Germany Abstract In the context
More informationMoreau-Yosida Regularization for Grouped Tree Structure Learning
Moreau-Yosida Reguarization for Grouped Tree Structure Learning Jun Liu Computer Science and Engineering Arizona State University J.Liu@asu.edu Jieping Ye Computer Science and Engineering Arizona State
More informationExplicit 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 informationSVM: Terminology 1(6) SVM: Terminology 2(6)
Andrew Kusiak Inteigent Systems Laboratory 39 Seamans Center he University of Iowa Iowa City, IA 54-57 SVM he maxima margin cassifier is simiar to the perceptron: It aso assumes that the data points are
More informationConvergence 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 informationPrecoding for the Sparsely Spread MC-CDMA Downlink with Discrete-Alphabet Inputs
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL.*, NO.*, MONTH 2016 1 Precoding for the Sparsey Spread MC-CDMA Downin with Discrete-Aphabet Inputs Min Li, Member, IEEE, Chunshan Liu, Member, IEEE, and Stephen
More informationStatistical Learning Theory: a Primer
??,??, 1 6 (??) c?? Kuwer Academic Pubishers, Boston. Manufactured in The Netherands. Statistica Learning Theory: a Primer THEODOROS EVGENIOU AND MASSIMILIANO PONTIL Center for Bioogica and Computationa
More informationA 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 informationSequential 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 informationAnalysis of the problem of intervention control in the economy on the basis of solving the problem of tuning
Anaysis of the probem of intervention contro in the economy on the basis of soving the probem of tuning arxiv:1811.10993v1 q-fin.gn] 9 Nov 2018 1 st eter Shnurov Nationa Research University Higher Schoo
More informationA Fundamental Storage-Communication Tradeoff in Distributed Computing with Straggling Nodes
A Fundamenta Storage-Communication Tradeoff in Distributed Computing with Stragging odes ifa Yan, Michèe Wigger LTCI, Téécom ParisTech 75013 Paris, France Emai: {qifa.yan, michee.wigger} @teecom-paristech.fr
More informationNOISE-INDUCED STABILIZATION OF STOCHASTIC DIFFERENTIAL EQUATIONS
NOISE-INDUCED STABILIZATION OF STOCHASTIC DIFFERENTIAL EQUATIONS TONY ALLEN, EMILY GEBHARDT, AND ADAM KLUBALL 3 ADVISOR: DR. TIFFANY KOLBA 4 Abstract. The phenomenon of noise-induced stabiization occurs
More informationDiscrete 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 informationDiscrete Applied Mathematics
Discrete Appied Mathematics 159 (2011) 812 825 Contents ists avaiabe at ScienceDirect Discrete Appied Mathematics journa homepage: www.esevier.com/ocate/dam A direct barter mode for course add/drop process
More informationHeavy-traffic Delay Optimality in Pull-based Load Balancing Systems: Necessary and Sufficient Conditions
Heavy-traffic Deay Optimaity in Pu-based Load Baancing Systems: Necessary and Sufficient Conditions XINGYU ZHOU, The Ohio State University JIAN TAN, The Ohio State University NSS SHROFF, The Ohio State
More informationDetermining The Degree of Generalization Using An Incremental Learning Algorithm
Determining The Degree of Generaization Using An Incrementa Learning Agorithm Pabo Zegers Facutad de Ingeniería, Universidad de os Andes San Caros de Apoquindo 22, Las Condes, Santiago, Chie pzegers@uandes.c
More informationDo Schools Matter for High Math Achievement? Evidence from the American Mathematics Competitions Glenn Ellison and Ashley Swanson Online Appendix
VOL. NO. DO SCHOOLS MATTER FOR HIGH MATH ACHIEVEMENT? 43 Do Schoos Matter for High Math Achievement? Evidence from the American Mathematics Competitions Genn Eison and Ashey Swanson Onine Appendix Appendix
More informationHow the backpropagation algorithm works Srikumar Ramalingam School of Computing University of Utah
How the backpropagation agorithm works Srikumar Ramaingam Schoo of Computing University of Utah Reference Most of the sides are taken from the second chapter of the onine book by Michae Nieson: neuranetworksanddeepearning.com
More information4 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 informationApproximated MLC shape matrix decomposition with interleaf collision constraint
Approximated MLC shape matrix decomposition with intereaf coision constraint Thomas Kainowski Antje Kiese Abstract Shape matrix decomposition is a subprobem in radiation therapy panning. A given fuence
More informationRobust 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 informationDistributed average consensus: Beyond the realm of linearity
Distributed average consensus: Beyond the ream of inearity Usman A. Khan, Soummya Kar, and José M. F. Moura Department of Eectrica and Computer Engineering Carnegie Meon University 5 Forbes Ave, Pittsburgh,
More informationarxiv: v1 [cs.db] 25 Jun 2013
Communication Steps for Parae Query Processing Pau Beame, Paraschos Koutris and Dan Suciu {beame,pkoutris,suciu}@cs.washington.edu University of Washington arxiv:1306.5972v1 [cs.db] 25 Jun 2013 June 26,
More informationRouting a fleet of vehicles for decentralized reconnaissance with shared workload among regions with uncertain information
Routing a feet of vehices for decentraized reconnaissance with shared woroad among regions with uncertain information Yan Xia 1, Rajan Batta 2 Department of Industria and Systems Engineering The State
More informationSTA 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 informationDiscrete 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, we as various
More informationError-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity
Error-free Muti-vaued Broadcast and Byzantine Agreement with Optima Communication Compexity Arpita Patra Department of Computer Science Aarhus University, Denmark. arpita@cs.au.dk Abstract In this paper
More informationVALIDATED CONTINUATION FOR EQUILIBRIA OF PDES
VALIDATED CONTINUATION FOR EQUILIBRIA OF PDES SARAH DAY, JEAN-PHILIPPE LESSARD, AND KONSTANTIN MISCHAIKOW Abstract. One of the most efficient methods for determining the equiibria of a continuous parameterized
More informationConditions for Saddle-Point Equilibria in Output-Feedback MPC with MHE
Conditions for Sadde-Point Equiibria in Output-Feedback MPC with MHE David A. Copp and João P. Hespanha Abstract A new method for soving output-feedback mode predictive contro (MPC) and moving horizon
More informationc 2016 Georgios Rovatsos
c 2016 Georgios Rovatsos QUICKEST CHANGE DETECTION WITH APPLICATIONS TO LINE OUTAGE DETECTION BY GEORGIOS ROVATSOS THESIS Submitted in partia fufiment of the requirements for the degree of Master of Science
More informationTracking Control of Multiple Mobile Robots
Proceedings of the 2001 IEEE Internationa Conference on Robotics & Automation Seou, Korea May 21-26, 2001 Tracking Contro of Mutipe Mobie Robots A Case Study of Inter-Robot Coision-Free Probem Jurachart
More informationAdjustment of automatic control systems of production facilities at coal processing plants using multivariant physico- mathematical models
IO Conference Series: Earth and Environmenta Science AER OEN ACCESS Adjustment of automatic contro systems of production faciities at coa processing pants using mutivariant physico- mathematica modes To
More information( ) is just a function of x, with
II. MULTIVARIATE CALCULUS The first ecture covered functions where a singe input goes in, and a singe output comes out. Most economic appications aren t so simpe. In most cases, a number of variabes infuence
More informationApproximated MLC shape matrix decomposition with interleaf collision constraint
Agorithmic Operations Research Vo.4 (29) 49 57 Approximated MLC shape matrix decomposition with intereaf coision constraint Antje Kiese and Thomas Kainowski Institut für Mathematik, Universität Rostock,
More informationSource and Relay Matrices Optimization for Multiuser Multi-Hop MIMO Relay Systems
Source and Reay Matrices Optimization for Mutiuser Muti-Hop MIMO Reay Systems Yue Rong Department of Eectrica and Computer Engineering, Curtin University, Bentey, WA 6102, Austraia Abstract In this paper,
More informationComponentwise Determination of the Interval Hull Solution for Linear Interval Parameter Systems
Componentwise Determination of the Interva Hu Soution for Linear Interva Parameter Systems L. V. Koev Dept. of Theoretica Eectrotechnics, Facuty of Automatics, Technica University of Sofia, 1000 Sofia,
More informationSUPPLEMENTARY 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 informationTight Approximation Algorithms for Maximum Separable Assignment Problems
MATHEMATICS OF OPERATIONS RESEARCH Vo. 36, No. 3, August 011, pp. 416 431 issn 0364-765X eissn 156-5471 11 3603 0416 10.187/moor.1110.0499 011 INFORMS Tight Approximation Agorithms for Maximum Separabe
More informationThe Streaming-DMT of Fading Channels
The Streaming-DMT of Fading Channes Ashish Khisti Member, IEEE, and Star C. Draper Member, IEEE arxiv:30.80v3 cs.it] Aug 04 Abstract We consider the sequentia transmission of a stream of messages over
More informationBranch-and-Cut Algorithms for the Vehicle Routing Problem with Trailers and Transshipments
Branch-and-Cut Agorithms for the Vece Routing Probem with Traiers and Transspments Technica Report LM-2012-04 Michae Dre Chair of Logistics Management, Gutenberg Schoo of Management and Economics, Johannes
More informationData Mining Technology for Failure Prognostic of Avionics
IEEE Transactions on Aerospace and Eectronic Systems. Voume 38, #, pp.388-403, 00. Data Mining Technoogy for Faiure Prognostic of Avionics V.A. Skormin, Binghamton University, Binghamton, NY, 1390, USA
More informationA Bound Strengthening Method for Optimal Transmission Switching in Power Systems
1 A Bound Strengthening Method for Optima Transmission Switching in Power Systems Saar Fattahi, Javad Lavaei,+, and Aper Atamtürk Industria Engineering and Operations Research, University of Caifornia,
More informationPacket Fragmentation in Wi-Fi Ad Hoc Networks with Correlated Channel Failures
Packet Fragmentation in Wi-Fi Ad Hoc Networks with Correated Channe Faiures Andrey Lyakhov Vadimir Vishnevsky Institute for Information Transmission Probems of RAS B. Karetny 19, Moscow, 127994, Russia
More information