yiweiFDTD1d

最近找的求解方程的程序，可以借鉴下，挺好的(Solving equations to find the most recent program, you can learn, the very good)

VC中调用Matlab测试代码混合编程 对于学习VC和MATLAB 很有帮助(VC call Matlab test code mixed programming learning VC and MATLAB helpful)

对图像进行预处理，主要的预处理是通过Matlab软件对图像进行直方图均衡化、增加对比度等操作(Nogata will increase the degree of balancing operation, etc.)

最新的matlab命令集合。搜集了网上的大部分(The latest collection of matlab commands. Collected most of the Internet)

灰色预测是一种对含有不确定因素的系统进行预测的方法。灰色预测通过鉴别系统因素之间发展趋势的相异程度，即进行关联分析，并对原始数据进行生成处理来寻找系统变动的规律，生成有较强规律性的数据序列，然后建立相应的微分方程模型。(Dissimilarity trends, namely, correlation analysis, and generate raw data processing system to find the law changes, generate a strong regularity of the data sequence, then the corresponding differential equation model.)

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

CC2530的定时器实验，使用IAR编写。(CC2530 key experiments, using IAR preparation procedures.)

文章有utd对爬行波进行循迹 给出微分几何算法 可在matlab 及vc来开发(Utd article has crawling wave of differential geometry tracking algorithm is given in the matlab and vc to develop)

c++ 大一上机作业 运用iterator 将name_pairs类进行排序(name_pairs 包含 name 和 age)()

陆吾生有关凸优化视频教程中的相应的子函数，包括牛顿法等(convex optimization)