Visual Basic上机操作指导书详细介绍VB的操作

计算机网络，自底向上的技术 第三版 习题答案-Computer networks, the technology bottom-up answer to the third edition of Exercises

拉普拉斯金字塔算法-Laplacian pyramid algorithm

著名测试工具的官方中文版资料,内容详尽!-famous test tools the official Chinese version of the information and informative!

随机信号课件 大家相互学习学习 有意见也请大家提出来 -Random signal courseware to learn from each other U.S. study has also asked people to put forward their views to

itput 第七期-itput seventh issue

侯捷先生翻译的书籍《Win32多线程程序设计》的源代码。-translated books "Win32 multithreaded programming," the source code.

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

flex game design for beginners

用串口实现警报系统,VC用单文档方式实现-serial interface alarm system, VC single document means

高阶谱估计的函数方程,很有用处,用于检测被高斯信号淹没的信号-higher order spectral estimation function equation, useful for the detection of Gaussian signal was submerged signal