2.4 Network flows. Many direct and indirect applications telecommunication transportation (public, freight, railway, air, ) logistics

Size: px
Start display at page:

Download "2.4 Network flows. Many direct and indirect applications telecommunication transportation (public, freight, railway, air, ) logistics"

Transcription

1 .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,...). Many direc and indirec applicaion elecommunicaion ranporaion (public, freigh, railway, air, ) logiic E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano

2 .4. Maximum flow problem Definiion: A nework i a direced and conneced graph G =(V, A) wih a ource V and a ink V wih, and a capaciy k ij 0 for each arc (i, j) A ()= + ()=Ø capaciy k ij of arc (i, j) E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano

3 A feaible flow x from o i a vecor x R m wih a componen x ij for each arc (i,j) A aifying he capaciy conrain 0 x ij k ij (i, j) A, 0,3 and he flow balance conrain in each, 0, inermediae node h V ( h, ) 0,3, Flow x of value φ= x ih x hj ( i, h) ( h) ( h, j) h) h V \{, } ( amoun enering in h = amoun exiing from h ) x j (, j) ( ) The value of flow x : φ wih + ()={ (, j) : (, j)a } E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 3

4 Given a nework and a feaible flow x, an arc (i, j) A i auraed x ij = k ij if empy x ij = 0, 0,3, 0, 0,3, empy auraed E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 4

5 Problem Given a nework G = (V, A) wih an ineger capaciy k ij for each arc (i,j) A, and node, V, deermine a feaible flow from o of maximum value. Obervaion: If here are many ource/ink wih a unique ype of produc : * * - (*)=Ø + (*)=Ø capaciy = availabiliy limi, if any capaciy = + E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 5

6 Linear programming model max φ.. x hj x ih ( h, j) ( h) ( i, h) ( h) φ if h = -φ if h = 0 oherwie amoun exiing from 0 x ij k ij (i,j) A x ij R, φ R where φ denoe he value of he feaible flow x E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 6

7 Definiion:.4. Cu, feaible flow and weak dualiy ) A cu eparaing from i δ(s) of G wih S V and V \S. Number of cu eparaing from? n- wih n= V ) Capaciy of he cu δ(s) induced by S: k ( S ) S ( i, j ) k ij ( S ) 3 3 capaciy k(s) = 7 E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 7

8 3) Given a feaible flow x from o and a cu δ(s) wih S and S, he value of he feaible flow x hrough he cu δ(s) i ( S) ( i, j) x ij x ( S ) ij ( i, j) ( S ) S,,3 0,,,3, φ(s) = = 3 Wih hi noaion he value of he flow x i φ({}). E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 8

9 Propery Given a feaible flow x from o, for each cu δ(s) eparaing from, we have φ(s) = φ({}). S Implied by he flow balance equaion v V\{, }. E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 9

10 Propery For each feaible flow x from o and each cu δ(s), wih S V, eparaing from, we have value of he flow φ(s) k(s) capaciy of he cu Proof Since φ(s) = k ij x ij ij ij ( i, j) ( S ) ( i, j) ( S ) ( i, j) ( S ) 0 x k = k(s) definiion of value of he flow hrough he cu δ(s) E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 0

11 Conequence: If φ(s) = k(s) for a ube S V wih S and S, hen x i a flow of maximum value and he cu δ(s) i of minimum capaciy. The propery φ(s) k(s) feaible flow x and cu δ(s) eparaing from, expree a weak dualiy relaionhip beween he wo problem: Primal problem: Given G = (V, A) wih ineger capaciie on he arc and, V, deermine a feaible flow of maximum value. Dual problem: Given G = (V, A) wih ineger capaciie on he arc and, V, deermine a cu (eparaing from ) of minimum capaciy. We hall ee ha uch a relaionhip hold for all LP! E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano

12 .4.3 Ford-Fulkeron algorihm D. R. Fulkeron (94-976) Idea: Sar from a feaible flow x and ry o ieraively increae i value φ by ending, a each ieraion, an addiional amoun of produc along a(n undireced) pah from o wih a ricly poiive reidual capaciy., 0,3, 0, 0,3,,3,,3,,3,,,3, φ 0 = φ({}) = φ = δ = φ({}) = E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano

13 Can he value of he curren feaible flow x be increaed?,,3,,,3, φ({}) = If (i, j) i no auraed (x ij k ij ), we can increae x ij If (i, j) i no empy (x ij 0), we can decreae x ij while repecing 0 x ij k ij,,3,,,3, φ({}) =,3,,3 E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 3

14 ,,3,,,3, φ({}) = forward arc,,,3,,3 backward arc, We can end δ = addional uni of produc from o : +δ along forward arc -δ along backward arc Raionale: The uni of produc ha wa going from o i redireced o and he miing uni in i upplied from.,, φ({}) = + δ + δ,3 - δ, + δ,3, E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 4

15 Definiion: A pah P from o i an augmening pah wih repec o he curren feaible flow x if x ij k ij for all forward arc and x ij 0 for all backward arc. Since he maximum addiional amoun of produc ha can be en along he augmening pah - - -,, φ({}) = + δ + δ,3 - δ, + δ,3 i equal o δ=, we obain he new feaible flow x,,, φ({}) = 3,3 0,,3, E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 5

16 Given a feaible flow x for G = (V, A), we conruc he reidual nework G = (V, A) aociaed o x, which accoun for all poible flow variaion wih repec o x. If (i, j) A i no auraed, (i, j) A wih k ij = k ij x ij 0. reidual capaciy If (i, j) A i no empy, (j, i) A wih k ji = x ij 0. G curren feaible flow x of value 3,4, capaciy,,3, E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 6 G 3 reidual capaciy

17 G, +δ,3 +δ,4 - δ,, New feaible flow x of value φ = 3 + δ (δ = ) A each ieraion: To look for an augmening pah from o in G, we earch for a pah from o in G. If an augmening pah from o, he curren flow x i no opimal (of maximum value). E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 7

