将固定大小的位图在窗口平铺

一个采用B-树数据结构制作的图书馆管理程序，功能较简单，适合大学生数据结构参考使用-use a B-tree data structures produced by the library management procedures and functions than simple data structure suitable for college students to use reference

QT 256M NANDFlASH支持的测试代码ADs1.2！

以下是本系统静态页面的实现过程。在信息发布管输入信息后，提交到一个保存页面的ASP文件，由此文件静态页面。该文件的主要代码如下 生成 html 文件的函数，建立以系统时间命名，后缀“.shtml”的文件。-These are the static pages of the system implementation process. In the information dissemination management input information, save the page to submit to an ASP file, this file static pages. The main source of the document is as follows generated html file function system time to establish a name suffix ". Shtml" files.

利用NetBOIS进行编程，此程序主要目的是让大家通过源代码使大家对NetBOIS编程有一定的了解-use NetBOIS program, the main purpose of this program is to let people through the source code so that people with certain programming NetBOIS understanding

win8平板很牛叉的调用摄像头的库，通过.net调用COM库实现的，之前通过avicap.dll库，SendMessage方式都行不通的方式用这种方式能成功。 namespace AForge.Controls {     using AForge.Video;     using System;     using System.ComponentModel;     using System.Drawing;     using System.Runtime.CompilerServices;     using System.Windows.Forms;         public class VideoSourcePlayer : Control     {         private bool autosize;         private Color borderColor = Color.Black;         private IContainer components;         private Bitmap currentFrame;         private bool firstFrameNotProcessed = true;    

高效率的C++编程经验，作者历时1年的经验总结。-The most popular methed.

OAD升级方面的代码，需要的人可以拿去研究一下

程序源代码 遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法，适用于解决传统方法难以解决的复杂的、非线性问题，可广泛应用于组合优化、离散优化、工程优化等领域。旅行商问题是一种NP难的组合优化问题，具有重要的理论研究价值和实际应用背景。然而，传统遗传算法中存在有不足，需要提出新的改进的遗传算法，并应用于旅行商问题的求解。-Genetic algorithm source code is based on Darwin" s theory of evolution of an intelligent optimization algorithm, a complex system can be used to optimize the robustness of the search algorithm, the application of traditional methods to solve difficult and complex, nonlinear problems, can be widely used in combinatorial optimization, discrete optimization, engineering, optimization and other fields. Traveling Salesman Problem is a NP hard combinatorial optimization problem, has important theoretical value and practical application of research background. However, the traditional genetic algorithm, there is less than the need to introduce new improved genetic algorithm, and applied for solving the traveling salesman problem.

3G 比较全面的map信令流程，详细分解描述了各种流程。对于学习MAP协议很好。-3G signal a more comprehensive map of the flow, a detailed description of a variety of flow decomposition. Study well for the MAP protocol.

背包问题，背包问题的5种算法，一共五个文件，每个文件一种算法-Knapsack problem, knapsack problem of the five kinds of algorithms, a total of five files, each file an algorithm