Table of Content

01 November 2009, Volume 29 Issue 11

Previous Issue    Next Issue

Network and communications

New effective resources search strategy in unstructured P2P network

Shi-quan AN Tao GAO Jin-biao DING

2009, 29(11):  2881-2883. 

Asbtract ( )   PDF (749KB) ( )  

Related Articles | Metrics

Concerning the low efficiency of resources search and the dramatic consumption of bandwidth when searching in unstructured P2P network, the authors put forward an improved algorithm based on routing mechanism. The algorithm generated neighboring nodes routing tables by analyzing the neighboring relations. Simulation results show that the proposed algorithm effectively reduces the network traffic and consumption of bandwidth and keeps away from selfish nodes. Meanwhile, it improves the efficiency of resources search.

Bus-type model based on comprehensive performance of node for application layer multicast

2009, 29(11):  2884-2886. 

Asbtract ( )   PDF (735KB) ( )  

Related Articles | Metrics

In order to improve the performance of Application Layer Multicast (ALM), bus-type model based on comprehensive performance for application layer multicast (CPBM) was proposed, which introduced both hierarchy architecture and the comprehensive performance of node. Dynamic programming method based on the comprehensive performance of node was used in CPBM, so that the system could adjust the location of each node automatically according to its comprehensive performance. Besides, in every cluster, the nodes followed into a bus-type with their comprehensive performance from high to low, and the node with highest comprehensive performance was selected as the Leader node. Simulation results show that CPBM possesses higher data delivery ratio and bandwidth usage compared with NICE, so that it can improve the performance of application layer multicast fairly well to some extent.

Self-organized hierarchical key management scheme for application layer multicast

2009, 29(11):  2887-2890. 

Asbtract ( )   PDF (631KB) ( )  

Related Articles | Metrics

To solve the scalability and high delay problem in Application-Layer Multicast (ALM) group key management, SOKM, a self-organized large-scale hierarchical ALM group key management scheme was proposed. In this scheme, a special node in each cluster was chosen to be Key Server (KS), which confined the updating and management of group keys in cluster only. Analysis and simulations show that, compared with MHKM scheme, SOKM has the advantages of reducing the probability of KS being attacked and key forwarding delay, which lead to higher security of multicast group and key forwarding rate, although the computation rises. Consequently, MHKM has preferable scalability.

Eigenvector-based approach for multi-user detection

2009, 29(11):  2891-2893. 

Asbtract ( )   PDF (607KB) ( )  

Related Articles | Metrics

The optimal multiuser detection has the exponential complexity, so it cannot be used in practical applications. The authors presented a method to shorten the time of multiuser detection and achieve the real-time requirement. First, the Lagrange multipliers was used to transform the constrained multiuser detection optimization model into a non-constrained one. Second, the non-constrained optimization model was transformed into an algebraic equation. Finally, the multiuser detection solution was transformed to the eigenvectors of a matrix by the deformation of the algebraic equation and the power method was used to calculate the eigenvectors. Simulation results show that the algorithm can significantly shorten the time of detection, reduce the Bit Error Rate (BER), resist near-far effects and increase the user capacity of the system compared with traditional algorithm and particle swarm optimization.

Bluetooth Network Formation Assisted with GSM Signal Fingerprint Wireless Location Method

2009, 29(11):  2894-2896. 

Asbtract ( )   PDF (1093KB) ( )  

Related Articles | Metrics

The accomplishment of mobile station positioning algorithm is achieved through the following step: at first, Spatially Quantized the area covered by GSM network, then set up the signal fingerprint database which base on the real-time collection and analysis of MR frame documents through the usage of 6 received level value in adjacent areas contained in MR frame structure as the signal fingerprint vector information, finally calculate the path loss and the relative distance between base station and mobile station. Furthermore, multiple MR combined threshold set up by the Bluetooth wireless network formation will eliminate positioning errors caused by time-varying factors such as multipath fading and Doppler frequency shift and thereby achieve high-precision real-time field strength positioning methods.

Optimizing trick-play responsiveness in IPTV application

Jing-hua LIN Wei-min LEI Ling-nan LI Song BAI

2009, 29(11):  2897-2900. 

Asbtract ( )   PDF (1093KB) ( )  

Related Articles | Metrics

Optimizing interactive response time is an important measure for improving quality of users’ experience. To reduce end-points process delay, client caching delay and acquisition delay of Random Access Point (RAP), a novel method based on building RAP index table was proposed. Media RAP acquisition and key frame abstraction can be quickly done by searching index table. With the analysis of MPEG-2 system layer and H.264 network abstract layer, two methods of key frame abstraction were given. Whereas there are so many media files stored in media server, program information index built by Hash method was discussed, then program information could be acquired quickly. Based on the index tables of RAP and program information built in pre-processing phrase, trick-play implementation was depicted in detail. Furthermore, the feasibility was verified in the IMS-based IPTV prototype developed by Huawei Technologies Co., Ltd and our laboratory.

Delay-constrained multicast routing algorithm based on shared edges

Yuan-chen LI Wei-qun LIU

2009, 29(11):  2901-0903. 

Asbtract ( )   PDF (553KB) ( )  

Related Articles | Metrics

In order to optimize cost and decrease time complexity, the delay-constrained Steiner tree problem was discussed. The implementation of Minimum Path Heuristic (MPH) algorithm was analyzed firstly, then a delay-constrained multicast routing algorithm based on shared edges named ESAMPH was presented. ESAMPH preferentially selected the nodes through which more shortest path was contained when constructing a multicast routing tree, therefore, the next node to the multicast tree may be also the shortest path through these nodes to reduce the cost of multicast tree. Simulation results show that ESAMPH balances cost, delay and computing time and has better overall performance.

Novel improvement based on stable path for MAODV protocol

Jie HU Bin CHEN Xiang-nan MA Xiao-jing HE

2009, 29(11):  2904-2907. 

Asbtract ( )   PDF (791KB) ( )  

Related Articles | Metrics

The multicast tree in MAODV is reconstructed frequently because of the nodes mobility, making the cost of routing and delay of transmission increase significantly. The neighbor change ratio based stable path selection method was proposed to overcome the shortcomings. And a new neighbor change ratio calculation method was put forward, which did not need to send Hello messages timely. Based on this new method, a stable path based MAODV (SP-MAODV) multicast routing protocol was given with a stable path selection and less hops. The simulation results on data packet transmission rate, routing overhead, average end-to-end delay and delay jitter show that the new protocol reduces interruption probability of the path and improves performance of the protocol.

Minimum hop routing algorithm for WSN based on topology optimization

Lei-lei YU Qiao-lin CHAI

2009, 29(11):  2908-0910. 

Asbtract ( )   PDF (607KB) ( )  

Related Articles | Metrics

For the purpose of energy conservation, a new routing algorithm named MH-TO was proposed based on the idea of the minimum hop routing. The new algorithm optimized the network topology through a power control method of half-match mechanism. Then a "tower model" was introduced to make that all nodes obtain minimum hop information. The packet was sent by the minimum hop path to the sink node when routing. According to the analysis and the simulation results, compared with the self-organized algorithm based on minimum hop, the new algorithm can save energy and balance energy consumption, which extends the life cycle of WSN.

Optimal clock offset synchronous algorithm in wireless sensor network

Wen-juan GUO Ying-long WANG Nuo WEI Qiang GUO Shu-wang ZHOU

2009, 29(11):  2911-2913. 

Asbtract ( )   PDF (562KB) ( )  

Related Articles | Metrics

Concerning the clock skew and clock drift problem in wireless sensor networks, some different methods of synchronization time on synchronization accuracy were studied. With the principle of clock synchronization of cluster-shaped network structure, an optimized clock basis algorithm was put forward. And the Kalman filtering method was applied to adjust the nodes’ clock deviation in optimized recursive way. Compared with the general synchronization algorithm of cluster-shaped, the proposed algorithm can not only improve the synchronization accuracy, but also reduce the energy consumption of synchronous nodes. The simulation results show that the algorithm can accurately describe the synchronization precision and is more efficient for clock synchronization.