18 Example G 0, 0, 0, 0, , 3 0, 0, 0, 0, 0, 0, Augmening pah along which we can end δ = addiional uni of produc 0,4 7 Iniial feaible flow x 0 = 0 of value φ 0 = 0 Obervaion: For x = 0, G = G G 5 6 δ = E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 8 4

19 G 0,, 0, 5 6 0, 0, 0, 3,, 0,4 δ = 7 feaible flow x of value φ = 0, 0, 0, 4 augmening pah wih δ = wih repec o he curren feaible flow x G δ = E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 9

20 G,,, 5 6 0, 0, 0, 3,,,4 7 feaible flow x of value φ = 4 0, 0, 0, 4 augmening pah wih δ = wih repec o he curren feaible flow x G δ = 7 4 E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 0

21 G, 5 6,,, 4 3,,, S * = {, 4} ube of all he node reachable from he ource (node ), 3,4 7 G 5 6 feaible flow x 3 of value φ 3 = G ( S * ) 7 i no reachable from (only 4 i reachable) STOP 3 7 E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano

22 G, 5 6,, 0,, 3,, 3,4 7 feaible flow x 3 of value φ 3 = 5, 0,, 4 Cu δ G (S * ) of capaciy = 5 and feaible flow x 3 of value φ 3 = 5! Obervaion: All ougoing arc of δ G (S * ) are auraed and all enering one are empy G S * = {, 4} E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano

23 Propoiion: Ford-Fulkeron algorihm i exac. Proof A feaible flow x i of maximum value i no reachable from in he reidual nework G aociaed o x. ( ) If an aumening pah, x i no opimal. ( ) If i no reachable from, cu of G uch ha G ( S * ) By definiion of G, we have every (i, j) ( S * ) i auraed every (i, j) ( S * ) i empy. G G S * V E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 3

24 Therefore k ij 0 φ(s * ) = ( i, j) G = x ij * ( S ) ( i, j) G = x ij * ( S ) ( i, j) G k ij * ( S ) = k(s * ) all auraed all empy S * Weak dualiy: φ(s) k(s) x feaible S V, S, S he feaible flow x i of maximum value and he cu induced by S *, namely δ G (S * ), i of minimum capaciy. E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 4

25 The algorihm implie: Theorem (Ford-Fulkeron) The value of a feaible fow of maximum value = he capaciy of a cu of minimum capaciy. Obervaion: rong dualiy If all he capaciie k ij are ineger ( Z + ), he flow x of maximum value ha all x ij ineger and an ineger value φ*. Ford-Fulkeron algorihm i no greedy (x ij alo decreaed). E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 5

26 Ford-Fulkeron algorihm Inpu G = (V, A), capaciy k ij >0 (i, j)a, ource V, ink V Oupu Feaible flow x from o of maximum value φ* BEGIN x:=0; φ:=0; opimum:=fale; /* iniializaion */ REPEAT Build reidual nework G aociaed o x; Deermine, if, a pah P from o in G; IF P doe no exi THEN opimum := rue; ELSE δ:= min {k ij : (i,j) P}; φ:= φ + δ; FOR EACH (i,j) P DO IF (i,j) i forward THEN x ij := x ij + δ; ELSE x ji := x ji δ; END-IF END-IF UNTIL opimum = rue; END Maximum number of cycle? O(m) O(n+m) O(n) O(n) E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 6

27 Complexiy Since δ > 0, he value φ increae a each ieraion (cycle). If all k ij are ineger, x andk ij ineger and δ a mo φ * increae. capaciy of he cu δ({}) Since φ * k({}) mk max where m = A and k max = max{k ij : (i, j) A} and each cycle i O(m), he overall complexiy i O(m k max ). Definiion: The ize of an inance I, denoed by I, i he number of bi needed o decribe he inance. Since log (i)+ bi needed o ore ineger i, I = O(m log (k max )) O(m k max ) grow exponenially wih I becaue k max = log (kmax). E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 7

28 In ome cae he algorihm i very inefficien: δ= M M M M +δ +δ +δ +δ -δ +δ M very large In he wor cae: M ieraion! Obervaion: The algorihm can be made polynomial by looking for augmening pah wih a minimum number of arc. Edmond and Karp O(nm ), Dinic O(n m), Alo valid for he cae where capaciie are no ineger. E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 8

29 Polynomial ime algorihm for flow problem More efficien algorihm exi, baed on augmening pah, pre-flow (relaxing he node flow balance conrain) and capaciy caling. Problem Minimum co flow problem Given a nework wih a uni co c ij aociaed o each arc (i,j) and a value φ>0, deermine a feaible flow from o of value φ and of minimum oal co. Idea: Sar from a feaible flow x of value φ and end, a each ieraion, an addiional amoun of produc in he reidual nework (repecing he reidual capaciie and he value φ) along cycle of negaive co. E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 9

30 .4.4 Indirec applicaion ) Aigmen (maching) problem Given m engineer, n ak and for each engineer he li of ak he/he can perform. Aign he ak o he engineer o ha: each engineer i aigned a mo one ak, each ak i aigned o a mo one engineer, and he number of ak ha are execued (engineer involved) i maximized. If he compeence of he engineer are repreened via a biparie graph, wha are we looking for in uch a graph? How can we reduce hi problem o he problem of finding a feaible flow of maximum value in an ad hoc nework? E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 30

31 Graphical model: Biparie graph of compeence engineer ak Definiion: Given an undireced biparie graph G = (V, E), a maching M E i a ube of non adjacen edge. Problem Given a biparie graph G=(V, E), deermine a maching wih a maximum number of edge. E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 3

32 Thi problem can be reduced o he problem of finding a feaible flow of maximum value from o in he following nework: capaciy engineer ak capaciy k ineger Correpondence beween he feaible flow (from o ) of value φ and he maching conaining φ edge. Ineger capaciie opimal flow ha ineger x ij and ineger maximum value φ *. E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 3

