mat

VC++与MATLAB的混合编程的快速实现 讨论了如何用MATLAB的complier将*.m函数编译为动态链接库DLL，供VC++使用的方法。(VC++ and MATLAB programming for fast implementation of mixed discuss how to use MATLAB' s complier to*. m functions compiled as dynamic link library DLL, VC++ for the methods used.)

运用matlab语言编译，进行聚类分析，并且给出了matlab界面。(failed to translate)

用MATLAB 编写的三轴加速度计标定程序。然后对标定的结果进行补偿(Using MATLAB-axis accelerometer calibration procedures. Then the result of calibration to compensate)

用matlab编写得一个发泄工具，通过这个可以看出你得英语水平(Using matlab to prepare for a venting tool, through which we can see that you have the standard of English)

对加拿大山猫捕获数量进行时间序列分析，建立自回归方程，并对未来的捕获数量进行了预测(To capture the number of Canadian lynx time-series analysis, since the regression equation, and the future was predicted to capture the number of)

介绍晶体结构，以及如何构建位错，纳米孪晶，如何利用C++与matlab编程(Introduction crystal structure, and how to build dislocations, nano twins, how to use C++ and matlab programming)

说明：  cegui使用说明,初学者可以看看,对api的介绍(cegui cegui cegui )

第k小元素（分治法） 给定一个线性序列集，要求求出其中指定的第K小的数的值和位置.如给定n个元素和一个整数i，1≤i≤n，输出这n个元素中第i小元素的值及其位置；(First k small element (divide and conquer) Given a set of linear sequence, where the specified requirements determined the K value and the small number of locations, such as a given n elements and an integer i, 1 ≤ i ≤ n, output this is the n elements of the i-th element value and the position of the small )

matlab绘制阵列正六边形。采用角度方法。(Draw a regular hexagon array matlab. Using the angle method.)

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