Table of Content

01 September 2007, Volume 27 Issue 9

Previous Issue    Next Issue

Digital media technology

Review of non-intrusive interaction based on camera

Wei-dong Geng

2007, 27(9):  2087-2090. 

Asbtract ( )   PDF (937KB) ( )  

Related Articles | Metrics

Camera can catch the information naturally expressed by people such as eye movements, expression, gesture and motion. For users, communicating with computers by camera is efficient and natural. It can provide a convenient addition to user-computer dialogues and reduce the obstacle to use computer. The article summarized the key problems of non-intrusive interaction based on camera and introduced the corresponding resolutions, then analyzed the limitations of the methods and challenges.

Block independent component analysis for face recognition

2007, 27(9):  2091-2094. 

Asbtract ( )   PDF (842KB) ( )  

Related Articles | Metrics

This paper presented a subspace algorithm called Block Independent Component Analysis (B-ICA) for face recognition. Unlike the traditional ICA, in which the whole face image is transformed into a vector before calculating the independent components (ICs), B-ICA partitions the facial images into blocks and stretches the block to a vector, which is taken as the training vector. Since the dimensionality of the training vector in B-ICA is much smaller than that in traditional ICA, it can reduce the face recognition error caused by the dilemma in ICA, i.e. the number of available training samples is greatly less than that of the dimension of training vector. Extensive experiments are performed on the well-known Yale and AR databases to validate the proposed method and the experimental results show that the B-ICA achieves higher recognition accuracy than ICA and other existing subspace methods.

Real-time rendering of 3D large-scale scene based on improved quadtree algorithm

Wang-Gen Wan Jun-Wei Zhou Jing-Jou Tang

2007, 27(9):  2095-2096. 

Asbtract ( )   PDF (909KB) ( )  

Related Articles | Metrics

The storage, look-up and view frustum culling of nodes in 3D scene are the key problems which effect the rendering efficiency in large scale scene. The paper introduces an improved quatree algorithm to store and look up nodes and proposes an iterative algorithm in place of recursion algorithm. And we implement the radial detection and view frustum culling based on this algorithm. The experimental results show that FPS is increased a lot in this way. The algorithm features in hiberarchy in itself and sequence in coding, which avoids large computation in view frustum culling algorithm.

Construction art of M-J chaos-fractal spectrum — fractal-chaos technique applied in digital media

Zhi-liang Zhu Hai Yu Shu-ping Li Ao-shuang Dong Wei-yong Zhu Fan Min

2007, 27(9):  2097-2100. 

Asbtract ( )   PDF (1117KB) ( )  

Related Articles | Metrics

The paper defined fractal art based on the essential theory of fractal-chaos, expressed structural means of fractal figures in line with its track and distribution, and made use of these methods to construct a series of M-J fractal-chaos figures, showing the beautiful fine structure of the fractal set. The paper provided a definitely new view and an application base for applying fractal-chaos theory and technique in the area of digital media.

Application of Cult3D technique in interactive 3D inner ear microanatomy

Jim X Chen Pei-dong Dai Qi Xing Tian-yu Zhang Zheng-min Wang

2007, 27(9):  2101-2102. 

Asbtract ( )   PDF (555KB) ( )  

Related Articles | Metrics

We presented our work on constructing an interactive virtual inner ear surgery simulation system. The work was based on exploiting Cult3D's Designer functionalities to integrate multiple activities and objects in an inner ear. The system achieves inner ear virtual surgery and browsing with magnification.

Graphics and image processing

Novel image registration method based on wavelet transform

TANG Bin-Bing 唐斌兵

2007, 27(9):  2103-2105. 

Asbtract ( )   PDF (801KB) ( )  

Related Articles | Metrics

Image registration is one of the crucial steps in the fusion processing of image. Image registration, especially for remote sensing image, requires intensive computational efforts while the registration precision is not satisfying generally. This paper introduces a novel image registration method based on the wavelet with excellent performance. The method reduces the data to search via decomposing the image to several effectual subimages by the wavelet, then reduces the searching space through multi-resolution analysis, and refine the solution using an iterative refinement algorithm finally. Experimental results of remote sensing and optical images show that the proposed algorithm outperforms conventional approaches in terms of both computational effort and precision.

Stereo pairs creation

Jun YANG JiCheng WANG Ran LIU

2007, 27(9):  2106-2109. 

Asbtract ( )   PDF (711KB) ( )  

Related Articles | Metrics

Stereo pair acquisition of a scene is the key to binocular stereo imaging. This paper presented a stereo pair creation method when 3D models were constructed. Using camera objects in 3DS MAX, the method started from a coordinate transformation of objects in the scene based on principle of binocular stereo vision. Then the method carried out the perspective transformation to create left image and right image respectively. The results of the experiment indicate the position of the two target cameras and the 3D model, together with the length of the base line is the key factor that affects the stereo effect. Changing the position of the target cameras and the 3D model may result in positive disparity or negative disparity stereo pairs. When the aspect ratio of AB to CO equals 0.05, the stereo effect of the stereo pairs created is better.

Study on lossless hyper-spectral image compression algorithm based on subsection invertible matrix transform to eliminate spectral redundancy

Xie Cheng-Jun

2007, 27(9):  2110-2113. 

Asbtract ( )   PDF (915KB) ( )  

Related Articles | Metrics

This paper presented a new algorithm based on subsection invertible matrix transform to eliminate spectral redundancy, and 2D-CDF (2, 2) DWT was used together to eliminate spatial redundancy. Its redundancy elimination effect is better than that of 3D-CDF (2, 2) DWT. The experimental results show that in lossless image compression applications the method is much better than JPEG-LS, WinZip, ARJ, DPCM, the research result of a research team of Chinese Academy of Sciences, NMST and MST. Using Canal test images of JPL laboratory as an example data set, on the average the compression ratio using this algorithm increases by 43%, 38%, 36%, 31%, 17%, 13%, and 10% respectively compared to the above algorithms. The algorithm presented in this paper has advantages in computing efficiency and hardware realization convenience.

Image inpainting and denoising technique in single-channel dual-spectrum night vision system

2007, 27(9):  2114-2116. 

Asbtract ( )   PDF (916KB) ( )  

Related Articles | Metrics

Based on the image inpainting need of single-channel dual-spectrum night vision system, an image inpainting and denoising technique based on the levelset was proposed. The levelset inpainting algorithm with high speed was designed by simply illuminating the working theory of single-channel dual-spectrum night vision system, its real time need and characteristics of waiting inpainting low light level stripe images. Considering the effect of noise on inpainting results, the method of heat conduction filtering was added to inpainting process. Experiments and results analysis have shown that low light level stripe images can be inpainted and denoised effectively by using the image inpainting and denoising algorithm based on levelset real-time.

Wavelet denoising based on multistage median filtering

2007, 27(9):  2117-2119. 

Asbtract ( )   PDF (885KB) ( )  

Related Articles | Metrics

