Genetic algorithms for symbolic clustering

This paper introduces a novel methodology for clustering of symbolic objects by making use of Genetic Algorithms (GAs). GAs are a family of computational models inspired by evolution. These algorithms encode potential solutions to specific problems on simple chromosome-like data structures and apply recombination operators to these structures so as to preserve critical information. A new type of representation for chromosome structure is presented here along with a new method for mutation. The efficacy of the proposed method is examined by application to numeric data of known number of classes and also to assertion type of symbolic objects drawn from the domain of fat oil, microcomputers, microprocessors and botany. The validity of the clusters obtained is examined.     

紧凑式换热面瞬态实验中的全程直接配比法

在紧凑式换热面的瞬态实验中，为获得准确的实验结果，不仅要建立符合试验工况的理 论解，而且还要选择合适的配比方法，以便尽可能减小测量误差对配比结果的影响．本文就瞬态实 验的配比，提出了一种新的基于计算机的全程直接配比法，由于它采用了所有可用测试点进行配 比并且其理论解与实测值的配比误差是通过最小搜索步长来控制的，因此，实验结果的准确性和 可靠性优于通常应用的间接配比法和选点配比法．     

Lubricating behavior of iron rhenate and its relation to matching pairs

The iron rhenate was compounded by chemical method, which may be generated during wear process of Fe-Re alloys at elevated temperature. The friction coefficient of iron rhenate has been determined by a pin-on-disc device. The results show that iron rhenate plays role of lubricating at RT-600 °C. The lubricating behavior is related to the matching pairs. The hardness of the materials of matching pairs, compatibility of iron rhenate with materials of matching pairs and surface roughness of disc affect the lubricating behavior of iron rhenate mostly. The principle of matching pairs is proposed. Project supported by the National Natural Science Foundation of China Synopsis of the first author Xiong Dangsheng. associated professor, born in 1960. Current research fields include high-temperature self-lubricating alloys and tribological properties of material.     

A region-based selective optical flow back-projection for genuine motion vector estimation

Motion vector plays one significant feature in moving object segmentation. However, the motion vector in this application is required to represent the actual motion displacement, rather than regions of visually significant similarity. In this paper, region-based selective optical flow back-projection (RSOFB) which back-projects optical flows in a region to restore the region's motion vector from gradient-based optical flows, is proposed to obtain genuine motion displacement. The back-projection is performed based on minimizing the projection mean square errors of the motion vector on gradient directions. As optical flows of various magnitudes and directions provide various degrees of reliability in the genuine motion restoration, the optical flows to be used in the RSOFB are optimally selected based on their sensitivity to noises and their tendency in causing motion estimation errors. In this paper a deterministic solution is also derived for performing the minimization and obtaining the genuine motion magnitude and motion direction.     

Volumetric three‐dimensional up‐conversion display medium

Abstract— Several rare‐earth‐doped fluoride crystals that are excited to emit visible light by sequential two‐photon absorption have been investigated as display‐medium candidates for static volumetric three‐dimensional displays. Dispersion of powders of these materials in a refractive‐index‐matched polymer is reported because such a medium may result in a scalable display. The scattering problem in such a medium is greatly reduced by index‐matching the polymer to the crystalline particles. An index‐matching condition that optimizes the performance is identified.     

High‐error approximate dictionary search using estimate hash comparisons

A method for finding all matches in a pre‐processed dictionary for a query string q and with at most k differences is presented. A very fast constant‐time estimate using hashes is presented. A tree structure is used to minimize the number of estimates made. Practical tests are performed, showing that the estimate can filter out 99% of the full comparisons for 40% error rates and dictionaries of up to four million words. The tree is found to be efficient up to a 50% error rate. Copyright © 2006 John Wiley & Sons, Ltd.     

A novel document similarity measure based on earth mover’s distance

In this paper we propose a novel measure based on the earth mover’s distance (EMD) to evaluate document similarity by allowing many-to-many matching between subtopics. First, each document is decomposed into a set of subtopics, and then the EMD is employed to evaluate the similarity between two sets of subtopics for two documents by solving the transportation problem. The proposed measure is an improvement of the previous OM-based measure, which allows only one-to-one matching between subtopics. Experiments have been performed on the TDT3 dataset to evaluate existing similarity measures and the results show that the EMD-based measure outperforms the optimal matching (OM) based measure and all other measures. In addition to the TextTiling algorithm, the sentence clustering algorithm is adopted for document decomposition, and the experimental results show that the proposed EMD-based measure does not rely on the document decomposition algorithm and thus it is more robust than the OM-based measure.     

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.