33 ) Diribued compuing Aign n module of a program o proceor o a o minimize he oal co (execuion co + communicaion co). Suppoe we know: α i = execuion co of module i on proceor i n β i = execuion co of module i on nd proceor i n c ij = communicaion co if module i and j are aigned o differen proceor i, j n. Reduce hi problem o ha of finding a cu of minimum oal capaciy in an ad hoc direced nework. E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 33

34 module c ij proceor proceor α i β i 4 cu eparaing from aignmen of he n module o he proceor Correpondence beween he - cu of minimum capaciy and he minimum oal co aignmen of he module o he proceor. E. Amaldi Foundaion of Operaion Reearch Poliecnico di Milano 34

Topic: Applications of Network Flow Date: 9/14/2007

Topic: 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 information

Chapter 13. Network Flow III Applications. 13.1 Edge disjoint paths. 13.1.1 Edge-disjoint paths in a directed graphs

Chapter 13. Network Flow III Applications. 13.1 Edge disjoint paths. 13.1.1 Edge-disjoint 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 Edge-dijoin pah in a direced graph 13.1.1.1 Edge dijoin pah queiong: graph (dir/undir)., : verice.

More information

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

Max Flow, Min Cut. Maximum Flow and Minimum Cut. Soviet Rail Network, 1955. Minimum Cut Problem 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 Max-flow

More information

On the Connection Between Multiple-Unicast Network Coding and Single-Source Single-Sink Network Error Correction

On the Connection Between Multiple-Unicast Network Coding and Single-Source Single-Sink Network Error Correction On he Connecion Beween Muliple-Unica ework Coding and Single-Source Single-Sink ework Error Correcion Jörg Kliewer JIT Join work wih Wenao Huang and Michael Langberg ework Error Correcion Problem: Adverary

More information

How Much Can Taxes Help Selfish Routing?

How 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 information

1 The basic circulation problem

1 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 max-flow problem again, bu his

More information

Optimal Path Routing in Single and Multiple Clock Domain Systems

Optimal Path Routing in Single and Multiple Clock Domain Systems IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN, TO APPEAR. 1 Opimal Pah Rouing in Single and Muliple Clock Domain Syem Soha Haoun, Senior Member, IEEE, Charle J. Alper, Senior Member, IEEE ) Abrac Shrinking

More information

Fortified financial forecasting models: non-linear searching approaches