In traditional image denoising methods, multistage median filter can preserve the details effectively. Recently, the wavelet transform has been used for image denoising. Then to combine the good qualities of them, an improved way based on the multistage median filter was proposed and it can differentiate the flat and edge regions to protect the details and smooth the noise. Experimental results show that the proposed algorithm can get better denoising result than the soft thresholding proposed by Donoho.

Computation of radar cross section in high frequency region for SAR imaging simulation of ship targets

SUN Yu-Kang WANG Run-Sheng LIU Fang QI Bin

2007, 27(9):  2120-2122. 

Asbtract ( )   PDF (710KB) ( )  

Related Articles | Metrics

To compute Radar Cross Section (RCS) in high frequency region, a method that combined with fast modeling and improved graphic electromagnetic computing was presented. Using the collecting information of ship and the modeling software, the figure of the ship was modeled accurately, the radar cross section was computed exactly by improved graphic electromagnetic computing algorithms integrated Physical Optics (PO) method and Incremental Length Diffraction Coefficients (ILDC) method, simulation experiment shows that it can get a good simulation result of SAR images by this nearly real-time method.

Method of target recognition in remote sensing images based on parallel processing

2007, 27(9):  2123-2125. 

Asbtract ( )   PDF (548KB) ( )  

Related Articles | Metrics

In order to improve remote sensing image recognition rate and reduce time consumption, a particular parallel processing method of remote sensing image recognition has been presented. With this method, only small changes are needed to make the serial recognition algorithm parallel processing and there is no need to design particular parallel processing algorithms. The time-consuming problem of objects recognition on remote sensing image is solved through relatively low cost.

HLODs for fast rendering of large-scale environments

2007, 27(9):  2126-2128. 

Asbtract ( )   PDF (639KB) ( )  

Related Articles | Metrics

Discuss an algorithm based on view-dependent Hierarchical Levels Of Detail (HLODs) in order to accelerate the rendering speed. During preprocessing phase, build a hierarchical decomposition of the environment using an octree and create HLODs. At run time, use multiple threads to render the environment: use visibility culling to cull those invisible blocks, choose HLOD according to screen error, and also use data management and attemperation to update the data in main memory. Try to find the optimal acceleration method while still maintaining the image fidelity.

Visualization of time-dependent 2D vector fields based on topological method

Tai-Lin Cao Yao-Lin Gu

2007, 27(9):  2129-2130. 

Asbtract ( )   PDF (529KB) ( )  

Related Articles | Metrics

In the visualization of time-dependent 2D vector fields, closed streamlines detection was dependent on grid and could not locate closed streamline accurately. An improved method was proposed. It tracked critical point with feature flow field and integrated stream surfaces with saddle connector. The results demonstrate that the scheme is valid in offering a general framework for the visualization of parameter-dependent 2D vector fields.

3D-Curves shape blending with constrained boundary based on quaternion interpolation

2007, 27(9):  2131-2133. 

Asbtract ( )   PDF (1152KB) ( )  

Related Articles | Metrics

Curve shape blending plays an important role in animation and products modeling. In this paper, we presented an approach of 3D-Curves and 2D-Curves shape blending with constrained boundary, by structuring nonlinear local interpolation with quaternion and using boundary control conditions in restructuring equation of in-between shapes. The approach preserves linear of perimeters of curves blending sequences, and it fits general curves blending and skeleton moving. We gave algorithm of boundary curve, and excellent results of blending surfaces were shown by examples. Experimental results indicate that our method can generate visual-pleasing blending sequences of 3D-Curves, and promising applications. Our approach has advantages over others such as simplicity and uniformity.

Comprehensive dynamic background updating method for real-time traffic visual surveillance

Hong-Bin Zhang Shan Huang

2007, 27(9):  2134-2136. 

Asbtract ( )   PDF (893KB) ( )  

Related Articles | Metrics

To extract good background image from complex traffic scenes, a comprehensive dynamic background updating method was proposed. It used the information of both frame-difference and high-level object state to update the mixed Gaussian background model. It could avoid the effect of the prolonged traffic standstill on the background and eliminate the ghosts caused by the move-away of background objects. The results of experiment on the real-time traffic video show that the method is self-adaptive and robust.

3D model of tree-image based on fractal

2007, 27(9):  2137-2139. 

Asbtract ( )   PDF (564KB) ( )  

Related Articles | Metrics

The 3D model of tree is widely used in agricultural research and other areas such as show business, education, business, etc. At present, the methods of tree modeling cannot be used universally: different applications need different models. This paper presented a shape model of 3D tree based on fractal. The use of random-trembling and double-buffer technique takes both the third dimension and the speed of calculation into consideration. As a result the method has good universality, it can be carried out easily, and can make lifelike tree sketch.

Steganalysis based on Markov model and SVM for JPEG images

Xia Cui Xue-Feng Tong

2007, 27(9):  2140-2142. 

Asbtract ( )   PDF (566KB) ( )  

Related Articles | Metrics

A new and universal steganalysis scheme based on Markov model for JPEG images was proposed. 360 dimensional feature vectors were derived from the markov matrix, which was calculated directly in DCT domain and sensitive to the data embedding process. Then Support Vector Machine (SVM) was used to classify. The experimental results of 4 popular JPEG steganographic schemes (F5, Outguess, MB1 and MB2) demonstrate that the proposed scheme has the advantage in detection rate, stability, and speed.

Support vector-based shot clustering algorithm

2007, 27(9):  2143-2146. 

Asbtract ( )   PDF (883KB) ( )  

Related Articles | Metrics

The formation theory of the core of support vector clustering was analyzed deeply, which disclosed the particular role of the core in disposing the overlapping data by support vector clustering. And then, a support vector based shot clustering algorithm was proposed according to the features that there are many overlapping data in the video sequences. In the algorithm, color and time were used as feature vectors to calculate the clustering core of feature space, further more, to form shot clustering. The algorithm addresses the problems of traditional shot clustering algorithms such as large amount of computations and using time as the unique threshold to estimate the similarities of shots.

Image interpolation algorithm based on quantum-behaved particle swarm optimization

XU Wen-Long

2007, 27(9):  2147-2149. 

Asbtract ( )   PDF (873KB) ( )  

Related Articles | Metrics

The conventional interpolation algorithms of image are easy to be realized, but they result in high frequency artifacts in the interpolated image. In order to improve the quality of the interpolated image and enhance the resolution of it, an image interpolation algorithm based on Quantum-behaved Particle Swarm Optimization （QPSO） algorithm was proposed in this paper. This method uses QPSO algorithm to seek the best high resolution image through the objective function in the traditional interpolation image solution space. The experiments demonstrate that the proposed algorithm not only is practical and applicable, but also improves the quality of the interpolated images.

Fast inter-mode decision algorithm based on UMHexagonS

2007, 27(9):  2150-2151. 

Asbtract ( )   PDF (508KB) ( )  

Related Articles | Metrics

Fast inter-mode decision algorithm based on "Unsymmetrical cross Hexagon grid Search" (UMHexagonS) was improved in this paper. The priority estimation of SKIP mode and the inter-mode decision based on image detail were employed. Experimental results show that the one-frame scramble time of fast inter-mode decision, compared with UMHexagonS algorithm, is reduced by 57.48% with negligible loss of peak signal-to-noise ratio.

