清华大学ARM培训教材，有很大参考价值。

matlab6.5电子版，经典的matlab学习丛书。-matlab6.5 electronic version of the classic series matlab learning.

8051 connect to LCD Display and show the words to test the LCD Display

Tcl教程，电子书，包括脚本命令，语法规则，错误异常等-Tcl tutorials, e-books, including the script commands, syntax rules, errors and abnormal

SCJP1.4的官方文档，非常不错的,欢迎下载。-SCJP1.4 the official documentation, very good, the welcome download.

JDK_API_1_6_zh_CN中文版,最新版jdk6,一起学java-JDK_API_1_6_zh_CN Chinese version, the latest version of jdk6, together with learning java

集成运算放大器的应用，超星阅览器阅览-Integrated Operational amplifier applications, access reader Superstar

ActionScript3.0Cookbook中文完整版,适合初学者-ActionScript3.0Cookbook Chinese full version, suitable for beginners

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

自己收集的javascript资料,很常用的哦，大家看看吧。

DWG_Smart-Card_USB-ICC_ICCD_rev10 smartcard USB方面的标准-DWG_Smart-Card_USB-ICC_ICCD_rev10 smartcard USB standards