LCGS

think in java WORD 版-think in java version WORD

在线PING 在线PING 在线PING 在线PING-online PING PING Online Online PING PING online Online online PING PING PING Online Online Online PING PING PING online online PI NG

contemporarycommunicatonsystem－using MATLAB经典书目源程序！-contemporarycommunicatonsystem-using MATLAB classic bibliographic source.

很不错的vb指令书籍，具有很好的指导价值，定会使你受益匪浅 -very good vb directive books, with the guidance of good value, will certainly keep you benefited from

jQuery Cookbook Edition December 2009 jQuery simplifies building rich, interactive web frontends. Getting started with this JavaScript library is easy, but it can take years to fully realize its breadth and depth this cookbook shortens the learning curve considerably. With these recipes, you ll learn patterns and practices from 19 leading developers who use jQuery for everything from integrating simple components into websites and applications to developing complex, high-performance user interfaces. - jQuery Cookbook Edition December 2009 jQuery simplifies building rich, interactive web frontends. Getting started with this JavaScript library is easy, but it can take years to fully realize its breadth and depth this cookbook shortens the learning curve considerably. With these recipes, you ll learn patterns and practices from 19 leading developers who use jQuery for everything from integrating simple components into websites and applications

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

高质量的VHDL代码乒乓处理FIFO缓存-High-quality VHDL code deal with ping-pong FIFO cache

win32系统编程1，内容有点深 johnson M.Hart著-a win32 system programming, as a little deep with johnson M. Hart

这本书主要介绍了MATLAB中 常用的一些函数和命令。-This book introduces a number of commonly used MATLAB functions and commands.