harris

algorithm to encoding jpeg format

ofdm发送端和接收端，根据短训练字的特性进行相关运算，进行信号到达检测，当检测到相关值大于门限一定次数后，认为有信号到达。(ofdm sending end and receiving end, according to the characteristics of the short training word correlation operation, the signal reaching the detector, when the detected correlation value is greater than the threshold after a certain number of times that a signal arrives.)

ffd算法 用于ffd的运行，即快速图像配准算法(ffd ffd running algorithm, that algorithm for fast image registration)

空间插值方法汇总Inverse Distance to a Power（反距离加权插值法） Kriging（克里金插值法）Minimum Curvature（最小曲率）Modified Shepardd s Method（改进谢别德法）Natural Neighbor（自然邻点插值法）Nearest Neighbor（最近邻点插值法）Polynomial Regression（多元回归法）Radia (Spatial interpolation method summary Inverse Distance to a Power (inverse distance weighted interpolation) on Kriging (kriging) Minimum Curvature the (smallest curvature) Modified Shepardd s Method (improved Xiebie De law) Natural Neighbor (natural neighbor interpolation) Nearest Neighbor (nearest neighbor interpolation) Polynomial the Regression (multiple regression) Radia)

新Chen时滞混沌系统的仿真，初学者可以参考(New Chen delay chaos system simulation, beginners can reference )

本电子书介绍了Matlab中的并行工具箱使用方法，适合初学Matlab并行编程的人员学习(This book describes the parallel Matlab toolbox to use for beginners to learn Matlab parallel programming)

利用GPIB接口控制K2306上下电，电压5V。(The control of K2306 electric interface using GPIB, voltage 5V. )

利用均衡不完全区组设计(Balance Imcomplete Block Designs，BIBD)的半结构化低密度奇偶校验(Low Density Parity Check，LDPC)码设计方法。可以生成仿真结果曲线(The use of a balanced incomplete block design (Balance Imcomplete Block Designs, BIBD) semi-structured Low Density Parity Check Codes design methods. The simulation results can be generated curve.)

说明：  在人们的生产实践中，经常会遇到如何利用现有资源来安排生产，以取得最大经济 效益的问题。此类问题构成了运筹学的一个重要分支—数学规划，而线性规划(Linear Programming 简记LP)则是数学规划的一个重要分支。自从1947 年G. B. Dantzig 提出 求解线性规划的单纯形方法以来，线性规划在理论上趋向成熟，在实用中日益广泛与深 入。特别是在计算机能处理成千上万个约束条件和决策变量的线性规划问题之后，线性 规划的适用领域更为广泛了，已成为现代管理中经常采用的基本方法之一(In people's production practice, we often encounter how to arrange production with the existing resources so as to obtain the maximum economy Benefit issues. Such problems form an important branch of operations research - mathematical programming, while linear programming (Linear Programming or LP) is an important branch of mathematical programming. Since 1947, G. B. Dantzig proposed Since the simplex method for linear programming, linear programming tends to mature in theory and is more and more widely used in practice In. Especially when the computer can deal with thousands of constraints and decision variables of linear programming problems, linear The application field of planning is more extensive, and has become one of the basic methods used in modern management)

It will find the minimum distance between the two points input by the user