Moving shadow detection algorithm based on region and illumination invariant

2007, 27(9):  2152-2153. 

Asbtract ( )   PDF (811KB) ( )  

Related Articles | Metrics

Cast shadows from moving objects reduce the general ability of robust classification and tracking of these objects, in outdoor surveillance applications. Classic pixel-based object shadow detection algorithm limits the performance, owing to noise. An algorithm for segmentation of cast shadows was proposed with improved accuracy, combining region with illumination invariant. This algorithm takes into account the features of all the pixels in a region. Using Expectation-Maximization (EM) cluster, the moving region was segmented into blocks with the smaller blocks combined with the neighbor bigger blocks. Shadow detection was performed in every block based on the illumination invariant between the shadow region and the corresponding background region. Experimental results show that the proposed algorithm is robust to noise, can detect accurately shadows and is more efficient than the algorithm based on pixel.

Fast algorithm of wedgelets approximation

2007, 27(9):  2154-2156. 

Asbtract ( )   PDF (805KB) ( )  

Related Articles | Metrics

To reduce the complexity of moment calculation and the running time of wedgelets approximation, a fast algorithm of wedgelets approximation was proposed by replacing arbitrary local regression model with locally constant regression model. The experiments show that the new algorithm can result in a speedup of O (10^3) of implementation compared to the available implementation algorithms in literature. It can be applied to the model with different parameters and the flexibility has been improved.

A New Method for Image Segmentation with Weak Edge Regions Based on Geometric Active Contour

2007, 27(9):  2157-2159. 

Asbtract ( )   PDF (1115KB) ( )  

Related Articles | Metrics

The standard geometric active contour is a powerful segmentation method that has been wildely used for a long time now,yet there are some problems in practice .for example, it susceptible to weak edges and image noise. The paper propose a new geometric active contour that based on gradient flow forces with region constraints. The extra region force gives the model a global view of the boundary information within the image which helps detect fuzzy boundaries and overcome noisy regions.

Articles

Dynamic recognition algorithm based on data field in immune intrusion detection

Li Xue

2007, 27(9):  2160-2162. 

Asbtract ( )   PDF (603KB) ( )  

Related Articles | Metrics

A construction method of detector and its relevant dynamic recognition algorithm were put forward by introducing the data field theory to computer immunology. Antibodies are brought up based on self set. By recognizing the unknown self set, the algorithm can decrease the rate of self-immunity, and also improve the antibody set dynamically and overcome the limitations of traditional IDs that have high requirement for self set, thus simplify the way to implement cloning, mutation and memory. The results of experiments show that the new dynamic recognition algorithm makes IDs possess a higher self adaptability and dynamic equilibrium capability.

Study on intrusion detection model based on immune and fuzzy judgment

Xia-Ling Zeng

2007, 27(9):  2163-2166. 

Asbtract ( )   PDF (970KB) ( )  

Related Articles | Metrics

Based on the classification of specific immunity in human immune system, a model of intrusion detection was designed. The intrusion detection module was classified to the innate detection module and the adaptive detection module in this model. The innate detection module inherits available rules. To solve the problem such as difficulty to certain the threshold of normal and anomaly and difficulty to judge synthetically for multiple data in anomaly detection, the adaptive detection module presented an algorithm of anomaly detection: Fuzzy and Level-based Anomaly Detection Algorithm （FLADA）, which has benefited from fuzzy mathematics and integrates fuzzy judgment with hierarchical analysis. Experiments show that the method can detect not only defined intrusion fast, but also undefined intrusion fairly.

Verifiable certificateless ring signcryption scheme based on bilinear pairings

2007, 27(9):  2167-2169. 

Asbtract ( )   PDF (747KB) ( )  

Related Articles | Metrics

A new model named verifiable certificateless ring signcryption scheme was presented. A scheme based on bilinear pairings was also given. Using the scheme, the message sender can anonymously send the message, and the confidentiality and authenticity of the message are realized at the same time. If necessary, the real signer can prove his identity. Thus the scheme has been proved to be secure in the random oracle model.

Research of trust model based on fuzzy logic for Ad Hoc network

2007, 27(9):  2170-2173. 

Asbtract ( )   PDF (773KB) ( )  

Related Articles | Metrics

To study the trust relations between nodes in Ad Hoc network, a trust model based on fuzzy logic for Ad Hoc network was presented with the help of the knowledge of fuzzy logic. This model takes the account of several factors that will affect the trust in Ad Hoc network. Then a method based on fuzzy logic was used to deal with them for calculating the trust values of nodes. The results of the simulation show that this model is similar to the trust behavior in real life.

Research and implementation of trust transition based on EFI

2007, 27(9):  2174-2176. 

Asbtract ( )   PDF (514KB) ( )  

Related Articles | Metrics

To further enhance the safety of BIOS, this paper presented a new trust transition model with Trusted Platform Module (TPM) in Extensible Firmware Interface (EFI). This model established a trust chain from the first stage of EFI to the operating system by analyzing the process of EFI startup. Thus the model narrowed the scope of the root of trust and substantially improved the safety of the BIOS. With the popularity of EFI, this model has a good prospect in achieving security on computer system.

Study on a comprehensive attack case learning system

ZAN Xin

2007, 27(9):  2177-2179. 

Asbtract ( )   PDF (847KB) ( )  

Related Articles | Metrics

With the widespread deployment of Intrusion Detection Systems (IDS) in network security community, intrusion alert learning and analysis has increasingly become an active research area. Due to some problems such as alert flooding and lack of knowledge about attack scenario etc, a comprehensive attack case learning system composed of two learning phases: similar alerts aggregation and typical attack instance learning was presented. Firstly, an improved density-based clustering algorithm was introduced to aggregate huge volume of similar alerts to numbers of alert clusters. Secondly, some representative alerts were chosen to represent the overall alert clusters according to some reduction rules. Eventually, sequence pattern mining approach is used to mine frequent intrusive incidents. Furthermore, an evaluation approach based on execution ordering of attacks was proposed to identify valuable attack instances from frequent sequences of intrusive incidents. A real intrusion alert dataset was used to test our learning system. The experimental results show that our learning system can not only effectively reduce the large amount of alerts but also correctly learn the valuable attack cases.

Secret transferring protocol with non-repudiation based on domain-verifiable signcryption

2007, 27(9):  2180-2183. 

Asbtract ( )   PDF (735KB) ( )  

Related Articles | Metrics

Signcryption provides confidentiality and authenticity efficiently, and it can be used to design compact communication protocol. This paper analyzed the domain-verifiable signcryption which Wang proposed, and pointed out the redundant data and computation in his scheme. This paper advanced Wang's scheme and designed a new domain-verifiable signcryption scheme. Based on the signcryption scheme, this paper proposed a new secret transferring protocol. The new scheme provides integrity of ciphertext and correctness of plaintext by 3 steps, and it keeps confidentiality, fairness and non-repudiation. Meanwhile, performance analysis shows that the new scheme is more efficient.

