Loading...

Table of Content

    01 January 2009, Volume 29 Issue 1
    Previous Issue    Next Issue
    Network and communications
    Bandwidth allocation by optimal contention window setting for IEEE 802.11 EDCA
    Jian-Bing MAO Yu-Ming MAO Su-Peng LENG
    2009, 29(1):  1-4,8. 
    Asbtract ( )   PDF (663KB) ( )  
    Related Articles | Metrics
    IEEE 802.11 Enhanced Distributed Channel Access (EDCA) provides the QoS enhancement to support priority-based service differentiation for different types of traffic. This paper focus onto the problem how to yield the maximum aggregate throughput while maintaining the weighted proportional bandwidth differentiation among different traffic classes by optimal contention window settings. Two approximate computation methods are proposed to acquire the optimal transmitting probability, which is then used to find optimal contention window settings further. Through validation by numeric evaluation and simulation, the results are proved to be very close to the theoretical value, and the optimal contention window settings can effectively optimize the throughput performance of the whole network.
    Adaptive error-check solution
    2009, 29(1):  5-8. 
    Asbtract ( )   PDF (683KB) ( )  
    Related Articles | Metrics
    An adaptive error checking solution on the basis of estimation of the change trend of packet-loss rate was proposed. By setting the threshold value of packet-loss rate, the solution took advantage of the improved auto repetitive request supported by RDP to realize real-time transportation at a low packet-loss rate, and used the improved forward error correction, a method of dynamically decollating images on the basis of varying sending rate, to solve the problem of error checking at a low transmission rate.
    Efficient parallel I/O scheduling on application level
    Juan ZHANG Lin-Sheng LU
    2009, 29(1):  9-11,1. 
    Asbtract ( )   PDF (614KB) ( )  
    Related Articles | Metrics
    Many samples suit to use collective I/O in one zone, which needs to find a main process to do I/O of this zone. When more than one zone has the same main process, priority level need be assigned to each zone. This paper presented a new algorithm, multilevel maximal independent sets, to solve the above problem. Through analysis, this algorithm can realize the highest parallel degree of I/O and communication load is the least at the highest degree.
    Transport mechanism for streaming media in wireless network
    Wei Sun Wen Tao Guo Quan
    2009, 29(1):  12-15. 
    Asbtract ( )   PDF (609KB) ( )  
    Related Articles | Metrics
    A novel transport protocol Wireless Multimedia Transport Congestion Control (WMTCC) to was presented to improve the performance of streaming media transmission over wireless networks. The proposed protocol can distinguish packet loss due to network congestion from packet loss due to wireless link error by sending probing packets. In this way the sender can get the accurate state of the networks and adjust the transmission rate appropriately to maintain the Quality of Service (QoS) of the streaming media services. Due to the accurate distinguishing of the packet loss between network congestion and wireless link error, the protocol can maintain high throughput even with high bit error rate. The simulation results show that the new protocol can get higher throughput and larger congestion window in wireless networks and performs consistently better than other existing mechanisms.
    Influence of packet loss on quality of experience in audio stream
    Dalu Zhang Bin Shen Zhiguo Hu Cuiping Hou
    2009, 29(1):  16-17,3. 
    Asbtract ( )   PDF (429KB) ( )  
    Related Articles | Metrics
    The Quality of Experience (QoE) of audio stream is significantly affected by packet loss in packet-switch network. To control the loss and analyze its effect on QoE, a simulated multimedia transport test bed was designed. And the mapping model between packet loss rate and QoE was established by regression analysis under specific encoding/decoding mode and Real-time Transport Protocol (RTP) packet interval. The model has low computational complexity and can predicate the impairment of packet loss on user experience in real-time.
    Backoff algorithm of MAC protocol in Ad Hoc networks based on logarithmic function
    XU Lei Hong-yu FANG Xiao-hui LI
    2009, 29(1):  18-20,2. 
    Asbtract ( )   PDF (583KB) ( )  
    Related Articles | Metrics
    Based on logarithmic function, a new backoff algorithm was presented by introducing the parameter which could change with the network state, in allusion to the deficiencies of Binary Exponential Backoff algorithm of IEEE 802.11 MAC. This algorithm dynamically changed the initial value of collision window and the increasing extent of backoff by using the logarithmic function which took the numbers of network nodes as variable and reduced the probability of collision of data transmission, and the network simulations were carried out by the OPNET software. The results of simulation show that the backoff algorithm based on logarithmic function is obviously effective in improving the capability of throughput and fairness of Ad Hoc network, reducing network delay and the ratio of packet loss, and the capability of new backoff algorithm is better than that of Binary Exponential Backoff algorithm.
    Dynamic virtual topology reconfiguration algorithms for WDM optical networks
    Li-Min PENG
    2009, 29(1):  21-24. 
    Asbtract ( )   PDF (654KB) ( )  
    Related Articles | Metrics
    Aiming at the problem of the traffic changing dynamically in a Wavelength Division Multiplexing （WDM） optical network, the virtual topology designed for an old traffic set needs to be reconfigured to route more connections. Based on maximum link load and the average packet hop distance for increasing network throughput, an adaptive topology reconfiguration algorithm, which determined the change in the virtual topology with a corresponding change in the demand set, was proposed by formulating the reconfiguration problem as mixed-integer linear program in the paper. The performance of the proposed algorithm was studied through extensive simulation experiments. The simulation results show that the network performance can be improved significantly by the proposed algorithm.
    Delay-constrained minimum cost multicast tree algorithm
    Yang Chun-de 杨春德 REN Jing-Jing 任静静
    2009, 29(1):  25-27. 
    Asbtract ( )   PDF (442KB) ( )  
    Related Articles | Metrics
    Based on the Random Selective Tree Node First (RSTF) algorithm that constructs minimum cost multicast tree and considering the delay of the network, this paper presented a new algorithm constructing delay-constrained minimum cost multicast tree. The simulation about random network model shows that compared with KPP the new algorithm has better performance in terms of cost and time delay.
    Virtual position-based ring routing protocol for wireless sensor network
    Lei SHI
    2009, 29(1):  28-31. 
    Asbtract ( )   PDF (652KB) ( )  
    Related Articles | Metrics
    A virtual position-based ring routing protocol was presented. This protocol can serve as the infrastructure of a large-scale and data-oriented service in wireless sensor network. This protocol used distributed Hash table to manage data. The idea of using virtual position lead to the benefit that less redundant routing information was generated, and thus the routing paths were optimized. This benefit also reduced nodes’ working load and improve data transmission efficiency. Detailed simulation and comparison with relative protocol show that this protocol achieves good efficiency and scalability.
    New Ad Hoc routing protocol based on CGSR
    CHEN Wei-Hua Zhi-Ping Jia
    2009, 29(1):  32-33,5. 
    Asbtract ( )   PDF (454KB) ( )  
    Related Articles | Metrics
    Based on the research on the clustered Ad Hoc routing protocols, this paper proposed to improve CGSR protocol under the conditions of balanced energy consumption and prolonged lifetime. Energy consumption was reduced by cutting down the message transmition. Energy restriction of Clusterhead reduced the impact of excessive energy consumption on the network life. NS-2 simulation results indicate the lifetime of network increases when new protocol CBSR is used.
    New constant-degree P2P system based on DBR
    Bing-Hai Wen Ji-Peng Zhou
    2009, 29(1):  34-37. 
    Asbtract ( )   PDF (635KB) ( )  
    Related Articles | Metrics
    This paper proposed a new constant-degree graph, DBR, which combined De Bruijn and Ring and kept 2 in-degrees and 2 out-degrees of a node. Adapting DBR to the dynamic network, we designed Tangram with constant-degree. Tangram was based on DHT. It was a scalable, completely decentralized and self-organizing structured P2P system. The routing algorithm of Tangram was composed of De Bruijn algorithm and Chord algorithm and achieved a time complexity of O(log N) per lookup request by using O(1) neighbors per node, where N was the network size. Experimental results show that Tangram is efficient.
    MIB-based SNMP analysis system and its implementation
    Haiping Ou
    2009, 29(1):  38-41. 
    Asbtract ( )   PDF (622KB) ( )  
    Related Articles | Metrics
    To solve the problem that common SNMP analysis tools cannot interpret variable-bindings according to MIB definition, a MIB-based SNMP analysis system was proposed and implemented. The system dynamically loaded and parsed MIB files into a set of MIB objects, which was used to provide detailed information about the variable-bindings when decoding the SNMP messages. It proves to be of great help to improve the efficiency of SNMP analysis and the understanding of the SNMP management behaviors.
    Graphics and image processing
    New SVD image compression algorithm based on salient object detection
    2009, 29(1):  42-44. 
    Asbtract ( )   PDF (473KB) ( )  
    Related Articles | Metrics
    A new image-coding algorithm (SODSVD) that combined the standard Singular Value Decomposition (SVD) algorithm and the salient object detection technique was proposed. During encoding the images, the salient object detection was used to split the source image into adaptive smaller blocks based on the complexity and visual attention, while smaller blocks were transformed by use of SVD. A simple strategy was proposed to split the source images. Simulation results show that the new algorithm provides good distortion, bit rate and image quality.
    Target detection in SAR images based on region growing
    Qin Yongyuan
    2009, 29(1):  45-46. 
    Asbtract ( )   PDF (309KB) ( )  
    Related Articles | Metrics
    An effective approach of target extraction based on regional growth and characteristic of speckle in Synthetic Aperture Radar (SAR) images was proposed. In point of characteristic of target in SAR images, the approach fully discussed the key problem (seed selection and homogeneity criterion in regional growth). Then, the corresponding decision and the process of target extraction were given. Simulated result indicates that the algorithm is not only noise-resistant in extracting target in SAR images, but also promising.
    Lighting normalization for face recognition in DCT domain
    XU Jia-Wei Guo-Can FENG
    2009, 29(1):  47-50. 
    Asbtract ( )   PDF (643KB) ( )  
    Related Articles | Metrics
    All the existing lighting normalization algorithms are implemented in spatial domain. In order to save the time in images decompression and increase the speed in face recognition, we carried out lighting normalization for JPEG Images directly. In this paper, we applied the Differential-image algorithm in the Discrete Cosine Transform (DCT) domain based on the 3-dimensional irradiance equation, and proposed Component-image method in DCT domain. Experiments show that the Differential-image algorithm and Component-image method in DCT domain can weaken the negative impact of face recognition from light directions effectively, improve the efficiency for face recognition in JPEG images.
    Touched human object segmentation based on Mean-shift algorithm
    Sen Guo Wei Liu JiangHua Wang
    2009, 29(1):  51-53. 
    Asbtract ( )   PDF (425KB) ( )  
    Related Articles | Metrics
    Human objects Segmentation is one of the key problems of Visual Analysis. In this paper, a novel touched human objects segmentation based on Mean-shift algorithm was proposed. At first, Video Images was preprocessed and motion regions were obtained, and model of human object was built according to statistical characteristics of body surface. Then, a few of points of motion region picked equably were taken as seeds, and local mode centroids were calculated by Mean-shift iterative process. At last, the number of categories was automatically acqured based on the clustering algorithm, and human objects were segmented according to the result of clustering. The experiment based on PETS 2006 Database proves this method is feasible.
    Image segmentation algorithm based on coevolution with texture and gray scale
    2009, 29(1):  54-56. 
    Asbtract ( )   PDF (454KB) ( )  
    Related Articles | Metrics
    To obtain better segmentation effect, Local Binary Patterns (LBP) and gray-scale characteristics were brought into the framework of Cooperative Coevolutionary Algorithm (Co-CEA) successfully in this paper. LBP and gray-scale characteristics were firstly encoded, and then evolution operation was carried out using Co-CEA, Finally, the division of region was fixed by the united fitness function. Result shows that this method has very good effect in improving the quality of segmentation and lowering the time complexity.
    Text extraction algorithm based on binary clustering
    Shen-Sheng ZHANG
    2009, 29(1):  57-59,7. 
    Asbtract ( )   PDF (622KB) ( )  
    Related Articles | Metrics
    To deal with the gradient problem in the clustering process of text extraction, an algorithm based on binary clustering was proposed. The original image was converted to binary bitmap after preprocessing. The background blocks of the image were clustered by the region features, and then text blocks were recognized by the distribution features. The experiment shows this method achieves satisfactory result on various kinds of images.
    Pretreatment for laser spot image in strong noise
    2009, 29(1):  60-62,7. 
    Asbtract ( )   PDF (671KB) ( )  
    Related Articles | Metrics
    To investigate the de-noise ways of the strongly polluted laser spot image, a wavelet domain median filter and a combined filter based on wavelet-threshold and mathematics morphology were applied to inhibit the strong noise of laser spot images; the image Signal to Noise Ratio (SNR) and the Root-Mean-Square Error (RMSE) and the image gray surface chart were selected to estimate the de-noising effect of the images. Compared with other image filters, experimental results show that the de-noising effect of the Wavelet domain median filter is better than spatial domain median filter; when image noise reduction is carried out with the continuum method, the improved SNR is about 1.34 times of the wavelet transform algorithm and 3.14 times of the median filter; the RMSE is about 0.81 times of the wavelet transform algorithm and 0.50 times of the median filter; moreover, when the SNR of the former laser spot image is lower, the advantage of inhibiting noise of this method is more obvious.
    Image smoothing based on Mean-shift algorithm and fuzzy entropy
    2009, 29(1):  63-64,6. 
    Asbtract ( )   PDF (495KB) ( )  
    Related Articles | Metrics
    To solve the problem of how to choose appropriate kernel bandwidths in mean shift filtering，in this paper, mean-shift algorithm combined with fuzzy theory was analysised, and fuzzy membership function was used as kernel function. Experiments show that the method can better meet smoothing image and without selecting the kernel bandwidths in advance.
    Wavelet threshold denoise method for 4f system based on SAR statistic parameters
    2009, 29(1):  65-67. 
    Asbtract ( )   PDF (560KB) ( )  
    Related Articles | Metrics
    Concerning the low pass characteristic and white Gaussian noise of the typical information optics system, by introducing the statistic parameters from synthetic aperture radar (SAR) research, a new wavelet threshold denoising method was provided. Reality and emulational experiments show that the method can effectively denoise the image and keep useful detail information. It is suitable for the applications of low pass filtering and white Gaussian noised system like 4f system.
    Sonar image denoising method based on NSCT circle sample
    2009, 29(1):  68-70. 
    Asbtract ( )   PDF (495KB) ( )  
    Related Articles | Metrics
    Through studying the characteristics of sonar image which include poor contrast and unrecognizable edges and detail, an effective sonar image denoising method was proposed. Firstly, obtained many sonar images by circles sample for noise sonar image then carried out NSCT respectively, selected appropriate threshold to choose value of transformed coefficient, NSCT inverse transformed to select coefficient, obtained denoised images by image airspace average finally. Compared to experimental data, this method is better than other classical methods and improves PSNR of processing result and edges keeping of the sonar image effect. This method takes full use of translation invariant of NSCT and enhances detail keeping ability.
    Study on image deformation based on moving least squares
    Shun-gang HUA Ting LIU
    2009, 29(1):  71-73. 
    Asbtract ( )   PDF (506KB) ( )  
    Related Articles | Metrics
    Using moving least squares, an image deformation method was proposed based on control curves. Firstly, control curves were created by setting key points according to shape information or topology relationship, and were moved to new positions. Then affine, similar and rigid transformations were computed to realize various image deformations using Moving Least Squares. Experiments show that image shape and outline information can be realized by this method and the deformation result is satisfactory and realistic.
    Method for shape from shading based on mesh
    TIAN Feng GAO Qian GUO Wei QIU Qing-Feng WANG Chuan-Yun
    2009, 29(1):  74-77. 
    Asbtract ( )   PDF (553KB) ( )  
    Related Articles | Metrics
    Concerning the current problems of high computation cost and poor convergence performance during Shape From Shading (SFS), a mesh-based resolution was proposed. The original image was divided into several regions by the means of image preprocessing and region segmentation and were transformed them into triangular mesh. And then equations with regard to each vertex of the mesh in three-dimensional space were established. Finally the result resolved form equations was straightly applied to the graphic pipeline of real-time three-dimensional render engine such as OpenGL or DirectX to accomplish the model reconstruction and rendering. The results of simulation show that the method is of convenient calculation and can reconstruct the original model realistically.
    Restoration method for COSM image based on RBF neural network
    2009, 29(1):  78-80,8. 
    Asbtract ( )   PDF (633KB) ( )  
    Related Articles | Metrics
    In the process of obtaining 3D images by Computational Optical Sectioning Microscopy method (COSM), every slice image is disturbed by other defocusing messages and the 3D images are blurred. In order to resolve this problem, a new restoration method based on the RBF neural network was proposed. The nonlinear mapping relationships between the 3D blurred images with defocusing messages and 3D clear images were established by training the Radial Basis Function (RBF) neural network that has the ability of learning and generalizing with a group of COSM images. Then 3D images that need restoring could be restored by the trained neural network. Experiment demonstrates that the speed of this method is high and this method has satisfying restoration performance in both visual impression and quantitative analysis.
    Lenticular-based 2D anti-aliasing digital filtering method for stereo image
    Lei YANG SONG Xiao-Wei
    2009, 29(1):  81-85. 
    Asbtract ( )   PDF (816KB) ( )  
    Related Articles | Metrics
    Based on the characteristic of lenticular-based LCD auto-stereo display and its corresponding stereo image, aiming to solve spectrum aliasing problem, this paper proposed a novel 2D anti-aliasing digital filtering method. This method analyzed multiview LCD sub-pixel arrangement of slant lenticular, established the corresponding sub-sampling model with multi-dimensional sampling theory, and designed the corresponding 2D digital filter, so that 2D spectrum anti-aliasing filtering was performed on each view image and the distortion of stereo image was effectively eliminated. Experimental results show that the proposed method is of low complexity, good filtering effect, and strong applicability to similar auto-stereo displays.
    Object matching algorithm based on robust hausdorff distance
    Zhi-Qiang ZHOU
    2009, 29(1):  86-88. 
    Asbtract ( )   PDF (439KB) ( )  
    Related Articles | Metrics
    Based on the conventional Hausdorff distance of edge position, we introduced the information of edge gradient to distance measuring, and constructed a new distance function that used the information of edge position and gradient. Then we presented a robust three-dimension Hausdorff distance and the object matching algorithm using the proposed Hausdorff distance. In the proposed algorithm, we used a two-step matching scheme that combined two steps of coarse and refined matching to solve the problem of computation complexity increasing caused by using 3D distance measure. Experimental result shows that the matching robustness of the proposed algorithm has been improved greatly compared to conventional algorithms that only use the information of edge position.
    Novel codeword search algorithm based on Hadamard transform
    GUAN Jun-Bing XIONG Wei-Hua PAN Hai-Peng
    2009, 29(1):  89-91,9. 
    Asbtract ( )   PDF (632KB) ( )  
    Related Articles | Metrics
    With the aim of overcoming the encoding complexity, a novel and fast neighbor codeword search algorithm for vector quantization in the Handamard transform domain was presented. In the proposed algorithm, firstly the Hadamard transform was applied to all the codewords in the codebook and the input vector. Then the initial match codeword was selected from the codeword whose norm was nearest to the norm of input vector on Hadamard transform. Furthermore, the triangle inequalities with multiple control vectors and the two elimination criteria were utilized to reject mismatch codewords. Finally, the best-match codeword to the input vector was found. Experimental results show that the proposed algorithm has greatly reduced codeword search time and computational complexity under the precondition of good restored image quality.
    Improved level set-based approach for lip contour detection
    Xiao-Hui FENG
    2009, 29(1):  94-94. 
    Asbtract ( )   PDF (463KB) ( )  
    Related Articles | Metrics
    To detect lip contour, a multi-direction level set approach (Multi-Level set) was proposed for detection according to the lip geometric distribution. Multi-Level set approach could strengthen the gradient information of the lip contour by using mutil-direction filters on images. And then the initial contour of lips was made to evolve to speak to people around the lip actual contour by minimuming energy function. Experiments on mouth images show that the improved accuracy of the shape contour detection using Multi-Level set approach is nearly 7.32% over level set approach.
    Super-resolution sequence image reconstruction based on non-local algorithm
    Xiao-Ming WU
    2009, 29(1):  95-96,1. 
    Asbtract ( )   PDF (460KB) ( )  
    Related Articles | Metrics
    A method based on non-local was proposed for multi-frame image of the super-resolution algorithm, which meant no need for image correction. To overcome the influence of the traditional image restoration algorithm based on local area of the impact point, we can use the model of non-local denoising maintain superior edge and denoising to reconstruct high-resolution images. This experiment proves that the algorithm in the low signal to noise ratio circumstances can achieve better results. It is an effective solution to the image with low signal to noise ratio under the conditions of difficult recovery.
    Realistic simulation of plant based on geometry parameter
    2009, 29(1):  97-100. 
    Asbtract ( )   PDF (536KB) ( )  
    Related Articles | Metrics
    Plants play an important role in the natural scenery of landscape. Unfortunately, due to the high level complexity of the structure of plants, simulating tree becomes extremely difficult. The paper used fractal recursion algorithm to construct the 3D tree model whose parameters were variable. We took advantage of texture mapping, simulated shadow and made use of Bezier surface to enhance the sense of reality of the project. A test example of blooming in a tree created solely by OpenGL graphics library was provided to show the feasibility of the algorithm.
    Artificial intelligence
    Robust indirect adaptive control for a class of nonlinear time-delay systems
    2009, 29(1):  101-104,. 
    Asbtract ( )   PDF (610KB) ( )  
    Related Articles | Metrics
    A new indirect adaptive neural network control scheme with projection algorithm was developed for a class of uncertain nonlinear time-delay systems in this paper. The design was based on the principle of variable structure. Multi-layer Neural Networks (MNNs) were utilized to approximate for unknown plant functions. With the help of a supervisory controller, the resulted closed-loop system was globally stable in the sense that all signals involved were uniformly bounded. Furthermore, the adaptive compensation term of the optimal approximation error was introduced to minimize the effects of modeling error. By theoretical analysis, it is shown that the tracking error converges to zero. Simulation results demonstrate the effectiveness of the approach.
    Improving performance of ethnic group evolution algorithm by Gray code
    Chen Hao
    2009, 29(1):  105-108. 
    Asbtract ( )   PDF (526KB) ( )  
    Related Articles | Metrics
    The Ethnic Group Evolution Algorithm (EGEA) has used ethnic group mechanism, a kind of population-structured technology, to control the evolution tendency of population; meanwhile, it has used the binary code similarity among individuals to be the ethnic group clustering criterion. Because the hamming cliff problem of nature binary code was likely to affect the accuracy of ethnic group clustering, we proposed to make use of gray code to improve the evolution efficiency of EGEA. The simulations of numerical optimization show the EGEA based on gray code can improve the searching speed and the solution precision greatly.
    Ant colony feature selection based on fuzzy rough set information entropy
    2009, 29(1):  109-111,. 
    Asbtract ( )   PDF (572KB) ( )  
    Related Articles | Metrics
    Most heuristic feature selection algorithms converge easily to local-best, which cannot search the whole feature space effectively. In order to improve the parallel search ability to feature space, the information entropy theory of fuzzy rough set was introduced to ant colony model, and the ant search strategy, pheromone updating and state transition rules of the model have been modified to realize ant colony model based feature selection. UCI datasets experiments indicate that the proposed algorithm is effective to feature subset selection compared with three classical feature selection algorithms.
    Production control model of integrated reverse engineering system based on MAS
    2009, 29(1):  112-114,. 
    Asbtract ( )   PDF (650KB) ( )  
    Related Articles | Metrics
    To improve the intelligent and cooperative performance of the integrated reverse engineering system, a control model based on the architecture of Multi-Agent System (MAS) was constructed. This model consisted of three layers: the management Agent layer, the cell Agent layer and the execution Agent layer. The management Agent layer was in charge of coordinating, scheduling and managing all Agents. Each Agent in the cell Agent layer finished the task by cooperation and executed the first step of distribution. The execution Agent layer was responsible for the hardware and software in RE system. According to the local resources information and current status, the CAs in this layer accepted the tasks assigned by the cell Agents and resolved the tasks. Agents in the same layer were in distributed structure and equal cooperation. The superior and subordinate Agents adopted the master-menial cooperation.
    Research on application of radial basis neural network in approximation modeling
    2009, 29(1):  115-118. 
    Asbtract ( )   PDF (609KB) ( )  
    Related Articles | Metrics
    To obtain the optimum spread of radial basis functions (Opt_SPRD) without using test samples for constructing Radial Basis Neural Network (RBNN) approximation models with higher accuracy, a new method of choosing spread based on cross validation was proposed. This method took the function between spread and cross validation error as its basis, and took the spread corresponding with the minimum cross validation error as the approximation of Opt_SPRD. The results of numerical experiments indicate: the proposed method is superior to the current default method; compared with the feedforward neural network approximation models based on L-M backpropagation, the RBNN approximation models based on the proposed method produce smaller errors and have more steady performance.
    Study on multiple traveling salesman problem based on genetic algorithm
    2009, 29(1):  119-122. 
    Asbtract ( )   PDF (535KB) ( )  
    Related Articles | Metrics
    Traveling salesman problem is a classical complete nondeterministic polynomial problem. It is significant to solve Multiple Traveling Salesman Problems (MTSP). Previous researches on multiple traveling salesman problem are mostly limited to the kind that employed total-path-shortest as the evaluating rule, but little notice is made on the kind that employed longest-path-shortest as the evaluating rule. In order to solve this problem, genetic algorithm was used to optimize it and decoding method with matrix was proposed. It is fit for solving symmetric and asymmetric MTSP. Symmetric and asymmetric multiple traveling salesman problems were simulated and different crossover operators were compared.
    Clustering method based on intuitionistic fuzzy equivalent dissimilarity matrix
    2009, 29(1):  123-126. 
    Asbtract ( )   PDF (512KB) ( )  
    Related Articles | Metrics
    Aiming at the problems of clustering for the data of Intuitionistic Fuzzy Sets, a clustering method based on the intuitionistic fuzzy equivalent dissimilarity matrix was proposed. Firstly, the concept of intuitionistic fuzzy dissimilar interval was defined in the method, and the approach of constructing the intuitionistic fuzzy dissimilarity matrix was also presented. Then, the intuitionistic fuzzy equivalent dissimilarity matrix and (α,β)cutting matrices were given. Moreover, an algorithm for intuitionistic fuzzy clustering was proposed. Finally, the clustering algorithm was applied to the field of target classification and the validity was proved by the instance.
    Study on capacitated plant location problembased on immune clone algorithm
    Yang QI Zi-xuan QIN Xia CHEN Zhong-hua YU
    2009, 29(1):  127-129. 
    Asbtract ( )   PDF (447KB) ( )  
    Related Articles | Metrics
    The Capacitated Plant Location Problem (CPLP) is a NP problem and hard to get an optimal and satisfactory solution. Regarding the shortage of the existing solutions, an Immune Clone (IC)-based algorithm was presented in this paper. The algorithm adopted different coding, antibody generation, clonal selection, somatic hypermutation, clonal restraint, and antibody supplement strategies from the general IC algorithm. Experimental results show that the IC-based algorithm could converge to global optimal solution rapidly and solve the Capacitated Plant Location Problem effectively. It can avoid the convergence to the local optimal solution and overcome the slow convergence of the Genetic Algorithm (GA).
    Technique for detecting group events based on intuitionistic fuzzy ART neural network
    2009, 29(1):  130-131,. 
    Asbtract ( )   PDF (448KB) ( )  
    Related Articles | Metrics
    The target classification, the group proceeding and the detection for group events were described. Being associated with the concept of Closeness in intuitionistic fuzzy sets, the model of intuitionistic fuzzy Adaptive Resonance Theory （ART） neural network was built. How to run the network and how to adjust the weights of the network were designed. Effect of targets classification using intuitionistic fuzzy ART neural network was shown by an example.
    Poll multi-criteria feature selection algorithm based on two-step mode
    Di ZHOU Yong-Ming LI
    2009, 29(1):  132-135,. 
    Asbtract ( )   PDF (833KB) ( )  
    Related Articles | Metrics
    For the low precision of feature selection under filter mode and high time cost of feature selection under wrapper mode, one new poll multi-criteria feature selection algorithm was proposed. This algorithm adopted chain-like agent genetic algorithm as searching algorithm, introduced principal criteria strategy to ensure the order of poll, thereby realizing multi-criteria feature selection algorithm. The experiments were conducted to compare this algorithm and several other feature selection algorithms. The experimental results show that this algorithm can obtain better precise selection result than several single evaluation criterion feature selection algorithms under filter mode, and less selection time cost than feature selection algorithm under wrapper mode.
    A Data Association Method of SLAM Based on Ant Colony Algorithm
    2009, 29(1):  136-138,. 
    Asbtract ( )   PDF (609KB) ( )  
    Related Articles | Metrics
    A new data association algorithm based on Ant Colony Algorithm (ACA) was proposed to deal with the data association problem for Simultaneous Localization And Mapping (SLAM). Using the advantages of ACA in resolving the problem of combination and optimization, the problem of data association was transformed into combinational optimization problem and the ant colony algorithm was used to associate the measurements and features together with Joint Maximum Likelihood (JML) theory. The detailed approach was given and the algorithm model was constructed. At last, the presented algorithm was tested under certain simulation environment. The results show the superiority of the presented method in data association of SLAM. It reduces computation cost and maintains better association efficiency and it is a feasible method to deal with the problem on data association of SLAM.
    Simulation of hybrid genetic tabu algorithm for quasi-bus rapid transit scheduling optimization with multi-line
    Zhi-cheng Li Fang Wu Chen Xu
    2009, 29(1):  139-142. 
    Asbtract ( )   PDF (551KB) ( )  
    Related Articles | Metrics
    This paper focused on the scheduling problem for Quasi-Bus Rapid Transit with multi-line based on the maximum of the social benefit and enterprise profit. The multi-object math-emtical model of scheduling was established, of which hybrid genetic tabu algorithm was designed for B-asing according to the characteristics of the problem. The model has been validated through surveyed data of the public bus station in Long Gang district of Shenzhen city. The result and analysis show that this algorithm is more efficient than genetic algorithm and tabu search on solving this problem.
    Named entity recognition for short text
    Xin-Hua FAN
    2009, 29(1):  143-145,. 
    Asbtract ( )   PDF (620KB) ( )  
    Related Articles | Metrics
    Aiming at the urgent task of named entity recognition for short text, a fast and effective method was proposed. The method comprised three steps: Firstly, according to the disturbance of non-standard expression in short text, the elimination of interferential characters and text simplification were adopted. Secondly, according to the non-integrity of short text, Hidden Markov Model (HMM) was employed to preliminarily name entity recognition, in which the part of speech was used as observed value. In the end, by means of the preliminary recognition result, a pinyin co-referential relation library was established to identify the potential entity. The experiment on the test-set including 8464 short texts shows that this method has better performance to named entity recognition for short text.
    Vector quantization based on the dynamic threshold of speaker recognition
    Ming Kang Cheng Liang Wang
    2009, 29(1):  146-148. 
    Asbtract ( )   PDF (432KB) ( )  
    Related Articles | Metrics
    Code splitting threshold is one of the important factors to initialize codebook in Speaker Recognition based on the Vector Quantitation (VQ), but traditional threshold is not easy to determine and needs a large number of experiments to determine the value. This paper used dynamic and random method to select the threshold in a certain range, and combined with differential cepstrum thresholds to establish speaker recognition model. The results show that given the method improves the recognition rate, the training time and the recognition time have improved significantly.
    Information security
    Developing model for pervasive computing environments based on static-dynamic trust
    Jing XUE Liang HE Meng QIU
    2009, 29(1):  149-151,. 
    Asbtract ( )   PDF (622KB) ( )  
    Related Articles | Metrics
    To resolve the limitations in the integrality of evidence used for the trust judgment in pervasive environments, a new trust model was proposed based on the analysis of the four trust evidence. In this model, the trust was classified into two groups: namely static trust and dynamic trust. Furthermore, the workflow of the model as well as the method of updating trust was described. By using this model, the reliable trust relationship can be set up between pervasive entities, which can enhance the security performance of the pervasive environments.
    Growth model in network malicious code family
    黎明 左
    2009, 29(1):  152-154. 
    Asbtract ( )   PDF (433KB) ( )  
    Related Articles | Metrics
    The status and features of development of the malicious codes were analyzed. According to the characteristic of virus variation and the life cycle of the malicious codes, a new mathematic growth model in network malicious code family was given. At last, the mathematic model was verified. Comparison between the predicted result made by this model and the real propagation data shows that the model gives a better description of the increase in network malicious code family.
    Clustering algorithm for Ad Hoc network based on spreading activation model
    2009, 29(1):  155-157. 
    Asbtract ( )   PDF (501KB) ( )  
    Related Articles | Metrics
    Security factors and their impacts on network performance are not considered simultaneously in traditional clustering methods. As for this problem, a novel trust relation based clustering algorithm for Ad Hoc network was proposed, which combined the spreading activation model, an organization structure for human long-term memory, with trust relation graph, and can partition the whole network into many clusters according to limited local knowledge automatically. Simulation results show that the newly proposed distributed algorithm has good clustering accuracy similar to the centralized clustering approach, that is to say, it can improve the performance of Ad Hoc networks, and at the same time can improve its security.
    Structured digital multisignature algorithm based on elliptic curves
    2009, 29(1):  158-160,. 
    Asbtract ( )   PDF (544KB) ( )  
    Related Articles | Metrics
    A structured digital mulitsignature allows signers to sign messages in compliance with specified signing structure, which can be sequential, broadcasting or combination of them. This paper firstly presented an algorithm with sequential structure, for this algorithm, that pubic keys were produced by the reverse signature order was essential to implementation, then the structure was expended to a new one where some nodes were changed to dummy ones composed by some signers whose signature is broadcasting, and the algorithm was mended for a new structured multisignature algorithm. Both of them were based on Elliptic Curve Cryptosystem (ECC) and had high security. Finally, the two algorithms were simulated through experiments.
    LU matrix key pre-distribution scheme with authentication
    Chow Andy weidong qiu mi wen
    2009, 29(1):  161-164. 
    Asbtract ( )   PDF (552KB) ( )  
    Related Articles | Metrics
    The key pre-distribution based on LU composition of symmetric matrix is an effective approach to the Key management in the Wireless Sensor Networks (WSN). But there exists the possibility of failing to build the common communication key. To fix this defect and decrease communication traffic, a key pre-distribution scheme with authentication mechanism was proposed, which was based on the LU matrix scheme. Through optimizing the key pre-distribution scheme, we prove that the average communication traffic decreases by 16.7%. At last this scheme’s implementation in the Sun Spot Sensor and a detailed performance analysis were given out.
    Novel visible watermarking of text image reject against binarization attack
    2009, 29(1):  165-167. 
    Asbtract ( )   PDF (431KB) ( )  
    Related Articles | Metrics
    Some text image visible watermark algorithms will be destroyed by the binarization attack. Therefore, a novel visible watermarking of text image based on the uniform distribution of gray level was proposed. The probability filtering technique was applied to control the embedding intensity of visible watermark while the text image and watermark were mapped into the same gray range. Being experimented with the visible watermarked object, it reveals that this watermarking is of uniform distribution of gray level which helps reject to binarization attack and obtain good robustness.
    Solution of Windows files security protection based on file system filter driver
    HU Hong-Yin
    2009, 29(1):  168-171. 
    Asbtract ( )   PDF (635KB) ( )  
    Related Articles | Metrics
    In order to solve the problem that enhancing files security needs high cost, a solution to Windows files security protection with low cost was proposed. It was based on Windows NT driver and file system filter driver to encrypt and decrypt the files. File content was encrypted with fast symmetrical encryption algorithm, and every file had one encryption key. File encryption key was encrypted with safer asymmetrical encryption algorithm, and encrypted encryption key was saved in the encryption key file. Through storing the private key in the U disk, the system security was enhanced. Additionally, a method of encrypted file share was introduced into this paper. Analysis and application results show that when the memory is lost, administrator password is cracked and files are shared, and the solution can enhance file security with low cost.
    Verifiable hierarchical threshold multi-secret sharing scheme
    Ying－Ying MAO Yan－shuo Zhang
    2009, 29(1):  172-174. 
    Asbtract ( )   PDF (435KB) ( )  
    Related Articles | Metrics
    In the current multi-level secret sharing scheme, the presence of higher-level participants could be replaced by several lower-level participants. As to the multi-secret sharing scheme, secrets could only be shared under the same level. To eliminate the two limitations, based on Birkhoff Interpolation and the intractability of discrete logarithm, a new verifiable hierarchical threshold multi-secret sharing scheme was proposed. This scheme simultaneously maintained multiple levels and multiple secrets for every threshold level. Every participant kept one sub-secret only, which was convenient to manage and use.
    Hidden process detection technique based on memory search
    He-Jun Hu Ming-Yu Fan
    2009, 29(1):  175-177,. 
    Asbtract ( )   PDF (598KB) ( )  
    Related Articles | Metrics
    To research the existing hidden process detection techniques and its anti-detection techniques in Windows, a new detect method based on the memory search was brought forth and its performance was improved. This technique made use of the inherent characteristics of process to traverse the system address space for establishing integrated process list, and then detected hidden process. Experiments show that this detection method is of higher reliability, efficiency and integrity.
    Detecting worms based on candidate combination frequent pattern in Internet backbones
    Yang Su
    2009, 29(1):  178-180. 
    Asbtract ( )   PDF (586KB) ( )  
    Related Articles | Metrics
    The present worm detection methods have been mostly based on packets and less with IP flows in Internet backbones. They also cannot accurately describe the worm’s scan-pattern. A method was presented to detect worms in Internet Backbones with flow data circumstance. First, find suspicious hosts by checking the increasing coefficients of Flow Activity Degree and Destination IP Address. Then, detect worms based on Candidate Combination Frequent Pattern Mining (CCFPM) algorithm. The results show that this method can effectively find out unknown worms and attackspattern of ports.
    Intrusion detection method based on rough set and adaptive boost
    2009, 29(1):  181-184. 
    Asbtract ( )   PDF (680KB) ( )  
    Related Articles | Metrics
    To solve the problem of high rate of false negatives and false positives of IDS, an intrusion detection method was proposed in this paper, which combined Rough Set and Adaboost algorithm. Rough set was used to reduce amount of Adaboost’ training data and improve running speed. Adaboost was a learning algorithm for constructing accurate classifiers. It can obtain a strong learning algorithm by combining a series of weak learning algorithms through some rules. The experimental results show that the model has high detection rate and detection efficiency.
    Research of RBAC model based on XML graph
    Yu-Xin WANG Zheng WANG He GUO Tian-Yang LIU Jia TIAN
    2009, 29(1):  185-188. 
    Asbtract ( )   PDF (551KB) ( )  
    Related Articles | Metrics
    In order to overcome the shortages of role inheritance and constraint in Role-Based Access Control （RBAC）, an improved XML-described RBAC3 model was put forward. This model implemented multi-inheritance by attribute reference, protected the private permissions by private inheritance and simplified the implementation of Separation of Duty （SoD） by mutual exclusive permissions.
    Articles
    Motivation-based association rule mining
    Xu-Hui LIU Shi-Huang SHAO Guang-Zhu YU
    2009, 29(1):  189-192. 
    Asbtract ( )   PDF (518KB) ( )  
    Related Articles | Metrics
    The existing algorithms for support-based Association Rule Mining (ARM) cannot find the itemsets that are not frequent but have high utility values, while Utility-Based Association Rule Mining (UBARM) cannot find the itemsets whose utility values are not high but the product of the support and utility of the same itemset (defined as motivation) is very large. This paper proposed motivation-based association rule and a down-top algorithm called HM-miner to find all high motivation itemsets efficiently. By integrating the advantages of support and utility, the new measure, i.e., motivation can measure both the statistical and semantic significance of an itemset. HM-miner adopted a new pruning strategy, which was based on the motivation upper bound property, to cut down the search space.
    Research and implementation of quantitative nutritional diagram algorithm for pregnant woman
    bo chen le WANG
    2009, 29(1):  193-195,. 
    Asbtract ( )   PDF (562KB) ( )  
    Related Articles | Metrics
    The present healthcare system can only provide qualitative nutritional analysis for pregnant women; to address this issue, a nutritional diagram evaluation method was proposed. It integrated the information of the subject’s actual requirement of nutrients, actual intake value and the lack or excess status to formulate a quantitative assessment. The diagram of main nutrients for Chinese residents had been implemented using database technology and made possible the individualized nutritional guidance based on visualized, systematic and quantitative nutritional analysis. This algorithm has been applied in Quantitative Nutritional Guidance System and has been proved effective to pregnant women.
    Multi-source automatic annotation for deep Web
    CUI Xiao-Jun PENG Zhi-Yong ZENG Cheng
    2009, 29(1):  196-200. 
    Asbtract ( )   PDF (795KB) ( )  
    Related Articles | Metrics
    A large number of data on the World Wide Web are hidden behind form-like interfaces. These interfaces interact with a hidden backend database to provide answers to users’ queries. But results returned by Web databases seldom have proper annotations, so it is necessary to assign meaningful labels to them. A framework of multi-source automatic annotation that used multi-annotator to annotate results from different aspects was proposed, especially searching engine-based annotator constructs validate queries and posting them to the search engine. It found the most appropriate terms to annotate the data units by calculating the similarities between terms and instances. Information for annotating can be acquired automatically without the support of domain ontology. Experiments over four real world domains indicate that the proposed approach is highly effective.
    Web cartographic generalization based on database generalization and SVG
    Xiankun Yang 杨现坤
    2009, 29(1):  201-204. 
    Asbtract ( )   PDF (635KB) ( )  
    Related Articles | Metrics
    A new approach using spatial indexing mechanism called z-values was proposed in order to improve the efficiency of Web cartographic generalization and represent spatial data with different scales. The method can effectively filter unrelated spatial data and derive spatial data with proper level of details. So this approach can effectively improve the efficiency of spatial data transmission across the Internet. The application server pushes vector descriptions to an SVG client for displaying. An SVG file can be edited effectively in simple text editors and can be generated easily from server-side tools. In addition to faster download speeds, the SVG’s interoperability is also demonstrated. The experiment shows our approach is more efficient than the traditional one.
    Cache replacement algorithm of OLAM based on work warehouse
    2009, 29(1):  205-208. 
    Asbtract ( )   PDF (609KB) ( )  
    Related Articles | Metrics
    On-Line Analytical Mining （OLAM） combines the on-line, mobility of OLAP and in-depth of Data Mining (DM), and it helps integrate the advantages of each other. When the traditional architecture of the OLAM is used to deal with massive data, it often results in a low exploitation rate of repeated data and a long running time. This paper concerned the time consumption during the data-processing of decision analysis and the diversity of data-requirement, and then put forward a new architecture of OLAM based on work warehouse and designed a new algorithm for data cache replacement. This algorithm used the factor of Valueable to judge the data replacement of cache space. On the premise of peak efficiency, it enhanced the accuracy of cache replacement. At the same time, the architecture was applied to the Medical Insurance DSS for Urban Resident and showed good effect.
    Dynamic probe based strategy for deadlock prevention in distributed systems
    Chen LI
    2009, 29(1):  209-212. 
    Asbtract ( )   PDF (650KB) ( )  
    Related Articles | Metrics
    Deadlock detection and prevention of transaction are very important to concurrency and integrity in database systems. Based on investigating the existing strategies of deadlock prevention in distributed database systems, an improved strategy of deadlock prevention was proposed, which used the Dynamic Probe (DP) technology. The DP method created the probe and sent it to the nodes where the deadlock may exist. After receiving the probe, the nodes compare their own information to that of the probe's. The comparison results showed whether a deadlock had been generated. By this way, the presented approach can be employed to prevent the deadlocks. Analysis shows that the proposed strategy increases the effectiveness of the deadlock prevention and the utilization of system resources.
    Mining Web community based on improved maximum flow algorithm
    Jin-Zeng ZHANG FAN Ming
    2009, 29(1):  213-216. 
    Asbtract ( )   PDF (556KB) ( )  
    Related Articles | Metrics
    Given that the original maximum flow algorithm set a fixed edge capacity to each edge, which caused poor quality and improper size of communities, this paper proposed an improved algorithm for mining Web communities. The algorithm considered the differences between edges in terms of importance, and assigned different capacities to different edges by transforming the significant measurements of pages evaluated by weighted PageRank algorithm to edge-transferring probability scores to measure the importance of edges, and assigning them to corresponding edges as their capacities. The experimental results show that the improved maximum flow algorithm improves the quality of Web community effectively.
    Modified word similarity computation approach based on HowNet
    2009, 29(1):  217-220. 
    Asbtract ( )   PDF (644KB) ( )  
    Related Articles | Metrics
    HowNet is a lexical base with rich semantic information. It uses 1618 sememes to describe words. The related words have the same sememe when they are described by the HowNet. Combined with the current computation algorithm of the words' similarity, the paper proposed an improved algorithm to compute the similarity between the related words. It also introduced concept about weak sememes and excluded such sememes' interference when they appeared in the computation of the word's similarity. The experiment proves the improved word similarity computation meets the peoples' intuition and text mining better.
    Typical applications
    Intelligent order online negotiation model with incomplete information of opponent
    HongYun Ning Jinlan LIU Degan ZHANG
    2009, 29(1):  221-223,. 
    Asbtract ( )   PDF (611KB) ( )  
    Related Articles | Metrics
    For the problem of high delay rate and high failure rate of order online negotiation, based on Zeuthen Strategy, a novel multistage multilateral co-evolution algorithm was proposed. The algorithm applied a new role of agent called coordinator (CO) to effectively control the multilateral negotiation process, and caught the optimal extent of concession with Bayesian Learning by gradually amending the probability distribution of opponent's reserve-price valuation-vector and dynamically adjusting ones own business bid-curve. Combining the synchronous kicking-out mechanism, invalid consultation was avoided. The experimental results show the proposed method sufficiently captures the opponent's information to help agents duly update their belief, and the utility of negotiation behavior is obviously improved.
    Pragmatics Web services discovery based on concept meaning of participants context
    Sheping Zhai Juanli Wei Zengzhi Li
    2009, 29(1):  224-226,. 
    Asbtract ( )   PDF (569KB) ( )  
    Related Articles | Metrics
    In order to make a better agreement on both the discovery results of Semantic Web services and the intentions of the service requester, advance the accuracy rate of service discovery, and improve the automation performance in service discovery and selection, the context knowledge of service provider and requester was added into service description, and the planning method was employed to achieve the meaning understanding for the private ontology concepts between service participants. Experiments using the standard services test sets show that the performance of service discovery was improved significantly, though the discovery was delayed. In particular, when domain ontologies that are used to describe concerning services have many semantics difference, the result of discovering services is more precise.
    Audio source separation based on Hilbert-Huang transform
    Chao-zhu ZHANG Jian-pei ZHANG Xiao-dong SUN
    2009, 29(1):  227-229,. 
    Asbtract ( )   PDF (568KB) ( )  
    Related Articles | Metrics
    The energy frequency distribution of non-stationary signal could not be got correctly with short-time Fourier transform. A new method was proposed to separate the audio sources from a single mixture based on Hilbert-Huang transform. Hilbert transform combined with Intrinsic Mode Functions (IMFs) constituted Hilbert Spectrum (HS) of mixture, which was a time-frequency representation of a non-stationary signal. The HS of mixture was used to derive the independent source subspaces. The time domain source signals were reconstructed by applying the inverse transformation. The simulated results show that the proposed method is efficient and improves the separation performance. It was observed that HS-based TF representation performed better than using STFT.
    Optimization of neural network with fixed-point number weights and its application
    Jian Bao
    2009, 29(1):  230-233. 
    Asbtract ( )   PDF (600KB) ( )  
    Related Articles | Metrics
    In order to make the neural network application suffice the demands of double-quick computing and tidy memory capacitance in embedded systems, an optimization method of neural network with fixed-point number was proposed. The neural network weights were represented with the precision-adjustable fixed-point number and the neural network was trained by using the genetic algorithm. And the continuous nonlinear activation function of the neuron was transformed into discrete and linear function by the least-squares algortithm. Then, the optimal neural network was applied to a touch-screen-LCD adjusting model for verifying its feasibility. Experiments show that this touch-screen-LCD calibration method has higher accuracy compared with the traditional one.
    Application research of T/TCP protocol in VxWorks
    Xiao-Ming GAO
    2009, 29(1):  234-237. 
    Asbtract ( )   PDF (653KB) ( )  
    Related Articles | Metrics
    Due to the inherent features such as 3-Way HandShake (3WHS) process and TIME_WAIT state, transmission control protocol (TCP) is not efficient enough in processing connection with short duration and little communication data, which restricts its application in embedded environment. After analyzing these restrictions, we proposed adopting transaction TCP (T/TCP) to solve these restrictions, and then implemented T/TCP in embedded system VxWorks. Experimental result shows that T/TCP has better performance than TCP in embedded system.
    Method of HW/SW partitioning based on NSGA-II
    Xiao-zhang LU
    2009, 29(1):  238-241. 
    Asbtract ( )   PDF (568KB) ( )  
    Related Articles | Metrics
    HW/SW partitioning is a key issue in HW/SW co-design of embedded system. In this paper, NSGA-II was applied to HW/SW partitioning. Each run of the algorithm can produce many Pareto-optional solutions. The satisfactory solution can provide an effective tool for measuring the performance of different objective functions, and impove the designing efficiency. The results show that the method can get global optional solutions to fulfill system performance constraint for embedded system.
    Study on algorithm of intelligent disassembling in tracking mode
    Long-Jie ZHANG
    2009, 29(1):  242-244. 
    Asbtract ( )   PDF (401KB) ( )  
    Related Articles | Metrics
    This paper made a research on the issues in disassembling embedded system files, and brought about three core algorithms to do intelligent disassembling in tracking mode. It adopted binary tree to dispose the process of scanning for the first time, and offered a recursion traverse algorithm to grow the binary tree, which overcame the disadvantage of establishing many arrays, tables and diagrams in traditional ways. By browsing the binary tree in a reverse direction, it resolved the problem of searching indicate addresses, and provided a correlation algorithm. In the end the paper brought forward an algorithm to checkout the data block boundary. The work of this paper has great reference value to program disassembling as well as software reverse engineering.
    Parallel ray casting algorithm based on muti-core cell processors
    Gao-Feng Feng
    2009, 29(1):  245-247,. 
    Asbtract ( )   PDF (564KB) ( )  
    Related Articles | Metrics
    How to make full use of high performance of multi-core heterogeneous platform to support practical application is becoming a new research hotspot. Take graphic algorithms for example, depending on balance allocation study of Ray Casting, the paper proposed a designing method to develop a parallel ray casting application in Cell B. E multi-core heterogeneous system with function decomposition and the row-block static allocation. SMID method was used to optimize the performance. Testing results show that the speedup and scalability is fine, and the performance in Cell is 14 times better than SMP server.
    Method of software intelligent deployment
    2009, 29(1):  248-252. 
    Asbtract ( )   PDF (686KB) ( )  
    Related Articles | Metrics
    This paper focused on software intelligent deployment which can adjust the software deployment process according to different environments. First, it analyzed the existing software deployment tools, proposed the concept, the framework and the workflow of the software intelligent deployment. Then it introduced and analyzed the standardized description language software and client information model description. On this basis, it proposed the intelligent deployment software algorithm, which can automatically adjust the software process according to different environments. Finally it compared and analyzed the actual effect of software intelligent deployment.
    Research of incremental clustering algorithm for optical inspection Windows placement problem
    Ling Zhong
    2009, 29(1):  253-255. 
    Asbtract ( )   PDF (397KB) ( )  
    Related Articles | Metrics
    To solve the inspection windows placement problem of automatic optical inspection system, an incremental clustering algorithm was presented. Inspection objects can be clustered by checking the cluster windows' validity dynamically. Experimental results indicate the algorithm can overcome the drawback of evolutionary algorithm that needs great computation. Meanwhile the algorithm can fast determine the inspection windows when the inspection objects number is below 1000.
    Design and implement of redundant OPC data acquisition system
    2009, 29(1):  256-257,. 
    Asbtract ( )   PDF (417KB) ( )  
    Related Articles | Metrics
    To improve the system availability, a software-based OLE for Process Control （OPC） redundant data acquisition system was designed and developed. The hot spare redundancy system used two OPC servers; it can switch fast, has no disturbance and is easily applicable.
    Real-time simulation of radar scanning based on particle system in OpenGL
    WU Yin-Xia Lei-Ting CHEN Ming-Yun He
    2009, 29(1):  258-260. 
    Asbtract ( )   PDF (397KB) ( )  
    Related Articles | Metrics
    Simulation of radar scanning is one of the difficulties in the visual simulation of battlefield situation. To introduce a real-time simulation method of three-dimensional scanning radar based on particle system. According to the rule of radar scan, the traditional particle system model was changed, and the radar afterglow particles were rendered with point. It was implemented on Personal Computer with OpenGL. The result shows that the method is able to meet the needs of reality and real time.
    Object-oriented design and implementation for multi-type mixed operation
    Zhonghua Jiang
    2009, 29(1):  261-264. 
    Asbtract ( )   PDF (531KB) ( )  
    Related Articles | Metrics
    Through studying multi-type arithmetic in many systems, it is found that the existing solutions are not flexible. Process-oriented solution and two potential object-oriented solutions were given and their shortages were analyzed. To achieve flexibility, reusability, maintainability and efficiency, a two-layer virtual table object-oriented solution was proposed based on agile design policy and the Open-Closed Principle (OCP). Analysis shows that the solution is relatively good.
    Study on indicators selection of recycling enterprise process performance measurement software
    Da-Feng XU Qing LI Xin LIU Yu-Liu CHEN
    2009, 29(1):  265-268,. 
    Asbtract ( )   PDF (712KB) ( )  
    Related Articles | Metrics
    Since the current process performance measurement software for recycling enterprise was lack of practical models and appropriate methodology to direct the identification and selection of process performance indicators, this paper firstly brought forward a formal model of recycling enterprise process performance indicators selection based on fuzzy covering set, which highlighted the alignment with enterprise strategy. Then, under the guidance of Balanced Scorecard philosophy, this paper constructed an instantiated model of Recycling Enterprise Process Performance Indicators Selection with Strategic Alignment (SA-REP2IS), which can correlate the strategy of recycling enterprise and the related performance indicators. A corresponding problem-solving strategy for the model was also proposed. Finally, a case study was given to illustrate the application of the above proposed methods.
    Analysis of similarity of DNA sequences based on a measure of information discrepancy
    2009, 29(1):  269-272. 
    Asbtract ( )   PDF (558KB) ( )  
    Related Articles | Metrics
    Function of Degree of Disagreement （FDOD) has been successfully applied to the research of bioinformatics. Its performance is greatly impacted by the length of subsequence, when the information included in a sequence is described by its subsequence distribution. In this paper, we proposed a new representation called base-base information set to characterize the sequence, then computed the distance between two sequences by FDOD. The base-base information set comprises the joint probabilities of base pair at a distance of 1 to L, where L is an alterable parameter. Also we analyzed how the distance changes when L is changed. As the experimental result shows, the distance between two sequences is insensitive to the change of L when they are closely similar, so our method is effective for analyzing similarity of sequences.
    Analysis of GA in overlay-based NCS
    2009, 29(1):  273-276. 
    Asbtract ( )   PDF (539KB) ( )  
    Related Articles | Metrics
    Because of random and uncertain delay, Internet can not guarantee QoS requirements of Internet-based remote Networked Control System (NCS), such as real-time performance, thus affecting the stability of NCS. This paper combined the data transmission characteristics of remote NCS, using Overlay Network to improve the basic network QoS services and genetic algorithm and simulated annealing to optimize Overlay Network costs. These strategies can guarantee the reliability of remote NCS. It was illustrated through the simulation experiments that the strategies in the paper can minimize Overlay Network total costs on the basis of meeting the delay requirements of the remote NCS. It was helpful to the deployment of the control system in the Internet.
    Application of neural network-based expert system in drilling fault diagnosis
    2009, 29(1):  277-280. 
    Asbtract ( )   PDF (651KB) ( )  
    Related Articles | Metrics
    Combining the practical conditions and the drilling variables, the drilling fault diagnosis system utilizing the Artificial Neural Network (ANN) to obtain the knowledge and the expert system to reason and diagnose the faults was designed. The knowledge was acquired through constantly learning and training the ANN with varieties of the intricate drilling problems. The definite diagnosis results can be drawn by the reverse reasoning of the expert system. According to the results the drilling parameters will be adjusted automotively. The drilling fault diagnosis system has proved to be practical and effective by the living examples.
    Articles
    Advanced Epidemic routing with low resource consumptionin delay tolerant network
    2009, 29(1):  281-283. 
    Asbtract ( )   PDF (385KB) ( )  
    Related Articles | Metrics
    Delay Tolerant Network (DTN) architecture, covering wireless sensor networks and Ad Hoc networks, has very broad application prospects in military and scientific research. And it is emerging at the forefront of one of the new studies. But the study is still at its premature stage, and many mechanisms need to be developed or improved. In DTN, how to design an efficient routing algorithm is one of the key issues. Compared with traditional networks, the objective of DTN routing is not to transmit message at lowest cost, but to maximize the possibility of message delivery. Epidemic algorithm is simple but blind-routing strategy. This paper tried to improve the performance by using information of messages, connection opportunity and stability. Based on the analysis of the simulator ONE, I implemented the algorithm and analyzed the performance. At the end of the paper advantage and weakness were summarized.
    Cooperative network intrusion detection based on data fusion
    Wei ZHANG Shao-Hua TENG Xiu-Fen FU
    2009, 29(1):  284-287,. 
    Asbtract ( )   PDF (887KB) ( )  
    Related Articles | Metrics
    Based on multi-agents and data fusion, a model of cooperative network intrusion detection was built. Its architecture and components were given. The content features, intrinsic features and traffic features were extracted from network packets for network intrusion detection. A group of detection agents for intrusion events were designed and implemented. They were classified into feature-based detection agents and statistic-based detection agents. Fusion center was used to improve the detection effect. At last, this model was verified by experiments.
    Improved digital certificate mechanism based on ECC in WiMax system
    2009, 29(1):  288-290. 
    Asbtract ( )   PDF (469KB) ( )  
    Related Articles | Metrics
    X.509 digital certificate provides a basic means for mutual authentication between the subscriber station (SS) and base station (BS) in WiMax network. X.509 digital certificate was improved by Elliptic Curve Cryptography (ECC) algorithm. Its improving principle and implementation scheme were proposed. The performance analysis shows that the working mechanism of primitive X.509 digital certificate is maintained, moreover, the security of mutual authentication in IEEE802.16e is guaranteed.
    Job service model and scheduling algorithm based on grid technology in campus network
    Jing-Lian HUANG Shao-bo ZHONG
    2009, 29(1):  291-282,. 
    Asbtract ( )   PDF (429KB) ( )  
    Related Articles | Metrics
    In order to eliminate the isolated information, share distributed resources and save relevant cost in the campus network, a model that used the grid technology to schedule job was designed and implemented, and a job scheduling method was designed based on reliability genetic strategy. This algorithm integrated the advantage of genetic algorithm, which enabled scheduling system to exhibit a certain degree of self-determination and intellectuality. From the analysis and experimental result, it is concluded that it has the characteristics of rapid convergence, good global search capacity, and is superior to genetic algorithm and Min-min algorithm as well.
    Improved BIRCH clustering algorithm
    shen-yi Jiang 李霞 Li Xia
    2009, 29(1):  293-296. 
    Asbtract ( )   PDF (575KB) ( )  
    Related Articles | Metrics
    BIRCH algorithm is a clustering algorithm suitable for very large data sets. In the algorithm, a CF-tree is built whose all entries in each leaf node must satisfy a uniform threshold T, and the CF-tree is rebuilt at each stage by different threshold. But how to set the initial threshold and how to increase the threshold of each stage are not given. In addition, the algorithm can only work with "metric" attribute, which makes its application restrained. This paper made some improvements on BIRCH algorithm: 1) Changed CF structure so that heterogeneous attributes could be manipulated; 2) Gave a heuristic method of getting initial threshold and increasing threshold of second stage of the algorithm; 3) Discussed the algorithm's parameter B and L and found that the algorithm had equal performance when B=L, at last, gave a sound scope for B. Experimental results on public data sets show that the improved algorithm has preferable performance.
    Research of distributed coordinated management of spatial date based on division of GML vector map layer
    Bo GAO Chao-zhen GUO Shan-Jing DING
    2009, 29(1):  297-300,. 
    Asbtract ( )   PDF (749KB) ( )  
    Related Articles | Metrics
    This paper researched the disadvantage of the traditional GIS and put forward a distributed coordinated management of spatial date based on division of GML vector map layer. GML was used to model the spatial date. Because GML was based on XML, the GML was parsed with XML technique. The algorithm of the division of the GML spatial date, and the distributed spatial data base and the metadata base were designed. The distributed spatial data base was sorted by regional geographic position, and the spatial metadata base was used to help manage the spatial data base and place the data while looking up data. In addition, the global coordinated module was designed to manage the release and the query of the spatial data, also to coordinate the storage and the getting of the spatial data, and we locked the data in use to deal with the multi-user concurrent.
    UbiComp-based model of cooperative design system for engineering
    2009, 29(1):  301-303. 
    Asbtract ( )   PDF (476KB) ( )  
    Related Articles | Metrics
    The modeling characteristics of architecture engineering cooperative design system were discussed. Based on the foregone work, a net-based system of architecture engineering cooperative design system, the concept of "physical cooperative" was proposed. The model of "cooperative institute of architecture design" was schemed, and the methods of information communion and data communion were discussed. Then the principles of implementation for "cooperative institute of architecture design" were explained. Finally, the implementation of the system was represented. It is proved that this theoretical model is feasible and valuable.
    OLAP-based collaborative educational decision
    2009, 29(1):  304-305,. 
    Asbtract ( )   PDF (466KB) ( )  
    Related Articles | Metrics
    In the construction of education information system, lots of business data have been accumulated. How to use historical data for collaborative decision-making is very important. Several collaborative decision-making themes were introduced and multi-dimensional cubes were designed. Then On-Line Analytical Processing (OLAP) was performed and the corresponding results were given. These accelerate the application of data warehouse and OLAP in educational decision and improve the ability of the analysis and the level of decision for educational data.
    Research on problems in visual programming languages based on fisheye views algorithm
    Xia-jiong SHEN Jun GU Ge WANG Xin-fa DONG
    2009, 29(1):  306-308,. 
    Asbtract ( )   PDF (596KB) ( )  
    Related Articles | Metrics
    The visual problems in traditional 2D visual programming languages where programming elements are represented by 2D graphical objects were analyzed. An improved fisheye views algorithm was introduced to deal with these problems. A prototype system VPMF was developed to show the validity and effectiveness of the approach.
    Node localization in wireless sensor networkbased on vectors and particle swarm optimization
    Yufeng Wang Yan Wang
    2009, 29(1):  309-311. 
    Asbtract ( )   PDF (483KB) ( )  
    Related Articles | Metrics
    An integrated algorithm based on DV-Hop was designed. A Location Correction Vector（LCV）was constructed by the differences between estimated distances and range measurements. Nodes were clustered when the anchors were the heads of clusters, object function expressing total distances error was constructed in a cluster, Particle Swarm Optimization (PSO) was used to solve the minimization problem, and then correction steps of all member nodes were obtained. The value of location correction equaled the product of LCV and steps, then extra location correction had been executed by using the relative positions among edge nodes of neighbor clusters. Simulation results show that the localization error of DV-Hop is reduced by 75%, and it is also applicable to low-density networks.
    Wireless Ad Hoc netwrok performance evaluation by IWPA and SVMDT
    2009, 29(1):  312-314. 
    Asbtract ( )   PDF (443KB) ( )  
    Related Articles | Metrics
    Improved wavelet packet analysis and support vector machine were used to evaluate the performance of wireless Ad Hoc network. Experimental results show that the performance of Improved Wavelet Packet Analysis (IWPA) is much better than Wavelet Packet Analysis (WPA) and WT (wavelet transform). And the method of SVMDT is superior to RBF SA (simulated annealing). That IWPA combines SVMDT can get the best effect.
    Research and design of Internet information retrieval personalized service
    Gu Mu-Dan
    2009, 29(1):  314-316. 
    Asbtract ( )   PDF (445KB) ( )  
    Related Articles | Metrics
    Since the existing information retrieval service has some deficiency, this paper proposed and implemented an improved personalized information retrieval service model. This model was achieved mainly through three modules: the establishment of Users interested model, the optimization of Multi-weight Ranking Algorithm (MWRA), the establishment of user information model freely pushing mode. At last, this paper gave out the experimental results and analyses about the traditional information retrieval model and the new one.
    Workflow process definition tool based on reuse - PDTBR
    Xiao-Qing GONG Feng LIU Wei GE Ke-Gang HAO
    2009, 29(1):  315-318. 
    Asbtract ( )   PDF (643KB) ( )  
    Related Articles | Metrics
    An approach to define workflow process on the basis of reuse was proposed in order to improve its efficiency. The process for producing and describing the reusable assets, domain business ontology and workflow template were presented here. Moreover, a workflow template retrieval method based on domain business ontology was stated. A reuse-based process definition tool was developed as a result. It has demonstrated that the approach is feasible and more productive in application.
    Research of distributed ETL engine based on multi-agent and workflow
    Jin DING Chao-zhen GUO
    2009, 29(1):  319-322. 
    Asbtract ( )   PDF (622KB) ( )  
    Related Articles | Metrics
    Aiming at the deficiency of centralized execution mode of traditional Extraction-Transformation-Loading (ETL) tools, this paper put forward the architecture of distributed ETL engine based on the combination of multi-agent and workflow technique, which consists of one main engine and many executive engines. The executive engines can register execution services to the main engine independently, and an ETL Workflow can be executed cooperatively on several executive engines by using distributed and concurrent computing technique, which improves the system's flexibility and throughput rate. Finally, results prove that it has better expansibility and can achieve load balancing quite well and raise the performance efficiency.
    Quality of service estimation research based on the AGWL grid workflow model
    Jin-Zhong Li
    2009, 29(1):  323-325. 
    Asbtract ( )   PDF (405KB) ( )  
    Related Articles | Metrics
    With regard to the lack of research for QoS composition in ASKALON grid workflow management system, this paper presented a QoS estimation algorithm for grid workflow based on Abstract Grid Workflow Language (AGWL) grid workflow model. Three main features of the algorithm are: 1) Based on AGWL; 2) Scalable QoS metrics model; 3) Multi-dimensional global QoS metrics. Lastly, the feasibility of the algorithm is validated through simulation experiment.
    Research and realization of role-based data exchange middleware
    2009, 29(1):  326-327,. 
    Asbtract ( )   PDF (506KB) ( )  
    Related Articles | Metrics
    The autonomy, distribution and heterogeneity between business information systems make data exchange become inevitable. The idea of role was introduced. The data exchange demand and the data service of data source for each role were described and represented with XML Schema. Finally, the matching algorithm and architecture to achieve role-based data exchange services were presented.
    Real-time collaborative cartography based on region version by quadtree index
    2009, 29(1):  328-330. 
    Asbtract ( )   PDF (508KB) ( )  
    Related Articles | Metrics
    As the traditional GIS develops towards Internet GIS, the update of maps usually needs the integrated cooperation of several websites. The traditional concurrency control strategy does not satisfy the collaboration awareness of multi-users in cooperative GIS. Therefore, regional version concurrency control strategy by quadtree index was suggested, and its frame and methods for correlative issues were given.
    Updating computing for XML document based on divide-and-conquer strategy
    Zun-Yue Qin Hong-Zhi Xu
    2009, 29(1):  331-333. 
    Asbtract ( )   PDF (460KB) ( )  
    Related Articles | Metrics
    The XML document updating is an important function for managing XML data. The problem of adjusting the coding will occur while inserting XML documents, and most coding schema nowadays cannot support document updating fully. Based on analyzing subsistent coding schema, this paper put forward OMPN schema. By making use of divide-and-conquer strategy and postponing updating, adjusting code is unnecessary in the process of inserting node; while computing resource idle time, adjusting only part of codes will be enough to complete XML document updating. As the experiments show, the method increases the performance of updating XML document.
    Role based access control model based on object-oriented properties and XML
    2009, 29(1):  334-336. 
    Asbtract ( )   PDF (386KB) ( )  
    Related Articles | Metrics
    Since XML can present data in structured way, a new RBAC model based on object-oriented properties and XML was proposed by using Schema and combining object-oriented properties, such as inheritance and overriding to describe the hierarchy RBAC. DOM API was utilized to verify the validity of the new model.
    Design of stateless weight-based routing algorithm for mobile Agent in WSN
    Yu－E SU Qian-ping WANG Li HAO Wan-rong WU
    2009, 29(1):  337-339. 
    Asbtract ( )   PDF (607KB) ( )  
    Related Articles | Metrics
    In order to make the routing of mobile agents no longer depend on the network structure too much, a routing algorithm, called Stateless Weight Routing for Mobile Agent (SWR-MA), for mobile Agents in Wireless Sensor Networks (WSN) was presented. In SWR-MA, a weight metric was introduced which was related to the position of the nodes. By comparing the weights values, mobile Agents can determine their own routes automatically. SWR-MA can be applied when topological information of WSN changes such as in a network with mobile Sinks. The energy consumptions and the delays of the network can be reduced and the reliability of WSN can be improved by this protocol. Finally, a simulation evaluation was made to validate the performance of SWR-MA.
    Research and design of software platform for MANET
    Qing HE Jing-Yi QIU De-Xing XU Jun XU
    2009, 29(1):  340-313. 
    Asbtract ( )   PDF (648KB) ( )  
    Related Articles | Metrics
    Unique features of wireless communication devices, including mobility, personalization and location-awareness engender new types of application，can meet the demands of pervasive and mobile computing. A wireless communication device for Mobile Ad Hoc Network (MANET) was presented. It used embedded Linux to build a mobile computing platform. On the platform, the performance and implementation of AODV and MAODV routing algorithm were studied for MANET by NS-2. Finally, the prototype of wireless communication devices was proposed and its application and future development were discussed.
2024 Vol.44 No.3

Current Issue
Archive
Superintended by:
Sichuan Associations for Science and Technology
Sponsored by:
Sichuan Computer Federation
Chengdu Branch, Chinese Academy of Sciences
Honorary Editor-in-Chief: ZHANG Jingzhong
Editor-in-Chief: XU Zongben
Associate Editor: SHEN Hengtao XIA Zhaohui
Domestic Post Distribution Code: 62-110
Foreign Distribution Code: M4616
Address:
No. 9, 4th Section of South Renmin Road, Chengdu 610041, China
Tel: 028-85224283-803
　　028-85222239-803
Website: www.joca.cn
E-mail: bjb@joca.cn
WeChat
Join CCF
Copyright © 2021 Sichuan Computer Applications Press Co., Ltd.
蜀ICP备 05010208 号　新出网证(川)字026号
Powered by Beijing Magtech Co., Ltd.
Total visits:
Today visits: