《LED显示屏系统原理及工程技术》

这是著名的C＋＋书籍《C++ Primer》第四版的原代码！-This is a well-known C++ books "C Primer," the fourth edition of the original code!

北大java教程，据说很不错。可以看看！-North java tutorial, it is said is pretty good. Can look at!

sip_ch.rar sip协议中文版-sip_ch.rar sip Chinese version of the agreement

在MFC中使用SQL数据库编程代码-use SQL database programming code

高质量C、C++编程指南-quality C, C Programming Guide

《linux安装与配置简明手册》，通过它可以很容易的入门，并独自配置Linux系统-"linux simple installation and configuration manual," and through it very easy songs, Configuration and Linux system alone

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

MATLAB／Simulink的平台上，设计并实现了一种多输入多输出、正交频分复用的无 线通信系统健路级仿真。针对多输入多输出通信系统仿真对硬件资源消耗严重的不足，提出了一种 在MATLAB／Simulink环境下利用局域网内多台PC进行吩布式联合—防真的方案。该方案灵活有效， 可广泛应用于各类具有高复杂度的通信类仿真。

Delphi 6 程序员代码编写标准指南-Delphi 6 programmers code standards for the preparation of guidelines

我不会，来这儿想学习的，我对word 宏感兴趣，请大家帮忙。-I will not, come here want to learn, I am interested in word macros, please help.