Deep packet inspection algorithm based on regular expressions

2007, 27(9):  2184-2186. 

Asbtract ( )   PDF (780KB) ( )  

Related Articles | Metrics

This paper proposed a new DFA-based pattern matching algorithm. Based on the analysis of the impact of the number of DFA states on the algorithm performance, further improvement to the algorithm was made by introducing a DFA state number optimization algorithm. The proposed algorithm has been implemented in Linux environment and lots of experiments have been done. Experimental results show that the performance of the proposed algorithm is much better than others.

Self-selecting share threshold multi-secret sharing scheme

Feng-Mei YIN

2007, 27(9):  2187-2188. 

Asbtract ( )   PDF (493KB) ( )  

Related Articles | Metrics

In the present threshold multi-secret sharing schemes, the dealer distributes share to every shareholder, which could lead to the dealer's intentional or unintentional cheating in shadow distribution, and the shareholder can only use share once. To solve these two problems, a new multi-secret sharing scheme based on the intractability of the discrete logarithm was presented. In this scheme, every shareholder's share is selected by himself (or herself), and the share can be reused, in addition, the cheating of the dealer and the cheating between shareholders can be detected without using interactive protocol. Compared with the existing schemes, the proposed scheme is more feasible, and the shareholders take more initiatives. Besides, the utilization ratio of the data is higher.

Non-repudiation protocols model based on first-order logic

2007, 27(9):  2189-2193. 

Asbtract ( )   PDF (1139KB) ( )  

Related Articles | Metrics

In order to analyze the non-repudiation and fairness properties under one frame, a set of first-order logic syntax and semantics for non-repudiation protocols was proposed, and a model was built. The Zhou-Gollmann fair non-repudiation protocol was analyzed with the model and a known attack to the protocol was found. The results show that our model is valid and correct.

Text tendency categorization method based on class space model

2007, 27(9):  2194-2196. 

Asbtract ( )   PDF (603KB) ( )  

Related Articles | Metrics

Text tendency categorization has important application in the content security management and public opinion analysis. Based on the studies of existing classification methods and the complexity of text tendency categorization, a text tendency categorization method based on class space model was proposed. By means of combined feature selection method, the new method realized text tendency classification based on the words of the types of tendency. Experimental results show that the method is effective in improving the accuracy and speed of text tendency categorization.

Design and implementation of mobile security system based on IPSec VPN

Song-Yang Wu Cheng-Xiang Tan

2007, 27(9):  2197-2199. 

Asbtract ( )   PDF (555KB) ( )  

Related Articles | Metrics

To solve the security problem of using Virtual Private Network (VPN) technology to connect mobile networks and fixed-IP networks, this paper presented and achieved a new type of mobile security system based on IPSec VPN. This system, on the basis of IPSec VPN and remote access service, establishes a complete authentication mechanism based on smart card and X.509 certification, and has a unified security information service platform. At last, the results of the experiment show that the system can spread the information of the fixed-IP networks safely and seamlessly in mobile networks.

Research of user Agent mechanism in RBAC model

yueyang chen xuesen ma jianghong han

2007, 27(9):  2200-2201. 

Asbtract ( )   PDF (530KB) ( )  

Related Articles | Metrics

In order to solve the more and more complicated problem of permission assignment between users and services on ASP service platform, A new Role-Based Access Control (A_RBAC) model was proposed. A_RBAC model made platform services associated with enterprise level user by making use of Agent layer, adopted mechanism of user role access control of classification authorization, implemented regional autonomy of permission access in user Agent mechanism and was applied to the platform of information trusteeship of small medium enterprises with Lightweight Directory Access Protocol (LDAP) and Java 2 Platform Enterprise Edition (J2EE) in Hefei city. The results show that the complexity of permission assignment is effectively reduced.

Network and communications

Research of incentive mechanisms in P2P network

2007, 27(9):  2202-2205. 

Asbtract ( )   PDF (820KB) ( )  

Related Articles | Metrics

Due to the anonymous participation and voluntary resource contributions in P2P systems, the majority of peers are lack of eagerness to contribute resources or provide services to communities; this leads to the prevalence of "free-riding". Based on the analysis of free-riding, incentive mechanisms that have been proposed for P2P networks including micro-payment, direct reciprocity and reputation based models were surveyed and problems such as hidden information, information asymmetry and collusive behavior were pointed out. Main incentive mechanisms were compared in terms of reliability, scalability and complexity. Some remaining issues like quantization comparison of cost and utility as well as universal framework for further research were discussed.

Mobile navigation system based on self-constructed network

2007, 27(9):  2206-2208. 

Asbtract ( )   PDF (638KB) ( )  

Related Articles | Metrics

Because most of the present mobile navigation systems lack dynamic traffic service, in this paper, a mobile navigation system was presented and implemented, which provided dynamic traffic information by means of the communication in self-constructed network. Compared to the traditional way of background calculation, self-constructed network greatly reduces the cost with little performance penalty.

Automatic Web service composition system based on multi-Agent

2007, 27(9):  2209-2211. 

Asbtract ( )   PDF (794KB) ( )  

Related Articles | Metrics

Design the architecture of an automatic Web service composition system based on the AGORA platform. Use active Agents to represent the service providers and consumers. After designing the high-level architecture, the communication primitives between the internal components were defined in detail and IndiGolog interpreter and FaCT Description Logic classifier were used to construct the assistant AGORA node. The automatic service composition system was realized by utilizing Situation Calculus as the key planning technology.

Realization of a mobile Agent variation in TinyOS

Hua-jie LIN

2007, 27(9):  2212-2214. 

Asbtract ( )   PDF (591KB) ( )  

Related Articles | Metrics

The scheme to realize mobile Agent variation in TinyOS was provided. The variation transfers the code space and data space respectively, and the energy consumption to send code space is decreased greatly making use of the broadcast characteristic of wireless channel. The simulation results show that, network performance in mobile Agent variation mode is better than that in traditional C/S mode when the nodes are numerous.

Improved fast handover method for hierarchical mobile IPv6 network

2007, 27(9):  2215-2217. 

Asbtract ( )   PDF (550KB) ( )  

Related Articles | Metrics

Hierarchical Mobile IPv6 adds MAP to manage the movement within the same domain, thus minimizing the registration cost and greatly reducing the handover latency. But when it comes to the movement between the different domains, this hierarchical structure cannot efficiently solve the handover delay. In this paper, a new flow-based fast handover method for HMIPv6 network was presented. It combined the analysis of the flow state information and the Hierarchical structure to help reducing the handover delay and the rate of the packet loss. The analysis shows that this new method has better performance than the existing HMIPv6 method and flow-based fast handover method.

Efficiency of area-based data aggregation in wireless sensor networks

Hong LI Hong-Yi YU Lin-Hai LI Bai-Wei YANG

2007, 27(9):  2218-2220. 

Asbtract ( )   PDF (750KB) ( )  

Related Articles | Metrics

