Quantitative macro models feature an infinite number of periods A more realistic (?) view of time

Size: px
Start display at page:

Download "Quantitative macro models feature an infinite number of periods A more realistic (?) view of time"

Transcription

1 INFINIE-HORIZON CONSUMPION-SAVINGS MODEL SEPEMBER, Inroducion BASICS Quaniaive macro models feaure an infinie number of periods A more realisic (?) view of ime Infinie number of periods A meaphor for many periods A meaphor for alruisic linkages beween generaions Mahemaically convenien because recursive represenaion Limi of a -period economy as One-period subjecive discoun facor β (a scalar in [,]) Wih infiniy of periods, can inerpre as simple way of modeling finie planning horizon Impaience aggregaes geomerically over ime Subjecive discoun for S periods ahead is β S ypically begin analysis from beginning of period zero Index ime wih arbirary indexes, +, +, Sepember,

2 Inroducion BASICS Recas/resae (some) consumpion heory resuls Recas/resae (some) financial heory resuls New echnical issues Sae-coningen decisions (sill) he key period- consumpion c = H c probabiliy q M c probabiliy p L c probabiliy -p-q corresponding o y = H y probabiliy q y probabiliy p L y probabiliy -p-q Describe as an opimal decision rule c (y ) A mapping from realized income sae o opimal choice in ha sae Infinie-horizon analog c (y ) Bu a more complicaed objec because branching of even ree Sepember, 3 Model Srucure UILIY Preferences v(c, c, c, ) wih all he usual properies Separable across ime Sricly increasing in each c individually Diminishing marginal uiliy in each of c individually Expeced lifeime discouned uiliy E vc (, c, c, c,...) = uc ( ) + βeuc ( ) + β Eu( c ) + β E u( c ) = E β u( c ) = Planning ime aligned wih calendar ime by saring a period zero Condiional on informaion se of period zero Laer consider alernaive formulaions (wihin he class of expeced uiliy and raional expecaions) ime-non-separable uiliy Non-geomeric subjecive discouning Sepember, 4

3 Model Srucure UILIY Preferences v(c, c, c, ) wih all he usual properies Separable across ime Sricly increasing in each c individually Diminishing marginal uiliy in each of c individually Expeced lifeime discouned uiliy E vc (, c, c, c,...) = uc ( ) + βeuc ( ) + β Eu( c ) + β E u( c ) = E β u( c ) = Planning ime aligned wih calendar ime by saring a period zero Condiional on informaion se of period zero Firs consider deerminisic β uc ( ) and hen consider limi = lim β uc ( ) before urning o sochasic = Sepember, 5 Model Analysis DEERMINISIC SEQUENIAL ANALYSIS Planning horizon max β uc ( ) subjec o { c, a} = = FOCs c a c a c,,, + a = y + ( + r ) a =,... Euler equaions u'( c ) = β u ( c )( + r ) u'( c ) = β u ( c )( + r) c. c a Do we need any condiions a all abou a? u'( c ) = βu ( c )( + r ) Sepember, 6 3

4 Model Soluion DEERMINISIC SEQUENIAL ANALYSIS Planning horizon max β uc ( ) subjec o { c, a} = = c,,, + a = y + ( + r ) a =,... Need o solve for (+) unknowns c, c, c,, c + unknowns a, a, a,, a + unknowns Need (+) condiions Flow budge consrains for periods,,,, + condiions Euler equaions for periods,,,, - condiions Require one more condiion a (second) boundary condiion Sepember, 7 Macro Fundamenals BOUNDARY CONDIIONS a - provides iniial condiion on problem Requiring second boundary condiion suggess problem is a (sequence of) second-order difference (differenial) equaions Consider Euler equaion for period u'( c) = β u'( c+ )(+ r) Second-order difference equaion in a Need wo boundary condiions o solve Subsiue c and c + using and + budge consrains ( + ( + ) a a ) β ( + ( + ) a a ) u' y r = u y r ( + r) + + Second boundary condiion o require? Candidae a s = consan for s Arbirary Does one arise naurally from he economics of he problem? Sepember, 8 4

5 Macro Fundamenals BOUNDARY CONDIIONS No-Ponzi game condiion Would be opimal o end wih (infinie) deb Ruling ou sricly negaive asses a end of planning horizon seems naural So le s require a No-Ponzi a no-bankrupcies resricion Presen in mos models (wheher aware of i or no ) (NB Models of defaul do exis bu ofen are opimal defauls ) NO quie he complee second boundary condiion we need Sepember, 9 Macro Fundamenals BOUNDARY CONDIIONS β s λ s measures (presen-discouned) marginal value of resources in period s Saring from allocaion ha solves problem Suppose (c *, c *, c *,, c *; a *, a *, a *, a *) solves problem An inerior allocaion Le V(.) be maximized value (uiliy) * * * * V( a ;.) β u( c ) + λ y + ( + r ) a c a = { } Marginal injecion of resources in period s increases value of objecive funcion by V( a ;.) s = β λs ys Envelope heorem do no need o consider effec of marginal change in y s on opimal choices Suggess a consrucive proof of a second boundary condiion Sepember, 5

