4x4

matlab高光谱入门程序，基本分类流程(matlab hyperspectral entry procedures, basic classification process)

Wind energy is one of the fastest growing energy and it will continue to grow around the world

基于常规控制策略的极点配置控制算法，不必对消过程的零点(Conventional control strategy based on pole placement control algorithm)

The MATLAB code models a chain of transmission of an analog signal using FM modulation. 1-modulation signal_informatif ----> integrator ----> modulateurFM ---> modulated signal 2-demodulation modulated signal ---> differentiator -> rectifier -> fitrepasbas ---> DC component elimination the average DC component of the signal is removed in descriminant

贝叶斯压缩感知的仿真程序，此程序使用LAPLACE先验，(This is a simple example to test the fast Laplace algorithm from the following paper: S. D. Babacan, R. Molina, A. K. Katsaggelos. bayesian Compressive Sensing using Laplace Priors)

核查的关键在于对核材料属性准确、有效地识别[1][2]。利用252Cf作为随机脉冲中子源，对其入射核材料所产生的诱发裂变中子脉冲信号进行采集、处理和分析，得到自相关、互相关、自/互功率谱、功率谱密度比等一系列参数，从而反演核材料内部的反应性的情况，便可用于分析和识别核材料，其基本原理就是252Cf中子源驱动噪声分析测量法[(The result shows that the trained Elman neural network is able to identify the characteristics of correlation function, to distinguish different concentrations, and the average recognition rate reaches 90 , with high robustness.)

EASY OVERVIEW OF KALMAN FILTER

openwrt e2fsprogs-1.42.8.tar.gz(openwrt need e2fsprogs-1.42.8.tar.gz)

CHP 4 - Real-Time Digital Signal Processing: Implementations and Applications, Second Edition by Sen M. Kuo, Bob H. Lee & Wenshun Tian, ISBN 0470014954 - Real-Time Digital Signal Processing: Implementations and Applications, Second Edition by Sen M. Kuo, Bob H. Lee & Wenshun Tian, ISBN 0470014954(CHP 4- Real-Time Digital Signal Processing: Implementations and Applications, Second Edition by Sen M. Kuo, Bob H. Lee & Wenshun Tian, ISBN 0470014954- Real-Time Digital Signal Processing: Implementations and Applications, Second Edition by Sen M. Kuo, Bob H. Lee & Wenshun Tian, ISBN 0470014954)

matching pursuit 算法，matlab实现，信号稀疏分解方式的一种，适合与信号在超完备的原子库中稀疏分解。matchingpursuit.m(A matching pursuit algorithm. It fits data from a set of dictionary elements by orthogonally projecting the data onto elements of the dictionary of vectors such that the energy in each projection is maximized. In constrast to G-S, the residual is orthogonalized, not the basis vectors)