By setting up a network model of data aggregation and using a bit-hop metric to quantify energy costs in wireless sensor networks, we formally analyze the problem of area-based data aggregation and obtain that data aggregation will definitely be energy efficient when the relative difference between the average lengths of the two shortest paths, which are from source sensor nodes to the sink and to the aggregation node respectively, is not less than the ratio of data correlation to the number of source sensor nodes. Simulation results show that over 50% energy cost can be saved under the given conditions.

Congestion control based on routing protocol in multi-hop Ad Hoc networks

WEI Ying WEI BAI Guangwei BAI

2007, 27(9):  2221-2223. 

Asbtract ( )   PDF (735KB) ( )  

Related Articles | Metrics

In order to solve the problem of traffic congestion that always occurs in multi-hop ad hoc networks, a new algorithm for the routing selection was proposed in this paper, i.e. the improved DSR routing — DSRSL, in consideration of both the "shortest-path" and "transmission status" of packet delivery from the source to the destination for congestion avoidance. Our simulation results show that DSRSL can reduce the congestion probability effectively, thereby improve the Web traffic performance in multi-hop ad hoc networks significantly.

Network traffic prediction based on compensated grey neural network model

Jian-Hua Cao

2007, 27(9):  2224-2226. 

Asbtract ( )   PDF (542KB) ( )  

Related Articles | Metrics

To measure the workload and state of network operation, a predictable algorithm based on the grey model, neural network and component error was presented. The present network traffic model has been studied, and the prominent effect in reflecting the variable trend of data has been combined with the grey model and neural network. The simulation results show that the integrated model can improve the prediction precision obviously compared to the other algorithms.

Approach of resource discovery based on fuzzy clustering

LIU Xiao-Feng

2007, 27(9):  2227-2229. 

Asbtract ( )   PDF (738KB) ( )  

Related Articles | Metrics

Chord is a successful P2P resource discovery algorithm, but the inherent characteristic of grid resource affects the efficiency of discovery in grid environment. Focusing on the complexity and diversity of grid resource, and the fact that its similar degree was hardly analyzed in grid computing, a model for resource discovery based on fuzzy clustering was presented in this paper. This method will partition grid resource into many similar sets according to their properties. Similar resources are stored in the near Peer to be organized into 2D Chord to reduce access latency and raise lookup efficiency. Experimental results show that this approach can effectively reduce access latency compared with the original Chord. Thus, the efficiency of resource discovery is apparently improved.

Technology for identifying BT traffic based on payload analysis

2007, 27(9):  2230-2232. 

Asbtract ( )   PDF (568KB) ( )  

Related Articles | Metrics

To enhance the accuracy of the existing technologies for identifying BitTorrent (BT) traffic, the fixed strings that appeared in BT transmission process without failure were found out by analyzing BT protocol and BT transmission data, and set to be characteristic strings, consequently enhanced the accuracy by increasing the number of characteristic strings. Compared with the existing technologies, the method can enhance the accuracy of identification and overcome the limitation that data traffic cannot be identified because of missing hand-shake packet.

Feasibility study of VoIP on GPRS equipment

2007, 27(9):  2233-2235. 

Asbtract ( )   PDF (553KB) ( )  

Related Articles | Metrics

To solve the problem about the real-time voice data traffic based on the narrow bandwidth in the wireless mobile General Packet Radio Service (GPRS) network, by analyzing some kinds of voice codec algorithm, a scheme was proposed in this paper, in which the G.723.1 codec algorithm was adopted and optimized. The experiment results confirmed that the real-time voice data traffic over the GPRS network is feasible. The scheme described in this paper can be widely applied to such as the long-distance cargo transport management, the open country exploration and other fields.

Research of protocol formal description based on RSL

Xiang GU Jianlin Qiu

2007, 27(9):  2236-2238. 

Asbtract ( )   PDF (590KB) ( )  

Related Articles | Metrics

RAISE Specification Language (RSL) was introduced into protocol engineering, and a new approach to protocol description was discussed. In order to make RSL suitable for protocol description, some extension was done such as time mechanism. The extension should be minimum so the original semantic structure of RSL will not be infected. This paper also studies two kinds of models to descript protocols — one based on status machine and the other based on processes. As an example, the description of routed arithmetic of RIP with RSL was given. Extended RSL has stronger description ability and is more flexible. It can support protocol verification and protocol testing better.

Intelligence perception

Interactive system of mathematical Web services based on AJAX and automated reasoning technologies

2007, 27(9):  2239-2241. 

Asbtract ( )   PDF (796KB) ( )  

Related Articles | Metrics

The aided educational system of mathematics is a hot and crucial research topic in mathematical education and computer science. In this paper we showed a method to build mathematics Web services through integrating the newly developed technology Asynchronous JavaScript And XML （AJAX） with automated reasoning tools like the symbolic algebra and dynamic geometry. We investigated some typical interactive learning scenarios and proposed a Perl format to describe the process. The scripts of this format can be automatically transformed into MathML format. Using the JavaScript commands embedded in the MathML files the Ajax engine enabled the users to interact with the server. The JavaScript also communicated with the automated reasoning programs in server and client machines. The experimental result shows this system can efficiently help students to learn mathematics in a straightforward and funny mode.

Interpretability-based recognition method of architectural drawings

Hua-Fei YANG Ruo-Yu YANG Tong LU Shi-Jie CAI

2007, 27(9):  2242-2245. 

Asbtract ( )   PDF (1050KB) ( )  

Related Articles | Metrics

Automatic recognition of architectural drawings is an important technique for improving automatization and informatization of construction industry. This paper proposed an interpretability-based recognition method. The method extracted a group of public feature items from hierarchical structure, composition, relation between objects, recognition order, etc. and described them with a regular format so that the recognition was built on automatically interpreting the description. This method extended maneuverability of recognition program and greatly improved standardization, maintainability and scalability.

Vortex detection of flow field based on pattern matching

Yan-Fang LI

2007, 27(9):  2246-2248. 

Asbtract ( )   PDF (601KB) ( )  

Related Articles | Metrics

Having done the comparative analysis of the several existing vortex detection algorithms, pattern matching algorithm based on Clifford convolution was studied with emphasis. Considering the irregularity of the data sets obtained by the actual computation, an improved method was proposed for the pattern matching algorithm based on Clifford convolution. Irregular data sets were divided by the hybrid grid and the pattern was scaled according to the cells surrounding grid point. In computation process, the 1-neighborhood of pattern was sampled. The result show that this algorithm can more accurately detect and visualize the vortices of flow field preconditioned with similar algorithm efficiency.

Decomposition forward SVM dimension-reduction algorithm based on independent component analysis

2007, 27(9):  2249-2252. 

Asbtract ( )   PDF (762KB) ( )  

Related Articles | Metrics

A Decomposition Forward Support Vector Machine （DFSVM） algorithm for large scale samples learning and a new dimension reduction model based on Independent Component Analysis (ICA) were proposed. The calculational complexity is lower than that of the traditional chunking algorithm and the standard SVM. Use the idea of imcomplete ICA to compress data and reduce the dimension. Because of the reduced input dimension and simplified data structure, the calculational complexity of SVM has been reduced. Experiment indicates that if reducing the dimension from one hundred and ten dimension to five-dimension, the average recognition rate is superior to traditional neural network and comes to 93%. Considering the time cost and the recognition efficiency, ICA dimension reduction model is an ideal application model in practice.

