A numerical method to calculate Nash-Cournot equilibria in electricity markets. Victoria University of Wellington

Size: px
Start display at page:

Download "A numerical method to calculate Nash-Cournot equilibria in electricity markets. Victoria University of Wellington"

Transcription

1 A numerical method to calculate Nah-Cournot equilibria in electricit market Javier Contrera UCLM Ciudad Real Spain Jacek B. Krawczk Victoria Univerit of Wellington Wellington New Zealand

2 Summar Introduction Definition and concept The relaation algorithm Duopol eample Cae tud Cae tud Concluion

3 Introduction Power tem retructuring foter competition Cot minimization cheme replaced b bidding algorithm Nah Equilibria in network-contrained electricit market 3

4 Introduction Nikaido-Ioda Relaation Algorithm NIRA Convergence to a Nah-Cournot equilibrium Unique olution under certain condition NIRA olve coupled contraint game Applicable to electricit market 4

5 Definition and concept A game repreent: a et of individual interacting trategic interdependence To decribe a game ou need: plaer rule of the game outcome paoff 5

6 Definition and concept Information et: information about hi own and other plaer action. It contain information on what i obervable Strateg: A rule that tell the plaer wich action he hould take according to hi information et Action: a choice made b a plaer a a reult of hi trateg 6

7 Definition and concept i... n plaer in a game Individual action given b vector i Collective action given b vector... n X i i the action et of plaer i Ø i : X R i the paoff function X i the collective action et 7

8 Definition and concept... n and... n are element of the collective action et X An element i L i i i L of X i a et of action where the ith plaer pla i while the remaining agent pla j A point * *... n* i called the Nah equilibrium point if for each i φ i * ma * i X n φ i i 8

9 Definition and concept Nikaido-Ioda function NI: Ψ n i [ i i φi ] φ Ψ 0 Each ummand of the NI function repreent the improvement in paoff that a plaer will receive if he change hi action from i to i Each ummand can be at mot zero at Nah equilibrium 9

10 Definition and concept * An element X i referred to a Nah normalized equilibrium point if ma Ψ X Given the concavit condition a Nah normalized equilibrium i alo a Nah equilibrium point An iterative algorithm uing the NI function can converge to a Nah equilibrium * 0 0

11 Definition and concept The optimum repone function at the point i Z arg ma Ψ Z X All plaer tr to unilaterall maimize their paoff B plaing action Z rather than the plaer approach the equilibrium X

12 The relaation algorithm It i applied to the optimum repone function Given concavit condition inglevaluedne of Z and an initial etimate 0 then α α Z 0K 0 < α

13 The relaation algorithm An iterative tep i contructed a a weighted average of the improvement point Z and the current point The optimum repone function Z i a reult of maimizing the NI function The averaging enure convergence of the algorithm under certain condition 3

14 The relaation algorithm Taking a ufficient number of iteration the NIRA converge to the Nah equilibrium * The problem calculate the ucceive action taken b the plaer at each tage when optimizing their repone unilaterall 4

15 The relaation algorithm To enure convergence of NIRA the mot important condition in coupled contraint game i Diagonal Strict Concavit DSC DSC mean that each plaer ha more control over hi paoff than the other plaer have over it Coupled contraint game can be due for eample to Kirchhoff law 5