6 Macro Fundamenals CONSRUCING A BOUNDARY CONDIION Define period- objecive funcion ( a ) u ( a, a ) u y+ ( + r ) a Dynamic opimizaion problem β ua { a } = max (, a) = Firs-order necessary condiions u ( a a ), >, u ( a, a ) < u ( a, a ) + βu ( a, a ) =, =,,,..., * * * * + Define maximized value saring from dae ( s s ) * s * * ;.) β u s= V ( a a, a Sepember, Macro Fundamenals CONSRUCING A BOUNDARY CONDIION Assumpions Opimal soluion is inerior (i.e., c > ) (weak assumpion) u (,) (weak assumpion) Implies V () Lifeime uiliy is finie for all feasible pahs Implies * lim β V( a ;.) = Also noe V (.) Is increasing Is concave because u(.) is concave Sepember, 6

7 Macro Fundamenals CONSRUCING A BOUNDARY CONDIION Envelope condiion * V ( a ;.) * * u * a, a a Firs-order necessary condiions u ( a, a ) + βu ( a, a ) =, =,,,..., * * * * + ( ) V ( a ;.) u ( a ) u a a a a V a ;.) * * * * * * * * * a, a = β (, ) = β ( * β a Recall < By envelope condiion Because V() and V(.) concave Implies > By No-Ponzi condiion, a a end of planning horizon β V ( a ;.) β u ( a, a ) a + * * * * Sepember, 3 Macro Fundamenals CONSRUCING A BOUNDARY CONDIION β V ( a ;.) β u ( a, a ) a + * * * * Consider By No-Ponzi condiion, a a end of planning horizon lim β V ( a ;.) li m β u ( a, a ) a + * * * * = β u (c *)a * + * * * lim β V( a;.) lim β u'( c) a = because lifeime uiliy assumed finie for any feasible pah Sepember, 4 7

8 Macro Fundamenals BOUNDARY CONDIIONS No-Ponzi game condiion Would be opimal o end wih (infinie) deb Ruling ou sricly negaive asses a end of planning horizon seems naural So le s require a ransversaliy condiion * * lim β u'( c) a = VC he second boundary condiion (along wih iniial condiion) Subopimal o end planning horizon wih posiive asses ha would have sricly raised lifeime discouned uiliy Sufficiency sraighforward o esablish Necessiy much more difficul (Kamihigashi, Economerica) VC is sronger saemen han No-Ponzi condiion Sepember, 5 Model Soluion DEERMINISIC SEQUENIAL ANALYSIS Complee soluion of -period planning horizon? Soluion o consumer problem is a consumpion and asse sequence * * c, a ha saisfies { } = Sequence of flow budge consrains * * * + a + + r a c = y ( ), =,,,... Sequence of Euler equaions u' ( c ) = ( )( ), =,,,... * * β u c+ + r + condiions condiions VC for finie horizon aking as given { } * * * β u'( c) a = a = ( r,,, y a r = ) Exacly as in woperiod model! Sepember, 6 8

9 Model Soluion DEERMINISIC SEQUENIAL ANALYSIS Complee soluion of infinie-period horizon? Soluion o consumer problem is a consumpion and asse sequence { c * *, a } ha saisfies = Sequence of flow budge consrains * * * + a + + r a c = y (,,, ) =,... Sequence of Euler equaions u'( c ) = ( )( + ), =,,,... * * β u c+ r VC aking as given { } * * lim β u'( c ) a = ( r,,, y a r = ) Sepember, 7 9

Sam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes.

Sam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes. 8.F Baery Charging Task Sam wans o ake his MP3 player and his video game player on a car rip. An hour before hey plan o leave, he realized ha he forgo o charge he baeries las nigh. A ha poin, he plugged

More information

Project #1 Math 285 Name:

Project #1 Math 285 Name: Projec #1 Mah 85 Name: Solving Orinary Differenial Equaions by Maple: Sep 1: Iniialize he program: wih(deools): wih(pdeools): Sep : Define an ODE: (There are several ways of efining equaions, we sar wih

More information

A Principled Approach to. MILP Modeling. Columbia University, August Carnegie Mellon University. Workshop on MIP. John Hooker.

A Principled Approach to. MILP Modeling. Columbia University, August Carnegie Mellon University. Workshop on MIP. John Hooker. Slide A Principled Approach o MILP Modeling John Hooer Carnegie Mellon Universiy Worshop on MIP Columbia Universiy, Augus 008 Proposal MILP modeling is an ar, bu i need no be unprincipled. Slide Proposal

More information

MATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008

MATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008 MATH 5 - Differenial Equaions Sepember 15, 8 Projec 1, Fall 8 Due: Sepember 4, 8 Lab 1.3 - Logisics Populaion Models wih Harvesing For his projec we consider lab 1.3 of Differenial Equaions pages 146 o

More information

4. Minimax and planning problems

4. Minimax and planning problems CS/ECE/ISyE 524 Inroducion o Opimizaion Spring 2017 18 4. Minima and planning problems ˆ Opimizing piecewise linear funcions ˆ Minima problems ˆ Eample: Chebyshev cener ˆ Muli-period planning problems

More information

Piecewise Linear Models

Piecewise Linear Models 6-6 Applied Operaions Research Piecewise Linear Models Deparmen of Mahemaics and Saisics The Universi of Melbourne This presenaion has been made in accordance wih he provisions of Par VB of he coprigh

More information

Learning in Games via Opponent Strategy Estimation and Policy Search

Learning in Games via Opponent Strategy Estimation and Policy Search Learning in Games via Opponen Sraegy Esimaion and Policy Search Yavar Naddaf Deparmen of Compuer Science Universiy of Briish Columbia Vancouver, BC yavar@naddaf.name Nando de Freias (Supervisor) Deparmen

More information

Gauss-Jordan Algorithm

Gauss-Jordan Algorithm Gauss-Jordan Algorihm The Gauss-Jordan algorihm is a sep by sep procedure for solving a sysem of linear equaions which may conain any number of variables and any number of equaions. The algorihm is carried

More information

It is easier to visualize plotting the curves of cos x and e x separately: > plot({cos(x),exp(x)},x = -5*Pi..Pi,y = );

It is easier to visualize plotting the curves of cos x and e x separately: > plot({cos(x),exp(x)},x = -5*Pi..Pi,y = ); Mah 467 Homework Se : some soluions > wih(deools): wih(plos): Warning, he name changecoords has been redefined Problem :..7 Find he fixed poins, deermine heir sabiliy, for x( ) = cos x e x > plo(cos(x)

More information

M(t)/M/1 Queueing System with Sinusoidal Arrival Rate

M(t)/M/1 Queueing System with Sinusoidal Arrival Rate 20 TUTA/IOE/PCU Journal of he Insiue of Engineering, 205, (): 20-27 TUTA/IOE/PCU Prined in Nepal M()/M/ Queueing Sysem wih Sinusoidal Arrival Rae A.P. Pan, R.P. Ghimire 2 Deparmen of Mahemaics, Tri-Chandra

More information

CENG 477 Introduction to Computer Graphics. Modeling Transformations

CENG 477 Introduction to Computer Graphics. Modeling Transformations CENG 477 Inroducion o Compuer Graphics Modeling Transformaions Modeling Transformaions Model coordinaes o World coordinaes: Model coordinaes: All shapes wih heir local coordinaes and sies. world World

More information

NEWTON S SECOND LAW OF MOTION

NEWTON S SECOND LAW OF MOTION Course and Secion Dae Names NEWTON S SECOND LAW OF MOTION The acceleraion of an objec is defined as he rae of change of elociy. If he elociy changes by an amoun in a ime, hen he aerage acceleraion during

More information

1.4 Application Separable Equations and the Logistic Equation

1.4 Application Separable Equations and the Logistic Equation 1.4 Applicaion Separable Equaions and he Logisic Equaion If a separable differenial equaion is wrien in he form f ( y) dy= g( x) dx, hen is general soluion can be wrien in he form f ( y ) dy = g ( x )

More information

EP2200 Queueing theory and teletraffic systems

EP2200 Queueing theory and teletraffic systems EP2200 Queueing heory and eleraffic sysems Vikoria Fodor Laboraory of Communicaion Neworks School of Elecrical Engineering Lecure 1 If you wan o model neworks Or a comple daa flow A queue's he key o help

More information

Visual Perception as Bayesian Inference. David J Fleet. University of Toronto

Visual Perception as Bayesian Inference. David J Fleet. University of Toronto Visual Percepion as Bayesian Inference David J Flee Universiy of Torono Basic rules of probabiliy sum rule (for muually exclusive a ): produc rule (condiioning): independence (def n ): Bayes rule: marginalizaion:

More information

Dynamic Route Planning and Obstacle Avoidance Model for Unmanned Aerial Vehicles

Dynamic Route Planning and Obstacle Avoidance Model for Unmanned Aerial Vehicles Volume 116 No. 24 2017, 315-329 ISSN: 1311-8080 (prined version); ISSN: 1314-3395 (on-line version) url: hp://www.ijpam.eu ijpam.eu Dynamic Roue Planning and Obsacle Avoidance Model for Unmanned Aerial

More information

Streamline Pathline Eulerian Lagrangian

Streamline Pathline Eulerian Lagrangian Sreamline Pahline Eulerian Lagrangian Sagnaion Poin Flow V V V = + = + = + o V xi y j a V V xi y j o Pahline and Sreakline Insananeous Sreamlines Pahlines Sreaklines Maerial Derivaive Acceleraion

More information

STEREO PLANE MATCHING TECHNIQUE

STEREO PLANE MATCHING TECHNIQUE STEREO PLANE MATCHING TECHNIQUE Commission III KEY WORDS: Sereo Maching, Surface Modeling, Projecive Transformaion, Homography ABSTRACT: This paper presens a new ype of sereo maching algorihm called Sereo

More information

Spline Curves. Color Interpolation. Normal Interpolation. Last Time? Today. glshademodel (GL_SMOOTH); Adjacency Data Structures. Mesh Simplification

Spline Curves. Color Interpolation. Normal Interpolation. Last Time? Today. glshademodel (GL_SMOOTH); Adjacency Data Structures. Mesh Simplification Las Time? Adjacency Daa Srucures Spline Curves Geomeric & opologic informaion Dynamic allocaion Efficiency of access Mesh Simplificaion edge collapse/verex spli geomorphs progressive ransmission view-dependen

More information

Coded Caching with Multiple File Requests

Coded Caching with Multiple File Requests Coded Caching wih Muliple File Requess Yi-Peng Wei Sennur Ulukus Deparmen of Elecrical and Compuer Engineering Universiy of Maryland College Park, MD 20742 ypwei@umd.edu ulukus@umd.edu Absrac We sudy a

More information

Hyelim Oh. School of Computing, National University of Singapore, 13 Computing Drive, Singapore SINGAPORE

Hyelim Oh. School of Computing, National University of Singapore, 13 Computing Drive, Singapore SINGAPORE RESEARCH ARTICLE FREE VERSUS FOR-A-FEE: THE IMPACT OF A PAYWALL ON THE PATTERN AND EFFECTIVENESS OF WORD-OF-MOUTH VIA SOCIAL MEDIA Hyelim Oh School of Compuing, Naional Universiy of Singapore, 13 Compuing

More information

Optimal Crane Scheduling

Optimal Crane Scheduling Opimal Crane Scheduling Samid Hoda, John Hooker Laife Genc Kaya, Ben Peerson Carnegie Mellon Universiy Iiro Harjunkoski ABB Corporae Research EWO - 13 November 2007 1/16 Problem Track-mouned cranes move

More information

EECS 487: Interactive Computer Graphics

EECS 487: Interactive Computer Graphics EECS 487: Ineracive Compuer Graphics Lecure 7: B-splines curves Raional Bézier and NURBS Cubic Splines A represenaion of cubic spline consiss of: four conrol poins (why four?) hese are compleely user specified

More information

Implementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report)

Implementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report) Implemening Ray Casing in Terahedral Meshes wih Programmable Graphics Hardware (Technical Repor) Marin Kraus, Thomas Erl March 28, 2002 1 Inroducion Alhough cell-projecion, e.g., [3, 2], and resampling,