State monitoring information routing protocol for event-driven WSN

Jia LV Zhen-hua WU Lin-lan LIU

2009, 29(11):  2914-2916. 

Asbtract ( )   PDF (605KB) ( )  

Related Articles | Metrics

To balance the energy consumption of nodes in Wireless Sensor Network (WSN), the authors proposed a routing protocol to transmit the network health state information based on clustering routing algorithm, named Event-Driven State Monitoring Information Routing (ED-SMIR). ED-SMIR adopted the way with single-hop turning to multi-hop in rotation according to energy consumption rate. For the route from cluster head to the sink, ED-SMIR took multi-hop routing. The simulation results show that, compared with LEACH and EDBCM, ED-SMIR has less energy consumption, and it can balance the energy of the entire network and extend the survival time of network effectively.

Research and design of security module of chip operating system in CDMA2000

Xiao-hu MEI Dai-ping LI Guang-yi GUO Yun-qiang ZHOU Wei YIN Kun GUO Hong-zhi GUO

2009, 29(11):  2917-2919. 

Asbtract ( )   PDF (780KB) ( )  

Related Articles | Metrics

The chip of smart card stores private sensitive defense data of user, which concerns the benefits of customers and mobile phone service providers. To enhance the security and correctness of data with a limited capacity chip is a critical problem. The security module architecture of chip operating system in evolution data of CDMA2000 was designed, and the network access authentication algorithm was put forward with a space optimization method. The file access control, message authentication and data encryption for communication were designed, and the power down protection while modifying flash memory or update several files was introdued. Experimental results prove that the system can run stably, effectively and safely, and ensures the integrity, validity, authenticity of data in storage and transmission between smart card and network.

New mechanism of realizing time-synchronization in LAN by using CPU time stamp

Hua-jin CHEN Shuang-xi LUO Jia-zhou HE

2009, 29(11):  2920-2924. 

Asbtract ( )   PDF (1075KB) ( )  

Related Articles | Metrics

Currently, many computers are required to cooperate frequently in the network application. Therefore, a uniform clock is in need. A new mechanism to realize clock synchronization in LAN by using CPU internal high-precision time stamp was presented; besides, the server and client software was also developed in VC++, and tested under Windows XP and Windows 2000 circumstance in an abbreviated LAN. The result indicates that the algorithm can attain much high synchronization precision, and the system runs steadily.

Channel estimation method based on wavelet packet for MIMO-OFDM system

Chao ZHAO Xi-shun YUE

2009, 29(11):  2925-2927. 

Asbtract ( )   PDF (730KB) ( )  

Related Articles | Metrics

The Least Squares (LS) channel estimation algorithm based on pilot-assisted was investigated for Multiple Input Multiple Output-Orthogonal Frequency Division Multiplexing (MIMO-OFDM) systems, aiming to overcome the shortcoming of LS algorithm being sensitive to the noise. The authors proposed a channel estimation method based on wavelet packet de-noising, which is interpolating after de-noising to the channel impulse response of the pilot symbols. Finally, according to the idea of this method, simulations and analysis were carried out based on the Long Term Evolution (LTE) protocol. The results prove that the proposed method has better performance than the traditional LS estimation algorithm: it can reduce the influence of channel noise effectively and improve the accuracy of channel estimation.

Content distribution node selection algorithm on hybrid architecture of P4P and CDN

Ying-mei SONG Fu-ke SHEN

2009, 29(11):  2928-2931. 

Asbtract ( )   PDF (767KB) ( )  

Related Articles | Metrics

Both Content Distributed Network (CDN) based and P2P based architectures have been proposed to distribute data. However, each kind of architecture has its own limitations. By taking advantage of Proactive network Provider Participation for P2P （P4P） which allowed more effective traffic control between applications and network providers, a new hybrid architecture which integrated CDN and P2P based content distribution system was designed, and a content distribution node selection algorithm was given in full details. The algorithm selected the appropriate edge node using network information got from P4P, then contributed its capacity and bandwidth services to other nodes in order to reduce the number of edge prosy servers, increasing the system capacity, while reducing the load of network. Taking into account the circumstances of the underlying network, cost of link and time were tested. The simulation results show that the algorithm reduces the network cost and improves the performance of peers-assisted CDN.

Gossip-based adaptive membership management protocol

Zhi-bin ZHANG Wen-feng FENG Yong-feng HUANG

2009, 29(11):  2932-2935. 

Asbtract ( )   PDF (798KB) ( )  

Related Articles | Metrics

A gossip-based adaptive membership protocol which is oriented to dynamic heterogeneous P2P was put forward. This protocol could dynamically adjust node degree according to node capability, and thus the node degree could be matched with the node capability, and then increasing the resource utilization and load balance. The basic operations of the protocol include: node joining, node exit, node failure restore, and node capability aggregation. The experimental results show that the proposed protocol which adapted to the node capability has higher resource utilization than the not-adapted.

Security of information and network

3GPP authentication and key agreement protocol based on public key cryptosystem

Ya-ping DENG Hong FU Xian-zhong XIE Yu-cheng ZHANG Jing-lin SHI

2009, 29(11):  2936-2938. 

Asbtract ( )   PDF (830KB) ( )  

Related Articles | Metrics

The authentication and key agreement protocol adopted by 3rd Generation Partnership Project (3GPP) System Architecture Evolution (SAE) Release 8 standard was analyzed in contrast with 3G, and several security defects in SAE protocol were pointed out, then an improved 3GPP SAE authentication and key agreement protocol was put forward based on public key cryptosystem. In the new protocol, user’s identity information and authentication vector in network domain were encrypted based on public key cryptosystem, public parent key adopted in local authentication was generated by random data. The security and efficiency of the proposed new scheme was analyzed at last. The analysis results show that the proposal can effectively solve the problems mentioned above and improve the security of protocol with less cost.

Research of matrix bloom filter in virus filtering firewall

Jing-zhong WANG Fei DU

2009, 29(11):  2939-2941. 

Asbtract ( )   PDF (973KB) ( )  

Related Articles | Metrics

Concerning the inefficient problem of traditional signature-based virus filtering algorithm in practice, a novel virus filtering algorithm based on Matrix Bloom Filter (MBF) was proposed. Based on the analysis of the space efficiency, time efficiency and the potential effects of false positives, the mathematical model of the algorithm was studied and the design scheme of virus filters in high-speech engine was given. Finally, the simulation experimental results demonstrate the effectiveness and practicability of the proposed algorithm.

Audio steganography algorithm based on lifting wavelet transform and matrix coding

Lan-jun ZHENG Qiu-yu ZHANG

2009, 29(11):  2942-2945. 

Asbtract ( )   PDF (922KB) ( )  

Related Articles | Metrics

With the main purpose of improving the embedding capacity and concealment, using Human Auditory System (HAS) masking properties, an audio steganography algorithm based on lifting wavelet transform and matrix coding to embed secret information was proposed. MPEG Ⅰ audio psychoacoustic model 1 was used to control embedding frames, middle and low frequency coefficients of lifting wavelet transform was choosen to host audio signal, and matrix coding which could improve embedding efficiency and decrease modified proportion was exploited to realize the secret information hiding. The simulation experimental results show that the algorithm not only has excellent concealment and embedding capacity, but also good robustness against noise addition, low pass filtering, resampling, MP3 compression and synchronization attack. Meanwhile, the method can realize blind extraction.

Complexity stability of several chaotic pseudorandom sequences

Jin-mei LIU Shui-sheng QIU

2009, 29(11):  2946-2947. 

