Learning through Power Distribution Grid Probing

Size: px
Start display at page:

Download "Learning through Power Distribution Grid Probing"

Transcription

1 Learig through Power Distributio Grid Probig Sid Bhela, Vassilis Kekatos, ad Harsha Veeramachaei INFORMS 2017 October 23 rd, 2017 Housto, TX Ackowledgemets:

2 Learig loads i distributio grids Reduced observability due to sheer extet ad limited meterig ifrastructure However, load estimates eeded for grid optimizatio, billig, ad eergy theft detectio Leverage smart meter data ad smart iverters 2

3 Problem statemet ad prior work Load learig: Give readigs from a set of metered (cotrollable) buses M, recover the system state ad hece the power ijectios at o-metered buses O. Collected readigs - smart meter data (voltage magitudes, power ijectios) - sychrophasor data (bus voltage ad curret phasors) For sufficietly rich (pseudo)measuremet sets, solve as D-PSSE [Dzafic-Jabr-Pal et al 13], [Klauber-Zhu 15], [Gomez-Exposito et al 15] Liear estimator if grid is equipped with micro-pmus [A. vo Meier 15] Meter placemet i distributio grids [Lui-Poci 14] Probig trasmissio grids for estimatig oscillatio modes [Trudowski-Pierre 09] System idetificatio i DC microgrids [Agjelichioski-Scaglioe 17] 3

4 Liearized distributio flow model Sigle-phase radial grid with N+1 odes ad N lies u m u r` + jx` p m,q m p,q Approximate LDF model [Bara-Wu 89], [Bologai-Dorfler 15], [Deka et al 17] u ' Rp + Xq ' Xp Rq odal voltage phasor u := V 2 V 0 2 V = V e j The iverses of (R,X) are reduced graph Laplacia matrices 4

5 Passive load learig Partitio data ito metered ad o-metered buses um u O = RM,M R M,O R O,M R O,O pm p O + XM,M X O,M X O,O q O X M,O qm + Model for smart meter data u M R M,M p M X M,M q M = [R M,O X M,O ] po q O + M Model for sychrophasor data um R M,M p M X M,M q M M X M,M p M + R M,M q M = RM,O X M,O R M,O q O X M,O po + No-metered ijectios ca be uiquely recovered via least-squares if regressio matrices are full colum-rak 5

