最小二乘逼近（最小

网络优化算法：任两点间最短路径问题的BellmanFord算法-Network optimization algorithms: the shortest path between any two points BellmanFord algorithm issues

存储虚拟化是指将用户看到的存储资源同具体的物理存储设备分隔开来，为存储用户提供统一的虚拟存储池。它是具体存储设备或存储系统的抽象，展示给用户一个逻辑视图，同时将应用程序和用户所需要的数据存储操作和具体的存储控制分离。

一个用来储存资料的数据库用C++builder 与jet 4.0编写-used to store a database with information on the C jet builder with 4.0 preparation

数据结构：有关树所有操作- Construction of data: The related tree all operates

最小生成树的贪心算法实现 普里姆算法 用邻接矩阵进行图的生成-the minimum spanning tree algorithm Primbetov greedy algorithm adjacent matrix chart generation

取数据库内容到字符串，可用于显示-from database content to string can be used to show!

数据结构基本算法设计 用C++实现一个计算器,计算器需具有基本的功能-basic algorithm data structure design to achieve a C calculator, calculator should have the basic functions

使用VC编写的二叉树程序，简单明了，方便使用-Written in binary tree using the VC program, simple and clear, easy to use

以visual studio 2005为开发环境的约瑟夫环设计。-Environment: visual studio 2005

SR-tree is an index structure for high-dimensional nearest neighbor queries，C++ sourcecode. SR-tree outperforms the R*-tree and the SS-tree especially for high-dimensional and non-uniform data which are likely to appear in the actual image / video applications.-SR-tree is an index structure for high-dimensional nearest neighbor queries,C++ sourcecode. SR-tree outperforms the R*-tree and the SS-tree especially for high-dimensional and non-uniform data which are likely to appear in the actual image/video applications.