Asbtract ( )   PDF (988KB) ( )  

Related Articles | Metrics

Complexity stability of sequences is one of the important characteristics of chaotic pseudorandom sequences. Based on the definition of the index in primitive production process (IPP) of a sequence, the concept of weight IPP was proposed. Moreover, the absolute change and the relative change of IPP were recommended to measure the complexity stability of chaotic pseudorandom sequences and some conclusions were drawn. Numerical simulations on several chaotic pseudorandom sequences indicate that the proposed indices are effective in measuring complexity stability of short chaotic sequences.

Secure multicast scheme based on public key broadcast encryption

Li-qing CHEN

2009, 29(11):  2948-2951. 

Asbtract ( )   PDF (709KB) ( )  

Related Articles | Metrics

The difficulty of utilizing public key broadcast encryption in secure multicast is keep balance between implementation cost and security. Taking identity to differentiate each receiver, and using a group of identities instead of group public key in general public key broadcast encryption schemes, the length of system public key parameters was shorten. The procedures of secure multicast communications utilizing the new scheme show that the new scheme is efficient in decreasing the cost of computation and communication, and reaches the semantic security that can fight against chosen ciphertext attack.

Global abnormal correlation analysis method for DDoS attack detection

Zong-lin LI Guang-min HU Dan YANG Xing-miao YAO

2009, 29(11):  2952-2956. 

Asbtract ( )   PDF (560KB) ( )  

Related Articles | Metrics

DDoS attack is hard to detect in backbone network, for the reason that attack flows are distributed in multiple links and prone to be masked by tremendous amounts of background traffic. To solve this problem, a detection method based on global abnormal correlation analysis was proposed. The change of correlation between traffic caused by attack flows was exploited for attack detection, the correlation between potentially anomalous traffic was extracted by principle component analysis, and its change degree was used as an indicator of attack. Evaluation shows effectiveness of the proposed method, and proves that it overcomes the difficulties in detecting relatively low volume of DDoS attack transiting in backbone network. Compared with the existing network-wide detection method, it achieves higher detection rate.

Cryptanalysis and revelation of some certificateless signatures

Yu-lei ZHANG Cai-fen WANG Yong-jie ZHANG Wen-hua CHENG Ya-ning HAN

2009, 29(11):  2957-2959. 

Asbtract ( )   PDF (576KB) ( )  

Related Articles | Metrics

The Certificateless Signature (CLS) scheme simplifies the need of certificates in the Public Key Infrastructure (PKI), thus the CLS scheme is vulnerable to key replacement attacks. The schemes proposed by Ming-Wang, Li-Cheng-Sun and Cao-Paterson-Kou were analyzed. It is shown that these schemes are insecure because of an adversary who replaces the public key of a signer can forge valid signatures. Then the schemes were improved by binding technology, which satisfied a definition of Rafael-Ricardo’s certificateless general mode. Finally, it was shown that the identity-based cryptosystem signature scheme cannot be applied to CLS directly when a CLS scheme is designed.

Even scrambling algorithm of image position based on Arnold cat transformation

Jian ZHANG Xiao-yang YU Hong-e REN

2009, 29(11):  2960-2963. 

Asbtract ( )   PDF (1926KB) ( )  

Related Articles | Metrics

Arnold cat transformation is widely applied and has the best scrambling effect. However, it has some disadvantages, such as small key quantities and poor generalizability. From the scrambling essential, the concept of even scrambling was presented. At the same time, an algorithm of image position scrambling on the basis of improving Arnold cat transformation was put forward. The experimental results show that the key quantities and scrambling effect of the proposed algorithm are improved obviously, and it can resist cut attack.

Research on scanning strategy of DDoS attack in hybrid networks

Kai ZHANG Huan-yan QIAN Yan-gui XU

2009, 29(11):  2964-2968. 

Asbtract ( )   PDF (1060KB) ( )  

Related Articles | Metrics

The technology of Network Adress Translator (NAT) is widely used in the Internet. With this technology, computers set behind the NAT are separated to the external net. Attacker can hardly find and invade those computer behind the NAT by the conventional technique. Some principles of DDoS attack were briefly introduced and a concrete analysis about the effect of NAT on DDoS attack was given. To overcome the weakness of traditional mode in describing the propagation of DDoS attack, a new scanning strategy based on the Teredo technology and search engines was presented. Attacker could more rapidly invade computers set behind the NAT and use those computers more efficiently to actualize the DDoS attack. Compared with the conventional invasive methods, the simulation results show that the new method is more effective and feasible.

Rule matching mapping algorithm for firewall based on rule decomposion mapping

Ye TANG

2009, 29(11):  2969-2971. 

Asbtract ( )   PDF (872KB) ( )  

Related Articles | Metrics

Parallel Tree Search (PTS) is one of the best algorithms among the existing algorithms for rule matching. However, PTS needs to construct so many external nodes and only supports rules with prefixes. The authors proposed an algorithm named RMBRDM for rule matching based on rule decomposing. At first, RMBRDM employed heuristic methods to choose a standard dimension. And then rules could be decomposed according to rule decomposing mapping and the standard dimension. At last, a binary decision tree could be built. Algorithm analysis and simulation results show that RMBRDM can support rules with ranges and the performance of RMBRDM is better than that of PTS.

Digital image hiding technology based on chaotic system with variable parameters

Zhi-gang ZHOU Su-gui LI

2009, 29(11):  2972-2976. 

Asbtract ( )   PDF (2011KB) ( )  

Related Articles | Metrics

To ensure the security and robustness of hiding image information under the conditions of visibility, a digital image hiding method based on a chaotic system with variable parameters was proposed. Firstly, with the pseudo-random sequences generated by the chaos system, a hiding image was encrypted. Secondly, the one-dimensional vector which transformed from the template image was divided into a number of equal parts according to the size of the hiding image, and each part corresponding to each pixel of the hiding image. Finally, with the new chaotic sequences and digital image blending technique, the pixel of hiding image was blended into a position of the part. This digital image hiding technique improves the imperceptibility and security of hiding image. Simulation results show that the proposed technique has good imperceptibility and high robustness.

New secrete information hiding method for remote sensing images

Qin YUE Chen CHEN

2009, 29(11):  2977-2979. 

Asbtract ( )   PDF (917KB) ( )  

Related Articles | Metrics

To prevent the leak of secrete information hidden in remote sensing image, a sample-based method for image inpainting was used in hiding secrete information in remote sensing image. The method selected the maximum region similar to secrete information image, and covered the secrete information block, thus hiding the secrete information. The method had not only strong invisibility, but also little influence on the use of remote sensing image. With reference to digital watermarking, whether users can see secrete information or not according to their authority status was realized, which facilitated the use of remote sensing image. Experimental results show that the method is feasible, and it improves the application security of remote sensing image.

Improved Pre-distribution key management scheme for WSN

Hang-zhe CHEN Xiao-ming WANG

2009, 29(11):  2980-2982. 

Asbtract ( )   PDF (652KB) ( )  

Related Articles | Metrics

Wireless Sensor Network (WSN) was usually vulnerable to conspiracy attack from its adversaries when using bivariate polynomial key pre-distribution protocol. In order to solve this problem, a pre-distribution key management scheme for WSN was improved by reducing the amount of pairwise keys sharing between sensor nodes and changing the means of establishing pairwise keys between clusters. Analysis shows that the improved scheme not only maintains the advantages such as higher security of the original scheme, but also saves the limited memory storage of sensor nodes further, reduces the communication overhead of sensor nodes, extends the lifespan of the networks and can withstand conspiracy attack effectively.

Fast and secure elliptic curve scalar multiplication algorithm based on side channel atomicity

Bao-dong QIN Fan-yu KONG

2009, 29(11):  2983-2986. 

Asbtract ( )   PDF (699KB) ( )  

