教学配置EJB.rar 是以前刚学EJB时，一个老师给的，是一个桌面录像，把配置的过程路了下来，还带声音解释，相信会很有用。...

利用c语言编写的三维迭前偏移的代码，算法结果正确，精度高，具有很好的实用性-The use of three-dimensional Diego c language code before the cheap, algorithms result is correct, high precision, with a good practical

最新delphi2005的b/s程序设计-b/s Design

这是一套教会读者掌握和使用UML的教材和指导手册，而不是枯燥的标准文献。对于想学习和使用UML的广大读者，这是一套难得的好书。-This is a church readers grasp and use UML materials and instruction manual, rather than the standard boring literature. For those who want to learn and use UML readers, which is a set of rare books.

光学ＡＢＣ，关于光学的一些介绍，对于进入光学领域的来说还是不错的！-optical ABC, on the optical definitely, for entering the field of optics but still pretty good!

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

介绍QGIS的中文教程,是初学GIS的很好的参考手册.-Introduction QGIS tutorials in Chinese, is a good beginners reference manual for GIS.

this pdf helps u to learn vc++ very deeply

JSF好的学习资料.英文原版....值得学习. 内附源码.-Jsf (O reilly) by Hans Bergsten Examples

非常不错的asm手册-very good asm Manual

学习数据压缩原理的简单教程-study data compression principle of a simple guide