Service Manual portable LCD TV Vitek VT

这是让初学MFC的人，让他们更熟悉MFC架构-This is the person MFC beginner, so they are more familiar with the MFC architecture

对半导体光放大器的交叉增益调制进行模拟，可用于bulk-SOA，修改参数后还可以进行QD-SOA的模拟。-On semiconductor optical amplifier cross-gain modulation simulation, can be used to bulk-SOA, modify parameters can also be used for the simulation of QD-SOA.

Internet与TCP_IP程序设计之C++Builder高手-Internet Programming with TCP_IP of C++ Builder master

好东西，学VC++时都能够用的到的！大家来看啊-Good things, learning VC++ When they can afford to use to! We look at ah

think in java 的中文电子版，很好的一本书-think in the Chinese electronic version of a good book! !

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

java数据库编程宝典，希望对大家有多帮助-java database programming book, and they hope to have everyone help

深入java虚拟机第二版，非常好的一本书。-Java virtual machine, the second edition of in-depth, very good book.

sun 公司官方代码规范标准，java入门必备-Sun Code Conventions for the Java Programming Language

非常详细的讲述了如何设计好滤波器，英文版-very detailed about how to design a good filter, English