这是ATL电子书的随书代码，共12章节，感觉不错哦，给那些刚学ATL的朋友们吧...

这是带IIC通信的时钟芯片DS1307的数据手册，对于写时钟来说，就没得说的哈。必需看它。-This is the IIC communication with the clock chip DS1307 data sheet for the write clock for the Kazakhstan have to say no. Necessary to watch it.

unixShellProgramming

ANSYS的APDL参数化建模，介绍了ANSYS中用APDL建模的基本思想，提出格式表准化建议-ANSYS parametric modeling of APDL, the ANSYS using APDL introduce the basic idea of modeling, the format of the proposed quasi-Table

数据仓库应用开发基础书籍-data warehouse application development foundation books

一本C和C++编程非常实用的电子书，内容丰富，对提高编程技巧很有帮助-a C and C++ programming is very useful e-books

PCI接口规范中文版说明,初次接触PCI开发的好帮手。-PCI interface specification Chinese version of that initial contact PCI"s good helper.

图论中最小生成树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]

Visual C++NET专业项目实例开发-源代码Project01Chapter08BankOperation-Visual C++ NET development of professional project examples- source code Project01Chapter08BankOperation

强烈推荐， 强烈推荐。-Strongly recommended, strongly recommended and strongly recommended.

在Visual C++环境下开发嵌入式系统用户手册。