访问数据的COM组件，主要在VC中使用

改进后的算法大大减少了对于那些运动矢量为零的块的搜索冗余，同时对于运动比较剧烈的块直接进入大范围搜索。这样即提高了搜索效率，又不会使搜索结果陷入局部最优。-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.

队列,1、 掌握队列的顺序存储结构和“假溢出”的处理方法 2、 设计用标志位解决“假溢出”问题的顺序队列 -cohort, 1, the master queue storage structure and sequence "false spillover" of the two treatment methods. Design signs spaces, "false spillover" in the order queue

非常不错的仓库管理源代码，VFP语言编制，功能齐全，小巧精悍！-Very good warehouse management source code, VFP language, full-featured, compact lean!

This program demonstrates how to do disconnected briefcase applications with ADO. When the Connected checkbox is unchecked the application is switched into offline mode. If the application is exited at that point then the data is persisted to a file on disk (along with any edits to the data). When the application is restarted it will load the persisted data if present, otherwise it will fetch the data from the database.

本人上传的是用分治法实现的大整数算法，采用的是数组形式。-I uploaded is to use divide and conquer to achieve a large integer arithmetic, using the array form.

查询资料的表单文件-check the information paper form

很短的表达式求值，利用了编译原理里面的只是构建的-A very short version of expression of evaluation, be builted using the principle of the compiler.

建立并按前,中,后序方法遍历二叉树,本代码用的是非递归方法,递归方法的稍后给出-established as before, during and after the binary tree traversal sequence method, the code of non- recursive method, recursive method is later

一个焦化厂的电子称过秤软件，小巧实用，有需要修改的地方，不过已经能够胜任基本工作了。-A coking plant, said electronic weighing software, compact and practical, there is need to modify the areas, but the basic work has been capable of.

求图的任两结点间的距离，(2) 用二维数组存放C和A ，C是原成本矩阵，A 是求出的距离矩阵 (3) 算法采用三重循环，其中最外层的循环变量必须代表中间结点，中层的循环变量代表头结点而内层循环变量代表尾结点。 (4) 试着把三层循环变量的顺序作些改变，最外层的循环变量仍代表中间结点，而中层循环变量代表尾结点，内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同 (5) 显示结果要清晰易懂 (6) 本题运行结果 -Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The q