Approximate Maximum Flow in Undirected Networks by Christiano, Kelner, Madry, Spielmann, Teng (STOC 2011)

Size: px
Start display at page:

Download "Approximate Maximum Flow in Undirected Networks by Christiano, Kelner, Madry, Spielmann, Teng (STOC 2011)"

Transcription

1 Approximat Maximum Flow in Undirctd Ntworks by Christiano, Klnr, Madry, Spilmann, Tng (STOC 2011) Kurt Mhlhorn Max Planck Institut for Informatics and Saarland Univrsity Sptmbr 28, 2011

2 Th Rsult High-Lvl Viw Small Obsrvations Th Subroutins Improvmnt Th Rsult G = (V, E) undirctd graph, s sourc, t sink. u : E R 0, dg capacitis ɛ > 0 Can comput (1 ɛ)-approximat maximum flow in tim Õ(mn1/3 ɛ 11/3 ). approximat minimum cut in similar tim bound prvious bst: Õ(m nɛ 1 ) by Goldbrg and Rao (98) uss lctrical flows Kurt Mhlhorn 2/16

3 Th Rsult High-Lvl Viw Small Obsrvations Th Subroutins Improvmnt Convrsion to Intgral Capacitis B = max P is s-t path min P u max bottlnck path in tim O(m + n log n) B max flow mb. rplac u by min(u, mb). rmoving all dgs of capacity lss than ɛb/(2m) changs max-flow by at most ɛb/2. rplac u by u ɛb/2m intgral capacitis in [1, 2m 2 /ɛ] Kurt Mhlhorn 3/16

4 Th Rsult High-Lvl Viw Small Obsrvations Th Subroutins Improvmnt A High-Lvl Viw of th Algorithm F = valu of maximum flow. Do binary sarch on [1, 2m 2 /ɛ]. Lt F b th currnt valu of th sarch. Hav a subroutin Flow(F) which ithr finds a flow of valu F that almost satisfis th capacity constraints or fails. if F F, it is guarantd to rturn a flow. Subroutin is ralizd via a low-lvl subroutin flow(f, w), which w discuss first. Hr, w is a wight function on th dgs. Kurt Mhlhorn 4/16

5 Th Rsult High-Lvl Viw Small Obsrvations Th Subroutins Improvmnt Elctrical Flows and Capacitis Rsistancs can simulat capacitis Lt Q b a maximum flow. Orint dgs in th dirction of th flow, sort th graph topologically, and st For = (u, v), st p v = numbr of nods aftr v in ordring. Thn Q is th rsulting flow. R = Q /. Kurt Mhlhorn 5/16

6 Th Rsult High-Lvl Viw Small Obsrvations Th Subroutins Improvmnt An Obsrvation St R = 1/u 2 and lt F F. Lt Q b an lctrical flow of valu F. Thn (Q /u ) 2 = R Q 2 R (Q) 2 = (Q/u ) 2 m. Dfin th congstion of as cong := Q /u. Thn, 1 m cong 2 1 and max cong m. Kurt Mhlhorn 6/16

7 Th Rsult High-Lvl Viw Small Obsrvations Th Subroutins Improvmnt Th Subroutin flow(f, w) 1. St R = (w + ɛw /m)/u 2, whr W = w. 2. Lt Q b an lctrical flow of valu F. 3. If R Q 2 > (1 + ɛ)w dclar failur. 4. rturn Q. Proprtis If F F, flow dos not fail If flow succds, w W cong 1 + ɛ and max cong ρ := (1 + ɛ)m. ɛ Kurt Mhlhorn 7/16

8 Th Rsult High-Lvl Viw Small Obsrvations Th Subroutins Improvmnt Proof St R = (w + ɛw /m)/u 2, whr W = w. Lt Q b an lctrical flow of valu F. If F F thn R Q 2 R (Q ) 2 = (w + ɛw ( ) Q 2 m ) (1 + ɛ)w. u If thn (w + ɛw m ) ( Q u w W cong2 ) 2 = R Q 2 (1 + ɛ)w 1 + ɛ and max cong (1 + ɛ)m. ɛ Kurt Mhlhorn 8/16

9 Th Rsult High-Lvl Viw Small Obsrvations Th Subroutins Improvmnt From avrag squard congstion to avrag congstion w cong = w 1/2 w 1/2 cong ( ) 1/2 ( w w cong 2 ) 1/2 W 1/2 ((1 + ɛ)w ) 1/2 (1 + ɛ)w. Kurt Mhlhorn 9/16

10 Th Rsult High-Lvl Viw Small Obsrvations Th Subroutins Improvmnt From flow to Flow Flow(F) st w (1) = 1 for all ; for i = 1 T do {T = O(m 1/2 ɛ 5/2 suffics} Q (i) = flow(f, w); {if call fails, fail} = Q (i) /u for all = w (i) (1 + ɛcong (i) /ρ) for all ; cong (i) w (i+1) nd for rturn Q := 1 T 1 i T Q (i) Kurt Mhlhorn 10/16

11 Th Rsult High-Lvl Viw Small Obsrvations Th Subroutins Improvmnt Proprtis of Flow Q is a flow of valu F and if F F, Q xists. Q = 1 T 1 i T Q (i) = 1 T 1 i T u cong (i) = u cong W (i+1) = w (i) (1 + ɛcong (i) /ρ) (1 + ɛ(1 + ɛ)/ρ)w (i) W (T +1) xp(((1 + ɛ)ɛ/ρ)t ) m Kurt Mhlhorn 11/16

12 Th Rsult High-Lvl Viw Small Obsrvations Th Subroutins Improvmnt Proprtis of Flow w (i+1) = w (i) (1 + ɛcong (i) /ρ) w (i) xp((1 ɛ)ɛcong (i) /ρ) (T +1) w xp((1 ɛ)ɛcong /ρ)t ) cong ((1 ɛ)ɛcong /ρ)t ln m + (ɛ(1 + ɛ)/ρ)t ρ ln m (1 ɛ)ɛt ɛ 1 ɛ ɛ (1 ɛ) ɛ 1 ɛ 1 + 4ɛ for T = (ρ ln m)/ɛ 2 = Õ(m1/2 ɛ 5/2 ) Kurt Mhlhorn 12/16

