MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Civil and Environmental Engineering
|
|
- Elwin Gordon
- 5 years ago
- Views:
Transcription
1 MASSACHUSETTS INSTITUTE OF TECHNOLOGY Deparmen of Civil and Environmenal Engineering Waer Reource Syem Lecure 17 River Bain Planning Screening Model Nov River Bain Planning River bain planning i concerned wih conrucion and operaion of waer reource faciliie uch a: Reervoir Canal and aqueduc Irrigaion projec Hydroelecric plan Navigaion faciliie (e.g. lock) There are everal baic planning ak aociaed wih large river bain projec: Deerminaion of projec locaion and ize Scheduling and equencing of projec Real-ime operaion of projec ubjec o variable (uncerain) inpu Evaluaion of projec reliabiliy and reilience when inpu are variable (uncerain) Allocaion of projec co and benefi and aociaed financing iue Focu here on creening and imulaion apec of planning. Idenify configuraion operaing policie and likely benefi of he river bain plan Screening Analye Begin wih a map and chemaic diagram idenifying promiing ie for faciliie. Faciliie conidered: 1. Reervoir 2. Hydropower 3. Irrigaion area 4. Expor and irrigaion diverion 5. Impor and irrigaion reurn Organize he plan by: = ie (locaion of reervoir river diverion or low-head power faciliy) f = faciliy (reervoir power expor impor irrigaion) = ime (e.g. eaon or year) 1
2 Relaionhip beween ie and beween propoed faciliie a a given ie are repreened in a nework chemaic. Simple example (one ie): Original Propoed Plan Tribuary flow (meaured) River T + 1 Upream flow (meaured) F Impor I River Upream flow (meaured) F Inflow Q Evap es Reervoir orage S Sie locaion () Tribuary flow T+1 Releae D Hydropower P Expor E Land L Impor I+1 Downream flow (meaured) F + 1 Downream flow (meaured) F + 1 Primary deciion variable conidered (defined for each ie and/or ime in compaible uni) re land imp exp Faciliie ize/capaciie C C C C C [variou uni] Reervoir orage S [volume] Tribuary inflow T [volume/eaon] Reervoir inflow Q [volume/eaon] Reervoir releae D [volume/eaon] Impor and expor flow rae I E [volume/eaon] Irrigaed land L [area] Hydropower oupu P [energy] Some propoed faciliie may no be buil (i.e. opimum capaciie are 0). Screening Problem Formulaion For creening purpoe ue amorized objecive funcion All logic inpu and deciion variable repreen long-erm average logic condiion for each eaon during a ypical year All ime-dependen variable repea every year : Benefi are obained every eaon depend on ime-dependen ae (expor flow power energy culivaed land) Operaing co are incurred every eaon depend on faciliy capaciie Capial co are incurred only a iniial ime depend on faciliy capaciie 2
3 f f f Maximize B O d( r T ) K Projec deign f Benefi Operaing co Capial co T r(1 + r) d ( r T ) = Dicoun facor r = inere rae T = planning period (yr) T (1 + r) 1 Subjec o following conrain caegorie: 1. Capaciy 2. Flow (waer balance) 3. Irrigaion 4. Hydropower Example: Rio Colorado Bain Argenina Illurae creening model wih cae udy baed on plan developed for he Rio Colorado river bain in Argenina (ee figure below). Cae udy documened in Major D.C. and R.L. Lenon Applied Waer Reource Syem Planning Prenice Hall Bae plan deigned o maximize naional income 3 eaon define a ypical year ( = 1 2 3). Sie are locaed a each reervoir river expor or low-head (no reervoir) power faciliy a indicaed on propoed projec map (below). Seaonal Benefi: For Rio Colorado each benefi i aumed linearly proporional o an aociaed ae variable Sae are conrained by capaciie. f fmax Each capaciy C (a deciion variable) i conrained by maximum capaciy C (a pecified inpu). f Benefi ae and capaciy > 0 only if aociaed faciliy ineger variable y = 1 : exp expmax exp ~ E y Non-reervoir expor exp expmax re exp ~ E y Reervoir expor Expor : B = land land max exp ~ L y Non-reervoir irrigaed land land land max re ~ L y Reervoir irrigaed land re 0 = reervoir no buil ineger variable y = 1 = reervoir buil 3
4 Hydropower: B ~ P P max re y max y Reervoir power Low-head power Condiionaliy conrain: Reervoir-relaed expor power and irrigaion faciliie canno re be buil unle reervoir i buil ( y = 1). Capial co: For Rio Colorado variable co are aumed linearly proporional o capaciy re re re re Reervoir: K γ y + γ C re γ fixed re γ fixed = fixed = fixed capial co [$] re var = variable capial co [$/uni capaciy] ~ re C If y = 1 (o benefi > 0) fixed co are incurred. Capial co for expor and impor channel power and irrigaed land faciliie are defined in he ame way. Operaing Co: re re re O = γ K [$/eaon] re γ = fracion of capial co required for operaion/mainenance each eaon Capaciy Conrain Reervoir orage: re S re remax re C y [volume] Flow in channel from/o reervoir or river: exp E exp expmax re C y exp expmax exp or C y [volume/eaon] imp I imp impmax re C y imp impmax exp or C y [volume/eaon] Land irrigaed from reervoir or river diverion land L land landmax re C y land or C landmax exp y [area] Hydropower P ΔC [energy] max re C y Δ = 1 [eaon] or max C y Flow conrain Flow in each of he 3 eaon aumed o repea every year Q = F + I T + 1 = I + T + 1 [power] Reervoir inflow Tribuary Impor 4
5 S + 1 = S + Δ[ Q E D e ( S )] S 1 = S 4 F + 1 = D + I T + 1 All ae are non-negaive Evaporaion-orage funcion e ( S ) Irrigaion Conrain Differen amoun of land may be culivaed each eaon. Waer required o culivae land area L E τ Reervoir waer balance Cyclical orage Ouflow o nex ie i an inpu derived from opography. = L = irrigaion waer requiremen [deph/(eaon area)] Downream reurn flow: τ + 1 = ( 1 ρ ) E ρ = conumpive ue coefficien [unile] I Hydropower Conrain Energy produced depend on releae (reervoir) or ream flow (low head) and head: P ( H ( S ) Head-orage funcion = ε D H S ) = efficiency [unile] ε Reul of Rio Colorado Sudy Screening model produce following reul: i an inpu derived from opography. 1. Configuraion of plan (faciliie buil wih heir capaciie): re re exp exp imp imp land y C y C y C C y C 2. Seaonal value of ae: S e S ) Q ( D I E L P H ( S ) 3. Benefi and co for each faciliy and for overall plan: The bae run which maximize naional income produced following plan: Reervoir conruced: 3 of 3 reervoir in he upper (Mendoza) porion of bain 0 of 2 reervoir in cenral porion 1 of 3 reervoir (Cae de Piedra) in lower porion Irrigaion area conruced: 10 of 17 poible area buil in all 3 porion of he bain Hydropower plan conruced: 2 of 13 poible plan conruced in upper porion on diverion aqueduc 5
6 Inerbain ranfer (expor) conruced: 2 of 2 expor (upper porion) and 1 of 2 impor (cenral porion) Oher cae uing differen objecive puing prioriy on regional income irrigaion income ec give differen configuraion ee Major and Lenon (1979). The following figure were aken from Major David C and R.L. Lenon. Applied Waer Reource Syem Planning. Upper Saddle River NJ: Prenice Hall ISBN: Map of Rio Colorado Bain Aliude Profile Along Rio Colorado River Faciliie in Rio Colorado Lower Bain Schemaic of Propoed Rio Colorado Bain Plan Reervoir Co-Capaciy Curve Reervoir Volume-Deph Curve Reervoir Area-Deph Curve Figure removed due o copyrigh rericion. 6
Problem 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 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 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 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 informationA Dynamic Model for Facility Location in Closed-Loop Supply Chain Design
A Dynamic Model for Faciliy Locaion in Closed-Loop Supply Chain Design Orapadee Joochim 1 Inroducion A he sraegic level, closed-loop supply chain (CLSC managemen involves long-erm decisions regarding he
More informationHydropower Economics: An Overview
ydropower Economics: An Overview Finn R Førsund Professor Emerius Universiy of Oslo * Slides prepared for ECON4925 - Resource Economics Ocober 5 2017 ydropower economics 1 Curriculum ydropower Economics:
More informationARTIFICIAL INTELLIGENCE. Markov decision processes
INFOB2KI 2017-2018 Urech Univeriy The Neherland ARTIFICIAL INTELLIGENCE Markov deciion procee Lecurer: Silja Renooij Thee lide are par of he INFOB2KI Coure Noe available from www.c.uu.nl/doc/vakken/b2ki/chema.hml
More informationSuggested Solutions to Midterm Exam Econ 511b (Part I), Spring 2004
Suggeed Soluion o Miderm Exam Econ 511b (Par I), Spring 2004 1. Conider a compeiive equilibrium neoclaical growh model populaed by idenical conumer whoe preference over conumpion ream are given by P β
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 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 informationDETC2004/CIE ALGORITHMIC FOUNDATIONS FOR CONSISTENCY-CHECKING OF INTERACTION-STATES OF MECHATRONIC SYSTEMS
Proceeding of DETC 04 ASME 2004 Deign Engineering Technical Conference and Compuer and Informaion in Engineering Conference Sal Lake Ciy, Uah, USA, Sepember 28-Ocober 2, 2004 DETC2004/CIE-79 ALGORITHMIC
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 informationMODULE - 9 LECTURE NOTES 2 GENETIC ALGORITHMS
1 MODULE - 9 LECTURE NOTES 2 GENETIC ALGORITHMS INTRODUCTION Mos real world opimizaion problems involve complexiies like discree, coninuous or mixed variables, muliple conflicing objecives, non-lineariy,
More informationMaximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges
1 Maximum Nework Lifeime in Wirele Senor Nework wih Adjuable Sening Range Mihaela Cardei, Jie Wu, Mingming Lu, and Mohammad O. Pervaiz Abrac Thi paper addree he arge coverage problem in wirele enor nework
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 informationVehicle Arrival Models : Headway
Chaper 12 Vehicle Arrival Models : Headway 12.1 Inroducion Modelling arrival of vehicle a secion of road is an imporan sep in raffic flow modelling. I has imporan applicaion in raffic flow simulaion where
More informationCSE/NB 528 Lecture 14: Reinforcement Learning (Chapter 9)
CSE/NB 528 Lecure 14: Reinforcemen Learning Chaper 9 Image from hp://clasdean.la.asu.edu/news/images/ubep2001/neuron3.jpg Lecure figures are from Dayan & Abbo s book hp://people.brandeis.edu/~abbo/book/index.hml
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 informationGlobal Optimization for Scheduling Refinery Crude Oil Operations
Global Opimizaion for Scheduling Refinery Crude Oil Operaions Ramkumar Karuppiah 1, Kevin C. Furman 2 and Ignacio E. Grossmann 1 (1) Deparmen of Chemical Engineering Carnegie Mellon Universiy (2) Corporae
More informationMacroeconomics 1. Ali Shourideh. Final Exam
4780 - Macroeconomic 1 Ali Shourideh Final Exam Problem 1. A Model of On-he-Job Search Conider he following verion of he McCall earch model ha allow for on-he-job-earch. In paricular, uppoe ha ime i coninuou
More information10. State Space Methods
. Sae Space Mehods. Inroducion Sae space modelling was briefly inroduced in chaper. Here more coverage is provided of sae space mehods before some of heir uses in conrol sysem design are covered in he
More informationFinal Exam Advanced Macroeconomics I
Advanced Macroeconomics I WS 00/ Final Exam Advanced Macroeconomics I February 8, 0 Quesion (5%) An economy produces oupu according o α α Y = K (AL) of which a fracion s is invesed. echnology A is exogenous
More informationDecentralized Foresighted Energy Purchase and Procurement With Renewable Generation and Energy Storage
Decenralized Foreighed Energy Purchae and Procuremen Wih Renewable Generaion and Energy Sorage Yuanzhang Xiao and Mihaela van der Schaar Abrac We udy a power yem wih one independen yem operaor (ISO) who
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 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 informationScheduling of Crude Oil Movements at Refinery Front-end
Scheduling of Crude Oil Movemens a Refinery Fron-end Ramkumar Karuppiah and Ignacio Grossmann Carnegie Mellon Universiy ExxonMobil Case Sudy: Dr. Kevin Furman Enerprise-wide Opimizaion Projec March 15,
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 informationChapter 6. Laplace Transforms
Chaper 6. Laplace Tranform Kreyzig by YHLee;45; 6- An ODE i reduced o an algebraic problem by operaional calculu. The equaion i olved by algebraic manipulaion. The reul i ranformed back for he oluion of
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 informationBuckling of a structure means failure due to excessive displacements (loss of structural stiffness), and/or
Buckling Buckling of a rucure mean failure due o exceive diplacemen (lo of rucural iffne), and/or lo of abiliy of an equilibrium configuraion of he rucure The rule of humb i ha buckling i conidered a mode
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 informationLet. x y. denote a bivariate time series with zero mean.
Linear Filer Le x y : T denoe a bivariae ime erie wih zero mean. Suppoe ha he ime erie {y : T} i conruced a follow: y a x The ime erie {y : T} i aid o be conruced from {x : T} by mean of a Linear Filer.
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 informationMaintenance Models. Prof. Robert C. Leachman IEOR 130, Methods of Manufacturing Improvement Spring, 2011
Mainenance Models Prof Rober C Leachman IEOR 3, Mehods of Manufacuring Improvemen Spring, Inroducion The mainenance of complex equipmen ofen accouns for a large porion of he coss associaed wih ha equipmen
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 informationA Dynamic Model of Economic Fluctuations
CHAPTER 15 A Dynamic Model of Economic Flucuaions Modified for ECON 2204 by Bob Murphy 2016 Worh Publishers, all righs reserved IN THIS CHAPTER, OU WILL LEARN: how o incorporae dynamics ino he AD-AS model
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 informationSelfish Routing. Tim Roughgarden Cornell University. Includes joint work with Éva Tardos
Selfih Rouing Tim Roughgarden Cornell Univeriy Include join work wih Éva Tardo 1 Which roue would you chooe? Example: one uni of raffic (e.g., car) wan o go from o delay = 1 hour (no congeion effec) long
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 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 informationModeling the Evolution of Demand Forecasts with Application to Safety Stock Analysis in Production/Distribution Systems
Modeling he Evoluion of Demand oreca wih Applicaion o Safey Sock Analyi in Producion/Diribuion Syem David Heah and Peer Jackon Preened by Kai Jiang Thi ummary preenaion baed on: Heah, D.C., and P.L. Jackon.
More informationProbabilistic Models for Reliability Analysis of a System with Three Consecutive Stages of Deterioration
Yusuf I., Gaawa R.I. Volume, December 206 Probabilisic Models for Reliabiliy Analysis of a Sysem wih Three Consecuive Sages of Deerioraion Ibrahim Yusuf Deparmen of Mahemaical Sciences, Bayero Universiy,
More informationLAPLACE TRANSFORM AND TRANSFER FUNCTION
CHBE320 LECTURE V LAPLACE TRANSFORM AND TRANSFER FUNCTION Professor Dae Ryook Yang Spring 2018 Dep. of Chemical and Biological Engineering 5-1 Road Map of he Lecure V Laplace Transform and Transfer funcions
More informationChapter 6. Laplace Transforms
6- Chaper 6. Laplace Tranform 6.4 Shor Impule. Dirac Dela Funcion. Parial Fracion 6.5 Convoluion. Inegral Equaion 6.6 Differeniaion and Inegraion of Tranform 6.7 Syem of ODE 6.4 Shor Impule. Dirac Dela
More informationCooperative Ph.D. Program in School of Economic Sciences and Finance QUALIFYING EXAMINATION IN MACROECONOMICS. August 8, :45 a.m. to 1:00 p.m.
Cooperaive Ph.D. Program in School of Economic Sciences and Finance QUALIFYING EXAMINATION IN MACROECONOMICS Augus 8, 213 8:45 a.m. o 1: p.m. THERE ARE FIVE QUESTIONS ANSWER ANY FOUR OUT OF FIVE PROBLEMS.
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 informationCONTROL SYSTEMS. Chapter 3 Mathematical Modelling of Physical Systems-Laplace Transforms. Prof.Dr. Fatih Mehmet Botsalı
CONTROL SYSTEMS Chaper Mahemaical Modelling of Phyical Syem-Laplace Tranform Prof.Dr. Faih Mehme Boalı Definiion Tranform -- a mahemaical converion from one way of hinking o anoher o make a problem eaier
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 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 informationFrequency Response. We now know how to analyze and design ccts via s- domain methods which yield dynamical information
Frequency Repone We now now how o analyze and deign cc via - domain mehod which yield dynamical informaion Zero-ae repone Zero-inpu repone Naural repone Forced repone The repone are decribed by he exponenial
More informationE β t log (C t ) + M t M t 1. = Y t + B t 1 P t. B t 0 (3) v t = P tc t M t Question 1. Find the FOC s for an optimum in the agent s problem.
Noes, M. Krause.. Problem Se 9: Exercise on FTPL Same model as in paper and lecure, only ha one-period govenmen bonds are replaced by consols, which are bonds ha pay one dollar forever. I has curren marke
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 informationAlgorithmic Discrete Mathematics 6. Exercise Sheet
Algorihmic Dicree Mahemaic. Exercie Shee Deparmen of Mahemaic SS 0 PD Dr. Ulf Lorenz 7. and 8. Juni 0 Dipl.-Mah. David Meffer Verion of June, 0 Groupwork Exercie G (Heap-Sor) Ue Heap-Sor wih a min-heap
More informationAn Inventory Replenishment Model for Deteriorating Items with Time-varying Demand and Shortages using Genetic Algorithm
An Invenory Replenihmen odel for Deerioraing Iem wih ime-varying Demand and Shorage uing Geneic Algorihm An Invenory Replenihmen odel for Deerioraing Iem wih ime-varying Demand and Shorage uing Geneic
More informationControl Systems. Lecture 9 Frequency Response. Frequency Response
Conrol Syem Lecure 9 Frequency eone Frequency eone We now know how o analyze and deign yem via -domain mehod which yield dynamical informaion The reone are decribed by he exonenial mode The mode are deermined
More informationEmbedded Systems and Software. A Simple Introduction to Embedded Control Systems (PID Control)
Embedded Sysems and Sofware A Simple Inroducion o Embedded Conrol Sysems (PID Conrol) Embedded Sysems and Sofware, ECE:3360. The Universiy of Iowa, 2016 Slide 1 Acknowledgemens The maerial in his lecure
More informationCHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK
175 CHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK 10.1 INTRODUCTION Amongs he research work performed, he bes resuls of experimenal work are validaed wih Arificial Neural Nework. From he
More informationCSE/NB 528 Lecture 14: From Supervised to Reinforcement Learning (Chapter 9) R. Rao, 528: Lecture 14
CSE/NB 58 Lecure 14: From Supervised o Reinforcemen Learning Chaper 9 1 Recall from las ime: Sigmoid Neworks Oupu v T g w u g wiui w Inpu nodes u = u 1 u u 3 T i Sigmoid oupu funcion: 1 g a 1 a e 1 ga
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 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 informationA Theoretical Model of a Voltage Controlled Oscillator
A Theoreical Model of a Volage Conrolled Ocillaor Yenming Chen Advior: Dr. Rober Scholz Communicaion Science Iniue Univeriy of Souhern California UWB Workhop, April 11-1, 6 Inroducion Moivaion The volage
More informationDo R&D subsidies necessarily stimulate economic growth?
MPR Munich Peronal RePEc rchive Do R&D ubidie necearily imulae economic growh? Ping-ho Chen and Hun Chu and Ching-Chong Lai Deparmen of Economic, Naional Cheng Chi Univeriy, Taiwan, Deparmen of Economic,
More informationLecture Notes 3: Quantitative Analysis in DSGE Models: New Keynesian Model
Lecure Noes 3: Quaniaive Analysis in DSGE Models: New Keynesian Model Zhiwei Xu, Email: xuzhiwei@sju.edu.cn The moneary policy plays lile role in he basic moneary model wihou price sickiness. We now urn
More informationThis document was generated at 1:04 PM, 09/10/13 Copyright 2013 Richard T. Woodward. 4. End points and transversality conditions AGEC
his documen was generaed a 1:4 PM, 9/1/13 Copyrigh 213 Richard. Woodward 4. End poins and ransversaliy condiions AGEC 637-213 F z d Recall from Lecure 3 ha a ypical opimal conrol problem is o maimize (,,
More informationDesign of Controller for Robot Position Control
eign of Conroller for Robo oiion Conrol Two imporan goal of conrol: 1. Reference inpu racking: The oupu mu follow he reference inpu rajecory a quickly a poible. Se-poin racking: Tracking when he reference
More information13.1 Circuit Elements in the s Domain Circuit Analysis in the s Domain The Transfer Function and Natural Response 13.
Chaper 3 The Laplace Tranform in Circui Analyi 3. Circui Elemen in he Domain 3.-3 Circui Analyi in he Domain 3.4-5 The Tranfer Funcion and Naural Repone 3.6 The Tranfer Funcion and he Convoluion Inegral
More informationOrdinary Differential Equations
Lecure 22 Ordinary Differenial Equaions Course Coordinaor: Dr. Suresh A. Karha, Associae Professor, Deparmen of Civil Engineering, IIT Guwahai. In naure, mos of he phenomena ha can be mahemaically described
More informationSub Module 2.6. Measurement of transient temperature
Mechanical Measuremens Prof. S.P.Venkaeshan Sub Module 2.6 Measuremen of ransien emperaure Many processes of engineering relevance involve variaions wih respec o ime. The sysem properies like emperaure,
More informationEE Control Systems LECTURE 2
Copyrigh F.L. Lewi 999 All righ reerved EE 434 - Conrol Syem LECTURE REVIEW OF LAPLACE TRANSFORM LAPLACE TRANSFORM The Laplace ranform i very ueful in analyi and deign for yem ha are linear and ime-invarian
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 informationLAB 5: Computer Simulation of RLC Circuit Response using PSpice
--3LabManualLab5.doc LAB 5: ompuer imulaion of RL ircui Response using Ppice PURPOE To use a compuer simulaion program (Ppice) o invesigae he response of an RL series circui o: (a) a sinusoidal exciaion.
More informationEE202 Circuit Theory II
EE202 Circui Theory II 2017-2018, Spring Dr. Yılmaz KALKAN I. Inroducion & eview of Fir Order Circui (Chaper 7 of Nilon - 3 Hr. Inroducion, C and L Circui, Naural and Sep epone of Serie and Parallel L/C
More informationInstrumentation & Process Control
Chemical Engineering (GTE & PSU) Poal Correpondence GTE & Public Secor Inrumenaion & Proce Conrol To Buy Poal Correpondence Package call a -999657855 Poal Coure ( GTE & PSU) 5 ENGINEERS INSTITUTE OF INDI.
More informationCost Model for End-Milling of AISI D2 Tool Steel
Cos Model for End-Milling of AISI D2 Tool Seel Mohamed Elhadie, A. N. Musafizul Karim, A. K. M. Nurul A Deparmen of Manufacuring and Maerials Engineering Inernaional Islamic Universiy Malaysia Kuala Lumpur,
More information6.003 Homework 1. Problems. Due at the beginning of recitation on Wednesday, February 10, 2010.
6.003 Homework Due a he beginning of reciaion on Wednesday, February 0, 200. Problems. Independen and Dependen Variables Assume ha he heigh of a waer wave is given by g(x v) where x is disance, v is velociy,
More informationLecture 3: Solow Model II Handout
Economics 202a, Fall 1998 Lecure 3: Solow Model II Handou Basics: Y = F(K,A ) da d d d dk d = ga = n = sy K The model soluion, for he general producion funcion y =ƒ(k ): dk d = sƒ(k ) (n + g + )k y* =
More informationSolutions to Assignment 1
MA 2326 Differenial Equaions Insrucor: Peronela Radu Friday, February 8, 203 Soluions o Assignmen. Find he general soluions of he following ODEs: (a) 2 x = an x Soluion: I is a separable equaion as we
More informationAN ANALYTICAL METHOD OF SOLUTION FOR SYSTEMS OF BOOLEAN EQUATIONS
CHAPTER 5 AN ANALYTICAL METHOD OF SOLUTION FOR SYSTEMS OF BOOLEAN EQUATIONS 51 APPLICATIONS OF DE MORGAN S LAWS A we have een in Secion 44 of Chaer 4, any Boolean Equaion of ye (1), (2) or (3) could be
More informationChapter 15: Phenomena. Chapter 15 Chemical Kinetics. Reaction Rates. Reaction Rates R P. Reaction Rates. Rate Laws
Chaper 5: Phenomena Phenomena: The reacion (aq) + B(aq) C(aq) was sudied a wo differen emperaures (98 K and 35 K). For each emperaure he reacion was sared by puing differen concenraions of he 3 species
More informationGAMS Handout 2. Utah State University. Ethan Yang
Uah ae Universiy DigialCmmns@UU All ECAIC Maerials ECAIC Repsiry 2017 GAM Handu 2 Ehan Yang yey217@lehigh.edu Fllw his and addiinal wrs a: hps://digialcmmns.usu.edu/ecsaic_all Par f he Civil Engineering
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 informationExercises, Part IV: THE LONG RUN
Exercie, Par IV: THE LOG RU 4. The olow Growh Model onider he olow rowh model wihou echnoloy prore and wih conan populaion. a) Define he eady ae condiion and repreen i raphically. b) how he effec of chane
More informationnon-linear oscillators
non-linear oscillaors The invering comparaor operaion can be summarized as When he inpu is low, he oupu is high. When he inpu is high, he oupu is low. R b V REF R a and are given by he expressions derived
More informationExplicit form of global solution to stochastic logistic differential equation and related topics
SAISICS, OPIMIZAION AND INFOMAION COMPUING Sa., Opim. Inf. Compu., Vol. 5, March 17, pp 58 64. Publihed online in Inernaional Academic Pre (www.iapre.org) Explici form of global oluion o ochaic logiic
More information( ) ( ) if t = t. It must satisfy the identity. So, bulkiness of the unit impulse (hyper)function is equal to 1. The defining characteristic is
UNIT IMPULSE RESPONSE, UNIT STEP RESPONSE, STABILITY. Uni impulse funcion (Dirac dela funcion, dela funcion) rigorously defined is no sricly a funcion, bu disribuion (or measure), precise reamen requires
More informationas representing the flow of information over time, with
[Alraheed 4(4): April 15] ISSN: 77-9655 Scienific Journal Impac Facor: 3.449 (ISRA) Impac Facor:.114 IJSR INRNAIONAL JOURNAL OF NGINRING SCINCS & RSARCH CHNOLOGY H FINANCIAL APPLICAIONS OF RANDOM CONROL
More informationSingle Phase Line Frequency Uncontrolled Rectifiers
Single Phae Line Frequency Unconrolle Recifier Kevin Gaughan 24-Nov-03 Single Phae Unconrolle Recifier 1 Topic Baic operaion an Waveform (nucive Loa) Power Facor Calculaion Supply curren Harmonic an Th
More informationApplying Genetic Algorithms for Inventory Lot-Sizing Problem with Supplier Selection under Storage Capacity Constraints
IJCSI Inernaional Journal of Compuer Science Issues, Vol 9, Issue 1, No 1, January 2012 wwwijcsiorg 18 Applying Geneic Algorihms for Invenory Lo-Sizing Problem wih Supplier Selecion under Sorage Capaciy
More informationInternational Journal of Computer Science Trends and Technology (IJCST) Volume 3 Issue 6, Nov-Dec 2015
Inernaional Journal of Compuer Science Trends and Technology (IJCST) Volume Issue 6, Nov-Dec 05 RESEARCH ARTICLE OPEN ACCESS An EPQ Model for Two-Parameer Weibully Deerioraed Iems wih Exponenial Demand
More information3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon
3..3 INRODUCION O DYNAMIC OPIMIZAION: DISCREE IME PROBLEMS A. he Hamilonian and Firs-Order Condiions in a Finie ime Horizon Define a new funcion, he Hamilonian funcion, H. H he change in he oal value of
More informationMacroeconomic Theory Ph.D. Qualifying Examination Fall 2005 ANSWER EACH PART IN A SEPARATE BLUE BOOK. PART ONE: ANSWER IN BOOK 1 WEIGHT 1/3
Macroeconomic Theory Ph.D. Qualifying Examinaion Fall 2005 Comprehensive Examinaion UCLA Dep. of Economics You have 4 hours o complee he exam. There are hree pars o he exam. Answer all pars. Each par has
More informationSelfish Routing and the Price of Anarchy. Tim Roughgarden Cornell University
Selfih Rouing and he Price of Anarchy Tim Roughgarden Cornell Univeriy 1 Algorihm for Self-Inereed Agen Our focu: problem in which muliple agen (people, compuer, ec.) inerac Moivaion: he Inerne decenralized
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 informationEE650R: Reliability Physics of Nanoelectronic Devices Lecture 9:
EE65R: Reliabiliy Physics of anoelecronic Devices Lecure 9: Feaures of Time-Dependen BTI Degradaion Dae: Sep. 9, 6 Classnoe Lufe Siddique Review Animesh Daa 9. Background/Review: BTI is observed when he
More informationBasic Circuit Elements Professor J R Lucas November 2001
Basic Circui Elemens - J ucas An elecrical circui is an inerconnecion of circui elemens. These circui elemens can be caegorised ino wo ypes, namely acive and passive elemens. Some Definiions/explanaions
More informationOn a Discrete-In-Time Order Level Inventory Model for Items with Random Deterioration
Journal of Agriculure and Life Sciences Vol., No. ; June 4 On a Discree-In-Time Order Level Invenory Model for Iems wih Random Deerioraion Dr Biswaranjan Mandal Associae Professor of Mahemaics Acharya
More information6 December 2013 H. T. Hoang - www4.hcmut.edu.vn/~hthoang/ 1
Lecure Noe Fundamenal of Conrol Syem Inrucor: Aoc. Prof. Dr. Huynh Thai Hoang Deparmen of Auomaic Conrol Faculy of Elecrical & Elecronic Engineering Ho Chi Minh Ciy Univeriy of Technology Email: hhoang@hcmu.edu.vn
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 informationEssential Microeconomics : OPTIMAL CONTROL 1. Consider the following class of optimization problems
Essenial Microeconomics -- 6.5: OPIMAL CONROL Consider he following class of opimizaion problems Max{ U( k, x) + U+ ( k+ ) k+ k F( k, x)}. { x, k+ } = In he language of conrol heory, he vecor k is he vecor
More information