16 6 Duopol eample Two identical firm elling a product Market price: Profit made b firm i: The Nikaido-Ioda function : p ρ α i i i i p ] [ ρ λ α λ φ ] [ ] [ ] [ ] [ ρ λ α ρ λ α ρ λ α ρ λ α Ψ

17 7 Duopol eample The optimum repone function Z: ma arg X Ψ ρ λ α ; where Z ρ λ α ρ λ α

18 Duopol eample Convergence to Nah equilibrium if: Q Ψ Ψ i poitive definite 8

19 9 Duopol eample ρ Q Ψ Ψ Ψ Ψ Ψ Ψ Ψ Ψ Ψ Ψ

20 Cae tud Three-bu tem Unlimited capacit generator at bue and Demand at bue and 3 Each pair of bue connected b a tranmiion line No tranmiion line flow limit 0

21 Cae tud Demand function: p i q i *q i for bue i p 3 q *q 3 for bu 3 Generator contant marginal cot are $5/MWh and $0/MWh repectivel Bilateral market: ij mean that generator compan i ell MW to conumer at node j P fgi i the production of generator g of compan f placed at node i

22 Cae tud Each generator compan maimize profit: ale revenue generation cot ma ubject to j [ P jo P jo / Q jo fj ] kj fj k f i g C P fgi P fgi P fgi P ma fgi node i generator g j fj i g P fgi f fj q j fj P fgi 0

23 3 Cae tud Firm Firm ubject to: } 5 ] [3 ] 0.08 [40 ] 0.08 ma {[ P } 0 ] [3 ] 0.08 [40 ] 0.08 ma{[ P

24 4 Cae tud q S S q S S P q S S P q q q P P bae bae bae bae bae bae θ θ θ θ θ θ θ θ θ θ θ θ

25 Reult cae tud 5

26 Reult cae tud q 87.5 MW price $5/MWh q 87.5 MW price $5/MWh q MW price 3 $.3/MWh Flow -: MW Flow -3: MW Flow -3: 56.7 MW Profit $/h 354. Profit $/h

27 Cae tud Tranmiion line flow limit of 5 MW on line - binding contraint New contraint added to the one in cae tud : θ θ 5 θ θ 5 Sbae S bae θ θ 5 S bae 7

28 Reult cae tud 8

29 Reult cae tud 9

30 Reult cae tud q 99. MW price $4./MWh q 75.9 MW price $5.9/MWh q MW price 3 $.3/MWh Flow -: 5 MW Flow -3: 06.5 MW Flow -3: 8.5 MW Profit $/h 985 Profit $/h

31 Cae tud : contraint enforcement Aume an authorit i empowered to charge agent from deviation of the line flow limit The Lagrange multiplier of the active contraint Kirchhoff law and line flow limit calculated b NIRA can be ued to enforce contraint 3

32 Cae tud : contraint enforcement The Lagrange multiplier decouple a game where the plaer action are coupled through contraint The tep of the procedure are a follow: 3

33 Cae tud : contraint enforcement. The regulator olve a coupled contraint game i.e. compute production level which do not violate contraint and the Lagrange multiplier. The regulator modifie the plaer paoff b telling them the value of the Lagrange multiplier 3. The plaer olve the new game with new paoff and miraculoul obtain the ame production level a the regulator 33

34 Cae tud : contraint enforcement The authorit announce that for a unit of contraint violation each plaer will be charged: λ λ λ ma0 P 3 4 ma0 S ma0 S bae bae S bae θ θ θ θ 3 θ 3 θ S bae 5 S bae θ θ θ θ 3 q 3 q 34

35 Cae tud : contraint enforcement The previou etra term i added to the original individual paoff function of firm and lide 3 The ame reult a in cae i obtained without coupling contraint decoupled Nah equilibrium 35

36 Concluion A Nikaido-Ioda Relaation Algorithm to find unique Nah-Cournot equilibria with coupled contraint Either a centralized or a ditributed optimization viewpoint Application to electricit trading Enforcement of contraint decouple the problem and find the ame olution 36

37 End of the preentation Thank ou!

See chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM

See chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM Goal programming Objective of the topic: Indentify indutrial baed ituation where two or more objective function are required. Write a multi objective function model dla a goal LP Ue weighting um and preemptive

More information

Numerical Modeling of Material Discontinuity Using Mixed MLPG Collocation Method

Numerical Modeling of Material Discontinuity Using Mixed MLPG Collocation Method umerical odeling of aterial Dicontinuit Uing ied LPG Collocation ethod B. alušić 1,. Sorić 1 and T. arak 1 Abtract A mied LPG collocation method i applied for the modeling of material dicontinuit in heterogeneou

More information

DAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications

DAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu

More information

AN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROBLEM

AN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROBLEM RAC Univerity Journal, Vol IV, No, 7, pp 87-9 AN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROLEM Mozzem Hoain Department of Mathematic Ghior Govt

More information

SLA Adaptation for Service Overlay Networks

SLA Adaptation for Service Overlay Networks SLA Adaptation for Service Overlay Network Con Tran 1, Zbigniew Dziong 1, and Michal Pióro 2 1 Department of Electrical Engineering, École de Technologie Supérieure, Univerity of Quebec, Montréal, Canada

More information

Planning of scooping position and approach path for loading operation by wheel loader

Planning of scooping position and approach path for loading operation by wheel loader 22 nd International Sympoium on Automation and Robotic in Contruction ISARC 25 - September 11-14, 25, Ferrara (Italy) 1 Planning of cooping poition and approach path for loading operation by wheel loader

More information

Performance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks

Performance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity

More information

A Practical Model for Minimizing Waiting Time in a Transit Network

A Practical Model for Minimizing Waiting Time in a Transit Network A Practical Model for Minimizing Waiting Time in a Tranit Network Leila Dianat, MASc, Department of Civil Engineering, Sharif Univerity of Technology, Tehran, Iran Youef Shafahi, Ph.D. Aociate Profeor,

More information

Motion Control (wheeled robots)

Motion Control (wheeled robots) 3 Motion Control (wheeled robot) Requirement for Motion Control Kinematic / dynamic model of the robot Model of the interaction between the wheel and the ground Definition of required motion -> peed control,

More information

Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.

Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart. Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut

More information

Timber Technology(Product) Pencil Box Unit Outline

Timber Technology(Product) Pencil Box Unit Outline HOLY CROSS COLLEGE YEAR 7 TECHNOLOGY (Cla: 7.. 7.7) Timber Technology(Product) Pencil Box Unit Outline Aement Tak No: Date Iued: Due Date: Weighting Total Mark Written and Practical Week T3 //7 % 7 SUBMISSION

More information

IMPROVED JPEG DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION. Tak-Shing Wong, Charles A. Bouman, and Ilya Pollak

IMPROVED JPEG DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION. Tak-Shing Wong, Charles A. Bouman, and Ilya Pollak IMPROVED DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION Tak-Shing Wong, Charle A. Bouman, and Ilya Pollak School of Electrical and Computer Engineering Purdue Univerity ABSTRACT We propoe

More information

EVen though remarkable progress has been made in

EVen though remarkable progress has been made in JOURNAL OF L A T E X CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 1 Dene Semantic 3D Recontruction Chritian Häne, Chritopher Zach, Andrea Cohen, and Marc Pollefey, Fellow, IEEE Abtract Both image egmentation

More information

NIRA-3: An improved MATLAB package for finding Nash equilibria in infinite games

NIRA-3: An improved MATLAB package for finding Nash equilibria in infinite games MPRA Munich Personal RePEc Archive NIRA-3: An improved MATLAB package for finding Nash equilibria in infinite games Jacek Krawczyk and James Zuccollo Victoria University of Wellington December 2006 Online

More information

Factor Graphs and Inference

Factor Graphs and Inference Factor Graph and Inerence Sargur Srihari rihari@cedar.bualo.edu 1 Topic 1. Factor Graph 1. Factor in probability ditribution. Deriving them rom graphical model. Eact Inerence Algorithm or Tree graph 1.

More information

PROBLEM -1. where S. C basis x. 0, for entering

PROBLEM -1. where S. C basis x. 0, for entering ISSN: 77754 ISO 9:8 Certified Volume 4 Iue 8 February 5 Optimum Solution of Linear Programming Problem by New Method Putta aburao; Supriya N. Khobragade and N.W.Khobragade Department of Mathematic RTM

More information

( ) subject to m. e (2) L are 2L+1. = s SEG SEG Las Vegas 2012 Annual Meeting Page 1

( ) subject to m. e (2) L are 2L+1. = s SEG SEG Las Vegas 2012 Annual Meeting Page 1 A new imultaneou ource eparation algorithm uing frequency-divere filtering Ying Ji*, Ed Kragh, and Phil Chritie, Schlumberger Cambridge Reearch Summary We decribe a new imultaneou ource eparation algorithm

More information

Compressed Sensing Image Processing Based on Stagewise Orthogonal Matching Pursuit

Compressed Sensing Image Processing Based on Stagewise Orthogonal Matching Pursuit Senor & randucer, Vol. 8, Iue 0, October 204, pp. 34-40 Senor & randucer 204 by IFSA Publihing, S. L. http://www.enorportal.com Compreed Sening Image Proceing Baed on Stagewie Orthogonal Matching Puruit

More information

IMPLEMENTATION OF AREA, VOLUME AND LINE SOURCES

IMPLEMENTATION OF AREA, VOLUME AND LINE SOURCES December 01 ADMS 5 P503I1 IMPEMENTATION OF AREA, VOUME AND INE SOURCES The Met. Office (D J Thomon) and CERC 1. INTRODUCTION ADMS model line ource, and area and volume ource with conve polgon bae area.

More information

Spatio-Temporal Monitoring using Contours in Large-scale Wireless Sensor Networks

Spatio-Temporal Monitoring using Contours in Large-scale Wireless Sensor Networks Spatio-Temporal Monitoring uing Contour in Large-cale Wirele Senor Network Hadi Alati Electrical and Computer Engineering Univerit of North Carolina at Charlotte 9 Univerit Cit Boulevard, Charlotte, NC

More information

A System Dynamics Model for Transient Availability Modeling of Repairable Redundant Systems

A System Dynamics Model for Transient Availability Modeling of Repairable Redundant Systems International Journal of Performability Engineering Vol., No. 3, May 05, pp. 03-. RAMS Conultant Printed in India A Sytem Dynamic Model for Tranient Availability Modeling of Repairable Redundant Sytem

More information

Drawing Lines in 2 Dimensions

Drawing Lines in 2 Dimensions Drawing Line in 2 Dimenion Drawing a traight line (or an arc) between two end point when one i limited to dicrete pixel require a bit of thought. Conider the following line uperimpoed on a 2 dimenional

More information

Localized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks

Localized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks Localized Minimum Spanning Tree Baed Multicat Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Senor Network Hanne Frey Univerity of Paderborn D-3398 Paderborn hanne.frey@uni-paderborn.de

More information

MAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc

MAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic

More information

3D SMAP Algorithm. April 11, 2012

3D SMAP Algorithm. April 11, 2012 3D SMAP Algorithm April 11, 2012 Baed on the original SMAP paper [1]. Thi report extend the tructure of MSRF into 3D. The prior ditribution i modified to atify the MRF property. In addition, an iterative

More information

Supplemental Problems MAT (Prepared by Prof. Urmi Ghosh-Dastidar)

Supplemental Problems MAT (Prepared by Prof. Urmi Ghosh-Dastidar) Supplemental Problems MAT 3770 (Prepared by Prof. Urmi Ghosh-Dastidar) 1. Use Lagrange Multiplier methods to find the stationary values of z: (a) z = y, subject to + y = (b) z = (y+4), subject to + y =

More information

Cutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck.

Cutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck. Cutting Stock by Iterated Matching Andrea Fritch, Oliver Vornberger Univerity of Onabruck Dept of Math/Computer Science D-4909 Onabruck andy@informatikuni-onabrueckde Abtract The combinatorial optimization

More information

Laboratory Exercise 6

Laboratory Exercise 6 Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in VHL and implemented

More information

Design of a Stewart Platform for General Machining Using Magnetic Bearings

Design of a Stewart Platform for General Machining Using Magnetic Bearings eign of a Stewart Platform for eneral Machining Uing Magnetic earing Jeff Pieper epartment of Mechanical and Manufacturing Engineering Univerity of algary algary lberta anada N N4 pieper@ucalgary.ca Preented

More information

Laboratory Exercise 6

Laboratory Exercise 6 Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in Verilog and implemented

More information

ES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK

ES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK ES05 Analyi and Deign of Engineering Sytem: Lab : An Introductory Tutorial: Getting Started with SIMULINK What i SIMULINK? SIMULINK i a oftware package for modeling, imulating, and analyzing dynamic ytem.

More information

Resource Auto-Scaling and Sparse Content Replication for Video Storage Systems

Resource Auto-Scaling and Sparse Content Replication for Video Storage Systems 1 Reource Auto-Scaling and Spare Content Replication for Video Storage Sytem DI NIU 1, HONG XU 2 and BAOCHUN LI 3, Univerity of Alberta 1, City Univerity of Hong Kong 2, Univerity of Toronto 3 Many video-on-demand

More information

Laboratory Exercise 6

Laboratory Exercise 6 Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two

More information

A note on degenerate and spectrally degenerate graphs

A note on degenerate and spectrally degenerate graphs A note on degenerate and pectrally degenerate graph Noga Alon Abtract A graph G i called pectrally d-degenerate if the larget eigenvalue of each ubgraph of it with maximum degree D i at mot dd. We prove

More information

UC Berkeley International Conference on GIScience Short Paper Proceedings

UC Berkeley International Conference on GIScience Short Paper Proceedings UC Berkeley International Conference on GIScience Short Paper Proceeding Title A novel method for probabilitic coverage etimation of enor network baed on 3D vector repreentation in complex urban environment

More information

An Intro to LP and the Simplex Algorithm. Primal Simplex

An Intro to LP and the Simplex Algorithm. Primal Simplex An Intro to LP and the Simplex Algorithm Primal Simplex Linear programming i contrained minimization of a linear objective over a olution pace defined by linear contraint: min cx Ax b l x u A i an m n

More information

Contents. shortest paths. Notation. Shortest path problem. Applications. Algorithms and Networks 2010/2011. In the entire course:

Contents. shortest paths. Notation. Shortest path problem. Applications. Algorithms and Networks 2010/2011. In the entire course: Content Shortet path Algorithm and Network 21/211 The hortet path problem: Statement Verion Application Algorithm (for ingle ource p problem) Reminder: relaxation, Dijktra, Variant of Dijktra, Bellman-Ford,

More information

The Eigenstep Method: An Iterative Method for Unconstrained Quadratic Optimization

The Eigenstep Method: An Iterative Method for Unconstrained Quadratic Optimization American Journal of Operational Reearch, (: 57-6 DOI: 59/jajor5 he Eientep Method: An Iterative Method for Uncontrained Quadratic Optimization John P Battalia Department of Mathematic and Statitic,Windor

More information

Markov Random Fields in Image Segmentation

Markov Random Fields in Image Segmentation Preented at SSIP 2011, Szeged, Hungary Markov Random Field in Image Segmentation Zoltan Kato Image Proceing & Computer Graphic Dept. Univerity of Szeged Hungary Zoltan Kato: Markov Random Field in Image

More information

Introduction to PET Image Reconstruction. Tomographic Imaging. Projection Imaging. PET Image Reconstruction 11/6/07

Introduction to PET Image Reconstruction. Tomographic Imaging. Projection Imaging. PET Image Reconstruction 11/6/07 Introduction to PET Image Recontruction Adam Aleio Nuclear Medicine Lecture Imaging Reearch Laboratory Diviion of Nuclear Medicine Univerity of Wahington Fall 2007 http://dept.wahington.edu/nucmed/irl/education.html

More information

Brief Announcement: Distributed 3/2-Approximation of the Diameter

Brief Announcement: Distributed 3/2-Approximation of the Diameter Brief Announcement: Ditributed /2-Approximation of the Diameter Preliminary verion of a brief announcement to appear at DISC 14 Stephan Holzer MIT holzer@mit.edu David Peleg Weizmann Intitute david.peleg@weizmann.ac.il

More information

KINEMATIC BENDING OF FIXED-HEAD PILES IN NON- HOMOGENEOUS SOIL

KINEMATIC BENDING OF FIXED-HEAD PILES IN NON- HOMOGENEOUS SOIL KINEMATIC BENDING OF FIXED-HEAD PILES IN NON- HOMOGENEOUS SOIL Raffaele Di Laora Univerity of Napoli Parthenope raffaele.dilaora@uniparthenope.it Emmanouil Rovithi Intitute of Engineering Seimology and

More information

Distributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router

Distributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To

More information

The norm Package. November 15, Title Analysis of multivariate normal datasets with missing values

The norm Package. November 15, Title Analysis of multivariate normal datasets with missing values The norm Package November 15, 2003 Verion 1.0-9 Date 2002/05/06 Title Analyi of multivariate normal dataet with miing value Author Ported to R by Alvaro A. Novo . Original by Joeph

More information

Z-transformation in simulation of continuous system

Z-transformation in simulation of continuous system Z-tranformation in imulation of continuou tem Mirolav Kašpar, Alexandr Štefek Univerit of defence Abtract Motl ued method for continuou tem imulation i uing algorithm for numeric olving of differential

More information

CS 467/567: Divide and Conquer on the PRAM

CS 467/567: Divide and Conquer on the PRAM CS 467/567: Divide and Conquer on the PRAM Stefan D. Bruda Winter 2017 BINARY SEARCH Problem: Given a equence S 1..n orted in nondecreaing order and a value x, find the ubcript k uch that S i x If n proceor

More information

Development of an atmospheric climate model with self-adapting grid and physics

Development of an atmospheric climate model with self-adapting grid and physics Intitute of Phyic Publihing Journal of Phyic: Conference Serie 16 (2005) 353 357 doi:10.1088/1742-6596/16/1/049 SciDAC 2005 Development of an atmopheric climate model with elf-adapting grid and phyic Joyce

More information

Anisotropic filtering on normal field and curvature tensor field using optimal estimation theory

Anisotropic filtering on normal field and curvature tensor field using optimal estimation theory Aniotropic filtering on normal field and curvature tenor field uing optimal etimation theory Min Liu Yuhen Liu and Karthik Ramani Purdue Univerity, Wet Lafayette, Indiana, USA Email: {liu66 liu28 ramani}@purdue.edu

More information

A Multi-objective Genetic Algorithm for Reliability Optimization Problem

A Multi-objective Genetic Algorithm for Reliability Optimization Problem International Journal of Performability Engineering, Vol. 5, No. 3, April 2009, pp. 227-234. RAMS Conultant Printed in India A Multi-objective Genetic Algorithm for Reliability Optimization Problem AMAR

More information

Laboratory Exercise 6

Laboratory Exercise 6 Laboratory Exercie 6 Adder, Subtractor, and Multiplier a a The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each b c circuit will be decribed in Verilog

More information

On the VINS Resource-Allocation Problem for a Dual-Camera, Small-Size Quadrotor

On the VINS Resource-Allocation Problem for a Dual-Camera, Small-Size Quadrotor On the VINS Reource-Allocation Problem or a Dual-Camera, Small-Size Quadrotor Kejian J. Wu (B), Tien Do, Lui C. Carrillo-Arce, and Stergio I. Roumelioti MARS Lab, Univerity o Minneota, Minneapoli, MN 55455,

More information

Delaunay Triangulation: Incremental Construction

Delaunay Triangulation: Incremental Construction Chapter 6 Delaunay Triangulation: Incremental Contruction In the lat lecture, we have learned about the Lawon ip algorithm that compute a Delaunay triangulation of a given n-point et P R 2 with O(n 2 )

More information

Topics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X

Topics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X Lecture 37: Global Optimization [Adapted from note by R. Bodik and G. Necula] Topic Global optimization refer to program optimization that encompa multiple baic block in a function. (I have ued the term

More information

Correlation Models for Shadow Fading Simulation

Correlation Models for Shadow Fading Simulation Correlation Model for Shadow Fading Simulation IEEE 80.6 Preentation Submiion Template (Rev. 8.3) Document Number: IEEE S80.6m-07/060 Date Submitted: 007-03-3 Source: I-Kang Fu, Chi-Fang Li, E-mail: IKFu@itri.org.tw

More information

Web Science and additionality

Web Science and additionality Admin tuff... Lecture 1: EITN01 Web Intelligence and Information Retrieval Meage, lide, handout, lab manual and link: http://www.eit.lth.e/coure/eitn01 Contact: Ander Ardö, Ander.Ardo@eit.lth.e, room:

More information

Multiconstrained QoS Routing: Greedy is Good

Multiconstrained QoS Routing: Greedy is Good Multicontrained QoS Routing: Greed i Good Guoliang Xue and Weii Zhang Abtract A fundamental problem in qualit-of-ervice (QoS) routing i to find a path connecting a ource node to a detination node that

More information

Modeling of underwater vehicle s dynamics

Modeling of underwater vehicle s dynamics Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation

More information

Chapter 13 Non Sampling Errors

Chapter 13 Non Sampling Errors Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption

More information

Texture-Constrained Active Shape Models

Texture-Constrained Active Shape Models 107 Texture-Contrained Active Shape Model Shuicheng Yan, Ce Liu Stan Z. Li Hongjiang Zhang Heung-Yeung Shum Qianheng Cheng Microoft Reearch Aia, Beijing Sigma Center, Beijing 100080, China Dept. of Info.

More information

Embedding Service Function Tree with Minimum Cost for NFV Enabled Multicast

Embedding Service Function Tree with Minimum Cost for NFV Enabled Multicast 1 Embedding Service Function Tree with Minimum ot for NFV Enabled Multicat angbang Ren, Student Member, IEEE, eke Guo, Senior Member, IEEE, Yulong Shen, Member, IEEE, Guoming Tang, Member, IEEE, Xu Lin,

More information

Distributed Media-Aware Rate Allocation for Video Multicast over Wireless Networks

Distributed Media-Aware Rate Allocation for Video Multicast over Wireless Networks Ditributed Media-Aware Rate Allocation for Video Multicat over Wirele Network Xiaoqing Zhu, Thoma Schierl, Thoma Wiegand, Senior Member, IEEE, and Bernd Girod, Fellow, IEEE Abtract A unified optimization

More information

KS3 Maths Assessment Objectives

KS3 Maths Assessment Objectives KS3 Math Aement Objective Tranition Stage 9 Ratio & Proportion Probabilit y & Statitic Appreciate the infinite nature of the et of integer, real and rational number Can interpret fraction and percentage

More information

np vp cost = 0 cost = c np vp cost = c I replacing term cost = c+c n cost = c * Error detection Error correction pron det pron det n gi

np vp cost = 0 cost = c np vp cost = c I replacing term cost = c+c n cost = c * Error detection Error correction pron det pron det n gi Spoken Language Paring with Robutne and ncrementality Yohihide Kato, Shigeki Matubara, Katuhiko Toyama and Yauyohi nagaki y Graduate School of Engineering, Nagoya Univerity y Faculty of Language and Culture,

More information

[N309] Feedforward Active Noise Control Systems with Online Secondary Path Modeling. Muhammad Tahir Akhtar, Masahide Abe, and Masayuki Kawamata

[N309] Feedforward Active Noise Control Systems with Online Secondary Path Modeling. Muhammad Tahir Akhtar, Masahide Abe, and Masayuki Kawamata he 32nd International Congre and Expoition on Noie Control Engineering Jeju International Convention Center, Seogwipo, Korea, Augut 25-28, 2003 [N309] Feedforward Active Noie Control Sytem with Online

More information

A Hybrid Deployable Dynamic Traffic Assignment Framework for Robust Online Route Guidance

A Hybrid Deployable Dynamic Traffic Assignment Framework for Robust Online Route Guidance A Hybrid Deployable Dynamic Traffic Aignment Framework for Robut Online Route Guidance Sriniva Peeta School of Civil Engineering, Purdue Univerity Chao Zhou Sabre, Inc. Sriniva Peeta School of Civil Engineering

More information

The development of the South African ehealth Strategy assessed against the recommendations of the WHO/ITU ehealth Strategy Toolkit

The development of the South African ehealth Strategy assessed against the recommendations of the WHO/ITU ehealth Strategy Toolkit The development of the South African ehealth Strategy aeed againt the recommendation of the WHO/ITU ehealth Strategy Toolkit Roemary Foter PhD a,b a ehealth Strategy and Policy Diviion, Medical Reearch

More information

CSE 250B Assignment 4 Report

CSE 250B Assignment 4 Report CSE 250B Aignment 4 Report March 24, 2012 Yuncong Chen yuncong@c.ucd.edu Pengfei Chen pec008@ucd.edu Yang Liu yal060@c.ucd.edu Abtract In thi project, we implemented the recurive autoencoder (RAE) a decribed

More information

Analysis of the results of analytical and simulation With the network model and dynamic priority Unchecked Buffer

Analysis of the results of analytical and simulation With the network model and dynamic priority Unchecked Buffer International Reearch Journal of Applied and Baic Science 218 Available online at www.irjab.com ISSN 2251-838X / Vol, 12 (1): 49-53 Science Explorer Publication Analyi of the reult of analytical and imulation

More information

Joint Congestion Control and Media Access Control Design for Ad Hoc Wireless Networks

Joint Congestion Control and Media Access Control Design for Ad Hoc Wireless Networks Joint Congetion Control and Media Acce Control Deign for Ad Hoc Wirele Network Lijun Chen, Steven H. Low and John C. Doyle Engineering & Applied Science Diviion, California Intitute of Technology Paadena,

More information

3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES

3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES MAKARA, TEKNOLOGI, VOL. 9, NO., APRIL 5: 3-35 3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES Mochammad Zulianyah Informatic Engineering, Faculty of Engineering, ARS International Univerity,

More information

Service and Network Management Interworking in Future Wireless Systems

Service and Network Management Interworking in Future Wireless Systems Service and Network Management Interworking in Future Wirele Sytem V. Tountopoulo V. Stavroulaki P. Demeticha N. Mitrou and M. Theologou National Technical Univerity of Athen Department of Electrical Engineering

More information

Mechanical Design and Kinematics Analysis of a Hydraulically Actuated Manipulator

Mechanical Design and Kinematics Analysis of a Hydraulically Actuated Manipulator Send Order for Reprint to reprint@benthamcience.net The Open Mechanical Engineering Journal 0 8 7-7 Open Acce Mechanical Deign and Kinematic Anali of a Hdraulicall Actuated Manipulator Xuewen Rong Rui

More information

Stochastic Search and Graph Techniques for MCM Path Planning Christine D. Piatko, Christopher P. Diehl, Paul McNamee, Cheryl Resch and I-Jeng Wang

Stochastic Search and Graph Techniques for MCM Path Planning Christine D. Piatko, Christopher P. Diehl, Paul McNamee, Cheryl Resch and I-Jeng Wang Stochatic Search and Graph Technique for MCM Path Planning Chritine D. Piatko, Chritopher P. Diehl, Paul McNamee, Cheryl Rech and I-Jeng Wang The John Hopkin Univerity Applied Phyic Laboratory, Laurel,

More information

Performance Assessment of Search Management Agent under Asymmetrical Problems and Control Design Applications

Performance Assessment of Search Management Agent under Asymmetrical Problems and Control Design Applications Performance Aement of Search Management Agent under Ammetrical Problem and Control Deign Application Jukkrit Kluabwang Deacha Puangdownreong and Sarawut Sujitjorn * School of Electrical Engineering, Intitute

More information

Minimum Energy Reliable Paths Using Unreliable Wireless Links

Minimum Energy Reliable Paths Using Unreliable Wireless Links Minimum Energy Reliable Path Uing Unreliable Wirele Link Qunfeng Dong Department of Computer Science Univerity of Wiconin-Madion Madion, Wiconin 53706 qunfeng@c.wic.edu Micah Adler Department of Computer

More information

Diverse: Application-Layer Service Differentiation in Peer-to-Peer Communications

Diverse: Application-Layer Service Differentiation in Peer-to-Peer Communications Divere: Application-Layer Service Differentiation in Peer-to-Peer Communication Chuan Wu, Student Member, IEEE, Baochun Li, Senior Member, IEEE Department of Electrical and Computer Engineering Univerity

More information

1.1 What is Microeconomics?

1.1 What is Microeconomics? 1.1 What is Microeconomics? Economics is the study of allocating limited resources to satisfy unlimited wants. Such a tension implies tradeoffs among competing goals. The analysis can be carried out at

More information

A study on turbo decoding iterative algorithms

A study on turbo decoding iterative algorithms Buletinul Ştiinţific al Univerităţii "Politehnica" din Timişoara Seria ELECTRONICĂ şi TELECOMUNICAŢII TRANSACTIONS on ELECTRONICS and COMMUNICATIONS Tom 49(63, Facicola 2, 2004 A tudy on turbo decoding

More information

Maneuverable Relays to Improve Energy Efficiency in Sensor Networks

Maneuverable Relays to Improve Energy Efficiency in Sensor Networks Maneuverable Relay to Improve Energy Efficiency in Senor Network Stephan Eidenbenz, Luka Kroc, Jame P. Smith CCS-5, MS M997; Lo Alamo National Laboratory; Lo Alamo, NM 87545. Email: {eidenben, kroc, jpmith}@lanl.gov

More information

Distributed Partial Information Management (DPIM) Schemes for Survivable Networks - Part II

Distributed Partial Information Management (DPIM) Schemes for Survivable Networks - Part II IEEE INFOCO 2002 1 Ditributed Partial Information anagement (DPI) Scheme for Survivable Network - Part II Dahai Xu Chunming Qiao Department of Computer Science and Engineering State Univerity of New York

More information

Routing Definition 4.1

Routing Definition 4.1 4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing

More information

HOMEWORK #3 BME 473 ~ Applied Biomechanics Due during Week #10

HOMEWORK #3 BME 473 ~ Applied Biomechanics Due during Week #10 HOMEWORK #3 BME 473 ~ Applied Biomechanic Due during Week #1 1. We dicued different angle et convention in cla. One common convention i a Bod-fied X-Y-Z rotation equence. With thi convention, the B frame

More information

Modelling the impact of cyber attacks on the traffic control centre of an urban automobile transport system by means of enhanced cybersecurity

Modelling the impact of cyber attacks on the traffic control centre of an urban automobile transport system by means of enhanced cybersecurity Modelling the impact of cyber attack on the traffic control centre of an urban automobile tranport ytem by mean of enhanced cyberecurity Yoana Ivanova 1,* 1 Bulgarian Academy of Science, Intitute of ICT,

More information

CERIAS Tech Report EFFICIENT PARALLEL ALGORITHMS FOR PLANAR st-graphs. by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daescu

CERIAS Tech Report EFFICIENT PARALLEL ALGORITHMS FOR PLANAR st-graphs. by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daescu CERIAS Tech Report 2003-15 EFFICIENT PARALLEL ALGORITHMS FOR PLANAR t-graphs by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daecu Center for Education and Reearch in Information Aurance and Security,

More information

Vertical Handover Decision Strategies A double-sided auction approach

Vertical Handover Decision Strategies A double-sided auction approach Vertical Handover Decision Strategies A double-sided auction approach Working paper Hoang-Hai TRAN Ph.d student DIONYSOS Team INRIA Rennes - Bretagne Atlantique 1 Content Introduction Handover in heterogeneous

More information

Resource Allocation in Multi-Radio Multi-Channel Multi-Hop Wireless Networks

Resource Allocation in Multi-Radio Multi-Channel Multi-Hop Wireless Networks Reource Allocation in Multi-Radio Multi-Channel Multi-Hop Wirele Network Technical Report (July 2007) Simone Merlin, Nitin Vaidya, Michele Zorzi Padova Univerity, DEI, Padova, Italy; Univerity of Illinoi

More information

Focused Video Estimation from Defocused Video Sequences

Focused Video Estimation from Defocused Video Sequences Focued Video Etimation from Defocued Video Sequence Junlan Yang a, Dan Schonfeld a and Magdi Mohamed b a Multimedia Communication Lab, ECE Dept., Univerity of Illinoi, Chicago, IL b Phyical Realization

More information

A SIMPLE IMPERATIVE LANGUAGE THE STORE FUNCTION NON-TERMINATING COMMANDS

A SIMPLE IMPERATIVE LANGUAGE THE STORE FUNCTION NON-TERMINATING COMMANDS A SIMPLE IMPERATIVE LANGUAGE Eventually we will preent the emantic of a full-blown language, with declaration, type and looping. However, there are many complication, o we will build up lowly. Our firt

More information

Optimal Peer-to-Peer Technique for Massive Content Distribution

Optimal Peer-to-Peer Technique for Massive Content Distribution 1 Optimal Peer-to-Peer Technique for Maive Content Ditribution Xiaoying Zheng, Chunglae Cho and Ye Xia Computer and Information Science and Engineering Department Univerity of Florida Email: {xiazheng,

More information

Minimum congestion spanning trees in bipartite and random graphs

Minimum congestion spanning trees in bipartite and random graphs Minimum congetion panning tree in bipartite and random graph M.I. Otrovkii Department of Mathematic and Computer Science St. John Univerity 8000 Utopia Parkway Queen, NY 11439, USA e-mail: otrovm@tjohn.edu

More information

Multi-Target Tracking In Clutter

Multi-Target Tracking In Clutter Multi-Target Tracking In Clutter John N. Sander-Reed, Mary Jo Duncan, W.B. Boucher, W. Michael Dimmler, Shawn O Keefe ABSTRACT A high frame rate (0 Hz), multi-target, video tracker ha been developed and

More information

5/3/2010Z:\ jeh\self\notes.doc\7 Chapter 7 Graphical models and belief propagation Graphical models and belief propagation

5/3/2010Z:\ jeh\self\notes.doc\7 Chapter 7 Graphical models and belief propagation Graphical models and belief propagation //00Z:\ jeh\self\notes.doc\7 Chapter 7 Graphical models and belief propagation 7. Graphical models and belief propagation Outline graphical models Bayesian networks pair wise Markov random fields factor

More information

A Unicast-based Approach for Streaming Multicast

A Unicast-based Approach for Streaming Multicast A Unicat-baed Approach for Streaming Multicat Reuven Cohen and Gideon Kaempfer Department of Computer Science Technion, Haifa 32000, Irael Abtract Network layer multicat i know a the mot efficient way

More information

Connected Placement of Disaster Shelters in Modern Cities

Connected Placement of Disaster Shelters in Modern Cities Connected Placement of Diater Shelter in Modern Citie Huanyang Zheng and Jie Wu Department of Computer and Information Science Temple Univerity, USA {huanyang.zheng, jiewu}@temple.edu ABSTRACT Thi paper

More information

E-APPLAB #1

E-APPLAB #1 E-APPLAB-93-069850 #1 Ultrafat tomography experiment etup at D-1 Beamline at CHESS The experiment etup conit of three major part: x-ray ource, injection chambe and detecto a hown chematically in Fig. EPAPS1a.

More information

x y z Design variable positions A

x y z Design variable positions A COMMUNICATIONS IN NUMERICAL METHODS IN ENGINEERING Commun. Numer. Meth. Engng 2001 00:1{7 [Verion: 2000/03/22 v1.0] A tabilied peudo-hell approach for urface parametriation in CFD deign problem O. Soto,R.Lohner

More information

Frequency Domain Identification of Structural Dynamics Using the Pole/Residue Parametrization.

Frequency Domain Identification of Structural Dynamics Using the Pole/Residue Parametrization. Frequency Domain Identification of Structural Dynamic Uing the Pole/eidue Parametrization. Etienne Balmè (DE / AC) OEA, Structure Direction ABSAC he pole/reidue parametrization ha been traditionally ued

More information

An Algebraic Approach to Adaptive Scalable Overlay Network Monitoring

An Algebraic Approach to Adaptive Scalable Overlay Network Monitoring An Algebraic Approach to Adaptive Scalable Overlay Network Monitoring ABSTRACT Overlay network monitoring enable ditributed Internet application to detect and recover from path outage and period of degraded

More information

mapping reult. Our experiment have revealed that for many popular tream application, uch a networking and multimedia application, the number of VC nee

mapping reult. Our experiment have revealed that for many popular tream application, uch a networking and multimedia application, the number of VC nee Reolving Deadlock for Pipelined Stream Application on Network-on-Chip Xiaohang Wang 1,2, Peng Liu 1 1 Department of Information Science and Electronic Engineering, Zheiang Univerity Hangzhou, Zheiang,

More information

Research Article Longest Path Reroute to Optimize the Optical Multicast Routing in Sparse Splitting WDM Networks

Research Article Longest Path Reroute to Optimize the Optical Multicast Routing in Sparse Splitting WDM Networks International Optic Volume 0, Article ID 9, page http://dxdoiorg/0/0/9 Reearch Article Longet Path Reroute to Optimize the Optical Multicat Routing in Spare Splitting WDM Network Huanlin Liu, Hongyue Dai,

More information