网络工程师学习笔记(完整版),将网络知识讲的很详细，很全面。...

代码分为两部分：ff_const_mul.v和ff_mul.v，从而实现GF乘法器，VERILOG编写-Code is divided into two parts: ff_const_mul.v and ff_mul.v, in order to achieve GF multiplier, VERILOG prepared

Thinking in Java2

架一台服务器哟！ 操作系统最好是装 Windows 2000 server版,（有win 2000高级服务器版就更好啦） 其他的版本如Windows 2000PRO专业版，Windows XP只玩玩WEB和FTP文件传输可以，想架自己的邮件服务器就不大行了。 不过让你的一台普通机子，和一条ADSL，成为一台有自己的网页，自己的FTP服务，自己论坛服务，自己的邮件服务器！！！的这么一台功能强劲的服务器，应该是没有问题的-A server rack yo! The best operating system is installed Windows 2000 server edition, (have win 2000 advanced server version of it okay) Other versions such as Windows 2000PRO Professional Edition, Windows XP play only WEB and FTP file transfers can be, I would like to frame their own mail server not the big brokerages. But let one of your ordinary loom, and a ADSL, to become one of Taiwan have their own web pages, FTP services to their own forum service, its own mail server! ! ! Such a powerful server, there should be no question

verliog 是很有用的一个电子书，和大家分享一下，相互的学习-verliog is a very useful e-books, and we share each other" s learning

linux0.11源代码分析-linux0.11 source code analysis

vc5周年书籍-vc5 anniversary of the book

windows 程序设计源码6-10-windows programming source 6-10

在现代化的工业生产设备中，有大量的数字量及模拟量的控制装置，例如电机的起停，电磁阀的开闭，产品的计数， 温度、压力、流量的设定与控制等，工业现场中的这些自动控制问题，若采用可编程序控制器( P C ) 来解决自动控制问题已成为 最有效的工具之一，本文叙述P C 控制系统设计时应该注意的问题。-In modern industrial production equipment, there are a large number of digital and analog control devices, such as motor starting stop, solenoid valve opening and closing, product count, temperature, pressure, flow and control settings such as, industrial site automatic control of these problems, the use of programmable logic controller (PC) to solve the automatic control issue has become one of the most effective tool, this article describes the design of PC control system should pay attention to.

ActionScript+3.0语言和组件参考.rar,很全面，很适用-ActionScript+ 3.0 Language and Components Reference. Rar, very comprehensive, it is applicable

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