Fortified financial forecasting models: non-linear searching approaches 0 Inernaional Conference on Economic and inance Reearch IPEDR vol.4 (0 (0 IACSIT Pre, Singapore orified financial forecaing model: non-linear earching approache Mohammad R. Hamidizadeh, Ph.D. Profeor,

More information

Physical Topology Discovery for Large Multi-Subnet Networks

Physical Topology Discovery for Large Multi-Subnet Networks Phyical Topology Dicovery for Large Muli-Subne Nework Yigal Bejerano, Yuri Breibar, Mino Garofalaki, Rajeev Raogi Bell Lab, Lucen Technologie 600 Mounain Ave., Murray Hill, NJ 07974. {bej,mino,raogi}@reearch.bell-lab.com

More information

DIFFERENTIAL EQUATIONS with TI-89 ABDUL HASSEN and JAY SCHIFFMAN. A. Direction Fields and Graphs of Differential Equations

DIFFERENTIAL EQUATIONS with TI-89 ABDUL HASSEN and JAY SCHIFFMAN. A. Direction Fields and Graphs of Differential Equations DIFFERENTIAL EQUATIONS wih TI-89 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 information

Globally-Optimal Greedy Algorithms for Tracking a Variable Number of Objects

Globally-Optimal Greedy Algorithms for Tracking a Variable Number of Objects Globally-Opimal Greedy Algorihm for Tracking a Variable Number of Objec Hamed Piriavah Deva Ramanan Charle C. Fowlke Deparmen of Compuer Science, Univeriy of California, Irvine {hpiriav,dramanan,fowlke}@ic.uci.edu

More information

4.8 Exponential Growth and Decay; Newton s Law; Logistic Growth and Decay

4.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 information

and Decay Functions f (t) = C(1± r) t / K, for t 0, where

and Decay Functions f (t) = C(1± r) t / K, for t 0, where MATH 116 Exponenial Growh and Decay Funcions Dr. Neal, Fall 2008 A funcion ha grows or decays exponenially has he form f () = C(1± r) / K, for 0, where C is he iniial amoun a ime 0: f (0) = C r is he rae

More information

CHARGE AND DISCHARGE OF A CAPACITOR

CHARGE AND DISCHARGE OF A CAPACITOR REFERENCES RC Circuis: Elecrical Insrumens: Mos Inroducory Physics exs (e.g. A. Halliday and Resnick, Physics ; M. Sernheim and J. Kane, General Physics.) This Laboraory Manual: Commonly Used Insrumens:

More information

MTH6121 Introduction to Mathematical Finance Lesson 5

MTH6121 Introduction to Mathematical Finance Lesson 5 26 MTH6121 Inroducion o Mahemaical Finance Lesson 5 Conens 2.3 Brownian moion wih drif........................... 27 2.4 Geomeric Brownian moion........................... 28 2.5 Convergence of random

More information

s-domain Circuit Analysis

s-domain Circuit Analysis Domain ircui Analyi Operae direcly in he domain wih capacior, inducor and reior Key feaure lineariy i preered c decribed by ODE and heir Order equal number of plu number of Elemenbyelemen and ource ranformaion

More information

A Comparative Study of Linear and Nonlinear Models for Aggregate Retail Sales Forecasting

A Comparative Study of Linear and Nonlinear Models for Aggregate Retail Sales Forecasting A Comparaive Sudy of Linear and Nonlinear Model for Aggregae Reail Sale Forecaing G. Peer Zhang Deparmen of Managemen Georgia Sae Univeriy Alana GA 30066 (404) 651-4065 Abrac: The purpoe of hi paper i

More information

Multi-resource Allocation Scheduling in Dynamic Environments

Multi-resource Allocation Scheduling in Dynamic Environments MANUFACTURING & SERVICE OPERATIONS MANAGEMENT Vol. 00, No. 0, Xxxxx 0000, pp. 000 000 in 1523-4614 ein 1526-5498 00 0000 0001 INFORMS doi 10.1287/xxxx.0000.0000 c 0000 INFORMS Muli-reource Allocaion Scheduling

More information

6.003 Homework #4 Solutions

6.003 Homework #4 Solutions 6.3 Homewk #4 Soluion Problem. Laplace Tranfm Deermine he Laplace ranfm (including he region of convergence) of each of he following ignal: a. x () = e 2(3) u( 3) X = e 3 2 ROC: Re() > 2 X () = x ()e d

More information

Laboratory #3 Diode Basics and Applications (I)

Laboratory #3 Diode Basics and Applications (I) Laboraory #3 iode asics and pplicaions (I) I. Objecives 1. Undersand he basic properies of diodes. 2. Undersand he basic properies and operaional principles of some dioderecifier circuis. II. omponens

More information

Fourier Series Solution of the Heat Equation

Fourier 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 information

Heat demand forecasting for concrete district heating system

Heat demand forecasting for concrete district heating system Hea demand forecaing for concree diric heaing yem Bronilav Chramcov Abrac Thi paper preen he reul of an inveigaion of a model for hor-erm hea demand forecaing. Foreca of hi hea demand coure i ignifican

More information

RC Circuit and Time Constant

RC Circuit and Time Constant ircui and Time onsan 8M Objec: Apparaus: To invesigae he volages across he resisor and capacior in a resisor-capacior circui ( circui) as he capacior charges and discharges. We also wish o deermine he

More information

AP Calculus AB 2013 Scoring Guidelines

AP Calculus AB 2013 Scoring Guidelines AP Calculus AB 1 Scoring Guidelines The College Board The College Board is a mission-driven no-for-profi organizaion ha connecs sudens o college success and opporuniy. Founded in 19, he College Board was

More information

Supply Chain Management Using Simulation Optimization By Miheer Kulkarni

Supply Chain Management Using Simulation Optimization By Miheer Kulkarni Supply Chain Managemen Using Simulaion Opimizaion By Miheer Kulkarni This problem was inspired by he paper by Jung, Blau, Pekny, Reklaii and Eversdyk which deals wih supply chain managemen for he chemical

More information

Chapter 5. Aggregate Planning

Chapter 5. Aggregate Planning Chaper 5 Aggregae Planning Supply Chain Planning Marix procuremen producion disribuion sales longerm Sraegic Nework Planning miderm shorerm Maerial Requiremens Planning Maser Planning Producion Planning

More information

Nanocubes for Real-Time Exploration of Spatiotemporal Datasets

Nanocubes for Real-Time Exploration of Spatiotemporal Datasets Nanocube for RealTime Exploraion of Spaioemporal Daae Lauro Lin, Jame T Kloowki, and arlo Scheidegger Fig 1 Example viualizaion of 210 million public geolocaed Twier po over he coure of a year The daa

More information

Chapter 7. Response of First-Order RL and RC Circuits

Chapter 7. Response of First-Order RL and RC Circuits Chaper 7. esponse of Firs-Order 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 information

Communication Networks II Contents

Communication Networks II Contents 3 / 1 -- Communicaion Neworks II (Görg) -- www.comnes.uni-bremen.de Communicaion Neworks II Conens 1 Fundamenals of probabiliy heory 2 Traffic in communicaion neworks 3 Sochasic & Markovian Processes (SP

More information

Use SeDuMi to Solve LP, SDP and SCOP Problems: Remarks and Examples*

Use SeDuMi to Solve LP, SDP and SCOP Problems: Remarks and Examples* Use SeDuMi o Solve LP, SDP and SCOP Problems: Remarks and Examples* * his file was prepared by Wu-Sheng Lu, Dep. of Elecrical and Compuer Engineering, Universiy of Vicoria, and i was revised on December,

More information

Dividend taxation, share repurchases and the equity trap

Dividend taxation, share repurchases and the equity trap Working Paper 2009:7 Deparmen of Economic Dividend axaion, hare repurchae and he equiy rap Tobia Lindhe and Jan Söderen Deparmen of Economic Working paper 2009:7 Uppala Univeriy May 2009 P.O. Box 53 ISSN

More information

Chapter 2 Kinematics in One Dimension

Chapter 2 Kinematics in One Dimension Chaper Kinemaics in One Dimension Chaper DESCRIBING MOTION:KINEMATICS IN ONE DIMENSION PREVIEW Kinemaics is he sudy of how hings moe how far (disance and displacemen), how fas (speed and elociy), and how

More information

ANALYSIS AND COMPARISONS OF SOME SOLUTION CONCEPTS FOR STOCHASTIC PROGRAMMING PROBLEMS

ANALYSIS AND COMPARISONS OF SOME SOLUTION CONCEPTS FOR STOCHASTIC PROGRAMMING PROBLEMS ANALYSIS AND COMPARISONS OF SOME SOLUTION CONCEPTS FOR STOCHASTIC PROGRAMMING PROBLEMS R. Caballero, E. Cerdá, M. M. Muñoz and L. Rey () Deparmen of Applied Economics (Mahemaics), Universiy of Málaga,

More information

Distributed Broadcasting and Mapping Protocols in Directed Anonymous Networks

Distributed Broadcasting and Mapping Protocols in Directed Anonymous Networks Disribued Broadcasing and Mapping Proocols in Direced Anonymous Neworks Michael Langberg Moshe Schwarz Jehoshua Bruck Absrac We iniiae he sudy of disribued proocols over direced anonymous neworks ha are

More information

Chapter 6. First Order PDEs. 6.1 Characteristics The Simplest Case. u(x,t) t=1 t=2. t=0. Suppose u(x, t) satisfies the PDE.

Chapter 6. First Order PDEs. 6.1 Characteristics The Simplest Case. u(x,t) t=1 t=2. t=0. Suppose u(x, t) satisfies the PDE. Chaper 6 Firs Order PDEs 6.1 Characerisics 6.1.1 The Simples Case Suppose u(, ) saisfies he PDE where b, c are consan. au + bu = 0 If a = 0, he PDE is rivial (i says ha u = 0 and so u = f(). If a = 0,

More information

Math 201 Lecture 12: Cauchy-Euler Equations

Math 201 Lecture 12: Cauchy-Euler Equations Mah 20 Lecure 2: Cauchy-Euler 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 information

Name: Algebra II Review for Quiz #13 Exponential and Logarithmic Functions including Modeling

Name: Algebra II Review for Quiz #13 Exponential and Logarithmic Functions including Modeling Name: Algebra II Review for Quiz #13 Exponenial and Logarihmic Funcions including Modeling TOPICS: -Solving Exponenial Equaions (The Mehod of Common Bases) -Solving Exponenial Equaions (Using Logarihms)

More information

Single-machine Scheduling with Periodic Maintenance and both Preemptive and. Non-preemptive jobs in Remanufacturing System 1

Single-machine Scheduling with Periodic Maintenance and both Preemptive and. Non-preemptive jobs in Remanufacturing System 1 Absrac number: 05-0407 Single-machine Scheduling wih Periodic Mainenance and boh Preempive and Non-preempive jobs in Remanufacuring Sysem Liu Biyu hen Weida (School of Economics and Managemen Souheas Universiy

More information

Maintenance scheduling and process optimization under uncertainty

Maintenance scheduling and process optimization under uncertainty Compuers and Chemical Engineering 25 (2001) 217 236 www.elsevier.com/locae/compchemeng ainenance scheduling and process opimizaion under uncerainy C.G. Vassiliadis, E.N. Piikopoulos * Deparmen of Chemical

More information

Understanding Sequential Circuit Timing

Understanding Sequential Circuit Timing ENGIN112: Inroducion o Elecrical and Compuer Engineering Fall 2003 Prof. Russell Tessier Undersanding Sequenial Circui Timing Perhaps he wo mos disinguishing characerisics of a compuer are is processor

More information

Mathematics in Pharmacokinetics What and Why (A second attempt to make it clearer)

Mathematics in Pharmacokinetics What and Why (A second attempt to make it clearer) Mahemaics in Pharmacokineics Wha and Why (A second aemp o make i clearer) We have used equaions for concenraion () as a funcion of ime (). We will coninue o use hese equaions since he plasma concenraions

More information

Using RCtime to Measure Resistance

Using RCtime to Measure Resistance Basic Express Applicaion Noe Using RCime o Measure Resisance Inroducion One common use for I/O pins is o measure he analog value of a variable resisance. Alhough a buil-in ADC (Analog o Digial Converer)

More information

Strategic Optimization of a Transportation Distribution Network

Strategic Optimization of a Transportation Distribution Network Sraegic Opimizaion of a Transporaion Disribuion Nework K. John Sophabmixay, Sco J. Mason, Manuel D. Rossei Deparmen of Indusrial Engineering Universiy of Arkansas 4207 Bell Engineering Cener Fayeeville,

More information

4.6 Linear Programming duality

4.6 Linear Programming duality 4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP. Different spaces and objective functions but in general same optimal

More information

9. Capacitor and Resistor Circuits

9. Capacitor and Resistor Circuits ElecronicsLab9.nb 1 9. Capacior and Resisor Circuis Inroducion hus far we have consider resisors in various combinaions wih a power supply or baery which provide a consan volage source or direc curren

More information

17 Laplace transform. Solving linear ODE with piecewise continuous right hand sides

17 Laplace transform. Solving linear ODE with piecewise continuous right hand sides 7 Laplace ransform. Solving linear ODE wih piecewise coninuous righ hand sides In his lecure I will show how o apply he Laplace ransform o he ODE Ly = f wih piecewise coninuous f. Definiion. A funcion

More information

4kq 2. D) south A) F B) 2F C) 4F D) 8F E) 16F