6 Idetifiability with passive load learig Propositio 1: Give smart meter data o M = M 1 [ M 2, the ijectios at O are idetifiable if every bus i O ca be coected to uique buses i M 1 ad M 2. Propositio 2: Give PMU data o M, the ijectios at O are idetifiable if every bus i O ca be coected to a uique bus i M. o-metered buses O metered buses M S. Bhela, V. Kekatos, ad S. Veeramachaei, Power distributio system observability with smart meter data, IEEE GlobalSIP, Motreal, Caada, Nov

7 Key ideas Partitio reduced (resistive) Laplacia L := R 1 = LM,M L > M,O L M,O L O,O Rak of Schur complemet rk(l) =rk(l M,M )+rk(l O,O L > M,OL 1 M,M L M,O) Matrix iversio lemma ad Sylvester's iequality L M,O R M,O = L 1 M,M L M,O(L O,O L > M,OL 1 M,M L M,O) 1 Matrix is geerically ivertible iff there exists a perfect matchig i the bipartite graph defied by its sparsity patter [Tutte 47] L M,O = O Perfect matchig easily foud as max flow problem M W. T. Tutte, The factorizatio of liear graphs, Joural of the Lodo Mathematical Society, 1947 Ford ad Fulkerso, Maximal flow through a etwork, Caadia J. of Mathematics,

8 Idetifiable setups with smart meter data IEEE 123-bus etwork with O =4 Frequecy Coditio umber IEEE 123-bus etwork with O = 10 Frequecy Coditio umber 8

9 Idetifiable setups with PMUs IEEE 123-bus etwork with O =4 100 Frequecy Coditio umber IEEE 123-bus etwork with O = 10 Frequecy Coditio umber 9

10 Load learig through grid probig Time t =1: Record data associated with state v 1 {u 1,p 1,q 1 } 2M Time t =2 Probe oliear physical system by perturbig power ijectios at cotrollable buses [how?] Record data {u 2,p 2,q} 2 2M state v 2 6= v 1 associated with Repeat say every secod for t =1,...,T Exploit the fact that {p t,q} t 2O ivariat durig probig remai o-metered buses O metered buses M 10

11 Coupled power flow (CPF) metered buses o-metered bus (u 0, 0 ) (p 1,q 1,u 1 ) (p 2,q 2,u 2 ) (p 3,q 3 ) t =1 (p 1,q 1 ) (p 2,q 2 ) (p 3,q 3 ) ecessary coditio M 2 O T (u 0, 0 ) (p 0 1,q 0 1,u 0 1) (p 0 2,q 0 2,u 0 2) (p 3,q 3 ) t =2 11

12 Idetifiability through grid probig Give smart iverter data o metered odes ad assumig ivariat o-metered loads, fid the states {v t } T t=1 ad hece the o-metered loads. p (v t )=ˆp t q (v t )=ˆq t u (v t )=û t 8 2 M 8 2 M 8 2 M p (v t )=p (v t+1 ) q (v t )=q (v t+1 ) 8 2 O 8 2 O couplig equatios t =1,...,T t =1,...,T 1 Theorem: If O ca be partitioed ito disjoit sets {Ōk} T/2 k=1 such that each oe of them ca be matched to M, the states {v t } T t=1 ad the ijectios at O are locally idetifiable. T =1: passive scheme with smart meter data T =2: passive scheme usig PMU data O! M Checkig if matchig exist is easy (for ay T) S. Bhela, V. Kekatos, ad H. Veeramachamei, Power Grid Probig for Load Learig: Idetifiability over Multiple Time Istaces, i Proc. IEEE CAMSAP, Curacao, December

13 Idetifiable setups with probig Frequecy Coditio umber SCE 34-bus feeder: T =4, O = 18 coditio umbers of CPF Jacobias for radom setups 13

14 Idetifiable setups with probig (cot d) Frequecy Coditio umber SCE 34-bus feeder: T =6, O = 21 coditio umbers of CPF Jacobias for radom setups 14

15 CPF as pealized SDR Lift states {v t } to psd ad rak-oe matrices {V t = v t vt H } T t=1 Solve CPF as relaxed pealized SDP mi TX Tr(MV t ) t=1 s.to Tr(M k V t )=ŝ t k, k 2 M t,t=1,...,t Tr(M k V t )=Tr(M k V t+1 ), k 2 O,t=1,...,T 1 V t 0, t =1,...,T rk(v t )=1, t =1,...,T M k : matrices depedet o bus admittace matrix Rak-oe solutios guarateed for M = B ad lightly loaded system R. Madai, M. Ashpraphijuo, J. Lavaei, ad R. Baldick, Power system state estimatio with a limited umber of measuremets, IEEE CDC, Las Vegas, NV, Dec Zhag, Madai, Lavaei, Power system state estimatio with lie measuremets, IEEE CDC

16 CPSSE as pealized SDR Data are oisy ad o-metered loads may vary durig probig mi TX Tr(MV t )+ t=1 TX t=1 s.to Tr(M k V t )+ t k =ŝ t k, X k2m t f k ( t k)+ TX 1 t=1 X f k ( t k) k2o k 2 M t,t=1,...,t Tr(M k V t )=Tr(M k V t+1 )+ t k, k 2 O,t=1,...,T 1 V t 0, t =1,...,T Data-fittig optios: - weighted least-squares (WLS) f k ( t k)= ( t k )2 2 k - weighted least-absolute value (WLAV) f k ( t k)= t k k S.Bhela, V. Kekatos, ad H. Veeramachamei, Ehacig observability i distributio grids usig smart meter data, IEEE Tras. o Smart Grid, (early access)

17 Numerical tests with sythetic data Probability of Success β kv t v t+1 k 2 Probability of correct rak-1 CPF solutio Probig works better for sufficietly RMSE differet states (v t, v t+1 ) WLAV WLS 0.04 State RMSE for CPSSE (T = 2) SNR 17

18 Numerical tests with real data WLAV WLS RMSE :00 a.m. 12:00 p.m. 2:00 p.m. 4:00 p.m. Time Actual load/solar data (Peca Str project) RMSE o system state over oe day Probig by chagig power factors i smart iverters 18

19 Coclusios Passive ijectio learig Smart meter ad sychrophasor data Idetifiability for sigle-phase radial grids Simple LS solver usig LDF model No time couplig; timescale depeds o data Meshed ad polyphase grids? Optimal meter selectio? Active ijectio learig Iverter data collected via itetioal probig Idetifiability for possibly meshed ad polyphase grids Improvemets with icreasig T SDP-/SOCP-based solvers for CPF ad CPPSE Optimal probig desig? PMU data? Lie flow data? Probig for topology idetificatio? Thak You! 19

POWER DISTRIBUTION SYSTEM OBSERVABILITY WITH SMART METER DATA

POWER DISTRIBUTION SYSTEM OBSERVABILITY WITH SMART METER DATA POWER DISTRIBUTION SYSTEM OBSERVABILITY WITH SMART METER DATA Siddharth Bhela, Vassilis Kekatos Dept. of ECE, Virginia Tech, Blacksburg, VA 24061, USA Sriharsha Veeramachaneni WindLogics Inc., 1021 Bandana

More information

ELE B7 Power Systems Engineering. Symmetrical Components

ELE B7 Power Systems Engineering. Symmetrical Components ELE B7 Power Systems Egieerig Symmetrical Compoets Aalysis of Ubalaced Systems Except for the balaced three-phase fault, faults result i a ubalaced system. The most commo types of faults are sigle liegroud

More information

Large holes in quasi-random graphs

Large holes in quasi-random graphs Large holes i quasi-radom graphs Joaa Polcy Departmet of Discrete Mathematics Adam Mickiewicz Uiversity Pozań, Polad joaska@amuedupl Submitted: Nov 23, 2006; Accepted: Apr 10, 2008; Published: Apr 18,

More information

Enhancing Observability in Distribution Grids using Smart Meter Data

Enhancing Observability in Distribution Grids using Smart Meter Data IEEE TRANSACTIONS ON SMART GRID (TO APPEAR, 217) 1 Enhancing Observability in Distribution Grids using Smart Meter Data Siddharth Bhela, Student Member, IEEE, Vassilis Kekatos, Senior Member, IEEE, and

More information

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1 EECS564 Estimatio, Filterig, ad Detectio Hwk 2 Sols. Witer 25 4. Let Z be a sigle observatio havig desity fuctio where. p (z) = (2z + ), z (a) Assumig that is a oradom parameter, fid ad plot the maximum

More information

ENHANCING OBSERVABILITY IN POWER DISTRIBUTION GRIDS

ENHANCING OBSERVABILITY IN POWER DISTRIBUTION GRIDS ENHANCING OBSERVABILITY IN POWER DISTRIBUTION GRIDS Siddharth Bhela, 1 Vassilis Kekatos, 1 Liang Zhang, 2 and Sriharsha Veeramachaneni 3 1 Bradley Dept. of ECE, Virginia Tech, Blacksburg, VA 24061, USA

More information

The Scattering Matrix

The Scattering Matrix 2/23/7 The Scatterig Matrix 723 1/13 The Scatterig Matrix At low frequecies, we ca completely characterize a liear device or etwork usig a impedace matrix, which relates the currets ad voltages at each

More information

Optimization Methods MIT 2.098/6.255/ Final exam

Optimization Methods MIT 2.098/6.255/ Final exam Optimizatio Methods MIT 2.098/6.255/15.093 Fial exam Date Give: December 19th, 2006 P1. [30 pts] Classify the followig statemets as true or false. All aswers must be well-justified, either through a short

More information

Slide Set 13 Linear Model with Endogenous Regressors and the GMM estimator

Slide Set 13 Linear Model with Endogenous Regressors and the GMM estimator Slide Set 13 Liear Model with Edogeous Regressors ad the GMM estimator Pietro Coretto pcoretto@uisa.it Ecoometrics Master i Ecoomics ad Fiace (MEF) Uiversità degli Studi di Napoli Federico II Versio: Friday

More information

Chapter 2. Periodic points of toral. automorphisms. 2.1 General introduction

Chapter 2. Periodic points of toral. automorphisms. 2.1 General introduction Chapter 2 Periodic poits of toral automorphisms 2.1 Geeral itroductio The automorphisms of the two-dimesioal torus are rich mathematical objects possessig iterestig geometric, algebraic, topological ad

More information

Statistical and Mathematical Methods DS-GA 1002 December 8, Sample Final Problems Solutions

Statistical and Mathematical Methods DS-GA 1002 December 8, Sample Final Problems Solutions Statistical ad Mathematical Methods DS-GA 00 December 8, 05. Short questios Sample Fial Problems Solutios a. Ax b has a solutio if b is i the rage of A. The dimesio of the rage of A is because A has liearly-idepedet

More information

Different kinds of Mathematical Induction

Different kinds of Mathematical Induction Differet ids of Mathematical Iductio () Mathematical Iductio Give A N, [ A (a A a A)] A N () (First) Priciple of Mathematical Iductio Let P() be a propositio (ope setece), if we put A { : N p() is true}

More information

Lecture 8. Nonlinear Device Stamping

Lecture 8. Nonlinear Device Stamping PRINCIPLES OF CIRCUIT SIMULATION Lecture 8. Noliear Device Stampig Guoyog Shi, PhD shiguoyog@ic.sjtu.edu.c School of Microelectroics Shaghai Jiao Tog Uiversity Fall -- Slide Outlie Solvig a oliear circuit

More information

State Space Representation

State Space Representation Optimal Cotrol, Guidace ad Estimatio Lecture 2 Overview of SS Approach ad Matrix heory Prof. Radhakat Padhi Dept. of Aerospace Egieerig Idia Istitute of Sciece - Bagalore State Space Represetatio Prof.

More information

Lecture 14: Graph Entropy

Lecture 14: Graph Entropy 15-859: Iformatio Theory ad Applicatios i TCS Sprig 2013 Lecture 14: Graph Etropy March 19, 2013 Lecturer: Mahdi Cheraghchi Scribe: Euiwoog Lee 1 Recap Bergma s boud o the permaet Shearer s Lemma Number

More information

Exploiting Structure in SDPs with Chordal Sparsity

Exploiting Structure in SDPs with Chordal Sparsity Exploitig Structure i SDPs with Chordal Sparsity Atois Papachristodoulou Departmet of Egieerig Sciece, Uiversity of Oxford Joit work with Yag Zheg, Giovai Fatuzzi, Paul Goulart ad Adrew Wy CDC 06 Pre-coferece

More information

10-701/ Machine Learning Mid-term Exam Solution

10-701/ Machine Learning Mid-term Exam Solution 0-70/5-78 Machie Learig Mid-term Exam Solutio Your Name: Your Adrew ID: True or False (Give oe setece explaatio) (20%). (F) For a cotiuous radom variable x ad its probability distributio fuctio p(x), it

More information

Algebra of Least Squares

Algebra of Least Squares October 19, 2018 Algebra of Least Squares Geometry of Least Squares Recall that out data is like a table [Y X] where Y collects observatios o the depedet variable Y ad X collects observatios o the k-dimesioal

More information

Linear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d

Linear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d Liear regressio Daiel Hsu (COMS 477) Maximum likelihood estimatio Oe of the simplest liear regressio models is the followig: (X, Y ),..., (X, Y ), (X, Y ) are iid radom pairs takig values i R d R, ad Y

More information

Smart Inverter Grid Probing for Learning Loads: Part I Identifiability Analysis

Smart Inverter Grid Probing for Learning Loads: Part I Identifiability Analysis IEEE RANSACIONS ON POWER SYSEMS (SUBMIED JUNE 22, 2018) 1 Smart Inverter Grid Probing for Learning Loads: Part I Identifiability Analysis Siddharth Bhela, Student Member, IEEE, Vassilis Kekatos, Senior

More information

Spectral Partitioning in the Planted Partition Model

Spectral Partitioning in the Planted Partition Model Spectral Graph Theory Lecture 21 Spectral Partitioig i the Plated Partitio Model Daiel A. Spielma November 11, 2009 21.1 Itroductio I this lecture, we will perform a crude aalysis of the performace of

More information

Estimation for Complete Data

Estimation for Complete Data Estimatio for Complete Data complete data: there is o loss of iformatio durig study. complete idividual complete data= grouped data A complete idividual data is the oe i which the complete iformatio of

More information

Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES Pearson Education, Inc.

Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES Pearson Education, Inc. 2 Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES 2012 Pearso Educatio, Ic. Theorem 8: Let A be a square matrix. The the followig statemets are equivalet. That is, for a give A, the statemets

More information

Efficient GMM LECTURE 12 GMM II

Efficient GMM LECTURE 12 GMM II DECEMBER 1 010 LECTURE 1 II Efficiet The estimator depeds o the choice of the weight matrix A. The efficiet estimator is the oe that has the smallest asymptotic variace amog all estimators defied by differet

More information

Matrix Algebra 2.2 THE INVERSE OF A MATRIX Pearson Education, Inc.

Matrix Algebra 2.2 THE INVERSE OF A MATRIX Pearson Education, Inc. 2 Matrix Algebra 2.2 THE INVERSE OF A MATRIX MATRIX OPERATIONS A matrix A is said to be ivertible if there is a matrix C such that CA = I ad AC = I where, the idetity matrix. I = I I this case, C is a

More information

Matrix Representation of Data in Experiment

Matrix Representation of Data in Experiment Matrix Represetatio of Data i Experimet Cosider a very simple model for resposes y ij : y ij i ij, i 1,; j 1,,..., (ote that for simplicity we are assumig the two () groups are of equal sample size ) Y

More information

ECE 8527: Introduction to Machine Learning and Pattern Recognition Midterm # 1. Vaishali Amin Fall, 2015

ECE 8527: Introduction to Machine Learning and Pattern Recognition Midterm # 1. Vaishali Amin Fall, 2015 ECE 8527: Itroductio to Machie Learig ad Patter Recogitio Midterm # 1 Vaishali Ami Fall, 2015 tue39624@temple.edu Problem No. 1: Cosider a two-class discrete distributio problem: ω 1 :{[0,0], [2,0], [2,2],

More information

Transient Response Analysis for Temperature Modulated Chemoresistors

Transient Response Analysis for Temperature Modulated Chemoresistors Trasiet Respose Aalysis for Temperature Modulated Chemoresistors R. Gutierrez-Osua 1,2, A. Gutierrez 1,2 ad N. Powar 2 1 Texas A&M Uiversity, Collee Statio, TX 2 Wriht State Uiversity, Dayto, OH Multi-frequecy

More information

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of

More information

4 The Sperner property.

4 The Sperner property. 4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,

More information

Chapter 7 Isoperimetric problem

Chapter 7 Isoperimetric problem Chapter 7 Isoperimetric problem Recall that the isoperimetric problem (see the itroductio its coectio with ido s proble) is oe of the most classical problem of a shape optimizatio. It ca be formulated

More information

Math 152. Rumbos Fall Solutions to Review Problems for Exam #2. Number of Heads Frequency

Math 152. Rumbos Fall Solutions to Review Problems for Exam #2. Number of Heads Frequency Math 152. Rumbos Fall 2009 1 Solutios to Review Problems for Exam #2 1. I the book Experimetatio ad Measuremet, by W. J. Youde ad published by the by the Natioal Sciece Teachers Associatio i 1962, the

More information

On Nonsingularity of Saddle Point Matrices. with Vectors of Ones

On Nonsingularity of Saddle Point Matrices. with Vectors of Ones Iteratioal Joural of Algebra, Vol. 2, 2008, o. 4, 197-204 O Nosigularity of Saddle Poit Matrices with Vectors of Oes Tadeusz Ostrowski Istitute of Maagemet The State Vocatioal Uiversity -400 Gorzów, Polad

More information

Dr. Radhakant Padhi Asst. Professor Dept. of Aerospace Engineering Indian Institute of Science - Bangalore

Dr. Radhakant Padhi Asst. Professor Dept. of Aerospace Engineering Indian Institute of Science - Bangalore Lecture 0 Coversio Betwee State Space ad Trasfer Fuctio Represetatios i Liear Systems II Dr. Radhakat Padhi Asst. Professor Dept. of Aerospace Egieerig Idia Istitute of Sciece - Bagalore A Alterate First

More information

The Expectation-Maximization (EM) Algorithm

The Expectation-Maximization (EM) Algorithm The Expectatio-Maximizatio (EM) Algorithm Readig Assigmets T. Mitchell, Machie Learig, McGraw-Hill, 997 (sectio 6.2, hard copy). S. Gog et al. Dyamic Visio: From Images to Face Recogitio, Imperial College

More information

Geometry of LS. LECTURE 3 GEOMETRY OF LS, PROPERTIES OF σ 2, PARTITIONED REGRESSION, GOODNESS OF FIT

Geometry of LS. LECTURE 3 GEOMETRY OF LS, PROPERTIES OF σ 2, PARTITIONED REGRESSION, GOODNESS OF FIT OCTOBER 7, 2016 LECTURE 3 GEOMETRY OF LS, PROPERTIES OF σ 2, PARTITIONED REGRESSION, GOODNESS OF FIT Geometry of LS We ca thik of y ad the colums of X as members of the -dimesioal Euclidea space R Oe ca

More information

Formulas for the Number of Spanning Trees in a Maximal Planar Map

Formulas for the Number of Spanning Trees in a Maximal Planar Map Applied Mathematical Scieces Vol. 5 011 o. 64 3147-3159 Formulas for the Number of Spaig Trees i a Maximal Plaar Map A. Modabish D. Lotfi ad M. El Marraki Departmet of Computer Scieces Faculty of Scieces

More information

Math 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions

Math 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions Math 451: Euclidea ad No-Euclidea Geometry MWF 3pm, Gasso 204 Homework 3 Solutios Exercises from 1.4 ad 1.5 of the otes: 4.3, 4.10, 4.12, 4.14, 4.15, 5.3, 5.4, 5.5 Exercise 4.3. Explai why Hp, q) = {x

More information

CMSE 820: Math. Foundations of Data Sci.

CMSE 820: Math. Foundations of Data Sci. Lecture 17 8.4 Weighted path graphs Take from [10, Lecture 3] As alluded to at the ed of the previous sectio, we ow aalyze weighted path graphs. To that ed, we prove the followig: Theorem 6 (Fiedler).

More information

PC5215 Numerical Recipes with Applications - Review Problems

PC5215 Numerical Recipes with Applications - Review Problems PC55 Numerical Recipes with Applicatios - Review Problems Give the IEEE 754 sigle precisio bit patter (biary or he format) of the followig umbers: 0 0 05 00 0 00 Note that it has 8 bits for the epoet,

More information

On comparison of different approaches to the stability radius calculation. Olga Karelkina

On comparison of different approaches to the stability radius calculation. Olga Karelkina O compariso of differet approaches to the stability radius calculatio Olga Karelkia Uiversity of Turku 2011 Outlie Prelimiaries Problem statemet Exact method for calculatio stability radius proposed by

More information

Chapter 9 - CD companion 1. A Generic Implementation; The Common-Merge Amplifier. 1 τ is. ω ch. τ io

Chapter 9 - CD companion 1. A Generic Implementation; The Common-Merge Amplifier. 1 τ is. ω ch. τ io Chapter 9 - CD compaio CHAPTER NINE CD-9.2 CD-9.2. Stages With Voltage ad Curret Gai A Geeric Implemetatio; The Commo-Merge Amplifier The advaced method preseted i the text for approximatig cutoff frequecies

More information

CS322: Network Analysis. Problem Set 2 - Fall 2009

CS322: Network Analysis. Problem Set 2 - Fall 2009 Due October 9 009 i class CS3: Network Aalysis Problem Set - Fall 009 If you have ay questios regardig the problems set, sed a email to the course assistats: simlac@staford.edu ad peleato@staford.edu.

More information

Time-Domain Representations of LTI Systems

Time-Domain Representations of LTI Systems 2.1 Itroductio Objectives: 1. Impulse resposes of LTI systems 2. Liear costat-coefficiets differetial or differece equatios of LTI systems 3. Bloc diagram represetatios of LTI systems 4. State-variable

More information

Some special clique problems

Some special clique problems Some special clique problems Reate Witer Istitut für Iformatik Marti-Luther-Uiversität Halle-Witteberg Vo-Seckedorff-Platz, D 0620 Halle Saale Germay Abstract: We cosider graphs with cliques of size k

More information

1. By using truth tables prove that, for all statements P and Q, the statement

1. By using truth tables prove that, for all statements P and Q, the statement Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3

More information

3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials

3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered

More information

15.083J/6.859J Integer Optimization. Lecture 3: Methods to enhance formulations

15.083J/6.859J Integer Optimization. Lecture 3: Methods to enhance formulations 15.083J/6.859J Iteger Optimizatio Lecture 3: Methods to ehace formulatios 1 Outlie Polyhedral review Slide 1 Methods to geerate valid iequalities Methods to geerate facet defiig iequalities Polyhedral

More information

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function. MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied

More information

Lecture 16: Monotone Formula Lower Bounds via Graph Entropy. 2 Monotone Formula Lower Bounds via Graph Entropy

Lecture 16: Monotone Formula Lower Bounds via Graph Entropy. 2 Monotone Formula Lower Bounds via Graph Entropy 15-859: Iformatio Theory ad Applicatios i TCS CMU: Sprig 2013 Lecture 16: Mootoe Formula Lower Bouds via Graph Etropy March 26, 2013 Lecturer: Mahdi Cheraghchi Scribe: Shashak Sigh 1 Recap Graph Etropy:

More information

Nonlinear regression

Nonlinear regression oliear regressio How to aalyse data? How to aalyse data? Plot! How to aalyse data? Plot! Huma brai is oe the most powerfull computatioall tools Works differetly tha a computer What if data have o liear

More information

Introduction to Computational Biology Homework 2 Solution

Introduction to Computational Biology Homework 2 Solution Itroductio to Computatioal Biology Homework 2 Solutio Problem 1: Cocave gap pealty fuctio Let γ be a gap pealty fuctio defied over o-egative itegers. The fuctio γ is called sub-additive iff it satisfies

More information

DG Installation in Distribution System for Minimum Loss

DG Installation in Distribution System for Minimum Loss DG Istallatio i Distributio System for Miimum Loss Aad K Padey Om Mishra Alat Saurabh Kumar EE, JSSATE EE, JSSATE EE, JSSATE EE, JSSATE oida,up oida,up oida,up oida,up Abstract: This paper proposes optimal

More information

Solution to Chapter 2 Analytical Exercises

Solution to Chapter 2 Analytical Exercises Nov. 25, 23, Revised Dec. 27, 23 Hayashi Ecoometrics Solutio to Chapter 2 Aalytical Exercises. For ay ε >, So, plim z =. O the other had, which meas that lim E(z =. 2. As show i the hit, Prob( z > ε =

More information

A Note on the Symmetric Powers of the Standard Representation of S n

A Note on the Symmetric Powers of the Standard Representation of S n A Note o the Symmetric Powers of the Stadard Represetatio of S David Savitt 1 Departmet of Mathematics, Harvard Uiversity Cambridge, MA 0138, USA dsavitt@mathharvardedu Richard P Staley Departmet of Mathematics,

More information

Multinomial likelihood. Multinomial MLE. NIST data and genetic fingerprints. θ = (p 1,..., p m ) with j p j = 1 and p j 0. Point probabilities

Multinomial likelihood. Multinomial MLE. NIST data and genetic fingerprints. θ = (p 1,..., p m ) with j p j = 1 and p j 0. Point probabilities Multiomial distributio Let Y,..., Y be iid, uiformly sampled from a fiite populatio ad X i deotes a property of the idividual i. Label the properties,..., m. p j = PX i = j) = umber of idividuals with

More information

Efficiency of Linear Supply Function Bidding in Electricity Markets

Efficiency of Linear Supply Function Bidding in Electricity Markets Efficiecy of Liear Supply Fuctio Biddig i Electricity Markets Yuazhag Xiao, Chaithaya Badi, ad Ermi Wei 1 Abstract We study the efficiecy loss caused by strategic biddig behavior from power geerators i

More information

On Algorithm for the Minimum Spanning Trees Problem with Diameter Bounded Below

On Algorithm for the Minimum Spanning Trees Problem with Diameter Bounded Below O Algorithm for the Miimum Spaig Trees Problem with Diameter Bouded Below Edward Kh. Gimadi 1,2, Alexey M. Istomi 1, ad Ekateria Yu. Shi 2 1 Sobolev Istitute of Mathematics, 4 Acad. Koptyug aveue, 630090

More information

Complex Analysis Spring 2001 Homework I Solution

Complex Analysis Spring 2001 Homework I Solution Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle

More information

Lecture 4. Hw 1 and 2 will be reoped after class for every body. New deadline 4/20 Hw 3 and 4 online (Nima is lead)

Lecture 4. Hw 1 and 2 will be reoped after class for every body. New deadline 4/20 Hw 3 and 4 online (Nima is lead) Lecture 4 Homework Hw 1 ad 2 will be reoped after class for every body. New deadlie 4/20 Hw 3 ad 4 olie (Nima is lead) Pod-cast lecture o-lie Fial projects Nima will register groups ext week. Email/tell

More information

Mixtures of Gaussians and the EM Algorithm

Mixtures of Gaussians and the EM Algorithm Mixtures of Gaussias ad the EM Algorithm CSE 6363 Machie Learig Vassilis Athitsos Computer Sciece ad Egieerig Departmet Uiversity of Texas at Arligto 1 Gaussias A popular way to estimate probability desity

More information

Eigenvalues and Eigenvectors

Eigenvalues and Eigenvectors 5 Eigevalues ad Eigevectors 5.3 DIAGONALIZATION DIAGONALIZATION Example 1: Let. Fid a formula for A k, give that P 1 1 = 1 2 ad, where Solutio: The stadard formula for the iverse of a 2 2 matrix yields

More information

Computational Analysis of IEEE 57 Bus System Using N-R Method

Computational Analysis of IEEE 57 Bus System Using N-R Method Vol 4, Issue 11, November 2015 Computatioal Aalysis of IEEE 57 Bus System Usig N-R Method Pooja Sharma 1 ad Navdeep Batish 2 1 MTech Studet, Dept of EE, Sri SAI Istitute of Egieer &Techology, Pathakot,

More information

1 General linear Model Continued..

1 General linear Model Continued.. Geeral liear Model Cotiued.. We have We kow y = X + u X o radom u v N(0; I ) b = (X 0 X) X 0 y E( b ) = V ar( b ) = (X 0 X) We saw that b = (X 0 X) X 0 u so b is a liear fuctio of a ormally distributed

More information

11 Correlation and Regression

11 Correlation and Regression 11 Correlatio Regressio 11.1 Multivariate Data Ofte we look at data where several variables are recorded for the same idividuals or samplig uits. For example, at a coastal weather statio, we might record

More information

CS284A: Representations and Algorithms in Molecular Biology

CS284A: Representations and Algorithms in Molecular Biology CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by

More information

Lecture 12: November 13, 2018

Lecture 12: November 13, 2018 Mathematical Toolkit Autum 2018 Lecturer: Madhur Tulsiai Lecture 12: November 13, 2018 1 Radomized polyomial idetity testig We will use our kowledge of coditioal probability to prove the followig lemma,

More information

Applications in Linear Algebra and Uses of Technology

Applications in Linear Algebra and Uses of Technology 1 TI-89: Let A 1 4 5 6 7 8 10 Applicatios i Liear Algebra ad Uses of Techology,adB 4 1 1 4 type i: [1,,;4,5,6;7,8,10] press: STO type i: A type i: [4,-1;-1,4] press: STO (1) Row Echelo Form: MATH/matrix

More information

Optimally Sparse SVMs

Optimally Sparse SVMs A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but

More information

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING ECE 06 Summer 07 Problem Set #5 Assiged: Jue 3, 07 Due Date: Jue 30, 07 Readig: Chapter 5 o FIR Filters. PROBLEM 5..* (The

More information

Study on Coal Consumption Curve Fitting of the Thermal Power Based on Genetic Algorithm

Study on Coal Consumption Curve Fitting of the Thermal Power Based on Genetic Algorithm Joural of ad Eergy Egieerig, 05, 3, 43-437 Published Olie April 05 i SciRes. http://www.scirp.org/joural/jpee http://dx.doi.org/0.436/jpee.05.34058 Study o Coal Cosumptio Curve Fittig of the Thermal Based

More information

Summary and Discussion on Simultaneous Analysis of Lasso and Dantzig Selector

Summary and Discussion on Simultaneous Analysis of Lasso and Dantzig Selector Summary ad Discussio o Simultaeous Aalysis of Lasso ad Datzig Selector STAT732, Sprig 28 Duzhe Wag May 4, 28 Abstract This is a discussio o the work i Bickel, Ritov ad Tsybakov (29). We begi with a short

More information

Correlation Regression

Correlation Regression Correlatio Regressio While correlatio methods measure the stregth of a liear relatioship betwee two variables, we might wish to go a little further: How much does oe variable chage for a give chage i aother

More information

Asymptotic Coupling and Its Applications in Information Theory

Asymptotic Coupling and Its Applications in Information Theory Asymptotic Couplig ad Its Applicatios i Iformatio Theory Vicet Y. F. Ta Joit Work with Lei Yu Departmet of Electrical ad Computer Egieerig, Departmet of Mathematics, Natioal Uiversity of Sigapore IMS-APRM

More information

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity

More information

# fixed points of g. Tree to string. Repeatedly select the leaf with the smallest label, write down the label of its neighbour and remove the leaf.

# fixed points of g. Tree to string. Repeatedly select the leaf with the smallest label, write down the label of its neighbour and remove the leaf. Combiatorics Graph Theory Coutig labelled ad ulabelled graphs There are 2 ( 2) labelled graphs of order. The ulabelled graphs of order correspod to orbits of the actio of S o the set of labelled graphs.

More information

AN OPEN-PLUS-CLOSED-LOOP APPROACH TO SYNCHRONIZATION OF CHAOTIC AND HYPERCHAOTIC MAPS

AN OPEN-PLUS-CLOSED-LOOP APPROACH TO SYNCHRONIZATION OF CHAOTIC AND HYPERCHAOTIC MAPS http://www.paper.edu.c Iteratioal Joural of Bifurcatio ad Chaos, Vol. 1, No. 5 () 119 15 c World Scietific Publishig Compay AN OPEN-PLUS-CLOSED-LOOP APPROACH TO SYNCHRONIZATION OF CHAOTIC AND HYPERCHAOTIC

More information

S1 Notation and Assumptions

S1 Notation and Assumptions Statistica Siica: Supplemet Robust-BD Estimatio ad Iferece for Varyig-Dimesioal Geeral Liear Models Chumig Zhag Xiao Guo Che Cheg Zhegju Zhag Uiversity of Wiscosi-Madiso Supplemetary Material S Notatio

More information

IP Reference guide for integer programming formulations.

IP Reference guide for integer programming formulations. IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more

More information

Preponderantly increasing/decreasing data in regression analysis

Preponderantly increasing/decreasing data in regression analysis Croatia Operatioal Research Review 269 CRORR 7(2016), 269 276 Prepoderatly icreasig/decreasig data i regressio aalysis Darija Marković 1, 1 Departmet of Mathematics, J. J. Strossmayer Uiversity of Osijek,

More information

Linear Algebra Issues in Wireless Communications

Linear Algebra Issues in Wireless Communications Rome-Moscow school of Matrix Methods ad Applied Liear Algebra August 0 September 18, 016 Liear Algebra Issues i Wireless Commuicatios Russia Research Ceter [vladimir.lyashev@huawei.com] About me ead of

More information

Disjoint unions of complete graphs characterized by their Laplacian spectrum

Disjoint unions of complete graphs characterized by their Laplacian spectrum Electroic Joural of Liear Algebra Volume 18 Volume 18 (009) Article 56 009 Disjoit uios of complete graphs characterized by their Laplacia spectrum Romai Boulet boulet@uiv-tlse.fr Follow this ad additioal

More information

ADVANCED DIGITAL SIGNAL PROCESSING

ADVANCED DIGITAL SIGNAL PROCESSING ADVANCED DIGITAL SIGNAL PROCESSING PROF. S. C. CHAN (email : sccha@eee.hku.hk, Rm. CYC-702) DISCRETE-TIME SIGNALS AND SYSTEMS MULTI-DIMENSIONAL SIGNALS AND SYSTEMS RANDOM PROCESSES AND APPLICATIONS ADAPTIVE

More information

ALMOST-SCHUR LEMMA CAMILLO DE LELLIS AND PETER M. TOPPING

ALMOST-SCHUR LEMMA CAMILLO DE LELLIS AND PETER M. TOPPING ALOST-SCHU LEA CAILLO DE LELLIS AND PETE. TOPPING. Itroductio Schur s lemma states that every Eistei maifold of dimesio 3 has costat scalar curvature. Here, g) is defied to be Eistei if its traceless icci

More information

Period Function of a Lienard Equation

Period Function of a Lienard Equation Joural of Mathematical Scieces (4) -5 Betty Joes & Sisters Publishig Period Fuctio of a Lieard Equatio Khalil T Al-Dosary Departmet of Mathematics, Uiversity of Sharjah, Sharjah 77, Uited Arab Emirates

More information

IJITE Vol.2 Issue-11, (November 2014) ISSN: Impact Factor

IJITE Vol.2 Issue-11, (November 2014) ISSN: Impact Factor IJITE Vol Issue-, (November 4) ISSN: 3-776 ATTRACTIVITY OF A HIGHER ORDER NONLINEAR DIFFERENCE EQUATION Guagfeg Liu School of Zhagjiagag Jiagsu Uiversit of Sciece ad Techolog, Zhagjiagag, Jiagsu 56,PR

More information

SRC Technical Note June 17, Tight Thresholds for The Pure Literal Rule. Michael Mitzenmacher. d i g i t a l

SRC Technical Note June 17, Tight Thresholds for The Pure Literal Rule. Michael Mitzenmacher. d i g i t a l SRC Techical Note 1997-011 Jue 17, 1997 Tight Thresholds for The Pure Literal Rule Michael Mitzemacher d i g i t a l Systems Research Ceter 130 Lytto Aveue Palo Alto, Califoria 94301 http://www.research.digital.com/src/

More information

Lecture 22: Review for Exam 2. 1 Basic Model Assumptions (without Gaussian Noise)

Lecture 22: Review for Exam 2. 1 Basic Model Assumptions (without Gaussian Noise) Lecture 22: Review for Exam 2 Basic Model Assumptios (without Gaussia Noise) We model oe cotiuous respose variable Y, as a liear fuctio of p umerical predictors, plus oise: Y = β 0 + β X +... β p X p +

More information

5.3 Preconditioning. - M is easy to deal with in parallel (reduced approximate direct solver)

5.3 Preconditioning. - M is easy to deal with in parallel (reduced approximate direct solver) 5.3 Precoditioig Direct solvers: Sequetial, loosig sparsity terative solvers: easy parallel ad sparse, but possibly slowly coverget Combiatio of both methods: clude precoditioer i the form - x - b, such

More information

Quantile regression with multilayer perceptrons.

Quantile regression with multilayer perceptrons. Quatile regressio with multilayer perceptros. S.-F. Dimby ad J. Rykiewicz Uiversite Paris 1 - SAMM 90 Rue de Tolbiac, 75013 Paris - Frace Abstract. We cosider oliear quatile regressio ivolvig multilayer

More information

Chandrasekhar Type Algorithms. for the Riccati Equation of Lainiotis Filter

Chandrasekhar Type Algorithms. for the Riccati Equation of Lainiotis Filter Cotemporary Egieerig Scieces, Vol. 3, 00, o. 4, 9-00 Chadrasekhar ype Algorithms for the Riccati Equatio of Laiiotis Filter Nicholas Assimakis Departmet of Electroics echological Educatioal Istitute of

More information

SNAP Centre Workshop. Basic Algebraic Manipulation

SNAP Centre Workshop. Basic Algebraic Manipulation SNAP Cetre Workshop Basic Algebraic Maipulatio 8 Simplifyig Algebraic Expressios Whe a expressio is writte i the most compact maer possible, it is cosidered to be simplified. Not Simplified: x(x + 4x)

More information

Discrete probability distributions

Discrete probability distributions Discrete probability distributios I the chapter o probability we used the classical method to calculate the probability of various values of a radom variable. I some cases, however, we may be able to develop

More information

ON POINTWISE BINOMIAL APPROXIMATION

ON POINTWISE BINOMIAL APPROXIMATION Iteratioal Joural of Pure ad Applied Mathematics Volume 71 No. 1 2011, 57-66 ON POINTWISE BINOMIAL APPROXIMATION BY w-functions K. Teerapabolar 1, P. Wogkasem 2 Departmet of Mathematics Faculty of Sciece

More information

Machine Learning Regression I Hamid R. Rabiee [Slides are based on Bishop Book] Spring

Machine Learning Regression I Hamid R. Rabiee [Slides are based on Bishop Book] Spring Machie Learig Regressio I Hamid R. Rabiee [Slides are based o Bishop Book] Sprig 015 http://ce.sharif.edu/courses/93-94//ce717-1 Liear Regressio Liear regressio: ivolves a respose variable ad a sigle predictor

More information

Inverse Matrix. A meaning that matrix B is an inverse of matrix A.

Inverse Matrix. A meaning that matrix B is an inverse of matrix A. Iverse Matrix Two square matrices A ad B of dimesios are called iverses to oe aother if the followig holds, AB BA I (11) The otio is dual but we ofte write 1 B A meaig that matrix B is a iverse of matrix

More information

BHW #13 1/ Cooper. ENGR 323 Probabilistic Analysis Beautiful Homework # 13

BHW #13 1/ Cooper. ENGR 323 Probabilistic Analysis Beautiful Homework # 13 BHW # /5 ENGR Probabilistic Aalysis Beautiful Homework # Three differet roads feed ito a particular freeway etrace. Suppose that durig a fixed time period, the umber of cars comig from each road oto the

More information

11 THE GMM ESTIMATION

11 THE GMM ESTIMATION Cotets THE GMM ESTIMATION 2. Cosistecy ad Asymptotic Normality..................... 3.2 Regularity Coditios ad Idetificatio..................... 4.3 The GMM Iterpretatio of the OLS Estimatio.................

More information

HELM An outline EleQuant, Inc. 1

HELM An outline  EleQuant, Inc. 1 HELM A outlie 1 Power Flow: Problem Statemet The equatios 1) The ukows 2) Y a V a a all all \ swig S sw = y zip) + I zip) + S = y zip) sw I zip) sw + Y sw,a V a a { all} = Re ) + j Im ) = e jθ ; all \

More information

Notes for Lecture 11

Notes for Lecture 11 U.C. Berkeley CS78: Computatioal Complexity Hadout N Professor Luca Trevisa 3/4/008 Notes for Lecture Eigevalues, Expasio, ad Radom Walks As usual by ow, let G = (V, E) be a udirected d-regular graph with

More information