Background: State Estimation
|
|
|
- Megan Hall
- 10 years ago
- Views:
Transcription
1 State Estimation Cyber Security of the Smart Grid Dr. Deepa Kundur Background: State Estimation University of Toronto Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 1 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 2 / 81 State Estimation Operating States of a Power System Normal State State Estimation operating conditions of a power system at a particular time can be determined if the following are known: network model complex phasor voltages at every bus the power system can move into one of the three possible states: normal emergency restorative all the loads in the system can be supplied power by the existing generators without violating any operating constraints; constraint examples: maximum generation levels, min/max bus voltages, etc. A system in the normal state can be classified as: secure: the system can remain in normal state following the occurrence of a critical contingency (line outage, generator outage) insecure: the system cannot remain in normal state with the occurrence of a critical contingency Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 3 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 4 / 81
2 State Estimation State Estimation Emergency State Restorative State violation of some of the operating constraints while the power system continues to supply power to all the loads must bring it back to normal state using corrective actions in emergency state corrective control measures applied; examples: disconnecting loads disconnecting lines disconnecting transformers disconnecting other equipment... in order to stabilize/eliminate operating limit violations in reduced configuration restore the load versus generator balance to supply power to all the loads Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 5 / 81 State Estimation Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 6 / 81 State Estimation Power System Security Analysis RESTORATIVE CONTROLS Normal State SECURE/ INSECURE INSECURE + CRITICAL CONTINGENCY 1. continuous monitoring of the system conditions PARTIAL OR TOTAL BLACKOUT Restorative State CORRECTIVE ACTION Emergency State OPERATIONAL LIMITS ARE VIOLATED 2. identification of the operating state 3. determination of the necessary preventative action in case the system state is found to be insecure Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 7 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 8 / 81
3 State Estimation State Estimation State Estimation State Estimator: facilitate accurate and efficient monitoring of the operational constraints; estimates transmission line loadings, bus voltages conducted in SCADA system leading to the establishment of an Energy Management System provides information to analyze contingencies and determine corrective actions acts like a filter between the raw measurements received from the system and all the application functions that require the most reliable data base for current state of the system State Estimator Functions From Abur and Expósito (2004): Topology processor: gathers status data about the circuit breakers and switches and configures the single-line diagram of the system. Observability analysis: determines if a state estimation solution for the entire system can be obtained using the available set of measurements (Q: Is the problem underdetermined?); identifies the unobservable branches and the observable islands in the system if any exist. State estimation solution: determines the optimal estimate for the system state, which is composed of complex bus voltages in the entire power system, based on the network model and the gathered measurements from the system; also provides the best estimates for all the line flows, loads, transformer taps and generator outputs. Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 9 / 81 State Estimation State Estimator Functions Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 10 / 81 State Estimation Adapted from Abur and Expósito (2004): From Abur and Expósito (2004): Bad data processing: detects the existence of gross errors in the measurement set; identifies and eliminates bad measurements provided that there is enough redundancy in the measurement configuration Parameter and structural error processing: estimates various network parameters such as transmission line model parameters, tap changing transformer parameters, shunt capacitor or reactor parameters; detects structural errors in the network configuration and identifies the erroneous breaker status provided that there is enough measurement redundancy Emergency Control Restorative Control Measurements STATE ESTIMATION Emergency State? Restorative Contingency Analysis Secure? Security Constrained OPF Normal YES NO (Normal Insecure State) Load Forecasting Normal Secure State Topology Processor External Equivalents Preventive Action Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 11 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 12 / 81
4 Overview Contributions Paper Overview: against State Estimation in Electric Power Grids by Yao Liu, Peng Ning and Michael K. Reiter introduce false data injection attacks demonstrate how an opponent can make use of information on the power system to create malicious errors into state estimation variables bypass bad data detection methods consider different scenarios: constrained to adding attack errors to k specific meters or any subset of k meters construct attack vectors and assess them via simulations on IEEE test systems Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 13 / 81 How can one corrupt measurements? the physical availability of meters makes it possible for an opponent to tamper them and change the value that they sense: Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 14 / 81 What can potentially occur if meter measurements are inaccurate? can fabricate measurements completely state estimation results will be incorrect can add a bias to meter measurements can conduct a denial-of-service and not report meter measurements incorrect decision-making resulting in incorrect control operations leading to devastating effects... Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 15 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 16 / 81
5 Adapted from Abur and Expósito (2004): Bad Data Detection Measurements Emergency Control Restorative Control STATE ESTIMATION Emergency State? Restorative Contingency Analysis Secure? Security Constrained OPF Normal YES NO (Normal Insecure State) Load Forecasting Normal Secure State Topology Processor External Equivalents algorithms exist that attempt to detect bad data and them remove them from state estimation Q: Can bad data detection algorithms be overcome? A: Possibly, if an opponent has knowledge of the configuration of the power system. Preventive Action Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 17 / 81 State Estimation Problem in this Paper Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 18 / 81 State Estimation Problem in this Paper Estimate power system state variable x = (x 1, x 2,..., x n ) T based on the meter measurements z = (z 1, z 2,..., z m ) T where n, m Z + and x j, z i R for j = 1, 2,..., n and i = 1, 2,..., m. Specifically, assuming e = (e 1, e 2,..., e m ) T where e i R, i = 1, 2,..., m are measurement errors; the state variables are related to the measurements as follows: z = h(x) + e where h(x) = (h 1 (x 1, x 2,..., x n ),..., h m (x 1, x 2,..., x n )) T, the state estimation problem is to find an estimate ˆx of x that is the best fit of the measurement z above. Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 19 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 20 / 81
6 Linearization: DC Power Flow Model Linear State Estimation Problem The original generally nonlinear relationship through linearization becomes z = h(x) + e where H = (h i,j ) m n z = Hx + e where H = (h i,j ) m n. z = Hx + e Note: physically H is dependent on the topology and line impedances of the power system and is constant. State estimation problem: How can we find the best fit ˆx for a given z? We have n unknowns and m equations. Typically m n = OVERDETERMINED SYSTEM Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 21 / 81 Common Estimation Approaches maximum likelihood criterion: selects estimation of x that produces (with the greatest probability) the observed data z for a given statistical model of e; formulated as a maximization of a likelihood function weighted least-square criterion: minimizes weighted sum of squares of errors for solving each equation of the overdetermined system; squared error for ith Eq: (z i j h i,jx j ) 2 minimum variance criterion: solution that minimizes the variance of the estimate of x assuming a statistical model for e Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 22 / 81 Common Estimation Approaches Assuming that e is zero mean and Gaussian, all estimators result in the SAME solution: where W = ˆx = (H T WH) 1 H T Wz σ σ σm 2 and σi 2 is the variance of the ith meter s measurement noise, for i = 1, 2,..., m. Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 23 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 24 / 81
7 Bad Data Detection Bad Data Detection bad measurements may be incidental, accidental or malicious techniques to detect bad measurements and then remove them from state estimation have been developed; exploit the fact that there is a statistical inconsistency amongst good and bad measurements exploit measurement residual: z Hˆx where z observed measurements and Hˆx estimated measurements Using the L 2 -norm of the residual and comparing it to a threshold: No bad data detected if: Bad data detected if: z Hˆx τ z Hˆx > τ Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 25 / 81 Bad Data Detection Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 26 / 81 Attacks of Interest to Power Systems Community Attacks on: Q: Can z Hˆx > τ detect false data inject attacks? A: Not always. timeliness of measurement data: attacks could involve disrupting communications routing, applying a denial-of-service attack on a critical communication link, flooding the network with bogus data to create congestion and slow down communications, etc. accuracy of measurement data: attacks could involve injecting fabricated measurement readings into the network, modifying measurement readings, changing the timestamp of measurement readings, etc. Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 27 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 28 / 81
8 Attack Model Two goals: Random attack: attacker aims to find any attack vector (measurement bias) as long as it can result in a wrong estimation of x Targeted attack: attacker aims to find an attack vector that can inject a specific error into certain state variables (and either no error or any possible error into the remaining state variables) Note: the random attack is easier to apply, but the targeted attack has the potential to cause more damage; trade-off between ease of attack and impact Attack Model Two restrictions on resources: : opponent can only access and inject attack data into specific predefined meters; for example, some meters may be more susceptible to attack due to proximity or (lack of) physical protection : opponent can access up to any k meters (within the total set of meters); attacker is limited in the resources required to compromise meters, but is free to select which meters are compromised Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 29 / 81 Attack Model Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 30 / 81 Impact on State Estimate The vector of observed measurements that may contain malicious data is given by z a = z + a where z = (z 1, z 2,..., z m ) T is a vector of original measurements and a = (a 1, a 2,..., a m ) T is the attack vector which is added to the original meter readings If a i 0, then the ith meter has been compromised. The original measurement z i has been replaced with the phony z ai = z i + a i. Let ˆx be the state estimate of x using the original measurement z. Let ˆx bad be the state estimate of x using the malicious measurement z a = z + a. We can represent ˆx bad = ˆx + c where c 0 and is called the estimation error injected by the opponent Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 31 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 32 / 81
9 Theorem 1 (Liu et al., 2009) Suppose the original measurements z can pass the bad data detection. The malicious measurements z a = z + a can pass the bad measurement detection if a is a linear combination of column vectors of H; i.e., a = Hc. Proof: Since z can pass the detection, we can assume z Hˆx τ and: z a Hx bad = z + a H(ˆx + c) = z + a Hˆx Hc = z Hˆx + } a {{ Hc } = z Hˆx τ =0 False Data Injection Attack Definition: False Data Injection Attack attack in which the attack vector a equals Hc, where c is an arbitrary non-zero vector. A False Data Injection Attack allows an opponent to bypass bad data detection while changing the result of state estimation by effectively corrupting the measurements. Therefore, z a can also pass bad data detection. Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 33 / 81 False Data Injection Attack Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 34 / 81 Attack Model a = Hc= n c j h j Let H = (h 1, h 2,..., h n ) where h i = (h 1,i,..., h m,i ) T is the ith column vector of H. j=1 Therefore, in a false data injection attack a is a linear combination of the column vectors of H. Two restrictions on resources: : opponent can only access and inject attack data into specific predefined meters; for example, some meters may be more susceptible to attack due to proximity or (lack of) physical protection : opponent can access up to any k meters (within the total set of meters); attacker is limited in the resources required to compromise meters, but is free to select which meters are compromised Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 35 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 36 / 81
10 Scenario I: opponent can only access and inject attack data into specific predefined meters; for example, some meters may be more susceptible to attack due to proximity or (lack of) physical protection assume attacker has access to k specific meters from the set: I m = {i 1, i 2,..., i k } Thus, attacker can modify measurement z ij where i j I m. Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 37 / 81 False Data Injection Attack in Scenario I Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 38 / 81 Scenario I: To launch a false data injection attack, the attack vector a must obey the following restrictions: 1. a a = (a 1,..., a m ) T such that a i = 0 for i I m. 3. a is a linear combination of the column vectors of H; that is, a = Hc for any non-zero vector c. Random false data injection attack: The state estimation error vector c can be of any value; that is, as long as a valid attack vector a can be found, then this attack is fulfilled. Targeted false data injection attack Constrained Case: The state estimation error vector c has to be a specific value for a certain set of state elements and zero for the remaining state elements. Targeted false data injection attack Unconstrained Case: The state estimation error vector c has to be a specific value for a certain set of state elements and any value for the remaining state elements. Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 39 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 40 / 81
11 Random False Data Injection Attack a = (a 1,..., a m ) T = Hc for any non-zero vector c with a i = 0 for i I m. Random False Data Injection Attack The state estimation error vector c can be of any value; that is, as long as a valid attack vector a can be found, then this attack is fulfilled. IDEA: Transform the problem such that it is independent of c. Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 41 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 42 / 81 Random False Data Injection Attack Let P = H(H T H) 1 H T. Let B = P I. Consider Therefore, where c R n. a = Hc Ba = 0 a = Hc Pa = PHc = H(H T H) 1 H T Hc = H(H T H) 1 (H T H)c = Hc Pa = Hc = a Pa a = 0 (P I)a = 0 Ba = 0 A random false data injection attack can be constructed if an attack vector a is found that fulfills: a 0 Ba = 0. a = (0,..., 0, a i1, 0,..., 0, a i2, 0,..., 0, a ik, 0,..., 0) T where a ij R and I m = {i 1, i 2,..., i k }. Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 43 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 44 / 81
12 This can be further reduced as follows: Random False Data Injection Attack Let a = (0,..., 0, a i1, 0,..., 0, a i2, 0,..., 0, a ik, 0,..., 0) T. Let B = (b 1,..., b m ) where b i is a m 1 column vector for i = 1,..., m. Therefore, Ba = 0 B a = 0 Ba = (..., b i1,..., b i2,..., b ik,...)(0,..., 0, a i1, 0,..., 0, a i2, 0,..., 0, a ik, 0,..., 0) T = (b i1, b i2,..., b ik ) (a i1, a i2,..., a ik ) T = B a } {{ } } {{ } =B =a Note that a = 0 is a solution to the above equations, but it is not a valid attack vector. For there to be a non-zero, solution B must be rank deficient. Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 45 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 46 / 81 Dimensionality Dimensionality and Rank Recall, P = H(H T H) 1 H T and B = P I. Therefore, the dimensions of B is equal to the dimensions of P: H (m n) ((H T ) (n m) H (m n) ) 1 (H T ) (n m) = P m m B therefore has dimensions: m m. B therefore has dimensions: m k; since we are removing all columns but k from the set I m = {i 1, i 2,..., i k }. Note: If the rank(b ) = k, then a = 0 is a unique solution and no attack vector exists. It is possible that an attack vector does not exist if k is too small; that is, the set of meters that have been compromised is too small to enable an attack that will not be detected by bad data detection. It can be shown, however, that an attack vector exists if k m n Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 47 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 48 / 81
13 Theorem 2 (Liu et al., 2009) If the attacker can compromise k specific meters, where k m n + 1, there always exist attack vectors a = Hc such that a 0 and a i = 0 for i I m. Proof: Please see paper for proof. makes use of matrix projection theory, rank theory and notions of eigenvalues Constrained Targeted False Data Injection Attack Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 49 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 50 / 81 Targeted False Data Injection Attack Constrained The state estimation error vector c has to be a specific value for a certain set of state elements and zero for the remaining state elements. Recall the salient relationships: ˆx = (H T WH) 1 H T Wz z a = z + a ˆx bad = (H T WH) 1 H T Wz a If a = Hc, then ˆx bad = ˆx + c: Let I v = {j 1, j 2,..., j r } where r < n denote the set of indices of the r target state variables chosen by opponent. That is, the opponent has selected to add specific biases only to x j1, x j2,..., x jr. ˆx bad = (H T WH) 1 H T Wz a = (H T WH) 1 H T W(z + a) = (H T WH) 1 H T Wz + (H T WH) 1 H T Wa = (H T WH) 1 H T Wz + (H T WH) 1 H T W(Hc) = (H T WH) 1 H T Wz + (H T WH) 1 (H T WH) c } {{ } } {{ } =ˆx =I = ˆx + c Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 51 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 52 / 81
14 Targeted False Data Injection Attack Constrained Targeted False Data Injection Attack Constrained Overall, the attack vector a must be constructed such that: ˆx bad = ˆx + c; in other words, a = Hc c = (0,..., 0, c j1, 0,..., 0, c j2, 0,..., 0, c jr, 0,..., 0) T a = (0,..., 0, a i1, 0,..., 0, a i2, 0,..., 0, a ik, 0,..., 0) T a 0 Note: It may not be possible that such an a exists! To determine if a constrained attack exists: 1. Compute: a = Hc. 2. Check whether: a i 0 for i I m. If true, then biases need to be added to measurement devices that haven t been corrupted. Therefore, it is not possible to successfully construct or apply a constrained targeted false data injection attack. Otherwise, the constrained targeted false data inject attack exists and the corresponding attack vector is: a = Hc Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 53 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 54 / 81 Targeted False Data Inj Attack Unconstrained Unconstrained Targeted False Data Injection Attack The state estimation error vector c has to be a specific value for a certain set of state elements and any value for the remaining state elements. Let I v = {j 1, j 2,..., j r } where r < n denote the set of indices of the r target state variables chosen by opponent. That is, the opponent has selected to add specific biases to x j1, x j2,..., x jr. The other states may or may not exhibit biases. Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 55 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 56 / 81
15 Targeted False Data Inj Attack Unconstrained Let H s = (h j1,..., h jn r ) where j t I v for 1 t n r. Let c s = (c j1,..., c jn r ) T where j t I v for 1 t n r. Let b = j I v h j c j. Overall, the attack vector a must be constructed such that: ˆx bad = ˆx + c; in other words, a = Hc c = (x 1a,..., x 1b, c i1, x 2a,..., x 2b, c i2, x 3a,..., x 3b, c ir, x (r+1)a,..., x (r+1)b ) T where x ns R. a = (0,..., 0, a i1, 0,..., 0, a i2, 0,..., 0, a ik, 0,..., 0) T a 0 Let P s = H s (H T s H s ) 1 H T s. Let B s = P s I. Let y = B s b. a = Hc = i I v h i c i + j I v h j c j = H s c s + b H s c s = a b P s a = P s (H s c s + b) = P s H s c s + P s b = H s (H T s H s ) 1 H T s H s c s + P s b = H s (H T s H s ) 1 } {{ } (HT s H s ) } {{ } c s + P s b = H s c s + P s b = a b + P s b Therefore, (P s I)a = (P s I)b B s a = B s b B s a = y Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 57 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 58 / 81 Targeted False Data Inj Attack Unconstrained Targeted False Data Inj Attack Unconstrained Therefore, a = Hc B s a = y It can be shown that: if rank(b s) = rank(b s y), then there exist an infinite number of solutions for a given by: Since a = (0,..., 0, a i1, 0,..., 0, a i2, 0,..., 0, a ik, 0,..., 0) T. Let B s = (b si1,..., b sik ). Let a = (a i1,..., a ik ) T. a = B s y + (I B s B s )d where B s is the 1-inverse of matrix B s; that is, B sb s B s = B s and d is an arbitrary non-zero k 1 vector. a = Hc B s a = y B sa = y otherwise there is no solution for a. Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 59 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 60 / 81
16 Why? Note: rank(b s) = rank(b s y), is required to ensure a consistent system of m equations and n unknowns. For there to be a solution for a then, y must be in the range of B s (a.k.a. column-space of B s) B sa = y Why? Note: Since B sb s B s = B s, B sa = y B sb s B sa = y B sb s B sa }{{} = y =y Therefore, one solution is given by: B sb s y = y B s B s y } {{ } = y =a a = B s y Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 61 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 62 / 81 Why Note: If a = B s y is a solution to B sa = y, then so is a = B s y + (I B s B s)d } {{ } nullspace(b s ) for an arbitrary vector d because (I B s B s) spans the nullspace of B s: Therefore, if rank(b s) = rank(b s y), an infinite number of attack vectors can be constructed as follows: a = B s y + (I B s B s )d where d is an arbitrary k 1 vector such that a 0. B s(i B s B s) = B s B sb s B s = B s B sb s B s } {{ } =B s = B s B s = 0 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 63 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 64 / 81
17 Scenario II: Limited Resources to Compromise Meters Limited Resources to Compromise Meters opponent can access up to any k meters (within the total set of meters); attacker is limited in the resources required to compromise meters, but is free to select which meters are compromised if up to any k meters can be compromised, an opponent must find an attack vector a 0 with at most k non-zero elements. A m 1 vector with at most k non-zero elements is denoted a k-sparse vector. Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 65 / 81 Scenario II: Limited Resources to Compromise Meters In comparison to Scenario I:, the construction of this attack is easier. Existence of attack vector in Scenario I = Existence of attack vector in Scenario II Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 66 / 81 False Data Injection Attack in Scenario II To launch a false data injection attack, the attack vector a must obey the following restrictions: 1. a a must be a k-sparse vector. 3. a is a linear combination of the column vectors of H; that is, a = Hc for any non-zero vector c. Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 67 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 68 / 81
18 Scenario II: Limited Resources to Compromise Meters Random false data injection attack: The state estimation error vector c can be of any value; that is, as long as a valid attack vector a can be found, then this attack is fulfilled. Targeted false data injection attack Constrained Case: The state estimation error vector c has to be a specific value for a certain set of state elements and zero for the remaining state elements. Random False Data Injection Attack Targeted false data injection attack Unconstrained Case: The state estimation error vector c has to be a specific value for a certain set of state elements and any value for the remaining state elements. Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 69 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 70 / 81 Random False Data Injection Attack Constructing attack vectors is not so prescriptive due to the constraint that a is k-sparse. Brute force search for attack vectors will require searching through all possible k-sparse vectors which is time consuming as there are on the order of ( m k ) possible k-sparse vectors. Constrained Targeted False Data Injection Attack IDEA: since a is a linear combination of column vectors of H, then conduct column transformations on H to reduce the number of non-zero elements in each row; use the column vectors with no more than k non-zero entries as attack vectors. Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 71 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 72 / 81
19 Targeted False Data Injection Attack Constrained Targeted False Data Injection Attack Constrained The state estimation error vector c has to be a specific value for a certain set of state elements and zero for the remaining state elements. Let I v = {j 1, j 2,..., j r } where r < n denote the set of indices of the r target state variables chosen by opponent. That is, the opponent has selected to add specific biases only to x j1, x j2,..., x jr. Overall, the attack vector a must be constructed such that: ˆx bad = ˆx + c; in other words, a = Hc c = (0,..., 0, c j1, 0,..., 0, c j2, 0,..., 0, c jr, 0,..., 0) T a is a k-sparse vector. a 0 Note: It may not be possible that such an a exists! Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 73 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 74 / 81 Targeted False Data Injection Attack Constrained To determine if a constrained attack exists: 1. Compute: a = Hc. 2. Check whether: a is k-sparse. If true, the constrained targeted false data inject attack exists and the corresponding attack vector is: a = Hc Unconstrained Targeted False Data Injection Attack Otherwise, biases need to be added to more than k measurement devices, which is beyond the opponent s resources. Therefore, it is not possible to successfully construct or apply a constrained targeted false data injection attack. Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 75 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 76 / 81
20 Targeted False Data Inj Attack Unconstrained Targeted False Data Inj Attack Unconstrained The state estimation error vector c has to be a specific value for a certain set of state elements and any value for the remaining state elements. Let I v = {j 1, j 2,..., j r } where r < n denote the set of indices of the r target state variables chosen by opponent. That is, the opponent has selected to add specific biases to x ji1, x j2,..., x jr. The other states may or may not exhibit biases. Overall, the attack vector a must be constructed such that: ˆx bad = ˆx + c; in other words, a = Hc B s a = y c = (x 1a,..., x 1b, c i1, x 2a,..., x 2b, c i2, x 3a,..., x rb, c ir, x (r+1)a,..., x (r+1)b ) T where x ns R. a must be a k-sparse vector. a 0 A search procedure can be used such as the Matching Pursuit algorithm (employed by authors). Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 77 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 78 / 81 Simulations Simulations Consider the H matrices for standard IEEE test systems: IEEE 9-bus IEEE 14-bus IEEE 30-bus IEEE 118-bus IEEE 300-bus Evaluation metrics: probability that opponent can construct an attack vector: number of successful trials number of trials versus percentage of meters under attackers control: k m execution time to construct attack vector or conclude it is infeasible Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 79 / 81 Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 80 / 81
21 References A. Abur and A.G. Expósito, Power System State Estimation: Theory and Implementation, CRC Press, Y. Liu, P. Ning and M.K. Reiter, against State Estimation in Electric Power Grids, Proc. 16th ACM Conference on Computer and Communications Security (CCS 09), Chicago, IL, pp , November Y. Liu, P. Ning and M.K. Reiter, Generalized against State Estimation in Electric Power Grids, ACM Transactions on Information and System Security, vol. 14, no. 1, May Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 81 / 81
IMPROVED NETWORK PARAMETER ERROR IDENTIFICATION USING MULTIPLE MEASUREMENT SCANS
IMPROVED NETWORK PARAMETER ERROR IDENTIFICATION USING MULTIPLE MEASUREMENT SCANS Liuxi Zhang and Ali Abur Department of Electrical and Computer Engineering Northeastern University Boston, MA, USA [email protected]
Cyber-Security Analysis of State Estimators in Power Systems
Cyber-Security Analysis of State Estimators in Electric Power Systems André Teixeira 1, Saurabh Amin 2, Henrik Sandberg 1, Karl H. Johansson 1, and Shankar Sastry 2 ACCESS Linnaeus Centre, KTH-Royal Institute
A Direct Numerical Method for Observability Analysis
IEEE TRANSACTIONS ON POWER SYSTEMS, VOL 15, NO 2, MAY 2000 625 A Direct Numerical Method for Observability Analysis Bei Gou and Ali Abur, Senior Member, IEEE Abstract This paper presents an algebraic method
Weighted-Least-Square(WLS) State Estimation
Weighted-Least-Square(WLS) State Estimation Yousu Chen PNNL December 18, 2015 This document is a description of how to formulate the weighted-least squares (WLS) state estimation problem. Most of the formulation
Hybrid processing of SCADA and synchronized phasor measurements for tracking network state
IEEE PES General Meeting, Denver, USA, July 2015 1 Hybrid processing of SCADA and synchronized phasor measurements for tracking network state Boris Alcaide-Moreno Claudio Fuerte-Esquivel Universidad Michoacana
A Cyber Security Study of a SCADA Energy Management System: Stealthy Deception Attacks on the State Estimator
Proceedings of the 18th World Congress The International Federation of Automatic Control A Cyber Security Study of a SCADA Energy Management System: Stealthy Deception Attacks on the State Estimator André
8. Linear least-squares
8. Linear least-squares EE13 (Fall 211-12) definition examples and applications solution of a least-squares problem, normal equations 8-1 Definition overdetermined linear equations if b range(a), cannot
Synchronized real time data: a new foundation for the Electric Power Grid.
Synchronized real time data: a new foundation for the Electric Power Grid. Pat Kennedy and Chuck Wells Conjecture: Synchronized GPS based data time stamping, high data sampling rates, phasor measurements
System Aware Cyber Security
System Aware Cyber Security Application of Dynamic System Models and State Estimation Technology to the Cyber Security of Physical Systems Barry M. Horowitz, Kate Pierce University of Virginia April, 2012
Systems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
Power System Security Monitoring, Analysis, and Control. George Gross
ECE 573 Power System Operations and Control Power System Security Monitoring, Analysis, and Control George Gross Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign
1 Introduction to Matrices
1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns
15.062 Data Mining: Algorithms and Applications Matrix Math Review
.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
This material is posted here with permission of the IEEE Such permission of the IEEE does not in any way imply IEEE endorsement of any of Helsinki University of Technology's products or services Internal
Component Ordering in Independent Component Analysis Based on Data Power
Component Ordering in Independent Component Analysis Based on Data Power Anne Hendrikse Raymond Veldhuis University of Twente University of Twente Fac. EEMCS, Signals and Systems Group Fac. EEMCS, Signals
Least-Squares Intersection of Lines
Least-Squares Intersection of Lines Johannes Traa - UIUC 2013 This write-up derives the least-squares solution for the intersection of lines. In the general case, a set of lines will not intersect at a
MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
Reduced echelon form: Add the following conditions to conditions 1, 2, and 3 above:
Section 1.2: Row Reduction and Echelon Forms Echelon form (or row echelon form): 1. All nonzero rows are above any rows of all zeros. 2. Each leading entry (i.e. left most nonzero entry) of a row is in
Linear Codes. Chapter 3. 3.1 Basics
Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length
Cyber Security Analysis of State Estimators in Electric Power Systems
!"#$%&'''%()*+,-,*.,%)*%/,.010)*%2*3%()*#-)4 /,.,56,-%7897:;%04#)*%?#42*#2%>)#,4;%?#42*#2;%@?;%AB? Cyber Security Analysis of State Estimators in Electric Power Systems André Teixeira, Saurabh Amin,
MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.
MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column
Math 312 Homework 1 Solutions
Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please
Mathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
Optimization Models for Advanced Cyber-security in the Smart Grid. Seyedamirabbas Mousavian
Optimization Models for Advanced Cyber-security in the Smart Grid by Seyedamirabbas Mousavian A dissertation submitted to the Graduate Faculty of Auburn University in partial fulfillment of the requirements
Weakly Secure Network Coding
Weakly Secure Network Coding Kapil Bhattad, Student Member, IEEE and Krishna R. Narayanan, Member, IEEE Department of Electrical Engineering, Texas A&M University, College Station, USA Abstract In this
Similarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
Evolution of Control for the Smart Transmission Grid
Evolution of Control for the Smart Transmission Grid Anjan Bose Washington State University Pullman, WA SCE Smart Grid Research Symposium California Institute Of Technology October, 2011 The Past (before
Direct Methods for Solving Linear Systems. Matrix Factorization
Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
SEMANTIC SECURITY ANALYSIS OF SCADA NETWORKS TO DETECT MALICIOUS CONTROL COMMANDS IN POWER GRID
SEMANTIC SECURITY ANALYSIS OF SCADA NETWORKS TO DETECT MALICIOUS CONTROL COMMANDS IN POWER GRID ZBIGNIEW KALBARCZYK EMAIL: [email protected] UNIVERSITY OF ILLINOIS AT URBANA-CHAMPAIGN JANUARY 2014
A New Method for Estimating Maximum Power Transfer and Voltage Stability Margins to Mitigate the Risk of Voltage Collapse
A New Method for Estimating Maximum Power Transfer and Voltage Stability Margins to Mitigate the Risk of Voltage Collapse Bernie Lesieutre Dan Molzahn University of Wisconsin-Madison PSERC Webinar, October
Impact of Remote Control Failure on Power System Restoration Time
Impact of Remote Control Failure on Power System Restoration Time Fredrik Edström School of Electrical Engineering Royal Institute of Technology Stockholm, Sweden Email: [email protected] Lennart
Lecture Notes 2: Matrices as Systems of Linear Equations
2: Matrices as Systems of Linear Equations 33A Linear Algebra, Puck Rombach Last updated: April 13, 2016 Systems of Linear Equations Systems of linear equations can represent many things You have probably
( ) which must be a vector
MATH 37 Linear Transformations from Rn to Rm Dr. Neal, WKU Let T : R n R m be a function which maps vectors from R n to R m. Then T is called a linear transformation if the following two properties are
PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION
PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION Introduction In the previous chapter, we explored a class of regression models having particularly simple analytical
MAT 200, Midterm Exam Solution. a. (5 points) Compute the determinant of the matrix A =
MAT 200, Midterm Exam Solution. (0 points total) a. (5 points) Compute the determinant of the matrix 2 2 0 A = 0 3 0 3 0 Answer: det A = 3. The most efficient way is to develop the determinant along the
Linear Programming. March 14, 2014
Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1
Linear Algebra Review. Vectors
Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka [email protected] http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa Cogsci 8F Linear Algebra review UCSD Vectors The length
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation
These axioms must hold for all vectors ū, v, and w in V and all scalars c and d.
DEFINITION: A vector space is a nonempty set V of objects, called vectors, on which are defined two operations, called addition and multiplication by scalars (real numbers), subject to the following axioms
Lecture 5 Least-squares
EE263 Autumn 2007-08 Stephen Boyd Lecture 5 Least-squares least-squares (approximate) solution of overdetermined equations projection and orthogonality principle least-squares estimation BLUE property
University of Lille I PC first year list of exercises n 7. Review
University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients
Automated Stellar Classification for Large Surveys with EKF and RBF Neural Networks
Chin. J. Astron. Astrophys. Vol. 5 (2005), No. 2, 203 210 (http:/www.chjaa.org) Chinese Journal of Astronomy and Astrophysics Automated Stellar Classification for Large Surveys with EKF and RBF Neural
Information Security and Risk Management
Information Security and Risk Management by Lawrence D. Bodin Professor Emeritus of Decision and Information Technology Robert H. Smith School of Business University of Maryland College Park, MD 20742
SOLVING LINEAR SYSTEMS
SOLVING LINEAR SYSTEMS Linear systems Ax = b occur widely in applied mathematics They occur as direct formulations of real world problems; but more often, they occur as a part of the numerical analysis
Introduction to Matrix Algebra
Psychology 7291: Multivariate Statistics (Carey) 8/27/98 Matrix Algebra - 1 Introduction to Matrix Algebra Definitions: A matrix is a collection of numbers ordered by rows and columns. It is customary
Solving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
OPTIMAL DESIGN OF DISTRIBUTED SENSOR NETWORKS FOR FIELD RECONSTRUCTION
OPTIMAL DESIGN OF DISTRIBUTED SENSOR NETWORKS FOR FIELD RECONSTRUCTION Sérgio Pequito, Stephen Kruzick, Soummya Kar, José M. F. Moura, A. Pedro Aguiar Department of Electrical and Computer Engineering
Factor analysis. Angela Montanari
Factor analysis Angela Montanari 1 Introduction Factor analysis is a statistical model that allows to explain the correlations between a large number of observed correlated variables through a small number
DATA ANALYSIS II. Matrix Algorithms
DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
Linear Algebraic Equations, SVD, and the Pseudo-Inverse
Linear Algebraic Equations, SVD, and the Pseudo-Inverse Philip N. Sabes October, 21 1 A Little Background 1.1 Singular values and matrix inversion For non-smmetric matrices, the eigenvalues and singular
Factorization Theorems
Chapter 7 Factorization Theorems This chapter highlights a few of the many factorization theorems for matrices While some factorization results are relatively direct, others are iterative While some factorization
MAT188H1S Lec0101 Burbulla
Winter 206 Linear Transformations A linear transformation T : R m R n is a function that takes vectors in R m to vectors in R n such that and T (u + v) T (u) + T (v) T (k v) k T (v), for all vectors u
Intrusion Detection via Machine Learning for SCADA System Protection
Intrusion Detection via Machine Learning for SCADA System Protection S.L.P. Yasakethu Department of Computing, University of Surrey, Guildford, GU2 7XH, UK. [email protected] J. Jiang Department
Solving Linear Systems, Continued and The Inverse of a Matrix
, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing
6. Cholesky factorization
6. Cholesky factorization EE103 (Fall 2011-12) triangular matrices forward and backward substitution the Cholesky factorization solving Ax = b with A positive definite inverse of a positive definite matrix
ANALYSIS, THEORY AND DESIGN OF LOGISTIC REGRESSION CLASSIFIERS USED FOR VERY LARGE SCALE DATA MINING
ANALYSIS, THEORY AND DESIGN OF LOGISTIC REGRESSION CLASSIFIERS USED FOR VERY LARGE SCALE DATA MINING BY OMID ROUHANI-KALLEH THESIS Submitted as partial fulfillment of the requirements for the degree of
Environmental Remote Sensing GEOG 2021
Environmental Remote Sensing GEOG 2021 Lecture 4 Image classification 2 Purpose categorising data data abstraction / simplification data interpretation mapping for land cover mapping use land cover class
Distributed Flexible AC Transmission System (D FACTS) Jamie Weber. [email protected], 217 384 6330 ext. 13
Distributed Flexible AC Transmission System (D FACTS) Jamie Weber [email protected], 217 384 6330 ext. 13 Slide Preparation: Kate Rogers Davis [email protected], 217 384 6330, Ext 14 2001 South First
LINEAR ALGEBRA. September 23, 2010
LINEAR ALGEBRA September 3, 00 Contents 0. LU-decomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................
MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued).
MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors Jordan canonical form (continued) Jordan canonical form A Jordan block is a square matrix of the form λ 1 0 0 0 0 λ 1 0 0 0 0 λ 0 0 J = 0
Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs
CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like
Lecture 4: Partitioned Matrices and Determinants
Lecture 4: Partitioned Matrices and Determinants 1 Elementary row operations Recall the elementary operations on the rows of a matrix, equivalent to premultiplying by an elementary matrix E: (1) multiplying
160 CHAPTER 4. VECTOR SPACES
160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results
Linear Threshold Units
Linear Threshold Units w x hx (... w n x n w We assume that each feature x j and each weight w j is a real number (we will relax this later) We will study three different algorithms for learning linear
CS3220 Lecture Notes: QR factorization and orthogonal transformations
CS3220 Lecture Notes: QR factorization and orthogonal transformations Steve Marschner Cornell University 11 March 2009 In this lecture I ll talk about orthogonal matrices and their properties, discuss
Minimizing Probing Cost and Achieving Identifiability in Probe Based Network Link Monitoring
Minimizing Probing Cost and Achieving Identifiability in Probe Based Network Link Monitoring Qiang Zheng, Student Member, IEEE, and Guohong Cao, Fellow, IEEE Department of Computer Science and Engineering
Dimensionality Reduction: Principal Components Analysis
Dimensionality Reduction: Principal Components Analysis In data mining one often encounters situations where there are a large number of variables in the database. In such situations it is very likely
OPTIMAL DISTRIBUTION PLANNING INCREASING CAPACITY AND IMPROVING EFFICIENCY AND RELIABILITY WITH MINIMAL-COST ROBUST INVESTMENT
OPTIMAL DISTRIBUTION PLANNING INCREASING CAPACITY AND IMPROVING EFFICIENCY AND RELIABILITY WITH MINIMAL-COST ROBUST INVESTMENT L.A.F.M. Ferreira, P.M.S. Carvalho IST S.N.C. Grave L.M.F. Barruncho L.A.
Solving Mass Balances using Matrix Algebra
Page: 1 Alex Doll, P.Eng, Alex G Doll Consulting Ltd. http://www.agdconsulting.ca Abstract Matrix Algebra, also known as linear algebra, is well suited to solving material balance problems encountered
T ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
The Characteristic Polynomial
Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem
Lecture 2 Matrix Operations
Lecture 2 Matrix Operations transpose, sum & difference, scalar multiplication matrix multiplication, matrix-vector product matrix inverse 2 1 Matrix transpose transpose of m n matrix A, denoted A T or
Network quality control
Network quality control Network quality control P.J.G. Teunissen Delft Institute of Earth Observation and Space systems (DEOS) Delft University of Technology VSSD iv Series on Mathematical Geodesy and
Adaptive Tolerance Algorithm for Distributed Top-K Monitoring with Bandwidth Constraints
Adaptive Tolerance Algorithm for Distributed Top-K Monitoring with Bandwidth Constraints Michael Bauer, Srinivasan Ravichandran University of Wisconsin-Madison Department of Computer Sciences {bauer, srini}@cs.wisc.edu
Optimal Branch Exchange for Feeder Reconfiguration in Distribution Networks
Optimal Branch Exchange for Feeder Reconfiguration in Distribution Networks Qiuyu Peng and Steven H. Low Engr. & App. Sci., Caltech, CA Abstract The feeder reconfiguration problem chooses the on/off status
Methods for Finding Bases
Methods for Finding Bases Bases for the subspaces of a matrix Row-reduction methods can be used to find bases. Let us now look at an example illustrating how to obtain bases for the row space, null space,
Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components
Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components The eigenvalues and eigenvectors of a square matrix play a key role in some important operations in statistics. In particular, they
Multiple Linear Regression in Data Mining
Multiple Linear Regression in Data Mining Contents 2.1. A Review of Multiple Linear Regression 2.2. Illustration of the Regression Process 2.3. Subset Selection in Linear Regression 1 2 Chap. 2 Multiple
Cost Models for Vehicle Routing Problems. 8850 Stanford Boulevard, Suite 260 R. H. Smith School of Business
0-7695-1435-9/02 $17.00 (c) 2002 IEEE 1 Cost Models for Vehicle Routing Problems John Sniezek Lawerence Bodin RouteSmart Technologies Decision and Information Technologies 8850 Stanford Boulevard, Suite
Math 215 HW #6 Solutions
Math 5 HW #6 Solutions Problem 34 Show that x y is orthogonal to x + y if and only if x = y Proof First, suppose x y is orthogonal to x + y Then since x, y = y, x In other words, = x y, x + y = (x y) T
Secure Framework and Sparsity Structure of Linear Programming in Cloud Computing P.Shabana 1 *, P Praneel Kumar 2, K Jayachandra Reddy 3
Proceedings of International Conference on Emerging Trends in Electrical, Communication and Information Technologies ICECIT, 2012 Secure Framework and Sparsity Structure of Linear Programming in Cloud
Review Jeopardy. Blue vs. Orange. Review Jeopardy
Review Jeopardy Blue vs. Orange Review Jeopardy Jeopardy Round Lectures 0-3 Jeopardy Round $200 How could I measure how far apart (i.e. how different) two observations, y 1 and y 2, are from each other?
Logistic Regression. Jia Li. Department of Statistics The Pennsylvania State University. Logistic Regression
Logistic Regression Department of Statistics The Pennsylvania State University Email: [email protected] Logistic Regression Preserve linear classification boundaries. By the Bayes rule: Ĝ(x) = arg max
13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.
3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in three-space, we write a vector in terms
Vector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty
Orthogonal Diagonalization of Symmetric Matrices
MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding
A linear algebraic method for pricing temporary life annuities
A linear algebraic method for pricing temporary life annuities P. Date (joint work with R. Mamon, L. Jalen and I.C. Wang) Department of Mathematical Sciences, Brunel University, London Outline Introduction
MATLAB and Big Data: Illustrative Example
MATLAB and Big Data: Illustrative Example Rick Mansfield Cornell University August 19, 2014 Goals Use a concrete example from my research to: Demonstrate the value of vectorization Introduce key commands/functions
Chapter 7. Matrices. Definition. An m n matrix is an array of numbers set out in m rows and n columns. Examples. ( 1 1 5 2 0 6
Chapter 7 Matrices Definition An m n matrix is an array of numbers set out in m rows and n columns Examples (i ( 1 1 5 2 0 6 has 2 rows and 3 columns and so it is a 2 3 matrix (ii 1 0 7 1 2 3 3 1 is a
