observable distribution grid are investigated. A distribution grid is observable if the state of the grid can be fully determined. For the simulations, the modified 34-bus IEEE test feeder is used. The measurements needed for the state estimation are generated by the ladder iterative technique. Two methods for the state estimation are analyzed: Weighted Least Squares and Extended Kalman Filter. Both estimators try to find the most probable state based on the available measurements. The result is that the Kalman filter mostly needs less iterations and calculation time. The disadvantage of the Kalman filter is that it needs some foreknowlegde about the state.
标签： distribution observable grid investigated
上传时间： 2014-12-08
上传用户：ls530720646
it is the matlab implementation of CDMA2009 for the AWGN noise source crack for all the matter in the analysis
标签： the implementation for matlab
上传时间： 2017-03-29
上传用户：han_zh
this is tutorial for ipchains/iptables . how to make ur system secure using them. how to enchance them.
标签： how enchance ipchains iptables
上传时间： 2013-12-22
上传用户：shawvi
We analyze, both analytically and numerically, the effectiveness of cloaking an infinite cylinder from observations by electromagnetic waves in three dimensions. We show that, as truncated approximations of the ideal permittivity and permeability tensors tend towards the singular ideal cloaking fields, so that the anisotropy ratio tends to infinity, the D and B fields blow up near the cloaking surface. Since the metamaterials used to implement cloaking are based on effective medium theory, the resulting large variation in D and B will pose a challenge to the suitability of the field averaged characterization of " and 碌. We also consider cloaking with and without the SHS (softand- hard surface) lining, shown in [6] to be theoretically necessary for cloaking in the cylindrical geometry. We demonstrate numerically that cloaking is significantly improved by the SHS lining, with both the far field of the scattered wave significantly reduced and the blow up of D and B prevented.
标签： effectiveness analytically numerically cloaking
上传时间： 2017-03-30
上传用户：zxc23456789
This is programing tutorial for people who wants to know programing in PASCAL.Pascal might be not the newest computing program, but it show in very good way the grow up of programing.
标签： programing tutorial PASCAL Pascal
上传时间： 2017-04-03
上传用户：牛津鞋
Program Description: The program asks the user to choice from the menu an option A. Check to see if a number is prime. B. Count the number of vowels in a line. X. Exit the program.
标签： Description the Program program
上传时间： 2017-04-08
上传用户：磊子226
In engineering, compensation is planning for side effects or other unintended issues in a design. The design of an invention can itself also be to compensate for some other existing issue or exception. One example is in a voltage-controlled crystal oscillator (VCXO), which is normally affected not only by voltage, but to a lesser extent by temperature. A temperature-compensated version (a TCVCXO) is designed so that heat buildup within the enclosure of a transmitter or other such device will not alter the piezoelectric effect, thereby causing frequency drift. Another example is motion compensation on digital cameras and video cameras, which keep a picture steady and not blurry.
标签： compensation engineering unintended planning
上传时间： 2013-12-11
上传用户：z754970244
I/O Kit Fundamentals Chapter 1 What Is the I/O Kit? Chapter 2 Architectural Overview Chapter 3 The I/O Registry Chapter 4 Driver and Device Matching Chapter 5 The Base Classes Chapter 6 I/O Kit Families Chapter 7 Handling Events Chapter 8 Managing Data Chapter 9 Managing Power and Device Removal Appendix A I/O Kit Family Reference Chapter 10 Base and Helper Class Hierarchy
标签： Chapter Architectural Fundamentals Kit
上传时间： 2014-01-04
上传用户：虫虫虫虫虫虫
Implementation for Lempel-Ziv code. Encoder and decoder are separated. The input is a file and the output is written in another file.
标签： Implementation Lempel-Ziv and separated
上传时间： 2017-07-05
上传用户：xuanjie
This routine calls the glpk library to solve a LP/MIP problem. A typical LP problem has following structure: [min|max] C x s.t. Ax ["="|"<="|">="] b {x <= UB} {x >= LB} The calling syntax is: [XMIN,FMIN,STATUS,EXTRA]=glpkmex(SENSE,C,A,B,CTYPE,LB,UB,... VARTYPE,PARAM,LPSOLVER,SAVE)
标签： problem following routine library
上传时间： 2014-12-01
上传用户：changeboy
