用于得到CPU的信息，包括类型，厂家，支持的技术，有内嵌式汇编...

对于新人，此软件是用vc++ 编写的mfc 类似文件管理器，入门者是很好值得参考的。-For newcomers, this software is used the vc++ to prepare a similar file manager mfc, entry is worthy of a good reference.

huffman源代码，包含该算法的具体实现，从统计概虑到编码-Huffman source code, the algorithm contains a concrete realization from the statistical estimate takes into account coding

提供位图、RGB及YUV转化算法，BMP TO rgb，BMP TO YUV, RGB TO YUV, RGB TO BMP, RGB TO YUV, YUV TO RGB, YUV TO BMP，基于C++开发的源码包，C#可对于修改后使用

用链式队列实现将图像按四叉剖分原则分割成一些具有同样像元子块的集合, 并记录各子块图像的原点的行列位置、行列数、像元属性值-Queue chain to achieve with the image in accordance with the principle of quadtree subdivision is separated into a number of the same block as a collection of Yuanzi and record images of the sub-block position the starting point of the ranks, the ranks of the number of pixel attribute values

SBC2410 WinCE 5.0 BSP.绝大多数驱动已经调通。-SBC2410 WinCE 5.0 BSP. The vast majority of drivers have been transferred Qualcomm.

LCS问题就是求两个字符串最长公共子串的问题。解法就是用一个矩阵来记录两个字符串中所有位置的两个字符之间的匹配情况，若是匹配则为1，否则为0。然后求出对角线最长的1序列，其对应的位置就是最长匹配子串的位置。 最长递增子序列LCS的实现C源码！-LCS problem for two strings is the longest common sub-string problem. Solution is to use a matrix to record the location of two strings of all the matches between the two characters in the situation, if the match is one, otherwise to 0. And one of the longest diagonal obtained sequence, the location of its corresponding sub-string match is the longest position. The longest increasing sub-sequence source C implementation of the LCS!

这是一个倒计时程序，他会在桌面上保留一个小小的工具条，显示距离某个日子（如考研）还有多少天。拉开程序界面之后，还可以在每一天里面写上数条笔记，记下要做的事情，比如读书计划等。-This is a countdown procedures, he will retain the desktop tools of a tiny show from a particular day (taking tests) how many days. After the proceedings started interface, but also on every day they write a few notes, recording things to do, such as reading programs.

西门子公司的sle4442加密ic卡的读、写、密码校验源程序。-Siemens company sle4442 encryption id cards reading, writing and checking the source code.

Codecover是测试Delphi工作所编写程序覆盖率的工具。加载Delphi工程后，运行就可以实时的看到运行结果。条件是，在编译Delphi程序时，同时要生成MAP文件。 -Codecover Delphi work is to test procedures prepared by the coverage rate of tools. Add Delphi works, it can run real-time to see the results. The condition, the Delphi compiler procedures at the same time to generate MAP documents.

递归查询指定目录的所以文件。-recursive directory inquiries so designated documents.