svdl

lapack的c++版本之一.lapack是imsl,mkl,matlab等大部分数值计算的使用者.最早是for77的,后来出现c++,java等的.(lapack one of the c version. Lapack is imsl, mkl. Matlab, and most numerical calculation users. The first was for77, subsequently c, java and so on.)

Persian calender mfile 1392 in matlab

m伪随机序列Matlab源代码，很不错，值得看看(m pseudo-random sequence Matlab source code, very good, we can look at)

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

operate the library on windows operation

MATLAB教程，可以很好的进行matlab的系统学习(MATLAB tutorials, can be very good for a systematic study of matlab)

有关机动目标跟踪，卡尔曼滤波相关的资料，对从事卡尔曼滤波研究，机动目标跟踪的朋友有参考价值 (The maneuvering target tracking, Kalman filtering relevant information, engaged in Kalman filtering, target tracking friends have reference value)

獲取windows系統硬盤的一些信息，可以獲取到SN,FW,MODEL,等等信息(Get some information windows system hard disk, you can get to the SN, FW, MODEL, and so forth)

说明：  有两个矩阵a和b，均为2行3列。求矩阵之和。(There are two matrices a and b, are two rows 3. Demand matrices, and.)

选择一种编码方式。在这里可以采用行编码和列编码，但经过大量的实验表明，这两种编码方式的抗干扰性能不佳(choose a coding. The trip here can be used coding and coding out, but after a lot of experiments showed that both the encoding anti-jamming performance poor)