A Hop Constrained Min-Sum Arborescence with Outage Costs
|
|
- Britton Singleton
- 6 years ago
- Views:
Transcription
1 A Hop Consrained Min-Sum Arborescence wih Ouage Coss Rakesh Kawara Minnesoa Sae Universiy, Mankao, MN Absrac The hop consrained min-sum arborescence wih ouage coss problem consiss of selecing links in a nework so as o connec a se of erminal nodes N={,3, n} o a cenral node wih minimal oal link cos such ha (a) each erminal node has exacly one enering link; (b) for each erminal node, a unique pah from he cenral node o exiss; (c) for each erminal node he number of links beween he cenral node and is limied o a predefined number h, and (d) each erminal node has an associaed ouage cos, which is he economic cos incurred by he nework user whenever ha node is disabled due o failure of a link. We sugges a Lagrangian based heurisic o solve he ineger programming formulaion of his nework problem. 1. Inroducion The hop consrained min-sum arborescence (HCMA) problem is frequenly encounered in he nework design, rouing and scheduling problems. I consiss of finding links o connec a se of geographically remoe nodes o a cenral node such ha for each remoe node here is exacly one link enering node, and for each remoe node, a unique pah exiss from he cenral node o node. The soluion is subec o hop consrains which limis he number of links beween he cenral node and any erminal node o a predefined number h. These hop consrains are ofen used o conain he maximum delay beween any erminal node and he cenral node. The hop consrains can also be used o model reliabiliy consrains when designing elecommunicaion neworks as poined ou by LeBlanc and Reddoch [6]. They also sugges ha in many neworks hop consrains can be used o avoid degradaion of he signal qualiy. Gouveia [3] presened an ineger programming model for spanning rees wih hop consrains and suggesed a Lagrangian based heurisic for solving he problem. In his paper, we sudy he HCMA problem where each erminal node has an associaed ouage cos. The ouage cos associaed wih a erminal node is he economic cos incurred by he nework user whenever ha node is disabled due o failure of a link. I is a measure of he opporuniy cos of he equipmen and is user and does no include cos of repairing or replacing he link. The locaion of he cenral node and erminal nodes, and he limi h on he number of hops beween he cenral node and each erminal node is given. Also given are he annual coss of insalling he links and he ouage cos associaed wih each erminal node. We formulae he problem as an ineger programming problem and use a Lagrangian based heurisic mehod o solve i. We used he lower bound given by he Lagrangian mehod o esimae he qualiy of our heurisic soluions. Subgradien opimizaion mehod is used o find good lower bounds. Compuaional resuls are presened o demonsrae he performance of he Lagrangian based heurisic for differen nework srucures.. Model formulaion The hop consrained min-sum arborescence problem wih node ouage cos is formulaed as an ineger-programming problem. Our obecive is o minimize he oal annual cos consising of links coss and he expeced node ouage coss. We use he following noaions in he paper: N: he se of erminal nodes,3...n; Node 1: cenral node; T 1 = family of spanning arborescences (direced rees or branchings) wih roo a node 1, i.e., he family of direced neworks which do no conain a cycle and such ha for every erminal node, here is a pah from node 1 o node. C : annual cos of insalling a link (i, ); D : node ouage cos associaed wih erminal node ; Proceedings of he 36h Hawaii Inernaional Conference on Sysem Sciences (HICSS 03)
2 Q: link failure rae; h : he limi on he maximum number of links beween he cenral node and erminal node. Decision Variables X : a binary variable such ha X = 1 indicaes ha link (i, ) is in he soluion; oherwise X = 0; Y : a variable such ha Y = 1 if he direced link from node i o node in on he pah from node 1 o node ; oherwise Y = 0. The hop consrained min-sum arborescence problem wih node ouage coss is formulaed as: n n n n n Z = IP Minimum CX QD Y (1) i= 1= = i= 1= subec o X T 1 () N N Y Y i = = = 1 Y 1 if i = 1 1 if i = = 0 oherwise for all i N [1], N (3) X for all i N [1], and, N (4) N N Y h for all N (5) i= 1= X {0,1} for all i N [1], and N (6) Y 0,1 for all i N [1], and, N (7) { } In he above model, consrains (3) are flow conservaion consrains. Consrains (4) ensures ha if here is no direc link from node i o node, hen here canno be direc flow from node i o node. Consrains (5) are he hop consrains which for every erminal node, N, limi he number of links beween he cenral node and node o a predefined number h. 3. Soluion mehods We propose a Lagrangian based heurisic mehod o solve his problem. In our approach we firs form a Lagrangian relaxaion of he problem which is solved opimally. Nex, we use a branch exchange heurisic o generae a feasible soluion from he infeasible Lagrangian soluion. We use subgradien opimizaion mehod o find good Lagrangian mulipliers. The bes values of he lower bound and he feasible soluion are reained when he subgradien algorihm sops. The lower bound given by he Lagrangian relaxaion is used o obain a quaniaive esimae of he qualiy of he soluion given by he branch exchange heurisic. 3.1 Lagrangian relaxaion In his sudy we use a Lagrangian relaxaion approach o generae lower bounds for he hop consrained minsum arborescence problem wih node ouage coss. Lagrangian relaxaion can be used o obain igh lower bounds for a variey of ineger programming problems. (See Fisher [] for an applicaion-oriened survey of Lagrangian relaxaion). We form a relaxaion of he hop consrained min-sum arborescence problem by muliplying each consrain (4) by a nonnegaive Lagrange muliplier µ and each consrain (5) by nonnegaive muliplier θ and adding he producs o he obecive funcion. This resuls in he following relaxaion of problem Z IP : n n L ( µ, θ) = Minimize Q( µ ) M ( µ, θ) θh = = s.. (), (3),(6) and (7), where n n n Q( µ ) = Minimize X(C µ ) i=1= = s.. () and (6), and n n M ( µ, θ) = Minimize ( µ θ Q D ) Y i= 1= s.. (3) and (7) Procedure for evaluaing Q(µ) Solving Q(µ) requires finding he min-sum arborescence X ( µ ) rooed a node 1, which for a given vecor of Lagrange mulipliers µ can be accomplished using Fischei and Toh's algorihm [1]. For his algorihm, we use he lengh of n arc (i, ) = ( C µ ). = 3.1. Procedure for solving M ( µ, θ) The funcion M ( µ, θ) is evaluaed by solving a single-commodiy flow problem. In his problem, one uni of a commodiy is o be shipped from he cenral node o node. Since he links are uncapaciaed, he Proceedings of he 36h Hawaii Inernaional Conference on Sysem Sciences (HICSS 03)
3 flow Ŷ ( µ, θ) will be along he shores pah from he cenral node o node, which can be found using Dksra's algorihm [5] wih µ θ Q D as he cos of direcly shipping one uni of commodiy from node i o node. While solving M ( µ, θ) we sop he Dksra's algorihm as soon as a shores pah o node is found. 3. Improving he Lagrange mulipliers I is well known ha for any µ and θ, he value of he Lagrangian relaxaion L(µ,θ) provides a lower bound o Z IP. We wish o find he ighes bound which can be achieved, i.e., we wish o solve he Lagrangian dual problem o obain he bes lower bound, L(µ,θ ) = max {L(µ,θ)}. µ, θ 0 Searching for he opimal Lagrangian muliplier vecors µ and θ is very ime consuming; however, approximae values can be found by using a subgradien opimizaion mehod [4]. This mehod begins wih an iniial vecor of mulipliers µ 0 and θ 0, which a ieraion p is adused using he following rule: p 1 p µ = µ s p V p, N, i N [1] p 1 p θ = θ Sp U p N where V = Y X, N, i N [1] U n n Y h i= 1= = p p λ(z L( µ, θ )) and sp =. p V U N In he compuaion above, V and U are he subgradiens of L(µ,θ), denoes he Euclidean norm, Z is he bes available overesimae of he opimal soluion value, and λ is a scalar muliplier which saisfies he condiion 0<λ. The value of λ is iniially se equal o and is reduced during he course of he search. 3.3 A Lagrangian based branch exchange heurisic In our research, for simpliciy we assumed h = h for each erminal node. Our heurisic can very easily be exended o allow differen values of h for differen erminal nodes. Since Q(µ) was solved independen of hop consrains, he opimal soluion o Q(µ) may have more han h hops in he pah from he cenral node o some of he erminal nodes, which is an infeasible soluion o problem Z IP. Afer every ieraion of he subgradien opimizaion algorihm we use a branch exchange heurisic o generae a feasible soluion o Z IP. The bes feasible soluion is reained when he subgradien opimizaion algorihm is erminaed. This branch exchange heurisic is an ieraive procedure. In each ieraion his heurisic idenifies se of erminal nodes, called B, which are exacly (h1) hops from he cenral node. Nex he heurisic finds a subse C of se B such ha for each node ha belongs o he se C: he node or nodes ha belong o he subree rooed a node and are furhes away from node are exacly (h-1) hops away from his node. For each node belonging o se C, he heurisic removes he link erminaing a his node and replaces i wih link (1,). If se C is empy, hen he heurisic idenifies a erminal node belonging o se B for which a minimal increase in oal annual cos of he nework, he link erminaing a node can be replaced wih link (i, ) where node i is a mos (h-1) hops from he cenral node. If he replacing link violaes any consrain, hen i is ignored. This is coninued unil all he erminal nodes in he nework saisfy he hop consrain. The branch exchange heurisic ends when he curren soluion is feasible. For his heurisic we define he following addiional noaions: g = he origin of he link inciden o node. Level : number of hops beween he cenral node and node. Leaf node: a erminal node wih no links originaing from i. Leaf : se of leaf nodes belonging o he subree rooed a node. B = { Level = h 1for all N}, i.e., he se of nodes ha are (h1) hops from he cenral node. B = { Level < h for all N}, i.e., he se of nodes ha are a mos (h-1) hops from he cenral node. Iniially, X = Xˆ ( µ ). Noe ha, since all of he values above are dependen upon he value of X, hey mus be recompued each ime X is modified by replacemen of one or more links. Sep 1. If B = φ, hen STOP; Else for each B, find max lev = max { Level i }. i Leaf Sep. Find s.. max lev = h 1. Proceedings of he 36h Hawaii Inernaional Conference on Sysem Sciences (HICSS 03)
4 Sep 3. If = { φ}, hen go o Sep 4; Else Se X g = 0 and X = 1, and reurn o Sep 1. 1 Ties if any are broken arbirarily. Sep 4. If B = φ, hen STOP; ELSE for each B and i B, find = { C Cg (Leveli Levelg )QD }; Sep 5. Find ( i, ) arg min{ } = ; i, Sep 6. Se X = 0 and X 1, g i = and reurn o Sep Numerical resuls The effeciveness of he Lagrangian based heurisic was invesigaed by solving a randomly generaed se of es problems. The daa for he compuaional experimens were generaed by drawing he coordinaes of he nodes from a uniform disribuion over a square of size 1000 by The annual cos of link (i, ) was chosen o be he Euclidean disance beween poin i and poin. The node ouage coss were randomly generaed from a uniform disribuion U[0,1000]. We solved he problems for n = 0, 40, and 60; h = 3, 4, and 5; and Q = 0.0, 0.04, and In our experimens we assumed h = h for all є N. For each parameer se we solved 3 insances of he problem and compued he average gap. For purposes of he subgradien opimizaion mehod, we used he bes heurisic soluion obained so far as he overesimae of he opimal obecive funcion value. The iniial value of he scalar λ was se o, and halved whenever L ( µ p, θ p ) did no improve in successive ieraions. The Lagrange mulipliers were iniially se o 0. The sopping crierion in compuaion of he lower bounds was: sop if he oal number of ieraions exceeds 4000 or if he obecive funcion value changes by less han 0. in successive ieraions. The Lagrangian based heurisic mehod was coded in Forran 77 and run on IBM SP compuer wih a maximum processing speed of 888 MHz. Compuaional resuls of he experimen are presened in Table 1. The compuaional resuls presened in Table 1 show ha he average gap beween he heurisic soluion and he Lagrangian lower bound is wihin 14 percen. This gap provides an upper bound for he gap beween he heurisic and opimal soluions. Table 1. Compuaional resuls N h Q Average Gap % % % % % % % % % % % % % % % % % % % % % % % % % % % Gap=(heurisic soluion lower bound)/(heurisic soluion) 5. Conclusions In his paper we presened an ineger programming model of a hop consrained min-sum arborescence problem wih node ouage coss, in which he erminal nodes in he nework mus be conneced o a cenral node wih a consrain ha limis he maximum number of links beween he cenral node and each erminal node o a predeermined number h. We have suggesed a Lagrangian based heurisic o find a low cos feasible soluion. The lower bound found as a byproduc of he soluion procedure is used o esimae he qualiy of he heurisic soluion. Compuaional resuls for a variey of problems are repored. In our compuaional experimen, he average gap beween he heurisic soluion value and he opimal soluion is shown o be wihin 14 percen. Proceedings of he 36h Hawaii Inernaional Conference on Sysem Sciences (HICSS 03)
5 6. References [1] M. Fischei and P. Toh, "An efficien algorihm for he min-sum arborescence problem on complee digraphs," ORSA Journal on Compuing, vol. 5, no. 4, pp , [] M. L. Fisher, "The Lagrangian relaxaion mehod for solving ineger programming problems", Managemen Science, vol. 7, 1-18, [3] L. Gouveia, Mulicommodiy flow models for spanning rees wih hop consrains, European Journal of Operaional Research, vol. 95, , [4] M. Held, P. Wolfe, and H. D. Crowder, "Validaion of Subgradien Opimizaion", Mahemaical Programming, vol. 6, 6-88, [5] R. Larson, and A. Odoni, "Urban Operaions Research", Prenice Hall, Englewood Cliffs, N. J., [6] L. LeBlanc and R. Reddoch, Reliable link opology/capaciy design and rouing in backbone elecommunicaion neworks, paper presened a he Firs ORSA Telecommunicaions SIG conference, Proceedings of he 36h Hawaii Inernaional Conference on Sysem Sciences (HICSS 03)
An introduction to the theory of SDDP algorithm
An inroducion o he heory of SDDP algorihm V. Leclère (ENPC) Augus 1, 2014 V. Leclère Inroducion o SDDP Augus 1, 2014 1 / 21 Inroducion Large scale sochasic problem are hard o solve. Two ways of aacking
More informationApplying Genetic Algorithms for Inventory Lot-Sizing Problem with Supplier Selection under Storage Capacity Constraints
IJCSI Inernaional Journal of Compuer Science Issues, Vol 9, Issue 1, No 1, January 2012 wwwijcsiorg 18 Applying Geneic Algorihms for Invenory Lo-Sizing Problem wih Supplier Selecion under Sorage Capaciy
More information3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon
3..3 INRODUCION O DYNAMIC OPIMIZAION: DISCREE IME PROBLEMS A. he Hamilonian and Firs-Order Condiions in a Finie ime Horizon Define a new funcion, he Hamilonian funcion, H. H he change in he oal value of
More informationT L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB
Elecronic Companion EC.1. Proofs of Technical Lemmas and Theorems LEMMA 1. Le C(RB) be he oal cos incurred by he RB policy. Then we have, T L E[C(RB)] 3 E[Z RB ]. (EC.1) Proof of Lemma 1. Using he marginal
More informationComputer-Aided Analysis of Electronic Circuits Course Notes 3
Gheorghe Asachi Technical Universiy of Iasi Faculy of Elecronics, Telecommunicaions and Informaion Technologies Compuer-Aided Analysis of Elecronic Circuis Course Noes 3 Bachelor: Telecommunicaion Technologies
More informationEnergy Storage Benchmark Problems
Energy Sorage Benchmark Problems Daniel F. Salas 1,3, Warren B. Powell 2,3 1 Deparmen of Chemical & Biological Engineering 2 Deparmen of Operaions Research & Financial Engineering 3 Princeon Laboraory
More informationDynamic Programming 11/8/2009. Weighted Interval Scheduling. Weighted Interval Scheduling. Unweighted Interval Scheduling: Review
//9 Algorihms Dynamic Programming - Weighed Ineral Scheduling Dynamic Programming Weighed ineral scheduling problem. Insance A se of n jobs. Job j sars a s j, finishes a f j, and has weigh or alue j. Two
More informationRandom Walk with Anti-Correlated Steps
Random Walk wih Ani-Correlaed Seps John Noga Dirk Wagner 2 Absrac We conjecure he expeced value of random walks wih ani-correlaed seps o be exacly. We suppor his conjecure wih 2 plausibiliy argumens and
More informationSingle-Pass-Based Heuristic Algorithms for Group Flexible Flow-shop Scheduling Problems
Single-Pass-Based Heurisic Algorihms for Group Flexible Flow-shop Scheduling Problems PEI-YING HUANG, TZUNG-PEI HONG 2 and CHENG-YAN KAO, 3 Deparmen of Compuer Science and Informaion Engineering Naional
More informationSTATE-SPACE MODELLING. A mass balance across the tank gives:
B. Lennox and N.F. Thornhill, 9, Sae Space Modelling, IChemE Process Managemen and Conrol Subjec Group Newsleer STE-SPACE MODELLING Inroducion: Over he pas decade or so here has been an ever increasing
More informationInventory Control of Perishable Items in a Two-Echelon Supply Chain
Journal of Indusrial Engineering, Universiy of ehran, Special Issue,, PP. 69-77 69 Invenory Conrol of Perishable Iems in a wo-echelon Supply Chain Fariborz Jolai *, Elmira Gheisariha and Farnaz Nojavan
More informationMATH 5720: Gradient Methods Hung Phan, UMass Lowell October 4, 2018
MATH 5720: Gradien Mehods Hung Phan, UMass Lowell Ocober 4, 208 Descen Direcion Mehods Consider he problem min { f(x) x R n}. The general descen direcions mehod is x k+ = x k + k d k where x k is he curren
More informationVehicle Arrival Models : Headway
Chaper 12 Vehicle Arrival Models : Headway 12.1 Inroducion Modelling arrival of vehicle a secion of road is an imporan sep in raffic flow modelling. I has imporan applicaion in raffic flow simulaion where
More informationTechnical Report Doc ID: TR March-2013 (Last revision: 23-February-2016) On formulating quadratic functions in optimization models.
Technical Repor Doc ID: TR--203 06-March-203 (Las revision: 23-Februar-206) On formulaing quadraic funcions in opimizaion models. Auhor: Erling D. Andersen Convex quadraic consrains quie frequenl appear
More informationApplication of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing
Applicaion of a Sochasic-Fuzzy Approach o Modeling Opimal Discree Time Dynamical Sysems by Using Large Scale Daa Processing AA WALASZE-BABISZEWSA Deparmen of Compuer Engineering Opole Universiy of Technology
More informationAppendix to Creating Work Breaks From Available Idleness
Appendix o Creaing Work Breaks From Available Idleness Xu Sun and Ward Whi Deparmen of Indusrial Engineering and Operaions Research, Columbia Universiy, New York, NY, 127; {xs2235,ww24}@columbia.edu Sepember
More informationMaintenance Models. Prof. Robert C. Leachman IEOR 130, Methods of Manufacturing Improvement Spring, 2011
Mainenance Models Prof Rober C Leachman IEOR 3, Mehods of Manufacuring Improvemen Spring, Inroducion The mainenance of complex equipmen ofen accouns for a large porion of he coss associaed wih ha equipmen
More informationModal identification of structures from roving input data by means of maximum likelihood estimation of the state space model
Modal idenificaion of srucures from roving inpu daa by means of maximum likelihood esimaion of he sae space model J. Cara, J. Juan, E. Alarcón Absrac The usual way o perform a forced vibraion es is o fix
More informationProbabilistic Models for Reliability Analysis of a System with Three Consecutive Stages of Deterioration
Yusuf I., Gaawa R.I. Volume, December 206 Probabilisic Models for Reliabiliy Analysis of a Sysem wih Three Consecuive Sages of Deerioraion Ibrahim Yusuf Deparmen of Mahemaical Sciences, Bayero Universiy,
More informationSolutions for Assignment 2
Faculy of rs and Science Universiy of Torono CSC 358 - Inroducion o Compuer Neworks, Winer 218 Soluions for ssignmen 2 Quesion 1 (2 Poins): Go-ack n RQ In his quesion, we review how Go-ack n RQ can be
More informationEssential Microeconomics : OPTIMAL CONTROL 1. Consider the following class of optimization problems
Essenial Microeconomics -- 6.5: OPIMAL CONROL Consider he following class of opimizaion problems Max{ U( k, x) + U+ ( k+ ) k+ k F( k, x)}. { x, k+ } = In he language of conrol heory, he vecor k is he vecor
More informationLecture 20: Riccati Equations and Least Squares Feedback Control
34-5 LINEAR SYSTEMS Lecure : Riccai Equaions and Leas Squares Feedback Conrol 5.6.4 Sae Feedback via Riccai Equaions A recursive approach in generaing he marix-valued funcion W ( ) equaion for i for he
More informationIntroduction to Probability and Statistics Slides 4 Chapter 4
Inroducion o Probabiliy and Saisics Slides 4 Chaper 4 Ammar M. Sarhan, asarhan@mahsa.dal.ca Deparmen of Mahemaics and Saisics, Dalhousie Universiy Fall Semeser 8 Dr. Ammar Sarhan Chaper 4 Coninuous Random
More informationA Primal-Dual Type Algorithm with the O(1/t) Convergence Rate for Large Scale Constrained Convex Programs
PROC. IEEE CONFERENCE ON DECISION AND CONTROL, 06 A Primal-Dual Type Algorihm wih he O(/) Convergence Rae for Large Scale Consrained Convex Programs Hao Yu and Michael J. Neely Absrac This paper considers
More informationAir Traffic Forecast Empirical Research Based on the MCMC Method
Compuer and Informaion Science; Vol. 5, No. 5; 0 ISSN 93-8989 E-ISSN 93-8997 Published by Canadian Cener of Science and Educaion Air Traffic Forecas Empirical Research Based on he MCMC Mehod Jian-bo Wang,
More informationA Shooting Method for A Node Generation Algorithm
A Shooing Mehod for A Node Generaion Algorihm Hiroaki Nishikawa W.M.Keck Foundaion Laboraory for Compuaional Fluid Dynamics Deparmen of Aerospace Engineering, Universiy of Michigan, Ann Arbor, Michigan
More informationCHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK
175 CHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK 10.1 INTRODUCTION Amongs he research work performed, he bes resuls of experimenal work are validaed wih Arificial Neural Nework. From he
More informationScheduling of Crude Oil Movements at Refinery Front-end
Scheduling of Crude Oil Movemens a Refinery Fron-end Ramkumar Karuppiah and Ignacio Grossmann Carnegie Mellon Universiy ExxonMobil Case Sudy: Dr. Kevin Furman Enerprise-wide Opimizaion Projec March 15,
More informationEnsamble methods: Boosting
Lecure 21 Ensamble mehods: Boosing Milos Hauskrech milos@cs.pi.edu 5329 Senno Square Schedule Final exam: April 18: 1:00-2:15pm, in-class Term projecs April 23 & April 25: a 1:00-2:30pm in CS seminar room
More informationOptima and Equilibria for Traffic Flow on a Network
Opima and Equilibria for Traffic Flow on a Nework Albero Bressan Deparmen of Mahemaics, Penn Sae Universiy bressan@mah.psu.edu Albero Bressan (Penn Sae) Opima and equilibria for raffic flow 1 / 1 A Traffic
More informationParticle Swarm Optimization Combining Diversification and Intensification for Nonlinear Integer Programming Problems
Paricle Swarm Opimizaion Combining Diversificaion and Inensificaion for Nonlinear Ineger Programming Problems Takeshi Masui, Masaoshi Sakawa, Kosuke Kao and Koichi Masumoo Hiroshima Universiy 1-4-1, Kagamiyama,
More informationTesting for a Single Factor Model in the Multivariate State Space Framework
esing for a Single Facor Model in he Mulivariae Sae Space Framework Chen C.-Y. M. Chiba and M. Kobayashi Inernaional Graduae School of Social Sciences Yokohama Naional Universiy Japan Faculy of Economics
More informationNotes for Lecture 17-18
U.C. Berkeley CS278: Compuaional Complexiy Handou N7-8 Professor Luca Trevisan April 3-8, 2008 Noes for Lecure 7-8 In hese wo lecures we prove he firs half of he PCP Theorem, he Amplificaion Lemma, up
More informationRapid Termination Evaluation for Recursive Subdivision of Bezier Curves
Rapid Terminaion Evaluaion for Recursive Subdivision of Bezier Curves Thomas F. Hain School of Compuer and Informaion Sciences, Universiy of Souh Alabama, Mobile, AL, U.S.A. Absrac Bézier curve flaening
More informationPhysics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle
Chaper 2 Newonian Mechanics Single Paricle In his Chaper we will review wha Newon s laws of mechanics ell us abou he moion of a single paricle. Newon s laws are only valid in suiable reference frames,
More informationZápadočeská Univerzita v Plzni, Czech Republic and Groupe ESIEE Paris, France
ADAPTIVE SIGNAL PROCESSING USING MAXIMUM ENTROPY ON THE MEAN METHOD AND MONTE CARLO ANALYSIS Pavla Holejšovsá, Ing. *), Z. Peroua, Ing. **), J.-F. Bercher, Prof. Assis. ***) Západočesá Univerzia v Plzni,
More informationCMU-Q Lecture 3: Search algorithms: Informed. Teacher: Gianni A. Di Caro
CMU-Q 5-38 Lecure 3: Search algorihms: Informed Teacher: Gianni A. Di Caro UNINFORMED VS. INFORMED SEARCH Sraegy How desirable is o be in a cerain inermediae sae for he sake of (effecively) reaching a
More informationEnsamble methods: Bagging and Boosting
Lecure 21 Ensamble mehods: Bagging and Boosing Milos Hauskrech milos@cs.pi.edu 5329 Senno Square Ensemble mehods Mixure of expers Muliple base models (classifiers, regressors), each covers a differen par
More informationApplying Genetic Algorithms for Inventory Lot-Sizing Problem with Supplier Selection under Storage Space
Inernaional Journal of Indusrial and Manufacuring Engineering Applying Geneic Algorihms for Invenory Lo-Sizing Problem wih Supplier Selecion under Sorage Space Vichai Rungreunganaun and Chirawa Woarawichai
More informationCENTRALIZED VERSUS DECENTRALIZED PRODUCTION PLANNING IN SUPPLY CHAINS
CENRALIZED VERSUS DECENRALIZED PRODUCION PLANNING IN SUPPLY CHAINS Georges SAHARIDIS* a, Yves DALLERY* a, Fikri KARAESMEN* b * a Ecole Cenrale Paris Deparmen of Indusial Engineering (LGI), +3343388, saharidis,dallery@lgi.ecp.fr
More informationSignal and System (Chapter 3. Continuous-Time Systems)
Signal and Sysem (Chaper 3. Coninuous-Time Sysems) Prof. Kwang-Chun Ho kwangho@hansung.ac.kr Tel: 0-760-453 Fax:0-760-4435 1 Dep. Elecronics and Informaion Eng. 1 Nodes, Branches, Loops A nework wih b
More informationLet us start with a two dimensional case. We consider a vector ( x,
Roaion marices We consider now roaion marices in wo and hree dimensions. We sar wih wo dimensions since wo dimensions are easier han hree o undersand, and one dimension is a lile oo simple. However, our
More informationOn a Discrete-In-Time Order Level Inventory Model for Items with Random Deterioration
Journal of Agriculure and Life Sciences Vol., No. ; June 4 On a Discree-In-Time Order Level Invenory Model for Iems wih Random Deerioraion Dr Biswaranjan Mandal Associae Professor of Mahemaics Acharya
More informationInnova Junior College H2 Mathematics JC2 Preliminary Examinations Paper 2 Solutions 0 (*)
Soluion 3 x 4x3 x 3 x 0 4x3 x 4x3 x 4x3 x 4x3 x x 3x 3 4x3 x Innova Junior College H Mahemaics JC Preliminary Examinaions Paper Soluions 3x 3 4x 3x 0 4x 3 4x 3 0 (*) 0 0 + + + - 3 3 4 3 3 3 3 Hence x or
More informationINTRODUCTION TO MACHINE LEARNING 3RD EDITION
ETHEM ALPAYDIN The MIT Press, 2014 Lecure Slides for INTRODUCTION TO MACHINE LEARNING 3RD EDITION alpaydin@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/i2ml3e CHAPTER 2: SUPERVISED LEARNING Learning a Class
More informationDecentralized Stochastic Control with Partial History Sharing: A Common Information Approach
1 Decenralized Sochasic Conrol wih Parial Hisory Sharing: A Common Informaion Approach Ashuosh Nayyar, Adiya Mahajan and Demoshenis Tenekezis arxiv:1209.1695v1 [cs.sy] 8 Sep 2012 Absrac A general model
More information8. Basic RL and RC Circuits
8. Basic L and C Circuis This chaper deals wih he soluions of he responses of L and C circuis The analysis of C and L circuis leads o a linear differenial equaion This chaper covers he following opics
More informationResource Allocation in Visible Light Communication Networks NOMA vs. OFDMA Transmission Techniques
Resource Allocaion in Visible Ligh Communicaion Neworks NOMA vs. OFDMA Transmission Techniques Eirini Eleni Tsiropoulou, Iakovos Gialagkolidis, Panagiois Vamvakas, and Symeon Papavassiliou Insiue of Communicaions
More informationSimulation-Solving Dynamic Models ABE 5646 Week 2, Spring 2010
Simulaion-Solving Dynamic Models ABE 5646 Week 2, Spring 2010 Week Descripion Reading Maerial 2 Compuer Simulaion of Dynamic Models Finie Difference, coninuous saes, discree ime Simple Mehods Euler Trapezoid
More informationChristos Papadimitriou & Luca Trevisan November 22, 2016
U.C. Bereley CS170: Algorihms Handou LN-11-22 Chrisos Papadimiriou & Luca Trevisan November 22, 2016 Sreaming algorihms In his lecure and he nex one we sudy memory-efficien algorihms ha process a sream
More informationDeteriorating Inventory Model with Time. Dependent Demand and Partial Backlogging
Applied Mahemaical Sciences, Vol. 4, 00, no. 7, 36-369 Deerioraing Invenory Model wih Time Dependen Demand and Parial Backlogging Vinod Kumar Mishra Deparmen of Compuer Science & Engineering Kumaon Engineering
More informationA Forward-Backward Splitting Method with Component-wise Lazy Evaluation for Online Structured Convex Optimization
A Forward-Backward Spliing Mehod wih Componen-wise Lazy Evaluaion for Online Srucured Convex Opimizaion Yukihiro Togari and Nobuo Yamashia March 28, 2016 Absrac: We consider large-scale opimizaion problems
More informationCONTROL SYSTEMS, ROBOTICS AND AUTOMATION Vol. XI Control of Stochastic Systems - P.R. Kumar
CONROL OF SOCHASIC SYSEMS P.R. Kumar Deparmen of Elecrical and Compuer Engineering, and Coordinaed Science Laboraory, Universiy of Illinois, Urbana-Champaign, USA. Keywords: Markov chains, ransiion probabiliies,
More informationStationary Distribution. Design and Analysis of Algorithms Andrei Bulatov
Saionary Disribuion Design and Analysis of Algorihms Andrei Bulaov Algorihms Markov Chains 34-2 Classificaion of Saes k By P we denoe he (i,j)-enry of i, j Sae is accessible from sae if 0 for some k 0
More informationCombined Bending with Induced or Applied Torsion of FRP I-Section Beams
Combined Bending wih Induced or Applied Torsion of FRP I-Secion Beams MOJTABA B. SIRJANI School of Science and Technology Norfolk Sae Universiy Norfolk, Virginia 34504 USA sirjani@nsu.edu STEA B. BONDI
More informationSupplement for Stochastic Convex Optimization: Faster Local Growth Implies Faster Global Convergence
Supplemen for Sochasic Convex Opimizaion: Faser Local Growh Implies Faser Global Convergence Yi Xu Qihang Lin ianbao Yang Proof of heorem heorem Suppose Assumpion holds and F (w) obeys he LGC (6) Given
More informationVariational Iteration Method for Solving System of Fractional Order Ordinary Differential Equations
IOSR Journal of Mahemaics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 1, Issue 6 Ver. II (Nov - Dec. 214), PP 48-54 Variaional Ieraion Mehod for Solving Sysem of Fracional Order Ordinary Differenial
More informationChapter 3 Boundary Value Problem
Chaper 3 Boundary Value Problem A boundary value problem (BVP) is a problem, ypically an ODE or a PDE, which has values assigned on he physical boundary of he domain in which he problem is specified. Le
More informationEchocardiography Project and Finite Fourier Series
Echocardiography Projec and Finie Fourier Series 1 U M An echocardiagram is a plo of how a porion of he hear moves as he funcion of ime over he one or more hearbea cycles If he hearbea repeas iself every
More information5.2. The Natural Logarithm. Solution
5.2 The Naural Logarihm The number e is an irraional number, similar in naure o π. Is non-erminaing, non-repeaing value is e 2.718 281 828 59. Like π, e also occurs frequenly in naural phenomena. In fac,
More informationStochastic Perishable Inventory Systems: Dual-Balancing and Look-Ahead Approaches
Sochasic Perishable Invenory Sysems: Dual-Balancing and Look-Ahead Approaches by Yuhe Diao A hesis presened o he Universiy Of Waerloo in fulfilmen of he hesis requiremen for he degree of Maser of Applied
More informationTom Heskes and Onno Zoeter. Presented by Mark Buller
Tom Heskes and Onno Zoeer Presened by Mark Buller Dynamic Bayesian Neworks Direced graphical models of sochasic processes Represen hidden and observed variables wih differen dependencies Generalize Hidden
More informationLearning a Class from Examples. Training set X. Class C 1. Class C of a family car. Output: Input representation: x 1 : price, x 2 : engine power
Alpaydin Chaper, Michell Chaper 7 Alpaydin slides are in urquoise. Ehem Alpaydin, copyrigh: The MIT Press, 010. alpaydin@boun.edu.r hp://www.cmpe.boun.edu.r/ ehem/imle All oher slides are based on Michell.
More informationLogic in computer science
Logic in compuer science Logic plays an imporan role in compuer science Logic is ofen called he calculus of compuer science Logic plays a similar role in compuer science o ha played by calculus in he physical
More informationExponential Weighted Moving Average (EWMA) Chart Under The Assumption of Moderateness And Its 3 Control Limits
DOI: 0.545/mjis.07.5009 Exponenial Weighed Moving Average (EWMA) Char Under The Assumpion of Moderaeness And Is 3 Conrol Limis KALPESH S TAILOR Assisan Professor, Deparmen of Saisics, M. K. Bhavnagar Universiy,
More informationY. Xiang, Learning Bayesian Networks 1
Learning Bayesian Neworks Objecives Acquisiion of BNs Technical conex of BN learning Crierion of sound srucure learning BN srucure learning in 2 seps BN CPT esimaion Reference R.E. Neapolian: Learning
More informationPENALIZED LEAST SQUARES AND PENALIZED LIKELIHOOD
PENALIZED LEAST SQUARES AND PENALIZED LIKELIHOOD HAN XIAO 1. Penalized Leas Squares Lasso solves he following opimizaion problem, ˆβ lasso = arg max β R p+1 1 N y i β 0 N x ij β j β j (1.1) for some 0.
More informationExcel-Based Solution Method For The Optimal Policy Of The Hadley And Whittin s Exact Model With Arma Demand
Excel-Based Soluion Mehod For The Opimal Policy Of The Hadley And Whiin s Exac Model Wih Arma Demand Kal Nami School of Business and Economics Winson Salem Sae Universiy Winson Salem, NC 27110 Phone: (336)750-2338
More informationAn Optimal Dynamic Generation Scheduling for a Wind-Thermal Power System *
Energy and Power Engineering, 2013, 5, 1016-1021 doi:10.4236/epe.2013.54b194 Published Online July 2013 (hp://www.scirp.org/journal/epe) An Opimal Dynamic Generaion Scheduling for a Wind-Thermal Power
More information0.1 MAXIMUM LIKELIHOOD ESTIMATION EXPLAINED
0.1 MAXIMUM LIKELIHOOD ESTIMATIO EXPLAIED Maximum likelihood esimaion is a bes-fi saisical mehod for he esimaion of he values of he parameers of a sysem, based on a se of observaions of a random variable
More informationA Dynamic Model of Economic Fluctuations
CHAPTER 15 A Dynamic Model of Economic Flucuaions Modified for ECON 2204 by Bob Murphy 2016 Worh Publishers, all righs reserved IN THIS CHAPTER, OU WILL LEARN: how o incorporae dynamics ino he AD-AS model
More informationBU Macro BU Macro Fall 2008, Lecture 4
Dynamic Programming BU Macro 2008 Lecure 4 1 Ouline 1. Cerainy opimizaion problem used o illusrae: a. Resricions on exogenous variables b. Value funcion c. Policy funcion d. The Bellman equaion and an
More informationArticle from. Predictive Analytics and Futurism. July 2016 Issue 13
Aricle from Predicive Analyics and Fuurism July 6 Issue An Inroducion o Incremenal Learning By Qiang Wu and Dave Snell Machine learning provides useful ools for predicive analyics The ypical machine learning
More informationSolutions to Assignment 1
MA 2326 Differenial Equaions Insrucor: Peronela Radu Friday, February 8, 203 Soluions o Assignmen. Find he general soluions of he following ODEs: (a) 2 x = an x Soluion: I is a separable equaion as we
More informationErrata (1 st Edition)
P Sandborn, os Analysis of Elecronic Sysems, s Ediion, orld Scienific, Singapore, 03 Erraa ( s Ediion) S K 05D Page 8 Equaion (7) should be, E 05D E Nu e S K he L appearing in he equaion in he book does
More informationA High-Speed Machining Algorithm For Continuous Corners
IOSR Journal of Mechanical and Civil Engineering (IOSR-JMCE) e-issn: 78-1684,p-ISSN: 30-334X, Volume 15, Issue 5 Ver. III (Sep. - Oc. 018), PP 64-69 www.iosrjournals.org A High-Speed Machining Algorihm
More informationLearning a Class from Examples. Training set X. Class C 1. Class C of a family car. Output: Input representation: x 1 : price, x 2 : engine power
Alpaydin Chaper, Michell Chaper 7 Alpaydin slides are in urquoise. Ehem Alpaydin, copyrigh: The MIT Press, 010. alpaydin@boun.edu.r hp://www.cmpe.boun.edu.r/ ehem/imle All oher slides are based on Michell.
More informationINVERSE RESPONSE COMPENSATION BY ESTIMATING PARAMETERS OF A PROCESS COMPRISING OF TWO FIRST ORDER SYSTEMS
Inernaional Journal of Informaion Technology and nowledge Managemen July-December 0, Volume 5, No., pp. 433-438 INVERSE RESPONSE COMPENSATION BY ESTIMATING PARAMETERS OF A PROCESS COMPRISING OF TWO FIRST
More informationApproximation Algorithms for Unique Games via Orthogonal Separators
Approximaion Algorihms for Unique Games via Orhogonal Separaors Lecure noes by Konsanin Makarychev. Lecure noes are based on he papers [CMM06a, CMM06b, LM4]. Unique Games In hese lecure noes, we define
More information3, so θ = arccos
Mahemaics 210 Professor Alan H Sein Monday, Ocober 1, 2007 SOLUTIONS This problem se is worh 50 poins 1 Find he angle beween he vecors (2, 7, 3) and (5, 2, 4) Soluion: Le θ be he angle (2, 7, 3) (5, 2,
More informationODEs II, Lecture 1: Homogeneous Linear Systems - I. Mike Raugh 1. March 8, 2004
ODEs II, Lecure : Homogeneous Linear Sysems - I Mike Raugh March 8, 4 Inroducion. In he firs lecure we discussed a sysem of linear ODEs for modeling he excreion of lead from he human body, saw how o ransform
More informationMean-square Stability Control for Networked Systems with Stochastic Time Delay
JOURNAL OF SIMULAION VOL. 5 NO. May 7 Mean-square Sabiliy Conrol for Newored Sysems wih Sochasic ime Delay YAO Hejun YUAN Fushun School of Mahemaics and Saisics Anyang Normal Universiy Anyang Henan. 455
More informationNotes on Kalman Filtering
Noes on Kalman Filering Brian Borchers and Rick Aser November 7, Inroducion Daa Assimilaion is he problem of merging model predicions wih acual measuremens of a sysem o produce an opimal esimae of he curren
More informationRobust estimation based on the first- and third-moment restrictions of the power transformation model
h Inernaional Congress on Modelling and Simulaion, Adelaide, Ausralia, 6 December 3 www.mssanz.org.au/modsim3 Robus esimaion based on he firs- and hird-momen resricions of he power ransformaion Nawaa,
More informationThe Production-Distribution Problem in the Supply Chain Network using Genetic Algorithm
Inernaional Journal o Applied Engineering Research ISSN 0973-4562 Volume 12, Number 23 (2017) pp. 13570-13581 Research India Publicaions. hp://www.ripublicaion.com The Producion-Disribuion Problem in he
More informationSupplementary Document
Saisica Sinica (2013): Preprin 1 Supplemenary Documen for Funcional Linear Model wih Zero-value Coefficien Funcion a Sub-regions Jianhui Zhou, Nae-Yuh Wang, and Naisyin Wang Universiy of Virginia, Johns
More informationThe equation to any straight line can be expressed in the form:
Sring Graphs Par 1 Answers 1 TI-Nspire Invesigaion Suden min Aims Deermine a series of equaions of sraigh lines o form a paern similar o ha formed by he cables on he Jerusalem Chords Bridge. Deermine he
More informationShiva Akhtarian MSc Student, Department of Computer Engineering and Information Technology, Payame Noor University, Iran
Curren Trends in Technology and Science ISSN : 79-055 8hSASTech 04 Symposium on Advances in Science & Technology-Commission-IV Mashhad, Iran A New for Sofware Reliabiliy Evaluaion Based on NHPP wih Imperfec
More informationUnsteady Flow Problems
School of Mechanical Aerospace and Civil Engineering Unseady Flow Problems T. J. Craf George Begg Building, C41 TPFE MSc CFD-1 Reading: J. Ferziger, M. Peric, Compuaional Mehods for Fluid Dynamics H.K.
More information10. State Space Methods
. Sae Space Mehods. Inroducion Sae space modelling was briefly inroduced in chaper. Here more coverage is provided of sae space mehods before some of heir uses in conrol sysem design are covered in he
More informationMechanical Fatigue and Load-Induced Aging of Loudspeaker Suspension. Wolfgang Klippel,
Mechanical Faigue and Load-Induced Aging of Loudspeaker Suspension Wolfgang Klippel, Insiue of Acousics and Speech Communicaion Dresden Universiy of Technology presened a he ALMA Symposium 2012, Las Vegas
More informationCHAPTER 12 DIRECT CURRENT CIRCUITS
CHAPTER 12 DIRECT CURRENT CIUITS DIRECT CURRENT CIUITS 257 12.1 RESISTORS IN SERIES AND IN PARALLEL When wo resisors are conneced ogeher as shown in Figure 12.1 we said ha hey are conneced in series. As
More informationOptimal Path Planning for Flexible Redundant Robot Manipulators
25 WSEAS In. Conf. on DYNAMICAL SYSEMS and CONROL, Venice, Ialy, November 2-4, 25 (pp363-368) Opimal Pah Planning for Flexible Redundan Robo Manipulaors H. HOMAEI, M. KESHMIRI Deparmen of Mechanical Engineering
More informationGlobal Optimization for Scheduling Refinery Crude Oil Operations
Global Opimizaion for Scheduling Refinery Crude Oil Operaions Ramkumar Karuppiah 1, Kevin C. Furman 2 and Ignacio E. Grossmann 1 (1) Deparmen of Chemical Engineering Carnegie Mellon Universiy (2) Corporae
More informationcontrol properties under both Gaussian and burst noise conditions. In the ~isappointing in comparison with convolutional code systems designed
535 SOFT-DECSON THRESHOLD DECODNG OF CONVOLUTONAL CODES R.M.F. Goodman*, B.Sc., Ph.D. W.H. Ng*, M.S.E.E. Sunnnary Exising majoriy-decision hreshold decoders have so far been limied o his paper a new mehod
More informationSZG Macro 2011 Lecture 3: Dynamic Programming. SZG macro 2011 lecture 3 1
SZG Macro 2011 Lecure 3: Dynamic Programming SZG macro 2011 lecure 3 1 Background Our previous discussion of opimal consumpion over ime and of opimal capial accumulaion sugges sudying he general decision
More informationLecture 9: September 25
0-725: Opimizaion Fall 202 Lecure 9: Sepember 25 Lecurer: Geoff Gordon/Ryan Tibshirani Scribes: Xuezhi Wang, Subhodeep Moira, Abhimanu Kumar Noe: LaTeX emplae couresy of UC Berkeley EECS dep. Disclaimer:
More informationRobotics I. April 11, The kinematics of a 3R spatial robot is specified by the Denavit-Hartenberg parameters in Tab. 1.
Roboics I April 11, 017 Exercise 1 he kinemaics of a 3R spaial robo is specified by he Denavi-Harenberg parameers in ab 1 i α i d i a i θ i 1 π/ L 1 0 1 0 0 L 3 0 0 L 3 3 able 1: able of DH parameers of
More informationLecture 2 October ε-approximation of 2-player zero-sum games
Opimizaion II Winer 009/10 Lecurer: Khaled Elbassioni Lecure Ocober 19 1 ε-approximaion of -player zero-sum games In his lecure we give a randomized ficiious play algorihm for obaining an approximae soluion
More informationBBP-type formulas, in general bases, for arctangents of real numbers
Noes on Number Theory and Discree Mahemaics Vol. 19, 13, No. 3, 33 54 BBP-ype formulas, in general bases, for arcangens of real numbers Kunle Adegoke 1 and Olawanle Layeni 2 1 Deparmen of Physics, Obafemi
More information