ANN1

说明：  KPCA实现数据降维，数据部分可以自己改，用的是TE故障中的一组数据(KPCA realizes data dimension reduction, and the data part can be changed by itself. It USES a set of data in TE fault)

CO-KRIGING WITH RANDOM METHOD. 随机结合克里金方法。在地学中有很大的应用潜力，比如建模及矿物分布估计。(a variant of cokriging, in which the mean values of the vector components are related by linear combinations with known coefficients. Equations for the cokriging predictor and for the variance–covariance matrix of prediction errors are presented. A set of computer programs is provided and illustrated with applications to mineral resources evaluation, in which the proposed cokriging variant compares favorably with traditional approaches.)

换能器阵元的不同排列组合决定其指向性，波束形成是多波束测量的关键技术。文中 通过数学计算总结了不同换能器阵进行波束形成的工作原理，并介绍了利用二维DFT进行频 域波束形成的一般方法。最后结合现役多波束测深系统，简单解释说明不同系统所采用的波束 形成技术。(Transducer using an array of different permutations and combinations to determine its directivity, beam formation is the key technology for multi-beam measurements. Summarized by mathematical calculations the transducer array beamforming works, and describes the general method of two-dimensional DFT in the frequency domain beam formation. Finally, the active-duty multi-beam sounding system, the simple explanation of the different systems used in beamforming technology.)

一本详细讲解matlab simulink 仿真的书，书中有大量的实例。(A book about matlab simulink with lots of examples)

matlab files, submitted as part of assignmrnt number 2 of ADCS

decimal to binary decimal to binary

用双线性法设计巴特沃斯高通数字滤波器 基于汉宁窗的FIR数字高通滤波器设计(Method with bilinear Butterworth high-pass digital filter design based on Hanning window of FIR digital high-pass filter design)

本SGA可以优化变量，求最小值,最大值（当把函数倒数也就求最小值啦） 并且支持浮点编码，grey编码，二进制编码；轮赌法选择，锦标赛选择；单点交叉，均布交叉，浮点交叉； 单点变异，浮点变异；(The SGA can optimize the variables, find minimum, maximum (when the function is also seeking the minimum reciprocal friends) and support for floating-point encoding, grey code, binary code roulette method selection, tournament selection single point crossover, uniform Cross, floating-point crossover single point mutation, floating-point mutation )

In this paper we discuss the problem of recovering the vertices of a planar polygon from its measured complex moments.Because the given, measured moments can be noisy, the recovered vertices are only estimates of the true ones. The literature offers many algorithms for solving such an estimation problem. We will restrict our discussion to the Total Least Squares (TLS) data fitting models HTLS and STLS and the matrix pencil method GPOF. We show the close link between the HTLS and the GPOF method. We use the HTLS method to compute starting values for the STLS method. We compare the accuracy of these three methods on simulated data. 2005 Elsevier B.V. All rights reserved.

本资料为杨鹏老师所编，内涵了gre词汇的背诵方法，以及以前版本所没有的易混单词，实为难得的好材料(the book mainly describes an effective way to recite GRE words.)