13 Th Rsult High-Lvl Viw Small Obsrvations Th Subroutins Improvmnt Putting it togthr Õ(m 1/2 ɛ 5/2 ) itrations suffic. In ach itration w nd to solv a SSD systm and do linar xtra work. Thus an itration runs in tim Õ(m log 1/ɛ). Total running tim is Õ(m3/2 ɛ 5/2 ). But, I promisd Õ(mn1/3 ɛ 11/3 ). This is rachd in two stps: stp on rducs to Õ(m4/3 ɛ 3 ), and stp two rducs to Õ(mn1/3 ɛ 11/3 ). (Kargr (98) and Bncur/Kargr (02)) Kurt Mhlhorn 13/16

14 Th Rsult High-Lvl Viw Small Obsrvations Th Subroutins Improvmnt Th First Stp Lt H b a hug numbr; actually H = (m ln m) 1/3 /ɛ. What dos cong H imply? Q /u H and hnc u Q /H F/H. Thus u is tiny. W can afford to dlt ɛh dgs with hug congstion without sacrificing th approximation guarant. Modification of flow: if flow succds, i.., E(Q) (1 + ɛ)w, and thr is an dg with hug congstion, dlt th dg and continu without th dg. Obsrv, that chang allows us to rplac ρ by H in th analysis. Kurt Mhlhorn 14/16

15 Th Rsult High-Lvl Viw Small Obsrvations Th Subroutins Improvmnt Dlting Hug Edgs If flow succds, w hav E(Q) (1 + ɛ)w. If has hug congstion, r Q 2 ɛw m ( Q u ) 2 ɛh2 ɛh2 (1 + ɛ)w (1 + ɛ)m (1 + ɛ)m E(Q). Lt β = ɛh 2 /((1 + ɛ)m). If has hug congstion, accounts for a β fraction of th nrgy of th flow. Dltion of a hug dg forcs th nrgy of th flow to incras by a factor 1/(1 β). W hav an uppr bound on th final nrgy, namly (1 + ɛ)w (T +1). It is not too hard, to driv a lowr bound on th nrgy of th first flow. Putting things togthr, w obtain a bound on th numbr of hug dgs. Kurt Mhlhorn 15/16

16 Th Rsult High-Lvl Viw Small Obsrvations Th Subroutins Improvmnt Dlting a Hug Edg II Dltion of a hug dg incrass th nrgy of th flow by a factor 1/(1 β). Lt p b th lctrical potntials for flow of valu 1/R ff. Thn p s = 1 and p t = 0. Enrgy of this flow is qual to 1/R ff. 1 R ff = inf q; q s=1 q t =0 = uv E uv E\ (p u p v ) 2 (q u q v ) 2 r uv uv E\ (p u p v ) 2 r uv r uv 2 /r (1 β) 1 R ff Thus, E(Q ) = F 2 R ff 1 1 β F 2 R ff = E(Q). Kurt Mhlhorn 16/16

1 Solving Flow Problems using Multiplicative Weights

1 Solving Flow Problems using Multiplicative Weights 15-850: Advancd Algorithms CMU, Spring 2017 Lctur #13: Max Flow using Elctrical Flow Fbruary 22, 2017 Lcturr: Anupam Gupta Scrib: Jnnifr Iglsias, Xu An Chuang In today s lctur w will us lctrical flows

More information

Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs

Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs Elctrical Flows, Laplacian Systms, and Fastr Approximation of Maximum Flow in Undirctd Graphs Paul Christiano MIT Jonathan A. Klnr MIT Alksandr Mądry EPFL Shang-Hua Tng Univrsity of Southrn California

More information

Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs

Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs Elctrical Flows, Laplacian Systms, and Fastr Approximation of Maximum Flow in Undirctd Graphs Paul Christiano Mathmatics MIT paulfchristiano@gmail.com Danil A. Spilman Computr Scinc Yal Univrsity spilman@cs.yal.du

More information

Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs

Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs Elctrical Flows, Laplacian Systms, and Fastr Approximation of Maximum Flow in Undirctd Graphs Paul Christiano MIT Jonathan A. Klnr MIT Alksandr Mądry MIT Shang-Hua Tng Univrsity of Southrn California Octobr

More information

Exam 1. It is important that you clearly show your work and mark the final answer clearly, closed book, closed notes, no calculator.

Exam 1. It is important that you clearly show your work and mark the final answer clearly, closed book, closed notes, no calculator. Exam N a m : _ S O L U T I O N P U I D : I n s t r u c t i o n s : It is important that you clarly show your work and mark th final answr clarly, closd book, closd nots, no calculator. T i m : h o u r

More information

arxiv: v3 [cs.ds] 14 Jul 2016

arxiv: v3 [cs.ds] 14 Jul 2016 Ngativ-Wight Shortst Paths and Unit Capacity Minimum Cost Flow in Õ m 0/7 log W Tim Michal B. Cohn Alksandr Mądry Piotr Sankowski Adrian Vladu MIT MIT Univrsity of Warsaw MIT micohn@mit.du madry@mit.du

More information

Supplementary Materials

Supplementary Materials 6 Supplmntary Matrials APPENDIX A PHYSICAL INTERPRETATION OF FUEL-RATE-SPEED FUNCTION A truck running on a road with grad/slop θ positiv if moving up and ngativ if moving down facs thr rsistancs: arodynamic

More information

Introduction to Condensed Matter Physics

