bianjiegou

一个锁屏幕的程序，不再电脑旁时，防止被其他人看你的电脑资料(A lock screen program is no longer next time the computer, and prevent other people to read your computer data)

用于arduino的加速度传感器MPU788的库文件(library file of MPU788 for Arduino)

说明：  数字图像的纹理分析应用实例，可以计算图像的能量，熵，惯性矩，局部平稳性和相关。~..~(digital image texture analysis application, the images can be calculated energy, entropy, moment of inertia, local smooth and relevance. ~ ~ ..)

本代码是Real-time O(1) Bilateral Filtering,也就是常数时间复杂度的双边滤波器，它对于很多其他算法有着很大的作用。对应论文就是Real-time O(1) Bilateral Filtering。亲自编译运行通过(It is the C++ code of Real-time O(1) Bilateral Filtering, that is, constant time complexy bilateral filtering, it is vitally useful for other algorithams. The responding paper is Real-time O(1) Bilateral Filtering. It is execuable.)

普林斯顿开发的快速球面调和变换算法，我把它移植到windows下，并做成链接库，可以直接调用(Princeton rapid development of the spherical harmonic transform algorithm, I transpose it to the windows, and causing link library, and can directly call)

一种有效提高线天线矩量法计算速度的新方法(A new method for calculating antenna moment method effectively improve the speed)

Atmega128的一些程序，包括流水灯，PWM等(The Atmega128 some of the procedures, including water lights, PWM, etc.)

这段代码是用来求希尔伯特变换的，希望对大家有用(The Hilbert transform )

MATLAB混合编程想把matlab强大的功能用在自己的工程实践中吗这是本不错的混合编程的书(Hybrid Programming MATLAB want matlab powerful in their own practice, it works this is a mixture of good programming book)

说明：   有一个长度为整数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.)