4kq 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 information

The naive method discussed in Lecture 1 uses the most recent observations to forecast future values. That is, Y ˆ t + 1

The naive method discussed in Lecture 1 uses the most recent observations to forecast future values. That is, Y ˆ t + 1 Business Condiions & Forecasing Exponenial Smoohing LECTURE 2 MOVING AVERAGES AND EXPONENTIAL SMOOTHING OVERVIEW This lecure inroduces ime-series smoohing forecasing mehods. Various models are discussed,

More information

Robust Bandwidth Allocation Strategies

Robust Bandwidth Allocation Strategies Robu Bandwidh Allocaion Sraegie Oliver Heckmann, Jen Schmi, Ralf Seinmez Mulimedia Communicaion Lab (KOM), Darmad Univeriy of Technology Merckr. 25 D-64283 Darmad Germany {Heckmann, Schmi, Seinmez}@kom.u-darmad.de

More information

Sc i e n c e a n d t e a c h i n g:

Sc i e n c e a n d t e a c h i n g: Dikuionpapierreihe Working Paper Serie Sc i e n c e a n d e a c h i n g: Tw o -d i m e n i o n a l i g n a l l i n g in he academic job marke Andrea Schneider Nr./ No. 95 Augu 2009 Deparmen of Economic

More information

DETERMINISTIC INVENTORY MODEL FOR ITEMS WITH TIME VARYING DEMAND, WEIBULL DISTRIBUTION DETERIORATION AND SHORTAGES KUN-SHAN WU

