java入门必读-java entry reading

讲述机器视觉的原理及实现方法，很不错的机器视觉方面的参考材料，但是要求一定的英文功底-About the principle and implementation of machine vision methods of machine vision in a very good reference material, but requires a certain grounding in English

算法电子书, 主要是STL 中相关的资料Algorithms, 学习用-Algorithm for e-books, mainly in the STL-related information Algorithms, learning to use

SIP中文版协议，由信息产业部发布的。基于SIP上面的P2P网络传输。-SIP Chinese version of the agreement, issued by the Ministry of Information Industry. The above SIP-based P2P network transmission.

Excel VBA 2003程序设计实例导航-Excel 2003 VBA program design navigation

Develop ARM7 CPU core

C语言高级编程及实例剖析/王为青, 刘变红编著 ISBN号: 978-7-115-15423-1 出版发行项: 北京-人民邮电出版社 2007 光盘内容 附注项: 本书结合实例，深入浅出地介绍了C语言在主要应用领域的编程技术。全书共9章，分别为内存管理、文本屏幕界面设计、文件高级操作、图形图象、中断、通信技术、基本总线接口编程等。 附注项: C语言程序设计人员。 -C high-level programming language and examples of analysis/Wang Qing, Liu red for the ISBN number: 978-7-115-15423-1 published items: Beijing- People" s Posts & Telecom Press, 2007 CD-ROM of the contents of note: the book with examples, to learn more on the C language applications in the main programming. 9 book chapters, respectively, memory management, text-screen interface design, documentation of the advanced operators, graphic images, interruption, communications technology, such as the basic bus interface programming. Note item: C language programmers.

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

三星ARM9 S3C2412的PDF资料。-Samsung ARM9 S3C2412 the PDF data.