Research into modeling method of nonlinear dynamic system based on SVR

Dehui WU

2007, 27(9):  2253-2255. 

Asbtract ( )   PDF (694KB) ( )  

Related Articles | Metrics

A modeling method for nonlinear dynamic system based on Support Vector Regression (SVR) was proposed in this paper. The Hammerstein model expressed by a nonlinear static subunit followed by a linear dynamic subunit was used to describe the nonlinear dynamic system. Through the function expansion, the nonlinear transfer function of Hammerstein model could be converted to the same form as linear one, thus generating the intermediate linear model. Also, by SVR algorithm, the coefficients of the intermediate model were obtained. Moreover, through the relations of the coefficients of intermediate model and that of Hammerstein model, the nonlinear static subunit and linear dynamic subunit were identified simultaneously. Calibrating experimental data of nonlinear dynamic system were used to test. The results show that, compared with conventional nonlinear dynamic modeling methods, the proposed one possesses prominent advantages: 1) Only once dynamic calibrating experiment need be made; 2) The analytic expressions of nonlinear dynamic model are derived; 3) The model is more robust in noise resistance due to the good features of SVR. It provides a better way to model the nonlinear dynamic system.

Research of FAQ based on the semantic similarities of HowNet

Ke-Liang JIA FAN Xiao-zhong FAN ZHANG Yu ZHANG

2007, 27(9):  2256-2257. 

Asbtract ( )   PDF (378KB) ( )  

Related Articles | Metrics

Frequently Asked Question (FAQ) is the main method to provide online help. A candidate question set was built up according to the user's query by search engine. Semantic similarities of sentences, based on HowNet, were computed between the user's query and the candidate questions. The answer, which is the most similar to the query, was returned to the user. Experiments show that the method has done better in the matching between questions and answers.

Human detection based on deformable template and SVM

2007, 27(9):  2258-2261. 

Asbtract ( )   PDF (898KB) ( )  

Related Articles | Metrics

With the development of image processing and pattern recognition technology, human detection system has been widely used in many domains, such as monitor and control system, driver assistance system and image index system. Aiming at the problem of standing human detection within static image, a new method to extract human feature was proposed, and human was detected and positioned within static images by using a deformable template combined with Support Vector Machine (SVM) method. After the image contour was extracted and processed, the image was decomposed into grids, and features of horizontal and vertical grids were grouped into the image feature vector. Then the support vector machine model was trained with feature vectors extracted from example images. Detecting regions in the image were identified with a deformable template. With feature vector of detecting regions as input, the trained SVM model classified the test image and positioned the human in the test image. Experiment results show this method can effectively detect standing humans from static images with various backgrounds, and the correct classifying rate is over ninety-two percent.

Improved dynamical binary-tree based self-organizing neural network algorithm

2007, 27(9):  2262-2266. 

Asbtract ( )   PDF (1272KB) ( )  

Related Articles | Metrics

The advantages and disadvantages of various improved self-organizing neural network algorithms were discussed in the paper, and an Improved Dynamical Binary-tree Based Self-Organizing Neural Network (DBTSONN) was designed and implemented in detail. In the binary-tree, neuron nodes can be growing and pruning, and the self-organizing mapping structure is flexible, not needed to be determined in advance. DBTSONN1 algorithm uses single path to search the winning leaf nodes, and DBTSONN2 algorithm uses double path search, considering the hierarchical position of the winning node, which can improve the searching efficiency. The experimental results show that DBTSONN algorithm is very useful for vector quantization.

Knowledge reduction algorithm based on elementary row transformation of Boolean matrix

2007, 27(9):  2267-2269. 

Asbtract ( )   PDF (484KB) ( )  

Related Articles | Metrics

The definition of elementary row transformation of Boolean matrix was given. Attribute reduction model in the form of linear logical equation group was established. Coefficient matrix was transformed into simplest matrix by elementary row transformation of Boolean matrix. Three necessary and sufficient conditions to determine whether the attribute was absolutely necessary, relatively necessary and absolutely superfluous were given by coefficient matrix and simplest matrix, and a fast knowledge reduction algorithm was proposed.

Feature selection of modulation recognition based on dynamic adaptive genetic algorithm

2007, 27(9):  2270-2272. 

Asbtract ( )   PDF (515KB) ( )  

Related Articles | Metrics

Neural network classifier has been widely used in automatic recognition. It's performance and structure are dependent on the dimension of the input data. Genetic algorithm is a kind of global optimization algorithm and is appropriate to be used in feature selection. Two drawbacks of the Simple Genetic Algorithm (SGA), i.e. premature convergence and poor local searching ability, hinder SGA from wide application. This paper proposed a novel genetic algorithm in which the median of the population are used to control the probability of the crossover and the mutation. Simulation results show that our method can get the optimal subset quickly and the performance of the neural network classifier could be improved markedly.

Optimization for parallel multi-machine scheduling based on hierarchical genetic algorithm

2007, 27(9):  2273-2275. 

Asbtract ( )   PDF (509KB) ( )  

Related Articles | Metrics

With regard to the identical and non-identical parallel machine scheduling for minimizing the makespan, a hierarchical genetic algorithm was proposed. Its coding method is simple and can effectively reflect the scheduling policy, and the methods of crossover and mutation need no special design. The computational results suggest that the hierarchical genetic algorithm is efficient and fit for large-scale identical and non-identical parallel machine scheduling.

Improved adaptive genetic algorithm for expert assignment problem

2007, 27(9):  2276-2278. 

Asbtract ( )   PDF (751KB) ( )  

Related Articles | Metrics

Expert assignment is chief and basic work of project review in project management. So it is significant to research how to solve expert assignment problem (EAP). In previous papers, we established the mathematical model of expert assignment problem, and proposed genetic algorithm and GA using heuristic mutation guide by pheromone to solve EAP. Though it has been proven they are effective ways for EAP, they have disadvantages of massive redundancy iteration in later period and inferior local search ability. In this paper a modification of GA which introduces adaptive mutation is proposed to solve EAP. The simulation results show that the new algorithm improves the ability of local search and generates solutions of better quality.

Research of rule-including with intuitionistic fuzzy rough reasoning

Wei-Wei KONG

2007, 27(9):  2279-2280. 

Asbtract ( )   PDF (522KB) ( )  

Related Articles | Metrics

To the issue of rule-including with Intuitionistic Fuzzy Rough Sets (IFRS) logical reasoning, a checking algorithm of non-including with IFRS logical reasoning was presented. With the rough-model about inclusion degree, the definition of rule-including with IFRS logical reasoning was given; besides, the checking algorithm of non-including was also proposed. Finally, the algorithm was proved to be effective and feasible, and it can effectively deal with the information form whose property values are all fuzzy. In addition, the non-including degrees between IFRS logical reasoning rules were given which can check the rule-including in rule bases.

Flexible self-learning model based on granular computing

Ting Wei Yu Wu Yin-guo Li

