Differential Equations, Dynamical Systems and An Introduction to Chaos by Morris...

据说是学习电脑知识的一本不错的书，我今天刚刚那个下的-Is said to be learning computer literacy a good book, Today I have just under that

C深度揭密讲述了C语言的许多系统特性以及这些特性是如何形成的.本书为PDF格式,它展示了最优秀的C程序的编码技巧,是C程序员进行系统编程的必读之书.-C revealed about the depth of C language system characteristic of many of these features is formed. The book-to-PDF format, it features the best of the C program code skills of systems programmers C programming required reading books.

ajax，不用多说，这里提供一个最简单的入门例子。-ajax, Needless to say, Here is one example of the simplest entry.

JAVA 面试资料 by 巴斯滕-JAVA interview information by Marco van Basten

刚接触ASP的朋友，可以通过这个教程的学习，进一步了解ASP-begin ASP friends, through the Directory of learning, understanding ASP

三类传真机是采用数字处理技术的通讯设备，介绍了三类传真机的硬件原理与应用。-Three types of fax machines is the use of digital processing technology, communications equipment, fax machines, introduced three types of hardware and application of the principle.

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

电子版VC++ 学习用书,本书共分14章基本上含盖了VC的整个方面,可用于学习或参考-electronic version of VC to study, the book is divided into 14 chapters covering basically the entire VC, can be used to study or reference

Windows 2000_XP 下实现休眠-under Windows 2000_XP dormancy

Covering pattern classification methods, Combining Classifiers: Ideas and Methods focuses on the important and widely studied issue of how to combine several classifiers together in order to achieve improved recognition performance. It is one of the first books to provide unified, coherent, and expansive coverage of the topic and as such will be welcomed by those involved in the area. With case studies that bring the text alive and demonstrate real-world applications it is destined to become essential reading.-Covering pattern classification methods, Combining Classifiers: Ideas and Methods focuses on the important and widely studied issue of how to combine several classifiers together in order to achieve improved recognition performance. It is one of the first books to provide unified, coherent, and expansive coverage of the topic and as such will be welcomed by those involved in the area. With case studies that bring the text alive and demonstrate real-world applications it is dest