变尺度法

一个用MFC写的滤波器源代码，代码结构非常精巧，可以参考 功能：1 固定带通滤波 2 可变带通滤波 3 噪声删除 4 输入输出误差计算 实现比较简单，由于使用了Microsoft Foundation classes，代码流程很简单，但是实现的功能比较充分 Filter.h：头文件，定义了CFilterApp 类 Filter.cpp：利用MFC的函数实现了CFilterApp Filter.rc：资源文件，包括对话框和图标的说明(use a filter to write MFC source code, code structure is very delicate, can be functional : a fixed band-pass filtering two variable bandpass filter to delete four 3 noise input and output error calculation is relatively simple to achieve. As the use of Microsoft Foundation classes, code process is simple, but to achieve the more fully functional Filter.h : The first document, CFilterApp definition of the category Filter.cpp : MFC function realized CFilterApp Filter.rc : resource files, including dialog box and the note icon)

matlab中大津法（otsu）的源代码程序，已经经过测试，可以在matlab中直接运行(matlab in Otsu (otsu) program source code, has been tested and can be run directly in matlab)

基于windows的任务管理器开发设计 windows task mananger(Based on the windows task manager development and design windows task mananger)

提取Harris角点程序，非常好用的角点提取程序(Harris corner extraction program, very easy to use corner detection process)

很清晰的fastica算法,主要是有关主元分析的程序，很好的，自己编的，有不会的 可以咨询(it s a progress which is fastica)

这是信号分析应用里面一个滤波的基本程序，非常有用，供需要者学习(This is a signal analysis application of the basic procedures inside a filter is very useful for those who need to learn)

说明：  在网上下载的好用的傅里叶变换程序 时域变频域信号分析(Fourier transform program)

m、W序列的产生及仿真，扩频复合系统的源程序(m and W sequence generation and simulation, source of spread spectrum composite systems)

方程求根的matlab程序，用的是平行法则，仅供参考(Roots of the equation matlab program, using a parallel rule, for reference only)

说明：   有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。 现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。 可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入： 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数，每组有一对数字。 输出： 可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)