Neuro-Adaptive Design - I:
|
|
- Cecil Roberts
- 5 years ago
- Views:
Transcription
1 Lecture 36 Neuro-Adaptve Desgn - I: A Robustfyng ool for Dynamc Inverson Desgn Dr. Radhakant Padh Asst. Professor Dept. of Aerospace Engneerng Indan Insttute of Scence - Bangalore
2 Motvaton Perfect system modelng s dffcult Sources of mperfecton: Unmodelled dynamcs (mssng algebrac terms n the model) Inaccurate knowledge of system parameters and/or change of system parameters durng operaton Inaccuracy n computatons (lke matrx nverson) Objectve: o ncrease the robustness of dynamc nverson wth respect to parameter and/or modelng naccuraces Dr. Radhakant Padh, AE Dept., IISc-Bangalore
3 Reference B. S. Km and A. J. Calse, Nonlnear Flght Control Usng Neural Networks, Journal of Gudance, Control and Dynamcs, Vol. 0, No. 1, 1997, pp Dr. Radhakant Padh, AE Dept., IISc-Bangalore 3
4 Neuro-adaptve desgn System Assumptons: Goal: () ( 3 ) X = f X X (,, δ ) n X, X R, δ R 1 X, X m are avalable for control computaton m= n X, X, δ R f and X (square system,.e. ) s nvertble X X X X c c ( : commanded sgnal ) c m Dr. Radhakant Padh, AE Dept., IISc-Bangalore 4
5 Neuro-adaptve desgn Ideal Case: Defne hen δ X X X c Desgn such that X + K X + K X = 0, where K, K > 0 pdf matrces d p p d, If K = dag k, K = dag k, k k > 0 d d p p p d x + k x + k x = d p c d p 0 x x + k x + k x = 0 Dr. Radhakant Padh, AE Dept., IISc-Bangalore 5
6 Neuro-adaptve desgn x = x + k x + k x c d p u th ( compoent of "pseudo control") Repeatng ths exercse for = 1,,..., n we get X = U ( U : Pseudo control varable) f X X = U (,, δ ) δ = f 1 ( X, X, U) wth the assumton that the nverse exts Dr. Radhakant Padh, AE Dept., IISc-Bangalore 6
7 Neuro-adaptve desgn Note: Real - tme computaton of ths nverse may be dffcult. In the case, a Neural Network can learn ths relatonshp offlne (n an approxmate sense) 1 = f ( X X U ) NN 1 X, X, U.e, ˆ δ,, = Problem: he model and the neural network tranng are NO perfect...these ntroduce errors. Dr. Radhakant Padh, AE Dept., IISc-Bangalore 7
8 Neuro-adaptve desgn Soluton : Desgn another neural network to cancel ths error! Desgn of Adaptve NN After syntheszng, the system dynamcs s (,, ˆ δ ) X = f X X ˆ δ = f ( X, X, δ ) + f ( X, X, ˆ δ) f ( X, X, δ) U U Δ ( X, X, U) Dr. Radhakant Padh, AE Dept., IISc-Bangalore 8
9 Neuro-adaptve desgn.e X = U +Δ X, X, U Dr. Radhakant Padh, AE Dept., IISc-Bangalore 9
10 Neuro-adaptve desgn Note: If Δ=, then the error dynamcs behaves lke the deal case, and hence, the objectve wll be met. rck : Modfy the Pseudo control as where 0 ˆ and : U ad U U = U ˆ I U U = X + K X + K X I c d p s the P seudo control for the "deal case". Adaptve control to cancel the unwarted effect. ad Note: Pseudo-control modfcaton s the reason why technque s applcable to dynamc nverson only. Dr. Radhakant Padh, AE Dept., IISc-Bangalore 10
11 Neuro-adaptve desgn Wth ths, the closed loop error dynamcs becomes X + K X + K X = X X + K X + K X.e, d p c d p ( X ) (,, ) c KdX KpX U X X U = + + +Δ = U Queston Can we desgn I ( U ) I Uad Δ X X U ( X X U) ˆ,, X + K ˆ dx + KpX = Uad Δ X, X, U : Uˆ Uˆ Δ,, ad ad (adaptvely ) such that Dr. Radhakant Padh, AE Dept., IISc-Bangalore 11
12 Neuro-adaptve desgn If ths happens, then th Defne channel : X, X 0 (approxmately) x + k x + k x = Uˆ Δ X, X, U e d p ad x x hen e ˆ = e + Uad, X kp k Δ 1 d A b XU, Dr. Radhakant Padh, AE Dept., IISc-Bangalore 1
13 Neuro-adaptve desgn Goal for Uˆ ad Uˆ he "deal purpose" of s to capture the functon Δ "pefectly" so that e 0 asymptotcally However, ths s dffcult to acheve. Hence, am for "practcal stablty "only.e, e ad remans bounded, where the bound can be made arbtrarty small. Dr. Radhakant Padh, AE Dept., IISc-Bangalore 13
14 Neuro-adaptve desgn Let Δˆ,, be a NN realzaton of,, ( X XU) Δ X XU when a fnte number ( N) of bass functons β X, X, U, j = 1,,..., N are used, wth the j correspondng weghts of the network beng () Wˆ t, j = 1,,..., N j.e, ˆ ˆ ( X, X, U) W () t β ( X, X, U) Δ = j j Dr. Radhakant Padh, AE Dept., IISc-Bangalore 14
15 Neuro-adaptve desgn β 1 β ˆ Δ (,, ) ˆ, ˆ,..., ˆ X X U = W W 1 W N... β N ( ) () β ( ).e. Uˆ = Δ ˆ X, X, U = Wˆ t. X, X, U Ideal case: ad { X X U} ( ) () β ( ) When Wˆ s optmzed over some compact doman n,,, * * * let the result be Wˆ. In that case Δ ˆ X, X, U = Wˆ t. X, X, U Δ Δ ˆ ˆ < ε ε * and where s the deal error of functon. Dr. Radhakant Padh, AE Dept., IISc-Bangalore 15
16 Neuro-adaptve desgn Note: ε depends on the followngs: () N : Sze of the network () Choce of bass functons β ( j = 1,..., N) () Accuracy of the frst neural network th (whch determnes Δ ) j Dr. Radhakant Padh, AE Dept., IISc-Bangalore 16
17 Neuro-adaptve desgn Estmaton Error: () = ˆ () * () * β,, β (,, ) ˆ ˆ ˆ ˆ U Δ = W t X XU W X XU ad * () ˆ β ( ) = Wˆ t W X, X, U = W β,, ( X X U) W t W t Wˆ where, : Error n weght at tme Note: Wˆ s constant. Hence = = W * () t Wˆ () t Wˆ ˆ W() t = 0 * t Dr. Radhakant Padh, AE Dept., IISc-Bangalore 17
18 Neuro-adaptve desgn Notaton : β ( X, X, U) = β (,, ) t e W Δ ˆ =Δˆ ( X, X, U) (,, ) t e W * * Δ ˆ ˆ =Δ ( X, X, U) t, e, W Used n mplementaton X x Note: e, e X x used n proof Dr. Radhakant Padh, AE Dept., IISc-Bangalore 18
19 Neuro-adaptve desgn th Error dynamcs n channel : Note : ( ˆ ) e = Ae + b U Δ ad ( ˆ ˆ * * ˆ ) = Ae + b U Δ +Δ Δ ad = Ae + bw β t e W + b Δ Δ ( *,, ˆ ) A 0 1 = s a Hurwtz matrx. kp k d Characterstc equaton: s + k s+ k = 0, wth k, k > 0 d p d p Dr. Radhakant Padh, AE Dept., IISc-Bangalore 19
20 Neuro-adaptve desgn Stablty Analyss: Defne a Lyapunov Functon canddate: ( ) where, V e, W V = n = 1 (, ) V e W 1 1 e Pe + W W, e > E P γ = 1 E + W W, e E E : defnes "dead zone" P γ By defnton, e e Pe P s a pdf matrx satsfyng P PA + A P = Q, Q > 0 (pdf) Note : By the selecton, V s contnuous at the boundary of dead zone. Dr. Radhakant Padh, AE Dept., IISc-Bangalore 0
21 Neuro-adaptve desgn Note: (1) Exstence of such a pdf matrx P s guaranteed by the fact A s Hurwtz. P () If Q = I, then the soluton for s gven by kd k 1 p kp k d k p k p = kp k d k p Dr. Radhakant Padh, AE Dept., IISc-Bangalore 1
22 Neuro-adaptve desgn 1 1 V = ( e Pe + e Pe ) + W W γ ˆ * ( ˆ * β,, ) Ae + bw β t, e, W b Pe + Δ Δ 1 = + WW ˆ e P Ae bw t e W b γ Δ Δ 1 ( ˆ * ) 1 = e A P + PA e + e Pb W β + Δ Δ + W Wˆ γ 1 ˆ W e Qe + e Pb ε + W e Pb β + γ Weght update rule: Wˆ = γ e Pbβ Dr. Radhakant Padh, AE Dept., IISc-Bangalore
23 Neuro-adaptve desgn 1 e Qe + ε e P Pb P P 1 e λmn ( Q ) + ε e P P b λmax However, e Pe P e e Pe.e, e λ max ( P ) e Pe e = λ max ( s dened snce s pdf ) ( P) λ ( P) e max P Dr. Radhakant Padh, AE Dept., IISc-Bangalore 3
24 Neuro-adaptve desgn 1 e V Q e P Pe P P λmn + ε λmax λmax ( P ) 1 e λmn ( Q ) P = + ε e Pe λmax ( P ) e P ( Q) ( P ) ( Q) ( P ) ( P) max 1 e λ V e P P mn + ε λ P max λmax 1 e λ V 0, when + < 0 ( P) P mn ε λmax λmax λ Dr. Radhakant Padh, AE Dept., IISc-Bangalore 4
25 Neuro-adaptve desgn.e, ε λ max P < 1 e P λ λ max mn P Q ().e, e P > ε λ λ mn max Note: 1 hs defnes E, However t contans ε, Q whch s unkown. However, t may requre teratve smulaton study. P 3 Dr. Radhakant Padh, AE Dept., IISc-Bangalore 5
26 Neuro-adaptve desgn If Q = I ( P) E= ε λmax where, P s gven before. ( 3 ) Selectng Q = I also leads to the least bounds. Insde the dead zone: V = W Wˆ 3 Select Wˆ = 0 hen V = 0 Note: By the selecton, V s contnuous at the boundary of ths deadzone. Dr. Radhakant Padh, AE Dept., IISc-Bangalore 6
27 Neuro-adaptve Desgn: Implementaton of Controller (1) Desgn Parameter selecton: Wˆ 0 = 0 Q P= E = I [formula gven] = ε λ P max 3 ( ε s unknown ry wth teraton) Dr. Radhakant Padh, AE Dept., IISc-Bangalore 7
28 Neuro-adaptve Desgn: Implementaton of Controller () Weght update Rule: ˆ W = γ e Pbβ, f e > E 0 x 0 where, e =, b=, x 1 β,, : Bass functon selecton P = ( X X U) γ : Learng rate otherwse ( U: pseudo control ) Dr. Radhakant Padh, AE Dept., IISc-Bangalore 8
29 Neuro-adaptve Desgn: Implementaton of Controller (3) Control Computaton: Adaptve Control: Pseudo Control: Actual Control: Uˆ = Wˆ U = U ˆ I Uad = X + K X + K X Uˆ ˆ δ ad = = fˆ 1 β c d p ad ( X, X, U) NN,, 1 ( X X U) Dr. Radhakant Padh, AE Dept., IISc-Bangalore 9
30 Neuro-adaptve desgn Nce Results: () Adapton happens n fnte tme () () () As t, the error e t les nsde the deadzone and W a constant value. t approaches Dr. Radhakant Padh, AE Dept., IISc-Bangalore 30
31 Promsng Results: (Flght control Problem) Dr. Radhakant Padh, AE Dept., IISc-Bangalore 31
32 References B. S. Km and A. J. Calse, Nonlnear Flght Control Usng Neural Networks, Journal of Gudance, Control and Dynamcs, Vol. 0, No. 1, 1997, pp J. Letner, A. J. Calse and J. V. R. Prasad, Analyss of Adaptve Neural Networks for Helcopter Flght Controls, Journal of Gudance, Control, and Dynamcs, Vol. 0, No. 5, 1997, pp M. Sharma and A. J. Calse, Neural-Network Augmentaton of Exstng Lnear Controllers, J. of Gudance, Control and Dynamcs, Vol. 8, No. 1, 005, pp Dr. Radhakant Padh, AE Dept., IISc-Bangalore 3
33 Dr. Radhakant Padh, AE Dept., IISc-Bangalore 33
Neuro-Adaptive Design II:
Lecture 37 Neuro-Adaptve Desgn II: A Robustfyng Tool for Any Desgn Dr. Radhakant Padh Asst. Professor Dept. of Aerospace Engneerng Indan Insttute of Scence - Bangalore Motvaton Perfect system modelng s
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationZeros and Zero Dynamics for Linear, Time-delay System
UNIVERSITA POLITECNICA DELLE MARCHE - FACOLTA DI INGEGNERIA Dpartmento d Ingegnerua Informatca, Gestonale e dell Automazone LabMACS Laboratory of Modelng, Analyss and Control of Dynamcal System Zeros and
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 31 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 6. Rdge regresson The OLSE s the best lnear unbased
More informationIntroduction. - The Second Lyapunov Method. - The First Lyapunov Method
Stablty Analyss A. Khak Sedgh Control Systems Group Faculty of Electrcal and Computer Engneerng K. N. Toos Unversty of Technology February 2009 1 Introducton Stablty s the most promnent characterstc of
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationCHAPTER III Neural Networks as Associative Memory
CHAPTER III Neural Networs as Assocatve Memory Introducton One of the prmary functons of the bran s assocatve memory. We assocate the faces wth names, letters wth sounds, or we can recognze the people
More informationSome Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)
Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998
More informationOutline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1]
DYNAMIC SHORTEST PATH SEARCH AND SYNCHRONIZED TASK SWITCHING Jay Wagenpfel, Adran Trachte 2 Outlne Shortest Communcaton Path Searchng Bellmann Ford algorthm Algorthm for dynamc case Modfcatons to our algorthm
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationMarginal Effects in Probit Models: Interpretation and Testing. 1. Interpreting Probit Coefficients
ECON 5 -- NOE 15 Margnal Effects n Probt Models: Interpretaton and estng hs note ntroduces you to the two types of margnal effects n probt models: margnal ndex effects, and margnal probablty effects. It
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationRobust observed-state feedback design. for discrete-time systems rational in the uncertainties
Robust observed-state feedback desgn for dscrete-tme systems ratonal n the uncertantes Dmtr Peaucelle Yosho Ebhara & Yohe Hosoe Semnar at Kolloquum Technsche Kybernetk, May 10, 016 Unversty of Stuttgart
More information4DVAR, according to the name, is a four-dimensional variational method.
4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The
More informationWeek 5: Neural Networks
Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple
More informationState Estimation. Ali Abur Northeastern University, USA. September 28, 2016 Fall 2016 CURENT Course Lecture Notes
State Estmaton Al Abur Northeastern Unversty, USA September 8, 06 Fall 06 CURENT Course Lecture Notes Operatng States of a Power System Al Abur NORMAL STATE SECURE or INSECURE RESTORATIVE STATE EMERGENCY
More informationLinear Feature Engineering 11
Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19
More informationHidden Markov Models & The Multivariate Gaussian (10/26/04)
CS281A/Stat241A: Statstcal Learnng Theory Hdden Markov Models & The Multvarate Gaussan (10/26/04) Lecturer: Mchael I. Jordan Scrbes: Jonathan W. Hu 1 Hdden Markov Models As a bref revew, hdden Markov models
More informationDr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur
Analyss of Varance and Desgn of Exerments-I MODULE III LECTURE - 2 EXPERIMENTAL DESIGN MODELS Dr. Shalabh Deartment of Mathematcs and Statstcs Indan Insttute of Technology Kanur 2 We consder the models
More informationDesign and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:
More informationHongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)
ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of
More informationPolynomial Regression Models
LINEAR REGRESSION ANALYSIS MODULE XII Lecture - 6 Polynomal Regresson Models Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur Test of sgnfcance To test the sgnfcance
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationQuantum Mechanics I - Session 4
Quantum Mechancs I - Sesson 4 Aprl 3, 05 Contents Operators Change of Bass 4 3 Egenvectors and Egenvalues 5 3. Denton....................................... 5 3. Rotaton n D....................................
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationSupport Vector Machines. Vibhav Gogate The University of Texas at dallas
Support Vector Machnes Vbhav Gogate he Unversty of exas at dallas What We have Learned So Far? 1. Decson rees. Naïve Bayes 3. Lnear Regresson 4. Logstc Regresson 5. Perceptron 6. Neural networks 7. K-Nearest
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationHigh resolution entropy stable scheme for shallow water equations
Internatonal Symposum on Computers & Informatcs (ISCI 05) Hgh resoluton entropy stable scheme for shallow water equatons Xaohan Cheng,a, Yufeng Ne,b, Department of Appled Mathematcs, Northwestern Polytechncal
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationSolution of Linear System of Equations and Matrix Inversion Gauss Seidel Iteration Method
Soluton of Lnear System of Equatons and Matr Inverson Gauss Sedel Iteraton Method It s another well-known teratve method for solvng a system of lnear equatons of the form a + a22 + + ann = b a2 + a222
More informationPARTICIPATION FACTOR IN MODAL ANALYSIS OF POWER SYSTEMS STABILITY
POZNAN UNIVE RSITY OF TE CHNOLOGY ACADE MIC JOURNALS No 86 Electrcal Engneerng 6 Volodymyr KONOVAL* Roman PRYTULA** PARTICIPATION FACTOR IN MODAL ANALYSIS OF POWER SYSTEMS STABILITY Ths paper provdes a
More informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More informationA Computational Viewpoint on Classical Density Functional Theory
A Computatonal Vewpont on Classcal Densty Functonal Theory Matthew Knepley and Drk Gllespe Computaton Insttute Unversty of Chcago Department of Molecular Bology and Physology Rush Unversty Medcal Center
More informationLINEAR REGRESSION ANALYSIS. MODULE VIII Lecture Indicator Variables
LINEAR REGRESSION ANALYSIS MODULE VIII Lecture - 7 Indcator Varables Dr. Shalabh Department of Maematcs and Statstcs Indan Insttute of Technology Kanpur Indcator varables versus quanttatve explanatory
More informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More information2 STATISTICALLY OPTIMAL TRAINING DATA 2.1 A CRITERION OF OPTIMALITY We revew the crteron of statstcally optmal tranng data (Fukumzu et al., 1994). We
Advances n Neural Informaton Processng Systems 8 Actve Learnng n Multlayer Perceptrons Kenj Fukumzu Informaton and Communcaton R&D Center, Rcoh Co., Ltd. 3-2-3, Shn-yokohama, Yokohama, 222 Japan E-mal:
More informationNotes on Frequency Estimation in Data Streams
Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to
More informationOn Event-Triggered Adaptive Architectures for Decentralized and Distributed Control of Large- Scale Modular Systems
Unversty of South Florda Scholar Commons Mechancal Engneerng Faculty Publcatons Mechancal Engneerng 26 On Event-Trggered Adaptve Archtectures for Decentralzed and Dstrbuted Control of Large- Scale Modular
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have
More informationOn a direct solver for linear least squares problems
ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationDynamic Systems on Graphs
Prepared by F.L. Lews Updated: Saturday, February 06, 200 Dynamc Systems on Graphs Control Graphs and Consensus A network s a set of nodes that collaborates to acheve what each cannot acheve alone. A network,
More informationMaximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models
ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Maxmum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models
More informationADVANCED MACHINE LEARNING ADVANCED MACHINE LEARNING
1 ADVANCED ACHINE LEARNING ADVANCED ACHINE LEARNING Non-lnear regresson technques 2 ADVANCED ACHINE LEARNING Regresson: Prncple N ap N-dm. nput x to a contnuous output y. Learn a functon of the type: N
More informationhapter 6 System Norms 6. Introducton s n the matrx case, the measure on a system should be nduced from the space of sgnals t operates on. hus, the sze
Lectures on Dynamc Systems and ontrol Mohammed Dahleh Munther. Dahleh George Verghese Department of Electrcal Engneerng and omputer Scence Massachuasetts Insttute of echnology c hapter 6 System Norms 6.
More informationOperating conditions of a mine fan under conditions of variable resistance
Paper No. 11 ISMS 216 Operatng condtons of a mne fan under condtons of varable resstance Zhang Ynghua a, Chen L a, b, Huang Zhan a, *, Gao Yukun a a State Key Laboratory of Hgh-Effcent Mnng and Safety
More informationModule 2. Random Processes. Version 2 ECE IIT, Kharagpur
Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be
More informationRobust Sliding Mode Observers for Large Scale Systems with Applications to a Multimachine Power System
Robust Sldng Mode Observers for Large Scale Systems wth Applcatons to a Multmachne Power System Mokhtar Mohamed, Xng-Gang Yan,*, Sarah K. Spurgeon 2, Bn Jang 3 Instrumentaton, Control and Embedded Systems
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationA RELAXED SUFFICIENT CONDITION FOR ROBUST STABILITY OF AFFINE SYSTEMS
Доклади на Българската академия на науките Comptes rendus de l Académe bulgare des Scences Tome 60 No 9 2007 SCIENCES ET INGENIERIE Théore des systèmes A RELAXED SUFFICIENT CONDITION FOR ROBUST STABILITY
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationCinChE Problem-Solving Strategy Chapter 4 Development of a Mathematical Model. formulation. procedure
nhe roblem-solvng Strategy hapter 4 Transformaton rocess onceptual Model formulaton procedure Mathematcal Model The mathematcal model s an abstracton that represents the engneerng phenomena occurrng n
More information2. PROBLEM STATEMENT AND SOLUTION STRATEGIES. L q. Suppose that we have a structure with known geometry (b, h, and L) and material properties (EA).
. PROBEM STATEMENT AND SOUTION STRATEGIES Problem statement P, Q h ρ ρ o EA, N b b Suppose that we have a structure wth known geometry (b, h, and ) and materal propertes (EA). Gven load (P), determne the
More informationApplication of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems
Mathematca Aeterna, Vol. 1, 011, no. 06, 405 415 Applcaton of B-Splne to Numercal Soluton of a System of Sngularly Perturbed Problems Yogesh Gupta Department of Mathematcs Unted College of Engneerng &
More informationMarkov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement
Markov Chan Monte Carlo MCMC, Gbbs Samplng, Metropols Algorthms, and Smulated Annealng 2001 Bonformatcs Course Supplement SNU Bontellgence Lab http://bsnuackr/ Outlne! Markov Chan Monte Carlo MCMC! Metropols-Hastngs
More informationNote 10. Modeling and Simulation of Dynamic Systems
Lecture Notes of ME 475: Introducton to Mechatroncs Note 0 Modelng and Smulaton of Dynamc Systems Department of Mechancal Engneerng, Unversty Of Saskatchewan, 57 Campus Drve, Saskatoon, SK S7N 5A9, Canada
More informationOff-policy Reinforcement Learning for Robust Control of Discrete-time Uncertain Linear Systems
Off-polcy Renforcement Learnng for Robust Control of Dscrete-tme Uncertan Lnear Systems Yonglang Yang 1 Zhshan Guo 2 Donald Wunsch 3 Yxn Yn 1 1 School of Automatc and Electrcal Engneerng Unversty of Scence
More informationAdaptive sliding mode reliable excitation control design for power systems
Acta Technca 6, No. 3B/17, 593 6 c 17 Insttute of Thermomechancs CAS, v.v.. Adaptve sldng mode relable exctaton control desgn for power systems Xuetng Lu 1, 3, Yanchao Yan Abstract. In ths paper, the problem
More informationAnalytical Gradient Evaluation of Cost Functions in. General Field Solvers: A Novel Approach for. Optimization of Microwave Structures
IMS 2 Workshop Analytcal Gradent Evaluaton of Cost Functons n General Feld Solvers: A Novel Approach for Optmzaton of Mcrowave Structures P. Harscher, S. Amar* and R. Vahldeck and J. Bornemann* Swss Federal
More informationAdditional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty
Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationOutline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique
Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationFTCS Solution to the Heat Equation
FTCS Soluton to the Heat Equaton ME 448/548 Notes Gerald Recktenwald Portland State Unversty Department of Mechancal Engneerng gerry@pdx.edu ME 448/548: FTCS Soluton to the Heat Equaton Overvew 1. Use
More informationPREDICTIVE CONTROL BY DISTRIBUTED PARAMETER SYSTEMS BLOCKSET FOR MATLAB & SIMULINK
PREDICTIVE CONTROL BY DISTRIBUTED PARAMETER SYSTEMS BLOCKSET FOR MATLAB & SIMULINK G. Hulkó, C. Belavý, P. Buček, P. Noga Insttute of automaton, measurement and appled nformatcs, Faculty of Mechancal Engneerng,
More informationErratum: A Generalized Path Integral Control Approach to Reinforcement Learning
Journal of Machne Learnng Research 00-9 Submtted /0; Publshed 7/ Erratum: A Generalzed Path Integral Control Approach to Renforcement Learnng Evangelos ATheodorou Jonas Buchl Stefan Schaal Department of
More informationThe Ordinary Least Squares (OLS) Estimator
The Ordnary Least Squares (OLS) Estmator 1 Regresson Analyss Regresson Analyss: a statstcal technque for nvestgatng and modelng the relatonshp between varables. Applcatons: Engneerng, the physcal and chemcal
More informationMatrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD
Matrx Approxmaton va Samplng, Subspace Embeddng Lecturer: Anup Rao Scrbe: Rashth Sharma, Peng Zhang 0/01/016 1 Solvng Lnear Systems Usng SVD Two applcatons of SVD have been covered so far. Today we loo
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationTHE SUMMATION NOTATION Ʃ
Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the
More informationLecture 4: Constant Time SVD Approximation
Spectral Algorthms and Representatons eb. 17, Mar. 3 and 8, 005 Lecture 4: Constant Tme SVD Approxmaton Lecturer: Santosh Vempala Scrbe: Jangzhuo Chen Ths topc conssts of three lectures 0/17, 03/03, 03/08),
More informationChapter 9: Statistical Inference and the Relationship between Two Variables
Chapter 9: Statstcal Inference and the Relatonshp between Two Varables Key Words The Regresson Model The Sample Regresson Equaton The Pearson Correlaton Coeffcent Learnng Outcomes After studyng ths chapter,
More informationObservers for non-linear differential-algebraic. system
Observers for non-lnear dfferental-algebrac systems Jan Åslund and Erk Frsk Department of Electrcal Engneerng, Lnköpng Unversty 581 83 Lnköpng, Sweden, {jaasl,frsk}@sy.lu.se Abstract In ths paper we consder
More informationProbability Theory (revisited)
Probablty Theory (revsted) Summary Probablty v.s. plausblty Random varables Smulaton of Random Experments Challenge The alarm of a shop rang. Soon afterwards, a man was seen runnng n the street, persecuted
More informationNumber of cases Number of factors Number of covariates Number of levels of factor i. Value of the dependent variable for case k
ANOVA Model and Matrx Computatons Notaton The followng notaton s used throughout ths chapter unless otherwse stated: N F CN Y Z j w W Number of cases Number of factors Number of covarates Number of levels
More informationQuantifying Uncertainty
Partcle Flters Quantfyng Uncertanty Sa Ravela M. I. T Last Updated: Sprng 2013 1 Quantfyng Uncertanty Partcle Flters Partcle Flters Appled to Sequental flterng problems Can also be appled to smoothng problems
More information10.34 Numerical Methods Applied to Chemical Engineering Fall Homework #3: Systems of Nonlinear Equations and Optimization
10.34 Numercal Methods Appled to Chemcal Engneerng Fall 2015 Homework #3: Systems of Nonlnear Equatons and Optmzaton Problem 1 (30 ponts). A (homogeneous) azeotrope s a composton of a multcomponent mxture
More informationCME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13
CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 13 GENE H GOLUB 1 Iteratve Methods Very large problems (naturally sparse, from applcatons): teratve methods Structured matrces (even sometmes dense,
More informationPerron Vectors of an Irreducible Nonnegative Interval Matrix
Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of
More informationLecture 12: Classification
Lecture : Classfcaton g Dscrmnant functons g The optmal Bayes classfer g Quadratc classfers g Eucldean and Mahalanobs metrcs g K Nearest Neghbor Classfers Intellgent Sensor Systems Rcardo Guterrez-Osuna
More informationChanging Topology and Communication Delays
Prepared by F.L. Lews Updated: Saturday, February 3, 00 Changng Topology and Communcaton Delays Changng Topology The graph connectvty or topology may change over tme. Let G { G, G,, G M } wth M fnte be
More informationLecture 2 Solution of Nonlinear Equations ( Root Finding Problems )
Lecture Soluton o Nonlnear Equatons Root Fndng Problems Dentons Classcaton o Methods Analytcal Solutons Graphcal Methods Numercal Methods Bracketng Methods Open Methods Convergence Notatons Root Fndng
More informationA PROCEDURE FOR SIMULATING THE NONLINEAR CONDUCTION HEAT TRANSFER IN A BODY WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY.
Proceedngs of the th Brazlan Congress of Thermal Scences and Engneerng -- ENCIT 006 Braz. Soc. of Mechancal Scences and Engneerng -- ABCM, Curtba, Brazl,- Dec. 5-8, 006 A PROCEDURE FOR SIMULATING THE NONLINEAR
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationImproved delay-dependent stability criteria for discrete-time stochastic neural networks with time-varying delays
Avalable onlne at www.scencedrect.com Proceda Engneerng 5 ( 4456 446 Improved delay-dependent stablty crtera for dscrete-tme stochastc neural networs wth tme-varyng delays Meng-zhuo Luo a Shou-mng Zhong
More informationInternational Journal of Pure and Applied Sciences and Technology
Int. J. Pure Appl. Sc. Technol., 4() (03), pp. 5-30 Internatonal Journal of Pure and Appled Scences and Technology ISSN 9-607 Avalable onlne at www.jopaasat.n Research Paper Schrödnger State Space Matrx
More informationWeek 2. This week, we covered operations on sets and cardinality.
Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from
More information