Introduction to Condensed Matter Physics Introduction to Condnsd Mattr Physics pcific hat M.P. Vaughan Ovrviw Ovrviw of spcific hat Hat capacity Dulong-Ptit Law Einstin modl Dby modl h Hat Capacity Hat capacity h hat capacity of a systm hld at

More information

Brief Introduction to Statistical Mechanics

Brief Introduction to Statistical Mechanics Brif Introduction to Statistical Mchanics. Purpos: Ths nots ar intndd to provid a vry quick introduction to Statistical Mchanics. Th fild is of cours far mor vast than could b containd in ths fw pags.

More information

Strongly Connected Components

Strongly Connected Components Strongly Connctd Componnts Lt G = (V, E) b a dirctd graph Writ if thr is a path from to in G Writ if and is an quivalnc rlation: implis and implis s quivalnc classs ar calld th strongly connctd componnts

More information

Homework #3. 1 x. dx. It therefore follows that a sum of the

Homework #3. 1 x. dx. It therefore follows that a sum of the Danil Cannon CS 62 / Luan March 5, 2009 Homwork # 1. Th natural logarithm is dfind by ln n = n 1 dx. It thrfor follows that a sum of th 1 x sam addnd ovr th sam intrval should b both asymptotically uppr-

More information

Examples and applications on SSSP and MST

Examples and applications on SSSP and MST Exampls an applications on SSSP an MST Dan (Doris) H & Junhao Gan ITEE Univrsity of Qunslan COMP3506/7505, Uni of Qunslan Exampls an applications on SSSP an MST Dijkstra s Algorithm Th algorithm solvs

More information

Searching Linked Lists. Perfect Skip List. Building a Skip List. Skip List Analysis (1) Assume the list is sorted, but is stored in a linked list.

Searching Linked Lists. Perfect Skip List. Building a Skip List. Skip List Analysis (1) Assume the list is sorted, but is stored in a linked list. 3 3 4 8 6 3 3 4 8 6 3 3 4 8 6 () (d) 3 Sarching Linkd Lists Sarching Linkd Lists Sarching Linkd Lists ssum th list is sortd, but is stord in a linkd list. an w us binary sarch? omparisons? Work? What if

More information

Week 3: Connected Subgraphs

Week 3: Connected Subgraphs Wk 3: Connctd Subgraphs Sptmbr 19, 2016 1 Connctd Graphs Path, Distanc: A path from a vrtx x to a vrtx y in a graph G is rfrrd to an xy-path. Lt X, Y V (G). An (X, Y )-path is an xy-path with x X and y

More information

Basic Polyhedral theory

Basic Polyhedral theory Basic Polyhdral thory Th st P = { A b} is calld a polyhdron. Lmma 1. Eithr th systm A = b, b 0, 0 has a solution or thr is a vctorπ such that π A 0, πb < 0 Thr cass, if solution in top row dos not ist

More information

1 Minimum Cut Problem

1 Minimum Cut Problem CS 6 Lctur 6 Min Cut and argr s Algorithm Scribs: Png Hui How (05), Virginia Dat: May 4, 06 Minimum Cut Problm Today, w introduc th minimum cut problm. This problm has many motivations, on of which coms

More information

Navigating Central Path with Electrical Flows: from Flows to Matchings, and Back

Navigating Central Path with Electrical Flows: from Flows to Matchings, and Back Navigating Cntral Path with Elctrical Flows: from Flows to Matchings, and Back Alksandr Mądry EPFL alksandr.madry@pfl.ch Abstract 10 W prsnt an Õ(m 7 ) = Õ(m1.43 )-tim 1 algorithm for th maximum s-t flow

More information

The Matrix Exponential

The Matrix Exponential Th Matrix Exponntial (with xrciss) by D. Klain Vrsion 207.0.05 Corrctions and commnts ar wlcom. Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix A A k I + A + k!

More information

cycle that does not cross any edges (including its own), then it has at least

cycle that does not cross any edges (including its own), then it has at least W prov th following thorm: Thorm If a K n is drawn in th plan in such a way that it has a hamiltonian cycl that dos not cross any dgs (including its own, thn it has at last n ( 4 48 π + O(n crossings Th

More information

Math 34A. Final Review

Math 34A. Final Review Math A Final Rviw 1) Us th graph of y10 to find approimat valus: a) 50 0. b) y (0.65) solution for part a) first writ an quation: 50 0. now tak th logarithm of both sids: log() log(50 0. ) pand th right

More information

The Matrix Exponential

The Matrix Exponential Th Matrix Exponntial (with xrciss) by Dan Klain Vrsion 28928 Corrctions and commnts ar wlcom Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix () A A k I + A + k!

More information

The Equitable Dominating Graph

The Equitable Dominating Graph Intrnational Journal of Enginring Rsarch and Tchnology. ISSN 0974-3154 Volum 8, Numbr 1 (015), pp. 35-4 Intrnational Rsarch Publication Hous http://www.irphous.com Th Equitabl Dominating Graph P.N. Vinay

More information

The University of Alabama in Huntsville Electrical and Computer Engineering Homework #4 Solution CPE Spring 2008

The University of Alabama in Huntsville Electrical and Computer Engineering Homework #4 Solution CPE Spring 2008 Th Univrsity of Alabama in Huntsvill Elctrical and Comutr Enginring Homwork # Solution CE 6 Sring 8 Chatr : roblms ( oints, ( oints, ( oints, 8( oints, ( oints. You hav a RAID systm whr failurs occur at

More information

10. The Discrete-Time Fourier Transform (DTFT)

10. The Discrete-Time Fourier Transform (DTFT) Th Discrt-Tim Fourir Transform (DTFT Dfinition of th discrt-tim Fourir transform Th Fourir rprsntation of signals plays an important rol in both continuous and discrt signal procssing In this sction w

More information

A Propagating Wave Packet Group Velocity Dispersion

A Propagating Wave Packet Group Velocity Dispersion Lctur 8 Phys 375 A Propagating Wav Packt Group Vlocity Disprsion Ovrviw and Motivation: In th last lctur w lookd at a localizd solution t) to th 1D fr-particl Schrödingr quation (SE) that corrsponds to

