slr(1),设计文档，希望对有些人帮助

用Apriori算法寻找大项目集

WIN2000 NT SERVICE控制源代码-WIN2000 NT source code control SERVICE

枚举局域网内机器-enumeration LAN machines

SunPlus Firmware Decrypter

Pattern Recognition材料-Pattern Recognition Materials

配置win7、java1-6-45环境变量配置ok，完美

dct域内视频的下采样源程序，分辨率从1080×1920下采为480*640-the original program file of video sub-sampling in DCT domain,the precision is 480*640 under 1080x1920

连杆机构精确演示 动画 包括计算-Linkage precision in terms of Animation

主要针对MFC串口通信控件的开发，实现了串口数据的交互，新手学习和了解串口通信的最好示例。

动态规划----矩阵连乘问题 动态规划法是解决问题的一种方法。它不规定为了得到结果需如何将问题划分为子问题的固定方法，而是按不同输入给出问题的具体实例的子问题划分方法，然后再进行运算、解答问题。 矩阵连乘问题的主要思想如下： 1）设置大小为连乘个数的方阵 2）主对角线上方各元素Di,j(ij)记录获得该最小工作量矩阵分组的第一组的最后一个矩阵的序列号 最后通过下方元素可知最终结果的分组方式。-dynamic programming matrix continually multiply-dynamic programming problem is a problem-solving method. It does not require the results need to be how to divide the problems of the sub- problems fixed, but different input given by the specific example of the problem partition method, and then calculate, and answer questions. Matrix continually multiply the main idea is as follows : 1) the installation of the size of continually multiply the number phalanx 2) above the main diagonal elements Di, j (ilt; J) Matrix Mi continually multiply to the smallest workload 3) below elements Di, j (IGT; J) the record was the smallest workload of a matrix of the first group of a matrix of the final sequence, followed by the final element of the final results of the