More information

Scattering at an Interface: Normal Incidence

Scattering at an Interface: Normal Incidence Course Insrucor Dr. Raymond C. Rumpf Office: A 337 Phone: (915) 747 6958 Mail: rcrumpf@uep.edu 4347 Applied lecromagneics Topic 3f Scaering a an Inerface: Normal Incidence Scaering These Normal noes Incidence

More information

Reinforcement Learning by Policy Improvement. Making Use of Experiences of The Other Tasks. Hajime Kimura and Shigenobu Kobayashi

Reinforcement Learning by Policy Improvement. Making Use of Experiences of The Other Tasks. Hajime Kimura and Shigenobu Kobayashi Reinforcemen Learning by Policy Improvemen Making Use of Experiences of The Oher Tasks Hajime Kimura and Shigenobu Kobayashi Tokyo Insiue of Technology, JAPAN genfe.dis.iech.ac.jp, kobayasidis.iech.ac.jp

More information

A Matching Algorithm for Content-Based Image Retrieval

A Matching Algorithm for Content-Based Image Retrieval A Maching Algorihm for Conen-Based Image Rerieval Sue J. Cho Deparmen of Compuer Science Seoul Naional Universiy Seoul, Korea Absrac Conen-based image rerieval sysem rerieves an image from a daabase using