More information

Chapter 8: Electron Configurations and Periodicity

Chapter 8: Electron Configurations and Periodicity Elctron Spin & th Pauli Exclusion Principl Chaptr 8: Elctron Configurations and Priodicity 3 quantum numbrs (n, l, ml) dfin th nrgy, siz, shap, and spatial orintation of ach atomic orbital. To xplain how

More information

High Energy Physics. Lecture 5 The Passage of Particles through Matter

High Energy Physics. Lecture 5 The Passage of Particles through Matter High Enrgy Physics Lctur 5 Th Passag of Particls through Mattr 1 Introduction In prvious lcturs w hav sn xampls of tracks lft by chargd particls in passing through mattr. Such tracks provid som of th most

More information

Part 7: Capacitance And Capacitors

Part 7: Capacitance And Capacitors Part 7: apacitanc And apacitors 7. Elctric harg And Elctric Filds onsidr a pair of flat, conducting plats, arrangd paralll to ach othr (as in figur 7.) and sparatd by an insulator, which may simply b air.

More information

Coupled Pendulums. Two normal modes.

Coupled Pendulums. Two normal modes. Tim Dpndnt Two Stat Problm Coupld Pndulums Wak spring Two normal mods. No friction. No air rsistanc. Prfct Spring Start Swinging Som tim latr - swings with full amplitud. stationary M +n L M +m Elctron

More information

Computing and Communications -- Network Coding

Computing and Communications -- Network Coding 89 90 98 00 Computing and Communications -- Ntwork Coding Dr. Zhiyong Chn Institut of Wirlss Communications Tchnology Shanghai Jiao Tong Univrsity China Lctur 5- Nov. 05 0 Classical Information Thory Sourc

More information

ELECTRON-MUON SCATTERING

ELECTRON-MUON SCATTERING ELECTRON-MUON SCATTERING ABSTRACT Th lctron charg is considrd to b distributd or xtndd in spac. Th diffrntial of th lctron charg is st qual to a function of lctron charg coordinats multiplid by a four-dimnsional

More information

LINEAR DELAY DIFFERENTIAL EQUATION WITH A POSITIVE AND A NEGATIVE TERM

LINEAR DELAY DIFFERENTIAL EQUATION WITH A POSITIVE AND A NEGATIVE TERM Elctronic Journal of Diffrntial Equations, Vol. 2003(2003), No. 92, pp. 1 6. ISSN: 1072-6691. URL: http://jd.math.swt.du or http://jd.math.unt.du ftp jd.math.swt.du (login: ftp) LINEAR DELAY DIFFERENTIAL

More information

Why is a E&M nature of light not sufficient to explain experiments?

Why is a E&M nature of light not sufficient to explain experiments? 1 Th wird world of photons Why is a E&M natur of light not sufficint to xplain xprimnts? Do photons xist? Som quantum proprtis of photons 2 Black body radiation Stfan s law: Enrgy/ ara/ tim = Win s displacmnt

More information

Preliminary Fundamentals

Preliminary Fundamentals 1.0 Introduction Prliminary Fundamntals In all of our prvious work, w assumd a vry simpl modl of th lctromagntic torqu T (or powr) that is rquird in th swing quation to obtain th acclrating torqu. This

More information

First order differential equation Linear equation; Method of integrating factors

First order differential equation Linear equation; Method of integrating factors First orr iffrntial quation Linar quation; Mtho of intgrating factors Exampl 1: Rwrit th lft han si as th rivativ of th prouct of y an som function by prouct rul irctly. Solving th first orr iffrntial

More information

Note If the candidate believes that e x = 0 solves to x = 0 or gives an extra solution of x = 0, then withhold the final accuracy mark.

Note If the candidate believes that e x = 0 solves to x = 0 or gives an extra solution of x = 0, then withhold the final accuracy mark. . (a) Eithr y = or ( 0, ) (b) Whn =, y = ( 0 + ) = 0 = 0 ( + ) = 0 ( )( ) = 0 Eithr = (for possibly abov) or = A 3. Not If th candidat blivs that = 0 solvs to = 0 or givs an tra solution of = 0, thn withhold

More information

INC 693, 481 Dynamics System and Modelling: The Language of Bound Graphs Dr.-Ing. Sudchai Boonto Assistant Professor

INC 693, 481 Dynamics System and Modelling: The Language of Bound Graphs Dr.-Ing. Sudchai Boonto Assistant Professor INC 693, 48 Dynamics Systm and Modlling: Th Languag o Bound Graphs Dr.-Ing. Sudchai Boonto Assistant Prossor Dpartmnt o Control Systm and Instrumntation Enginring King Mongkut s Unnivrsity o Tchnology

More information

10. EXTENDING TRACTABILITY

10. EXTENDING TRACTABILITY Coping with NP-compltnss 0. EXTENDING TRACTABILITY ining small vrtx covrs solving NP-har problms on trs circular arc covrings vrtx covr in bipartit graphs Q. Suppos I n to solv an NP-complt problm. What

More information

CE 530 Molecular Simulation

CE 530 Molecular Simulation CE 53 Molcular Simulation Lctur 8 Fr-nrgy calculations David A. Kofk Dpartmnt of Chmical Enginring SUNY Buffalo kofk@ng.buffalo.du 2 Fr-Enrgy Calculations Uss of fr nrgy Phas quilibria Raction quilibria

More information

Finding low cost TSP and 2-matching solutions using certain half integer subtour vertices

Finding low cost TSP and 2-matching solutions using certain half integer subtour vertices Finding low cost TSP and 2-matching solutions using crtain half intgr subtour vrtics Sylvia Boyd and Robrt Carr Novmbr 996 Introduction Givn th complt graph K n = (V, E) on n nods with dg costs c R E,

