Decentralized tuple space is an ecrective paradigm for distributed collaborative applications since its loose decoupling, availability and °exibility in system's organization. However, there are very few research results on its replication and consistency. This paper presents a decentralized tuple space model to enable tuple update by creating loose update links among decentralized Tuple space nodes. Besides, tuples are grouped with tuple types, the unit of being applied a replication policy, which con-trols the distribution of replicas. The model is simulated by Desmo-J. The experiments show that applying dicrer-entiate replication policies used for dicrerent purposes is absolutely necessary, because no single policy is suitable under all use patterns.

In this paper, Particle Swarm Optimization (PSO) algorithm, a new promising evolutionary algorithm, is proposed to train Radial Basis Function (RBF) network related to automatic configuration of network architecture. Classification tasks on data sets: Iris, Wine, Newthyroid, and Glass are conducted to measure the performance of neural networks. Compared with a standard RBF training algorithm in Matlab neural network toolbox, PSO achieves more rational architecture for RBF networks. The resulting networks hence obtain strong generalization abilities.

In this paper, we present a novel Support Vector Machine active learning algorithm for effective 3D model retrieval using the concept of relevance feedback. The proposed method learns from the most informative objects which are marked by the user, and then creates a boundary separating the relevant models from irrelevant ones. What it needs is only a small number of 3D models labelled by the user. It can grasp the user’s semantic knowledge rapidly and accurately. Experimental results showed that the proposed algorithm significantly improves the retrieval effectiveness. Compared with four state-of-the-art query refinement schemes for 3D model retrieval, it provides superior retrieval performance after no more than two rounds of relevance feedback.

Due to the widely application of 3D models, the techniques of content-based 3D shape retrieval become necessary. In this paper, a modified Principal Component Analysis (PCA) method for model normalization is introduced at first, and each model is projected in 6 different viewpoints. Secondly, a new adjacent angle distance Fouriers (AADF) descriptor is presented, which captures more precise contour feature of black-white images. Finally, based on modified PCA method, a novel composite 3D shape descriptor MADE is proposed by concatenating AADF, Tchebichef and D-buffer descriptors. Experimental results on the criterion of 3D model database PSB show that the proposed descriptor MADE has gained the best retrieval effectiveness compared with three single descriptors and two composite descriptors LFD and DESIRE.

A new framework of region-based dynamic image fusion is proposed. First, the technique of target detection is applied to dynamic images (image sequences) to segment images into different targets and background regions. Then different fusion rules are employed in different regions so that the target information is preserved as much as possible. In addition, steerable non-separable wavelet frame transform is used in the process of multi-resolution analysis, so the system achieves favorable characters of orientation and invariant shift. Compared with other image fusion methods, experimental results showed that the proposed method has better capabilities of target recognition and preserves clear background information.

Since 3D models have been widely applied in many research areas, the techniques for content-based 3D model retrieval become necessary. In this paper, a novel visual based 3D shape descriptor called MATE is proposed. A modi-ed Principal component analysis (PCA) method for model normalization is presented at-rst. Sec-ondly, a new Adjacent angle distance Fourier (AADF) al-gorithm is proposed. Then the original two-viewed Dbucrer method is presented to extract characteristics of projected images. Finally, based on the modi-ed PCA method, the shape descriptor MATE is proposed by combining AADF, Tchebichef and two-viewed Dbu®er. Experimental results show that the descriptor MATE provides better retrieval performance than the best current descriptors.

As the need for personalized services sharply increases caused by the booming of Internet, Web-based data-mining is becoming a valuable sources of thoughts and theory to satisfy the personalized system function. The characters of personalized data-mining is reviewed and discussed in the beginning, and then an innovative algorithm (FP-Tree time-validity algorithm) of Web pageviews, based on personalization, is raised. More authentic information can be efficiently got by adding time-validity coefficient to FTT-Tree storage structure to implement increment mining.

针对存在配准偏差的双平台无源融合跟踪系统，提出了基于扩维Unscented 卡尔曼滤波的配准跟踪一体化方法，在跟踪算法中，采用模糊调度方法调节“当前”统计模型参数，引入渐消因子，能够在状态发生突变时，迅速调整系统参数，提高了系统的抗机动目标自适应能力。仿真结果表明，这种跟踪算法能够较好地解决双平台无源融合跟踪系统中的配准偏差问题。

In this study, an unscented particle filtering method based on an interacting multiple model (IMM) frame for a Markovian switching system is presented. The method integrates the multiple model (MM) filter with an unscented particle filter (UPF) by an interaction step at the beginning. The framework (interaction/mixing, filtering, and combination) is similar to that in a standard IMM filter, but an UPF is adopted in each model. Therefore, the filtering performance and degeneracy phenomenon of particles are improved. The filtering method addresses nonlinear and/or non-Gaussian tracking problems. Simulation results show that the method has better tracking performance compared with the standard IMM-type filter and IMM particle filter.

This paper proposes a general formalism for evaluating hybrid Bayesian networks. The formalism approximates a hybrid Bayesian network into the form, called fuzzy partial least-squares Bayesian network (FPBN). The form replaces each continuous variable whose descendants include discrete variables by a partner discrete variable and adding a directed link from that partner discrete variable to the continuous one. The partner discrete variable is acquired by the discretization of the original continuous variable with a fuzzification algorithm based on the structure adaptive-tuning neural network model. In addition, the dependence between the partner discrete variable and the original continuous variable is approximated by fuzzy sets, and the dependence between a continuous variable and its continuous and discrete parents is approximated by a conditional Gaussian regression (CGR) distribution in which partial least-squares (PLS) is proposed as an alternative method for computing the vector of regression parameter. The experimental results are included to demonstrate the performances of the new approach.