2007, 27(9):  2281-2283. 

Asbtract ( )   PDF (530KB) ( )  

Related Articles | Metrics

Aiming at the problem of main memory limit when Granular Computing algorithm processes mass data sets, a concept of Granular Distribution List (GDL) was put forward based on the analysis of the hierarchical granular model of information table, and a Granular Computing algorithm was improved by using this list. Experiments demonstrated the revised algorithm can process mass datasets directly without influencing the validity of the original algorithm.

Dynamic service resource selection model based on historical information feedback

Lan Xu

2007, 27(9):  2284-2286. 

Asbtract ( )   PDF (623KB) ( )  

Related Articles | Metrics

According to the uncertainty of grid resources, such as CPU load and network load, dynamics and security of a real Service Grid environment, this paper proposed a Dynamic service Resource selection model based on Historical information Feedback (DRHF). This model automatically adjusts prediction model by using the historical information and also considers the real-time property, security and uncertainty of the resource in the Grid. And then it selects the best one as the executing node that has better performance than others to run the service.

New multi-objective optimization strategy mechanism and its application

2007, 27(9):  2287-2289. 

Asbtract ( )   PDF (815KB) ( )  

Related Articles | Metrics

There are many learning mechanisms on game problems. Although most of them can make Agent convergence to Nash equilibrium solution, they can't satisfy the actual requirement. In this paper, we translate the game problems into multi-objective optimization problems, and present a new multi-objective optimization strategy mechanism-Reserve the Dominated Strategies (RDS). Empirical result proves that the Agent using this mechanism in self-play gets more significative Pareto Optimum Solution than Nash Equilibrium. The result of the experiment indicates the validity of the strategy to solve Pareto Optimum Solution.

Typical applications

Research of multiple minimum supports frequent itemsets mining

2007, 27(9):  2290-2293. 

Asbtract ( )   PDF (203KB) ( )  

Related Articles | Metrics

Mining frequent itemsets algorithm based on multiple minimum supports was studied in this paper, because sometimes setting different minimum supports to mine frequent itemsets is necessary. A new Minimum Support tree (MS-tree) algorithm and a MS-growth algorithm to mine all frequent itemsets based on Frequent Pattern growth (FP-growth) were proposed. It solves the problem of MSapriori algorithm that it cannot generate association rules without scanning the database again. The experimental results show that the proposed algorithm is comparable to FP-growth algorithm, but the former can solve the problem of multiple minimum supports.

Telecom churn prediction modeling and application based on neural network

Ling Tian Qiu Hui-zhong

2007, 27(9):  2294-2297. 

Asbtract ( )   PDF (808KB) ( )  

Related Articles | Metrics

Churn management is a major focus of mobile operators to retain subscribers via satisfying their needs under resource constraints. One of the most important tasks is churn prediction. A customer churn prediction model based on neural network was put forward. Choose analysis variable according to expert empirical evaluation, and calculate the weight of analysis variable using neural network, set up customer churn prediction model and predict customer churn. Compared to decision tree and Bayesian network, the attributes closely related to churn degree were abstracted by using two neural networks. The attributes obtained are more favorable for customer detainment.

Research and application of a cross-platform embedded GIS data model

Wen-yu SHEN Yu Fang Chang-jun Jiang Hong-zhong Chen

2007, 27(9):  2298-2301. 

Asbtract ( )   PDF (917KB) ( )  

Related Articles | Metrics

The types of embedded device platform become more and more diversified. In order to make GIS systems developed run on several kinds of platforms, this paper put forward a cross-platform embedded GIS data model. This model isolated the data processing part, which was irrelevant to display, and based on which, it was further divided into higher layer interface model and lower layer data engine model. This model is able to not only meet user's requirement of secondary development but also cross several operating systems and integrate several heterogeneous GIS data resources. Finally, the platform-independence of the model is certified, through the implementation of a traffic navigation system.

Collaborative filtering algorithm based on time weight

2007, 27(9):  2302-2303. 

Asbtract ( )   PDF (567KB) ( )  

Related Articles | Metrics

Collaborative filtering is the most widely used recommendation technology in the personalized recommendation system. However, the user's interests in different time have been taken into equal consideration with the method being used, which leads to the lack of effectiveness in the given period of time. In view of this problem, this paper presented an improved collaborative filtering algorithm to make the click interests, approaching the gathering time, have bigger weight in the recommendation process, thereby to improve the accuracy of the recommendation.

Parallel TPS design and application based on components

2007, 27(9):  2304-2306. 

Asbtract ( )   PDF (635KB) ( )  

Related Articles | Metrics

At present, there are no practical and mature R&D methods for the design and implementation process of the parallel test system's Test Program Set (TPS). Therefore, first, the multithreading architecture of parallel test system was presented, and the user case model of the TPS was set up in this paper. Then, the framework of multi component layers was proposed based on it. Last, the application of parallel processing components based on COM was introduced. The method boosts the design and application of the parallel TPS.

New topological sort algorithm based on adjacency matrix

2007, 27(9):  2307-2309. 

Asbtract ( )   PDF (506KB) ( )  

Related Articles | Metrics

In order to decrease the complexity of the topological sort algorithms which are based on adjacency matrix, the single-vertex algorithm framework was expanded to the set algorithm framework, and some properties of Directed Acyclic Graph (DAG) propitious for topological sort were given. Based on these, some manipulations of the DAG's adjacency matrix were defined, a storage solution for DAG's adjacency matrix was given and a new topological sort algorithm with low computation and storage complexity was proposed.

Design and implementation of ElAura component runtime platform

2007, 27(9):  2310-2311. 

Asbtract ( )   PDF (682KB) ( )  

Related Articles | Metrics

In order to implement a virtual and universal Component Assembly Runtime （CAR) platform on multi operating systems, the characteristics of the Elastos operating system and CAR technology were analysed, and the hierarchical model of ElAura component runtime platform was presented. Then the implementation of key techniques was described in detail. Based on ElAura, a binary component could be distributed independently and run properly on any operation system or software platform.

Design and implementation of the development platform of digital receiver

Wang Xu Gong Xiao-feng Xiao Bo-shan

2007, 27(9):  2312-2314. 

Asbtract ( )   PDF (176KB) ( )  

Related Articles | Metrics

To solve the problem that the development of real signal receiving system is restricted to the hardware and bad expansibility, a virtual receiver system based on the idea of software radio was designed and implemented by VC and Matlab. The main function of the program includes I/Q conversion, digital downconversion, signal feature extraction, signal demodulation. The results of the practical application of the virtual receiver can give theoretical guidance to the basal development and extend the research of real digital receiving system.

Study on path planning and monitoring system of UAV based on BCB & MapX

2007, 27(9):  2315-2318. 

Asbtract ( )   PDF (853KB) ( )  

Related Articles | Metrics

