Loading...

Table of Content

    01 April 2009, Volume 29 Issue 4
    Information security
    Survey on dependable computing
    Guang-ze XIONG Zheng-wei CHANG Nan SANG
    2009, 29(4):  915-919,. 
    Asbtract ( )   PDF (1408KB) ( )  
    Related Articles | Metrics
    This paper surveyed the development of dependable computing. The basic concepts of dependability were explained, and current research works of dependable computing were introduced. High dependability safeguard techniques for safety-critical systems were proposed. Some future research directions of dependable computing were presented.
    Study on development of trusted computing
    Xin-Qiang MA Yi HUANG dan-ning LI
    2009, 29(4):  920-923. 
    Asbtract ( )   PDF (849KB) ( )  
    Related Articles | Metrics
    Trusted computing is a hotspot of information security research nowadays. It is developed based on computed system. From science computing and fault-tolerant computing to trusted computing, the origin and development of trusted computing were introduced, especially its property, trusted computer system, and architecture and key components of the trusted platform module. The current research and difficult problems of trusted software system have also been summarized.
    Password-based remote user authentication and key agreement protocol
    Li-hua ZHANG Li-pi ZHANG You-guang ZHANG Shan-wei Lü
    2009, 29(4):  924-927. 
    Asbtract ( )   PDF (755KB) ( )  
    Related Articles | Metrics
    Password-based remote user authentication is a hotspot in authentication protocol research. The security of a proposed remote user authentication scheme was analyzed. Whereby it used nonce random and had very low computational costs. However, this scheme still has many security faults. The weakness of the scheme was demonstrated. Password-based remote user authentication and key agreement protocol (PUAKP), a novel nonce and hash-based remote user authentication scheme and key agreement using smart cards were also presented. In order to avoid the risk of message replay attack, the scheme uses nonce random instead of using time stamps. PUAKP has many merits: it lets users freely choose and change password at their own will; it provides mutual authentication between two entities; it has more lower computational costs; it resists man-in-the-middle attack; in addition, it has wrong password sensitivity; and it has password nontransparency to system and strong security reparability. Furthermore, the session key has freshness, confidentiality, known-key security and forward security.
    Hybrid model applied in authentication of grid security
    Chun-ling CHENG Deng-yin ZHANG
    2009, 29(4):  928-931. 
    Asbtract ( )   PDF (862KB) ( )  
    Related Articles | Metrics
    This paper made a systematic analysis on a few of current trust models, provided a new mixed authenticated trust model, and gave a particular frame and function design. Then the study carried out a simulation and property analysis of the new model. The simulation results indicate that the new mixed authentication model can resolve the defaults of the static key mechanism and improve the security of the grid authentication.
    Key management scheme for wireless sensor network based on multiple key spaces
    Song XIE Zhong-wen GUO Hai-peng QU Guang-peng Lü
    2009, 29(4):  932-934,. 
    Asbtract ( )   PDF (834KB) ( )  
    Related Articles | Metrics
    This paper proposed a key management scheme based on the pairwise key predistribution scheme for Wireless Sensor Network (WSN). This scheme combined the q-composite random key predistribution scheme and introduced the location information to enhance secure connection probability between nodes. The analysis results show that this scheme doesn't need additional memory space and increases the probability that neighbor nodes have the same key space. Compared with the pairwise key predistribution scheme, this scheme can increase the threshold of captured nodes and improve the security of WSN, and fits the network environment and meets the security requirements of WSN.
    Research of batch rekeying based on queue model
    Hui LI Yue WU Hai-gang GONG
    2009, 29(4):  935-937. 
    Asbtract ( )   PDF (593KB) ( )  
    Related Articles | Metrics
    In order to offer secrecy for multicast applications, the traffic encryption key has to be changed whenever a user joins or leaves the system. At present, many approaches based upon individual rekeying bring about the out-of-sync and inefficient problems. The paper proposed the batch rekeying based on queue model, which it would rekey when request to live reached zero by setting request to live to the first rekeying request in the queue. The results of analysis and experiment show that it can not only alleviate the out-of-sync and inefficient problems in the individual rekeying, but also decrease key server's rekeying cost and has better flexibility when compared with batch rekeying based on fixed period.
    Complexity measure of chaotic pseudorandom sequences
    Jin-mei LIU Shui-sheng QIU
    2009, 29(4):  938-940,. 
    Asbtract ( )   PDF (788KB) ( )  
    Related Articles | Metrics
    Based on the concepts of primitive production process and eigenword of sequences, the index in primitive production process (IPP) of sequences was defined for measuring the complexity of chaotic pseudorandom sequences. In comparison with bifurcation curves and approximate entropy of simulation results, the efficiency and advantages of the proposed measure are obvious. IPP is superior to approximate entropy for distinguishing sequence complexity.
    Research and implementation of resisting bluetooth PIN attack
    Li-mei WANG Jin-long FEI Xin-zheng HE
    2009, 29(4):  941-943,. 
    Asbtract ( )   PDF (715KB) ( )  
    Related Articles | Metrics
    Based on the detailed analysis on the process of link key generation and the method of PIN code attack, an approach which increased the complexity of PIN code by transforming the input of users PIN code was presented and implemented. The test results show that it can defense PIN code attack effectively and insure the security of bluetooth network when users input the simple PIN code.
    Cryptanalysis and improvement of certificateless proxy signature scheme
    Chen-Huang WU Zhi-xiong CHEN Hai-ming WANG Yi-jun SHEN
    2009, 29(4):  944-946,. 
    Asbtract ( )   PDF (775KB) ( )  
    Related Articles | Metrics
    The certificateless proxy signature scheme proposed by Fan Rui etc. was analyzed and their scheme turned out to be insecure. Furthermore, a serious security flaw was discovered in the proxy key generation algorithm, because the private key of the original signer could be recovered by the proxy signer. Unfortunately, the same security flaw was also found out in other proxy signature schemes. Finally, a comprehensive and improved scheme was proposed, whose security was based on the Computational Diffie-Hellman Problem (CDHP).
    Improvement and security analysis on MD5
    Shao-lan ZHANG Guo-bo XING Yi-xian YANG
    2009, 29(4):  947-949. 
    Asbtract ( )   PDF (570KB) ( )  
    Related Articles | Metrics
    The method of differential analysis on collision attacks against MD5 was analyzed. Considering the increase of message blocks to be hashed via message pre-processing, a new method of modifying the step function of MD5 was proposed. The method can raise the resistibility of collision attack by preventing choosing a good differential path and limiting the use of message modification techniques. The efficiency of the improved algorithm is higher than that of method via message pre-processing.
    Improved remote authentication scheme with smart card
    Xin ZHANG Fang-wei LI Chun-lan PAN
    2009, 29(4):  950-951. 
    Asbtract ( )   PDF (364KB) ( )  
    Related Articles | Metrics
    This paper firstly analyzed some security problems in Lee-Chiu's remote authentication scheme with smart cards, and proposed an improved scheme. Compared with Lee-Chiu's scheme, this scheme can not only provide mutual authentication between clients and sever, but also avoid replay attack, guessing attack and forgery attack, so it can improve the security of the application systems.
    Self-adaptive blind 3D model watermarking algorithm based on surface roughness
    Qiang CHEN Yan TANG
    2009, 29(4):  952-955. 
    Asbtract ( )   PDF (820KB) ( )  
    Related Articles | Metrics
    Aiming at the problem of big distortion caused by using the traditional blind 3D watermarking algorithm under the same restriction of robustness, a self-adaptive blind 3D model watermarking algorithm based on surface roughness was proposed. The idea of visual masking was introduced into the algorithm, and the vertex which was waiting for embedding was chosen by their surface roughness and location, which let the intensity of embedded watermarking self-adapted to the surface roughness of the model. The experimental results show that the proposed algorithm can reduce the distortion efficiently under the condition of keeping the restriction on robustness.
    Network threat assessment method based on attribute recognition theory
    Yong-xin LI
    2009, 29(4):  956-958,. 
    Asbtract ( )   PDF (731KB) ( )  
    Related Articles | Metrics
    To study the problem of network threat assessment, a new method based on attribute recognition theory was proposed. This method extracted indicators of network attacking events in a period and modeled with entropy value to determine weights. Threat degree was quantified after the assessment and classification of attacking events in the network. The example's results indicate that this method is simple, practical and able to assess network threats effectively.
    Graphics and image processing
    News story automatic segmentation based on multi-feature fusion
    Xue-zhan LIANG Ming ZHU
    2009, 29(4):  959-961. 
    Asbtract ( )   PDF (846KB) ( )  
    Related Articles | Metrics
    News video is composed of a series of news items. It is very important for content-based analysis, indexing retrieval of news video to detect and segment the news items accurately. Analyzing the structure feature of news video, this paper detected and segmented the story items in the news video by using multi-feature such as silent points, shot boundary, anchorperson and theme caption. Also the study used different news videos in our experiment. The experimental results show that the proposed algorithm has high detection accuracy rate, and it can accomplish the task of segmenting news stories.
    Edge detection algorithm of Canny based on maximum between-class posterior probability
    Wei-xing WANG Li-ping WANG Zhi-chao YUAN
    2009, 29(4):  962-965,. 
    Asbtract ( )   PDF (1733KB) ( )  
    Related Articles | Metrics
    Based on the analysis of the traditional Canny algorithm, the adaptive filter took the place of the original Gaussian filter and made use of cross-entropy to measure the differences between the background and objectives. Combining Bayesian judgment theory, the average cross-entropy of posterior probability of the pixels of original image to objective and background areas presented differences between classes, and this paper maximized the posterior probability to judge pixels in which different regions to obtain the optimal level of the threshold. The experimental results show the improved algorithm has great edge detection effect.
    Research and improvement of method for vector data compression based on dynamic programming
    Lin-lin WANG De-hua HU Hua SONG
    2009, 29(4):  966-968,. 
    Asbtract ( )   PDF (697KB) ( )  
    Related Articles | Metrics
    The application of dynamic programming to vector data compression is a very effective method of optimized compression. The error of the result compressed by this method is minimal. But it can lead to local distortion. Aiming at this disadvantage, an improved algorithm was proposed. The improved algorithm prevents from local distortion by setting threshold to limit the maximum displacement in the process of executing and corrects the problem existing in the formula of dynamic programming in the scheme presented by A. KOLESNIKOV et al. The experimental results show that the improved algorithm can deal well with the problem of local distortion while maintaining the advantage of the dynamic programming algorithm.
    Video shot detection algorithm based on curvelet transform
    Zhi-xiong SONG Xiao-wen DAI
    2009, 29(4):  969-971,. 
    Asbtract ( )   PDF (939KB) ( )  
    Related Articles | Metrics
    The advantage of curvelet transform in processing the "curve singularity" was introduced. Video shot gradual transition detection algorithm based on curvelet transform was presented. The method of calculation and formula was given out. The curvelet transform was used to dissolve image. The high frequency coefficients of curvelet transform acted as the characteristics of the image. The Euclidean distance between characteristics of the sequence images was proposed. The experimental results indicate that the algorithm has better performance than Y. H. HONG's scheme.
    Motion object detection based on optical flow field and level set
    Lei ZHANG Xue-zhi XIANG Chun-hui ZHAO
    2009, 29(4):  972-975,. 
    Asbtract ( )   PDF (1557KB) ( )  
    Related Articles | Metrics
    Information of optical flow and epipolar constraint were used to get the initial segmentation region of motion object. The value of motion speed and the angle value of optical flow were extracted and feature vector was constructed using these two features. K-means cluster algorithm was used to get the region of motion object and level set was used to get information of image spatial segmentation. Minimization of the energy function led to the optimal segmentation of moving object by curve evolution. Evolution curve stopped at the position that spatial gradient was great and the close curve of moving object was produced. The experimental results show that the method can detect the whole motion object from image sequence.
    Iris feature extraction algorithm based on odd symmetry 2D Log-Gabor
    Lin-tao Lü Tao YANG
    2009, 29(4):  976-978. 
    Asbtract ( )   PDF (618KB) ( )  
    Related Articles | Metrics
    When 2D Log-Gabor extracted iris features, part of them are non-effective. Aiming at solving this problem, a new algorithm using odd symmetry 2D Log-Gabor filter to extract iris feature was proposed. Based on the study of odd symmetry 2D Log-Gabor filter, this paper analyzed the phase position and amplitude of iris texture in different frequency and directions, and eliminated redundant feature by feature integration. This algorithm solves the defects of 2D Log-Gabor wavelet extract iris feature problem. The experimental results show that the odd symmetry 2D Log-Gabor filters have strong robustness with noise and interferences. This algorithm has high theoretical and practical value.
    Ensemble application of SVM and Boosting in content-based image retrieval
    Hong-sheng XIE Hong ZHANG
    2009, 29(4):  979-981,. 
    Asbtract ( )   PDF (1022KB) ( )  
    Related Articles | Metrics
    An AdaBoostSVM (AdaBoost Support Vector Machine) algorithm applied to content-based image retrieval was proposed. It uses Support Vector Machine (SVM) as component classifier of the AdaBoost algorithm, and simulates the basic sample re-weighting method of AdaBoost algorithm by adding important samples based on relevance feedback mechanism. The experimental results show that the AdaBoostSVM algorithm can improve the performance of retrieval system in the database of 2000 images effectively.
    Practical color calibration method for multi-projectors display
    Jun ZHANG Bang-ping WANG Cheng YI Xiao-feng LI Hui LI
    2009, 29(4):  982-986. 
    Asbtract ( )   PDF (1051KB) ( )  
    Related Articles | Metrics
    A practical and efficient color calibration method was proposed to solve the problem of color non-uniformity in multi-projectors display system, which is independent of the geometric calibration. The method used technique of subdivision mesh deformation to extend the traditional color calibration technology from planar screen to smooth curved screen. Meanwhile, the method needed a small quantity of measure data by using weighted least squares curve fitting. In real processing of color calibration, Graphics Processing Unit (GPU) programmable pipeline was used to correct each pixel of the projector image in real-time. The experimental results on real multi-projectors display system show that this method is effective.
    Image restoration algorithm based on primal-dual hybrid gradient descent method
    Hui ZHANG Li-zhi CHENG Zai-xin ZHAO
    2009, 29(4):  987-989. 
    Asbtract ( )   PDF (789KB) ( )  
    Related Articles | Metrics
    An improved algorithm for image restoration was proposed based on Primal-Dual Hybrid Gradient Descent (PDHGD) method. The preferences have a great impact on convergence rate of the known algorithm. The form was changed by introducing new variable, and the elements of the dual vector of the primal-dual hybrid model were separated, and then step-size was replaced by using parameter matrices. The numerical experiments show that the improved algorithm has advantage on choosing parameters compared to the known algorithm, and the iterative number and CPU' time nearly declined by 50%, and at the same time, the improved algorithm has exactly the same effect on image restoration.
    Reversible data hiding algorithm for vector digital maps
    Lu ZHOU Yong-jian HU Hua-fei ZENG
    2009, 29(4):  990-993. 
    Asbtract ( )   PDF (718KB) ( )  
    Related Articles | Metrics
    A difference histogram-based reversible data hiding algorithm was proposed for authentication and covert communications of vector maps. Each information bit was embedded by modifying the difference of two adjacent vertices. To decrease embedding distortion from difference expansion, a difference histogram-based selection scheme was introduced, which gave priority to the differences with small magnitude. Compared with current algorithms, this algorithm has better embedding rate, better quality of the output image, and more accurate capacity control capability.
    Fast noise removal algorithm for HDR image based on least square method
    De-quan SUN Jun ZHANG Xiao-feng LI Hui LI
    2009, 29(4):  994-996. 
    Asbtract ( )   PDF (967KB) ( )  
    Related Articles | Metrics
    To remove noise for High Dynamic Range (HDR) image, a novel algorithm was proposed. Noise removal operation was performed on the image frames before synthesizing HDR. In luminance space, The L-t (Luminance-Exposure time) regression beeline was got by solving a weighted least-squared error problem, and then it was used to revise the luminance. The experimental results demonstrate that our algorithm is fast. It can eliminate Salt & Pepper noise clearly and reduce Gaussian noise effectively. It exceeds A.&E.'s (Ahmet & Erit) algorithms.
    Adaptive algorithm of edge detection based on mathematical morphology
    Guo-bao XU Ji WANG Gui-yan ZHAO Yi-xin YIN Shi-yi XIE
    2009, 29(4):  997-999,. 
    Asbtract ( )   PDF (1372KB) ( )  
    Related Articles | Metrics
    As different structure elements and different scale elements play different roles in removing noise and retaining image details, an adaptive algorithm of edge detection based on multiple structure and multi-scale elements was presented. Firstly, general edge detectors were improved to increase the details of image edge. Secondly, the weights were determined adaptively by calculating the entropies of the edges-detected. Finally, the edges of multiple structure elements detection and the ones of multi-scale elements detection were fused to achieve the final image edges. The experimental results show that the proposed algorithm, compared with a few classic algorithms of edge detection, can effectively eliminate the influence of noise variety on the edge detection, better retain the image details, and adaptively detect the complete and successive edges.
    Motion planning framework for virtual human arm manipulation
    Wei WANG Yan LI
    2009, 29(4):  1000-1002. 
    Asbtract ( )   PDF (742KB) ( )  
    Related Articles | Metrics
    A motion planning framework for virtual human arm manipulation was proposed based on bidirectional heuristic Rapidly-exploring Random Tree (RRT). According to whether a manipulated object was hold by hand, the framework proceeded in two phases: a reaching phase and a moving phase. Forward as well as inverse kinematic algorithm was used in these two phases respectively in order to make planning result rapid and credible. The effectiveness of our method was demonstrated by experiments.
    Simulating row crop directional brightness temperature based on POV-ray
    Jian-geng WANG Tao YU Hu LI Feng ZHAO Xingfa GU Lian XUE
    2009, 29(4):  1003-1007. 
    Asbtract ( )   PDF (1714KB) ( )  
    Related Articles | Metrics
    Directional Brightness Temperature (DBT) of 3D row crop canopy generated by the Clumped Architecture Model of Plants (CLAMP) were calculated efficiently and accurately based on the Persistence of Vision Raytracer (POV-ray) software. Clumping index, average leaf angle and leaf area index are main parameters of CLAMP model. By analyzing the sensitivity of these parameters to DBT, the changing rules of DBT were found. The experimental results show that clumping index can effectively control the distribution of leaves. Therefore, clumping index has a great impact on the pattern of DBT distribution; average leaf angle influences the anisotropy of the results; leaf area index is the key parameter describing the crop's growth stage, which has an obvious contribution to DBT.
    Improved frame-layer rate control algorithm for H.264
    Hou-yong DUAN Tong-qing WANG
    2009, 29(4):  1008-1010. 
    Asbtract ( )   PDF (520KB) ( )  
    Related Articles | Metrics
    A new rate control algorithm based on scene change was proposed on the basis of H.264 frame-layer. The complexity of image was measured by the weighted sum of the ratio of Mean Absolute Difference (MAD) of P-frame luma coeffecient and the relative changes of YUV's mean value, then the target rate was allocated and the quantitative parameters were adjusted according to the complexity. Meanwhile the target rate can be adjusted by using bits compensative factor. Compared to the algorithm in JVT-G012, the experimental results under the JM10.2 show that both the accuracy of rate controlling and the quality of reconstructed images can be improved if using the algorithm.
    Research and improvement of denoising method based on K-neighbors
    Yi ZAHNG Xu-min LIU Ying SUI Yong GUAN
    2009, 29(4):  1011-1014. 
    Asbtract ( )   PDF (809KB) ( )  
    Related Articles | Metrics
    An improved method for denoising the point clouds with noises and outliers acquired by a 3D scanner was presented. The method established the topology connection of the scattered points by searching the K-neighbors of each point. The Gaussian function was used as a kernel function to estimate the current point's effect on its neighbors, so the noises could be restricted and the outliers could be removed. The concept of density entropy and how to optimize the parameter of Gaussian function are the emphases. The method solves the problem of window-width's uncertainty in application. The results of emulation experiments show that the method can detect outliers easily, and it avoids mistaking points on the model as outliers.
    Mean Shift tracking algorithm based on background optimization
    Wei LIU Yi-ning LUO Nan SUN
    2009, 29(4):  1015-1017. 
    Asbtract ( )   PDF (787KB) ( )  
    Related Articles | Metrics
    The traditional Mean Shift tracking algorithm would lose target when the target is in rapid movement or the background is changing obviously. A Mean Shift tracking algorithm based on background optimization was proposed. The algorithm used cross-join histogram and re-quantilization, and optimized background by decreasing the weight of the Probability Density Function (PDF) of the background pixels. Then the impact of the background on the target region was reduced. The experimental results show that, when the target moves rapidly and the background region changes a lot, the proposed method can still track the target accurately.
    Analysis of texture feature extracted by gray level co-occurrence matrix
    Li-Hong YUAN Li FU Yong YANG Jing MIAO
    2009, 29(4):  1018-1021. 
    Asbtract ( )   PDF (712KB) ( )  
    Related Articles | Metrics
    To make the statistical measures derived from Gray Level Co-occurrence Matrix (GLCM) provide better information about the texture, sufficient experiments were done on the Brodatz pictures. Firstly, by testing the effect of each parameter on the key statistics,the changing rule of the statistics along with different parameters was obtained and proper parameters were advised. Then the stability of these statistics was analyzed when the image was rotated or its size was changed. The experimental and analytical results provide valuable reference for creating GLCM better and achieving image retrieval based on texture information.
    Approach to detect arbitrary triangles in image
    Jiang-ping HE
    2009, 29(4):  1022-1024. 
    Asbtract ( )   PDF (829KB) ( )  
    Related Articles | Metrics
    A new algorithm was proposed for triangles detection based on windowed Hough transform. A sliding window, of which the center point was regarded as the original point in plane coordinates, was used to compute the Hough transform of the small regions of the image. Peaks of the Hough image corresponding to the line segments were then extracted. A triangle was detected when the three lines satisfied the certain conditions. The experimental results prove that the arbitrary triangles can be efficiently detected. Right-angled triangle, isosceles triangle and equilateral triangle also can be detected if the conditions are changed. Another application of the algorithm is to retrieve triangles from the image.
    Artificial intelligence
    Research of initial iterative learning control strategy based on BP neural network
    HAO Xiao-hong HAO Xiao-yan DUAN Heng-jie LI
    2009, 29(4):  1025-1027. 
    Asbtract ( )   PDF (711KB) ( )  
    Related Articles | Metrics
    In order to avoid the blend choice of the initial control input in Iterative Learning Control (ILC) when the control system faced a new desired trajectory-tracked task or a new environment, an improved algorithm was proposed to obtain the initial value of the iterative learning control based on Back Propagation (BP) neural network. Desired control input of iterative learning control was estimated by BP neural network incorporated experience database. The simulation results show that the algorithm is feasible and effective.
    Application of Hopfield neural network in unit commitment problem
    Wei-xin GAO xiang-yang MU Nan TANG Hong-liang YAN
    2009, 29(4):  1028-1031. 
    Asbtract ( )   PDF (593KB) ( )  
    Related Articles | Metrics
    This paper presented an algorithm, based on multi-layer Hopfield neural network, for determining unit commitment. By constructing an appropriate energy function, a single layer Hopfield neural network can solve the problem of assigning output power of generators at any given time. Based on this single layer Hopfield neural network, a multi-layer Hopfield neural network was presented. The multi-layer Hopfield neural network can solve the problem of power system unit commitment. The energy functions of single layer and multi-layer Hopfield neural network and the corresponding algorithm were given. The restricted conditions of the balance between power supply and demand, maximum and minimum outputs of power plants were considered in the energy function. An example shows that the result got by Hopfield neural network is like to that got by genetic algorithm, but the calculation time is much less.
    New feature extraction method and its application to pattern recognition
    Zong-li LIU Jie CAO Yuan-hong HONG
    2009, 29(4):  1032-1035. 
    Asbtract ( )   PDF (783KB) ( )  
    Related Articles | Metrics
    Kernel Canonical Correlation Analysis (KCCA) is a recently addressed supervised machine learning methods, which is a powerful approach of extracting nonlinear features. However, the standard KCCA algorithm may suffer from computational problem as the training set increases. To overcome the drawback, an improved KCCA was proposed. Firstly, a scheme based on geometrical consideration was proposed to select a subset of samples that were projected to feature space (Reproducing Kernel Hilbert Space). And then, an efficient algorithm was proposed to enhance the efficiency of the feature extraction, which selected the most contributive eigenvectors for training and classification, and then calculated the corresponding eigenvectors for classification. Finally, the improved KCCA was combined with a multi-class classification method based on Support Vectors Data Description (SVDD) for classification and recognition, which put forward new ideas for pattern recognition based on kernels. The experimental results on ORL face database show that the proposed method reduces the training time and the system storage without deteriorating the recognition accuracy compared with standard KCCA.
    Short-term load forecast based on modified particle swarm optimizer and back propagation neural network model
    Biao SHI Yu-xia LI Xin-hua YU Wang YAN
    2009, 29(4):  1036-1039. 
    Asbtract ( )   PDF (840KB) ( )  
    Related Articles | Metrics
    Aiming at improving the power short-term forecast accuracy and speed, the Modified Particle Swarm Optimizer (MPSO) algorithm was presented. The forecast model was set up by combining with the Back Propagation (BP) neural network to form Modified Particle Swarm Optimizer and Back Propagation (MPSO-BP) neural network algorithm, and then the neural network was trained by using the MPSO-BP algorithm. It can automatically determine the parameters of the neural network from the sample data. The power short-term forecast model based on the MPSO-BP neural network was formed with considering weather, date and other factors. The experimental results show that the MPSO-BP algorithm improves the BP neural network generalization capacity, and the convergence of method is faster and forecast accuracy is more accurate than that of the traditional BP neural network. Therefore, the model can be used to forecast the short-term load of the power system.
    Solving Shubert function optimization problem by using evolutionary algorithm
    Xuan WANG Yuan-xiang LI
    2009, 29(4):  1040-1042. 
    Asbtract ( )   PDF (577KB) ( )  
    Related Articles | Metrics
    Based on the review of recent development of evolutionary computation and the principle of free energy minimization of thermodynamics, a new thermodynamics evolutionary algorithm for solving Shubert function optimization problem was proposed. The numerical experiments were conducted to measure the performance of thermodynamics evolutionary algorithm. The results show that thermodynamics evolutionary algorithm is of potential to obtain global optimum or more accurate solutions than other evolutionary methods.
    RBF equalizer based on adaptive niche hierarchy genetic algorithm
    Fu-qiang XUE Lin-Dong GE Bin WANG
    2009, 29(4):  1043-1045. 
    Asbtract ( )   PDF (648KB) ( )  
    Related Articles | Metrics
    It is the fact that only one optimum individual can be determined by the Hierarchy Genetic Algorithm (HGA). This paper proposed a new improved hierarchy Genetic Algorithm (GA) based on the niche, in which the range of the niche could be determined by the information of the evolution. The best structure of the Radial Basis Function (RBF) neural network equalizer could be selected from several optimal solutions with the criterion of the lowest bit error rate and the best clustering degree of the hidden centers. The simulation results demonstrate that the validity and the stability of the new algorithm.
    Modified differential evolution algorithm for semi-supervised fuzzy clustering
    Song-shun ZHANG Chao-feng LI Xiao-jun WU Cui-fang GAO
    2009, 29(4):  1046-1047. 
    Asbtract ( )   PDF (528KB) ( )  
    Related Articles | Metrics
    Through studying and classifying labeled and unlabeled data, this paper proposed a modified differential evolution algorithm for semi-supervised fuzzy clustering. Firstly, a small part of data was labeled from the whole dataset, and then these labeled data were used to guide the evolution process to partition unlabeled data. The modified algorithm introduces inertia-weighted coefficient by considering inertia-weighted idea of particle swarm algorithm, which keeps diversity of individual at early stages and quickens convergent speed at later stages, and at the same time improves the performance of the algorithm. The experimental results for remote sensing data indicate that the proposed approach can improve classification accuracy.
    Dynamic network routing algorithm combining AntNet with genetic algorithm
    Hong-Bin XIA Wen-bo XU Yuan LIU
    2009, 29(4):  1048-1051. 
    Asbtract ( )   PDF (771KB) ( )  
    Related Articles | Metrics
    A new dynamic distributed algorithm for network routing was presented. The path genetic operators were used in AntNet, and a new pheromone update rule was achieved. Each chromosome was encoded as a series of nodes that in the path ant had found, and was evaluated with a fitness function. The quality of the solution was enhanced through the computation with path crossover and path mutation as well as the population's unceasing evolution. The simulation results show that the improved algorithm has faster speed of the convergence, also the network throughput is effectively improved, and the average time delay is reduced.
    Research and implementation of parallel speech recognition based on HTK
    Yong-jin LIU Xiao-dong SHI
    2009, 29(4):  1052-1055. 
    Asbtract ( )   PDF (674KB) ( )  
    Related Articles | Metrics
    After comprehensively analyzing the process of speech recognition and depicting its corresponding algorithm, the feasibility of the parallelism in the algorithm was analyzed. The parallel computing concept and the multi-threading technology were applied in the algorithm of speech recognition, and a protection mechanism was introduced to avoid the occurring race condition during the computing of likelihood of Hidden Markov Model (HMM) on multi-core computer. Then the parallel algorithm for speech recognition was proposed and its performance was also evaluated. The experiments on WSJ0 corpora demonstrate that the implementation of parallel algorithm which was realized in HTK 3.4 toolkit can greatly improve the real-time performance of speech recognition without affecting the results of recognition.
    Underdetermined blind speech separation of sparseness
    Guo-peng WANG Yu-lin LIU Ying-guang LUO
    2009, 29(4):  1056-1058. 
    Asbtract ( )   PDF (508KB) ( )  
    Related Articles | Metrics
    A new sparseness-based method was proposed for mixing matrix estimation, in the case of poor sparseness of speech signals with increasing number of sources. The time-frequency bins with only one source were detected by Principal Component Analysis (PCA), and then were exploited to estimate the mixing matrix to improve the estimation performance. The proposed method is especially applicable to underdetermined blind speech separation. The reasons deteriorating the performance of blind speech separation were also pointed out. The simulation results demonstrate the conclusions above.
    Network and communications
    Model and analysis of LEACH protocol based on Petri net
    Ai PENG Lan HUANG Zhong-Yi WANG Cheng WANG
    2009, 29(4):  1059-1063. 
    Asbtract ( )   PDF (1043KB) ( )  
    Related Articles | Metrics
    Petri net is an effective mathematical tool for formally analyzing and verifying protocols. On the basis of the analysis of Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol, a Generalized Stochastic Petri Nets (GSPN) model of performance for LEACH protocol was proposed. With the help of SPNP tools for analyzing the performance model of protocol, the validity of the model was verified. Finally, the significance of the performance model to the protocol's low-energy improvement was discussed.
    Self-localization algorithm for sensor networks using SVM classification region
    Ming LIU Ting-ting WANG Xiao-yan HUANG Rui LIU
    2009, 29(4):  1064-1067. 
    Asbtract ( )   PDF (755KB) ( )  
    Related Articles | Metrics
    Focused on the requirements of low cost and low power in Wireless Sensor Network (WSN), this paper proposed a range-free localization algorithm based on Support Vector Machine (SVM) classification regions. First, SVM constructed a binary decision tree classifier via learning of the training data. Then the classifier determined the certain classification region where the unknown nodes were located. Finally, the study used the region's center point as the estimated position of the unknown node. The proposed algorithm required mere connectivity information (i.e., hop counts only), so as to reduce the network cost and communication load. The simulation results show that this algorithm alleviates the coverage holes and border problem significantly while certain location accuracy is assured.
    Global energy-efficient aggregation tree constructing algorithm for WSN
    Shuai SHEN Ya-ping LIN Yu-peng HU Xiao-long XU Jian-ping YU
    2009, 29(4):  1068-1071. 
    Asbtract ( )   PDF (779KB) ( )  
    Related Articles | Metrics
    Constructing an aggregation tree generates a large number of redundant broadcast messages, which leads to the excessive energy dissipation in entire sensor network. This paper analyzed the performance of aggregation tree constructing algorithms and proposed a global energy-efficient aggregation tree constructing algorithm based on greedy incremental tree. This algorithm got the best candidate's information with few packets exchanged in presence tree and avoided mass exploratory messages broadcasted by sources periodically. The global energy consumption of constructing the aggregation tree was affected by node density slightly and maintained at a relatively low level. Since the construction time was no longer restricted by the exploratory messages' periods, the algorithm can improve the speed of constructing a greedy incremental tree. The simulation results show the algorithm decreases the number of packets in entire network effectively and provides low latency. The effect of aggregation is equivalent to the tree constructed by Greedy Incremental Tree (GIT) algorithm.
    Evaluation of general PC-based packet capture methods for high speed networks
    Jian HAN Da-fang ZHANG Bin ZENG Ji ZHANG Hong QIAO
    2009, 29(4):  1072-1075. 
    Asbtract ( )   PDF (863KB) ( )  
    Related Articles | Metrics
    Packet capture method is the key of traffic measurement. The maneuverability and practicability of different capture methods are various. In order to choose appropriate packet capture method, four methods based on general PC were evaluated and the influence of New Application Programming Interface (NAPI) and interrupt model on capturing packets was analyzed. The experimental results show that NAPI model can improve the capture capacity dramatically under the conditions of small packet and heavy traffic, whereas the performance of interrupt model is better when the traffic contains substantive big packets, especially larger than 256 Byte.
    Algorithm study of proxy integration methodbased on RTSP controlling of streaming media server
    Shi-jiao ZHU Jun YANG Zhong TANG
    2009, 29(4):  1076-1078. 
    Asbtract ( )   PDF (517KB) ( )  
    Related Articles | Metrics
    Streaming media technology has been widely used. In order to better use network resource and control the user's connections, a proxy method was proposed. It adjusted the data streaming in network using Real Time Streaming Protocol (RTSP), Real-time Control Protocol (RTCP) and Real-time Transport Protocol (RTP) between server and clients to implement a streaming media proxy to meet the requirement of different client connections. From the results of integration experiments, it shows that the proposed method is valid.
    Design and realization of SIP message mapping model in Parlay gateway
    Zi-fu FAN Xiao-yu WANG
    2009, 29(4):  1079-1081. 
    Asbtract ( )   PDF (780KB) ( )  
    Related Articles | Metrics
    Mapping between Parlay Application Programming Interface (API) and network protocol is the keystone in the realization of Parlay-based services. This paper focused on Session Initiation Protocol (SIP), researched the mapping problem of Parlay and SIP, designed and realized the model of SIP message mapping in Parlay gateway, testified the mapping model by the testing environment. Testing results prove the mapping model has bidirectional mapping function between Parlay and SIP, as well as high feasibility and maneuverability.
    Research and implementation of JXTA P2P protocol on Symbian platform
    Jia-xin WU Jian PENG Da-ping ZHANG
    2009, 29(4):  1082-1086. 
    Asbtract ( )   PDF (988KB) ( )  
    Related Articles | Metrics
    The Symbian platform and current models of resource sharing on mobile devices were introduced firstly. Next, a new P2P model of resource sharing on Symbian devices was put forward by analyzing the existing mobile P2P protocol JXME. And then the corresponding P2P protocol JXTA-Symbian for Symbian platform was constructed through a series of modifications and adjustments on reference protocol JXME, which included the improvements of relay and the re-implementation of Symbian-End protocol. Finally, this paper discussed and analyzed the implementation architecture of JXTA-Symbian, especially the implementation of Symbian-End protocol, in detail.
    Multi-source overlay multicast model of dynamic QoS-constrained based on P2P network
    Lei ZHAO Shi-ping CHEN Shu-feng ZHAO
    2009, 29(4):  1087-1091. 
    Asbtract ( )   PDF (927KB) ( )  
    Related Articles | Metrics
    A multi-source overlay multicast model was built to solve the problem of Quality of Service (QoS) multicast in overlay network. In this model, each node maintained the local state information instead of one tree per source, and the model delivered multicast message in a way similar to flooding. By controlling, the message transmission path formed a tree structure. The multicast tree can dynamically adjust and adapt to a different source node initiated multicast applications, which meets the requirements of QoS. The experimental results show that multicast coverage rate of the model is high, and the cost of adjusting the multicast tree can be the lowest by controlling the number of sub-node of modes.
    Implementation of HDLC protocol based on FPGA in communication systems
    Fei SONG Zhi-shu LI
    2009, 29(4):  1092-1094. 
    Asbtract ( )   PDF (569KB) ( )  
    Related Articles | Metrics
    A data communication system based on High-level Data Link Control (HDLC) protocol was designed, and then HDLC protocol in Field Programmable Gate Array (FPGA) was implemented. The system can take advantage of FPGA hardware effectively. It has some outstanding advantages, such as high scale integration, no need of peripheral circuit and being easy to use. This paper emphatically described the implementation methods of transmitting protocol and receiving protocol and the method for "0" bit insertion and deletion.
    Scheme on implementing interconnection between wireless sensor networks and IPv6 networks
    XiaoNan WANG Huan-yan QIAN Zhen-min TANG
    2009, 29(4):  1095-1098. 
    Asbtract ( )   PDF (860KB) ( )  
    Related Articles | Metrics
    The author proposed and designed a model to implement a seamless communication between a Wireless Sensor Network (WSN) and an IPv6 network. This model creates an automatic address configuration algorithm in a sensor network and based on the algorithm this model performs automatic routing and addressing. In addition, this model puts forward a reduced IPv6 protocol stack to save a sensor node's power. This model was implemented on an experimental platform and in a simulation environment respectively, and its performance was analyzed. The experimental results prove the validity and correctness of this model.
    Articles
    New user transaction algorithm
    Ji-rong GAO Yan TIAN Hai-ying SHAO
    2009, 29(4):  1099-1101. 
    Asbtract ( )   PDF (659KB) ( )  
    Related Articles | Metrics
    This study proposed a user business algorithm with double thresholds. This algorithm first acted according to the page number which the user visited to judge whether this user was the accidental user, and then the network topology and homepage lowest interest degree to judge whether the homepage appealed to the users. This method improved the data pretreatment process, and deleted the visit record which the accidental user caused, as well as the link pages and the pages that users were not interested in, produced one kind of effective visiting page sequence, namely double thresholds user business. This paper has proved the validity of the algorithm through an instance.
    Improved algorithm of rough K-means based on relative distance
    Ming-chun WANG Wan-sheng TANG Qi JIANG Xin LIU
    2009, 29(4):  1102-1105. 
    Asbtract ( )   PDF (684KB) ( )  
    Related Articles | Metrics
    Two rough K-means algorithms based on absolute distance were discussed in the first place, and then the deficiencies of them were indicated. After that, the rationality of the algorithms was presented when the absolute distance was changed to relative distance, and for the reason, the improved algorithms of rough K-means based on relative distance was given. At last, the feasibility and effectiveness of this algorithm were testified by comparing with random, Iris and text data on clustering effect.
    Decision rules extraction based on trend concept lattice
    Xiao-Wei HE Hai-feng NIU Li-ming XU Yue MA
    2009, 29(4):  1106-1109. 
    Asbtract ( )   PDF (891KB) ( )  
    Related Articles | Metrics
    Through analyzing the transition feature of object based on time sequence in the dynamic information system, trend concept lattice related to the object was proposed. According to the goal of extracting decision rules, two corresponding algorithms were put forward, the former was used for constructing lattice and the later was used for extracting decision rule based on the decision lattice which was generated by the former. Finally, the two algorithms were used in stock forecasting to verify the validity of them.
    Recognition and reduction of traffic flow redundant data
    Xiao-yuan WANG Fang WU Li XING
    2009, 29(4):  1110-1113. 
    Asbtract ( )   PDF (746KB) ( )  
    Related Articles | Metrics
    The detected data often appear redundant, which affects the actual application of traffic models. A method of recognizing and reducing redundant data was proposed. Redundant data were recognized based on rank-based weights and packet method. Firstly, each of traffic parameters was endowed with certain weight according to rank-based weights method. Secondly, in terms of group thought, large data sets were divided into many non-intersecting small data sets. Finally, redundant data were detected and eliminated in each small data set. To avoid missing, the above steps can be repeated. And the recognized redundant data were reduced by average method. An application example shows that, the proposed recognition method of redundant data has a good detection precision, the recall and the precision decreased with the threshold increasing, but still over 93%. The reduced data have a high fitting degree, up to 0.938. The results indicate that, the problem of single data source can be solved effectively.
    Web search model and optimal algorithm based on mean quantity of Web pages
    Guo-yu FU Xian-ying HUANG
    2009, 29(4):  1114-1116. 
    Asbtract ( )   PDF (513KB) ( )  
    Related Articles | Metrics
    This paper proposed a search strategy based on Quantum Genetic Clonal Mining Algorithm (QGCMA) for Web search. The user query was used to mathematically define a mean quantity of Web pages, and evolved a population of Web pages for maximizing the affinity by clonal, mutation and crossover operator. The analysis and experimental results show that the proposed method is superior to standard genetic algorithm in Web search.
    Parallel Web crawler system with increment update
    Wen-jie XU Qing-kui CHEN
    2009, 29(4):  1117-1119. 
    Asbtract ( )   PDF (779KB) ( )  
    Related Articles | Metrics
    This paper discussed the architecture of parallel Web crawler system. Incremental crawling method was used to the system to improve the efficiency of massive information updating. Meanwhile, considering the difference of crawler in the system and with the aim of fully usage of crawler in cluster system, Cosine vector parallel crawling model was introduced to solve this problem. After giving the definitions of crawling task vector and crawler vector, relevant parallel crawling algorithms were designed. The results confirm that the system is effective in distribution adaptability and runs well in maintaining the "freshness" of the Web repository.
    Frequent embedded subtree mining algorithm based on discrete interval
    Peng-cheng KONG Ji-fu ZHANG
    2009, 29(4):  1120-1123. 
    Asbtract ( )   PDF (788KB) ( )  
    Related Articles | Metrics
    A frequent embedded subtree mining algorithm based on discrete interval, called DIFTM algorithm, was presented by using discrete interval to construct project database. The algorithm eliminates effectively redundant projection in the process of constructing project database by computing discrete interval so that the size of the project database was reduced, searching and counting efficiency of the subtree nodes was improved,and its time-space complexity was reduced. The experimental results show that the DIFTM algorithm is efficient and effective.
    Improved word-sequence kernel algorithm
    feng XU Jun-yong LUO Tao WEN
    2009, 29(4):  1124-1127. 
    Asbtract ( )   PDF (768KB) ( )  
    Related Articles | Metrics
    Based on the study of the Word-Sequence Kernel (WSK) algorithm put forward by Cancedda, this paper proposed a feature extraction algorithm which could decrease the time and space complexity. A series of classification performance test were carried out, and the experimental results show that, compared with the WSK algorithm, the feature extraction algorithm can reduce the time and space complexity, with less loss of the text classification performance.
    Software process technology
    Extension of time slice circular scheduling in UC/OS-II kernel
    Fu-qiang GAO Chang-shuo QIN Ji-yuan YOU Heng ZOU
    2009, 29(4):  1128-1130. 
    Asbtract ( )   PDF (1042KB) ( )  
    Related Articles | Metrics
    Based on the detailed analysis of UC/OS-II kernel task scheduling, this paper discussed the limitation of the scheduling algorithm in practical application, and then put forward the design that achieved time slice circular scheduling. It made the operating system have two kinds of task scheduling-task scheduling based on priorities and time slice circular scheduling, and it also preferably repaired the lack of the UC/OS-II kernel. Finally the new kernel obtained good effect in practical application.
    Task allocation and scheduling algorithm based on dynamic dual-directional priority
    Yue GONG Zhen-zhen ZHANG Xiao-ke HUANG Jian-jun LIU
    2009, 29(4):  1131-1134. 
    Asbtract ( )   PDF (724KB) ( )  
    Related Articles | Metrics
    A task allocation and scheduling algorithm called Dynamic Dual-Directional Priority (DDDP) was presented. This algorithm considered the priority of real-time task and the sub synthetically, and constructed a dynamic dual-directional priority task allocation model, realized the task allocation and scheduling of the master/sub model in data transmission. In the simulation experiments with some typical data of various parameters under normal workload and overload situation, the DDDP algorithm has improved the performance of scheduling obviously compared with a classical Earliest Deadline First (EDF) algorithm which only considers the deadlines of real-time tasks.
    Mixed C/S and B/S architecture pattern based on AJAX
    Xian-jun LI Bo LIU Dan YU Shi-long MA
    2009, 29(4):  1135-1138. 
    Asbtract ( )   PDF (801KB) ( )  
    Related Articles | Metrics
    On the basis of analyzing the mixed Client/Server (C/S) and Browser/Server (B/S) architecture pattern and AJAX technology, a novel mixed architecture pattern was proposed, which can unify the foreground interaction method of B/S and C/S and make the servers share effectively, thus enhance the scalability and maintainability of the system. According to the proposed pattern, the architecture of the spacecraft dynamical application platform was given, as a reference to the system with similar architecture.
    Complicated behaviors modeling and code generation based on Web UI design pattern
    Kui CAI Lei LU Shuai-qiang WANG Jian-cheng WAN
    2009, 29(4):  1139-1142. 
    Asbtract ( )   PDF (960KB) ( )  
    Related Articles | Metrics
    Currently, there is a lack of model design and development method for complicated behaviors in the research on model-based Web User Interface (UI), which severely limits the engineering application of the method. Based on Web UI design patterns, a formalized description language for Web interface behavior was proposed, which can be used to model complicated behaviors of Web UI. The automatic code generation for behavior models was also achieved consequently. The experimental results show that this method is greatly flexible in the development of UI design and improves the reusability of UI design patterns.
    Dynamic modeling and application research of embedded system software architecture
    Rong-zuo GUO Jin GUO Lin WANG
    2009, 29(4):  1143-1146. 
    Asbtract ( )   PDF (1009KB) ( )  
    Related Articles | Metrics
    Applyingπ-calculus methods and combing the Object-oriented Petri Nets (OPN) and Time Petri Nets (TPN) of the Petri nets theories, embedded-systems software-architecture abstract model(ESAM)was established. And then, dynamic evolving, uniformity and deadlock of the ESAM model were researched. Last, the developed model was used to model and analyze the signal interlocking controller of railway station.
    Optimization algorithm of disk scheduling based on average seek time
    Shun-xiang ZHANG Guang-li ZHU
    2009, 29(4):  1147-1150. 
    Asbtract ( )   PDF (657KB) ( )  
    Related Articles | Metrics
    To improve the efficiency of disk scheduling, this paper proposed an optimization algorithm of disk scheduling based on the Average Seek Time (AST). Deep research of the average seek time of disk scheduling algorithm was carried out. Firstly, to analyze the moving of the magnetic head under every algorithm and compute the average seek time respectively; groups of the service request list were generated randomly as experimental data. And then by simulative and analytical method, a vibration rule had been studied; furthermore, the optimization algorithm of disk scheduling based on the average seek time was proposed. The optimization algorithm can enhance the efficiency of disk scheduling by selecting proper algorithm in real time automatically.
    Enterprise application integration framework based on multi-agent system
    Jia-fang WANG Xiao-bo LI Zhi-yong FENG
    2009, 29(4):  1151-1154. 
    Asbtract ( )   PDF (791KB) ( )  
    Related Articles | Metrics
    On the basis of fast Multi-Agent System (MAS) application development with Agent Pattern Language (APL), this paper proposed a framework of process-oriented enterprise application integration. According to the general characteristics of business process, the framework adopted a hierarchy structure for the business process to separate business logic and implementation. Then some local changes of sub-process had less influence on the execution of global business process. Besides, roles and structured activities were adopted in the framework. The business process can be divided into sub-process with roles to form the hierarchy structure. The structured activities were used to describe complex business process. With the framework, the enterprise application integration can be implemented in an effective way, and the implementation will be more flexible.
    Research on logical model of flexible workflow and its soundness
    Yu-hui BU Hui-jia TANG
    2009, 29(4):  1155-1158. 
    Asbtract ( )   PDF (767KB) ( )  
    Related Articles | Metrics
    As the market competition intensifies enterprises' urgent need of improving the efficiency, flexible workflow becomes the focus of research. In order to resolve the problem of building flexible workflow model and dynamic modification, a method of defining flexible Workflow Logic net (WL_net) was introduced, which researched tasks' dependencies in model with OOP. In the end,after researching the defective route of workflow model, an algorithm was given to verify whether a WL_net was sound.
    Typical applications
    Curve representation and matching based on feature points and minimal area
    Gui-mei ZHANG Wei REN Fen XU
    2009, 29(4):  1159-1161. 
    Asbtract ( )   PDF (674KB) ( )  
    Related Articles | Metrics
    In order to recognize the curve whose feature points are the same but the curvature between the feature points is different, a new method for representing and recognizing the contour curve was proposed. First, feature points of the contour were extracted for the rough matching; then the sampling points of the sub-curve were obtained based on the precision requirement using the given minimal area threshold. A new recognition vector of sample points was defined, and a novel recognition vector matrix was constructed based on the recognition vector of sample points; last the similarity of the corresponding sub-curves was calculated by comparing the recognition vector matrix. The curve was recognized by recognizing their each sub-curve. The matching method was a process from simple to complex, thus many redundancies calculations were avoided. The experimental results show the proposed algorithm is efficient and feasible.
    Grid resource selecting based on cloud theory
    Man-fu MA Fu-hai DUAN Zhi-yi HUANG Wei-guo ZHANG
    2009, 29(4):  1162-1164. 
    Asbtract ( )   PDF (594KB) ( )  
    Related Articles | Metrics
    Resource selecting is the key for scheduling and system efficiency in grid. Concerning the qualitative description of Quality of Service (QoS) by grid users and selfishness of scheduling, grid resource selecting based on cloud theory was proposed. QoS parameters based on the cloud model were analyzed, as the requirement; the author proposed a new grid resource broker architecture. At last, the optimized scheduling algorithm was described based on the model. Finally the author performed simulations to compare the performance of optimized scheduling algorithm with that of the time minimization and cost minimization. The experimental results show that the optimized scheduling algorithm is efficient on throughput and system utilization ratio within grid computing environments.
    Method of calculating stack space of μC/OS-II task based on tree structure and its application
    Guang-jian ZHANG Zheng LIU
    2009, 29(4):  1165-1167. 
    Asbtract ( )   PDF (547KB) ( )  
    Related Articles | Metrics
    Aiming at the problem that the stack space size of μC/OS-II task is not easily confirmed by existing ways, this paper presented a new way by which the stack space size of μC/OS-II task can be computed based on tree structure. Firstly, the stack space structure of μC/OS-II task was analyzed. Secondly, some tree structures that can show the extreme usage of the stack space were defined. Lastly, the formula that can calculate the stack space which is maximal was presented based on tree structure and the stack space of a real system was calculated by the formula. The stack space size which is calculated by this way can reflect the extreme usage of a stack space factually and can reduce the requirement for RAM.
    Improved beer bottles recognition technology
    Feng FU Duan WANG
    2009, 29(4):  1168-1170. 
    Asbtract ( )   PDF (492KB) ( )  
    Related Articles | Metrics
    Beer bottles recognition is an important step in whole beers intelligent system. This paper presented a recognition system based on wavelet moment and Support Vector Machine (SVM). The experimental results show that the method has a good recognition rate and less loss-time, which satisfies the industrial need.
    Extraction of sentiment topic sentences of Chinese texts
    Na FAN Wan-dong CAI Yu ZHAO Hui-xian LI
    2009, 29(4):  1171-1173. 
    Asbtract ( )   PDF (761KB) ( )  
    Related Articles | Metrics
    This paper proposed a method of extracting sentiment topic sentences. Firstly semantic concepts of a text were evaluated in order to determine which concepts were related to the topic of a text. And the concepts related to the topic were regarded as topic concepts. Sentences including one or more topic concepts were defined as candidate sentences. Significance of every candidate sentences was calculated in order to which ones were topic sentences in the text. Conditional random field model was adopted and two kinds of feature were used in the model training, and one feature was polarity of sentiment and the other feature was transferring words. This approach excluded sentences that were not related to the topic of the text, and eliminated the influence brought by these sentences. Therefore, precision of sentiment analysis is effectively improved.
    H.264-based watermarking for compressed video
    De-sheng FU Jian-rong WANG
    2009, 29(4):  1174-1176. 
    Asbtract ( )   PDF (547KB) ( )  
    Related Articles | Metrics
    Concerning the new features of the H.264/AVC video coding standard, a schema based on H.264 low bit-rate video stream was proposed. This paper improved the robustness and effectiveness of the traditional Differential Energy Watermarking (DEW) using the formula of energy distribution. The watermark extracting was carried out in the decode time and the original video was not needed during the process. The experimental results show that this schema can maintain a small change in bit-rate and keep small distortion, which means the proposed schema is effective.
    Fast operation of large-scale high-precision matrix based on GPU
    Chang SU Zhong-liang FU Yu-chen TAN
    2009, 29(4):  1177-1179. 
    Asbtract ( )   PDF (712KB) ( )  
    Related Articles | Metrics
    A fast calculation approach for large-scale matrix operation, which can be accomplished by Graphic Processing Unit (GPU), was designed. For taking full advantage of the parallel architecture of GPU to enhance the calculation speed, special matrix partitioning and memory allocation mechanism according to the features of GPU were designed to decrease the frequency of data access. Meanwhile Kahan's summation formula was introduced to ensure the precision of the calculation. The result shows that the approach can achieve better effect and greatly enhance the speed and the precision of the large matrix multiplication.
    Efficient heuristic algorithm for one-dimensional cutting stock problem
    Rui LIU Xuan YAN Dao-yun XU Yao-dong CUI
    2009, 29(4):  1180-1181. 
    Asbtract ( )   PDF (545KB) ( )  
    Related Articles | Metrics
    This paper presented an improved sequential heuristic algorithm to solve the classical One-Dimensional Cutting Stock Problem (1D-CSP). The prices of the items assigned to the current pattern were adjusted so as to make them more reasonable. The pattern, whose unit value was the maximum among those of the patterns generated from solving a bounded knapsack problem, was added to the cutting plan. Several solutions were constructed iteratively and at last the best one was selected. The heuristic algorithm can generate cutting plans of higher material utilization level, and at the same time, can consider multiple objectives such as pattern reduction and residual length increment. The computational results show the effectiveness of the presented algorithm.
    Research of cross-media information retrieval model based on multimodal fusion and temporal-spatial context semantic
    Yang LIU Feng-bin ZHENG Bao-qing JIANG Kun CAI
    2009, 29(4):  1182-1187. 
    Asbtract ( )   PDF (1325KB) ( )  
    Related Articles | Metrics
    The solution of "semantic gap" between the low-level features describing and the high-level semantic knowledge has become the key in problems of the Cross-Media Retrieval (CMR), a CMR model based on multimodal fusion and temporal-spatial context semantic was designed. The Independent Component Analysis (ICA) and Principal Component Analysis (PCA) were applied to dimension reduction of multimodal fusion features. The classifier of Support Vector Machine (SVM) and Hidden Markov Model (HMM) was designed to map semantic relationship in the model; meanwhile, methods of temporal-spatial fuzzy cluster and relevance feedback were used to improve the effect of CMR system. A prototype based on the model had been developed, and validated the correctness of the new model, which can provide enlightenment to the designers who work at CMR system.
    Research and realization of speech segmentation in MP3 compressed domain
    Liao-yu CHANG Xiao-qing YU Wang-gen WAN Chang-lian LI Xue-qiong XU
    2009, 29(4):  1188-1192. 
    Asbtract ( )   PDF (931KB) ( )  
    Related Articles | Metrics
    This article proposed an approach for detecting the voice change of speakers by employing improved Bayesian Information Criterion (BIC) algorithm in MPEG1-layer3 (MP3) compressed domain. According to the process of MFCC calculation in raw audio, a new Mel-Frequency Cepstral Coefficients (MFCC) algorithm by utilizing Modified Discrete Cosine Transform (MDCT) coefficient in MP3 domain was presented. Based on these coefficients, the improved BIC algorithm was employed to decide which point was the voice change point of speakers. The experimental results show that using the MFCC coefficients extracted in MP3 domain for speech segmentation, similar segmentation precision can be obtained as that in uncompressed domain.
    ROC-based Canny algorithm for scene matching
    Zhao-hui YANG Ying CHEN
    2009, 29(4):  1193-1196. 
    Asbtract ( )   PDF (1194KB) ( )  
    Related Articles | Metrics
    Receiver Operating Characteristics (ROC) analysis method, which can perform a multiple threshold evaluation without the prior probability of classes, was applied to improve the performance of Canny edge detection algorithm in scene matching. Firstly, several edge detection results were computed using combinations of the Canny detector’s parameters. The results were then tested for correspondence by each pixel. Then ground truth edge image was estimated using correspondence threshold which was optimized by ROC analysis. After obtaining the ground truth edges of reference image and real-time image, scene matching process was performed finally. The experimental results show that the method is robust and can be obtainable for high matching precision and registration probability at the condition of existing geometry distortion and luminance difference between matching images. This method has practical implementations of scene matching with automatic parameters setting process.
2024 Vol.44 No.3

Current Issue
Archive
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