Distributed multi-join query processing in data grids

Query processing in data grids is a difficult issue due to the heterogeneous, unpredictable and volatile behaviors of the grid resources. Applying join operations on remote relations in data grids is a unique and interesting problem. However, to the best of our knowledge, little is done to date on multi-join query processing in data grids. An approach for processing multi-join queries is proposed in this paper. Firstly, a relation-reduction algorithm for reducing the sizes of operand relations is presented in order to minimize data transmission cost among grid nodes. Then, a method for scheduling computer nodes in data grids is devised to parallel process multi-join queries. Thirdly, an innovative method is developed to efficiently execute join operations in a pipeline fashion. Finally, a complete algorithm for processing multi-join queries is given. Analytical and experimental results show the effectiveness and efficiency of the proposed approach.     

3D model retrieval using principal plane analysis and dynamic programming

Three dimensional models play an important role in many applications; the problem is how to select the appropriate models from a 3D database rapidly and accurately. In recent years, a variety of shape representations, statistical methods, and geometric algorithms have been proposed for matching 3D shapes or models. In this paper, we propose a 3D shape representation scheme based on a combination of principal plane analysis and dynamic programming. The proposed 3D shape representation scheme consists of three steps. First, a 3D model is transformed into a 2D image by projecting the vertices of the model onto its principal plane. Second, the convex hall of the 2D shape of the model is further segmented into multiple disjoint triangles using dynamic programming. Finally, for each triangle, a projection score histogram and moments are extracted as the feature vectors for similarity searching. Experimental results showed the robustness of the proposed scheme, which resists translation, rotation, scaling, noise, and destructive attacks. The proposed 3D model retrieval method performs fairly well in retrieving models having similar characteristics from a database of 3D models.     

Proposed modification to the CIECAM02 colour appearance model to include the simultaneous contrast effects

A modified CIECAM02 colour appearance model, named CIECAM02‐m2, is proposed to enable CIECAM02 to predict the simultaneous contrast effect. The structure of the CIECAM02‐m2 is a development from CIECAM02, and contains two different procedures for modifying the reference white; one is for lightness and the other is for hue. The model was tested using a data set accumulated in this study and the LUTCHI data. The CV values for three colour attributes between predictions and experimental data were used to evaluate the accuracy of the model. The low CV values obtained show the performance of the CIECAM02‐m2 model to predict the simultaneous contrast effect satisfactorily. © 2007 Wiley Periodicals, Inc. Col Res Appl, 32, 121 – 129, 2007     

巡航导弹机动地形相关系统

研究了一种适用于巡航导弹辅助导航的机动地形相关系统(MTCS)。介绍了 MTCS的工作原理、相关定位算法以及提高定位概率的技术途径,指出了系统设计中的关键技术。另外还讨论了 MTCS 的计算机运算,研究结论对地形辅助系统的设计有参考价值。     

Finding approximate matches in large lexicons

Approximate string matching is used for spelling correction and personal name matching. In this paper we show how to use string matching techniques in conjunction with lexicon indexes to find approximate matches in a large lexicon. We test several lexicon indexing techniques, including n-grams and permuted lexicons, and several string matching techniques, including string similarity measures and phonetic coding. We propose methods for combining these techniques, and show experimentally that these combinations yield good retrieval effectiveness while keeping index size and retrieval time low. Our experiments also suggest that, in contrast to previous claims, phonetic codings are markedly inferior to string distance measures, which are demonstrated to be suitable for both spelling correction and personal name matching.     

基于柔性阵列传感器的脉象检测系统的设计

当前的脉象仪大部分采集手段单一,取脉压力的调节性差,无法模拟医生的布指方式,而且只能实现脉搏图的描记及分析,无法给出脉象的三维信息。针对这一问题研制了基于柔性阵列传感器的脉象检测系统,用硅胶制作了专门的脉搏换能器;设计了压力控制系统,实现压力自动调节,完成了对最佳取脉压力下脉象的采集;搭建了信号处理电路,实现了对脉象信号的提取和预处理;以USB-7660为核心构建了A/D采集系统,实现了对多路脉象信号的显示、存储。实验表明,该系统不仅可以有效采集到受试者的七路二维脉图,而且能清晰地观测到受试者的脉道宽度,并重建出相应脉搏波的三维传导地形图。     

波谱匹配支持的遥感专题地物自适应提取

为贴合地物表现的多样性和复杂性,提出一种波谱匹配支持下的遥感影像专题地物自适应提取方法,经过专题地物端元选取、波谱匹配、影像自动分割、"整体-局部"的空间转换,以及局部针对性、精细化地迭代逼近等一系列相互衔接的算法,全面、准确地提取遥感影像上的专题地物。通过在ETM+影像上水体和裸地的提取实验,并与最大似然法和SVM分类结果比较,证明了该方法对多样性专题地物提取的有效性和普适性。     

Google Map数字栅格地图算法及应用

Google地图是Google向全球提供的电子地图服务,包括丰富的地图和黄页资源,特别是局部详细的卫星地图。通过具体分析Google Map不同坐标系下的坐标转换、Web墨卡托投影方式、地图瓦片URL组织结构,系统地研究了Google地图的算法及实现,并在VS2008环境下用C#语言实现了任意缩放系数下指定地图类型URL的合成和对应图片的下载。文中列出了部分程序代码以帮助大家进行后续开发设计,更有效地将Google地图集成到应用系统中。实验证实,该方法能够快速准确地下载指定范围的地图。     

基于梯度值的自适应窗口立体图像匹配算法

针对基于区域的立体图像匹配算法支持窗口难以选择,容易出现窗口过大或过小的问题,提出一种新的自适应窗口立体图像匹配算法。该算法利用Sobel梯度算子计算像素梯度值,并根据其梯度值动态地获取具有自适应的支持窗口,然后分别选择相似性测度函数SAD或NCC搜索最佳匹配点,获得视差图。此外,算法在窗口选择过程中进行优化,减少了计算量。实验结果表明,改进后的算法提高了匹配正确率且计算时间缩短了近5%。     

基于神经网络的电子地图最优路径研究

现阶段电子地图的应用已经深入到各行各业,最优路径的查找及规划作为GIS的一个关键问题,成为研究的一个难点,本文提出一种基于Hopfield神经网络的方法来解决地图最优路径问题。以物流配送中的车辆路径最优化为例,先根据Hopfield神经网络模型研究基于Hopfield的最优路径算法,然后探讨和验证该算法的可行性、实用性,最后通过算例分析对该方法进行验证。