Transfer Capability Computations in Deregulated Power Systems

Size: px
Start display at page:

Download "Transfer Capability Computations in Deregulated Power Systems"

Transcription

1 Proceedngs of the rd Hawa Internatonal Conference on System Scences ransfer Capablty Computatons n Deregulated Power Systems Mohamed Shaaban (St. M. IEEE Yxn N (S. M. IEEE Felx F. Wu ( Fellow, IEEE Center for Electrcal Energy Systems Department of Electrcal and Electroncs Engneerng he Unversty of Hong Kong Hong Kong ABSRAC Wth the recent trend towards deregulatng power systems around the world, transfer capablty computaton emerges as the ey ssue to a smoothly runnng power maret wth multple transactons. otal transfer Capablty (C s the basc measure for evaluatng Avalable transfer capablty (AC. hs paper presents the calculaton of C through an optmal power flow approach. he obectve functon s to mze the sum of the sendng end-end generaton and recevng-end load of specfed buses. he constrants are ac power flow equatons and system operaton lmts. Sequental Quadratc Programmng (SQP method s used for the optmzaton process. IEEE 0 bus system s used for testng the proposed algorthm and the results compared favorably wth that from the Contnuaton Power Flow (CPF method. Keywords: Electrc power deregulaton, total transfer capablty, optmal power flow.. INRODUCION he concept of compettve ndustres rather than regulated ones has become promnent n the past few years. Economsts and poltcal analysts have promoted the dea that free marets can drve down costs and prces thus reducng neffcences n power producton. hs change n the clmate of deas has fostered regulators to ntate reforms to restructure the electrcty ndustry to acheve better servce, relable operaton, and compettve rates. Deregulaton of the power ndustry was frst ntated n Unted Kngdom, followed sut n Norway and Australa. he U.S. electrcty ndustry has reportedly taen the plunge towards deregulaton. he Federal Energy Regulatory Commsson (FERC, recognzng the centralty of open transmsson to real competton, has mandated that transmsson must be open to all comers. FERC, n conuncton wth North Amercan Electrc Relablty Councl (NERC, endorsed the exchange of transmsson servce nformaton through Open Access Same-me Informaton Networ (OASIS. One of the man functons of the OASIS s to post Avalable ransfer Capablty (AC nformaton [] Avalable transfer capablty (AC s the measure of the ablty of nterconnected electrc systems to relably move or transfer power from one area to another over all transmsson lnes or paths between those areas under specfed system condtons. It s clear that AC nformaton s sgnfcant to the secure operaton of deregulated power systems as t reflects physcal realtes of the transmsson system such as customer demand level, networ paradgm, generaton dspatch and transfer between neghborng systems. In order to obtan AC, the total transfer capablty (C should be evaluated frst where C s the largest flow through selected nterfaces or corrdors of the transmsson networ whch causes no thermal overloads, voltage lmt volatons, voltage collapse or any other system problems such as transent stablty. Other parameters nvolved n AC calculatons are the ransmsson Relablty Margn (RM and Capacty Beneft Margn (CBM []. However, snce dedcated methodologes for determnng RM and CBM may vary among regons, sub-regons, and power pools, ths paper addresses the calculaton of C as the bass of AC evaluaton. One of the most common approaches for transfer capablty calculatons s the contnuaton power flow (CPF [, ]. CPF s a general method for fndng the mum value of a scalar parameter n a lnear functon of changes n nectons at a set of buses n a power flow problem. In prncple, CPF ncreases the loadng factor n dscrete steps and solves the resultng power flow problem at each step. CPF yelds solutons at voltage collapse ponts. However, snce CPF gnores the optmal dstrbuton of the generaton and the /00 $0 (c 000 IEEE

2 Proceedngs of the rd Hawa Internatonal Conference on System Scences loadng together wth the system reactve power, t can gve conservatve transfer capablty results. hs paper features an OPF-based procedure for calculatng the total transfer capablty (C. he method s based on full AC power flow soluton whch accurately determnes reactve power flow, and voltage lmts as well as the lne flow effect. he obectve functon s to mze total generaton suppled and load demand at specfc buses. he mathematcal formulaton of the proposed method s presented and the algorthm s tested on the IEEE 0 bus system to show ts capablty.. PROBLEM FORMULAION he OPF-based C calculaton algorthm descrbed below enables transfers by ncreasng the load, wth unform power factor, at a specfc load bus or every load bus n the sn control area, and ncreasng the real power nected at a specfc generator bus or several generators n the source control area untl lmts are ncurred. he man assumptons for ths method are [5]: A current state estmaton of the power system s avalable and the operatng pont s secure and stable. he system s properly controlled and can provde enough dampng to eep steady-state stablty. he system has suffcently large stablty margn; hence t can survve dsturbances and shft to another stable operatng pont. System voltage lmt s reached before the system loses voltage stablty. Only thermal lmts and bus voltage lmts are consdered as well as generator actve and reactve power lmts. Mathematcally, C calculaton problem can be represented as: Maxmze J = f(x, u ( g( x, u = 0; mn h h( x, u h Where f(x, u s the obectve functon, x represents the system state varable vector and u the control parameter vector. g(x, u s the equalty constrant functon vector and h(x, u the nequalty constrant functon vector. he cost functon J s defned to be the sum of total generaton of a specfc generator or a group of generators (desgnated as S and total load of a specfc load bus or a cluster of load buses (desgnated as R,.e. S J = P + P ( d R Where P s the generaton at bus and the P s the load at bus d. he g(x, u = 0 s the power flow equalty constrant whch s descrbed [ 6]: φ = P V P Q = φ = Q V N = ref.bus, θ N V ( ref V ( = 0 cosθ + B snθ = 0 snθ B cosθ = 0 Where P, Q are the actve and reactve power necton at bus ; V θ s the voltage at bus and θ = θ θ ; + B s the correspondng element n system Y-matrx. he power necton at bus s defned as P = P L L ( P, Q = Q Q (4 Where P and Q are the real and reactve power generaton at bus, whle PL and QL the real and reactve load at bus. Wth bus voltages magntudes, ncludng the Ref. Bus, and bus voltage phase angles, except the Ref. Bus where θref.= 0, are taen as state varables x, It s evdent that f a set of u s gven x can be solved from Eq. (. he nequalty constrants are as follows, (a he generaton and load lmts: P mn Q P P ( S mn 0 P Q P Q ( d R (5.a Where P and mn P are the upper and lower lmts of the generator actve power at bus. Q and mn Q are reactve power lmts for generator. P s the upper lmt of the of the load actve power whch s constraned by dstrbuton faclty capacty. (b he bus voltage lmts appled to all buses n the networ: mn V V V (5.b (c he current lmts of transmsson lnes based on thermal consderatons: 0 I I (5.c Where I and I are the actual and mum current of lne - respectvely. I can be calculated from V, V and parameters of lne -. Equatons ( to (5 consttute the mathematcal model of the OPF-based C computaton. In ths study, the system state varables are: Voltage magntudes and phase angels of all buses except Ref. bus phase angle whch s set to be zero. he control varables are: /00 $0 (c 000 IEEE

3 Proceedngs of the rd Hawa Internatonal Conference on System Scences Real power output of generator (P, S. Real power of load d (P, d R. Reactve power of each generator (Q.. OPIMIZAION he advanced Sequental Quadratc Programmng (SQP method s selected to solve the C-OPF problem snce t was recently developed and proven to be an effectve method for constraned nonlnear programmng [7]. For the general purpose optmzaton problem n the form gven as (here both x and u n Eq. ( are consdered as x: Mn f ( x g( x = 0 ( =,,..., p h ( x 0 ( =,,..., m he correspondng Lagrangan functon L( x, λ s formed as p = = (6 L( x, λ = f ( x + λ g ( x + λ h ( x (7 m p+ Where λ (=,,,(p+m s the Lagrange multpler for the actve th equalty and nequalty constrant. We can defne a correspondng approxmate quadratc programmng subproblem. It can be proven that the QP sub-problem at the -th teraton s equvalent to another QP sub-problem defned as: Mn f ( x s + 0.5s [ H ] s g ( x + g ( x h ( x + h ( x s = 0 ( =,,..., p s 0 ( =,,..., m Where [H] s a postve defnte matrx that s taen ntally as an dentty matrx and updated n subsequent teratons so as to converge to the real Hessan matrx of the Lagrangan functon of Eq. (7 whch wll be explaned below. he vector s to be optmzed s served as the search drecton,. e. x + = x + α s (9 Where α s the optmal step length along the search drecton s found by mnmzng the mert functon [7]: Mn. f ( x + + (8 p m + + λ g ( x + λ p+ [0, h ( x (0 = = he update of the Hessan matrx H after the -th teraton to mprove the quadratc approxmaton s gven as [7] H + = H H d d H /( d H d + γγ /( d d where + d = x x γ = θ Q + ( θ H d Q = + + xl( x, λ xl( x, λ.0 ( f d Q 0. d Hd θ = 0. 8d Hd (otherwse d Hd d Q ( Where L s gven by Eq. (7 and the constants 0. and 0.8 can be changed based on numercal experence. Usng the above mentoned equatons, C calculaton procedure can be summarzed as follows: Step : Calculate base load flow to get x (0 and assume ntally the Hessan matrx s unty Step : Evaluate the gradents of the obectve functon and constrant functons Step : Solve QP sub-problem n Eq. (8 to get optmal search drecton s Step 4: Fnd optmal step length α and update x by Eq. (9 Step 5: Update the Hessan matrx [H] by Eq. ( Step 6: Chec convergence. If t s converged, then output results and stop; otherwse go to step to next teraton. 4. IEEE 0 BUS ES RESULS he IEEE 0-bus system, shown n Fgure, s adopted as the test system. he system has areas wth generators n each area. enerators n each area are assumed to belong to the same owner and the loads belong to the same load servng entty. ransactons between dfferent control areas are nvestgated,.e., C wll be evaluated between areas. he base load flow s gven n the Appendx. Some buses retan low voltage profle le buses 7, 8, and 9, whle lne 6-8 s more than 90% loaded. Several cases are studed wth three case results presented below. Case : the transfer capablty from area to area Usng the proposed OPF-based C method, the generaton of area ncreases from 56. MW to 7 MW and the load at area from 84.5 MW to 99 MW. he loads are modeled as a constant power factor load. he actve loadng vector of area, excludng ntermedate or zero loadng buses, after and before ths transacton s shown n table. C s 99 MW and the lmt was the overloadng of lne -. Snce the obectve functon mzes the total generaton n area and the total load n area, both the generaton and load ncrements are not unformly dstrbuted n each area. Hence, usng a common loadng factor, typcally of CPF method, mght lead to n a conservatve C results due to the mproper allocaton of generatons and loads. EPRI Voltage SABlty (VSAB [8] /00 $0 (c 000 IEEE

4 Proceedngs of the rd Hawa Internatonal Conference on System Scences was utlzed for calculatng the transfer between area and by CPF. C calculated wth CPF s 88.5 MW whch s more conservatve than the one obtaned by the proposed method. he overload of lne 6-8 was the lmtng condton usng CPF. Clearly CPF ncremented the load wth only 5 MW that was enough to trgger the overload n lne 6-8 whch was almost fully loaded before ths transacton occurs. Case : the transfer capablty from area to area he loads n area ncrease gradually wth the generaton of area ncreased accordngly. he proxmty of lnes -, 5-, and 6-8 to be overloaded were the lmtng condton n ths case. Usng the suggested method, the generaton at area s ncreased from 48.5 MW to 94.9 MW whle the load at area s ncreased from 84.5 MW to 9.5 MW. C s found to be 9.5 MW. Contnuaton power flow results was 89.5 MW when lne 6-8 s % overloaded. he dscrepancy between C results of both methods s sgnfcant partcularly for ths case. VSAB scales up the generaton n the same loadng drecton regardless of lmts mposed on lne 6-8 but the proposed OPF method dentfes that nstantly and redspatches power generaton and load dstrbuton of specfed sources and sns as well as reactve power generaton to avod any overloadng or other volatons. from further ncrease n the specfed transfer. he load actve power vector of area n bus number sequence s [9.7,, 6., 8.,.5, 9.0,., 9.5,., 5.48] MW. he loads on bus and bus are the only ones to experence an ncrease durng the optmzaton process. he ncrease of loads s extremely non-unform. C calculated usng CPF s much less than ts counterpart usng the proposed OPF method. C equals to 6 MW by CPF because of the overload of lne -. he crtcal load of area of the nose pont for that case s 57 MW wth voltage volatons and 5 lne overloads. hs confrms agan that the system usually hts the operaton lmts at a much lower loadng condton than t hts the nose pont. hs result ustfes the assumpton made n earler secton. In these tests, the developed program converges very well n OPF calculaton snce t uses Newton s method n solvng nonlnear equatons and starts from a steady state operatng pont. However t should be ponted out that SQP method has the possblty of convergng to a local mnmum/mum especally n a hghly nonlnear system. herefore further tests on stressed and ll-condtoned systems are requred CONCLUSION A new formulaton for OPF to calculate the otal ransfer Capablty C s reported n ths paper. he obectve functon s the total generaton and load ncrease on specfc source and sn nodes. he thermal lmts of transmsson lnes, voltage bounds of buses, and upper and lower lmts of generator power are consdered as well as load flow equatons. he advanced sequental quadratc programmng method s extended for C calculaton. An algorthm has been developed and tested on the IEEE 0-bus system. Computer results show that the proposed method s very effectve, and wth good convergence characterstcs as well, n determnng C. he man conclusons of the paper are: Area Area Area Fgure. IEEE 0-bus system 6 he proposed OPF-based C algorthm wors well n determnng C between dfferent areas subect to system operaton lmts. able. Actve loadng of area n MW for a transacton between area and area Bus # Before After OPF-based C approach can re-dspatch generator reactve power outputs and optmally dstrbute the ncrement of loads and generatons on the specfc buses, therefore t can reach the mum C, whle he CPF technque usually gves a conservatve estmaton of C for the lac of the optmzaton functon. ACKNOWLEDEMEN Case : the transfer capablty from area to area he transfer capablty between area and area s 07 MW usng the proposed technque. he overload that too place n lne 5-7 hndered the algorthm he authors would le to than EPRI, USA for ther nd donaton of VSAB software for our academc research /00 $0 (c 000 IEEE 4

5 Proceedngs of the rd Hawa Internatonal Conference on System Scences REFRENCES [] ransmsson ransfer Capablty as Force, Avalable ransfer Capablty Defntons and Determnaton, North Amercan Electrc Relablty Councl, Prnceton, NJ, June 996. [] V. Aarapu and C. Chrty, he Contnuaton Power Flow: A ool for Steady State Voltage Stablty Analyss, IEEE ransactons on Power Systems, Vol. 7, No., pp. 46-4, February 99. [] H. D. Chnag, A. J. Fluec, K. S. Shah and N. Balu, CPFLOW: A practcal ool for racng Power System Steady-State Statonary Behavor Due to the Load and eneraton Varatons, IEEE ransactons on Power Systems, Vol. 0, No., pp. 6-64, May 995. [4]. C. Eebe, J. ong, J.. Waght, J.. Frame, X. Wang and W. F. nney, Avalable ransfer Capablty Calculatons, PE-- PWRS [5 ] M. Shaaban, Y. N, H. Da and F. Wu, Consderatons n Calculatng otal ransfer Capablty, Proc. Of the Internatonal Conference on Power System echnology, Beng, Vol., pp , August 998. [6] A. J. Wood and B. F. Wollenberg, Power eneraton, Operaton, and Control, John Wley & Sons, nd edton, 996. [7] S. S. Rao, Engneerng Optmzaton: heory and Practce, John Wley & Sons, rd edton, 996. [8] Powertch Labs Inc., Voltage Stablty Analyss Program (VSAB User s Manual, Prepared for EPRI, USA, 997. APPENDIX IEEE 0 bus system data otal load of area = 84.5 MW otal load of area = 56. MW otal load of area = 48.5 MW Current generaton of area = 87 MW Current generaton of area = 56. MW Current generaton of area = 48.5 MW Avalable generaton of area = 60 MW Avalable generaton of area = 70 MW Avalable generaton of area = 05 MW he operatng pont of the 0-bus system (P/Q: MVA Bus Area V Angle eneraton Load No. No. (p.u. (deg. P Q P Q /00 $0 (c 000 IEEE 5

The Study of Teaching-learning-based Optimization Algorithm

The Study of Teaching-learning-based Optimization Algorithm Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute

More information

Chapter - 2. Distribution System Power Flow Analysis

Chapter - 2. Distribution System Power Flow Analysis Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load

More information

Proceedings of the 10th WSEAS International Confenrence on APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3,

Proceedings of the 10th WSEAS International Confenrence on APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, roceedngs of the 0th WSEAS Internatonal Confenrence on ALIED MATHEMATICS, Dallas, Texas, USA, November -3, 2006 365 Impact of Statc Load Modelng on Industral Load Nodal rces G. REZA YOUSEFI M. MOHSEN EDRAM

More information

Optimal Allocation of FACTS Devices to Enhance Total Transfer Capability Based on World Cup Optimization Algorithm

Optimal Allocation of FACTS Devices to Enhance Total Transfer Capability Based on World Cup Optimization Algorithm World Essays Journal / 5 (): 40-45 07 07 Avalable onlne at www. worldessaysj.com Optmal Allocaton of FACS Devces to Enhance otal ransfer Capablty Based on World Cup Optmzaton Algorthm Farzn mohammad bolbanabad

More information

MMA and GCMMA two methods for nonlinear optimization

MMA and GCMMA two methods for nonlinear optimization MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons

More information

Some modelling aspects for the Matlab implementation of MMA

Some modelling aspects for the Matlab implementation of MMA Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng

More information

A SEPARABLE APPROXIMATION DYNAMIC PROGRAMMING ALGORITHM FOR ECONOMIC DISPATCH WITH TRANSMISSION LOSSES. Pierre HANSEN, Nenad MLADENOVI]

A SEPARABLE APPROXIMATION DYNAMIC PROGRAMMING ALGORITHM FOR ECONOMIC DISPATCH WITH TRANSMISSION LOSSES. Pierre HANSEN, Nenad MLADENOVI] Yugoslav Journal of Operatons Research (00) umber 57-66 A SEPARABLE APPROXIMATIO DYAMIC PROGRAMMIG ALGORITHM FOR ECOOMIC DISPATCH WITH TRASMISSIO LOSSES Perre HASE enad MLADEOVI] GERAD and Ecole des Hautes

More information

ECE559VV Project Report

ECE559VV Project Report ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate

More information

EEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming

EEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-

More information

ELE B7 Power Systems Engineering. Power Flow- Introduction

ELE B7 Power Systems Engineering. Power Flow- Introduction ELE B7 Power Systems Engneerng Power Flow- Introducton Introducton to Load Flow Analyss The power flow s the backbone of the power system operaton, analyss and desgn. It s necessary for plannng, operaton,

More information

V.G.Umalem 1, S.B.Warkad 2 1 Department of Electrical Engineering Priyadarshini College of Engineering Nagpur, Maharashtra, India ABSTRACT

V.G.Umalem 1, S.B.Warkad 2 1 Department of Electrical Engineering Priyadarshini College of Engineering Nagpur, Maharashtra, India ABSTRACT 2017 IJSRSET Volume 3 Issue 8 Prnt ISSN: 2395-1990 Onlne ISSN : 2394-4099 Themed Secton : Engneerng and Technology Comparson of Locatonal Margnal Transmsson Prcng V.G.Umalem 1, S.B.Warkad 2 1 Department

More information

A Modified Approach for Continuation Power Flow

A Modified Approach for Continuation Power Flow 212, TextRoad Publcaton ISSN 29-434 Journal of Basc and Appled Scentfc Research www.textroad.com A Modfed Approach for Contnuaton Power Flow M. Beragh*, A.Rab*, S. Mobaeen*, H. Ghorban* *Department of

More information

Solutions to exam in SF1811 Optimization, Jan 14, 2015

Solutions to exam in SF1811 Optimization, Jan 14, 2015 Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable

More information

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,

More information

Numerical Heat and Mass Transfer

Numerical Heat and Mass Transfer Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and

More information

Optimal choice and allocation of distributed generations using evolutionary programming

Optimal choice and allocation of distributed generations using evolutionary programming Oct.26-28, 2011, Thaland PL-20 CIGRE-AORC 2011 www.cgre-aorc.com Optmal choce and allocaton of dstrbuted generatons usng evolutonary programmng Rungmanee Jomthong, Peerapol Jrapong and Suppakarn Chansareewttaya

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

Kernel Methods and SVMs Extension

Kernel Methods and SVMs Extension Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general

More information

A Hybrid Variational Iteration Method for Blasius Equation

A Hybrid Variational Iteration Method for Blasius Equation Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009 College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

More information

The Minimum Universal Cost Flow in an Infeasible Flow Network

The Minimum Universal Cost Flow in an Infeasible Flow Network Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran

More information

Evaluation of Inter Area Available Transfer Capability of Nigeria 330KV Network

Evaluation of Inter Area Available Transfer Capability of Nigeria 330KV Network Internatonal Journal of Engneerng and Technology Volume 3 No. 2, February, 2013 Evaluaton of Inter Area Avalable Transfer Capablty of Ngera 330KV Network A. A. Sadq, M. N. Nwohu Department of Electrcal/Electronc

More information

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc

More information

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS) Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal

More information

SOLVING CAPACITATED VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS BY GOAL PROGRAMMING APPROACH

SOLVING CAPACITATED VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS BY GOAL PROGRAMMING APPROACH Proceedngs of IICMA 2013 Research Topc, pp. xx-xx. SOLVIG CAPACITATED VEHICLE ROUTIG PROBLEMS WITH TIME WIDOWS BY GOAL PROGRAMMIG APPROACH ATMII DHORURI 1, EMIUGROHO RATA SARI 2, AD DWI LESTARI 3 1Department

More information

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence

More information

Comparative Analysis of SPSO and PSO to Optimal Power Flow Solutions

Comparative Analysis of SPSO and PSO to Optimal Power Flow Solutions Internatonal Journal for Research n Appled Scence & Engneerng Technology (IJRASET) Volume 6 Issue I, January 018- Avalable at www.jraset.com Comparatve Analyss of SPSO and PSO to Optmal Power Flow Solutons

More information

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments

More information

Optimal Dispatch in Electricity Markets

Optimal Dispatch in Electricity Markets QUANTITATIVE FINANCE RESEARCH CENTRE QUANTITATIVE FINANCE RESEARCH CENTRE Research Paper 06 October 007 Optmal Dspatch n Electrcty Markets Vladmr Kazakov and Anatoly M Tsrln ISSN 1441-8010 www.qfrc.uts.edu.au

More information

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue

More information

DUE: WEDS FEB 21ST 2018

DUE: WEDS FEB 21ST 2018 HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant

More information

On the Multicriteria Integer Network Flow Problem

On the Multicriteria Integer Network Flow Problem BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of

More information

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng

More information

Interactive Bi-Level Multi-Objective Integer. Non-linear Programming Problem

Interactive Bi-Level Multi-Objective Integer. Non-linear Programming Problem Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan

More information

E O C NO N MIC C D I D SP S A P T A C T H C H A N A D N D UN U I N T T CO C MMITM T EN E T

E O C NO N MIC C D I D SP S A P T A C T H C H A N A D N D UN U I N T T CO C MMITM T EN E T Chapter 4 ECOOMIC DISPATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the

More information

Loss Minimization of Power Distribution Network using Different Types of Distributed Generation Unit

Loss Minimization of Power Distribution Network using Different Types of Distributed Generation Unit Internatonal Journal of Electrcal and Computer Engneerng (IJECE) Vol. 5, o. 5, October 2015, pp. 918~928 ISS: 2088-8708 918 Loss Mnmzaton of Power Dstrbuton etwor usng Dfferent Types of Dstrbuted Generaton

More information

Global Sensitivity. Tuesday 20 th February, 2018

Global Sensitivity. Tuesday 20 th February, 2018 Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values

More information

Static security analysis of power system networks using soft computing techniques

Static security analysis of power system networks using soft computing techniques Internatonal Journal of Advanced Computer Research (ISSN (prnt): 49-777 ISSN (onlne): 77-797) Statc securty analyss of power system networks usng soft computng technques D.Raaga Leela 1 Saram Mannem and

More information

Physics 5153 Classical Mechanics. Principle of Virtual Work-1

Physics 5153 Classical Mechanics. Principle of Virtual Work-1 P. Guterrez 1 Introducton Physcs 5153 Classcal Mechancs Prncple of Vrtual Work The frst varatonal prncple we encounter n mechancs s the prncple of vrtual work. It establshes the equlbrum condton of a mechancal

More information

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve

More information

Chapter Newton s Method

Chapter Newton s Method Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017 U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that

More information

CHAPTER 7 CONSTRAINED OPTIMIZATION 2: SQP AND GRG

CHAPTER 7 CONSTRAINED OPTIMIZATION 2: SQP AND GRG Chapter 7: Constraned Optmzaton CHAPER 7 CONSRAINED OPIMIZAION : SQP AND GRG Introducton In the prevous chapter we eamned the necessary and suffcent condtons for a constraned optmum. We dd not, however,

More information

Very Large Scale Continuous and Discrete Variable. Woptimization,

Very Large Scale Continuous and Discrete Variable. Woptimization, Very Large Scale Contnuous and Dscrete Varable Optmzaton Garret N. Vanderplaats * Vanderplaats Research & Development, Inc. 1767 S. 8 th Street Colorado Sprngs, CO 80906 An optmzaton algorthm s presented

More information

Uncertainty and auto-correlation in. Measurement

Uncertainty and auto-correlation in. Measurement Uncertanty and auto-correlaton n arxv:1707.03276v2 [physcs.data-an] 30 Dec 2017 Measurement Markus Schebl Federal Offce of Metrology and Surveyng (BEV), 1160 Venna, Austra E-mal: markus.schebl@bev.gv.at

More information

OPTIMISATION. Introduction Single Variable Unconstrained Optimisation Multivariable Unconstrained Optimisation Linear Programming

OPTIMISATION. Introduction Single Variable Unconstrained Optimisation Multivariable Unconstrained Optimisation Linear Programming OPTIMIATION Introducton ngle Varable Unconstraned Optmsaton Multvarable Unconstraned Optmsaton Lnear Programmng Chapter Optmsaton /. Introducton In an engneerng analss, sometmes etremtes, ether mnmum or

More information

Basic Statistical Analysis and Yield Calculations

Basic Statistical Analysis and Yield Calculations October 17, 007 Basc Statstcal Analyss and Yeld Calculatons Dr. José Ernesto Rayas Sánchez 1 Outlne Sources of desgn-performance uncertanty Desgn and development processes Desgn for manufacturablty A general

More information

Lecture 10 Support Vector Machines II

Lecture 10 Support Vector Machines II Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed

More information

PHYS 705: Classical Mechanics. Calculus of Variations II

PHYS 705: Classical Mechanics. Calculus of Variations II 1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary

More information

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers Psychology 282 Lecture #24 Outlne Regresson Dagnostcs: Outlers In an earler lecture we studed the statstcal assumptons underlyng the regresson model, ncludng the followng ponts: Formal statement of assumptons.

More information

COS 521: Advanced Algorithms Game Theory and Linear Programming

COS 521: Advanced Algorithms Game Theory and Linear Programming COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton

More information

6 Steady State Power System Voltage Stability Analysis and Control with FACTS

6 Steady State Power System Voltage Stability Analysis and Control with FACTS 6 Steady State Power System Voltage Stablty Analyss and Control wth FACS Voltage stablty analyss and control become ncreasngly mportant as the systems are beng operated closer to ther stablty lmts ncludng

More information

Parameter Estimation for Dynamic System using Unscented Kalman filter

Parameter Estimation for Dynamic System using Unscented Kalman filter Parameter Estmaton for Dynamc System usng Unscented Kalman flter Jhoon Seung 1,a, Amr Atya F. 2,b, Alexander G.Parlos 3,c, and Klto Chong 1,4,d* 1 Dvson of Electroncs Engneerng, Chonbuk Natonal Unversty,

More information

Least squares cubic splines without B-splines S.K. Lucas

Least squares cubic splines without B-splines S.K. Lucas Least squares cubc splnes wthout B-splnes S.K. Lucas School of Mathematcs and Statstcs, Unversty of South Australa, Mawson Lakes SA 595 e-mal: stephen.lucas@unsa.edu.au Submtted to the Gazette of the Australan

More information

A New Algorithm for Finding a Fuzzy Optimal. Solution for Fuzzy Transportation Problems

A New Algorithm for Finding a Fuzzy Optimal. Solution for Fuzzy Transportation Problems Appled Mathematcal Scences, Vol. 4, 200, no. 2, 79-90 A New Algorthm for Fndng a Fuzzy Optmal Soluton for Fuzzy Transportaton Problems P. Pandan and G. Nataraan Department of Mathematcs, School of Scence

More information

CIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M

CIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure and Drive Paul A. Jensen Copyright July 20, 2003 Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.

More information

Electric Power Systems Research

Electric Power Systems Research Electrc Power Systems Research 81 (2011) 1995 2004 Contents lsts avalable at ScenceDrect Electrc Power Systems Research jou rn al h om epage: www.elsever.com/locate/epsr Fully reference-ndependent LMP

More information

Mean Field / Variational Approximations

Mean Field / Variational Approximations Mean Feld / Varatonal Appromatons resented by Jose Nuñez 0/24/05 Outlne Introducton Mean Feld Appromaton Structured Mean Feld Weghted Mean Feld Varatonal Methods Introducton roblem: We have dstrbuton but

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

CHAPTER 2 MULTI-OBJECTIVE GENETIC ALGORITHM (MOGA) FOR OPTIMAL POWER FLOW PROBLEM INCLUDING VOLTAGE STABILITY

CHAPTER 2 MULTI-OBJECTIVE GENETIC ALGORITHM (MOGA) FOR OPTIMAL POWER FLOW PROBLEM INCLUDING VOLTAGE STABILITY 26 CHAPTER 2 MULTI-OBJECTIVE GENETIC ALGORITHM (MOGA) FOR OPTIMAL POWER FLOW PROBLEM INCLUDING VOLTAGE STABILITY 2.1 INTRODUCTION Voltage stablty enhancement s an mportant tas n power system operaton.

More information

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution. Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,

More information

OPTIMAL PLACEMENT OF DG IN RADIAL DISTRIBUTION SYSTEM USING CLUSTER ANALYSIS

OPTIMAL PLACEMENT OF DG IN RADIAL DISTRIBUTION SYSTEM USING CLUSTER ANALYSIS OTIMAL LACEMET OF DG I RADIAL DISTRIBUTIO SYSTEM USIG CLUSTER AALYSIS MUDDA RAJARAO Assstant rofessor Department of Electrcal & Electroncs Engneerng,Dad Insttute of Engneerng and Technology, Anakapalle;

More information

An Interactive Optimisation Tool for Allocation Problems

An Interactive Optimisation Tool for Allocation Problems An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents

More information

Transient Stability Constrained Optimal Power Flow Using Improved Particle Swarm Optimization

Transient Stability Constrained Optimal Power Flow Using Improved Particle Swarm Optimization Transent Stablty Constraned Optmal Power Flow Usng Improved Partcle Swarm Optmzaton Tung The Tran and Deu Ngoc Vo Abstract Ths paper proposes an mproved partcle swarm optmzaton method for transent stablty

More information

Inexact Newton Methods for Inverse Eigenvalue Problems

Inexact Newton Methods for Inverse Eigenvalue Problems Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.

More information

Lecture 21: Numerical methods for pricing American type derivatives

Lecture 21: Numerical methods for pricing American type derivatives Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)

More information

Application of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems

Application of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems Mathematca Aeterna, Vol. 1, 011, no. 06, 405 415 Applcaton of B-Splne to Numercal Soluton of a System of Sngularly Perturbed Problems Yogesh Gupta Department of Mathematcs Unted College of Engneerng &

More information

Chapter 11: Simple Linear Regression and Correlation

Chapter 11: Simple Linear Regression and Correlation Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests

More information

Determining Transmission Losses Penalty Factor Using Adaptive Neuro Fuzzy Inference System (ANFIS) For Economic Dispatch Application

Determining Transmission Losses Penalty Factor Using Adaptive Neuro Fuzzy Inference System (ANFIS) For Economic Dispatch Application 7 Determnng Transmsson Losses Penalty Factor Usng Adaptve Neuro Fuzzy Inference System (ANFIS) For Economc Dspatch Applcaton Rony Seto Wbowo Maurdh Hery Purnomo Dod Prastanto Electrcal Engneerng Department,

More information

Newton s Method for One - Dimensional Optimization - Theory

Newton s Method for One - Dimensional Optimization - Theory Numercal Methods Newton s Method for One - Dmensonal Optmzaton - Theory For more detals on ths topc Go to Clck on Keyword Clck on Newton s Method for One- Dmensonal Optmzaton You are free to Share to copy,

More information

The Expectation-Maximization Algorithm

The Expectation-Maximization Algorithm The Expectaton-Maxmaton Algorthm Charles Elan elan@cs.ucsd.edu November 16, 2007 Ths chapter explans the EM algorthm at multple levels of generalty. Secton 1 gves the standard hgh-level verson of the algorthm.

More information

The Geometry of Logit and Probit

The Geometry of Logit and Probit The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.

More information

Lossy Compression. Compromise accuracy of reconstruction for increased compression.

Lossy Compression. Compromise accuracy of reconstruction for increased compression. Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost

More information

Operating conditions of a mine fan under conditions of variable resistance

Operating conditions of a mine fan under conditions of variable resistance Paper No. 11 ISMS 216 Operatng condtons of a mne fan under condtons of varable resstance Zhang Ynghua a, Chen L a, b, Huang Zhan a, *, Gao Yukun a a State Key Laboratory of Hgh-Effcent Mnng and Safety

More information

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there

More information

Uncertainty in measurements of power and energy on power networks

Uncertainty in measurements of power and energy on power networks Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:

More information

Introduction. - The Second Lyapunov Method. - The First Lyapunov Method

Introduction. - The Second Lyapunov Method. - The First Lyapunov Method Stablty Analyss A. Khak Sedgh Control Systems Group Faculty of Electrcal and Computer Engneerng K. N. Toos Unversty of Technology February 2009 1 Introducton Stablty s the most promnent characterstc of

More information

Economics 101. Lecture 4 - Equilibrium and Efficiency

Economics 101. Lecture 4 - Equilibrium and Efficiency Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of

More information

Simulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests

Simulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth

More information

Topic 5: Non-Linear Regression

Topic 5: Non-Linear Regression Topc 5: Non-Lnear Regresson The models we ve worked wth so far have been lnear n the parameters. They ve been of the form: y = Xβ + ε Many models based on economc theory are actually non-lnear n the parameters.

More information

Statistical Energy Analysis for High Frequency Acoustic Analysis with LS-DYNA

Statistical Energy Analysis for High Frequency Acoustic Analysis with LS-DYNA 14 th Internatonal Users Conference Sesson: ALE-FSI Statstcal Energy Analyss for Hgh Frequency Acoustc Analyss wth Zhe Cu 1, Yun Huang 1, Mhamed Soul 2, Tayeb Zeguar 3 1 Lvermore Software Technology Corporaton

More information

Second Order Analysis

Second Order Analysis Second Order Analyss In the prevous classes we looked at a method that determnes the load correspondng to a state of bfurcaton equlbrum of a perfect frame by egenvalye analyss The system was assumed to

More information

The Concept of Beamforming

The Concept of Beamforming ELG513 Smart Antennas S.Loyka he Concept of Beamformng Generc representaton of the array output sgnal, 1 where w y N 1 * = 1 = w x = w x (4.1) complex weghts, control the array pattern; y and x - narrowband

More information

FUZZY FINITE ELEMENT METHOD

FUZZY FINITE ELEMENT METHOD FUZZY FINITE ELEMENT METHOD RELIABILITY TRUCTURE ANALYI UING PROBABILITY 3.. Maxmum Normal tress Internal force s the shear force, V has a magntude equal to the load P and bendng moment, M. Bendng moments

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

Prof. Dr. I. Nasser Phys 630, T Aug-15 One_dimensional_Ising_Model

Prof. Dr. I. Nasser Phys 630, T Aug-15 One_dimensional_Ising_Model EXACT OE-DIMESIOAL ISIG MODEL The one-dmensonal Isng model conssts of a chan of spns, each spn nteractng only wth ts two nearest neghbors. The smple Isng problem n one dmenson can be solved drectly n several

More information

Portfolios with Trading Constraints and Payout Restrictions

Portfolios with Trading Constraints and Payout Restrictions Portfolos wth Tradng Constrants and Payout Restrctons John R. Brge Northwestern Unversty (ont wor wth Chrs Donohue Xaodong Xu and Gongyun Zhao) 1 General Problem (Very) long-term nvestor (eample: unversty

More information

IJRSS Volume 2, Issue 2 ISSN:

IJRSS Volume 2, Issue 2 ISSN: IJRSS Volume, Issue ISSN: 49-496 An Algorthm To Fnd Optmum Cost Tme Trade Off Pars In A Fractonal Capactated Transportaton Problem Wth Restrcted Flow KAVITA GUPTA* S.R. ARORA** _ Abstract: Ths paper presents

More information

An identification algorithm of model kinetic parameters of the interfacial layer growth in fiber composites

An identification algorithm of model kinetic parameters of the interfacial layer growth in fiber composites IOP Conference Seres: Materals Scence and Engneerng PAPER OPE ACCESS An dentfcaton algorthm of model knetc parameters of the nterfacal layer growth n fber compostes o cte ths artcle: V Zubov et al 216

More information

Congestion Management in Restructured Power Systems Using an Optimal Power Flow Framework

Congestion Management in Restructured Power Systems Using an Optimal Power Flow Framework PSERC Congeston Management n Restructured Power Systems Usng an Optmal Power Flow Framework Masters Thess and Proect Report Power Systems Engneerng Research Center A Natonal Scence Foundaton Industry/Unversty

More information

Inductance Calculation for Conductors of Arbitrary Shape

Inductance Calculation for Conductors of Arbitrary Shape CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors

More information

Real-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling

Real-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling Real-Tme Systems Multprocessor schedulng Specfcaton Implementaton Verfcaton Multprocessor schedulng -- -- Global schedulng How are tasks assgned to processors? Statc assgnment The processor(s) used for

More information

An Integrated OR/CP Method for Planning and Scheduling

An Integrated OR/CP Method for Planning and Scheduling An Integrated OR/CP Method for Plannng and Schedulng John Hooer Carnege Mellon Unversty IT Unversty of Copenhagen June 2005 The Problem Allocate tass to facltes. Schedule tass assgned to each faclty. Subect

More information