LDPC译码算法

关于半导体SEMI SECS SECS-I SECS-II GEM HSMS的一个程序，采用SEMI E37的协议规格编程，来完成和半导体生产设备的通讯

x86 arch资料，易于理解intel x86架构(x86 arch)

利用回转窑生产氧化铝的工艺中，提出了一种新的基于SVR（支持向量回归）的烧成带温度软测量方法。即首先对从回转窑采集到的烧结图像进行预处理，消除噪声的干扰；然后利用大津方法分割出物料区和火焰区，并提取这些区域的图像特征；其次利用基于SVR方法建立的烧成带温度模型计算温度值；参数计算.(The use of alumina rotary kiln production process, a new-based SVR (support vector regression) of the burning zone temperature soft measurement method. That is first collected from the rotary kiln sintering image pre-processing to eliminate noise interference Otsu method and then use the materials division of the district and flame zones, and extraction of image features in these regions SVR-based method followed by the establishment of the burning zone temperature model temperature parameters.)

第27章 透明位图背景上的滚动字幕实例该程序可以方便实现字幕的滚动效果，程序简单易懂(transparent bitmap on the background of rolling subtitles examples of the procedures to facilitate the achievement of subtitles rolling results, procedures simplified)

说明：  Dieu khien robot tu xa

说明：  这篇文章详细介绍了拉格朗日乘子法的原理及其相关知识。(It introduces the principle and relevant knowledge about lagarange multiplication in detail.)

轨道设计，确定着陆准备轨道近月点和远月点的位置，以及嫦娥三号相应速度的大小与方向。(Track design, determine the location of the landing point in recent months to prepare the track and Apolune, as well as the size and direction of the Chang-e III corresponding velocity.)

说明：  1、 创建图类，存储结构使用邻接矩阵。 2、 输入图的节点数n（不超过10个）、边数m，节点分别用1-n代表。 3、 采用“起始节点，终止节点，权值”输入图的m条边，创建图。 4、 输出从节点1开始的BFS遍历，在遍历过程中，如有多个可以选择的节点，则优先选择编号较小的节点。 5、 输出从节点1开始的DFS遍历，在遍历过程中，如有多个可以选择的节点，则优先选择编号较小的节点。 6、 输出从第1节点到第n节点最短路径的长度，如果没有路经，输出0。(1. Create graph class and use adjacency matrix in storage structure. 2. The number of nodes n (no more than 10) and edge m in the input graph are represented by 1-n, respectively. 3. Create a graph by using the m-edges of the input graph of "Starting Node, Terminating Node, Weight Value". 4. Output BFS traversal starting from node 1. In the traversal process, if there are multiple nodes to choose, the node with smaller number will be preferred. 5. Output DFS traversal starting from node 1. In the traversal process, if there are multiple nodes to choose, the node with smaller number will be preferred. 6. Output the length of the shortest path from the first node to the n node. If there is no path, output 0.)

说明：  codes for matlab . .

this code makes us to play cricket