data algorithm, Xiao Ming books

数据结构算法，aoe ，图的最小代价路径检索。-data structure algorithms, aoe, for the minimal cost path retrieval.

本程序用邻接矩阵实现图的深度优先遍历 图的广度优先遍历-the procedures used adjacency matrix of the plan is to achieve depth-first traversal of the plan breadth priority Ergodic

使用windowsapi，包括如何控制菜单的显示和隐藏菜单项

Informix SQL教程指南 V9.4，Informix中如何使用SQL-Informix SQL Tutorial Guide V9.4, Informix in how to use SQL

稀疏矩阵的十字链表算法-sparse matrix algorithm Cross Chain

一个新的学籍管理系统-a new Academic Information Management System

本系统采用Visual Foxprow 5.0编写,面向对象可视化编程,使系统的开发工作适应目前的流行趋势。设计时采用了常用的自顶向下的瀑布式结构化设计方法。各子系统具有独立的数据库结构，设计时力求简单易用，便于维护。各模块为平行关系，彼此间无直接的参数联系，也无库的交叉关联，从而保证各子系统可以单独运行。-the system using Visual Foxprow 5.0 preparation, visual, object-oriented programming, allowing the system to adapt to the current development trend in fashion. Used in the design of the popular top-down waterfall structure design method. The subsystem is independent of the database structure, design sought to be simple to use, easy to maintain. Each module for parallel relationship between the parameters are not directly linked, nor for the cross-linked, so that the subsystems can be run separately.

一元多项式乘法　包含密运算　 新学数据结构的可以参考参考　-One dollar secret polynomial multiplication operations include the new data structure can refer to reference

1.数据库文件名：spkc(位置：商品库存管理系统源程序文件spkc.mdb) 2.数据库类型：Access 3.连接方式：ADO 4.用户名：mrkj 5.密码：111dataspxxglxt_Log.LDF文件) 2.数据库类型：SQL Server 3.连接方式：ADO 4.用户名：mrkj 5.密码：-1. Database File Name : spkc (location : merchandise inventory management system source files spkc.mdb) 2. Database types : Access 3. Connectors : ADO 4. Username : mrkj 5. Password : 111 data spxxglxt_Log.LDF) 2. Database types : SQL Server 3. Connectors : ADO 4. Username : mrkj 5. Password :

改进后的算法大大减少了对于那些运动矢量为零的块的搜索冗余，同时对于运动比较剧烈的块直接进入大范围搜索。这样即提高了搜索效率，又不会使搜索结果陷入局部最优。-improved algorithm greatly reduced for those zero motion vector search block redundancy, Meanwhile, more intense campaign of direct access to block large-scale search. That would improve the efficiency of search, the search results will not find the global optimum.