图像拼接融合算法

统计模块的 C++源程序 ,可以用来计算统计数据.　-Statistics module C++ Source can be used to calculate the statistics.

固定分区模拟,按"回车"可以随机加入进程,对未获资源的进程自动排序,等待调度-Fixed partition simulation, press the Enter can be random to join the process has not been the resources of the process of automatic sorting, awaiting scheduling

用vc＋＋平台开发的双三次样条插值函数，具有很高的精度，能够完成对面上的点的插值-Using vc platform for the development of bi-cubic spline interpolation function, has high accuracy, can be completed on the surface of the interpolation points

应用光流法对目标进行检测和估计。亲测好用，效果很不错

C++ 各种排序算法演示(插入、希尔、冒泡、快速等)。

AVL树的创建与基本操作-AVL Tree and the creation of basic operation

穷举法程序-算法分析，是用C写的好经典，马克思手稿…………有三个程序！ -Exhaustive method process- algorithm analysis, is to use C to write a good classic, Marx manuscripts ... ... ... ... There are three procedures!

这是本人多年来学习神经网络的代码的一个总结，里面包括了具体的算例，以及对训练过程的详细解说，希望对别人有一定的帮助。

逐次超松驰迭代法(Successive Over Relaxation Me thod,简称SOR方法)是高斯―塞德尔方法的一种加速方法，是解大型稀疏矩阵方程组的有效方法之一，它具有计算公式简单，程序设计容易,占用计算机内存较少等优点,但需要较好的加速因子(即最佳松驰因子).下面我们首先说说松驰一词的含意,再利用它来解释雅可比迭代法与高斯―塞德尔迭代法,最后给出逐次超松驰迭代法的推算公式和收敛性条件.-Successive over relaxation iteration method (Successive Over Relaxation Me thod, called SOR method) is the Gauss- Seidel method for an accelerated method is solution of large sparse matrix equations, one effective method, it has a simple formula, programming easy, take up less computer memory, etc., but the need for better acceleration factor (that is, the best relaxation factor). Let us first talk about the meaning of the term relaxation, and then use it to explain the Jacobi s iterative method and the Gauss- Seidel iterative method, and finally gives successive over relaxation iterative method of projection formula and the convergence condition.

Windows下使用C语言实现在dos界面下的五子棋小程序，拥有能够接受的界面。