DETERMINISTIC INVENTORY MODEL FOR ITEMS WITH TIME VARYING DEMAND, WEIBULL DISTRIBUTION DETERIORATION AND SHORTAGES KUN-SHAN WU Yugoslav Journal of Operaions Research 2 (22), Number, 6-7 DEERMINISIC INVENORY MODEL FOR IEMS WIH IME VARYING DEMAND, WEIBULL DISRIBUION DEERIORAION AND SHORAGES KUN-SHAN WU Deparmen of Bussines Adminisraion

More information

RC, RL and RLC circuits

RC, RL and RLC circuits Name Dae Time o Complee h m Parner Course/ Secion / Grade RC, RL and RLC circuis Inroducion In his experimen we will invesigae he behavior of circuis conaining combinaions of resisors, capaciors, and inducors.

More information

Voltage level shifting

Voltage level shifting rek Applicaion Noe Number 1 r. Maciej A. Noras Absrac A brief descripion of volage shifing circuis. 1 Inroducion In applicaions requiring a unipolar A volage signal, he signal may be delivered from a bi-polar

More information

11. Properties of alternating currents of LCR-electric circuits

11. Properties of alternating currents of LCR-electric circuits WS. Properies of alernaing currens of L-elecric circuis. Inroducion So-called passive elecric componens, such as ohmic resisors (), capaciors () and inducors (L), are widely used in various areas of science

More information

How has globalisation affected inflation dynamics in the United Kingdom?

How has globalisation affected inflation dynamics in the United Kingdom? 292 Quarerly Bullein 2008 Q3 How ha globaliaion affeced inflaion dynamic in he Unied Kingdom? By Jennifer Greenlade and Sephen Millard of he Bank Srucural Economic Analyi Diviion and Chri Peacock of he

More information

Heuristics for dimensioning large-scale MPLS networks

Heuristics for dimensioning large-scale MPLS networks Heurisics for dimensioning large-scale MPLS newors Carlos Borges 1, Amaro de Sousa 1, Rui Valadas 1 Depar. of Elecronics and Telecommunicaions Universiy of Aveiro, Insiue of Telecommunicaions pole of Aveiro

More information

AP Calculus AB 2007 Scoring Guidelines

AP Calculus AB 2007 Scoring Guidelines AP Calculus AB 7 Scoring Guidelines The College Board: Connecing Sudens o College Success The College Board is a no-for-profi membership associaion whose mission is o connec sudens o college success and

More information

Section 7.1 Angles and Their Measure

Section 7.1 Angles and Their Measure Secion 7.1 Angles and Their Measure Greek Leers Commonly Used in Trigonomery Quadran II Quadran III Quadran I Quadran IV α = alpha β = bea θ = hea δ = dela ω = omega γ = gamma DEGREES The angle formed

More information

Data Analysis Toolkit #7: Hypothesis testing, significance, and power Page 1

Data Analysis Toolkit #7: Hypothesis testing, significance, and power Page 1 Daa Analyi Toolki #7: Hypohei eing, ignificance, and power Page 1 The ame baic logic underlie all aiical hypohei eing. Thi oolki illurae he baic concep uing he mo common e, - e for difference beween mean.

More information

Module 4. Single-phase AC circuits. Version 2 EE IIT, Kharagpur

Module 4. Single-phase AC circuits. Version 2 EE IIT, Kharagpur Module 4 Single-phase A circuis ersion EE T, Kharagpur esson 5 Soluion of urren in A Series and Parallel ircuis ersion EE T, Kharagpur n he las lesson, wo poins were described:. How o solve for he impedance,

More information

Optimal Control Formulation using Calculus of Variations

Optimal Control Formulation using Calculus of Variations Lecure 5 Opimal Conrol Formulaion using Calculus o Variaions Dr. Radhakan Padhi Ass. Proessor Dep. o Aerospace Engineering Indian Insiue o Science - Bangalore opics Opimal Conrol Formulaion Objecive &

More information

Top-K Structural Diversity Search in Large Networks

Top-K Structural Diversity Search in Large Networks Top-K Srucural Diversiy Search in Large Neworks Xin Huang, Hong Cheng, Rong-Hua Li, Lu Qin, Jeffrey Xu Yu The Chinese Universiy of Hong Kong Guangdong Province Key Laboraory of Popular High Performance

More information

Part 1: White Noise and Moving Average Models

Part 1: White Noise and Moving Average Models Chaper 3: Forecasing From Time Series Models Par 1: Whie Noise and Moving Average Models Saionariy In his chaper, we sudy models for saionary ime series. A ime series is saionary if is underlying saisical

More information

Lenz's Law. Definition from the book:

Lenz's Law. Definition from the book: Lenz's Law Definiion from he book: The induced emf resuling from a changing magneic flux has a polariy ha leads o an induced curren whose direcion is such ha he induced magneic field opposes he original

More information

Performance Center Overview. Performance Center Overview 1

Performance Center Overview. Performance Center Overview 1 Performance Cener Overview Performance Cener Overview 1 ODJFS Performance Cener ce Cener New Performance Cener Model Performance Cener Projec Meeings Performance Cener Execuive Meeings Performance Cener

More information

Process Modeling for Object Oriented Analysis using BORM Object Behavioral Analysis.

Process Modeling for Object Oriented Analysis using BORM Object Behavioral Analysis. Proce Modeling for Objec Oriened Analyi uing BORM Objec Behavioral Analyi. Roger P. Kno Ph.D., Compuer Science Dep, Loughborough Univeriy, U.K. r.p.kno@lboro.ac.uk 9RMW FKMerunka Ph.D., Dep. of Informaion

More information

Outline. Role of Aggregate Planning. Role of Aggregate Planning. Logistics and Supply Chain Management. Aggregate Planning

Outline. Role of Aggregate Planning. Role of Aggregate Planning. Logistics and Supply Chain Management. Aggregate Planning Logisics and upply Chain Managemen Aggregae Planning 1 Ouline Role of aggregae planning in a supply chain The aggregae planning problem Aggregae planning sraegies mplemening aggregae planning in pracice

More information

Chapter 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

