Dynamic Programming 11/8/2009. Weighted Interval Scheduling. Weighted Interval Scheduling. Unweighted Interval Scheduling: Review
|
|
- Christiana Potter
- 6 years ago
- Views:
Transcription
1 //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 jobs compaible if hey don' oerlap. Objecie Find maximum weigh subse of muually compaible jobs. Daa Srucures and Algorihms Andrei Bulao Algorihms Dynamic Programming - Algorihms Dynamic Programming - Unweighed Ineral Scheduling: Reiew Recall: Greedy algorihm works if all weighs are. Consider jobs in ascending order of finish ime. Add job o subse if i is compaible wih preiously chosen jobs. Obseraion. Greedy algorihm can fail specacularly if arbirary weighs are allowed. weigh = 999 weigh = a b Time Weighed Ineral Scheduling Noaion: Label jobs by finishing ime: f f... f n. Le p(j) be he larges index i < j such ha job i is compaible wih j.. p() =, p(7) =, p() = Time Algorihms Dynamic Programming - Algorihms Dynamic Programming -6 Dynamic Programming: Binary Choice Le OPT(j) denoe he alue of an opimal soluion o he problem consising of job requess,,..., j. Case : OPT selecs job j. canno use incompaible jobs { p(j) +, p(j) +,..., j - } mus include opimal soluion o problem consising of remaining compaible jobs,,..., p(j) opimal subsrucure Case : OPT does no selec job j. mus include opimal soluion o problem consising of remaining compaible jobs,,..., j- OPT ( j) = max j { + OPT ( p( j)), OPT ( j ) } if j = oherwise Weighed Ineral Scheduling: Brue Force Inpu: n, s,,s n, f,,f n,,, n sor jobs by finish imes so ha f f f n compue p(), p(),, p(n) reurn Compue-Op(n) Compue-Op(j) if (j = ) reurn else reurn max( j +Compue-Op(p(j)),Compue-Op(j-))
2 //9 Algorihms Dynamic Programming -7 Algorihms Dynamic Programming - Weighed Ineral Scheduling: Brue Force Obseraion. Recursie algorihm fails specacularly because of redundan sub-problems exponenial algorihms. Number of recursie calls for family of "layered" insances grows like Fibonacci sequence. p() =, p(j) = j - Weighed Ineral Scheduling: Memoizaion Memoizaion: Sore resuls of each sub-problem in a cache; lookup as needed. Inpu: n, s,,s n, f,,f n,,, n sor jobs by finish imes so ha f f f n compue p(), p(),, p(n) se OPT[]:= for j= o n do se OPT[j]:=max( j +OPT[p(j)],OPT[j-]) reurn OPT[n] Algorihms Dynamic Programming -9 Algorihms Dynamic Programming - Weighed Ineral Scheduling: Running Time Auomaed Memoizaion Theorem Memoized ersion of algorihm akes O(n log n) ime. Sor by finish ime: O(n log n). Compuing p( ) : O(n) afer soring by finish ime Each ieraion of he for loop: O() Oerall ime is O(n log n) Remark. O(n) if jobs are pre-sored by finish imes Auomaed memoizaion. Many funcional programming languages (e.g., Lisp) hae buil-in suppor for memoizaion. Q. Why no in imperaie languages (e.g., Jaa)? (defun F (n) (if (<= n ) n (+ (F (- n )) (F (- n ))))) Lisp (efficien) saic in F(in n) { if (n <= ) reurn n; else reurn F(n-) + F(n-); } F(7) F() F(6) F(9) F(6) Jaa (exponenial) F(7) F() F() F(6) F(7) F() F() F() F(6) F() Algorihms Dynamic Programming - Algorihms Dynamic Programming - Finding a Soluion Dynamic programming algorihm compues opimal alue. Wha if we wan he soluion iself? Do some pos-processing Find-Soluion(j) if j = hen oupu nohing else if j +M[p(j)]>M[j-] hen do prin j Find-Soluion(p(j)) endif else Find-Soluion(j-) endif Knapsack The Knapsack Problem Insance: A se of n objecs, each of which has a posiie ineger alue i and a posiie ineger weigh w i. A weigh limi W. Objecie: Selec objecs so ha heir oal weigh does no exceed W, and hey hae maximal oal alue
3 //9 Algorihms Dynamic Programming - Algorihms Dynamic Programming - Idea A simple quesion: Should we include he las objec ino selecion? Le OPT(n,W) denoe he maximal alue of a selecion of objecs ou of {,, n} such ha he oal weigh of he selecion doesn exceed W More general, OPT(i,U) denoe he maximal alue of a selecion of objecs ou of {,, i} such ha he oal weigh of he selecion doesn exceed U Then OPT(n,W) = max{ OPT(n, W), OPT(n, W wi ) + i } Algorihm (Firs Try) Knapsack(n,W) se V:=Knapsack(n-,W) se V:=Knapsack(n-,W- w i ) oupu max(v,v+ i ) Is i good enough? Le he alues be,,,, he weighs,,,, and W = Recursion ree Algorihms Dynamic Programming - Algorihms Dynamic Programming -6 Anoher Idea: Memoizaion Le us sore alues OPT(i,U) as we find hem We need o sore (and compue) a mos n W numbers We ll do i in a regular way: Insead of recursion, we will compue hose alues saring from smaller ones, and fill up a able Algorihm (Second Try) Knapsack(n,W) array M[..n,..W] se M[,w]:= for each w=,,...,w for i= o n do for w= o W do se M[i,w]:= max{m[i,w],m[n-,w w i ]+ i } Algorihms Dynamic Programming -7 Algorihms Dynamic Programming - Le he alues be,,,, he weighs,,,, and W = w i M[i,w] = max{ M[ i, w], M[ n,w w i ] + i } 7 7 Shores Pah Suppose ha eery arc e of a digraph G has lengh (or cos, or weigh, or ) len(e) Bu now we allow negaie lenghs (weighs) Then we can naurally define he lengh of a direced pah in G, and he disance beween any wo nodes The s--shores Pah Problem Insance: Digraph G wih lenghs of arcs, and nodes s, Objecie: Find a shores pah beween s and
4 //9 Algorihms Dynamic Programming -9 Algorihms Dynamic Programming - Shores Pah: Difficulies Shores Pah: Obseraions Negaie Cycles. s < Assumpion There are no negaie cycles Greediness fails s Adding consan weigh o all arcs fails -6 If graph G has no negaie cycles, hen here is a shores pah from s o ha is simple (i.e. does no repea nodes), and hence has a mos n arcs If a shores pah P from s o repea a node, hen i also include a cycle C saring and ending a. The weigh of he cycle is non-negaie, herefore remoing he cycle makes he pah shorer (no longer). Algorihms Dynamic Programming - Algorihms Dynamic Programming - Shores Pah: Dynamic Programming We will be looking for a shores pah wih increasing number of arcs Le OPT(i,) denoe he minimum weigh of a pah from o using a mos i arcs w Shores pah can use i arcs. Then OPT(i,) = OPT(i,) Or i can use i arcs and he firs arc is w. Then OPT(i,) = len(w) + OPT(i,w) Shores Pah: Bellman-Ford Algorihm Shores-Pah(G,s,) se n:= V /*number of nodes in G array M[..n-,V] se M[,]:= and M[,]:= for each V-{} for i= o n- do for V do se M[i,w]:=min{M[i-,],min w V{M[i-,w]+len(w)}} reurn m[n-,s] OPT( i, ) = min{ OPT( i, ),min{ OPT( i, w) + len( w)}} w V Algorihms Dynamic Programming - Algorihms Dynamic Programming a b c - d e M[i,w] = min{ M[i, ], min w V{ M[ i, w] + len(w) }} Shores Pah: Soundness and Running Time Theorem The ShoresPah algorihm correcly compues he minimum cos of an s- pah in any graph ha has no negaie cycles, and runs in O( n ) ime. Soundness follows by inducion from he recurren relaion for he opimal alue. DIY. Running ime: We fill up a able wih n enries. Each of hem requires O(n) ime
5 //9 Algorihms Dynamic Programming - Algorihms Dynamic Programming -6 Shores Pah: Soundness and Running Time Theorem The ShoresPah algorihm can be implemened in O(mn) ime A big improemen for sparse graphs Shores Pah: Running Time Improemens I akes O( n ) o compue he array enry M[i,]. I needs o be compued for eery node and for each i, i n. Thus he bound for running ime is O n n = O(nm) V. Consider he compuaion of he array enry M[i,]: M[i,] = min{ M[i, ], min w V { M[ i, w] + len(w) }} We need only compue he minimum oer all nodes w for which has an edge o w Le n denoe he number of such edges Indeed, n is he oudegree of, and we hae he resul by he Handshaking. Algorihms Dynamic Programming -7 Algorihms Dynamic Programming - Shores Pah: Space Improemens The sraighforward implemenaion requires soring a able wih enries I can be reduced o O(n) Insead of recording M[i,] for each i, we use and updae a single alue M[] for each node, he lengh of he shores pah from o found so far Thus we use he following recurren relaion: M[] = min{ M[], min { M[ w] + len(w) }} w V Shores Pah: Space Improemens (cnd) Throughou he algorihm M[] is he lengh of some pah from o, and afer i rounds of updaes he alue M[] is no larger han he lengh of he shores from o using a mos i edges Algorihms Dynamic Programming -9 Algorihms Dynamic Programming - Shores Pah: Finding Shores Pah In he sandard ersion we only need o keep record on how he opimum is achieed Consider he space saing ersion. For each node sore he firs node on is pah o he desinaion Denoe i by firs() Updae i eery ime M[] is updaed Le P be he poiner graph P = (V, {(, firs()): V}) Shores Pah: Finding Shores Pah If he poiner graph P conains a cycle C, hen his cycle mus hae negaie cos. If w = firs() a any ime, hen M[] M[w] + len(w) Le,, K, k be he nodes along he cycle C, and ( k, ) he las arc o be added Consider he alues righ before his arc is added We hae M[ i ] M[ i+ ] + len( ii + ) for i =,, k and M[ k ] > M[ ] + len( k) Adding up all he inequaliies we ge k > len( ii + ) + len( k ) i=
6 //9 Algorihms Dynamic Programming - Algorihms Dynamic Programming - Shores Pah: Finding Shores Pah (cnd) Suppose G has no negaie cycles, and le P be he poiner graph afer erminaion of he algorihm. For each node, he pah in P from o is a shores - pah in G. Obsere ha P is a ree. Since he algorihm erminaes we hae M[] = M[w] + len(w), where w = firs(). As M[] =, he lengh of he pah raced ou by he poiner graph is exacly M[], which is he shores pah disance. Shores Pah: Finding Negaie Cycles Two quesions: - how o decide if here is a negaie cycle? - how o find one? I suffices o find negaie cycles C such ha can be reached from C < < Algorihms Dynamic Programming - Algorihms Dynamic Programming - Shores Pah: Finding Negaie Cycles Le G be a graph The augmened graph, A(G), is obained by adding a new node and connecing eery node in G wih he new node As is easily seen, G conains a negaie cycle if and only if A(G) conains a negaie cycle C such ha is reachable from C Shores Pah: Finding Negaie Cycles (cnd) Exend OPT(i,) o i n If he graph G does no conain negaie cycles hen OPT(i,) = OPT(n,) for all nodes and all i n Indeed, i follows from he obseraion ha eery shores pah conains a mos n arcs. There is no negaie cycle wih a pah o if and only if OPT(n,) = OPT(n,) If here is no negaie cycle, hen OPT(n,) = OPT(n,) for all nodes by he obseraion aboe Algorihms Dynamic Programming - Algorihms Dynamic Programming -6 Shores Pah: Finding Negaie Cycles (cnd) (cnd) Suppose OPT(n,) = OPT(n,) for all nodes. Therefore OPT(n,) = min{ OPT(n,), min w V { OPT(n,w) + len(w) }} = min{ OPT(n,), min w V { OPT(n,w) + len(w) }} = OPT(n +,) =. Howeer, if a negaie cycle from which is reachable exiss, hen lim OPT( i, ) = i Shores Pah: Finding Negaie Cycles (cnd) Le be a node such ha OPT(n,) OPT(n,). A pah P from o of weigh OPT(n,) mus use exacly n arcs Any simple pah can hae a mos n arcs, herefore P conains a cycle C If G has n nodes and OPT(n,) OPT(n,), hen a pah P of weigh OPT(n,) conains a cycle C, and C is negaie. Eery pah from o using less han n arcs has greaer weigh. Le w be a node ha occurs in P more han once. Le C be he cycle beween he wo occurrences of w Deleing C we ge a shorer pah of greaer weigh, hus C is negaie 6
Dynamic Programming. Data Structures and Algorithms Andrei Bulatov
Dynamic Programming Data Structures and Algorithms Andrei Bulatov Algorithms Dynamic Programming 18-2 Weighted Interval Scheduling Weighted interval scheduling problem. Instance A set of n jobs. Job j
More informationNetwork Flow. Data Structures and Algorithms Andrei Bulatov
Nework Flow Daa Srucure and Algorihm Andrei Bulao Algorihm Nework Flow 24-2 Flow Nework Think of a graph a yem of pipe We ue hi yem o pump waer from he ource o ink Eery pipe/edge ha limied capaciy Flow
More informationLongest Common Prefixes
Longes Common Prefixes The sandard ordering for srings is he lexicographical order. I is induced by an order over he alphabe. We will use he same symbols (,
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 information6. DYNAMIC PROGRAMMING II
6. DYNAMIC PROGRAMMING II sequence alignmen Hirschberg's algorihm Bellman-Ford algorihm disance vecor proocols negaive cycles in a digraph 6. DYNAMIC PROGRAMMING II sequence alignmen Hirschberg's algorihm
More information1 Review of Zero-Sum Games
COS 5: heoreical Machine Learning Lecurer: Rob Schapire Lecure #23 Scribe: Eugene Brevdo April 30, 2008 Review of Zero-Sum Games Las ime we inroduced a mahemaical model for wo player zero-sum games. Any
More informationCSE 421 Dynamic Programming
CSE Dynamic Programming Yin Tat Lee Weighted Interval Scheduling Interval Scheduling Job j starts at s(j) and finishes at f j and has weight w j Two jobs compatible if they don t overlap. Goal: find maximum
More informationLecture 2-1 Kinematics in One Dimension Displacement, Velocity and Acceleration Everything in the world is moving. Nothing stays still.
Lecure - Kinemaics in One Dimension Displacemen, Velociy and Acceleraion Everyhing in he world is moving. Nohing says sill. Moion occurs a all scales of he universe, saring from he moion of elecrons in
More informationThe Residual Graph. 12 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More information6. DYNAMIC PROGRAMMING II
6. DYNAMIC PROGRAMMING II sequence alignmen Hirschberg s algorihm Bellman Ford algorihm disance vecor proocols negaive cycles in a digraph 6. DYNAMIC PROGRAMMING II sequence alignmen Hirschberg s algorihm
More informationThe Residual Graph. 11 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More information16 Max-Flow Algorithms
A process canno be undersood by sopping i. Undersanding mus move wih he flow of he process, mus join i and flow wih i. The Firs Law of Mena, in Frank Herber s Dune (196) There s a difference beween knowing
More informationINSTANTANEOUS VELOCITY
INSTANTANEOUS VELOCITY I claim ha ha if acceleraion is consan, hen he elociy is a linear funcion of ime and he posiion a quadraic funcion of ime. We wan o inesigae hose claims, and a he same ime, work
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 informationMax Flow, Min Cut COS 521. Kevin Wayne Fall Soviet Rail Network, Cuts. Minimum Cut Problem. Flow network.
Sovie Rail Nework, Max Flow, Min u OS Kevin Wayne Fall Reference: On he hiory of he ranporaion and maximum flow problem. lexander Schrijver in Mah Programming, :,. Minimum u Problem u Flow nework.! Digraph
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 informationAlgorithmic Discrete Mathematics 6. Exercise Sheet
Algorihmic Dicree Mahemaic. Exercie Shee Deparmen of Mahemaic SS 0 PD Dr. Ulf Lorenz 7. and 8. Juni 0 Dipl.-Mah. David Meffer Verion of June, 0 Groupwork Exercie G (Heap-Sor) Ue Heap-Sor wih a min-heap
More informationTraversal of a subtree is slow, which affects prefix and range queries.
Compac Tries Tries suffer from a large number nodes, Ω( R ) in he wors case. The space requiremen is large, since each node needs much more space han a single symbol. Traversal of a subree is slow, which
More informationA Hop Constrained Min-Sum Arborescence with Outage Costs
A Hop Consrained Min-Sum Arborescence wih Ouage Coss Rakesh Kawara Minnesoa Sae Universiy, Mankao, MN 56001 Email: Kawara@mnsu.edu Absrac The hop consrained min-sum arborescence wih ouage coss problem
More informationCSE 421 Weighted Interval Scheduling, Knapsack, RNA Secondary Structure
CSE Weighted Interval Scheduling, Knapsack, RNA Secondary Structure Shayan Oveis haran Weighted Interval Scheduling Interval Scheduling Job j starts at s(j) and finishes at f j and has weight w j Two jobs
More informationI. Introduction to place/transition nets. Place/Transition Nets I. Example: a vending machine. Example: a vending machine
Inroducory Tuorial I. Inroducion o place/ransiion nes Place/Transiion Nes I Prepared by: Jörg Desel, Caholic Universiy in Eichsä and Karsen Schmid, Humbold-Universiä zu Berlin Speaker: Wolfgang Reisig,
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 informationPhysics Notes - Ch. 2 Motion in One Dimension
Physics Noes - Ch. Moion in One Dimension I. The naure o physical quaniies: scalars and ecors A. Scalar quaniy ha describes only magniude (how much), NOT including direcion; e. mass, emperaure, ime, olume,
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 informationBrock University Physics 1P21/1P91 Fall 2013 Dr. D Agostino. Solutions for Tutorial 3: Chapter 2, Motion in One Dimension
Brock Uniersiy Physics 1P21/1P91 Fall 2013 Dr. D Agosino Soluions for Tuorial 3: Chaper 2, Moion in One Dimension The goals of his uorial are: undersand posiion-ime graphs, elociy-ime graphs, and heir
More informationChapter 7: Solving Trig Equations
Haberman MTH Secion I: The Trigonomeric Funcions Chaper 7: Solving Trig Equaions Le s sar by solving a couple of equaions ha involve he sine funcion EXAMPLE a: Solve he equaion sin( ) The inverse funcions
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 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 informationChapter 12: Velocity, acceleration, and forces
To Feel a Force Chaper Spring, Chaper : A. Saes of moion For moion on or near he surface of he earh, i is naural o measure moion wih respec o objecs fixed o he earh. The 4 hr. roaion of he earh has a measurable
More informationProblem Set If all directed edges in a network have distinct capacities, then there is a unique maximum flow.
CSE 202: Deign and Analyi of Algorihm Winer 2013 Problem Se 3 Inrucor: Kamalika Chaudhuri Due on: Tue. Feb 26, 2013 Inrucion For your proof, you may ue any lower bound, algorihm or daa rucure from he ex
More informationLinear Response Theory: The connection between QFT and experiments
Phys540.nb 39 3 Linear Response Theory: The connecion beween QFT and experimens 3.1. Basic conceps and ideas Q: How do we measure he conduciviy of a meal? A: we firs inroduce a weak elecric field E, and
More informationReading from Young & Freedman: For this topic, read sections 25.4 & 25.5, the introduction to chapter 26 and sections 26.1 to 26.2 & 26.4.
PHY1 Elecriciy Topic 7 (Lecures 1 & 11) Elecric Circuis n his opic, we will cover: 1) Elecromoive Force (EMF) ) Series and parallel resisor combinaions 3) Kirchhoff s rules for circuis 4) Time dependence
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 informationChapter 3 Kinematics in Two Dimensions
Chaper 3 KINEMATICS IN TWO DIMENSIONS PREVIEW Two-dimensional moion includes objecs which are moing in wo direcions a he same ime, such as a projecile, which has boh horizonal and erical moion. These wo
More informationOne-Dimensional Kinematics
One-Dimensional Kinemaics One dimensional kinemaics refers o moion along a sraigh line. Een hough we lie in a 3-dimension world, moion can ofen be absraced o a single dimension. We can also describe moion
More informationAsymptotic Equipartition Property - Seminar 3, part 1
Asympoic Equipariion Propery - Seminar 3, par 1 Ocober 22, 2013 Problem 1 (Calculaion of ypical se) To clarify he noion of a ypical se A (n) ε and he smalles se of high probabiliy B (n), we will calculae
More informationRandomized Perfect Bipartite Matching
Inenive Algorihm Lecure 24 Randomized Perfec Biparie Maching Lecurer: Daniel A. Spielman April 9, 208 24. Inroducion We explain a randomized algorihm by Ahih Goel, Michael Kapralov and Sanjeev Khanna for
More informationAlgorithms and Data Structures 2011/12 Week 9 Solutions (Tues 15th - Fri 18th Nov)
Algorihm and Daa Srucure 2011/ Week Soluion (Tue 15h - Fri 18h No) 1. Queion: e are gien 11/16 / 15/20 8/13 0/ 1/ / 11/1 / / To queion: (a) Find a pair of ube X, Y V uch ha f(x, Y) = f(v X, Y). (b) Find
More informationLecture Notes 2. The Hilbert Space Approach to Time Series
Time Series Seven N. Durlauf Universiy of Wisconsin. Basic ideas Lecure Noes. The Hilber Space Approach o Time Series The Hilber space framework provides a very powerful language for discussing he relaionship
More informationInventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions
Muli-Period Sochasic Models: Opimali of (s, S) Polic for -Convex Objecive Funcions Consider a seing similar o he N-sage newsvendor problem excep ha now here is a fixed re-ordering cos (> 0) for each (re-)order.
More informationEE363 homework 1 solutions
EE363 Prof. S. Boyd EE363 homework 1 soluions 1. LQR for a riple accumulaor. We consider he sysem x +1 = Ax + Bu, y = Cx, wih 1 1 A = 1 1, B =, C = [ 1 ]. 1 1 This sysem has ransfer funcion H(z) = (z 1)
More informationViterbi Algorithm: Background
Vierbi Algorihm: Background Jean Mark Gawron March 24, 2014 1 The Key propery of an HMM Wha is an HMM. Formally, i has he following ingrediens: 1. a se of saes: S 2. a se of final saes: F 3. an iniial
More informationSoviet Rail Network, 1955
Sovie Rail Nework, 1 Reference: On he hiory of he ranporaion and maximum flow problem. Alexander Schrijver in Mah Programming, 1: 3,. Maximum Flow and Minimum Cu Max flow and min cu. Two very rich algorihmic
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 informationNEWTON S SECOND LAW OF MOTION
Course and Secion Dae Names NEWTON S SECOND LAW OF MOTION The acceleraion of an objec is defined as he rae of change of elociy. If he elociy changes by an amoun in a ime, hen he aerage acceleraion during
More informationDynamic Programming: Interval Scheduling and Knapsack
Dynamic Programming: Interval Scheduling and Knapsack . Weighted Interval Scheduling Weighted Interval Scheduling Weighted interval scheduling problem. Job j starts at s j, finishes at f j, and has weight
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 informationKINEMATICS IN ONE DIMENSION
KINEMATICS IN ONE DIMENSION PREVIEW Kinemaics is he sudy of how hings move how far (disance and displacemen), how fas (speed and velociy), and how fas ha how fas changes (acceleraion). We say ha an objec
More informationNetwork Flows: Introduction & Maximum Flow
CSC 373 - lgorihm Deign, nalyi, and Complexiy Summer 2016 Lalla Mouaadid Nework Flow: Inroducion & Maximum Flow We now urn our aenion o anoher powerful algorihmic echnique: Local Search. In a local earch
More information! Abstraction for material flowing through the edges. ! G = (V, E) = directed graph, no parallel edges.
Sovie Rail Nework, haper Nework Flow Slide by Kevin Wayne. opyrigh Pearon-ddion Weley. ll righ reerved. Reference: On he hiory of he ranporaion and maximum flow problem. lexander Schrijver in Mah Programming,
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 informationGraphs III - Network Flow
Graph III - Nework Flow Flow nework eup graph G=(V,E) edge capaciy w(u,v) 0 - if edge doe no exi, hen w(u,v)=0 pecial verice: ource verex ; ink verex - no edge ino and no edge ou of Aume every verex v
More informationHOTELLING LOCATION MODEL
HOTELLING LOCATION MODEL THE LINEAR CITY MODEL The Example of Choosing only Locaion wihou Price Compeiion Le a be he locaion of rm and b is he locaion of rm. Assume he linear ransporaion cos equal o d,
More informationCS4445/9544 Analysis of Algorithms II Solution for Assignment 1
Conider he following flow nework CS444/944 Analyi of Algorihm II Soluion for Aignmen (0 mark) In he following nework a minimum cu ha capaciy 0 Eiher prove ha hi aemen i rue, or how ha i i fale Uing he
More informationt is a basis for the solution space to this system, then the matrix having these solutions as columns, t x 1 t, x 2 t,... x n t x 2 t...
Mah 228- Fri Mar 24 5.6 Marix exponenials and linear sysems: The analogy beween firs order sysems of linear differenial equaions (Chaper 5) and scalar linear differenial equaions (Chaper ) is much sronger
More informationRL Lecture 7: Eligibility Traces. R. S. Sutton and A. G. Barto: Reinforcement Learning: An Introduction 1
RL Lecure 7: Eligibiliy Traces R. S. Suon and A. G. Baro: Reinforcemen Learning: An Inroducion 1 N-sep TD Predicion Idea: Look farher ino he fuure when you do TD backup (1, 2, 3,, n seps) R. S. Suon and
More informationOperating Systems Exercise 3
Operaing Sysems SS 00 Universiy of Zurich Operaing Sysems Exercise 3 00-06-4 Dominique Emery, s97-60-056 Thomas Bocek, s99-706-39 Philip Iezzi, s99-74-354 Florian Caflisch, s96-90-55 Table page Table page
More information23.2. Representing Periodic Functions by Fourier Series. Introduction. Prerequisites. Learning Outcomes
Represening Periodic Funcions by Fourier Series 3. Inroducion In his Secion we show how a periodic funcion can be expressed as a series of sines and cosines. We begin by obaining some sandard inegrals
More informationDesigning Information Devices and Systems I Spring 2019 Lecture Notes Note 17
EES 16A Designing Informaion Devices and Sysems I Spring 019 Lecure Noes Noe 17 17.1 apaciive ouchscreen In he las noe, we saw ha a capacior consiss of wo pieces on conducive maerial separaed by a nonconducive
More informationMath 116 Practice for Exam 2
Mah 6 Pracice for Exam Generaed Ocober 3, 7 Name: SOLUTIONS Insrucor: Secion Number:. This exam has 5 quesions. Noe ha he problems are no of equal difficuly, so you may wan o skip over and reurn o a problem
More informationDynamic Programming. Cormen et. al. IV 15
Dynamic Programming Cormen et. al. IV 5 Dynamic Programming Applications Areas. Bioinformatics. Control theory. Operations research. Some famous dynamic programming algorithms. Unix diff for comparing
More informationDifferential Geometry: Numerical Integration and Surface Flow
Differenial Geomery: Numerical Inegraion and Surface Flow [Implici Fairing of Irregular Meshes using Diffusion and Curaure Flow. Desbrun e al., 1999] Energy Minimizaion Recall: We hae been considering
More informationFlow networks. Flow Networks. A flow on a network. Flow networks. The maximum-flow problem. Introduction to Algorithms, Lecture 22 December 5, 2001
CS 545 Flow Nework lon Efra Slide courey of Charle Leieron wih mall change by Carola Wenk Flow nework Definiion. flow nework i a direced graph G = (V, E) wih wo diinguihed verice: a ource and a ink. Each
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 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 informationSolutions from Chapter 9.1 and 9.2
Soluions from Chaper 9 and 92 Secion 9 Problem # This basically boils down o an exercise in he chain rule from calculus We are looking for soluions of he form: u( x) = f( k x c) where k x R 3 and k is
More information15. Vector Valued Functions
1. Vecor Valued Funcions Up o his poin, we have presened vecors wih consan componens, for example, 1, and,,4. However, we can allow he componens of a vecor o be funcions of a common variable. For example,
More informationComparing Means: t-tests for One Sample & Two Related Samples
Comparing Means: -Tess for One Sample & Two Relaed Samples Using he z-tes: Assumpions -Tess for One Sample & Two Relaed Samples The z-es (of a sample mean agains a populaion mean) is based on he assumpion
More informationTimed Circuits. Asynchronous Circuit Design. Timing Relationships. A Simple Example. Timed States. Timing Sequences. ({r 6 },t6 = 1.
Timed Circuis Asynchronous Circui Design Chris J. Myers Lecure 7: Timed Circuis Chaper 7 Previous mehods only use limied knowledge of delays. Very robus sysems, bu exremely conservaive. Large funcional
More informationLAB # 2 - Equilibrium (static)
AB # - Equilibrium (saic) Inroducion Isaac Newon's conribuion o physics was o recognize ha despie he seeming compleiy of he Unierse, he moion of is pars is guided by surprisingly simple aws. Newon's inspiraion
More informationAn 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 information6. DYNAMIC PROGRAMMING II
6. DYNAMIC PROGRAMMING II 6. DYNAMIC PROGRAMMING II sequence alignmen Hirschberg s algorihm Bellman Ford Moore algorihm disance-vecor proocols negaive cycles sequence alignmen Hirschberg s algorihm Bellman
More informationSome Ramsey results for the n-cube
Some Ramsey resuls for he n-cube Ron Graham Universiy of California, San Diego Jozsef Solymosi Universiy of Briish Columbia, Vancouver, Canada Absrac In his noe we esablish a Ramsey-ype resul for cerain
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 informationRemoving Useless Productions of a Context Free Grammar through Petri Net
Journal of Compuer Science 3 (7): 494-498, 2007 ISSN 1549-3636 2007 Science Publicaions Removing Useless Producions of a Conex Free Grammar hrough Peri Ne Mansoor Al-A'ali and Ali A Khan Deparmen of Compuer
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 informationSeminar 4: Hotelling 2
Seminar 4: Hoelling 2 November 3, 211 1 Exercise Par 1 Iso-elasic demand A non renewable resource of a known sock S can be exraced a zero cos. Demand for he resource is of he form: D(p ) = p ε ε > A a
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 informationNetwork Flows UPCOPENCOURSEWARE number 34414
Nework Flow UPCOPENCOURSEWARE number Topic : F.-Javier Heredia Thi work i licened under he Creaive Common Aribuion- NonCommercial-NoDeriv. Unpored Licene. To view a copy of hi licene, vii hp://creaivecommon.org/licene/by-nc-nd/./
More informationOnline Convex Optimization Example And Follow-The-Leader
CSE599s, Spring 2014, Online Learning Lecure 2-04/03/2014 Online Convex Opimizaion Example And Follow-The-Leader Lecurer: Brendan McMahan Scribe: Sephen Joe Jonany 1 Review of Online Convex Opimizaion
More informationPhys 221 Fall Chapter 2. Motion in One Dimension. 2014, 2005 A. Dzyubenko Brooks/Cole
Phys 221 Fall 2014 Chaper 2 Moion in One Dimension 2014, 2005 A. Dzyubenko 2004 Brooks/Cole 1 Kinemaics Kinemaics, a par of classical mechanics: Describes moion in erms of space and ime Ignores he agen
More informationThis is an example to show you how SMath can calculate the movement of kinematic mechanisms.
Dec :5:6 - Kinemaics model of Simple Arm.sm This file is provided for educaional purposes as guidance for he use of he sofware ool. I is no guaraeed o be free from errors or ommissions. The mehods and
More informationZürich. ETH Master Course: L Autonomous Mobile Robots Localization II
Roland Siegwar Margaria Chli Paul Furgale Marco Huer Marin Rufli Davide Scaramuzza ETH Maser Course: 151-0854-00L Auonomous Mobile Robos Localizaion II ACT and SEE For all do, (predicion updae / ACT),
More informationLaplace transfom: t-translation rule , Haynes Miller and Jeremy Orloff
Laplace ransfom: -ranslaion rule 8.03, Haynes Miller and Jeremy Orloff Inroducory example Consider he sysem ẋ + 3x = f(, where f is he inpu and x he response. We know is uni impulse response is 0 for
More informationSome Basic Information about M-S-D Systems
Some Basic Informaion abou M-S-D Sysems 1 Inroducion We wan o give some summary of he facs concerning unforced (homogeneous) and forced (non-homogeneous) models for linear oscillaors governed by second-order,
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 informationMaximum Flow and Minimum Cut
// Sovie Rail Nework, Maximum Flow and Minimum Cu Max flow and min cu. Two very rich algorihmic problem. Cornerone problem in combinaorial opimizaion. Beauiful mahemaical dualiy. Nework Flow Flow nework.
More informationTHE MATRIX-TREE THEOREM
THE MATRIX-TREE THEOREM 1 The Marix-Tree Theorem. The Marix-Tree Theorem is a formula for he number of spanning rees of a graph in erms of he deerminan of a cerain marix. We begin wih he necessary graph-heoreical
More informationPhysics for Scientists and Engineers. Chapter 2 Kinematics in One Dimension
Physics for Scieniss and Engineers Chaper Kinemaics in One Dimension Spring, 8 Ho Jung Paik Kinemaics Describes moion while ignoring he agens (forces) ha caused he moion For now, will consider moion in
More informationFinal Spring 2007
.615 Final Spring 7 Overview The purpose of he final exam is o calculae he MHD β limi in a high-bea oroidal okamak agains he dangerous n = 1 exernal ballooning-kink mode. Effecively, his corresponds o
More informationPhysical Limitations of Logic Gates Week 10a
Physical Limiaions of Logic Gaes Week 10a In a compuer we ll have circuis of logic gaes o perform specific funcions Compuer Daapah: Boolean algebraic funcions using binary variables Symbolic represenaion
More informationRetrieval Models. Boolean and Vector Space Retrieval Models. Common Preprocessing Steps. Boolean Model. Boolean Retrieval Model
1 Boolean and Vecor Space Rerieval Models Many slides in his secion are adaped from Prof. Joydeep Ghosh (UT ECE) who in urn adaped hem from Prof. Dik Lee (Univ. of Science and Tech, Hong Kong) Rerieval
More informationQ2.4 Average velocity equals instantaneous velocity when the speed is constant and motion is in a straight line.
CHAPTER MOTION ALONG A STRAIGHT LINE Discussion Quesions Q. The speedomeer measures he magniude of he insananeous eloci, he speed. I does no measure eloci because i does no measure direcion. Q. Graph (d).
More information3.1 More on model selection
3. More on Model selecion 3. Comparing models AIC, BIC, Adjused R squared. 3. Over Fiing problem. 3.3 Sample spliing. 3. More on model selecion crieria Ofen afer model fiing you are lef wih a handful of
More informationSoviet Rail Network, 1955
7.1 Nework Flow Sovie Rail Nework, 19 Reerence: On he hiory o he ranporaion and maximum low problem. lexander Schrijver in Mah Programming, 91: 3, 00. (See Exernal Link ) Maximum Flow and Minimum Cu Max
More informationAlgorithm Design and Analysis
Algorihm Deign and Analyi LECTURES 17 Nework Flow Dualiy of Max Flow and Min Cu Algorihm: Ford-Fulkeron Capaciy Scaling Sofya Rakhodnikova S. Rakhodnikova; baed on lide by E. Demaine, C. Leieron, A. Smih,
More information13 Dynamic Programming (3) Optimal Binary Search Trees Subset Sums & Knapsacks
13 Dynamic Programming (3) Optimal Binary Search Trees Subset Sums & Knapsacks Average-case analysis Average-case analysis of algorithms and data structures: Input is generated according to a known probability
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 informationEquations of motion for constant acceleration
Lecure 3 Chaper 2 Physics I 01.29.2014 Equaions of moion for consan acceleraion Course websie: hp://faculy.uml.edu/andriy_danylo/teaching/physicsi Lecure Capure: hp://echo360.uml.edu/danylo2013/physics1spring.hml
More informationThis document was generated at 7:34 PM, 07/27/09 Copyright 2009 Richard T. Woodward
his documen was generaed a 7:34 PM, 07/27/09 Copyrigh 2009 Richard. Woodward 15. Bang-bang and mos rapid approach problems AGEC 637 - Summer 2009 here are some problems for which he opimal pah does no
More information