非恒定渗流计算程序（包括数值解和解析解的程序fortran语言）...

本程序为Kmp匹配算法的实现,程只需直接运行即可,-the procedures for KMP matching algorithm implementation, a journey which takes you directly can run,

可以反编译 .network 之类的源文件 dll，打开解压 之后，把索要反编译的dll文件拖到里面就可以看到编译后的结果咯，效果还不错啊，可以试试，基本上跟源代码一样啊。。。。。。。。。

FPgrowth is the one of the algorithm in frequent item set mining. It is used to find the frequent item set in a database. It will give the output in tree structure format. It is more efficient than apriori algorithm because there is no candidate generation. 

The inverse of the gradient function. I ve provided versions that work on 1-d vectors, or 2-d or 3-d arrays. In the 1-d case I offer 5 different methods, from cumtrapz, and an integrated cubic spline, plus several finite difference methods. In higher dimensions, only a finite difference/linear algebra solution is provided, but it is fully vectorized and fully sparse in its approach. In 2-d and 3-d, if the gradients are inconsistent, then a least squares solution is generated

适用于初学者的C#源代码，教你学会画点画线和画面，并且能判断点与折线以及点与多边形的位置关系。代码清晰易懂，重点处附有注释。

8数码难题 深、广、a*-eight deep problem, Kwong, a*

我们用轨迹条来控制滤波器，来动态得到不同滤波效果1.已将dll打包到Release文件夹下，运行Release文件夹中的exe可以直接看到运行结果.2.源代码运行需要进行OpenCV+VS开发环境的配置。我是使用编写环境：Visual Studio 2010写作当前代码时配套使用的OpenCV版本： 2.4.8

Ordinary and Partial Differential Equation Routines in C, C++, Fortran, Java, Maple, and MATLAB

给出N口井的坐标，把距离小于给定值的分为一组。只要一口井与这一组中有一口井小于给定距离，则它属于这组-N wells given the coordinates, distance less than the given value is divided into one group. As long as a well and the group has a well less than a given distance, it belongs to this group

采用高斯背景建模以及帧差法提取出运动物体，然后用camshift算法进行跟踪。对于背景不动的场景，跟踪效果较好。能够很好地学习opencv中相关的函数，算法。对于初学者有很大的帮助。