More information

Search sequence databases 3 10/25/2016

Search sequence databases 3 10/25/2016 Sarch squnc databass 3 10/25/2016 Etrm valu distribution Ø Suppos X is a random variabl with probability dnsity function p(, w sampl a larg numbr S of indpndnt valus of X from this distribution for an

More information

Mathematics. Complex Number rectangular form. Quadratic equation. Quadratic equation. Complex number Functions: sinusoids. Differentiation Integration

Mathematics. Complex Number rectangular form. Quadratic equation. Quadratic equation. Complex number Functions: sinusoids. Differentiation Integration Mathmatics Compl numbr Functions: sinusoids Sin function, cosin function Diffrntiation Intgration Quadratic quation Quadratic quations: a b c 0 Solution: b b 4ac a Eampl: 1 0 a= b=- c=1 4 1 1or 1 1 Quadratic

More information

priority queue ADT heaps 1

priority queue ADT heaps 1 COMP 250 Lctur 23 priority quu ADT haps 1 Nov. 1/2, 2017 1 Priority Quu Li a quu, but now w hav a mor gnral dinition o which lmnt to rmov nxt, namly th on with highst priority..g. hospital mrgncy room

More information

Electrical Energy and Capacitance

Electrical Energy and Capacitance haptr 6 Elctrical Enrgy and apacitanc Quick Quizzs. (b). Th fild xrts a forc on th lctron, causing it to acclrat in th dirction opposit to that of th fild. In this procss, lctrical potntial nrgy is convrtd

More information

2. Laser physics - basics

2. Laser physics - basics . Lasr physics - basics Spontanous and stimulatd procsss Einstin A and B cofficints Rat quation analysis Gain saturation What is a lasr? LASER: Light Amplification by Stimulatd Emission of Radiation "light"

More information

The pn junction: 2 Current vs Voltage (IV) characteristics

The pn junction: 2 Current vs Voltage (IV) characteristics Th pn junction: Currnt vs Voltag (V) charactristics Considr a pn junction in quilibrium with no applid xtrnal voltag: o th V E F E F V p-typ Dpltion rgion n-typ Elctron movmnt across th junction: 1. n

More information

Final Exam Solutions

Final Exam Solutions CS 2 Advancd Data Structurs and Algorithms Final Exam Solutions Jonathan Turnr /8/20. (0 points) Suppos that r is a root of som tr in a Fionacci hap. Assum that just for a dltmin opration, r has no childrn

More information

Random Access Techniques: ALOHA (cont.)

Random Access Techniques: ALOHA (cont.) Random Accss Tchniqus: ALOHA (cont.) 1 Exampl [ Aloha avoiding collision ] A pur ALOHA ntwork transmits a 200-bit fram on a shard channl Of 200 kbps at tim. What is th rquirmnt to mak this fram collision

More information

Vishnu V. Narayan. January

Vishnu V. Narayan. January A 17 12 -approimation algorithm for 2-rt-connctd spanning subgraphs on graphs with minimum dgr at last arxi:1612.047902 [cs.ds] 17 Jan 2017 Vishnu V. Naraan Januar 17 2017 W obtain a polnomial-tim 17 -approimation

More information

Maxwellian Collisions

Maxwellian Collisions Maxwllian Collisions Maxwll ralizd arly on that th particular typ of collision in which th cross-sction varis at Q rs 1/g offrs drastic siplifications. Intrstingly, this bhavior is physically corrct for

More information

The graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the

The graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the Copyright itutcom 005 Fr download & print from wwwitutcom Do not rproduc by othr mans Functions and graphs Powr functions Th graph of n y, for n Q (st of rational numbrs) y is a straight lin through th

More information

2. Background Material

2. Background Material S. Blair Sptmbr 3, 003 4. Background Matrial Th rst of this cours dals with th gnration, modulation, propagation, and ction of optical radiation. As such, bic background in lctromagntics and optics nds

More information

4.5 Minimum Spanning Tree. Chapter 4. Greedy Algorithms. Minimum Spanning Tree. Motivating application

4.5 Minimum Spanning Tree. Chapter 4. Greedy Algorithms. Minimum Spanning Tree. Motivating application 1 Chaptr. Minimum panning Tr lids by Kvin Wayn. Copyright 200 Parson-Addison Wsly. All rights rsrvd. *Adjustd by Gang Tan for C33: Algorithms at Boston Collg, Fall 0 Motivating application Minimum panning

More information

Last time. Resistors. Circuits. Question. Quick Quiz. Quick Quiz. ( V c. Which bulb is brighter? A. A B. B. C. Both the same

Last time. Resistors. Circuits. Question. Quick Quiz. Quick Quiz. ( V c. Which bulb is brighter? A. A B. B. C. Both the same Last tim Bgin circuits Rsistors Circuits Today Rsistor circuits Start rsistor-capacitor circuits Physical layout Schmatic layout Tu. Oct. 13, 2009 Physics 208 Lctur 12 1 Tu. Oct. 13, 2009 Physics 208 Lctur

More information

On spanning trees and cycles of multicolored point sets with few intersections

On spanning trees and cycles of multicolored point sets with few intersections On spanning trs and cycls of multicolord point sts with fw intrsctions M. Kano, C. Mrino, and J. Urrutia April, 00 Abstract Lt P 1,..., P k b a collction of disjoint point sts in R in gnral position. W

More information

Recall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1

Recall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1 Chaptr 11 Th singular sris Rcall that by Thorms 10 and 104 togthr provid us th stimat 9 4 n 2 111 Rn = SnΓ 2 + on2, whr th singular sris Sn was dfind in Chaptr 10 as Sn = q=1 Sq q 9, with Sq = 1 a q gcda,q=1

More information

22/ Breakdown of the Born-Oppenheimer approximation. Selection rules for rotational-vibrational transitions. P, R branches.

22/ Breakdown of the Born-Oppenheimer approximation. Selection rules for rotational-vibrational transitions. P, R branches. Subjct Chmistry Papr No and Titl Modul No and Titl Modul Tag 8/ Physical Spctroscopy / Brakdown of th Born-Oppnhimr approximation. Slction ruls for rotational-vibrational transitions. P, R branchs. CHE_P8_M

More information

Gradient Descent and Non-Linear Iterative Methods

Gradient Descent and Non-Linear Iterative Methods CS7540 Spctral Algorithms, Spring 207 Lctur #25 #28 Gradint Dscnt and Non-Linar Itrativ Mthods Prsntr: Richard Png Apr &3&8&20, 207 DISCLAIMER: Ths nots ar not ncssarily an accurat rprsntation of what

More information

(Upside-Down o Direct Rotation) β - Numbers

(Upside-Down o Direct Rotation) β - Numbers Amrican Journal of Mathmatics and Statistics 014, 4(): 58-64 DOI: 10593/jajms0140400 (Upsid-Down o Dirct Rotation) β - Numbrs Ammar Sddiq Mahmood 1, Shukriyah Sabir Ali,* 1 Dpartmnt of Mathmatics, Collg

More information

MCE503: Modeling and Simulation of Mechatronic Systems Discussion on Bond Graph Sign Conventions for Electrical Systems

MCE503: Modeling and Simulation of Mechatronic Systems Discussion on Bond Graph Sign Conventions for Electrical Systems MCE503: Modling and Simulation o Mchatronic Systms Discussion on Bond Graph Sign Convntions or Elctrical Systms Hanz ichtr, PhD Clvland Stat Univrsity, Dpt o Mchanical Enginring 1 Basic Assumption In a

More information

From Elimination to Belief Propagation

From Elimination to Belief Propagation School of omputr Scinc Th lif Propagation (Sum-Product lgorithm Probabilistic Graphical Modls (10-708 Lctur 5, Sp 31, 2007 Rcptor Kinas Rcptor Kinas Kinas X 5 ric Xing Gn G T X 6 X 7 Gn H X 8 Rading: J-hap

More information

Constants and Conversions:

Constants and Conversions: EXAM INFORMATION Radial Distribution Function: P 2 ( r) RDF( r) Br R( r ) 2, B is th normalization constant. Ordr of Orbital Enrgis: Homonuclar Diatomic Molculs * * * * g1s u1s g 2s u 2s u 2 p g 2 p g

More information

International Journal of Foundations of Computer Science c World Scientic Publishing Company Searching a Pseudo 3-Sided Solid Orthoconvex Grid ANTONIO

International Journal of Foundations of Computer Science c World Scientic Publishing Company Searching a Pseudo 3-Sided Solid Orthoconvex Grid ANTONIO Intrnational Journal of Foundations of Computr Scinc c World Scintic Publishing Company Sarching a Psudo 3-Sidd Solid Orthoconvx Grid ANTONIOS SYMVONIS Bassr Dpartmnt of Computr Scinc, Univrsity of Sydny

More information

AS 5850 Finite Element Analysis

AS 5850 Finite Element Analysis AS 5850 Finit Elmnt Analysis Two-Dimnsional Linar Elasticity Instructor Prof. IIT Madras Equations of Plan Elasticity - 1 displacmnt fild strain- displacmnt rlations (infinitsimal strain) in matrix form

More information

There is an arbitrary overall complex phase that could be added to A, but since this makes no difference we set it to zero and choose A real.

There is an arbitrary overall complex phase that could be added to A, but since this makes no difference we set it to zero and choose A real. Midtrm #, Physics 37A, Spring 07. Writ your rsponss blow or on xtra pags. Show your work, and tak car to xplain what you ar doing; partial crdit will b givn for incomplt answrs that dmonstrat som concptual

More information

CPE702 Algorithm Analysis and Design Week 11 String Processing

CPE702 Algorithm Analysis and Design Week 11 String Processing CPE702 Agorithm Anaysis and Dsign Wk 11 String Procssing Prut Boonma prut@ng.cmu.ac.th Dpartmnt of Computr Enginring Facuty of Enginring, Chiang Mai Univrsity Basd on Sids by M.T. Goodrich and R. Tamassia

More information

Limiting value of higher Mahler measure

Limiting value of higher Mahler measure Limiting valu of highr Mahlr masur Arunabha Biswas a, Chris Monico a, a Dpartmnt of Mathmatics & Statistics, Txas Tch Univrsity, Lubbock, TX 7949, USA Abstract W considr th k-highr Mahlr masur m k P )

More information

BETA DECAY VISUAL PHYSICS ONLINE

BETA DECAY VISUAL PHYSICS ONLINE VISUAL PHYSICS ONLINE BETA DECAY Suppos now that a nuclus xists which has ithr too many or too fw nutrons rlativ to th numbr of protons prsnt for stability. Stability can b achivd by th convrsion insid

More information

Estimation of apparent fraction defective: A mathematical approach

Estimation of apparent fraction defective: A mathematical approach Availabl onlin at www.plagiarsarchlibrary.com Plagia Rsarch Library Advancs in Applid Scinc Rsarch, 011, (): 84-89 ISSN: 0976-8610 CODEN (USA): AASRFC Estimation of apparnt fraction dfctiv: A mathmatical

More information

Elements of Statistical Thermodynamics

Elements of Statistical Thermodynamics 24 Elmnts of Statistical Thrmodynamics Statistical thrmodynamics is a branch of knowldg that has its own postulats and tchniqus. W do not attmpt to giv hr vn an introduction to th fild. In this chaptr,

More information

EEO 401 Digital Signal Processing Prof. Mark Fowler

EEO 401 Digital Signal Processing Prof. Mark Fowler EEO 401 Digital Signal Procssing Prof. Mark Fowlr Dtails of th ot St #19 Rading Assignmnt: Sct. 7.1.2, 7.1.3, & 7.2 of Proakis & Manolakis Dfinition of th So Givn signal data points x[n] for n = 0,, -1

More information

DISTRIBUTION OF DIFFERENCE BETWEEN INVERSES OF CONSECUTIVE INTEGERS MODULO P

DISTRIBUTION OF DIFFERENCE BETWEEN INVERSES OF CONSECUTIVE INTEGERS MODULO P DISTRIBUTION OF DIFFERENCE BETWEEN INVERSES OF CONSECUTIVE INTEGERS MODULO P Tsz Ho Chan Dartmnt of Mathmatics, Cas Wstrn Rsrv Univrsity, Clvland, OH 4406, USA txc50@cwru.du Rcivd: /9/03, Rvisd: /9/04,

More information

1997 AP Calculus AB: Section I, Part A

1997 AP Calculus AB: Section I, Part A 997 AP Calculus AB: Sction I, Part A 50 Minuts No Calculator Not: Unlss othrwis spcifid, th domain of a function f is assumd to b th st of all ral numbrs x for which f (x) is a ral numbr.. (4x 6 x) dx=

More information

Multipath Routing Algorithms for Congestion Minimization

Multipath Routing Algorithms for Congestion Minimization Multipath Routing Algorithms for Congstion Minimization Ron Bannr and Aril Orda Dpartmnt of Elctrical Enginring, Tchnion Isral Institut of Tchnology, Haifa 32000, Isral bannr@tx.tchnion.ac.il aril@c.tchnion.ac.il

More information

Electromagnetism Physics 15b

Electromagnetism Physics 15b lctromagntism Physics 15b Lctur #8 lctric Currnts Purcll 4.1 4.3 Today s Goals Dfin lctric currnt I Rat of lctric charg flow Also dfin lctric currnt dnsity J Charg consrvation in a formula Ohm s Law vryon

More information

Background: We have discussed the PIB, HO, and the energy of the RR model. In this chapter, the H-atom, and atomic orbitals.

Background: We have discussed the PIB, HO, and the energy of the RR model. In this chapter, the H-atom, and atomic orbitals. Chaptr 7 Th Hydrogn Atom Background: W hav discussd th PIB HO and th nrgy of th RR modl. In this chaptr th H-atom and atomic orbitals. * A singl particl moving undr a cntral forc adoptd from Scott Kirby

More information

Network Congestion Games

Network Congestion Games Ntwork Congstion Gams Assistant Profssor Tas A&M Univrsity Collg Station, TX TX Dallas Collg Station Austin Houston Bst rout dpnds on othrs Ntwork Congstion Gams Travl tim incrass with congstion Highway

More information

University of Illinois at Chicago Department of Physics. Thermodynamics & Statistical Mechanics Qualifying Examination

University of Illinois at Chicago Department of Physics. Thermodynamics & Statistical Mechanics Qualifying Examination Univrsity of Illinois at Chicago Dpartmnt of hysics hrmodynamics & tatistical Mchanics Qualifying Eamination January 9, 009 9.00 am 1:00 pm Full crdit can b achivd from compltly corrct answrs to 4 qustions.

More information

INTEGRATION BY PARTS

INTEGRATION BY PARTS Mathmatics Rvision Guids Intgration by Parts Pag of 7 MK HOME TUITION Mathmatics Rvision Guids Lvl: AS / A Lvl AQA : C Edcl: C OCR: C OCR MEI: C INTEGRATION BY PARTS Vrsion : Dat: --5 Eampls - 6 ar copyrightd

More information

Transit route and frequency design: Bi-level modeling and hybrid artificial bee colony algorithm approach

Transit route and frequency design: Bi-level modeling and hybrid artificial bee colony algorithm approach Titl Transit rout and frquncy dsign: Bi-lvl modling and hybrid artificial b colony algorithm approach Author(s) Szto, WY; Jiang, Y Citation Transportation Rsarch Part B: Mthodological, 2014, v. 67, p.

More information

The second condition says that a node α of the tree has exactly n children if the arity of its label is n.

The second condition says that a node α of the tree has exactly n children if the arity of its label is n. CS 6110 S14 Hanout 2 Proof of Conflunc 27 January 2014 In this supplmntary lctur w prov that th λ-calculus is conflunt. This is rsult is u to lonzo Church (1903 1995) an J. arkly Rossr (1907 1989) an is

More information

1973 AP Calculus AB: Section I

1973 AP Calculus AB: Section I 97 AP Calculus AB: Sction I 9 Minuts No Calculator Not: In this amination, ln dnots th natural logarithm of (that is, logarithm to th bas ).. ( ) d= + C 6 + C + C + C + C. If f ( ) = + + + and ( ), g=

More information

MCB137: Physical Biology of the Cell Spring 2017 Homework 6: Ligand binding and the MWC model of allostery (Due 3/23/17)

MCB137: Physical Biology of the Cell Spring 2017 Homework 6: Ligand binding and the MWC model of allostery (Due 3/23/17) MCB37: Physical Biology of th Cll Spring 207 Homwork 6: Ligand binding and th MWC modl of allostry (Du 3/23/7) Hrnan G. Garcia March 2, 207 Simpl rprssion In class, w drivd a mathmatical modl of how simpl

More information

Derivation of Electron-Electron Interaction Terms in the Multi-Electron Hamiltonian

Derivation of Electron-Electron Interaction Terms in the Multi-Electron Hamiltonian Drivation of Elctron-Elctron Intraction Trms in th Multi-Elctron Hamiltonian Erica Smith Octobr 1, 010 1 Introduction Th Hamiltonian for a multi-lctron atom with n lctrons is drivd by Itoh (1965) by accounting

More information

Linked-List Implementation. Linked-lists for two sets. Multiple Operations. UNION Implementation. An Application of Disjoint-Set 1/9/2014

Linked-List Implementation. Linked-lists for two sets. Multiple Operations. UNION Implementation. An Application of Disjoint-Set 1/9/2014 Disjoint Sts Data Strutur (Chap. 21) A disjoint-st is a olltion ={S 1, S 2,, S k } o distint dynami sts. Eah st is idntiid by a mmbr o th st, alld rprsntativ. Disjoint st oprations: MAKE-SET(x): rat a

More information

u x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula

u x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula 7. Intgration by Parts Each drivativ formula givs ris to a corrsponding intgral formula, as w v sn many tims. Th drivativ product rul yilds a vry usful intgration tchniqu calld intgration by parts. Starting

More information

Sec 2.3 Modeling with First Order Equations

Sec 2.3 Modeling with First Order Equations Sc.3 Modling with First Ordr Equations Mathmatical modls charactriz physical systms, oftn using diffrntial quations. Modl Construction: Translating physical situation into mathmatical trms. Clarly stat

More information

Abstract Interpretation: concrete and abstract semantics

Abstract Interpretation: concrete and abstract semantics Abstract Intrprtation: concrt and abstract smantics Concrt smantics W considr a vry tiny languag that manags arithmtic oprations on intgrs valus. Th (concrt) smantics of th languags cab b dfind by th funzcion

More information

Learning Spherical Convolution for Fast Features from 360 Imagery

Learning Spherical Convolution for Fast Features from 360 Imagery Larning Sphrical Convolution for Fast Faturs from 36 Imagry Anonymous Author(s) 3 4 5 6 7 8 9 3 4 5 6 7 8 9 3 4 5 6 7 8 9 3 3 3 33 34 35 In this fil w provid additional dtails to supplmnt th main papr

More information

E hf. hf c. 2 2 h 2 2 m v f ' f 2f ' f cos c

E hf. hf c. 2 2 h 2 2 m v f ' f 2f ' f cos c EXPERIMENT 9: COMPTON EFFECT Rlatd Topics Intractions of photons with lctrons, consrvation of momntum and nrgy, inlastic and lastic scattring, intraction cross sction, Compton wavlngth. Principl Whn photons

More information

1 General boundary conditions in diffusion

1 General boundary conditions in diffusion Gnral boundary conditions in diffusion Πρόβλημα 4.8 : Δίνεται μονοδιάτατη πλάκα πάχους, που το ένα άκρο της κρατιέται ε θερμοκραία T t και το άλλο ε θερμοκραία T 2 t. Αν η αρχική θερμοκραία της πλάκας

More information

Difference -Analytical Method of The One-Dimensional Convection-Diffusion Equation

Difference -Analytical Method of The One-Dimensional Convection-Diffusion Equation Diffrnc -Analytical Mthod of Th On-Dimnsional Convction-Diffusion Equation Dalabav Umurdin Dpartmnt mathmatic modlling, Univrsity of orld Economy and Diplomacy, Uzbistan Abstract. An analytical diffrncing

More information

PHYS-333: Problem set #2 Solutions

PHYS-333: Problem set #2 Solutions PHYS-333: Problm st #2 Solutions Vrsion of March 5, 2016. 1. Visual binary 15 points): Ovr a priod of 10 yars, two stars sparatd by an angl of 1 arcsc ar obsrvd to mov through a full circl about a point

More information

Integration by Parts

Integration by Parts Intgration by Parts Intgration by parts is a tchniqu primarily for valuating intgrals whos intgrand is th product of two functions whr substitution dosn t work. For ampl, sin d or d. Th rul is: u ( ) v'(

More information

Title: Vibrational structure of electronic transition

Title: Vibrational structure of electronic transition Titl: Vibrational structur of lctronic transition Pag- Th band spctrum sn in th Ultra-Violt (UV) and visibl (VIS) rgions of th lctromagntic spctrum can not intrprtd as vibrational and rotational spctrum

More information

Problem Set 6 Solutions

Problem Set 6 Solutions 6.04/18.06J Mathmatics for Computr Scinc March 15, 005 Srini Dvadas and Eric Lhman Problm St 6 Solutions Du: Monday, March 8 at 9 PM in Room 3-044 Problm 1. Sammy th Shark is a financial srvic providr

More information

(1) Then we could wave our hands over this and it would become:

(1) Then we could wave our hands over this and it would become: MAT* K285 Spring 28 Anthony Bnoit 4/17/28 Wk 12: Laplac Tranform Rading: Kohlr & Johnon, Chaptr 5 to p. 35 HW: 5.1: 3, 7, 1*, 19 5.2: 1, 5*, 13*, 19, 45* 5.3: 1, 11*, 19 * Pla writ-up th problm natly and

More information

3 2x. 3x 2. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB

3 2x. 3x 2.   Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB Math B Intgration Rviw (Solutions) Do ths intgrals. Solutions ar postd at th wbsit blow. If you hav troubl with thm, sk hlp immdiatly! () 8 d () 5 d () d () sin d (5) d (6) cos d (7) d www.clas.ucsb.du/staff/vinc

More information

That is, we start with a general matrix: And end with a simpler matrix:

That is, we start with a general matrix: And end with a simpler matrix: DIAGON ALIZATION OF THE STR ESS TEN SOR INTRO DUCTIO N By th us of Cauchy s thorm w ar abl to rduc th numbr of strss componnts in th strss tnsor to only nin valus. An additional simplification of th strss

More information

Thus, because if either [G : H] or [H : K] is infinite, then [G : K] is infinite, then [G : K] = [G : H][H : K] for all infinite cases.

Thus, because if either [G : H] or [H : K] is infinite, then [G : K] is infinite, then [G : K] = [G : H][H : K] for all infinite cases. Homwork 5 M 373K Solutions Mark Lindbrg and Travis Schdlr 1. Prov that th ring Z/mZ (for m 0) is a fild if and only if m is prim. ( ) Proof by Contrapositiv: Hr, thr ar thr cass for m not prim. m 0: Whn

More information