weifenfangchengdeshujijiefa

poly2trellis，程序清晰简单，容易阅读，matlab调用易实现(poly2trellis, procedures clear and straightforward, easy to read, matlab call easy to realize)

will automatically delete the directory of debug and release, so please do not put files on these two directory

IMPARARE IL C++ in 2 ore e mezzo? Modulo-new

利用MATLAB画出一个立方体，并通过一种简单仿射变换矩阵得到变换的立方体(Use of MATLAB draw a cube, and through a simple affine transformation matrix get transformation of the cube )

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.)

说明：  MATLAB和C++开发都有，代码齐全，资料非常有指导意义，适合有一定基础的人。（含资料：全国高技术重点图书·通信技术领域 遗传算法及其应用）(It concludes code of matlab and c++,and some important referance is also included.)

MATLAB做的不错的人脸识别的程序，希望大家能能受用，-color ，经测试可直接使用。 (Face recognition program MATLAB to do good, and I hope that we can be able to benefit from-color has been tested and can be used directly.)

说明：  VB与MATLAB接口使用实例.保准一学就会。(VB and MATLAB interface examples.保准One school will be.)

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

真的是一个好程序，LDPC码的完整的编译码，matlab编写的元胞自动机。( Really is a good program, Complete codec LDPC code, matlab prepared cellular automata.)