计算机密码学－通信中的保密与安全(1)比较详细的介绍了一些常用的密码....

C语言库函数大全，如果是C语言的初学者，建议不要碰他，还是高手级别的人看看吧。-C language library function Guinness, in the case of C language for beginners, it is recommended not to touch him, or masters-level people who look at it.

国外的一篇关于低噪声放大器的论文，可用于机顶盒内的调协器，欢迎下载！-Abroad on a low-noise amplifier of the papers, can be used for set-top boxes within the co-ordination, and welcome to download!

Windows高级编程 ――面向对象的思想、方法和实例.rar-------好书!-Windows Advanced Programming-- Object-oriented thinking, methods and examples. Rar------- books!

查表法在温度遥测中的应用。计算机非线性存储法实现温度传感器线性化-Look-up table method in the temperature telemetry applications. Computer non-linear storage method to achieve temperature sensor linearization

OReilly - Java Internationalization-OReilly- Java Internationalization

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

世界名著安徒生大作。-world famous Andersen NPC.

显示文件、路径、文件图标的树型控件- The display file, the way, the document chart sign tree controls

是一本很实用的ASP技术手册教程.-Is a very useful tutorial ASP technical manuals.

OReilly系类经典之一XSLT Cookbook-OReilly Department of the classic type, one of XSLT Cookbook