More information

Engineering Mathematics 2018

Engineering Mathematics 2018 Engineering Mahemaics 08 SUBJET NAME : Mahemaics II SUBJET ODE : MA65 MATERIAL NAME : Par A quesions REGULATION : R03 UPDATED ON : November 06 TEXTBOOK FOR REFERENE To buy he book visi : Sri Hariganesh

More information

Scheduling. Scheduling. EDA421/DIT171 - Parallel and Distributed Real-Time Systems, Chalmers/GU, 2011/2012 Lecture #4 Updated March 16, 2012

Scheduling. Scheduling. EDA421/DIT171 - Parallel and Distributed Real-Time Systems, Chalmers/GU, 2011/2012 Lecture #4 Updated March 16, 2012 EDA421/DIT171 - Parallel and Disribued Real-Time Sysems, Chalmers/GU, 2011/2012 Lecure #4 Updaed March 16, 2012 Aemps o mee applicaion consrains should be done in a proacive way hrough scheduling. Schedule

More information

ME 406 Assignment #1 Solutions

ME 406 Assignment #1 Solutions Assignmen#1Sol.nb 1 ME 406 Assignmen #1 Soluions PROBLEM 1 We define he funcion for Mahemaica. In[1]:= f@_d := Ep@D - 4 Sin@D (a) We use Plo o consruc he plo. In[2]:= Plo@f@D, 8, -5, 5

More information

Discrete Event Systems. Lecture 14: Discrete Control. Continuous System. Discrete Event System. Discrete Control Systems.

Discrete Event Systems. Lecture 14: Discrete Control. Continuous System. Discrete Event System. Discrete Control Systems. Lecure 14: Discree Conrol Discree Even Sysems [Chaper: Sequenial Conrol + These Slides] Discree Even Sysems Sae Machine-Based Formalisms Saechars Grafce Laboraory 2 Peri Nes Implemenaion No covered in

More information

The Beer Dock: Three and a Half Implementations of the Beer Distribution Game

The Beer Dock: Three and a Half Implementations of the Beer Distribution Game The Beer Dock 2002-08-13 17:55:44-0700 The Beer Dock: Three and a Half Implemenaions of he Beer Disribuion Game Michael J. Norh[1] and Charles M. Macal Argonne Naional Laboraory, Argonne, Illinois Absrac

More information

Mass-Spring Systems and Resonance

Mass-Spring Systems and Resonance Mass-Spring Sysems and Resonance Comparing he effecs of damping coefficiens An ineresing problem is o compare he he effec of differen values of he damping coefficien c on he resuling moion of he mass on

More information

MARSS Reference Sheet

MARSS Reference Sheet MARSS Reference Shee The defaul MARSS model (form="marxss") is wrien as follows: x = B x 1 + u + C c + w where w MVN( Q ) y = Z x + a + D d + v where v MVN( R ) x 1 MVN(π Λ) or x MVN(π Λ) c and d are inpus

More information

Mobile Robots Mapping

Mobile Robots Mapping Mobile Robos Mapping 1 Roboics is Easy conrol behavior percepion modelling domain model environmen model informaion exracion raw daa planning ask cogniion reasoning pah planning navigaion pah execuion

More information

CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL

CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL Klečka Jan Docoral Degree Programme (1), FEEC BUT E-mail: xkleck01@sud.feec.vubr.cz Supervised by: Horák Karel E-mail: horak@feec.vubr.cz

More information

Chapter 3 MEDIA ACCESS CONTROL

Chapter 3 MEDIA ACCESS CONTROL Chaper 3 MEDIA ACCESS CONTROL Overview Moivaion SDMA, FDMA, TDMA Aloha Adapive Aloha Backoff proocols Reservaion schemes Polling Disribued Compuing Group Mobile Compuing Summer 2003 Disribued Compuing

More information

Effects needed for Realism. Ray Tracing. Ray Tracing: History. Outline. Foundations of Computer Graphics (Fall 2012)

Effects needed for Realism. Ray Tracing. Ray Tracing: History. Outline. Foundations of Computer Graphics (Fall 2012) Foundaions of ompuer Graphics (Fall 2012) S 184, Lecure 16: Ray Tracing hp://ins.eecs.berkeley.edu/~cs184 Effecs needed for Realism (Sof) Shadows Reflecions (Mirrors and Glossy) Transparency (Waer, Glass)

More information

Curves & Surfaces. Last Time? Today. Readings for Today (pick one) Limitations of Polygonal Meshes. Today. Adjacency Data Structures

Curves & Surfaces. Last Time? Today. Readings for Today (pick one) Limitations of Polygonal Meshes. Today. Adjacency Data Structures Las Time? Adjacency Daa Srucures Geomeric & opologic informaion Dynamic allocaion Efficiency of access Curves & Surfaces Mesh Simplificaion edge collapse/verex spli geomorphs progressive ransmission view-dependen

