fsksys

Not only incredibly useful utility for managing processes, but great tool for learning about the Task Manager

Simple imlementation of hamming code (7,4) The genearator matrix is given by Reference of book Error Correction coding Mathematical models and alogrithms Chapter 1, Hamming Codes code is hamming code (7,4)

很不错的流形学习算法 包含了MDS PCA ISOMAP LLE等算法(Very good manifold learning algorithm includes the MDS PCA ISOMAP LLE, such as eight kinds of algorithms)

matlab code for cross talk canceller

Dynamic Matrix Control is the first MPC algorithm developed in early 1980s. It is probably also the most widely used MPC algorithm in industry due to the fact that its internal model, the step response model is easy to obtain in an industrial process. The package provides a dmc function to perform dynamic matrix control and to show the principal of DMC. An example file is included to show how the dmc function can be used to solve a control problem. It only uses basic MATLAB commands. No any other toolboxe is required.

该程序是电力系统扩展卡尔曼滤波算法的程序，应用于电力系统动态状态估计(The program is extended Kalman filter algorithm power system procedures, applied to power system dynamic state estimation)

汽车自动倒车的控制理论主要有神经网络控制、模糊控制等智能控制方法(The auto reversing control theory neural network control, fuzzy control, intelligent control method)

Simple demo of sift from mr Lowe

经典的正弦波频率估计Rife算法的IEEE原文(Rife classic sinusoidal frequency estimation algorithm of the original IEEE)

单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解,再鉴别；若仍不是，则再转换,按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination. )