reader laber

： 为了用蚁群算法来解决连续优化问题， 该算法将函数优化问题中生成解的过程转化为蚁群每前进一步就 选择一个十进制数字并以此来生成一个十进制串的过程。-: Using ant colony algorithm for continuous optimization problem to solve, the problem of function optimization algorithm will be generated in the process of solution into each and every step on the ant to select a decimal figure and in order to generate a string of decimal process.

站的高看的远 多思考人脑与计算机的不同点与相同点 对于自身也有更多认识-Look at the high points far to think more about the human brain and computer different points with the same points are also more aware of their own

IEEE 802.16一致性03-2004 IEEE标准符合IEEE标准802.16第3部分：10-66 GHz WirelessMAN SC的无线电一致性试验（RCT）

SSD1 all materials, is learning courses SSD1 a good helper.

源码公开的TCP/IP 协议栈在远程监测中的应用。介绍一个适用于8/16 位单片机的嵌入式TCP/IP 协议栈（uIP ） 在发电机远程监测系统中的应用。 重点阐述u I P 的功能特性、体系结构和相关接口，并详细介绍如何在该协议栈上实现一个嵌入式 Web 服务器。目前uIP 已成功地移植到51 单片机上-Open-source TCP/IP protocol stack in the remote monitoring application. To introduce one for 8/16-bit single-chip embedded TCP/IP protocol stack (uIP) in the remote monitoring of generator systems. U IP focuses on the functional characteristics, architecture and related interfaces, and details on how the protocol stack to achieve a built-in Web server. UIP currently have been successfully transplanted into 51 single-chip on

BillboardDemo基于VS.net和DX9的广告版程序实例，对利用DX 3D图形与动画程序设计有很大帮助-BillboardDemo based on VS.net and DX9 version of the advertisement instance, the use of DX 3D graphics and animation program has greatly help

很多关于学习c语言的各种例子，由简单步步深入-c program

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

本书从实质上、专业上讲解UNIX操作系统，深刻地剖析了UNIX系统的基本概念。内容包括UNIX的基本特性及高级性能，例如shell配置、目录管理、shell编程，编辑器的使用方法等。本书条理清晰、重点突出，为快速了解与掌握UNIX操作系统提供了极有价值的参考。-The book in essence, a professional on the UNIX operating system, a profound analysis of the basic concepts of UNIX system. Includes the basic characteristics of UNIX and high-level performance, such as the shell configuration, directory management, shell programming, editor, such as the use of methods. The clarity of this book, focused, in order to quickly understand and grasp the UNIX operating system provides a very valuable reference.

Visual C++ 21天自学教程第1部分-Visual C++ 21 days self-study tutorial Part 1