mathmodl

卷积码是一种有记忆的编码，在任意给定的时间单元处，编码器的n个输出不仅与此时间单元的k个输入有关，而且也与前m个输入有关。卷积码通常表示为：（n,k,m） 本次仿真采用（2，1，3）卷积码。 (convolutional code is a kind of code memory, in any given unit of time, the encoder output n this time not only with the elements of the k input, but also with the input m. Convolutional codes are usually stated as : (n, k, m), the simulation used (2,1,3) convolutional code.)

电力系统中计算潮流的牛顿拉夫逊拉法和PQ快速分解法(newton method and PQ method)

认知无线电中的能量检测程序，用于频谱感知(energy detection)

In linguistic morphology, stemming is the process for reducing inflected (or sometimes derived) words to their stem, base or root form – generally a written word form. The stem need not be identical to the morphological root of the word it is usually sufficient that related words map to the same stem, even if this stem is not in itself a valid root. The algorithm has been a long-standing problem in computer science.

说明：  FFT的MATLAB ，很有学习价值，很实用(FFT in MATLAB, the value of great learning, it is useful)

说明：  matlab 图像处理教程，对于matlab入门者很有用(matlab photo)

这是一个快速用于计算ARMA时间序列的模型识别和求出模型残差的函数的范例(This is a fast time series for calculating ARMA model identification and model residuals calculated example of a function)

适用于本人开发的抽号器WindowsFormsAppkication.rar。 可以运行后在in.txt中第一行输入总人名数，之后从第二行开始，每一行输入一个人名。之后运行程序（eze等同于exe），会生成Form1.cs，用记事本打开后复制到原Form1.cs进行替换。可以应对多种情况。(I developed suitable for pumping number is WindowsFormsAppkication.rar. After the run in the first row in.txt enter the total number of names, and then start from the second row, enter a name for each row. After running the program (eze equivalent exe), will generate Form1.cs, copy after use Notepad to open Form1.cs to replace the original. You can respond to a variety of situations.)

说明：  基于多目标的跟踪和实现，里面介绍了跟踪算法的现状，以及如何基于mean shift和卡尔曼滤波改进跟踪算法(Based on multi-target tracking and realization, which describes the status of the tracking algorithm, and how mean shift and Kalman filter based tracking algorithm to improve)

说明：   二维空间中的多边形逼近算法 确定三个顶点a，b，c并且其函数值按从小到大排列( Two-dimensional space of polygons in the approximation algorithm)