VC6_0-MATLAB7_x

The cache manager source code implemented in Windows kernel.

说明：  VB调用MATLAB 使用VB来调用matlab里的函数，可以综合matlab的强大功能使vb开发的程序效率更高。(MATLAB using VB to call matlab in VB to call the function, can be integrated so that the power of matlab programs vb efficient.)

说明：  数字电子技术基本元件--触发器 的程序, 支持多种触发器图形显示.(Trigger)

说明：  48个城市的TSP遗传算法，开发环境C++，计算结果再结合matlab进行后处理显示(48 cities in the TSP algorithm, development environment, C++, matlab results combined with post-processing display)

search in array by binary search

该论文介绍了电磁场积分方程的无网格数值计算方法，传统的体积分数值计算都需要进行网格剖分，网格剖分的好坏直接影响着数值计算的速度和精度，很多精细结构很难用网格来模拟，无网格技术可以很好地解决此类问题！(This paper describes the meshless numerical method electromagnetic integral equations, numerical integration of traditional body calculations require meshing, meshing a direct impact on the speed and accuracy of numerical calculation, many very fine structure difficult to simulate with the grid, no grid can solve this problem!)

数字信号处理及其matlab实现，，希望对大家有帮助，谢谢，()

set_white,matlab一算算法最短路径的选取，最详细的程序。(set_white matlab count shortest path selection algorithm, the most detailed procedures.)

matlab的gscale函数功能是将强度图像等映射到别的值范围。(Function of matlab gscale intensity images is mapped to another range.)

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