These files are the MATLAB code for "Imperialist Competitive Algorithm (ICA)" wh...

使用 VMware 和 Dynamips 搭建广域网测试环境-VMware and use Dynamips to build wide area network test environment

一套易用的网络通信包，以C＋＋形式对功能进行封装。对WinSocket和NamedPipe的API函数进行封装，并且提供部分API函数完成连接的建立和数据检测功能。-set of easy-to-use communications network packets to C++ form of a wrapper function. Right Winsocket and NamedPipe API function package, and provided some API function linking the establishment and data detection capabilities.

OPC访问的源码， -OPC visit source,

在VC++中写了一个基于对话框的应用程序，通过调用外部封装好的DLL来实现串口通讯，比较简单-In the VC++ written in a dialog-based application package by calling an external DLL to achieve a good serial communications, a relatively simple

IEEE 802.11g explained

使用VB的OPC客户访问的最简单程序,本程序为同步访问程序,需要异步的查找ASync-VB.rar-The use of VB

We investigate the case of independent Rayleigh faded paths between antenna elements and find that with high probability extraordinary capacity is available. Compared to the baseline n = 1 case, which by Shannon’s classical formula scales as one more bit/cycle for every 3 dB of signaltonoise ratio (SNR) increase, remarkably withMEAs, the scaling is almost like n more bits/cycle for each 3 dB increase in SNR. To illustrate how great this capacity is, even for small n, take the cases n = 2, 4 and 16 at an average received SNR of 21 dB. For over 99 of the channels the capacity is about 7, 19 and 88 bits/cycle respectively, while if n = 1 there is only about 1.2 bit/cycle at the 99 level. For say a symbol rate equal to the channel bandwith, since it is the bits/symbol/dimension that is relevant for signal constellations, these higher capacities are not unreasonable. The 19 bits/cycle for n = 4 amounts to 4.75 bits/symbol/dimension while 88 bits/cycle for n = 16 amounts t

资源描述软件包括2个对话框，一个是服务端，一个是客户端，可以实现基于TCP或UDP的网络通信。扩展性强，可以将其文件拷贝到自己工程进行修改。

freescale公司的SPI总线规范，非常详细，研究串行总线的朋友值得一看-Freescale

这个是我调试的无线通信的例子，已经调试成功！和大家分享一下！！呵呵！希望大家喜欢-This is my debug example of wireless communication has been successful debugging! And everyone to share! ! Ha ha! I hope everyone likes