一本详细SMBUS的书籍，对希望详细了解笔记本电脑各部件怎样通信的人有很大的帮助...

Testbenches have become an integral part of the design process, enabling you to verify that your HDL model is sufficiently tested before implementing your design and helping you automate the design verification process. It is essential, therefore, that you have confidence your testbench is thoroughly exercising your design. Collecting code coverage statistics during simulation helps to ensure the quality and thoroughness of your tests.

Algorithm Collections for Digital Signal Processing Applications Using Matlab.

最优化理论与方法-optimization theory and methods

SQLServer初学教程，浅显易懂。-SQLServer Beginners Guide, simple words.

图论中最小生成树Kruskal算法 及画图程序 M-函数 格式 [Wt,Pp]=mintreek(n,W)：n为图顶点数,W为图的带权邻接矩阵，不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图 例如 n=6 w=inf*ones(6) w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3] w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6 [a,b]=mintreek(n,w) -Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function format [Wt, Pp] = mintreek (n, W): n for the map Vertices, W for weighted graph adjacency matrix, does not constitute the edge of the two vertices of between the right to express with inf. Show the minimum spanning tree of edges and vertices, Wt right for the Minimum Spanning Tree, Pp (:, 1:2) for the minimum spanning tree edges of the two vertices, Pp (:, 3) for the minimum spanning tree of the right side, Pp ( :, 4) For the minimum spanning tree graph edge serial number, red connection for the minimum spanning tree of graph such as n = 6 w = inf* ones (6) w (1, [2,3,4]) = [ 6,1,5]

file system source code

基于相位角点检测的特征匹配研究，很好用的。-Corner detection based on phase matching of the characteristics of research, a good use.

c++编程的基础知识，对初学者有举足亲重的作用，是基础学问-the basis of knowledge, for beginners to cope with the pro-oriented role, is the foundation of knowledge

C++ Primer 3rd Edition 中文版-C Primer 3rd Edition Chinese version

keil的使用说明,是应用keil较好的文本手册。-the manual of the keil software