Algorithmic Discrete Mathematics 6. Exercise Sheet
|
|
- Hillary Dalton
- 5 years ago
- Views:
Transcription
1 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 o or he array (,,,,, 9, ). Fir ep i o conruc he heap. Thi can be done by uing buildheap or ju inering all number and ue heapify afer each inerion. So we ge a heap where he minimal elemen i he roo. We exrac hi roo, pu i in a new array and pu he elemen on he righ boom of he heap o he roo. Now he heap propery will in general be violaed. Therefore we ue heapify o regain ha propery. The big roo elemen ink down ino he heap. Now he malle elemen of he remainig elemen i he roo of he heap and he procedure ar from he beginning. We do hi ill our heap i empy. Then our array i ored. For hi pecial li he iniial heap i of he form (,,,,, 9, ). (Fir: roo, econd: lef child of roo, hird: righ child roo, fourh: lef child of lef child of roo,... ) We exrac he elemen and become he new roo, o we ge he remaining heap (,,,,, 9). We wap and and and by uing heapify and ge o (,,,,, 9). The re of he oring proce work he ame way a before. Exercie G (Maximal flow) Le D = (V, E) be a direced graph wih ource and ink. The capaciie on he edge hould be naural number and he maximal flow x from o i given. Now we wan o modify he capaciy of one edge in he graph by (a) increaing i by, (b) decreaing i by. Give an algorihm ha calculae he maximal flow from o in ha changed graph in O( V + E ). (a) If we increae he capaciy of one edge by hen we ju need o verify if here i an augmening pah in he changed graph. Since we only increaed one edge be he maximal flow can only increae by. Checking if here i a augmening pah can be done by uing DFS which i O( V + E ). (b) If we decreae he capaciy of one edge by here can be wo differen cae..cae: The flow i ill valid and doe no exceed any capaciy on a edge in he graph. Then he maximal flow ju ay he ame..cae: The flow exceed he capaciy on he edge we decreaed he capciy of. We denoe hi edge by (u, v ). Now le P be pah from o u and P be a pah from v o. Thi pah hould be dijoin and only conain edge wih a poiive acual flow. Such pah do exi, ince oherwie here would be no flow on he edge (u, v ) and can be found by uing DFS again. So he runime i O( V + E ) for finding boh of hee pah. Now reduce he flow on he whole pah P (u, v )P by, o he general flow for he graph i valid again, wih a maximal flow reduced by. I could be he cae now ha hi i no he maximal flow, bu we know ha he maximal flow can only be one flow uni bigger han he acual flow. So we ju look for anoher augmening pah a in par (a) and ge he maximal flow for he changed graph. Thi can be done in O( V + E ). Since we did algorihm ep wih O( V + E ) he whole procedure i in O( V + E ). Exercie G (Menger Theorem) (a) A direced graph D = (V, E) i called rongly k-conneced, if for every pair of verice (u, v ) and every e of edge B E wih B k, here exi a direced pah from u o v in D = (V, E \ B). Prove he edge verion of Menger
2 Theorem. Menger Theorem for edge: A direced graph D = (V, E) i rongly k-conneced, iff for every pair of verice (, ) here exi a lea k direced pah from o which hare no edge. (b) A direced graph D = (V, E) i called k-verex-conneced, if for every pair of verice (u, v ) and every e of verice W V wih W k here exi a direced pah from u o v in D W. Prove he verex verion of Menger Theorem. Menger Theorem for verice: A direced graph D = (V, E) i k-verex-conneced, iff for every pair of verice (, ) here exi a lea k direced pah from o haring no verice. (c) Do Menger Theorem alo hold for undireced graph? (a) : We how ha D i rongly k-conneced implie he exiance of he k direced pah having dijoin edge fir. We do i by howing he following equivalen aemen: There exi verice, uch ha here are a mo k direced pah from o having dijoin edge D i no rongly k-conneced. So le (, ) be uch a pair of verice a decribed above wih a mo k direced pah. We e he capaciy of all edge o and look for flow from o. The maximal flow we ge by hi procedure can be inepreed a he number of direced pah from o having dijoin edge. Now we ue he Max-Flow-Min-Cu Theorem o ge a cu (S, S). The value of ha cu i a mo k, ince he maximal flow can be a mo k. Now we e B a he e of all edge in D connecing S and S. By he previou argumenaion B k. Now we delee all edge in he e B from D. By he cu propery of (S, S) here can be any more direced pah from o in (V, E \ B). Hence D i no rongly k-conneced. : We how ha he exiance of k direced pah from o for arbiary verice, yield ha D i rongly k-conneced. So le D be uch a graph and, V. For any ube B E wih B k we can only delee edge of a mo k direced pah having dijoin edge. So here remain a lea one more direced pah from (, ) which did no ue any of he edge in B. So he graph D i rongly k-conneced. (b) : We wan o how ha for every k-verex-conneced graph D and verice, V here exi a lea k direced pah from o haring no verice. Again we how he following equivalen aemen: If here exi verice, V where we don have k direced pah from o haring no verice, hen D i no k-verex-conneced. So le, V be uch verice, where we have a mo k direced pah from o haring no verice. A in par (a) we wan o ue he Max-Flow-Min-Cu Theorem. Therefore we double each verex i V and name he verice i and i. All edge which where direced o i now are direced o i and all edge which ared in i now ar in i. Addiionally we add edge from i o i wih capaciy. All oher edge ge capaciy.we call hi graph D. Now we deermine he maximal flow f from o in D. Thi flow equal he number of direced pah from o in he orginal graph, which hare no verice. Therefore we inroduced he doubling of all he verice. By he Min-Cu-Max-Flow Theorem we find a cu (S, S) in D wih value f. Now le U be he e of all edge in he minimal cu (S, S). Thi e U conain an edge (i, i ) for every pah from o and all hee edge correpond o a verex i in he orginal graph D. So deleing all edge of B in D i like deleing he correponding verice in D. We call hi verex e W. Since by aumpion B k we ge W k, o we may delee hi verex e in order o look for k-verex-conneciviy. By conrucion here i no more direced pah from o in D \ B. By ranlaing hi o he verex eing we conclude ha here exi no more direced pah from o in our graph D \ W. Thi mean our graph D i no k-verex-conneced. : Le D be a direced graph where for each pair of verice, V here exi a lea k direced pah from o, haring no verice. So we delee any verex e W V from D wih W k. In he wor cae we deleed a verex fromk differen pah from o. Since all hoe pah do no hare verice here mu be a lea one more pah where we did no delee any verex from. So here i a lea one direced pah in D W. Thi mean D i k-verex-conneced. (c) We did no ue ha our graph we worked wih i direced, o he proof work he ame way for undireced graph. We ju have o ubiue direced wih undireced a every place here. Homework Exercie H Look a he following varian of he quickor algorihm. Algorihm QuickSor(a,l,r) (0 poin)
3 Inpu: An array a of lengh n wih a[i], lower and upper bound l, r wih l r n. Oupu: The array a wih a[l] a[l + ]... a[r]. () Se i = l and j = r. () While i < j Do () Do i = i + While a[i] a[r]. () Do j = j - While (a[ j] a[r] and j i). () If j > i Then Swap a[ j] and a[i]. () End While (7) Swap a[i] and a[r]. (8) If l < i Then QuickSor (a, l, i ). (9) If i + < r Then QuickSor (a, i +, r). (0) reurn a. The ieraion ar by uing QuickSor(a,,lengh(a)). (a) Ue Quickor o or he number array (,, 8,,,, 9,,,, 7). (b) How doe a number array have o look like, o ha Quickor ha a runime of O(n )/O(n log n). Decribe i in general and give an example for boh cae by uing he fir 0 naural number. (a) We give a decripion wha happen while uing Quickor. In he fir run we wap and, 8 and, and and finally 9 and 7. Then 7 i already a he righ place in he array. A ha poin in he algorihm he array i given by (,,,,,, 7,, 8,, 9). Now we have o or he remaining lef and ride ide of he number 7. We do i for he lef ide. The righ ide work he ame way. The array (,,,,, ) become (,,,,, ) Now i a he righ place. The nex ep we wap and. So (,,,, ) become (,,,, ). The array () wih one elemen i already ored and he oher array (,, ) ill need hree Quickor ep where alway he elemen on he righ ide of he array i deleed ill he elemen i he la one lef. In hoe la ep no more wap are involved. Afer doing he ame hing wih he righ par (, 8,, 9) we ge he li (,,,,,, 7, 8, 9,, ). (b) The wor cae for Quickor, uch ha i ha runime O(n ) i a already ored li. Thi way he elemen on he righ hand ide alway ay here and Quickor i ued wih a li wih only one le elemen han before. So we need n Quickor ieraion. An example would be (,,,,,, 7, 8, 9, 0). If we wan a runime of O(n log n) for Quickor we have o pli he li of number in half every ime. Thi way we only have o do half of comparion of he ep before. An example i (,,,, 8,, 7, 0, 9, ).
4 Exercie H7 (Finding maximal flow) Find he maximal flow from o in he following direced graph and prove i maximaliy. (0 poin) The maximal flow i given by. One can proof ha by he minimal cu which coni of S = {,,,, } and S = {, }. Anoher way o do i i o ue he Ford-Fulkeron algorihm and find augmening pah ill here are no more lef. One poible oluion i: / / 0/ / / / / / / / / / / / Exercie H8 (Righ or Wrong?) (0 poin) Le D = (V, E) be a direced graph wih ineger capaciie C e for he edge e E. Le be he ource in hi graph and he ink. Which of he following aemen are righ? Which are wrong? Give a proof or a counerexample. (a) If all capaciie are even, hen here exi a maximal flow f from o, uch ha f (e) i even for all edge e E. (b) If all capaciie are odd, hen here exi a maximal flow f from o, uch ha f (e) i odd for all edge e E. (c) If f i a maximal flow from o, hen eiher f (e) = 0 or f (e) = c e hold for all edge e E. (d) There exi a maximal flow from o, uch ha eiher f (e) = 0 or f (e) = c e hold for all edge e E. (e) If all capaciie on he edge are differen, hen he minimal cu i unique. (f) If we muliply each capaciy wih he poiive real number λ +, hen every minimal cu in here original graph i a minimal cu in he modified graph. (g) If we add he poiive number λ + o each capaciy, hen every minimal cu in he orginal graph i a minimal cu in he modified graph.
5 /0 / 80 /0 / 00 7 Figure : graph Figure : graph (a) Thi aemen i rue. A he beginning he flow f = 0 i even. Every ime we find an augmening pah i add an even flow o all edge in ha pah ince all capaciie are even. The reuling graph afer ha augmening proce ill ha even capaciie ince we ubraced only even number from even number. So by inducion here i a maximal flow uch ha all flow on he edge are even. (b) Thi aemen i wrong. Look a he graph D wih V = {,,, u, }, E = {(, ), (, ), (, u), (, u), (u, )}. The capaciie for hoe edge hould be excep for he edge (u, ) wih capaciy. So all capaciie are odd, bu he maximal i wih f (u,) =. (c) Thi aemen i wrong, ee graph for a counerexample. (d) Thi aemen i wrong again, ee Graph for counerexample, ince here only exi one poible maximal flow graph which doe no fulfil he needed condiion. (e) Thi aemen i wrong, ee graph for a counerexample. A minimal cu ha value 0 bu here are wo cu namely ({}, {,,, }) and ({,,, }, {}) having ha value. (f) Thi aemen i righ. We denoe he value of a cu W by c(δ + (W )). Thi mean we um up he value of all edge going from verice in W o W = V \ W. Le S be a minimal cu, o we have c(δ + (S)) c(δ + (W )) for all cu W. In he changend graph (D = (V, E), ĉ) wih λ + we ge ĉ(δ + (S)) = λ c(δ + (S)) λ c(δ + (W )) = ĉ(δ + (W )) for all cu W. So S i ill a minimal cu in he graph (D = (V, E), ĉ). (g) Thi aemen i wrong, a we can ee be looking a graph again. A we have een here a wo cu ({}, {,,, }) and ({,,, }, {}) wih value 0. If we add for example o every edge hen ({}, {,,, }) would ill be minimal wih value. The cu ({,,, }, {}) would have value and herefore would no be minimal anymore.
Randomized 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 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 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 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 information1 Motivation and Basic Definitions
CSCE : Deign and Analyi of Algorihm Noe on Max Flow Fall 20 (Baed on he preenaion in Chaper 26 of Inroducion o Algorihm, 3rd Ed. by Cormen, Leieron, Rive and Sein.) Moivaion and Baic Definiion Conider
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 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 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 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 informationReminder: Flow Networks
0/0/204 Ma/CS 6a Cla 4: Variou (Flow) Execie Reminder: Flow Nework A flow nework i a digraph G = V, E, ogeher wih a ource verex V, a ink verex V, and a capaciy funcion c: E N. Capaciy Source 7 a b c d
More informationMatching. Slides designed by Kevin Wayne.
Maching Maching. Inpu: undireced graph G = (V, E). M E i a maching if each node appear in a mo edge in M. Max maching: find a max cardinaliy maching. Slide deigned by Kevin Wayne. Biparie Maching Biparie
More information18 Extensions of Maximum Flow
Who are you?" aid Lunkwill, riing angrily from hi ea. Wha do you wan?" I am Majikhie!" announced he older one. And I demand ha I am Vroomfondel!" houed he younger one. Majikhie urned on Vroomfondel. I
More informationAdmin MAX FLOW APPLICATIONS. Flow graph/networks. Flow constraints 4/30/13. CS lunch today Grading. in-flow = out-flow for every vertex (except s, t)
/0/ dmin lunch oday rading MX LOW PPLIION 0, pring avid Kauchak low graph/nework low nework direced, weighed graph (V, ) poiive edge weigh indicaing he capaciy (generally, aume ineger) conain a ingle ource
More informationAlgorithm Design and Analysis
Algorihm Deign and Analyi LECTURE 0 Nework Flow Applicaion Biparie maching Edge-dijoin pah Adam Smih 0//0 A. Smih; baed on lide by E. Demaine, C. Leieron, S. Rakhodnikova, K. Wayne La ime: Ford-Fulkeron
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 informationMain Reference: Sections in CLRS.
Maximum Flow Reied 09/09/200 Main Reference: Secion 26.-26. in CLRS. Inroducion Definiion Muli-Source Muli-Sink The Ford-Fulkeron Mehod Reidual Nework Augmening Pah The Max-Flow Min-Cu Theorem The Edmond-Karp
More informationFlow Networks. Ma/CS 6a. Class 14: Flow Exercises
0/0/206 Ma/CS 6a Cla 4: Flow Exercie Flow Nework A flow nework i a digraph G = V, E, ogeher wih a ource verex V, a ink verex V, and a capaciy funcion c: E N. Capaciy Source 7 a b c d e Sink 0/0/206 Flow
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 informationToday: Max Flow Proofs
Today: Max Flow Proof COSC 58, Algorihm March 4, 04 Many of hee lide are adaped from everal online ource Reading Aignmen Today cla: Chaper 6 Reading aignmen for nex cla: Chaper 7 (Amorized analyi) In-Cla
More informationIntroduction to Congestion Games
Algorihmic Game Theory, Summer 2017 Inroducion o Congeion Game Lecure 1 (5 page) Inrucor: Thoma Keelheim In hi lecure, we ge o know congeion game, which will be our running example for many concep in game
More informationCS 473G Lecture 15: Max-Flow Algorithms and Applications Fall 2005
CS 473G Lecure 1: Max-Flow Algorihm and Applicaion Fall 200 1 Max-Flow Algorihm and Applicaion (November 1) 1.1 Recap Fix a direced graph G = (V, E) ha doe no conain boh an edge u v and i reveral v u,
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 information4/12/12. Applications of the Maxflow Problem 7.5 Bipartite Matching. Bipartite Matching. Bipartite Matching. Bipartite matching: the flow network
// Applicaion of he Maxflow Problem. Biparie Maching Biparie Maching Biparie maching. Inpu: undireced, biparie graph = (, E). M E i a maching if each node appear in a mo one edge in M. Max maching: find
More informationMAXIMUM FLOW. introduction Ford-Fulkerson algorithm maxflow-mincut theorem
MAXIMUM FLOW inroducion Ford-Fulkeron algorihm maxflow-mincu heorem Mincu problem Inpu. An edge-weighed digraph, ource verex, and arge verex. each edge ha a poiive capaciy capaciy 9 10 4 15 15 10 5 8 10
More informationCSC 364S Notes University of Toronto, Spring, The networks we will consider are directed graphs, where each edge has associated with it
CSC 36S Noe Univeriy of Torono, Spring, 2003 Flow Algorihm The nework we will conider are direced graph, where each edge ha aociaed wih i a nonnegaive capaciy. The inuiion i ha if edge (u; v) ha capaciy
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 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 informationGreedy. I Divide and Conquer. I Dynamic Programming. I Network Flows. Network Flow. I Previous topics: design techniques
Algorihm Deign Technique CS : Nework Flow Dan Sheldon April, reedy Divide and Conquer Dynamic Programming Nework Flow Comparion Nework Flow Previou opic: deign echnique reedy Divide and Conquer Dynamic
More informationCSE 521: Design & Analysis of Algorithms I
CSE 52: Deign & Analyi of Algorihm I Nework Flow Paul Beame Biparie Maching Given: A biparie graph G=(V,E) M E i a maching in G iff no wo edge in M hare a verex Goal: Find a maching M in G of maximum poible
More information16 Max-Flow Algorithms and Applications
Algorihm A proce canno be underood by opping i. Underanding mu move wih he flow of he proce, mu join i and flow wih i. The Fir Law of Mena, in Frank Herber Dune (196) There a difference beween knowing
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 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 informationMaximum Flow in Planar Graphs
Maximum Flow in Planar Graph Planar Graph and i Dual Dualiy i defined for direced planar graph a well Minimum - cu in undireced planar graph An - cu (undireced graph) An - cu The dual o he cu Cu/Cycle
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 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 informationAverage Case Lower Bounds for Monotone Switching Networks
Average Cae Lower Bound for Monoone Swiching Nework Yuval Filmu, Toniann Piai, Rober Robere, Sephen Cook Deparmen of Compuer Science Univeriy of Torono Monoone Compuaion (Refreher) Monoone circui were
More informationEECE 301 Signals & Systems Prof. Mark Fowler
EECE 31 Signal & Syem Prof. Mark Fowler Noe Se #27 C-T Syem: Laplace Tranform Power Tool for yem analyi Reading Aignmen: Secion 6.1 6.3 of Kamen and Heck 1/18 Coure Flow Diagram The arrow here how concepual
More information2. VECTORS. R Vectors are denoted by bold-face characters such as R, V, etc. The magnitude of a vector, such as R, is denoted as R, R, V
ME 352 VETS 2. VETS Vecor algebra form he mahemaical foundaion for kinemaic and dnamic. Geomer of moion i a he hear of boh he kinemaic and dnamic of mechanical em. Vecor anali i he imehonored ool for decribing
More informationNotes on cointegration of real interest rates and real exchange rates. ρ (2)
Noe on coinegraion of real inere rae and real exchange rae Charle ngel, Univeriy of Wiconin Le me ar wih he obervaion ha while he lieraure (mo prominenly Meee and Rogoff (988) and dion and Paul (993))
More informationHomework sheet Exercises done during the lecture of March 12, 2014
EXERCISE SESSION 2A FOR THE COURSE GÉOMÉTRIE EUCLIDIENNE, NON EUCLIDIENNE ET PROJECTIVE MATTEO TOMMASINI Homework shee 3-4 - Exercises done during he lecure of March 2, 204 Exercise 2 Is i rue ha he parameerized
More informationCHAPTER 7: SECOND-ORDER CIRCUITS
EEE5: CI RCUI T THEORY CHAPTER 7: SECOND-ORDER CIRCUITS 7. Inroducion Thi chaper conider circui wih wo orage elemen. Known a econd-order circui becaue heir repone are decribed by differenial equaion ha
More informationSOLUTIONS TO ECE 3084
SOLUTIONS TO ECE 384 PROBLEM 2.. For each sysem below, specify wheher or no i is: (i) memoryless; (ii) causal; (iii) inverible; (iv) linear; (v) ime invarian; Explain your reasoning. If he propery is no
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 informationSample Final Exam (finals03) Covering Chapters 1-9 of Fundamentals of Signals & Systems
Sample Final Exam Covering Chaper 9 (final04) Sample Final Exam (final03) Covering Chaper 9 of Fundamenal of Signal & Syem Problem (0 mar) Conider he caual opamp circui iniially a re depiced below. I LI
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 informationExponential Sawtooth
ECPE 36 HOMEWORK 3: PROPERTIES OF THE FOURIER TRANSFORM SOLUTION. Exponenial Sawooh: The eaie way o do hi problem i o look a he Fourier ranform of a ingle exponenial funcion, () = exp( )u(). From he able
More informationPHYSICS Solving Equations
Sepember 20, 2013 PHYSIS Solving Equaion Sepember 2013 www.njcl.org Solving for a Variable Our goal i o be able o olve any equaion for any variable ha appear in i. Le' look a a imple equaion fir. The variable
More informationIntroduction to SLE Lecture Notes
Inroducion o SLE Lecure Noe May 13, 16 - The goal of hi ecion i o find a ufficien condiion of λ for he hull K o be generaed by a imple cure. I urn ou if λ 1 < 4 hen K i generaed by a imple curve. We will
More information6.302 Feedback Systems Recitation : Phase-locked Loops Prof. Joel L. Dawson
6.32 Feedback Syem Phae-locked loop are a foundaional building block for analog circui deign, paricularly for communicaion circui. They provide a good example yem for hi cla becaue hey are an excellen
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 informationThey were originally developed for network problem [Dantzig, Ford, Fulkerson 1956]
6. Inroducion... 6. The primal-dual algorihmn... 6 6. Remark on he primal-dual algorihmn... 7 6. A primal-dual algorihmn for he hore pah problem... 8... 9 6.6 A primal-dual algorihmn for he weighed maching
More informationTo become more mathematically correct, Circuit equations are Algebraic Differential equations. from KVL, KCL from the constitutive relationship
Laplace Tranform (Lin & DeCarlo: Ch 3) ENSC30 Elecric Circui II The Laplace ranform i an inegral ranformaion. I ranform: f ( ) F( ) ime variable complex variable From Euler > Lagrange > Laplace. Hence,
More informationPhysics 240: Worksheet 16 Name
Phyic 4: Workhee 16 Nae Non-unifor circular oion Each of hee proble involve non-unifor circular oion wih a conan α. (1) Obain each of he equaion of oion for non-unifor circular oion under a conan acceleraion,
More informationFlow networks, flow, maximum flow. Some definitions. Edmonton. Saskatoon Winnipeg. Vancouver Regina. Calgary. 12/12 a.
Flow nework, flow, maximum flow Can inerpre direced graph a flow nework. Maerial coure hrough ome yem from ome ource o ome ink. Source produce maerial a ome eady rae, ink conume a ame rae. Example: waer
More information6/3/2009. CS 244 Algorithm Design Instructor: t Artur Czumaj. Lecture 8 Network flows. Maximum Flow and Minimum Cut. Minimum Cut Problem.
Maximum Flow and Minimum Cu CS lgorihm Deign Inrucor: rur Czumaj Lecure Nework Max and min cu. Two very rich algorihmic problem. Cornerone problem in combinaorial opimizaion. Beauiful mahemaical dualiy.
More informationDiscussion Session 2 Constant Acceleration/Relative Motion Week 03
PHYS 100 Dicuion Seion Conan Acceleraion/Relaive Moion Week 03 The Plan Today you will work wih your group explore he idea of reference frame (i.e. relaive moion) and moion wih conan acceleraion. You ll
More information18.03SC Unit 3 Practice Exam and Solutions
Sudy Guide on Sep, Dela, Convoluion, Laplace You can hink of he ep funcion u() a any nice mooh funcion which i for < a and for > a, where a i a poiive number which i much maller han any ime cale we care
More informationPHYSICS 151 Notes for Online Lecture #4
PHYSICS 5 Noe for Online Lecure #4 Acceleraion The ga pedal in a car i alo called an acceleraor becaue preing i allow you o change your elociy. Acceleraion i how fa he elociy change. So if you ar fro re
More information23 Maximum Flows and Minimum Cuts
A proce canno be underood by opping i. Underanding mu move wih he flow of he proce, mu join i and flow wih i. The Fir Law of Mena, in Frank Herber Dune (196) Conrary o expecaion, flow uually happen no
More informationBasic Tools CMSC 641. Running Time. Problem. Problem. Algorithmic Design Paradigms. lg (n!) (lg n)! (lg n) lgn n.2
Baic Tool CMSC April, Review Aympoic Noaion Order of Growh Recurrence relaion Daa Srucure Li, Heap, Graph, Tree, Balanced Tree, Hah Table Advanced daa rucure: Binomial Heap, Fibonacci Heap Soring Mehod
More informationHow to Solve System Dynamic s Problems
How o Solve Sye Dynaic Proble A ye dynaic proble involve wo or ore bodie (objec) under he influence of everal exernal force. The objec ay uliaely re, ove wih conan velociy, conan acceleraion or oe cobinaion
More informationElectrical and current self-induction
Elecrical and curren self-inducion F. F. Mende hp://fmnauka.narod.ru/works.hml mende_fedor@mail.ru Absrac The aricle considers he self-inducance of reacive elemens. Elecrical self-inducion To he laws of
More informationBipartite Matching. Matching. Bipartite Matching. Maxflow Formulation
Mching Inpu: undireced grph G = (V, E). Biprie Mching Inpu: undireced, biprie grph G = (, E).. Mching Ern Myr, Hrld äcke Biprie Mching Inpu: undireced, biprie grph G = (, E). Mflow Formulion Inpu: undireced,
More informationarxiv: v1 [cs.cg] 21 Mar 2013
On he rech facor of he Thea-4 graph Lui Barba Proenji Boe Jean-Lou De Carufel André van Renen Sander Verdoncho arxiv:1303.5473v1 [c.cg] 21 Mar 2013 Abrac In hi paper we how ha he θ-graph wih 4 cone ha
More informationCONTROL SYSTEMS. Chapter 10 : State Space Response
CONTROL SYSTEMS Chaper : Sae Space Repone GATE Objecive & Numerical Type Soluion Queion 5 [GATE EE 99 IIT-Bombay : Mark] Conider a econd order yem whoe ae pace repreenaion i of he form A Bu. If () (),
More informationToday s topics. CSE 421 Algorithms. Problem Reduction Examples. Problem Reduction. Undirected Network Flow. Bipartite Matching. Problem Reductions
Today opic CSE Algorihm Richard Anderon Lecure Nework Flow Applicaion Prolem Reducion Undireced Flow o Flow Biparie Maching Dijoin Pah Prolem Circulaion Loweround conrain on flow Survey deign Prolem Reducion
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 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 informationTHE BERNOULLI NUMBERS. t k. = lim. = lim = 1, d t B 1 = lim. 1+e t te t = lim t 0 (e t 1) 2. = lim = 1 2.
THE BERNOULLI NUMBERS The Bernoulli numbers are defined here by he exponenial generaing funcion ( e The firs one is easy o compue: (2 and (3 B 0 lim 0 e lim, 0 e ( d B lim 0 d e +e e lim 0 (e 2 lim 0 2(e
More informationThe Arcsine Distribution
The Arcsine Disribuion Chris H. Rycrof Ocober 6, 006 A common heme of he class has been ha he saisics of single walker are ofen very differen from hose of an ensemble of walkers. On he firs homework, we
More information5.2 GRAPHICAL VELOCITY ANALYSIS Polygon Method
ME 352 GRHICL VELCITY NLYSIS 52 GRHICL VELCITY NLYSIS olygon Mehod Velociy analyi form he hear of kinemaic and dynamic of mechanical yem Velociy analyi i uually performed following a poiion analyi; ie,
More informationGeometric Path Problems with Violations
Click here o view linked Reference 1 1 1 0 1 0 1 0 1 0 1 Geomeric Pah Problem wih Violaion Anil Mahehwari 1, Subha C. Nandy, Drimi Paanayak, Saanka Roy and Michiel Smid 1 1 School of Compuer Science, Carleon
More informationChapter 7: Inverse-Response Systems
Chaper 7: Invere-Repone Syem Normal Syem Invere-Repone Syem Baic Sar ou in he wrong direcion End up in he original eady-ae gain value Two or more yem wih differen magniude and cale in parallel Main yem
More informationu(t) Figure 1. Open loop control system
Open loop conrol v cloed loop feedbac conrol The nex wo figure preen he rucure of open loop and feedbac conrol yem Figure how an open loop conrol yem whoe funcion i o caue he oupu y o follow he reference
More informationAlgorithms. Algorithms 6.4 MAXIMUM FLOW
Algorihm ROBERT SEDGEWICK KEVIN WAYNE 6.4 MAXIMUM FLOW Algorihm F O U R T H E D I T I O N ROBERT SEDGEWICK KEVIN WAYNE hp://alg4.c.princeon.edu inroducion Ford Fulkeron algorihm maxflow mincu heorem analyi
More informationPlease Complete Course Survey. CMPSCI 311: Introduction to Algorithms. Approximation Algorithms. Coping With NP-Completeness. Greedy Vertex Cover
Pleae Complee Coure Survey CMPSCI : Inroducion o Algorihm Dealing wih NP-Compleene Dan Sheldon hp: //owl.oi.uma.edu/parner/coureevalsurvey/uma/ Univeriy of Maachue Slide Adaped from Kevin Wayne La Compiled:
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 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 informationPredator - Prey Model Trajectories and the nonlinear conservation law
Predaor - Prey Model Trajecories and he nonlinear conservaion law James K. Peerson Deparmen of Biological Sciences and Deparmen of Mahemaical Sciences Clemson Universiy Ocober 28, 213 Ouline Drawing Trajecories
More informationHomework-8(1) P8.3-1, 3, 8, 10, 17, 21, 24, 28,29 P8.4-1, 2, 5
Homework-8() P8.3-, 3, 8, 0, 7, 2, 24, 28,29 P8.4-, 2, 5 Secion 8.3: The Response of a Firs Order Circui o a Consan Inpu P 8.3- The circui shown in Figure P 8.3- is a seady sae before he swich closes a
More information6.8 Laplace Transform: General Formulas
48 HAP. 6 Laplace Tranform 6.8 Laplace Tranform: General Formula Formula Name, ommen Sec. F() l{ f ()} e f () d f () l {F()} Definiion of Tranform Invere Tranform 6. l{af () bg()} al{f ()} bl{g()} Lineariy
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 informationBest test practice: Take the past test on the class website
Bes es pracice: Take he pas es on he class websie hp://communiy.wvu.edu/~miholcomb/phys11.hml I have posed he key o he WebAssign pracice es. Newon Previous Tes is Online. Forma will be idenical. You migh
More informationLaplace Transform. Inverse Laplace Transform. e st f(t)dt. (2)
Laplace Tranform Maoud Malek The Laplace ranform i an inegral ranform named in honor of mahemaician and aronomer Pierre-Simon Laplace, who ued he ranform in hi work on probabiliy heory. I i a powerful
More informationCSE 421 Introduction to Algorithms Winter The Network Flow Problem
CSE 42 Inroducion o Algorihm Winer 202 The Nework Flow Problem 2 The Nework Flow Problem 5 a 4 3 x 3 7 6 b 4 y 4 7 6 c 5 z How much uff can flow from o? 3 Sovie Rail Nework, 955 Reference: On he hiory
More information3/3/2015. Chapter 7. Network Flow. Maximum Flow and Minimum Cut. Minimum Cut Problem
// Chaper Nework Flow Maximum Flow and Minimum Cu Max flow and min cu. Two very rich algorihmic problem. Cornerone problem in combinaorial opimizaion. Beauiful mahemaical dualiy. Nonrivial applicaion /
More informationNetwork Flow Applications
Hopial problem Neork Flo Applicaion Injured people: n Hopial: k Each peron need o be brough o a hopial no more han 30 minue aay Each hopial rea no more han n/k" people Gien n, k, and informaion abou people
More informationFLAT CYCLOTOMIC POLYNOMIALS OF ORDER FOUR AND HIGHER
#A30 INTEGERS 10 (010), 357-363 FLAT CYCLOTOMIC POLYNOMIALS OF ORDER FOUR AND HIGHER Nahan Kaplan Deparmen of Mahemaic, Harvard Univeriy, Cambridge, MA nkaplan@mah.harvard.edu Received: 7/15/09, Revied:
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 informationMon Apr 2: Laplace transform and initial value problems like we studied in Chapter 5
Mah 225-4 Week 2 April 2-6 coninue.-.3; alo cover par of.4-.5, EP 7.6 Mon Apr 2:.-.3 Laplace ranform and iniial value problem like we udied in Chaper 5 Announcemen: Warm-up Exercie: Recall, The Laplace
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 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 informationPosition, Velocity, and Acceleration
rev 06/2017 Posiion, Velociy, and Acceleraion Equipmen Qy Equipmen Par Number 1 Dynamic Track ME-9493 1 Car ME-9454 1 Fan Accessory ME-9491 1 Moion Sensor II CI-6742A 1 Track Barrier Purpose The purpose
More informationOn the N P-hardness of GRacSim drawing
Journal of Graph Algorihm and Applicaion hp://jgaa.info/ vol. 0, no. 0, pp. 0 0 (0) DOI: 10.7155/jgaa.00456 On he N P-hardne of GRacSim drawing and k-sefe Problem L. Grilli 1 1 Deparmen of Engineering,
More information26.1 Flow networks. f (u,v) = 0.
26 Maimum Flow Ju a we can model a road map a a direced graph in order o find he hore pah from one poin o anoher, we can alo inerpre a direced graph a a flow nework and ue i o anwer queion abou maerial
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 informationTopics in Combinatorial Optimization May 11, Lecture 22
8.997 Topics in Combinaorial Opimizaion May, 004 Lecure Lecurer: Michel X. Goemans Scribe: Alanha Newman Muliflows an Disjoin Pahs Le G = (V,E) be a graph an le s,,s,,...s, V be erminals. Our goal is o
More informationPrice of Stability and Introduction to Mechanism Design
Algorihmic Game Theory Summer 2017, Week 5 ETH Zürich Price of Sabiliy and Inroducion o Mechanim Deign Paolo Penna Thi i he lecure where we ar deigning yem which involve elfih player. Roughly peaking,
More informationMath 333 Problem Set #2 Solution 14 February 2003
Mah 333 Problem Se #2 Soluion 14 February 2003 A1. Solve he iniial value problem dy dx = x2 + e 3x ; 2y 4 y(0) = 1. Soluion: This is separable; we wrie 2y 4 dy = x 2 + e x dx and inegrae o ge The iniial
More informationarxiv: v2 [cs.cg] 30 Apr 2015
Diffue Reflecion Diameer in Simple Polygon arxiv:1302.2271v2 [c.cg] 30 Apr 2015 Gill Bareque Deparmen of Compuer Science Technion Haifa, Irael bareque@c.echnion.ac.il Eli Fox-Epein Deparmen of Compuer
More information