More information

In fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magnetic Field Maps

In fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magnetic Field Maps In fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magneic Field Maps A. D. Hahn 1, A. S. Nencka 1 and D. B. Rowe 2,1 1 Medical College of Wisconsin, Milwaukee, WI, Unied

More information

Image segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding

Image segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding Moivaion Image segmenaion Which pixels belong o he same objec in an image/video sequence? (spaial segmenaion) Which frames belong o he same video sho? (emporal segmenaion) Which frames belong o he same

More information

7.2 Puiseux Expansions

7.2 Puiseux Expansions 7. Puiseux Expansions Given an algebraic funcion on an algebraic curve, we wish o compue is principle pars by locaing is poles and compuing series expansions here. Since he powers of y form a Cx basis

More information

An Improved Square-Root Nyquist Shaping Filter

An Improved Square-Root Nyquist Shaping Filter An Improved Square-Roo Nyquis Shaping Filer fred harris San Diego Sae Universiy fred.harris@sdsu.edu Sridhar Seshagiri San Diego Sae Universiy Seshigar.@engineering.sdsu.edu Chris Dick Xilinx Corp. chris.dick@xilinx.com

More information

SREM: A Novel Multicast Routing Algorithm - Comprehensive Cost Analysis

SREM: A Novel Multicast Routing Algorithm - Comprehensive Cost Analysis REM: A Novel Mulicas Rouing Algorihm - Comprehensive Cos Analysis Yewen Cao and Khalid Al-Begain chool of Compuing, Universiy of Glamorgan, CF37 DL, Wales, U.K E-mail:{ycao,kbegain}@glam.ac.uk Absrac Ever-increasing

More information

A Tool for Multi-Hour ATM Network Design considering Mixed Peer-to-Peer and Client-Server based Services

A Tool for Multi-Hour ATM Network Design considering Mixed Peer-to-Peer and Client-Server based Services A Tool for Muli-Hour ATM Nework Design considering Mied Peer-o-Peer and Clien-Server based Services Conac Auhor Name: Luis Cardoso Company / Organizaion: Porugal Telecom Inovação Complee Mailing Address:

More information

Network management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional);

Network management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional); QoS in Frame Relay Frame relay characerisics are:. packe swiching wih virual circui service (virual circuis are bidirecional);. labels are called DLCI (Daa Link Connecion Idenifier);. for connecion is

More information

Assignment 2. Due Monday Feb. 12, 10:00pm.

Assignment 2. Due Monday Feb. 12, 10:00pm. Faculy of rs and Science Universiy of Torono CSC 358 - Inroducion o Compuer Neworks, Winer 218, LEC11 ssignmen 2 Due Monday Feb. 12, 1:pm. 1 Quesion 1 (2 Poins): Go-ack n RQ In his quesion, we review how

More information

COSC 3213: Computer Networks I Chapter 6 Handout # 7

COSC 3213: Computer Networks I Chapter 6 Handout # 7 COSC 3213: Compuer Neworks I Chaper 6 Handou # 7 Insrucor: Dr. Marvin Mandelbaum Deparmen of Compuer Science York Universiy F05 Secion A Medium Access Conrol (MAC) Topics: 1. Muliple Access Communicaions:

More information

the marginal product. Using the rule for differentiating a power function,

the marginal product. Using the rule for differentiating a power function, 3 Augu 07 Chaper 3 Derivaive ha economi ue 3 Rule for differeniaion The chain rule Economi ofen work wih funcion of variable ha are hemelve funcion of oher variable For example, conider a monopoly elling

More information

Precise Voronoi Cell Extraction of Free-form Rational Planar Closed Curves

Precise Voronoi Cell Extraction of Free-form Rational Planar Closed Curves Precise Voronoi Cell Exracion of Free-form Raional Planar Closed Curves Iddo Hanniel, Ramanahan Muhuganapahy, Gershon Elber Deparmen of Compuer Science Technion, Israel Insiue of Technology Haifa 32000,

More information

A non-stationary uniform tension controlled interpolating 4-point scheme reproducing conics

A non-stationary uniform tension controlled interpolating 4-point scheme reproducing conics A non-saionary uniform ension conrolled inerpolaing 4-poin scheme reproducing conics C. Beccari a, G. Casciola b, L. Romani b, a Deparmen of Pure and Applied Mahemaics, Universiy of Padova, Via G. Belzoni

More information

Open Access Research on an Improved Medical Image Enhancement Algorithm Based on P-M Model. Luo Aijing 1 and Yin Jin 2,* u = div( c u ) u

Open Access Research on an Improved Medical Image Enhancement Algorithm Based on P-M Model. Luo Aijing 1 and Yin Jin 2,* u = div( c u ) u Send Orders for Reprins o reprins@benhamscience.ae The Open Biomedical Engineering Journal, 5, 9, 9-3 9 Open Access Research on an Improved Medical Image Enhancemen Algorihm Based on P-M Model Luo Aijing

More information

4.1 3D GEOMETRIC TRANSFORMATIONS

4.1 3D GEOMETRIC TRANSFORMATIONS MODULE IV MCA - 3 COMPUTER GRAPHICS ADMN 29- Dep. of Compuer Science And Applicaions, SJCET, Palai 94 4. 3D GEOMETRIC TRANSFORMATIONS Mehods for geomeric ransformaions and objec modeling in hree dimensions

More information

Real Time Integral-Based Structural Health Monitoring

Real Time Integral-Based Structural Health Monitoring Real Time Inegral-Based Srucural Healh Monioring The nd Inernaional Conference on Sensing Technology ICST 7 J. G. Chase, I. Singh-Leve, C. E. Hann, X. Chen Deparmen of Mechanical Engineering, Universiy

More information

Why not experiment with the system itself? Ways to study a system System. Application areas. Different kinds of systems