Chapter 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 information

Chabot College Physics Lab RC Circuits Scott Hildreth

Chabot College Physics Lab RC Circuits Scott Hildreth Chabo College Physics Lab Circuis Sco Hildreh Goals: Coninue o advance your undersanding of circuis, measuring resisances, currens, and volages across muliple componens. Exend your skills in making breadboard

More information

Signal Processing and Linear Systems I

Signal Processing and Linear Systems I Sanford Universiy Summer 214-215 Signal Processing and Linear Sysems I Lecure 5: Time Domain Analysis of Coninuous Time Sysems June 3, 215 EE12A:Signal Processing and Linear Sysems I; Summer 14-15, Gibbons

More information

Better Bounds for Online Load Balancing on Unrelated Machines

Better Bounds for Online Load Balancing on Unrelated Machines Beer Bound for Online Load Balancing on Unrelaed Machine Ioanni Caragianni Abrac We udy he roblem of cheduling ermanen ob on unrelaed machine when he obecive i o minimize he L norm of he machine load.

More information

Appendix A: Area. 1 Find the radius of a circle that has circumference 12 inches.

Appendix A: Area. 1 Find the radius of a circle that has circumference 12 inches. Appendi A: Area worked-ou s o Odd-Numbered Eercises Do no read hese worked-ou s before aemping o do he eercises ourself. Oherwise ou ma mimic he echniques shown here wihou undersanding he ideas. Bes wa

More information

Subsistence Consumption and Rising Saving Rate

Subsistence Consumption and Rising Saving Rate Subience Conumpion and Riing Saving Rae Kenneh S. Lin a, Hiu-Yun Lee b * a Deparmen of Economic, Naional Taiwan Univeriy, Taipei, 00, Taiwan. b Deparmen of Economic, Naional Chung Cheng Univeriy, Chia-Yi,

More information

AP Calculus BC 2010 Scoring Guidelines

AP Calculus BC 2010 Scoring Guidelines AP Calculus BC Scoring Guidelines The College Board The College Board is a no-for-profi membership associaion whose mission is o connec sudens o college success and opporuniy. Founded in, he College Board

More information

The Transport Equation

The 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 information

Infrastructure and Evolution in Division of Labour

Infrastructure and Evolution in Division of Labour Infrarucure and Evoluion in Diviion of Labour Mei Wen Monah Univery (Thi paper ha been publihed in RDE. (), 9-06) April 997 Abrac Thi paper udie he relaionhip beween infrarucure ependure and endogenou

More information

2.6 Limits at Infinity, Horizontal Asymptotes Math 1271, TA: Amy DeCelles. 1. Overview. 2. Examples. Outline: 1. Definition of limits at infinity

2.6 Limits at Infinity, Horizontal Asymptotes Math 1271, TA: Amy DeCelles. 1. Overview. 2. Examples. Outline: 1. Definition of limits at infinity .6 Limis a Infiniy, Horizonal Asympoes Mah 7, TA: Amy DeCelles. Overview Ouline:. Definiion of is a infiniy. Definiion of horizonal asympoe 3. Theorem abou raional powers of. Infinie is a infiniy This

More information

E0 370 Statistical Learning Theory Lecture 20 (Nov 17, 2011)