Related Articles | Metrics

Simple power analysis is the most devastating attack on the security of elliptic curve scalar multiplication and can retrieve the secret key in some degree. A fast and secure side channel atomic elliptic curve scalar multiplication algorithm was put forward using the side channel atomic block S-A-N-A-M-N-A. In Jacobian coordination, the new algorithm used only 5M+5S+15A for doubling and 6M+6S+18A for mixed addition. In modified Jacobian coordination, the new algorithm used only 4M+4S+12A for doubling and 7M+7S+21A for mixed addition. Compared with the previous methods, the new method can improve the speed by about 7.8%~10% if S/M=0.8 or 18%~20% if S/M=0.6 for 192 bit scalar using NAF recoding.

Security enhanced virtual disk encryption system and technology

Kai-bin NI Guo-xiang YAO Quan-long GUAN

2009, 29(11):  2987-2989. 

Asbtract ( )   PDF (1140KB) ( )  

Related Articles | Metrics

The authors studied and improved the transparent encryption and decryption program of virtual disk encryption software, using technology of file system filter driver and methods of auditing, preventing U disk proliferation and cache leakage. A file system filter driver layer was attached to the virtual driver layer in the program of virtual disk encryption. Test results in Truecrypt under various versions of Windows operation system show that problems of U disk proliferation and cache leakage can be avoided when the security layer is attached onto the virtual disk encryption software, and users’ operations can also be monitored and audited. The results indicate that the security layer can effectively enhance security performance of the virtual disk encryption software.

Efficient identity-based ring signature scheme

Wen-qiang WANG Shao-zhen CHEN

2009, 29(11):  2990-2992. 

Asbtract ( )   PDF (743KB) ( )  

Related Articles | Metrics

A new efficient identify-based ring signature scheme was proposed by skillfully setting public parameters. It can reduce the bilinear pairings needed in verifying phase by using liner relations between signature parameters and identify. It is proved to be unforgeable in the standard model, and is unconditionally anonymous. Compared with the existing attribute-based ring signature scheme, for a ring of n members, the signature only requires 2 pairings to verify. Thus the efficiency of verifying the signature improves greatly.

Image encryption algorithm based on inter-perturbation of dual chaotic systems

Yong-hui HU Xing-ye LI

2009, 29(11):  2993-2997. 

Asbtract ( )   PDF (1203KB) ( )  

Related Articles | Metrics

An image encryption algorithm based on inter-perturbations of dual chaotic systems was proposed for the possible degradation of low-dimensional chaotic system and the high computing work of high-dimensional chaotic system. Dual chaotic system was constructed through inter-perturbations of two simple Logistic mappings. And the most prominent feature of inter-perturbations between chaotic systems was that perturbation included constant perturbation and random perturbation simultaneously, which not only ensured the necessary system complexity, but also increased the range of system parameters. Taking dual chaotic inter-perturbed system as sequence key generator, an improved quantization method for converting chaotic sequence to binary sequence was put forward. Random testing and correlation analysis were done on binary sequence. The results show that the binary sequence has good pseudo-randomness and correlation, and appropriate to be encryption key. Simulation results of image encryption applied with the binary sequence also show that the binary sequence can cover up plaintext effectively and safely, and good encryption results are achieved.

RFID pseudorandom number generator based on clock-controlled non-linear sequence

Xue-li QIN Ming CHENG Wei LI

2009, 29(11):  2998-3000. 

Asbtract ( )   PDF (558KB) ( )  

Related Articles | Metrics

Focused on the study of Pseudo-Random Number Generator (PRNG) in RFID encryption system, a design of complex clock-controlled PRNG was proposed, which is constituted by the linear feedback shift register (LFSR). Some characteristic parameters of the design were analyzed, such as sequence cycle, linear-complexity, uniformity, power consumption etc, through the Matlab and Quartus Ⅱ sofeware. Hardware circuit used the low-cost and low-power Cyclone II of FPGA products. This method maintains these properties of long cycle and high linear complexity of the clock-contrlloed non-linear sequence, but also improves the uniformity of output sequence. In addition, this design of circuit structure is simple and can output 16 bit parallel data. Therefore, it can satisfy the requirements of RFID encryption system.

Research and design of Agent integrity protection mechanism on remote untrusted platform

Cui YANG Cheng-xiang TAN

2009, 29(11):  3001-3004. 

Asbtract ( )   PDF (747KB) ( )  

Related Articles | Metrics

Plenty of security problems may occur when servers adopt Agent to deploy mobile codes so as to realize interactive storage between different business clients. In order to pursue a higher reliability of the software, and to make sure those Agents healthily running in an untrusted complex environment, after analyzing traditional integrity validating mechanism, combining I&A, PCC and reflection techniques, a new classified mechanism of enabling the integrity of trusted terminal Agents was proposed, and an efficient validating model with multiple interacting modules was designed, aiming at improving the reliability of the mobile codes by realizing its behaviors-monitoring.

Graphics and image processing

New super-resolution reconstructing algorithm in image frequency domain

Jin-zong LI Xue-feng YANG Dong-dong LI

2009, 29(11):  3005-3007. 

Asbtract ( )   PDF (838KB) ( )  

Related Articles | Metrics

The de-aliasing Super-Resolution (SR) algorithm in image frequency domain demands some limits on frame numbers and sub-pixel shifts between frames of input Lower Resolution (LR) images, which limits the application range of this algorithm. Using single frame super-resolution method and resample function, the authors produced 16 frames images which have the same resolution as input images from each input LR image and then selected images that meet the requirements from these produced images. Therefore, a novel de-aliasing SR algorithm in image frequency domain from two to many frames of input LR images was proposed. Three simulation experimental results indicate that the proposed algorithm removes the limits on frame numbers and sub-pixel shifts between frames and makes the PSNR of SR images to be increased by about 5dB.

Adaptive regularization for super-resolution image reconstruction based on local structures

Jian-hua YUAN

2009, 29(11):  3008-3010. 

Asbtract ( )   PDF (783KB) ( )  

Related Articles | Metrics

Super-resolution image processing is an ill-posed problem, which needs to be regularized in the reconstruction. There are two class regularization errors in the regularized reconstruction image, which are related strongly to the local structures encountered within the image. An algorithm about super-resolution image reconstruction was proposed, which could reconstruct the super-resolution image adaptively based on the image local structures. The edge region and the smooth region were distinguished by the image local statistic variance. The observed model was reinforced in the edge region during the reconstruction, while the regularization was emphasized in the smooth region. The experiments show this algorithm is better than the traditional algorithms and the TV reconstruction algorithms, and is robust to the regularization parameter.

Multi-scale feature points detection and local region spectral descriptor for matching unorganized points data

Wei-yong WU Ying-hui WANG

2009, 29(11):  3011-3014. 

Asbtract ( )   PDF (1002KB) ( )  

Related Articles | Metrics

In order to align partly overlapped data clouds measured from different view points, a multi-scale feature points detection algorithm was proposed. A few feature points can be extracted from large number of original data quickly. This algorithm consists of three steps: discrete curvature computing, bilateral filtering and feature points detecting. The number of feature points can be controlled by scale parameter approximately. For each feature point, the authors proposed local shape spectral descriptor to identify its local shape characteristic. Firstly, an affinity matrix was constructed using distance and curvature information of points in neighborhood of a feature point, and then a few of eigenvalues of affinity matrix were used to form a shape descriptor, with which the correspondence between different data sets can be computed easily. Some examples prove that the method is robust and efficient for aligning large number of data with noise.

Image enhancement for rock fractures based on fractional differential

Wei-xing WANG Yin YU Jun LAI

2009, 29(11):  3015-3017. 

Asbtract ( )   PDF (1035KB) ( )  

Related Articles | Metrics

