本程序是K条最短路算法测试程序,陈艳艳老师的K条路算法。程序求3条最短路，约束条件值可以设定,约束值越小，多路径共用路段越多。...

基于AO/AE的GIS功能原型。 并且给大家封装好了两个逻辑处理层的DLL，朋友们可以直接引用。是对AO/AE的又一次抽象，开发更加灵活。-based AO/AE prototype GIS functions. Packaging and good for everyone to the two logic layer DLL, and friends can be directly invoked. The AO/AE another abstract and develop more flexible.

MO开发GIS打印输出的应用实例。 MO开发GIS打印输出的应用实例。-MO development of GIS application printout. MO development of GIS application printout.

Private Sub Command1_Click(ByVal eventSender As System.Object, ByVal eventArgs As System.EventArgs) Handles Command1.Click Dim i, j As Short Dim xx, yy As Double "UPGRADE_ISSUE: PictureBox 方法 Picture1.Cls 未升级。 单击以获得更多信息:“ms-help://MS.VSCC.v90/dv_commoner/local/redirect.htm?keyword="CC4C7EC0-C903-48FC-ACCC-81861D12DA4A"” Picture1.Cls() "视窗变换 Dim slx, minX, maxX, maxY, minY, sly As Double

WINDOW GAME DEMO CODE

Delaunay三角网生成，利用离散点生成Delaunay三角网，交互式界面，直观-Delaunay triangulation to generate the use of discrete point generating Delaunay triangulation, interactive interface, intuitive

GPS控制网优化设计源码GPS控制网优化设计源码GPS控制网优化设计源码GPS控制网优化设计源码GPS控制网优化设计源码GPS控制网优化设计源码

ArcGIS基础教程，适合初学者使用，包括基本界面介绍、数据分析，建立专题地图，商业选址等等

利用Mapx进行图形与Access表的绑定，利用用到了Grid控件，是一个很典型的例子-Mapx use for graphics and Access Table bundled use of depleted Grid Control. is a typical example

求最短路径的算法-seek the shortest path algorithm

本文结合DCT变换的特性，利用分形的Peano一hilbert扫描曲线，对基于DCT变换的图像编码方法进行了研究，并提出了改进方法。主要工作分为两个部分: 一是在分块DCT基础上的改进。对分块后生成的各图像块矩阵，不直接作二维DCT变换，而是先进行扫描，使之重排成一维向量，再进行一维DCT变换，这样可以减少运算量。 其次是对层次余弦变换编码部分的改进。使用层次DCT变换与零树编码相结合的方法，并在扫描编码过程中，按Peano一hilbert扫描顺序进行编码。这样不仅可以减少“块效应”，而且可以加快编码速度。-this paper the characteristics of DCT, using fractal Peano a Hilbert scanning curve, the DCT-based image coding method for the study and improvement of methods. The work is divided into two main parts : First, the DCT block on the basis of improvements. Right after block production of the image block matrix, not for direct two-dimensional DCT, but first scan, so they line up in a heavy-dimensional vector and then a peacekeeping DCT, thus reducing the amount of computation. Secondly, the level of cosine transform coding some of the improvements. The use level of DCT and zero tree coding combination of methods, coding and scanning process, according to a Hilbert Peano code scanning sequence. This will not only reduce the "blocking