c of a classical algorithm, with a variety of algorithms.

曲线的三次样条插值，在非首尾节点处具有三次光滑性质-Curve cubic spline interpolation, in both nodes with non-smooth nature of the three

里的所罗门RS编解码方案，建立工程后可直接编译调试，对于学习RS编码原理的人员可以作为一个例子学习，也可以应用于相应的系统中

图像识别练习（字符验证码、车牌号、身份证号）

The idea is from "The Blur Effect: Perception and Estimation with a New No-Reference Perceptual Blur Metric" Crété-Roffet F., Dolmiere T., Ladret P., Nicolas M. - GRENOBLE - 2007 In SPIE proceedings - SPIE Electronic Imaging Symposium Conf Human Vision and Electronic Imaging, É tats-Unis d Amérique (2007)-Measure the blur level of still image.

快速幂级算法 求RSA基础-rapid power-based RSA algorithm for

一些uva的acm题，一些不很难的题，希望一开始学习的人能有一个好的入门情况，代码写的清晰简单，好入门，为了凑五十个字。我丧心病狂了为了凑五十个字。我丧心病狂了为了凑五十个字。我丧心病狂了为了凑五十个字。我丧心病狂了为了凑五十个字。我丧心病狂了

相邻帧间图像差分思想：该方法是用图像序列中的连续两帧图像进行差分，然后二值化该灰度差分图像来提取运动信息。

本人编的一个程序，用来求解支持矢量，可以用于分类和回归。-I made a procedure to solve the support vector, can be used for classification and regression.

表达式计算器 cos sin + ―*-Expression calculator cos sin+-*

0 / 1背包问题是一个N P-复杂问题，为了解决该问题，，将用回溯算法解决该问题。既然想选择一个对象的子集，将它们装入背包，以便获得的收益最大，则解空间应组织成子集树的形状（如图1 6 - 2所示）。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法，去找到可获得的最大收益。然后，对该算法加以改进，形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0/1 knapsack problem is a P-complex issues, in order to solve the problem, and will be used backtracking algorithm to solve the problem. As to the choice of a subset of object, they will load a backpack, in order to obtain the greatest profits, the solution should be organized into space subset of the shape of the tree (Figure 1 6-2 below). The backtracking algorithms and 4. Two loading problem is very similar. Forming a recursive algorithm to get the maximum benefit available. Then, this algorithm is modified to form code. Improved code can be found at the maximum benefits included in the backpack of a collection of objects.