Why not experiment with the system itself? Ways to study a system System. Application areas. Different kinds of systems Simulaion Wha is simulaion? Simple synonym: imiaion We are ineresed in sudying a Insead of experimening wih he iself we experimen wih a model of he Experimen wih he Acual Ways o sudy a Sysem Experimen

More information

Outline. CS38 Introduction to Algorithms 5/8/2014. Network flow. Lecture 12 May 8, 2014

Outline. CS38 Introduction to Algorithms 5/8/2014. Network flow. Lecture 12 May 8, 2014 /8/0 Ouline CS8 Inroducion o Algorihm Lecure May 8, 0 Nework flow finihing capaciy-caling analyi Edmond-Karp, blocking-flow implemenaion uni-capaciy imple graph biparie maching edge-dijoin pah aignmen

More information

4 Error Control. 4.1 Issues with Reliable Protocols

4 Error Control. 4.1 Issues with Reliable Protocols 4 Error Conrol Jus abou all communicaion sysems aemp o ensure ha he daa ges o he oher end of he link wihou errors. Since i s impossible o build an error-free physical layer (alhough some shor links can

More information

Axiomatic Foundations and Algorithms for Deciding Semantic Equivalences of SQL Queries

Axiomatic Foundations and Algorithms for Deciding Semantic Equivalences of SQL Queries Axiomaic Foundaions and Algorihms for Deciding Semanic Equivalences of SQL Queries Shumo Chu, Brendan Murphy, Jared Roesch, Alvin Cheung, Dan Suciu Paul G. Allen School of Compuer Science and Engineering

More information

Computer representations of piecewise

Computer representations of piecewise Edior: Gabriel Taubin Inroducion o Geomeric Processing hrough Opimizaion Gabriel Taubin Brown Universiy Compuer represenaions o piecewise smooh suraces have become vial echnologies in areas ranging rom

More information

An Adaptive Spatial Depth Filter for 3D Rendering IP

An Adaptive Spatial Depth Filter for 3D Rendering IP JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, VOL.3, NO. 4, DECEMBER, 23 175 An Adapive Spaial Deph Filer for 3D Rendering IP Chang-Hyo Yu and Lee-Sup Kim Absrac In his paper, we presen a new mehod

More information

Integro-differential splines and quadratic formulae

Integro-differential splines and quadratic formulae Inegro-differenial splines and quadraic formulae I.G. BUROVA, O. V. RODNIKOVA S. Peersburg Sae Universiy 7/9 Universiesaya nab., S.Persburg, 9934 Russia i.g.burova@spbu.ru, burovaig@mail.ru Absrac: This

More information

RECENT advancements in vehicular communication and

RECENT advancements in vehicular communication and Reliabiliy-oriened Opimizaion of Compuaion Offloading for Cooperaive Vehicle-Infrasrucure Sysems Jianshan Zhou, Daxin Tian, Senior Member, IEEE, Yunpeng Wang, Zhengguo Sheng, Xuing Duan, and Vicor C.M.

More information

Optimal trajectory approximation by cubic splines on fed-batch control problems

Optimal trajectory approximation by cubic splines on fed-batch control problems Opimal rajecory approximaion by cubic splines on fed-bach conrol problems A. ISMAEL F. VAZ Producion and Sysems Deparmen Minho Universiy, Engineering School aivaz@dps.uminho.p EUGÉNIO C. FERREIRA Cenro

More information

Y. Tsiatouhas. VLSI Systems and Computer Architecture Lab

Y. Tsiatouhas. VLSI Systems and Computer Architecture Lab CMOS INEGRAED CIRCUI DESIGN ECHNIQUES Universiy of Ioannina Clocking Schemes Dep. of Compuer Science and Engineering Y. siaouhas CMOS Inegraed Circui Design echniques Overview 1. Jier Skew hroughpu Laency

More information

A Formalization of Ray Casting Optimization Techniques

A Formalization of Ray Casting Optimization Techniques A Formalizaion of Ray Casing Opimizaion Techniques J. Revelles, C. Ureña Dp. Lenguajes y Sisemas Informáicos, E.T.S.I. Informáica, Universiy of Granada, Spain e-mail: [jrevelle,almagro]@ugr.es URL: hp://giig.ugr.es

More information

DAGM 2011 Tutorial on Convex Optimization for Computer Vision

DAGM 2011 Tutorial on Convex Optimization for Computer Vision DAGM 2011 Tuorial on Convex Opimizaion for Compuer Vision Par 3: Convex Soluions for Sereo and Opical Flow Daniel Cremers Compuer Vision Group Technical Universiy of Munich Graz Universiy of Technology

More information

Probabilistic Detection and Tracking of Motion Discontinuities

Probabilistic Detection and Tracking of Motion Discontinuities Probabilisic Deecion and Tracking of Moion Disconinuiies Michael J. Black David J. Flee Xerox Palo Alo Research Cener 3333 Coyoe Hill Road Palo Alo, CA 94304 fblack,fleeg@parc.xerox.com hp://www.parc.xerox.com/fblack,fleeg/

More information

! errors caused by signal attenuation, noise.!! receiver detects presence of errors:!

! errors caused by signal attenuation, noise.!! receiver detects presence of errors:! Daa Link Layer! The Daa Link layer can be furher subdivided ino:!.! Logical Link Conrol (LLC): error and flow conrol!.! Media Access Conrol (MAC): framing and media access! differen link proocols may provide

More information

Design Alternatives for a Thin Lens Spatial Integrator Array

Design Alternatives for a Thin Lens Spatial Integrator Array Egyp. J. Solids, Vol. (7), No. (), (004) 75 Design Alernaives for a Thin Lens Spaial Inegraor Array Hala Kamal *, Daniel V azquez and Javier Alda and E. Bernabeu Opics Deparmen. Universiy Compluense of

More information

Test - Accredited Configuration Engineer (ACE) Exam - PAN-OS 6.0 Version

Test - Accredited Configuration Engineer (ACE) Exam - PAN-OS 6.0 Version Tes - Accredied Configuraion Engineer (ACE) Exam - PAN-OS 6.0 Version ACE Exam Quesion 1 of 50. Which of he following saemens is NOT abou Palo Alo Neworks firewalls? Sysem defauls may be resored by performing

More information

Shortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley.

Shortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley. Shores Pah Algorihms Background Seing: Lecure I: Shores Pah Algorihms Dr Kieran T. Herle Deparmen of Compuer Science Universi College Cork Ocober 201 direced graph, real edge weighs Le he lengh of a pah

More information

Fill in the following table for the functions shown below.

Fill in the following table for the functions shown below. By: Carl H. Durney and Neil E. Coer Example 1 EX: Fill in he following able for he funcions shown below. he funcion is odd he funcion is even he funcion has shif-flip symmery he funcion has quarer-wave

More information

Autonomic Cognitive-based Data Dissemination in Opportunistic Networks

Autonomic Cognitive-based Data Dissemination in Opportunistic Networks Auonomic Cogniive-based Daa Disseminaion in Opporunisic Neworks Lorenzo Valerio, Marco Coni, Elena Pagani and Andrea Passarella IIT-CNR, Pisa, Ialy Email: {marco.coni,andrea.passarella,lorenzo.valerio}@ii.cnr.i

More information

Last Time: Curves & Surfaces. Today. Questions? Limitations of Polygonal Meshes. Can We Disguise the Facets?

Last Time: Curves & Surfaces. Today. Questions? Limitations of Polygonal Meshes. Can We Disguise the Facets? Las Time: Curves & Surfaces Expeced value and variance Mone-Carlo in graphics Imporance sampling Sraified sampling Pah Tracing Irradiance Cache Phoon Mapping Quesions? Today Moivaion Limiaions of Polygonal

More information

MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES

MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES B. MARCOTEGUI and F. MEYER Ecole des Mines de Paris, Cenre de Morphologie Mahémaique, 35, rue Sain-Honoré, F 77305 Fonainebleau Cedex, France Absrac. In image

More information

Today. Curves & Surfaces. Can We Disguise the Facets? Limitations of Polygonal Meshes. Better, but not always good enough

Today. Curves & Surfaces. Can We Disguise the Facets? Limitations of Polygonal Meshes. Better, but not always good enough Today Curves & Surfaces Moivaion Limiaions of Polygonal Models Some Modeling Tools & Definiions Curves Surfaces / Paches Subdivision Surfaces Limiaions of Polygonal Meshes Can We Disguise he Faces? Planar

More information

DEFINITION OF THE LAPLACE TRANSFORM

DEFINITION OF THE LAPLACE TRANSFORM 74 CHAPER 7 HE LAPLACE RANSFORM 7 DEFINIION OF HE LAPLACE RANSFORM REVIEW MAERIAL Improper inegral wih infinie limi of inegraio Inegraion y par and parial fracion decompoiion INRODUCION In elemenary calculu

More information

STRING DESCRIPTIONS OF DATA FOR DISPLAY*

STRING DESCRIPTIONS OF DATA FOR DISPLAY* SLAC-PUB-383 January 1968 STRING DESCRIPTIONS OF DATA FOR DISPLAY* J. E. George and W. F. Miller Compuer Science Deparmen and Sanford Linear Acceleraor Cener Sanford Universiy Sanford, California Absrac

More information

Chapter Six Chapter Six

Chapter Six Chapter Six Chaper Si Chaper Si 0 CHAPTER SIX ConcepTess and Answers and Commens for Secion.. Which of he following graphs (a) (d) could represen an aniderivaive of he funcion shown in Figure.? Figure. (a) (b) (c)

More information

FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS

FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS Mohammed A. Aseeri and M. I. Sobhy Deparmen of Elecronics, The Universiy of Ken a Canerbury Canerbury, Ken, CT2

More information

Numerical Solution of ODE

Numerical Solution of ODE Numerical Soluion of ODE Euler and Implici Euler resar; wih(deools): wih(plos): The package ploools conains more funcions for ploing, especially a funcion o draw a single line: wih(ploools): wih(linearalgebra):

More information

AML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves

AML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves AML7 CAD LECTURE Space Curves Inrinsic properies Synheic curves A curve which may pass hrough any region of hreedimensional space, as conrased o a plane curve which mus lie on a single plane. Space curves

More information

FACIAL ACTION TRACKING USING PARTICLE FILTERS AND ACTIVE APPEARANCE MODELS. Soumya Hamlaoui & Franck Davoine

FACIAL ACTION TRACKING USING PARTICLE FILTERS AND ACTIVE APPEARANCE MODELS. Soumya Hamlaoui & Franck Davoine FACIAL ACTION TRACKING USING PARTICLE FILTERS AND ACTIVE APPEARANCE MODELS Soumya Hamlaoui & Franck Davoine HEUDIASYC Mixed Research Uni, CNRS / Compiègne Universiy of Technology BP 20529, 60205 Compiègne

More information

Simultaneous Localization and Mapping with Stereo Vision

Simultaneous Localization and Mapping with Stereo Vision Simulaneous Localizaion and Mapping wih Sereo Vision Mahew N. Dailey Compuer Science and Informaion Managemen Asian Insiue of Technology Pahumhani, Thailand Email: mdailey@ai.ac.h Manukid Parnichkun Mecharonics

More information

Ray Tracing II. Improving Raytracing Speed. Improving Computational Complexity. Raytracing Computational Complexity

Ray Tracing II. Improving Raytracing Speed. Improving Computational Complexity. Raytracing Computational Complexity Ra Tracing II Iproving Raracing Speed Copuer Graphics Ra Tracing II 2005 Fabio Pellacini 1 Copuer Graphics Ra Tracing II 2005 Fabio Pellacini 2 Raracing Copuaional Coplei ra-scene inersecion is epensive

More information

TUTORING TEXTS IN MATHCAD

TUTORING TEXTS IN MATHCAD TUTORING TEXTS IN MATHCAD MIROSLAV DOLOZÍILEK and ANNA RYNDOVÁ Faculy of Mechanical Engineering, Brno Universiy of Technology Technická, 616 69 Brno, Czech Republic E-ail: irdo@fyzika.fe.vubr.cz Absrac

More information

X-Splines : A Spline Model Designed for the End-User

X-Splines : A Spline Model Designed for the End-User X-Splines : A Spline Model Designed for he End-User Carole Blanc Chrisophe Schlic LaBRI 1 cours de la libéraion, 40 alence (France) [blancjschlic]@labri.u-bordeaux.fr Absrac his paper presens a new model

More information

(Structural Time Series Models for Describing Trend in All India Sunflower Yield Using SAS

(Structural Time Series Models for Describing Trend in All India Sunflower Yield Using SAS (Srucural Time Series Models for Describing Trend in All India Sunflower Yield Using SAS Himadri Ghosh, Prajneshu and Savia Wadhwa I.A.S.R.I., Library Avenue, New Delhi-110 01 him_adri@iasri.res.in, prajnesh@iasri.res.in,

More information

Projection & Interaction

Projection & Interaction Projecion & Ineracion Algebra of projecion Canonical viewing volume rackball inerface ransform Hierarchies Preview of Assignmen #2 Lecure 8 Comp 236 Spring 25 Projecions Our lives are grealy simplified

More information

Data Structures and Algorithms. The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 2

Data Structures and Algorithms. The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 2 Daa Srucures and Algorihms The maerial for his lecure is drawn, in par, from The Pracice of Programming (Kernighan & Pike) Chaper 2 1 Moivaing Quoaion Every program depends on algorihms and daa srucures,

More information

Performance Evaluation of Implementing Calls Prioritization with Different Queuing Disciplines in Mobile Wireless Networks

Performance Evaluation of Implementing Calls Prioritization with Different Queuing Disciplines in Mobile Wireless Networks Journal of Compuer Science 2 (5): 466-472, 2006 ISSN 1549-3636 2006 Science Publicaions Performance Evaluaion of Implemening Calls Prioriizaion wih Differen Queuing Disciplines in Mobile Wireless Neworks

More information

UX260 QUICK START GUIDE

UX260 QUICK START GUIDE UX260 QUICK START GUIDE Transferring Music Playing Music Blueooh Pairing Taking a Picure/ Recording a Video www.lgusa.com Geing o Know Your Phone Camera BACK SIDE Lef Sof Key Speakerphone Key Talk Key

More information

PLCopen for efficiency in automation

PLCopen for efficiency in automation Technical Paper PLCopen Technical Commiee 2 Funcion Blocks for Moion Conrol Par 6 Fluid Power Exensions Version 2.0, Published DISCLAIMER OF WARRANTIES THIS DOCUMENT IS PROVIDED ON AN AS IS BASIS AND MAY

More information

Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons

Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons Journal of Graph Algorihms and Applicaions hp://jgaa.info/ vol. 15, no. 5, pp. 569 586 (2011) Consan-Work-Space Algorihms for Shores Pahs in Trees and Simple Polygons Tesuo Asano 1 Wolfgang Mulzer 2 Yajun

More information

Handling uncertainty in semantic information retrieval process

Handling uncertainty in semantic information retrieval process Handling uncerainy in semanic informaion rerieval process Chkiwa Mounira 1, Jedidi Anis 1 and Faiez Gargouri 1 1 Mulimedia, InfoRmaion sysems and Advanced Compuing Laboraory Sfax Universiy, Tunisia m.chkiwa@gmail.com,

More information

REDUCTIONS BBM ALGORITHMS DEPT. OF COMPUTER ENGINEERING ERKUT ERDEM. Bird s-eye view. May. 12, Reduction.

REDUCTIONS BBM ALGORITHMS DEPT. OF COMPUTER ENGINEERING ERKUT ERDEM. Bird s-eye view. May. 12, Reduction. BBM 0 - ALGORITHMS DEPT. OF COMPUTER ENGINEERING ERKUT ERDEM REDUCTIONS May., 0 Bird s-eye view Desideraa. Classify problems according o compuaional requiremens. complexiy order of growh examples linear

More information

Definition and examples of time series

Definition and examples of time series Definiion and examples of ime series A ime series is a sequence of daa poins being recorded a specific imes. Formally, le,,p be a probabiliy space, and T an index se. A real valued sochasic process is

More information

MIC2569. Features. General Description. Applications. Typical Application. CableCARD Power Switch

MIC2569. Features. General Description. Applications. Typical Application. CableCARD Power Switch CableCARD Power Swich General Descripion is designed o supply power o OpenCable sysems and CableCARD hoss. These CableCARDs are also known as Poin of Disribuion (POD) cards. suppors boh Single and Muliple

More information

MB86297A Carmine Timing Analysis of the DDR Interface

MB86297A Carmine Timing Analysis of the DDR Interface Applicaion Noe MB86297A Carmine Timing Analysis of he DDR Inerface Fujisu Microelecronics Europe GmbH Hisory Dae Auhor Version Commen 05.02.2008 Anders Ramdahl 0.01 Firs draf 06.02.2008 Anders Ramdahl

More information

MOTION DETECTORS GRAPH MATCHING LAB PRE-LAB QUESTIONS

MOTION DETECTORS GRAPH MATCHING LAB PRE-LAB QUESTIONS NME: TE: LOK: MOTION ETETORS GRPH MTHING L PRE-L QUESTIONS 1. Read he insrucions, and answer he following quesions. Make sure you resae he quesion so I don hae o read he quesion o undersand he answer..

More information