Starting from the enhanced ability of fractional differential to image details, the authors analyzed the mechanism of fractional differential. By averaging the nonzero weights of operator template to the image pixels which have the same distance to constant coefficient “1” as well as utilizing self-dependency of surrounding pixels, an improved fractional order differential operator template was achieved. The experimental results show: in response to those images that have rich textural detail information, fractional differential outperforms integral differential operation to extract the textural detail information in smooth region witout too much gray scale change.

Local motion correction for functional magnetic resonance images

Sen LIU Jie-xin PU Li ZHAO

2009, 29(11):  3018-3020. 

Asbtract ( )   PDF (575KB) ( )  

Related Articles | Metrics

In brain functional Magnetic Resonance Imaging (fMRI) experiment, motion correction is an important step in data preprocessing. Results of motion correction affect the follow up analysis such as detecting the functional activation area and functional connectivity. There are some simplified hypotheses for head motion in the common analysis software packages. Due to large volume of data, the correction error is also large. In order to reduce the correction error, a novel motion correction method was proposed based on local rigid transform. This method first used adjacent weighted slices to construct local volumetric data for each slice in a multi-slice echo planar imaging volume data, and then estimated the space position of each slice by the registration of local volumetric data using the modified Gauss-Newton optimization algorithm. Finally the image stack was re-sliced using Delaunay triangulation method. Results of implementation based on this method during phantom data and human vision experiments reveal that it is effective to reduce the correction error, which leads to accurate realignment.

SAR images screening based on bit-plane characteristics

Can-bin HU Fang LIU Jun-hong ZHOU

2009, 29(11):  3021-3026. 

Asbtract ( )   PDF (2481KB) ( )  

Related Articles | Metrics

In order to obtain the SAR images which include the typical target of interest, a new method of SAR images screening based on bit-plane characteristics was proposed according to the imaging characteristic of target. Based on the suitable gray pretreatment to the images, the target’s prior knowledge was analyzed, the significant bit-plane image was paid attention by the measurement of bit-plane complexity, run length and frequency spectrum. And then SAR images were screened combined with the gray histogram features. Around the airport SAR images, experiment shows that the method can screen the images rapidly. Besides, the airport target is extracted successfully, which can satisfy the requirements.

Rocket image sequence segmentation algorithm combined with edge detection and improved Otsu algorithm

2009, 29(11):  3027-3029. 

Asbtract ( )   PDF (1261KB) ( )  

Related Articles | Metrics

To satisfy machine vision based rocket tracking servo system’s requirements for rocket target segmentation, a segmentation method combined with Prewitt edge detection operator with decaying factor and improved Otsu algorithm was proposed. Based on the rocket’s morphological characteristics, a nonlinear filter de-noising method was presented to denoise and remove the non-rocket edge. Simulation results show that the proposed method has 96.5% successful segmentation rate for rocket target, and can effectively segment rocket image sequence in real-time.

Fast data point simplification algorithm based on curvature character

Xing DAI Han-guo CUI Huai-yu HU

2009, 29(11):  3030-3032. 

Asbtract ( )   PDF (886KB) ( )  

Related Articles | Metrics

To improve the efficiency of entity reverse building, the authors proposed an algorithm to simplify cloud data quickly. This algorithm searched and preserved characteristic point according to a rule of curvature change between characteristic point on a surface constructed from a spatial point and its nearest neighbors. Based on the search result, the algorithm gave a characteristic point distributing evaluation to the whole cloud data; and according to the evaluation result, a shortened distance was set to simplify the cloud data. Because the algorithm adequately preserved scattered points in the characteristic area, the cloud data can better express shape after simplification. For the reason that the whole searching process only aims at the maximal point of Gaussian and its neighbors without computing every metrical point, the algorithm greatly raises running speed compared with the traditional cloud data simplification algorithm.

Adaptive image denoising algorithm based on generalized variational model

Yi-yan WANG

2009, 29(11):  3033-3036. 

Asbtract ( )   PDF (980KB) ( )  

Related Articles | Metrics

A new improved algorithm for image denoising was proposed by analyzing the Total Variational (TV) model. According to the viewpoint of Maximum A Posteriori (MAP) and Markov Random Field (MRF) theory, a generalized variational functional model was deduced. And the Lagrange multiplier λ used for balancing the data fidelity term and regularized term was adaptively improved. An edge preserving potential function was adopted, which had good robustness to noises; finally an iterative algorithm was exploited to solve the energy functional combining weighted gradient descent flow and semi-point scheme. Experimental results show that the proposed model has good performance in image denoising. It is obviously superior to the conventional variational model in both visual effect and PSNR.

Pattern recognition

Face recognition method based on relative gradient

Hong-zhi GAO Kun DENG Lu YAO Yun-long ZHAO

2009, 29(11):  3037-3039. 

Asbtract ( )   PDF (794KB) ( )  

Related Articles | Metrics

Based on the original relative gradient operator, the authors proposed a new relative gradient operator and combined it with 2DPCA or 2DFLD. A face recognition algorithm based on this new relative gradient operator was also put forward. Experimental results on AR and Yale_B face database show that, the method has robustness to the complex change like various expression and lighting condition. The recognition accuracy of the method is much higher than 2DPCA, 2DFLD and face recognition based on the original relative gradient operator. What is more, experiments were done on three different sizes of windows, which confirms that, when the window size is 3×3, the recognition result is relatively the best.

Facial expression recognition algorithm based on local Gabor wavelet automatic segmentation

Shan-shan LIU Ling WANG

2009, 29(11):  3040-3043. 

Asbtract ( )   PDF (1124KB) ( )  

Related Articles | Metrics

A local Gabor wavelet facial expression recognition algorithm based on automatic segmentation to the still image containing facial expression information was introduced. Firstly, mathematical morphology combined with projection was used to locate the brow and eye region, and the mouth region was located by calculating template average, which can segment the expression sub-regions automatically. Secondly, features of the expression sub-regions were extracted by Gabor wavelet transformation and then effective Gabor expression features were selected by Fisher Linear Discriminant (FLD) analysis, removing the redundancy and relevance of expression features. Finally the features were sent to Support Vector Machine (SVM) to classify different expressions. The algorithm was tested on Japanese female facial expression database. It is easy to realize automation. The feasibility of this method has been verified by experiments.

Pedestrian tracking with automatic selection of characteristics

Jun ZHANG Zhi-jing LIU Hong-rui ZHANG

2009, 29(11):  3044-3047. 

Asbtract ( )   PDF (1387KB) ( )  

Related Articles | Metrics

According to the non-rigid characteristics of the moving target, an algorithm based on Mantle ratio, which can effectively separate multi-target using Support Vector Machine (SVM) and automatically select the largest characteristic region of non-rigid was proposed. It canceled the special requirements of selected regions beforehand.

Palm vein features extraction based on median-length included angle chain

Chuang YANG Jia-xin CHEN Wei LI

2009, 29(11):  3048-3050. 

Asbtract ( )   PDF (733KB) ( )  

Related Articles | Metrics

An improved approach: median-length included angle chain, combined with the included angle chain was presented to extract the structural features of the palm vein. The way is to model a curve segment of palm vein textures by a number of variable-length line segments through media value iteration and let distance criterion control the fitting error, under permitted error, using the included angles sequence between a pair of neighboring line segments to represent the curve segment. Experimental results show that while the computation precision is ensured, the proposed algorithm still can reduce the computation and acquire the structural features of the palm vein.

Output code algorithm for ierarchical error correcting based on KNNModel

Yi yiXIN Gong-de GUO Li-fei CHEN Jie HUANG

2009, 29(11):  3051-3055. 

Asbtract ( )   PDF (990KB) ( )  

Related Articles | Metrics

