Multidimensional-unified topological relations computation: a hierarchical geometric algebra-based approach

This article presents a geometric algebra-based model for topological relation computation. This computational model is composed of three major components: the Grassmann structure preserving hierarchical multivector-tree representation (MVTree), multidimensional unified operators for intersection relation computation, and the judgement rules for assembling the intersections into topological relations. With this model, the intersection relations between the different dimensional objects (nodes at different levels) are computed using the Tree Meet operator. The meet operation between two arbitrary objects is accomplished by transforming the computation into the meet product between each pair of MVTree nodes, which produces a series of intersection relations in the form of MVTree. This intersection tree is then processed through a set of judgement rules to determine the topological relations between two objects in the hierarchy. Case studies of topological relations between two triangles in 3D space are employed to illustrate the model. The results show that with the new model, the topological relations can be computed in a simple way without referring to dimension. This dimensionless way of computing topological relations from geographic data is significant given the increased dimensionality of geographic information in the digital era.     

回归直线的拟合度

采用模糊数学的方法研究回归直线与实测点的拟合度，提出回归直线的似合度，给出计算回归直线拟合度的方法。     

快速数论变换的一种算法

本文构造了一种快速数论变换算法,该算法是一种以数论为基础,有效高速的数论变换算法,并且这种算法易于在计算机上实现。     

基于线段的基本线/线拓扑关系计算

空间拓扑关系是空间数据建模、空间查询、分析、推理、制图综合、数据质量控制、数据更新等的基础。目前空间拓扑关系研究的主要成果仍然集中在拓扑关系的描述方面,在计算方面的阐述都非常薄弱,不足以指导系统开发人员编程实现。本文研究了IR2中两个简单线目标间拓扑关系的计算方法,重点分析了线/线拓扑关系计算的特点,提出了一种基于线段的线/线拓扑关系计算方法,并用VC＋＋采用底层开发模式实现了基本线/线拓扑关系的计算。     

VLBI相位校正信号提取的软件实现方法

从VLBI相关处理结果中提取的延迟值包括了天线、终端等设备的时延,必须对其加以修正,最终结果才能达到精度要求。提取相位校正信号,可以消除这些设备引入的时延,从而校正同一波前信号到达基线两端的几何时延。该文介绍了提取相位校正信号的原理、算法及软件实现方法。软件采用多线程和SSE技术,具备4台站多通道全部相位校正信号提取能力。     

移动Agent 在集群系统中的应用研究

从任务级的角度，在基于主／从模式的集群系统中引入了移动Agent技术，建立了基于移动Agent的并行计算模型。基于该模型，对移动Agent之间的通信接口、容错机制和负载平衡策略等问题进行了研究。     

On the sensitivity of computed surges to open-boundary formulation

A coarse-grid (resolution of order 7 km) model of the west coast of Britain is used to examine the sensitivity of computed storm-surge elevations and currents to a range of open-boundary conditions. The storm-surge period 1 to 26 March 1994 is used for this comparison, as it is a time of significant wind activity. Also current measurements in the North Channel of the Irish Sea together with coastal elevation measurements are available for model validation. Elevations and currents previously computed with a coarse-grid shelf-wide model can also be incorporated into the open-boundary condition to examine the influence of far-field effects. Initial model calculations with no far-field input show the importance of including shelf-wide effects from either the external shelf model, or by using observations from coastal gauges interpolated along the open boundary of the west-coast model. Provided the west-coast models open boundary is taken sufficiently far away from the region of interest, in this case the Irish Sea, then either a radiation condition or an elevation-specified condition is appropriate provided far-field effects are taken into account. If these are not included, then neither boundary condition is successful. For the radiation condition it is necessary to include both elevations and currents from a far-field model in order to reproduce the surge. In the case of an elevation-specified boundary condition far-field effects can be incorporated in hindcast calculations by including observed sea-level changes. In a storm-surge prediction calculation the radiation condition with a far-field model is required. Calculations show that computed elevations are spatially more coherent than currents, with flows through the western Irish Sea showing the greatest sensitivity to open-boundary formulation during storm events.Responsible Editor: Phil Dyke     

求解半变异函数的常用方法与新方法研究

半变异函数的获取既有人为主观求取法,又有运用数学工具客观求取法,但是后者是今后的主要趋势。笔者在前人工作的基础上,归纳出多项式回归法、线性规划法和目标规划法三种求解半变异函数的成熟方法,以及非线性回归理论直接求解法、进化计算和积分面积三种新兴方法,并总结出各种方法的优缺点。最后概括出计算权重的两种方法。     

多视密集匹配并行传播GPU-PatchMatch算法

针对多视密集匹配的效率较低的问题,提出了GPU-PatchMatch多视密集匹配算法。该算法使用GPU提高PatchMatch的计算效率;同时充分利用稀疏场景信息,对深度信息进行规则初始化;为提高传播效率,使用了金字塔红黑板并行传播深度信息。最后在DTU、Strecha和Vaihigen数据集上进行了试验,并与常用的多视密集匹配算法进行对比。试验结果表明,本文算法在重建效率上有较大提高,与CPU算法(PMVS、MVE、OpenMVS)相比有7倍以上提升,与GPU算法相比也有2.5倍以上提升,表明本文算法的有效性。