a good basis for the ASP Directory entry to the proficient

二维、非结构网格、有限体积法求解浅水方程代码，带算例。不可多得的源代码。

使用IC卡的饮水机发卡系统软件程序,提供有兴趣了解的人参考.-use of IC card issuers fountains in the system, and a software program to provide interested persons reference.

冈萨雷斯数字图像处理MATLAB版,中文版PDF格式-Gonzalez Digital Image Processing MATLAB version, the Chinese version PDF format

VISUAL C++MFC编程实例-MFC Visual C Programming Example

该程序由C++编写，在winTC及Visual C++上均可编译运行，可以实现银行家算法并给出了安全序列-The program by the C++ Prepared in winTC and Visual C++ Compiler can be run on, you can realize banker

华为内部资料,EMC电磁兼容问题的设计，可以做硬件参考-Huawei internal information, EMC electromagnetic compatibility issues designed to make hardware reference

用堆栈实现迷宫求解问题 基本思想: 若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小:M*N.迷宫设置自定义。 求解迷宫问题的简单方法是：从入口出发，沿某一方向进行探索，若能走通，则继续向前走；否则沿原路返回，换一方向再进行探索，直到所有可能的通路都探索到为止。 为避免走回到已经进入的点（包括已在当前路径上的点和曾经在当前路径上的点），凡是进入过的点都应做上记号。-Maze with the stack to achieve the basic idea for solving the problem: If the current position can be adopted, in pressure, otherwise the next location to explore, if a dead end, then back to New Moon, the size of the maze: M* N. maze set up a custom. A simple maze to solve the problem is: starting from the entrance, along a certain direction to explore, can walk, then continue to move forward otherwise return along the same route, a direction for further exploration, until all possible pathways are exploring to date. In order to avoid going back to have access points (including the current path and current path in the point), all the points should be entered mark.

掌握access开发- Grasps access to develop

J2EE 权威指南-J2EE authoritative guide

Mastering VBNet Include Source Code