Error Correcting Output Codes (ECOC) is an effective algorithm to handle multi-class problem; however, the ECOC coding is only on the class level and the ECOC matrix is pre-designed. A novel classification algorithm based on hierarchical ECOC was proposed. The algorithm first used KNNModel to build multiple clusters on a given dataset and chose few clusters for each class as representatives to construct a hieratical coding matrix in training phase, and then the matrix was used to train each single classifier. In testing phase, the proposed method makes the most of the merits of KNNModel and ECOC through models combination. Experimental results in the UCI data sets show the effectiveness of the proposed method.

Artificial intelligence and advanced computing

DNA codewords design based on improved NSGA-Ⅱ

Yan-feng WANG Yong-peng SHEN Xun-cai ZHANG Guang-zhao CUI

2009, 29(11):  3056-3059. 

Asbtract ( )   PDF (712KB) ( )  

Related Articles | Metrics

Concerning DNA codewords design, the authors set up the mathematical model by analyzing the objectives and the restrictions that should be satisfied. A new codewords design method named the Improved Non-dominated Sorting Genetic Algorithm (INSGA-Ⅱ) was proposed by introducing the constraints to the non-dominated sorting process. The experiments demonstrate that INSGA-Ⅱ has higher convergence speed and better population diversity than those of NSGA, and can provide reliable and effective codewords for the controllable DNA computing.

Simultaneous localization and mapping method based on DDPF-DDF

Yi-min XIA Yi-min YANG

2009, 29(11):  3060-3063. 

Asbtract ( )   PDF (786KB) ( )  

Related Articles | Metrics

A simultaneous localization and mapping method was brought forward based on Divided Difference Particle Filter-Divided Difference Filter (DDPF-DDF) in allusion to the high complexity problem of FastSLAM improvement algorithm. This method adopted DDPF to estimate the path of robot and DDF to estimate the landmark position. It also adopted selectable resample to lower the probability of sample deletion. The experimental results indicate that the method has high precision, good consistency and moderate complexity.

Clause searching method in first-order logic

Yuan-hua GUO Zhen-bing ZENG

2009, 29(11):  3064-3067. 

Asbtract ( )   PDF (693KB) ( )  

Related Articles | Metrics

Deciding satisfiability of clause set is one of the active research topics in the automated reasoning field. A clause searching method of deciding satisfiability of propositional clause set Φ was proposed. This method first searched one clause C which cannot be extended from all clauses in Φ, if and only if C exists Φ was satisfied and the negative of C was one model. The authors updated clause searching method to first-order by partial instantiation method. Clause searching method in first-order logic can decide M satisfiablility of clause set and is of terminating, sound and complete property. It is a valid method for deciding satisfiability of clause set.

Cooperative particle swarm optimization

Huai-liang LIU Rui-juan SU Ruo-ning XU Ying GAO

2009, 29(11):  3068-3073. 

Asbtract ( )   PDF (1065KB) ( )  

Related Articles | Metrics

To solve the premature convergence problem of Particle Swarm Optimization (PSO), two new methods were introduced to improve the performance cooperatively: When particles’ fitness values were worse than the average, the dynamic Zaslavskii chaotic map formula was devised to modify the inertia weight and velocity, which can make particles break away from the local best and search the global best dynamically; On the contrary, when fitness values were better than or equal to the average, the introduced dynamic nonlinear functions were used to modify the inertia weight and velocity, which can make particles retain favorable conditions and converge to the global best continually. Two methods coordinate dynamically, and make two dynamic swarms cooperate to evolve. Experimental results demonstrate that the new introduced algorithm outperforms several other famous improved PSO algorithms on many well-known benchmark problems.

Study on semantic similarity algorithm based on ontology

Yong-jin ZHAO Hong-yuan ZHENG Qiu-lin ZHENG

2009, 29(11):  3074-3076. 

Asbtract ( )   PDF (596KB) ( )  

Related Articles | Metrics

The research about concept similarity is very important in knowledge representation and information retrieval. After studying the current classic distance-based semantic similarity algorithm, a more standardized similarity algorithm was proposed by analyzing the other key factors of semantic concept and increasing the impact of the node density and attributes of the concept for the semantic similarity. Through the experimental analysis, the similarity value of the improved algorithm is more reasonable; and compared with human subjective judgements under certain condition of the mediation parameter, the compatibility of the improved algorithm increases about 15% than that of the original algorithm.

Database and data mining

Application of outlier customer meaning analysis in quality management

Yue WANG Ya-hui LIU Chuan-yun XU

2009, 29(11):  3077-3079. 

Asbtract ( )   PDF (576KB) ( )  

Related Articles | Metrics

The customer meaning for outlier explanation is rarely provided in the current studies. The outliers usually contain important information, and for many applications, the explanations are as important to the user as the outliers. A new definition of outlier customer meaning was given, and a new outlier customer meaning analysis algorithm named DSCM was put forward based on distance sum. The algorithm gave an explanation of every outlier, which improved the user’s understanding of the data. Then the algorithm was applied to quality management, and the results show that the algorithm is effective and practical, and more easy to use.

Query processing strategy of XML path expression based on schema

2009, 29(11):  3080-3083. 

Asbtract ( )   PDF (988KB) ( )  

Related Articles | Metrics

To make effective use of path information and reduce the number of joint operations, the authors labeled each element or attribute in DTD with a binary prefix code, and introduced the DTD code into the numbering scheme for XML documents. Based on this, path expression queries were decomposed into a series of query fragments. Then these query fragments were efficiently evaluated by using a bit-wise operation of the binary prefix codes. Finally, the results of the query fragments were composed by structural joint. The experimental results show that the proposed approach is effective and efficient.

Query sharing model in data stream system

Dan WANG Mao-zeng MAO

2009, 29(11):  3084-3087. 

Asbtract ( )   PDF (864KB) ( )  

Related Articles | Metrics

Query sharing is an effective way to share the same or similar storage structures and query operations during the query procession so as to lessen the repetitive storage and resources occupation in a data stream system. For query storage sharing, a middle-result storage structure was designed, and accordingly an index-based algorithm with two-level indirect storage of the sharing queue was presented to enable the proper sharing of middle storage results, which can improve the flexibility for the data tuple to migrate as well. Meanwhile, for the multi-queries sharing, an algorithm to pick up the same query operations from several data streams was proposed, which can reduce the system processing resources by sharing the same processing resources in query operations. The model and algorithm were analyzed and discussed.

Credit scoring model of detecting illegal cash advance based on Logistic

Sheng JIANG

2009, 29(11):  3088-3091. 

Asbtract ( )   PDF (996KB) ( )  

Related Articles | Metrics

The illegal-cash-advance is one of the major fraud risks of the credit-card industry. There is almost no difference between single illegal-cash- advance transaction and the normal one, so it could not distinguish them based on different characteristics. To detect the illegal-cash-advance accounts automatically and accurately, the authors picked up correlative variables first, then made a business analysis, and took advantage of the nonlinear curve feature—the one defection of Logistic, and overcame the sensitivity of the multidimensional relativity between independent variables — the another defection, at last computed the weight of coefficient, and constructed a credit scoring model. The applications indicate that the accuracy of the model has achieved 82.72%.

Uncertain data decision tree classification algorithm

Fang LI Yi-yuan LI Chong WANG

2009, 29(11):  3092-3095. 

Asbtract ( )   PDF (756KB) ( )  

Related Articles | Metrics

Classic decision tree algorithm is unfit to cope with uncertain data pervaded at both the construction and classification phase. In order to overcome these limitations， D-S decision tree classification algorithm was proposed. This algorithm extended the decision tree technique to an uncertain environment. To avoid the combinatorial explosion that would result from tree construction phase, uncertainty measure operator and aggregation combination operator were introduced. This D-S decision tree is a new classification method applied to uncertain data and shows good performance and can efficiently avoid combinatorial explosion.

Study on method for mining concurrent sequential pattern