E0 370 Statistical Learning Theory Lecture 20 (Nov 17, 2011) E0 370 Saisical Learning Theory Lecure 0 (ov 7, 0 Online Learning from Expers: Weighed Majoriy and Hedge Lecurer: Shivani Agarwal Scribe: Saradha R Inroducion In his lecure, we will look a he problem of

More information

Trading Strategies for Sliding, Rolling-horizon, and Consol Bonds

Trading Strategies for Sliding, Rolling-horizon, and Consol Bonds Trading Sraegie for Sliding, Rolling-horizon, and Conol Bond MAREK RUTKOWSKI Iniue of Mahemaic, Poliechnika Warzawka, -661 Warzawa, Poland Abrac The ime evoluion of a liding bond i udied in dicree- and

More information

The Role of the Scientific Method in Software Development. Robert Sedgewick Princeton University

The Role of the Scientific Method in Software Development. Robert Sedgewick Princeton University The Role of he Scienific Mehod in Sofware Developmen Rober Sedgewick Princeon Univeriy The cienific mehod i neceary in algorihm deign and ofware developmen Scienific mehod creae a model decribing naural

More information

Capacitors and inductors

Capacitors 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 information

Stochastic Optimal Control Problem for Life Insurance

Stochastic Optimal Control Problem for Life Insurance Sochasic Opimal Conrol Problem for Life Insurance s. Basukh 1, D. Nyamsuren 2 1 Deparmen of Economics and Economerics, Insiue of Finance and Economics, Ulaanbaaar, Mongolia 2 School of Mahemaics, Mongolian

More information

A Note on Renewal Theory for T -iid Random Fuzzy Variables

A Note on Renewal Theory for T -iid Random Fuzzy Variables Applied Mahemaical Sciences, Vol, 6, no 6, 97-979 HIKARI Ld, wwwm-hikaricom hp://dxdoiorg/988/ams6686 A Noe on Renewal Theory for T -iid Rom Fuzzy Variables Dug Hun Hong Deparmen of Mahemaics, Myongji

More information

EDEXCEL NATIONAL CERTIFICATE/DIPLOMA UNIT 67 - FURTHER ELECTRICAL PRINCIPLES NQF LEVEL 3 OUTCOME 2 TUTORIAL 1 - TRANSIENTS

EDEXCEL NATIONAL CERTIFICATE/DIPLOMA UNIT 67 - FURTHER ELECTRICAL PRINCIPLES NQF LEVEL 3 OUTCOME 2 TUTORIAL 1 - TRANSIENTS EDEXEL NAIONAL ERIFIAE/DIPLOMA UNI 67 - FURHER ELERIAL PRINIPLE NQF LEEL 3 OUOME 2 UORIAL 1 - RANIEN Uni conen 2 Undersand he ransien behaviour of resisor-capacior (R) and resisor-inducor (RL) D circuis

More information

1. The graph shows the variation with time t of the velocity v of an object.

1. The graph shows the variation with time t of the velocity v of an object. 1. he graph shows he variaion wih ime of he velociy v of an objec. v Which one of he following graphs bes represens he variaion wih ime of he acceleraion a of he objec? A. a B. a C. a D. a 2. A ball, iniially

More information

4 Convolution. Recommended Problems. x2[n] 1 2[n]

4 Convolution. Recommended Problems. x2[n] 1 2[n] 4 Convoluion Recommended Problems P4.1 This problem is a simple example of he use of superposiion. Suppose ha a discree-ime linear sysem has oupus y[n] for he given inpus x[n] as shown in Figure P4.1-1.

More information

MODEL AND ALGORITHMS FOR THE REAL TIME MANAGEMENT OF RESIDENTIAL ELECTRICITY DEMAND. A. Barbato, G. Carpentieri

MODEL AND ALGORITHMS FOR THE REAL TIME MANAGEMENT OF RESIDENTIAL ELECTRICITY DEMAND. A. Barbato, G. Carpentieri MODEL AND ALGORITHMS FOR THE REAL TIME MANAGEMENT OF RESIDENTIAL ELECTRICITY DEMAND A. Barbao, G. Carpenieri Poliecnico di Milano, Diparimeno di Eleronica e Informazione, Email: barbao@ele.polimi.i, giuseppe.carpenieri@mail.polimi.i

More information

Acceleration Lab Teacher s Guide

Acceleration 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 information

Density Dependence. births are a decreasing function of density b(n) and deaths are an increasing function of density d(n).

Density Dependence. births are a decreasing function of density b(n) and deaths are an increasing function of density d(n). FW 662 Densiy-dependen populaion models In he previous lecure we considered densiy independen populaion models ha assumed ha birh and deah raes were consan and no a funcion of populaion size. Long-erm

More information

Graduate Macro Theory II: Notes on Neoclassical Growth Model

Graduate Macro Theory II: Notes on Neoclassical Growth Model Graduae Macro Theory II: Noes on Neoclassical Growh Model Eric Sims Universiy of Nore Dame Spring 2011 1 Basic Neoclassical Growh Model The economy is populaed by a large number of infiniely lived agens.

More information

Lecture 15 Isolated DC-DC converters

Lecture 15 Isolated DC-DC converters ELEC440/940 Lecure 15 olae C-C converer Ofen, he oupu C volage fro a C-C converer u be iolae fro he inpu AC upply. C power upplie for appliance an equipen are goo exaple. i avanageou o have he iolaion

More information

Cointegration: The Engle and Granger approach

Cointegration: The Engle and Granger approach Coinegraion: The Engle and Granger approach Inroducion Generally one would find mos of he economic variables o be non-saionary I(1) variables. Hence, any equilibrium heories ha involve hese variables require

More information

OPTIMAL BATCH QUANTITY MODELS FOR A LEAN PRODUCTION SYSTEM WITH REWORK AND SCRAP. A Thesis

OPTIMAL BATCH QUANTITY MODELS FOR A LEAN PRODUCTION SYSTEM WITH REWORK AND SCRAP. A Thesis OTIMAL BATH UANTITY MOELS FOR A LEAN ROUTION SYSTEM WITH REWORK AN SRA A Thei Submied o he Graduae Faculy of he Louiiana Sae Univeriy and Agriculural and Mechanical ollege in parial fulfillmen of he requiremen

More information

Fourier series. Learning outcomes

Fourier series. Learning outcomes Fourier series 23 Conens. Periodic funcions 2. Represening ic funcions by Fourier Series 3. Even and odd funcions 4. Convergence 5. Half-range series 6. The complex form 7. Applicaion of Fourier series

More information

Cross-sectional and longitudinal weighting in a rotational household panel: applications to EU-SILC. Vijay Verma, Gianni Betti, Giulio Ghellini

Cross-sectional and longitudinal weighting in a rotational household panel: applications to EU-SILC. Vijay Verma, Gianni Betti, Giulio Ghellini Cro-ecional and longiudinal eighing in a roaional houehold panel: applicaion o EU-SILC Viay Verma, Gianni Bei, Giulio Ghellini Working Paper n. 67, December 006 CROSS-SECTIONAL AND LONGITUDINAL WEIGHTING

More information

Optimal Investment and Consumption Decision of Family with Life Insurance

Optimal 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

Product Operation and Setup Instructions

Product Operation and Setup Instructions A9 Please read and save hese insrucions. Read carefully before aemping o assemble, insall, operae, or mainain he produc described. Proec yourself and ohers by observing all safey informaion. Failure o

More information

Full-wave rectification, bulk capacitor calculations Chris Basso January 2009

Full-wave rectification, bulk capacitor calculations Chris Basso January 2009 ull-wave recificaion, bulk capacior calculaions Chris Basso January 9 This shor paper shows how o calculae he bulk capacior value based on ripple specificaions and evaluae he rms curren ha crosses i. oal

More information

Q-SAC: Toward QoS Optimized Service Automatic Composition *

Q-SAC: Toward QoS Optimized Service Automatic Composition * Q-SAC: Toward QoS Opimized Service Auomaic Composiion * Hanhua Chen, Hai Jin, Xiaoming Ning, Zhipeng Lü Cluser and Grid Compuing Lab Huazhong Universiy of Science and Technology, Wuhan, 4374, China Email:

More information

Formulating Cyber-Security as Convex Optimization Problems

Formulating Cyber-Security as Convex Optimization Problems Formulaing Cyber-Securiy a Convex Opimizaion Problem Kyriako G. Vamvoudaki, João P. Hepanha, Richard A. Kemmerer, and Giovanni Vigna Univeriy of California, Sana Barbara Abrac. Miion-cenric cyber-ecuriy

More information