On the basis of the analysis of module structure of the system, an approach to Mission Planning and Monitoring System of Unmanned Aerial Vehicle (UAV) was given in the paper. By importing the MapX ActiveX control into the BCB develop interface, the capacity of monitoring on GIS was improved in the system. The mathematic model based on VORONOI diagram of the optimal path planning of the UAV was established. The optimal path searching was realized in the MapX by Dijkstar arithmetic which will minimize the cost of the roads. A suit of effective method was proposed to deal with the problem of dynamic marking of complex ICO and flash problem when global refresh in the MapX and the key codes were provided.

AMPS — Theory of commercial application management system and its implementation

2007, 27(9):  2319-2323. 

Asbtract ( )   PDF (1445KB) ( )  

Related Articles | Metrics

Commercial applications are playing an important role in information society, requiring an effective and powerful management system to ensure availability and QoS of these applications. In this paper, a set of complete and systematic theory on managing commercial applications was presented, according to logical sequence: description, monitoring, analysis and maintenance. Then a system named Application Management Platform Service (AMPS) was designed and implemented according to the established theory. Afterwards, the system of AMPS was verified to have improved the availability and QoS of controlled applications via a series of experiments.

Design and implementation of JPEG image decoder in embedded systems

2007, 27(9):  2324-2326. 

Asbtract ( )   PDF (546KB) ( )  

Related Articles | Metrics

Now, most embedded products have been configured with low memory for the reason of cost. It cannot decode and display big JPEG image. According to the characteristics of JPEG decoding, a new way was proposed to decode image part by part. As a result, it only cost 112 kB memory to successfully decode and display an 11 million pixels image which needs 29 MB to decode the image completely. Also, this method can be applied to many embedded products, such as mobile phone, PDA and so on.

Study and implement on DOM-driven Agent in the intelligent calculation tasks

Yun-Shen LUO

2007, 27(9):  2327-2329. 

Asbtract ( )   PDF (711KB) ( )  

Related Articles | Metrics

DOM-driven model-based Agent method for implementation of complex calculation was proposed. In some complicated calculation process, there is a need to join some calculation tasks, or a need to adjust and update some calculation tasks for the external environment. In many cases the intelligent calculation can make up for the lack of general calculation. Firstly, basic structure of the Agent was realized progressive in accordance with the abstraction of common Agent. Then storage components and communication segments of the Agent was built by XML document. Here DOM-driven model was used to read the contents of XML. Microsoft Script component was used to translate Agent itself and its actions into local machine code. Then a new framework of a combination of XML and Agent of calculation was created. Finally, as an example, the application of the Agent for calculating forest vegetation simulation gains a desired result.

Graphical representation of DNA sequences and the application research of clustering analysis

2007, 27(9):  2330-2333. 

Asbtract ( )   PDF (694KB) ( )  

Related Articles | Metrics

This article proposed a new 3D graphic representation with non-degeneration on the basis of studying gene sequences representation model. This representation can avoid the overlap or cross without losing biological information. This method was used to abstract character of H5N1 virus gene and propose a clustering analysis based on multi-dimension Pseudo F-Statistics (PFS) parameter. In the procedure of clustering, the numerical characterization matrix was used as analytic data source. The result shows that it is rational to make clustering analysis on the gene character abstract from the new graphic representation.

Research and design of Chinese-spam's phrase segmentation based on indexing

Yong-Yan QIANG Geng Yang

2007, 27(9):  2334-2336. 

Asbtract ( )   PDF (545KB) ( )  

Related Articles | Metrics

To improve the preprocessing performance for anti-spam and to search for phrases more efficiently, this paper creatively constructed an indexing dictionary based on hash algorithm, and designed a method of Chinese phrase segmentation based on this indexing dictionary aiming at anti-Chinese-spam. Through the study of the experimental data, this method is proved to be more efficient and accurate compared with the traditional mechanical classification, and it does improve the preprocessing performance and can be widely utilized in the field of Chinese phrase segmentation.

Split-iterated algorithm for 2D bar code encoding of the GB18030-character-set-based Chinese ideograms

Chun-Lei Xia Shu-Guang Dai Ren-Jie Zhang

2007, 27(9):  2337-2339. 

Asbtract ( )   PDF (181KB) ( )  

Related Articles | Metrics

It is very important for the wide use of 2D bar codes in certificates to encode the Chinese ideograms that are rarely seen and used in social life while more people would like to have them in the name to show its uniqueness. GB18030—2005 character set makes it possible to solve such a question with nearly 27 000 Characters included. The encoding regulations for Chinese ideograms in GB18030 were analyzed here and then the 2D bar code PDF417 encoding method of the mixed information of Chinese ideograms with ASCII characters was put forward. A special byte-compression method named split-iterated algorithm which could save memory without loss of encoding efficiency and could be realized on 16-bit programming tools was introduced here too. An example was given in this paper to illustrate the whole encoding process.

Automatic planning of Chinese newspaper layout based on dominance

2007, 27(9):  2340-2342. 

Asbtract ( )   PDF (227KB) ( )  

Related Articles | Metrics

To deal with the variable distribution of dominance in Chinese newspaper, one approach to estimate the area of each article with different importance was proposed, the concept of Priorities Distribution Set was presented with its calculational methods, and the method of slicing-floorplan designing in VLSI was applied to automatic configuration of layout with similar structure in Chinese newspaper. By these works, the final layout of newspaper can be consistent with pre-determined command of dominance distribution. The feasibility and effectiveness of our plan is demonstrated by the prototype system.

Research and implementation of the telephone outbound system

Ma Hui-Li

2007, 27(9):  2343-2345. 

Asbtract ( )   PDF (467KB) ( )  

Related Articles | Metrics

In this article, a telephone outbound system developed on the Microsoft VC++ 6.0 for modern management was introduced. Then, several solutions for the system's main functions, software designs, module partitions and some key technologies were given. Compared with the existing telephone outbound systems, this system is cheaper, more efficient and easier to spread. It has higher practical value, which has been proved by trial application.

Limitations of PCA in solving the multiple correlations between variables

2007, 27(9):  2346-2348. 

Asbtract ( )   PDF (966KB) ( )  

Related Articles | Metrics

In view of the limitations of PCA's application to variables observed with nonlinear features, Principal Component Analysis (PCA) was studied theoretically. Based on the coordinates of Euclidean-space and statistical method, the study discussed the mathematical essence of PCA, and analyzed the structure of nonlinear system, and then proposed and proved the causes of the limitations of PCA in (a) solving the multiple correlations between variables efficiently and (b) using in multiple indexes system evaluation under the condition of the multiple correlations by an example of multiple correlations between variables in high degree. For some nonlinear problems, the improvement on PCA and solutions to the limitations were presented accordingly.

Particle swarm optimization applied in the product component layout design

2007, 27(9):  2349-2352. 

Asbtract ( )   PDF (1388KB) ( )  

Related Articles | Metrics

This paper proposed a self-adapting algorithm using particle swarm optimization to deal with the constrained layout optimization problems. This algorithm based on component feature model, integrating human-computer interactive technique into Particle Swarm Optimization （PSO）, can solve the problem more efficiently. And the effectiveness of this method is verified in the layout problem of cell-phone components. Theoretical and case analysis show that this improved algorithm can create multiple layout schemes of cell-phone components quickly and efficiently.