Yang ZHANG Wei-ru CHEN Shan-shan CHEN

2009, 29(11):  3096-3099. 

Asbtract ( )   PDF (744KB) ( )  

Related Articles | Metrics

The definitions of concurrent relation and concurrence threshold were re-submitted. On the basis of these definitions, the concept of concurrent sequential pattern was given. The method to mine concurrent sequential patterns was also proposed, named concurrent sequential patterns mining method based on supporting vector. Under this method，through finding the supporting vector of each element of sequential patterns, the two branch concurrent sequential patterns and their supporting vectors could be got. The supporting vectors of k branch sequential pattern and their supporting vectors could be acquired using supporting vector of any k-1 branch concurrent sequential pattern and supporting vector of any sequential pattern, and thus the whole k branch concurrent sequential patterns could be found. The method was tested and analyzed to be efficient and feasible through experiments.

Study on theme-drift of hyperlink-induced topic search algorithm

Qi GAO Yong-ping ZHANG

2009, 29(11):  3100-3102. 

Asbtract ( )   PDF (732KB) ( )  

Related Articles | Metrics

Hyperlink-Induced Topic Search (HITS) algorithm is a classic hyperlink-based algorithm. But the HITS algorithm is purely based on the hyperlink, and it ignores the text of the linked page and does not distinguish the importance between the different hyperlinks. Because of this, a theme-drift phenomenon often happens when using HITS algorithm. The improved algorithm based on the HITS algorithm makes use of the classic tf-idf algorithm to calculate the related weight between the linked page and the query. The improved algorithm can make the search engine ranking results more in line with the query, and the corresponding precision rate has also been greatly improved.

Application of decision tree construction algorithm based on decision classify-entropy

Guang DONG Ying-qi WANG

2009, 29(11):  3103-3106. 

Asbtract ( )   PDF (715KB) ( )  

Related Articles | Metrics

In order to better complete the task of classification mining on financial datasets, decision classify-entropy concept was put forward based on the rough set theory; and based on this concept, a novel decision tree construction algorithm was proposed. To overcome over-fitting, inhibiting factor was introduced to control decision tree construction. The case study and experimental results in financial datasets show that, compared with the classical C4.5 algorithm, the new algorithm can resolve the drawbacks of the traditional algorithm and could construct a suboptimal decision tree effectively. The application in financial field also proves that the new algorithm can finish the objective task much better.

Software process technology

Generalized model for software functional size measurement

Xun-mei GU Hui-qun YU

2009, 29(11):  3107-3109. 

Asbtract ( )   PDF (736KB) ( )  

Related Articles | Metrics

Functional Size Measurement (FSM) methods obtain the functional size of software systems by quantifying the Functional User Requirements (FUR). Since different FSM methods use distinct abstractions to depict a software system, a generalized model was proposed. According to the generalized abstraction of the software system, data groups and transactions involved in the measurement process were generalized at first. And then an example of IFPUG FPA was given in order to interpret the transformation and mapping of Function Point Analysis to the generalized model. Finally, the algorithm description of the measurement process was presented.

Dependence analysis and regression testing of object-oriented software

Shu-feng CHEN Hong-yuan ZHENG

2009, 29(11):  3110-3113. 

Asbtract ( )   PDF (768KB) ( )  

Related Articles | Metrics

Concerning the complex dependence between classes in the object-oriented software, through the analysis of all kinds of static relations in UML Class Diagram (UCD), a dependence analysis model was proposed. In order to implement automatic analysis, the concept of Class Dependence Relation Graph (CDG) was introduced. Meanwhile, a CDG creation algorithm based on the XMI file exported from UCD was proposed. On the basis of this model, the test path search algorithm was proposed by the impact analysis of UCD. With the help of test path search algorithm, class set and test paths that need regression testing can be obtained.

Project’s priority assessment method in software enterprises based on hybrid weight

Xiao-hong SHAN Xiao-yan LIU

2009, 29(11):  3114-3116. 

Asbtract ( )   PDF (730KB) ( )  

Related Articles | Metrics

How to assess the project’s priority is one of the key questions that software enterprises encounter when they are selecting the projects. From the characteristics of software projects, the authors aimed to provide an easy and feasible project’s priority assessment method for software enterprises. First, an index system of project’s priority assessment in software enterprises was constructed, then based on the index system, six steps to assess the project’s priority were introduced, in which a method of combining the entropy weight with the subjective weight was applied to confirm the index weight. The method changed the defects of depending on the opinions of the experts. Lastly, an example was given to prove the feasibility. The comparison of this model and the method only reling on the subjective weight given by experts, show that the proposed model is more objective and consistent with the reality.

Ontology collaborative editing platform for business process integration

Hong-fei ZHAN

2009, 29(11):  3117-3119. 

Asbtract ( )   PDF (616KB) ( )  

Related Articles | Metrics

In order to improve the collaborative supporting feature of ontology editing software, utilize the talent resource of distributed experts, and greatly satisfy the demand for team based ontology editing, the grid technology was adopted in the development of ontology editing system, and distributed integrating technology and grid based cooperation technology were designed for the development of the system. The architecture and key technology of the system were discussed. The research can help to increase the veracity of ontology editing, decrease the cost and shorten the time cycle for ontology editing.

User-oriented Web service composition method

2009, 29(11):  3120-3123. 

Asbtract ( )   PDF (1044KB) ( )  

Related Articles | Metrics

To compose heterogeneous Web services distributed on Internet to a new service provided to customer, a user-oriented Web service composition method was proposed, which divided composition process into four phases, as division of user’s needs, selection of Web services, implementation of Web services composition and combination of the output of Web services composed. Also a composition schema-based method for user needs input and division, an effective QoS-based model for Web services selection, and a middle schema-based heterogeneous message transformation model were proposed. Finally, a Web service composition platform applied in logistic area was designed and implemented to show the feasibility and effectiveness of the methods above.

Quality evaluation modeling of requirements analysis based on chaos

Jun-wei GE Zhi GE Yi-qiu FANG

2009, 29(11):  3124-3127. 

Asbtract ( )   PDF (757KB) ( )  

Related Articles | Metrics

Based on the research of chaos and software requirements complexity theory, a theory model was proposed. The model was a trajectory graph consisting of three segments obtained under the described nonlinear equation, and it could guide the evolution process of software requirements, evaluate the quality of requirements process as well. The primary research shows that the evolution process of requirements can be regarded as normal when the requirements evolutionary process changing chart is consistent with the model trajectory. In the end, the efficiency and feasibility of this model on estimating requirements evolutionary process are testified by a specific example.

Typical applications

Damage and protection simulation system of military engineering based on high level architecture

Feng-shan WANG Hong-jun ZHANG

2009, 29(11):  3128-3131. 

Asbtract ( )   PDF (766KB) ( )  

Related Articles | Metrics

To satisfy the needs of damage analysis, protection evaluation, and protection training in military engineering, a simulation structure about damage and protection problems of military engineering, based on High Level Architecture/Run Time Infrastructure (HLA/RTI), was put forward. On the foundation of simulation conceptual design, simulation frame and logic function structure were designed and developed with the aim at component reusability and extensibility based on HLA theory. For model problem is the core problem in HLA federal development, simulation model system in damage and protective fields for military engineering was established, and model was designed, in following the model frame of the military training information system. Finally, federal workflow was given, and federal members’ behavior design with UML sequence diagram, following federal time strategy.

Multiple-step path planning algorithm for automated optical inspection system

2009, 29(11):  3132-3134. 

Asbtract ( )   PDF (1062KB) ( )  

Related Articles | Metrics

A fast three-step path planning algorithm was proposed for automatic optic system to inspect electronic product defects by using surface mount technology. In the first two steps, the algorithm generated a basic path. Based on geometric relation of optical inspection windows, the algorithm relocated the windows’ center to reduce moving distance and the number of windows. The simulation experiments show that the new planning method is practical and fast.

