FFT算法的程序

三态树：一个树控件的派生控件，完成item的三种状态-Tri-state tree: A tree control derivative controls, the three states to complete item

C Code of the ABC algorithm

1维和2维快速傅里叶变换，网上广为流传的英文版本-1-D and 2-D Fast Fourier Transform， Perform a 2D FFT inplace given a complex 2D array

计算Pi的程序, 是老程序了, 不过很牛. 值得收藏!-Pi calculation procedures, the old procedures, but very cattle. Copies!

进行模糊控制逻辑运算，输入为误差和误差变化率，采用三角形隶属函数进行模糊化，采用最大最小法进行模糊推理，采用重心法进行去模糊化。

将求解偏微分方程和局部网格加密简单组合在了一起。用的方程是一个含有间断二次系数的椭圆型方程，在系数间断的位置，解会有一个弱间断。-Will solve the partial differential equations and local mesh refinement simple combinations together. Used equation is a quadratic coefficient of containing discontinuous elliptic equations, the location of discontinuity in the coefficient, there will be a weak solution of continuity.

目的是把左边的所有盘子移到右边的杆子上。一次只能移动一个盘子，你可以使用中间的杆子作为临时存放盘子的地方。小盘子必须放在大盘子之上。问题看似不难。的确，如果盘子只有两三个，是很容易解决的。但是随着盘子数目的增加，问题就变得非常难解了。 -purpose is to the left of all the dishes moved to the right side of the pole. Only a mobile one tray, you can use the middle of the pole plate as a temporary storage place. Small plates must be placed on the platter on top. It may seem it is not difficult. Indeed, if the plate is only 23, it"s very easy to solve. But with the increase in the number of dishes, the problem has become a very difficult.

资源描述很简单的小程序。#include   #include using namespace cv; void main() { IplImage *src; src = cvLoadImage("lena.jpg"); //这里将lena.jpg和lena.cpp文件放在同一个文件夹下 cvNamedWindow("lena", CV_WINDOW_AUTOSIZE); cvShowImage("lena", src); cvWaitKey(0); cvDestroyWindow("lena"); cvReleaseImage(&src); }

傅立叶分解M文件，一直在用，非常好用，很经典-Fourier decomposition of M documents, has been in use, very easy to use, it is a classic

最小集合算法 采用类似贪婪算法 运行速度快