Max Flow, Min Cut. Maximum Flow and Minimum Cut. Soviet Rail Network, Minimum Cut Problem


 Lynette Stevenson
 1 years ago
 Views:
Transcription
1 Maximum Flow and Minimum u Max Flow, Min u Max flow and min cu. Two very rich algorihmic problem. ornerone problem in combinaorial opimizaion. eauiful mahemaical dualiy. Minimum cu Maximum flow Maxflow mincu heorem FordFulkeron augmening pah algorihm dmondkarp heuriic iparie maching Nonrivial applicaion / reducion. Nework conneciviy. iparie maching. aa mining. Openpi mining. irline cheduling. Image proceing. Projec elecion. aeball eliminaion. Nework reliabiliy. ecuriy of aiical daa. iribued compuing. galiarian able maching. iribued compuing. Many many more... Princeon Univeriy O lgorihm and aa rucure pring Kevin Wayne hp://www.princeon.u/~co ovie Rail Nework, Minimum u Problem Nework: abracion for maerial FLOWING hrough he edge. ireced graph. apaciie on edge. ource node, ink node. Min cu problem. elee "be" e of edge o diconnec from. ource ink capaciy ource: On he hiory of he ranporaion and maximum flow problem. lexander chrijver in Mah Programming, :,.
2 u u cu i a node pariion (, T) uch ha i in and i in T. capaciy(, T) = um of weigh of edge leaving. cu i a node pariion (, T) uch ha i in and i in T. capaciy(, T) = um of weigh of edge leaving. apaciy = apaciy = Minimum u Problem Maximum Flow Problem cu i a node pariion (, T) uch ha i in and i in T. capaciy(, T) = um of weigh of edge leaving. Min cu problem. Find an  cu of minimum capaciy. Nework: abracion for maerial FLOWING hrough he edge. ireced graph. ame inpu a min cu problem apaciie on edge. ource node, ink node. Max flow problem. ign flow o edge o a o: qualize inflow and ouflow a every inermediae verex. Maximize flow en from o. ource capaciy ink apaciy =
3 Flow Flow flow f i an aignmen of weigh o edge o ha: apaciy: f(e) u(e). Flow conervaion: flow leaving v = flow enering v. excep a or flow f i an aignmen of weigh o edge o ha: apaciy: f(e) u(e). Flow conervaion: flow leaving v = flow enering v. excep a or capaciy flow Value = capaciy flow Value = Maximum Flow Problem Flow and u Max flow problem: find flow ha maximize ne flow ino ink. Obervaion. Le f be a flow, and le (, T) be any  cu. Then, he ne flow en acro he cu i equal o he amoun reaching. capaciy flow Value = Value =
4 Flow and u Flow and u Obervaion. Le f be a flow, and le (, T) be any  cu. Then, he ne flow en acro he cu i equal o he amoun reaching. Obervaion. Le f be a flow, and le (, T) be any  cu. Then, he ne flow en acro he cu i equal o he amoun reaching. Value = Value = Flow and u Max Flow and Min u Obervaion. Le f be a flow, and le (, T) be any  cu. Then he value of he flow i a mo he capaciy of he cu. Obervaion. Le f be a flow, and le (, T) be an  cu whoe capaciy equal he value of f. Then f i a max flow and (, T) i a min cu. u capaciy = Flow value u capaciy = Flow value Flow value =
5 MaxFlow Minu Theorem Toward an lgorihm Maxflow mincu heorem. (FordFulkeron, ): In any nework, he value of max flow equal capaciy of min cu. Proof IOU: we find flow and cu uch ha Obervaion applie. Find  pah where each arc ha f(e) < u(e) and "augmen" flow along i. Min cu capaciy = Max flow value = flow Flow value = capaciy Toward an lgorihm Toward an lgorihm Find  pah where each arc ha f(e) < u(e) and "augmen" flow along i. Greedy algorihm: repea unil you ge uck. Find  pah where each arc ha f(e) < u(e) and "augmen" flow along i. Greedy algorihm: repea unil you ge uck. Fail: need o be able o "backrack." flow Flow value = flow Flow value = capaciy X X X capaciy X X X oleneck capaciy of pah = Flow value =
6 Reidual Graph ugmening Pah Original graph. Flow f(e). dge e = vw v flow = f(e) capaciy = u(e) w ugmening pah = pah in reidual graph. Increae flow along forward edge. ecreae flow along backward edge. Reidual edge. dge e = vw or wv. "Undo" flow en. Reidual graph. ll he edge ha have ricly poiive reidual capaciy. v reidual capaciy = u(e) f(e) w reidual capaciy = f(e) reidual original X X X X X ugmening Pah FordFulkeron ugmening Pah lgorihm Obervaion. If augmening pah, hen no ye a max flow. Q. If no augmening pah, i i a max flow? FordFulkeron algorihm. Generic mehod for olving max flow. reidual while (here exi an augmening pah) { Find augmening pah P ompue boleneck capaciy of P ugmen flow along P original Flow value = X X X X X Queion. oe hi lead o a maximum flow? ye How do we find an augmening pah?  pah in reidual graph How many augmening pah doe i ake? How much effor do we pending finding a pah?
7 MaxFlow Minu Theorem Proof of MaxFlow Minu Theorem ugmening pah heorem. flow f i a max flow if and only if here are no augmening pah. Maxflow mincu heorem. The value of he max flow i equal o he capaciy of he min cu. We prove boh imulaneouly by howing he following are equivalen: (i) f i a max flow. (ii) There i no augmening pah relaive o f. (iii) There exi a cu whoe capaciy equal he value of f. (i) (ii) equivalen o no (ii) no (i), which wa Obervaion (ii) (iii) nex lide (iii) (i) hi wa Obervaion (ii) (iii). If here i no augmening pah relaive o f, hen here exi a cu whoe capaciy equal he value of f. Proof. Le f be a flow wih no augmening pah. Le be e of verice reachable from in reidual graph. conain ; ince no augmening pah, doe no conain all edge e leaving in original nework have f(e) = u(e) all edge e enering in original nework have f(e) = f e ou of e ou of f ( e) u( e) capaciy (, T) e in o f ( e) T reidual nework Max Flow Nework Implemenaion FordFulkeron lgorihm: Implemenaion dge in original graph may correpond o or reidual edge. May need o ravere edge e = vw in forward or revere direcion. Flow = f(e), capaciy = u(e). Iner wo copie of each edge, one in adjacency li of v and one in w. FordFulkeron main loop. // while here exi an augmening pah, ue i while (augpah()) { public cla dge { privae in v, w; privae in cap; privae in flow; // from, o // capaciy from v o w // flow from v o w public dge(in v, in w, in cap) {... public in cap() { reurn cap; public in flow() { reurn flow; public boolean from(in v) { reurn hi.v == v; public in oher(in v) { reurn from(v)? hi.w : hi.v; public in capro(in v) { reurn from(v)? flow : cap  flow; public void addflowro(in v, in d) { flow += from(v)? d : d; // compue boleneck capaciy in bole = INFINITY; for (in v = ; v!= ; v = T(v)) bole = Mah.min(bole, pred[v].capro(v)); // augmen flow for (in v = ; v!= ; v = T(v)) pred[v].addflowro(v, bole); // keep rack of oal flow en from o value += bole;
8 FordFulkeron lgorihm: nalyi hooing Good ugmening Pah umpion: all capaciie are ineger beween and U. Ue care when elecing augmening pah. Invarian: every flow value and every reidual capaciie remain an ineger hroughou he algorihm. Theorem: he algorihm erminae in a mo f * V U ieraion. orollary: if U =, hen algorihm run in V ieraion. no polynomial in inpu ize! Inegraliy heorem: if all arc capaciie are ineger, hen here exi a max flow f for which every flow value i an ineger. Original Nework hooing Good ugmening Pah hooing Good ugmening Pah Ue care when elecing augmening pah. Ue care when elecing augmening pah. X X X Original Nework Original Nework
9 hooing Good ugmening Pah hooing Good ugmening Pah Ue care when elecing augmening pah. Ue care when elecing augmening pah. X X X Original Nework Original Nework ieraion poible! hooing Good ugmening Pah hore ugmening Pah Ue care when elecing augmening pah. ome choice lead o exponenial algorihm. lever choice lead o polynomial algorihm. Opimal choice for real world problem??? eign goal i o chooe augmening pah o ha: an find augmening pah efficienly. Few ieraion. hooe augmening pah wih: dmondkarp () Fewe number of arc. (hore pah) Max boleneck capaciy. (fae pah) hore augmening pah. ay o implemen wih F. Find augmening pah wih fewe number of arc. while (!q.impy()) { in v = q.dequeue(); InIeraor i = G.neighbor(v); while(i.hanex()) { dge e = i.nex(); in w = e.oher(v); if (e.capro(w) > ) { // i vw a reidual edge? if (w[w] > w[v] + ) { w[w] = w[v] + ; pred[w] = e; // keep rack of hore pah q.enqueue(w); reurn (w[] < INFINITY); // i here an augmening pah?
10 hore ugmening Pah nalyi Fae ugmening Pah Lengh of hore augmening pah increae monoonically. ricly increae afer a mo augmenaion. mo V oal augmening pah. O( V) running ime. Fae augmening pah. Find augmening pah whoe boleneck capaciy i maximum. eliver mo amoun of flow o ink. olve uing ijkrayle (PF) algorihm. X v reidual capaciy w if (w[w] < Mah.min(w[v], e.capro(w)) { w[w] = Mah.min(w[v], e.capro(w)); pred[w] = v; Finding a fae pah. O( log V) per augmenaion wih binary heap. Fac. O( log U) augmenaion if capaciie are beween and U. hooing an ugmening Pah Hiory of Worae Running Time hooing an augmening pah. ny pah will do wide laiude in implemening FordFulkeron. Generic prioriy fir earch. ome choice lead o good worcae performance. hore augmening pah fae augmening pah variaion on a heme: PF verage cae no well underood. Reearch challenge. Pracice: olve max flow problem on real nework in linear ime. Theory: prove i for worcae nework. Year... icoverer Mehod ympoic Time anzig implex V U Ford, Fulkeron ugmening pah V U dmondkarp hore pah V dmondkarp Max capaciy log U ( + V log V) iniz Improved hore pah V dmondkarp, iniz apaciy caling log U inizgabow Improved capaciy caling V log U Karzanov Preflowpuh V leaortarjan ynamic ree V log V GoldbergTarjan FIFO preflowpuh V log (V / ) GoldbergRao Lengh funcion / log (V / ) log U V / log (V / ) log U rc capaciie are beween and U.
11 n pplicaion iparie Maching Jon placemen. ompanie make job offer. uden have job choice. an we fill every job? iparie maching. Inpu: undireced and biparie graph G. e of edge M i a maching if each verex appear a mo once. Max maching: find a max cardinaliy maching. an we employ every uden? licedobe obyahoo arolhp avepple lizaim Frankun Maching M , ,  L R iparie Maching iparie Maching iparie maching. Inpu: undireced and biparie graph G. e of edge M i a maching if each verex appear a mo once. Max maching: find a max cardinaliy maching. Reduce o max flow. reae a direced graph G'. irec all arc from L o R, and give infinie (or uni) capaciy. dd ource, and uni capaciy arc from o each node in L. dd ink, and uni capaciy arc from each node in R o. L R Maching M , , ,  L R G G'
12 iparie Maching: Proof of orrecne iparie Maching: Proof of orrecne laim. Maching in G of cardinaliy k induce flow in G' of value k. Given maching M = { , ,  of cardinaliy. onider flow f ha end uni along each of pah: f i a flow, and ha cardinaliy. laim. Flow f of value k in G' induce maching of cardinaliy k in G. y inegraliy heorem, here exi / valued flow f of value k. onider M = e of edge from L o R wih f(e) =. each node in L and R inciden o a mo one edge in M M = k L R L R G G' G G' Reducion Reducion. Given an inance of biparie maching. Tranform i o a max flow problem. olve max flow problem. Tranform max flow oluion o biparie maching oluion. Iue. How expenive i ranformaion? O( + V) I i beer o olve problem direcly? O( V / ) biparie maching oom line: max flow i an exremely rich problemolving model. Many imporan pracical problem reduce o max flow. We know good algorihm for olving max flow problem.
2.4 Network flows. Many direct and indirect applications telecommunication transportation (public, freight, railway, air, ) logistics
.4 Nework flow Problem involving he diribuion of a given produc (e.g., waer, ga, daa, ) from a e of producion locaion o a e of uer o a o opimize a given objecive funcion (e.g., amoun of produc, co,...).
More information15.082J & 6.855J & ESD.78J October 7, Introduction to Maximum Flows
5.0J &.55J & ESD.7J Ocober 7, 00 Inroducion o Maximum Flow The Max Flow Problem G = (N,A) x ij = flow on arc (i,j) u ij = capaciy of flow in arc (i,j) = ource node = ink node Maximize v Subjec o j x ij
More informationChapter 13. Network Flow III Applications. 13.1 Edge disjoint paths. 13.1.1 Edgedisjoint paths in a directed graphs
Chaper 13 Nework Flow III Applicaion CS 573: Algorihm, Fall 014 Ocober 9, 014 13.1 Edge dijoin pah 13.1.1 Edgedijoin pah in a direced graph 13.1.1.1 Edge dijoin pah queiong: graph (dir/undir)., : verice.
More informationTopic: Applications of Network Flow Date: 9/14/2007
CS787: Advanced Algorihm Scribe: Daniel Wong and Priyananda Shenoy Lecurer: Shuchi Chawla Topic: Applicaion of Nework Flow Dae: 9/4/2007 5. Inroducion and Recap In he la lecure, we analyzed he problem
More information6.854 Advanced Algorithms. Scribes: Alexandr Andoni, edited by Sara Mustin 9/22/06. Network Flows
6.854 Advanced Algorihm Lecure 6: 9/4/003 Lecurer: Erik Demaine, David Karger Scribe: Alexandr Andoni, edied by Sara Muin 9//06 Nework Flow 6. The Maximum Flow Problem In hi ecion we define a flow nework
More information2 3 / 4 5 / 6 7 / / / 7
.. Give an adjacencyli repreenaion for a complee binary ree on verice. Give an equivalen adjacencymarix repreenaion. Aume ha verice are numbered from o a in a binary heap. (Edge are direced from paren
More informationCSE 202: Design and Analysis of Algorithms Lecture 8
CSE 202: Deign and Analyi of Algorihm Lecure 8 Inrucor: Kamalika Chaudhuri La Cla: Max Flow Prolem The Max Flow Prolem: Given direced graph G=(V,E), ource, ink, edge capaciie c(e), find an  flow of maximum
More information/ / / 4 / 5 / 6 / 7 / Adjacency Matrix:
.. Give an adjacencyli repreenaion for a complee binary ree on verice. Give an equivalen adjacencymarix repreenaion. Aume ha verice are numbered from o a in a binary heap. Adjacency Li: / / / / / /
More informationCSE202 Greedy algorithms
CSE0 Greedy algorihm . Shore Pah in a Graph hore pah from Princeon CS deparmen o Einein' houe . Shore Pah in a Graph hore pah from Princeon CS deparmen o Einein' houe Tree wih a mo edge G i a ree on n
More informationWeighted Graphs. Shortest Paths. Shortest Path Properties. Shortest Path Problem. Dijkstra s Algorithm. Edge Relaxation PVD ORD SFO LGA HNL LAX DFW
4/14/1 :7 PM Shore Pah A 4 7 1 Weighed Graph In a weighed graph, each edge ha an aociaed numerical value, called he weigh of he edge dge weigh may repreen, diance, co, ec. xample: In a fligh roue graph,
More informationShortest Paths. Fastest Route from CS Dept to Einstein's House. Shortest Path Problem. Brief History. Dijkstra's algorithm BellmanFord algorithm
Fae Roue from CS Dep o Einein' Houe Shore Pah Dijkra' algorihm BellmanFord algorihm Princeon Univeriy COS Algorihm and Daa Srucure Spring 00 Kevin Wayne hp://www.princeon.edu/~co Shore Pah Problem Brief
More informationMaximum Flow Applications
Maimum Flow Applicaion Conen Maimum Flow Applicaion Ma flow eenion and applicaion. Dijoin pah and nework conneciiy. Biparie maching. Circulaion wih upper and lower bound. Cenu abulaion (mari rounding).
More information7.6 Disjoint Paths. 7. Network Flow Applications. Edge Disjoint Paths. Edge Disjoint Paths
. Nework Flow Applicaion. Dijoin Pah Algorihm Deign by Éva Tardo and Jon Kleinberg Copyrigh 00 Addion Weley Slide by Kevin Wayne Algorihm Deign by Éva Tardo and Jon Kleinberg Copyrigh 00 Addion Weley Slide
More information7.5 Bipartite Matching. Chapter 7. Network Flow. Bipartite Matching. Matching. Matching. Bipartite matching. matching 12', 31', 45'
Chaper. Biparie Maching Nework Flow Slide by Kevin Wayne. Copyrigh @ PearonAddion Weley. All righ reerved. Maching Biparie Maching Maching. Inpu: undireced graph G = (V, E). M " E i a maching if each node
More informationRecent Progress in Approximation Algorithms for the Traveling Salesman Problem
Recen Progre in Approximaion Algorihm for he Traveling Saleman Problem Lecure 3: The  pah TSP David P. Williamon Cornell Univeriy July 1822, 2016 São Paulo School of Advanced Science on Algorihm, Combinaoric,
More informationOPL: a modelling language
OPL: a modelling language Carlo Mannino (from OPL reference manual) Univeriy of Olo, INFMAT56  Auumn (Mahemaical opimizaion) ILOG Opimizaion Programming Language OPL i an Opimizaion Programming Language
More information1 The basic circulation problem
2WO08: Graphs and Algorihms Lecure 4 Dae: 26/2/2012 Insrucor: Nikhil Bansal The Circulaion Problem Scribe: Tom Slenders 1 The basic circulaion problem We will consider he maxflow problem again, bu his
More informationMore Network Flow Applications
Chaper 19 More Nework Flow Applicaions CS 473: Fundamenal Algorihms, Spring 2011 April 5, 2011 19.1 Edge disjoin pahs 19.1.1 Edgedisjoin pahs in a direced graphs Quesion 19.1.1 Given a graph G (eiher
More informationLecturer: Shuchi Chawla Topic: Steiner Tree; Greedy Approximation Algorithms Date: 01/25/07
CS880: Approximaions Algorihms Scribe: Siddharh Barman Lecurer: Shuchi Chawla Topic: Seiner Tree; Greedy Approximaion Algorihms Dae: 0/5/07 In his lecure we give an algorihm for Seiner ree and hen discuss
More informationLaplace Transforms. Class 16. Laplace Transforms. Laplace Transforms of Common Functions. Inverse Laplace Transform, L 1: Chapter 3.
Laplace Tranform Definiion Cla 6 Laplace Tranform Reminder: Dean Lecure omorrow am, JSB Audiorium Dr. L. Dougla Smoo Energy & Climae Change Imporan analyical mehod for olving linear ordinary differenial
More information10/4/2010 CSE 5311 Kumar 1. Flow Networks. A directed graph can be interpreted as a flow network to analyse material flows through networks.
Flow Nework Topi Flow Nework Reiul nework ForFulkeron lgorihm ForFulkeron' Mxflow Minu Algorihm //20 CSE Kumr 1 Flow Nework A iree grph n e inerpree flow nework o nlye meril flow hrough nework. Meril
More informationCSE 202: Design and Analysis of Algorithms Lecture 7
CSE 0: Deign nd Anlyi of Algorihm Lecure 7 Inrucor: Kmlik Chudhuri Announcemen HW i up! Due Mon Apr 5 in cl Rememer: Miderm on Wed My 4 Miderm i cloed ook Syllu: Greedy, Divide nd Conquer, Dynmic Progrmming,
More information2/13/2007 CSE 5311 Kumar 1. Flow Networks. A directed graph can be interpreted as a flow network to analyse material flows through networks.
Flow Nework Topi Flow Nework Reiul nework ForFulkeron lgorihm ForFulkeron' Mxflow Minu Algorihm Chper 7 Algorihm Deign Kleinerg n Tro 2/1/2007 CSE Kumr 1 Flow Nework A iree grph n e inerpree flow nework
More informationHow Much Can Taxes Help Selfish Routing?
How Much Can Taxe Help Selfih Rouing? Tim Roughgarden (Cornell) Join wih Richard Cole (NYU) and Yevgeniy Dodi (NYU) Selfih Rouing a direced graph G = (V,E) a ource and a deinaion one uni of raffic from
More informationSolution: (a) Add the lengths: m 2.5 m 15 m. Insight: The distance traveled is always positive, but the displacement can be negative.
homework oluion. Picure he Problem: The ball i pued in he poiive direcion and hen he negaive direcion. Sraegy: The diance i he oal lengh of rel, and he diplacemen i he ne change in poiion. Soluion: (a)
More informationMethod of least squares J. M. Powers University of Notre Dame February 28, 2003
Mehod of leas squares J. M. Powers Universiy of Nore Dame February 28, 200 One imporan applicaion of daa analysis is he mehod of leas squares. This mehod is ofen used o fi daa o a given funcional form.
More informationGraph Cuts Approach to the Problems of Image Segmentation. CS7640 Ross Whitaker (Adapted from Antong Chen)
Graph C Approach o he Problem o Image Segmenaion CS7640 Ro Whiaker Adaped rom Anong Chen Oline Image Segmenaion and Graph C Inrodcion Glance a Graph Theory Graph C and MaxFlow/MinC Algorihm Solving Image
More informationThe Minimum Distance Between Two Lines in nspace
9/6/ Facul Advior: Dr. Denni Merino Phone: (5) 59597 Michael Bard Denn Himel The Minimum Diance Beween Two Line in nspace Abrac: Given wo poin in npace, where n i ome poiive ineger, we deermine he diance
More informationAn Optimal Inventory Model With Partial Backorders
An Opimal Invenory Model Wih Parial Backorders Chenhsiung Lee Dep. of Business Adminisraion, Soochow Universiy Taipei, Taiwan 00 +8867878 brucelee@cgpc.com.w Jinshyang Roan Dep. of Business Adminisraion,
More informationOA 4202, Homework 5. Nedialko B. Dimitrov
OA 4202, Homework 5 Nedialko B. Dimirov 1. (AMO) Formulae his problem as a minimum cos flow problem. We creae a biparie graph. On he lef, we have one node for each Serviceman. On he righ, we have one node
More informations C The intermediate points  can be described in terms of parametric lines through the corner points .
Irregular ilinear Inerpolaion Irregular bilinear inerpolaion deermine he value a a given poin by aking he weighed average of i four cloe neighbor. Thi algorihm i nonlinear and more compuaionally inenive
More information= 1980 and let time run out to infinity. , and working age population,, T. L, and capital stocks, , labor,
Solving he Model The base case model feaures a represenaive household ha chooses pahs of consumpion, leisure, and invesmen o maximize uiliy. The pahs of TFP and populaion are exogenously given (in daabase.x),
More informationOn the Connection Between MultipleUnicast Network Coding and SingleSource SingleSink Network Error Correction
On he Connecion Beween MulipleUnica ework Coding and SingleSource SingleSink ework Error Correcion Jörg Kliewer JIT Join work wih Wenao Huang and Michael Langberg ework Error Correcion Problem: Adverary
More informationSteps in Capital Budgeting. Estimate cash flows (inflows & outflows). Assess risk of cash flows. Determine r = WACC for project. Evaluate cash flows.
11 Chaper 1: The Basics of Capial Budgeing: Evaluaing Cash Flows Overview Mehods Payback, discouned payback NPV IRR, MIRR Profiabiliy Index Unequal lives Economic life Seps in Capial Budgeing Esimae cash
More informationBreadthfirst Search Based Bus Transport Transfer Algorithm
Breadhfir Search Baed Bu Tranpor Tranfer Algorihm ZHANGWEI LI and MEI ZHU College of Informaion Engineering Zhejiang Univeriy of Technology, Hangzhou, Zhejiang CHINA lzw@zju.edu.cn, zhumei_1@1.com Abrac:
More informationChapter 2. Introduction to Laplace Transforms
Mah 344, Maple Lab Manual Chaper : Laplace Tranform, I Definiion and Example Chaper. Inroducion o Laplace Tranform Given a funcion f defined on,, i Laplace Tranform i he funcion F whoe value are given
More informationMultiplicative Update Algorithms, Boosting and Ensemble Methods
CS369M: Algorihms for Modern Massive Daa Se Analysis Lecure 1611/11/2009 Muliplicaive Updae Algorihms, Boosing and Ensemble Mehods Lecurer: Michael Mahoney Scribes: Mark Wagner and Yuning Sun *Undied
More information(Relevant to AAT Examination Paper 4: Business Economics and Financial Mathematics)
Index Numbers (Relevan o AAT Examinaion Paper 4: Business Economics and Financial Mahemaics) Y.O. Lam, SCOPE, Ciy Universiy of Hong Kong In business world, we need o reduce a large number of facs or informaion
More informationJava Semantics. The Stack and Heap. Primitive Types. Semantics and Specifying Procedures. David Evans
univeriy of virginia fall 2006 Semanic and Specifying Procedure Java Semanic David Evan www.c.virginia.edu/c205 2 The Sack and Heap Sring = new Sring (); Sring i a ype in he Java API for repreening equence
More information4.8 Exponential Growth and Decay; Newton s Law; Logistic Growth and Decay
324 CHAPTER 4 Exponenial and Logarihmic Funcions 4.8 Exponenial Growh and Decay; Newon s Law; Logisic Growh and Decay OBJECTIVES 1 Find Equaions of Populaions Tha Obey he Law of Uninhibied Growh 2 Find
More informationFourier Series Solution of the Heat Equation
Fourier Series Soluion of he Hea Equaion Physical Applicaion; he Hea Equaion In he early nineeenh cenury Joseph Fourier, a French scienis and mahemaician who had accompanied Napoleon on his Egypian campaign,
More informationChapter 7. Response of FirstOrder RL and RC Circuits
Chaper 7. esponse of FirsOrder L and C Circuis 7.1. The Naural esponse of an L Circui 7.2. The Naural esponse of an C Circui 7.3. The ep esponse of L and C Circuis 7.4. A General oluion for ep and Naural
More informationFall 2014 David Wagner MT2 Soln
CS 70 Algorihm Fall 04 Daid Wagner MT Soln Problem. [True or fale] (9 poin) Circle TRUE or FALSE. Do no juify your aner on hi problem. (a) TRUE or FALSE : Le (S,V S) be a minimum (,)cu in he neork flo
More informationAntialiasing. Overview. Antialiasing Techniques. Antialiasing Techniques. Aliasing, jagged edges or staircasing can be reduced by:
Overview Anialiasing Techniques Super sampling Area sampling unweighed weighed Clipping CohenSuherland line clipping algorihm line clipping algorihm SuherlandHogeman polygon clipping Anialiasing Aliasing,
More informationMath 2320 Differential Equations Chapter 3.2 Applications of First Order Linear Differential Equations
Mah 3 Differenial Equaions Chaper 3. Applicaions of Firs Order Linear Differenial Equaions Mixing roblems: The basic mixing problem consiss of a funcion ha represens he amoun of a subsance in a ank a ime,
More informationFigure 1. A simple capacitied network flow graph.
Nework Flow Imagine ha yo are a corier erice, and yo wan o delier ome cargo from one ciy o anoher. Yo can delier hem ing ario fligh from ciie o ciie, b each fligh ha a limied amon of pace ha yo can e.
More informationAcceleration Lab Teacher s Guide
Acceleraion Lab Teacher s Guide Objecives:. Use graphs of disance vs. ime and velociy vs. ime o find acceleraion of a oy car.. Observe he relaionship beween he angle of an inclined plane and he acceleraion
More informationNewton's second law in action
Newon's second law in acion In many cases, he naure of he force acing on a body is known I migh depend on ime, posiion, velociy, or some combinaion of hese, bu is dependence is known from experimen In
More informationChen s theorem in short intervals
ACTA ARITHMETICA XCI.4 999 Chen heorem in hor inerval by Ying Chun Cai and Ming Gao Lu Shanghai. Inroducion. In 966 Chen Jingrun [] made a coniderable progre in he reearch of he binary Goldbach conjecure;
More informationMath 201 Lecture 12: CauchyEuler Equations
Mah 20 Lecure 2: CauchyEuler Equaions Feb., 202 Many examples here are aken from he exbook. The firs number in () refers o he problem number in he UA Cusom ediion, he second number in () refers o he problem
More informationAppendix A: Area. 1 Find the radius of a circle that has circumference 12 inches.
Appendi A: Area workedou s o OddNumbered Eercises Do no read hese workedou s before aemping o do he eercises ourself. Oherwise ou ma mimic he echniques shown here wihou undersanding he ideas. Bes wa
More informationDynamic Programming Handout
4.45 Reciaion, February 8 h, 25  Todd Gormley Dynamic Programming Handou  Wha is Dynamic Programming (DP)?  DP is when we us o change a problem
More informationOutline. Integer LP Formulation. Time Windows. Resource Constrained Shortest Paths. s.t. Σ. x ji  x ij = 1, i=s j : (i,j) A. 0, i s,t 1, i=t.
Reource Conrained Shore Pah Naahia Boland Irina Dumirecu Mahemaic and Saiic, Univeriy of Melbourne & HEC Monreal, Canada Reearch Chair in Diribuion Managemen Ouline Variou conrained hore pah model Single
More informationOne Dimensional Kinematics
Chaper B One Dimensional Kinemaics Blinn College  Physics 2425  Terry Honan Kinemaics is he sudy of moion. This chaper will inroduce he basic definiions of kinemaics. The definiions of he velociy and
More informationSolving Matrix Differential Equations
Solving Marix Differenial Equaions Seps for Solving a Marix Differenial Equaion Find he characerisic equaion ofa, de( A I) = Find he eigenvalues of A, which are he roos of he characerisic equaion 3 For
More informationCS364A: Algorithmic Game Theory Lecture #11: Selfish Routing and the Price of Anarchy
CS64A: Algorihmic Game Theory Lecure #11: Selfih Rouing and he Price of Anarchy Tim Roughgarden Ocober 28, 201 1 Quanifying he Inefficiency of Equilibria Wih hi lecure we begin he econd par of he coure.
More informationTrigonometric Functions c 2002 Donald Kreider and Dwight Lahr
Trigonomeric Funcions c 2002 Donald Kreider and Dwigh Lahr Modeling wih Trigonomeric Funcions: You firs me he rigonomeric funcions in algebra and rigonomery in high school. In a ypical rigonomery course
More informationControl System I EE 411. Lecture 11 Dr. Mostafa Abdelgeliel
Conrol Syem I EE 4 Sae Space Analyi Lecure Dr. Moafa Abdelgeliel Coure Conen Sae Space SS modeling of linear yem SS Repreenaion from yem Block Diagram SS from Differenial equaion phae variable form Canonical
More informationLearning Bounded Treewidth Bayesian Networks
Learning Bounded Treewidh Bayeian Nework Gal Elidan Deparmen of Saiic Hebrew Univeriy Jerualem, 91905, Irael galel@huji.ac.il Sephen Gould Deparmen of Elecrical Engineering Sanford Univeriy Sanford, CA
More informationExponential Growth and Decay S E C T I O N 6. 3
Exponenial Growh and Decay S E C T I O N 6. 3 The Grea Divide 10 minues o complee Follow up Quesions (Wih your parner be prepared o answer he following quesions abou his aciviy) Do he graphs represen a
More informationNet Change In 13, write a complete sentence including appropriate units of measure.
AP Calculus CHAPTER WORKSHEET INTEGRALS Name Sea # Ne Change In 13, wrie a complee senence including appropriae unis of measure. 1. If 1 w' is he rae of growh of a child in pounds per year, wha does w
More informationIntroduction to Parallel Programming
2012 Summer School on Concurrency Augus 22 29, 2012 S. Peersburg, Russia Inroducion o Parallel Programming Secion 2. Communicaion Complexiy Analysis of Parallel Algorihms Vicor Gergel, Professor, D.Sc.
More informationMath 308 Week 10 Solutions
Mah 8 Week Soluions Here are soluions o he evennumbered suggesed problems. The answers o he oddnumbered problems are in he back of our ebook, and he soluions are in he Soluion Manual, which ou can purchase
More informationHomework 6 chapter 32: 11, 18 chapter 33: 5, 50
hp://il.ukc.edu/phyic/wrobel/phy50/hoework.h Hoework 6 chaper :, 8 chaper : 5, 50 Proble. A baery i conneced ino a erie circui conaining a 0 Ω reior and a H inducor. n Wha ie inerval will he curren reach
More informationOptimal Interleaving on Tori
Opimal Inerleaving on Tori Anxiao (Andrew) Jiang, Mahew Cook, and Jehoshua Bruck California Insiue of Technology Parallel and Disribued Sysems Laboraory MC  Pasadena, CA, U.S.A. Email: {jax,cook,bruck}@paradise.calech.edu
More informationICP/Physics 8 Dynamics Lab p. 1. Name Partner. Date TA Lab Day/Time. Lab 3: Dynamics
ICP/Physics 8 Dynamics Lab p. 1 Name Parner Dae TA Lab Day/Time Inroducion Lab 3: Dynamics This lab has wo purposes. Firs, saring wih he prelab quesions, you ve already addressed increasingly difficul
More informationA Generalization of the Characteristic Polynomial of a Graph
A Generalizaion of he Characerisic Polynomial of a Graph Richard J. Lipon Nisheeh K. Vishnoi Absrac Given a graph G wih is adjacency marix A, he characerisic polynomial of G is defined as dea λi. Two graphs
More informationLecture III: Finish Discounted Value Formulation
Lecure III: Finish Discouned Value Formulaion I. Inernal Rae of Reurn A. Formally defined: Inernal Rae of Reurn is ha ineres rae which reduces he ne presen value of an invesmen o zero.. Finding he inernal
More informationQuasiStatic Scheduling of Embedded Software Using FreeChoice Petri Nets. Outline
EE249: Design of Embedded Sysem (correcions) QuasiSaic Scheduling of Embedded Sofware Using FreeChoice Peri Nes Marco Sgroi, Albero SangiovanniVincenelli Universiy of California a Berkeley Luciano Lavagno
More informationCh. 2 1Dimensional Motion conceptual question #6, problems # 2, 9, 15, 17, 29, 31, 37, 46, 54
Ch. 2 1Dimensional Moion concepual quesion #6, problems # 2, 9, 15, 17, 29, 31, 37, 46, 54 Quaniies Scalars disance speed Vecors displacemen velociy acceleraion Defininion Disance = how far apar wo poins
More informationANALOG I/O. Open Loop Control. Closed Loop Control. Converter (DAC) Digital to Analog Converter (Analog Output) Operational Amplifier
ANALOG I/O Inerfacing wih he analog world. Open Loop Conrol EG Speed conrol of moor Topics: Open and Closed Loop Conrol o Converer Operaional Amplifier o Conversion Nyquis Sampling Theorem µp Parallel
More informationMarkov Models and Hidden Markov Models (HMMs)
Markov Models and Hidden Markov Models (HMMs (Following slides are modified from Prof. Claire Cardie s slides and Prof. Raymond Mooney s slides. Some of he graphs are aken from he exbook. Markov Model
More informationCircle Geometry (Part 3)
Eam aer 3 ircle Geomery (ar 3) emen andard:.4.(c) yclic uadrilaeral La week we covered u otheorem 3, he idea of a convere and we alied our heory o ome roblem called IE. Okay, o now ono he ne chunk of heory
More informationCapacitors and inductors
Capaciors and inducors We coninue wih our analysis of linear circuis by inroducing wo new passive and linear elemens: he capacior and he inducor. All he mehods developed so far for he analysis of linear
More informationRenewal processes and Poisson process
CHAPTER 3 Renewal processes and Poisson process 31 Definiion of renewal processes and limi heorems Le ξ 1, ξ 2, be independen and idenically disribued random variables wih P[ξ k > 0] = 1 Define heir parial
More informationFinding MinimumCost Paths with Minimum Sharability
Finding MinimumCo Pah wih Minimum Sharabiliy S.Q. Zheng Dep. of Compuer Science Unieriy of Texa a Dalla Richardon, TX 75083, USA Email: izheng@udalla.edu Bing Yang Cico Syem 2200 E. Preiden G. Buh HW
More informationExperiment Guide for RC Circuits
Experimen Guide for I. Inroducion A. apaciors A capacior is a passive elecronic componen ha sores energy in he form of an elecrosaic field. The uni of capaciance is he farad (coulomb/vol). Pracical capacior
More informationDIFFERENTIAL EQUATIONS with TI89 ABDUL HASSEN and JAY SCHIFFMAN. A. Direction Fields and Graphs of Differential Equations
DIFFERENTIAL EQUATIONS wih TI89 ABDUL HASSEN and JAY SCHIFFMAN We will assume ha he reader is familiar wih he calculaor s keyboard and he basic operaions. In paricular we have assumed ha he reader knows
More information5.1. General Remarks to Value at Risk
5. Risk Measuremen on he Basis of Value a Risk 5.1. General Remarks o Value a Risk Slides: Tanja Dresel, Luz Johanning,. HansPeer Burghof 61 5.1 General Remarks o Value a Risk The Value a Risk of a single
More informationThe Transport Equation
The Transpor Equaion Consider a fluid, flowing wih velociy, V, in a hin sraigh ube whose cross secion will be denoed by A. Suppose he fluid conains a conaminan whose concenraion a posiion a ime will be
More informationGrowth and Decay (pp. 1 of 5)
Growh and Deca (pp. of 5) HS Mahemaics Uni: 9 Lesson: The general formula shown here can be used o describe quaniies ha increase ( ) A ( r ) or decrease a a cerain percenage rae each ear. In his model,
More information1 A B C D E F G H I J K L M N O P Q R S { U V W X Y Z 1 A B C D E F G H I J K L M N O P Q R S { U V W X Y Z
o ffix uden abel ere uden ame chool ame isric ame/ ender emale ale onh ay ear ae of irh an eb ar pr ay un ul ug ep c ov ec as ame irs ame lace he uden abel ere ae uden denifier chool se nly rined in he
More information/30/2009. Perhaps the most important of all the applications of calculus is to differential equations. Modeling with Differential Equations
10 DIFFERENTIAL EQUATIONS DIFFERENTIAL EQUATIONS Perhaps he mos imporan of all he applicaions of calculus is o differenial equaions. DIFFERENTIAL EQUATIONS When physical or social scieniss use calculus,
More informationDecomposition Forecasting
NCSS Saisical Sofware Chaper 469 Decomposiion Forecasing Inroducion Classical ime series decomposiion separaes a ime series ino five componens: mean, longrange rend, seasonaliy, cycle, and randomness.
More informationMath 308 Week 2 Solutions
Mah 308 Week Soluions Here are soluions o he evennumbered suggesed problems. The answers o he oddnumbered problems are in he back of your exbook, and he soluions are in he Soluion Manual, which you can
More informationMapMatching for LowSamplingRate GPS Trajectories
MapMaching for LowSamplingRae GPS Trajecorie Yin Lou Microof Reearch Aia vyilou@microof.com Chengyang Zhang Microof Reearch Aia vchenz@microof.com Yu Zheng Microof Reearch Aia yuzheng@microof.com
More informationRenewal Theory. Chapter 7 1
Renewal Theory Definiions, Limi Theorems, Renewal Reward Processes, Alernaing Renewal Processes, Age and Excess Life Disribuions, Inspecion Paradox Chaper 7 1 Poisson Process: Couning process iid exponenial
More informationChapter 2 Problems. s = d t up. = 40km / hr d t down. 60km / hr. d t total. + t down. = t up. = 40km / hr + d. 60km / hr + 40km / hr
Chaper 2 Problems 2.2 A car ravels up a hill a a consan speed of 40km/h and reurns down he hill a a consan speed of 60 km/h. Calculae he average speed for he rip. This problem is a bi more suble han i
More informationFourier series. Learning outcomes
Fourier series 23 Conens. Periodic funcions 2. Represening ic funcions by Fourier Series 3. Even and odd funcions 4. Convergence 5. Halfrange series 6. The complex form 7. Applicaion of Fourier series
More informationDigital Data Acquisition
ME231 Measuremens Laboraory Spring 1999 Digial Daa Acquisiion Edmundo Corona c The laer par of he 20h cenury winessed he birh of he compuer revoluion. The developmen of digial compuer echnology has had
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 informationStock Trading with Recurrent Reinforcement Learning (RRL) CS229 Application Project Gabriel Molina, SUID 5055783
Sock raing wih Recurren Reinforcemen Learning (RRL) CS9 Applicaion Projec Gabriel Molina, SUID 555783 I. INRODUCION One relaively new approach o financial raing is o use machine learning algorihms o preic
More informationGraphing the Von Bertalanffy Growth Equation
file: d:\b1732013\von_beralanffy.wpd dae: Sepember 23, 2013 Inroducion Graphing he Von Beralanffy Growh Equaion Previously, we calculaed regressions of TL on SL for fish size daa and ploed he daa and
More information4. The Poisson Distribution
Virual Laboraories > 13. The Poisson Process > 1 2 3 4 5 6 7 4. The Poisson Disribuion The Probabiliy Densiy Funcion We have shown ha he k h arrival ime in he Poisson process has he gamma probabiliy densiy
More informationAP Calculus BC 2010 Scoring Guidelines
AP Calculus BC Scoring Guidelines The College Board The College Board is a noforprofi membership associaion whose mission is o connec sudens o college success and opporuniy. Founded in, he College Board
More informationPoisson process Markov process
EP2200 Queuing heory and eleraffic yem 2nd lecure Poion proce Markov proce Vikoria Fodor KTH Laboraory for Communicaion nework, School of Elecrical Engineering 1 Coure ouline Sochaic procee behind queuing
More informationHomomorphisms from sparse graphs with large girth
Homomorphisms from sparse graphs wih large girh O.V. Borodin, S.J. Kim, A.V. Kosochka, D.B. Wes revised April, 200 Absrac We show ha a planar graph wih girh a leas 20 2 has circular chromaic number a
More informationState Machines: Brief Introduction to Sequencers Prof. Andrew J. Mason, Michigan State University
Inroducion ae Machines: Brief Inroducion o equencers Prof. Andrew J. Mason, Michigan ae Universiy A sae machine models behavior defined by a finie number of saes (unique configuraions), ransiions beween
More information4kq 2. D) south A) F B) 2F C) 4F D) 8F E) 16F
efore you begin: Use black pencil. Wrie and bubble your SU ID Number a boom lef. Fill bubbles fully and erase cleanly if you wish o change! 20 Quesions, each quesion is 10 poins. Each quesion has a mos
More informationOptimal Investment and Consumption Decision of Family with Life Insurance
Opimal Invesmen and Consumpion Decision of Family wih Life Insurance Minsuk Kwak 1 2 Yong Hyun Shin 3 U Jin Choi 4 6h World Congress of he Bachelier Finance Sociey Torono, Canada June 25, 2010 1 Speaker
More information