Optimized pipelining scheme for AVS decoder

You-wen HUANG

2009, 29(11):  3135-3138. 

Asbtract ( )   PDF (981KB) ( )  

Related Articles | Metrics

According to the algorithm characteristics in AVS video coding standard, an optimized pipelining scheme was proposed. In this scheme, the hardware decoding modules worked on two different levels. Modules on different level had different data-processing granularity, and buffers between hardware modules were saved. With reasonable processing sequence, data waiting time between modules was reduced. The simulation and synthesis results indicate that a large sum of memory resources is saved without lowering performance of the decoder.

Improved service filter method for Web service matching

Jing LI Wang-hu CHEN Bai-ming FENG

2009, 29(11):  3139-3142. 

Asbtract ( )   PDF (785KB) ( )  

Related Articles | Metrics

To make Web service matching more efficient, the irrelevance of generalized semantic of Web service and the current service request was proposed. It was also proved that Web services satisfying the relation could never be matched with the current request. An efficient rule was also proposed to decide whether the relation was satisfied, which means the intersection of generalized semantics of the service and the request is unsatisfied. Based on this rule, the approach to service filtering for service matching was proposed finally. Applications and experiments show the proposed approach is effective to improve the efficiency of service matching.

Design of control system for intelligent vehicle based on TCP/IP

Wei FANG Wei QIAN Chuan-bao LI

2009, 29(11):  3143-3145. 

Asbtract ( )   PDF (841KB) ( )  

Related Articles | Metrics

Due to the defects of field bus, such as low communication rate and high cost, a new control system based on TCP/IP protocol was designed to embed control system with Server/Client structure. The communication network system, software structure and control method were described in detail. XML language was used to transfer frame data through TCP/IP Ethernet. Message queue scheduling algorithm and data clustering at memory sharing buffer technology were introduced to enhance the system’s real-time response performance and meet the function of warning and control. The experimental result shows that it adopts industrial Ethernet bus with the advantages of high rate of communication, good compatibility and low cost. This design is a feasible and efficient method for computer aided driving and control system in vehicle.

Research on combat capability of weapon system-of-systems by numerical method

Yuan-zheng MA Man-xi YANG Hua-ren ZHOU Ya-ping MA

2009, 29(11):  3146-3149. 

Asbtract ( )   PDF (899KB) ( )  

Related Articles | Metrics

The combat capability of the weapon system-of-systems is an important factor of the unit combat capability, so it is a commonly used key index in analyzing the structure of the unit and evaluating the unit’s capability of completing a certain mission. This system used hierarchical, composable, and entity-oriented data structure to store the weapon system-of-systems, then calculated the capabilities layer by layer of the weapon component, weapon system and weapon system-of-system based on the fire power, maneuver, supply, defense, and intelligence ability (for short "five kind capabilities") and the quantification model and aggregation model. The system preserves the numerical analysis method’s virtue of easy usage and rapid calculation, and gives the solution of aggregating and comparing different weapons’ capability. Its results can be used as reference data for formulating weapon development plan and designing combat training simulation system.

Semantic Web service composition framework based on abstract template

Jia HU Zhi-yong FENG

2009, 29(11):  3150-3153. 

Asbtract ( )   PDF (1111KB) ( )  

Related Articles | Metrics

A framework of semantic Web service composition based on abstract template was proposed, and analysis of the template retrieval, data pre-processing and template adaptation modules of this framework were introduced in detail. In order to improve the accuracy of the template retrieval, the framework adopted the feature matching and graph matching methods in the similarity computation between the abstract template and the user’s request. Besides, it constructed the service dependency graph through the data pre-processing, deleted the useless services and verified the satisfiability of the user’s request. According to the service dependency graph, it implemented the automatic template adaptation, by using the Heuristic Plan Adaptation Algorithm (HPAA), and improved the adaptability and scalability of HPAA by providing the function of the flexible configuration of the heuristic strategies. Finally, the experiments on the different heuristic strategies show the effectiveness and reliability of HPAA when dealing with the large-scale problems.

Dual exponential map parameterization of maintenance Agent model

Xiao-song MAO Shuang-shan MI Peng-yuan LIU Xiao-guang WANG

2009, 29(11):  3154-3157. 

Asbtract ( )   PDF (794KB) ( )  

Related Articles | Metrics

Motion parameterization of complex joint model is the foundation of virtual human motion simulation. The classical parameterization methods of 3D rotation, such as rotation matrix, Euler angle, and quaternion, which bear several drawbacks, cannot resolve the motion parameterization of complex joint model. Based on the improvement of exponential map, a novel motion parameterization method called Dual Exponential Map (DEM) which can depict translation and rotation, linear velocity and angular velocity simultaneously was proposed. The motion description as well as parameters computation capabilities of the DEM were introduced. Finally a simulation on maintenance operation training was implemented. The experimental results illustrate that the DEM method bears powerful capability on derivation, solution to differential and ODEs, optimization control and interpolation.

Nonlinear adaptive predictor for chaotic time series

2009, 29(11):  3158-3160. 

Asbtract ( )   PDF (553KB) ( )  

Related Articles | Metrics

Most chaotic time series prediction algorithms based on linear superposition of basis functions are static and lack of corresponding interpretations between the basis functions and the underlying dynamics. Improvement was made on that these functions that can approximate non-Gaussian were used as basis set, as building a relationship between the basis functions and higher-order statistics of chaotic time series. Furthermore, a nonlinear feedback was applied in the algorithm that can introduce dynamic quality. Simulations show an enhanced performance on both one step prediction error and maximum attempted time, which outperforms the linear prediction and some existing adaptive ones.

Ranked algorithm to fill sinks in digital elevation model based on quicksort

Bang YANG Li-liang REN Ying-qing HE

2009, 29(11):  3161-3164. 

Asbtract ( )   PDF (1347KB) ( )  

Related Articles | Metrics

A new ranked algorithm to fill sinks in Digital Elevation Models (DEM) was introduced, including an improved quicksort algorithm to rank DEM data in pieces and a filling algorithm first developed by Olivier Planchon and Frédéric Darboux in 2001 (The idea was first suggested by Moran and Vezina, so it’s called the M&V algorithm). Since removing the depressions of a DEM is usually a time-consuming procedure, the new method keeps the integrity and continuity of the drainage networks extracted by the pits-removed DEM and well reduces the depth of seeking path in iteration to accelerate pits-removing process. Different from the constant time complexity of traditional algorithms, the time complexity of the new method is variable, and the best performance for a natural terrain appears to be in 200 to 500 divided-pieces. The application of the new method in 6 study areas shows a time complexity of about O(n1.29) on average, which is more efficient than the M&V algorithm and Arcgis 9.2 (improved Jenson & Domingue algorithm).

Job scheduling solution based on data exchange and synchronization

Jia-yao FENG De-xian QI Zheng-ping QIAN

2009, 29(11):  3165-3170. 

Asbtract ( )   PDF (1214KB) ( )  

Related Articles | Metrics

Multiprocessor scheduling is a classical NP-hard problem. However, in actual cases, the scheduling research, with variable constraints and transformations, is so significant and determines system performance. DataTurbo is a platform used to migrate, integrate and syncretize distributed data. The authors proposed a distributed task scheduling solution adaptive to data exchange and synchronization based on DataTurbo, which took massive data transferring tasks. Also, the authors constructed a flexible distributed scheduling algorithm framework to solve related scheduling issues. The solution is an online, concurrent multiprocessor scheduling solution, whose tasks can be separated. The experimental results show that the solution works well with obvious advantage in jobs which have tasks with large load and sparse scheduling points, so that it can provide dynamic scheduling solution for data exchange and synchronization and establish foundation model for relevant heuristic algorithm.