Table of Content

01 February 2014, Volume 34 Issue 2

Previous Issue    Next Issue

Network and communications

Retransmission mechanism based on network coding in wireless networks

LIU Qilie WU Yangyang CAO Bin

2014, 34(2):  309-312. 

Asbtract ( )   PDF (705KB) ( )  

Related Articles | Metrics

The current applications of network coding in single-hop wireless network retransmission are based Single Sender Multiple Receiver (SSMR) scenes. Therefore, this paper proposed a retransmission mechanism named NCWRM (Network Coding Wireless Retransmission Mechanism) which can be used in multiple sender multiple receiver networks. Each node in the network can be either a sender or a receiver. The node can broadcast a coded packet which is combined by multiple lost packets in the second retransmission after packet failed in transmission and the first retransmission. Multiple recipients can simultaneously get their lost packets by decoding the coded packet, which can effectively improve the efficiency of retransmission. Theoretical analysis and simulation results show that NCWRM algorithm can significantly improve system saturation throughput, while reducing overhead and packet loss rate.

Approximate summation algorithm of distinct records for wireless sensor network

LIU Caiping CAI Yuwu MAO Jianxu CAI Yuwen

2014, 34(2):  313-317. 

Asbtract ( )   PDF (721KB) ( )  

Related Articles | Metrics

Since the existing summation aggregation algorithms are almost duplicate-sensitive, an approximate algorithm Flajolet-Martin SUM (FM-S) of distinct summation query for Wireless Sensor Network (WSN) was proposed. In FM-S, each node in WSN combined the FM-S algorithm and the random number sample of binomial distribution to do hash conversion so as to fill a summation sequence of length L, and each node forwarded the generated sequence to the father node in routing tree. Then the root node received the summation sequence of whole network. Finally, according to the sequence of root node, the approximation summation value of distinct records in sensor networks could be obtained. The experimental results show that the distributed algorithm is of low power consumption, high fault tolerance, robustness and scalability.

Node centralities-aware routing in delay tolerant network

XIONG Yu WANG Jintuo ZHANG Hongpei ZHANG Ruoying

2014, 34(2):  318-321. 

Asbtract ( )   PDF (573KB) ( )  

Related Articles | Metrics

In order to forward messages more efficiently in the social oriented Delay Tolerant Network (DTN), this paper proposed a way to be aware of nodes' centralities. This paper came up with a routing mechanism for the awareness of nodes' centralities through a comprehensive analysis of the level of activity and the capacity of handling messages which aimed at quantifying the nodes' centralities. The result shows that compared with the traditional Epidemic routing and Contact Counts (CC) routing which principle is still based on nodes' centrality, the routing mechanism this paper discussed can significantly improve the rate of the message delivery and the rate of the overhead.

New wireless positioning method with high accuracy and low complexity

YANG Xiaofeng CHEN Tiejun LIU Feng

2014, 34(2):  322-324. 

Asbtract ( )   PDF (539KB) ( )  

Related Articles | Metrics

In order to lower the computational burden of wireless positioning algorithm with high accuracy, this paper proposed a new 2D beamspace matrix pencil algorithm to jointly estimate Time-Of-Arrival (TOA) and Direction-Of-Arrival (DOA), which can position target accurately with low complexity. This algorithm first transformed the complex data matrix into real and reduced dimensional matrix via Discrete Fourier Transform (DFT) matrix, which significantly reduced the computational burden; then estimated TOA and DOA of Line-of-Sight signal for positioning via singular value decomposition and solving generalized eigenvalues of matrix pencils. Matlab simulation results prove that this positioning method achieves Root Mean Square Error (RMSE) as small as 0.4m with computation cost no more than 1/4 of corresponding algorithm in element space, which makes it a promising positioning method for resource limited environments like battlefield, earthquake-stricken area and rural places.

Research and application of matching communications between Virtex-5 GTP and Virtex-6 GTX

LI Kai HE Songhua OU Jianping

2014, 34(2):  325-328. 

Asbtract ( )   PDF (732KB) ( )  

Related Articles | Metrics

For the differences between Virtex-5 RocketIOTM GTP and Virtex-6 RocketIOTM GTX adjustments should be made on pre-emphasis/de-emphasis values and reception equalization values,the receiving terminal voltage and differential voltage transmission values, so as to adapt to the data communication between GTP and GTX. By using ChipsCope Pro_IBERT to measure the actual communication parameters to set GTP/GTX transceiver side, this paper defined the data frame structure through custom communication protocol, and designed a new RocketIO data transceiver interface controller. By analyzing the phenomenon of byte misalignment caused by some uncertainty such as high frequency instability, and clock drift, this paper added a data misalignment correction module in custom communication protocol, thus greatly reducing the error rate of data transmission. The experimental results show that high speed serial communication between Virtex-5 RocketIOTM GTP and Virtex-6 RocketIOTM GTX can be implemented, and the data transceiver interface controller is of data transmission stability, low bit error rata and good generality.

Design of modulated filter banks for cognitive radio system

SHAO Kai JI Xiang ZHUANG Ling WANG Guangyu

2014, 34(2):  329-332. 

Asbtract ( )   PDF (599KB) ( )  

Related Articles | Metrics

As a new intelligent spectrum sharing technology, Cognitive Radio (CR) technology could effectively improve the spectrum utilization. It allows the cognitive user to use the idle spectrum of licensed user under the premise of free interference. Because of the high sidelobe attenuation, the traditional physical layer transmission technology in cognitive radio system, that is Orthogonal Frequency Division Multiplexing (OFDM) multi-carrier modulation technology, suffers from the the interference between the adjacent subbands and the interference among licensed users and cognitive users, an alternative multi-carrier modulation technology, filter bank based multi-carrer technology, was introduced in this paper to eliminate the interferences. An indirect design method for designing the prototype filter in filter bank was proposed while formulating the filter bank as an unconstrained linear optimization problem of prototype filter.Firstly,two low-order and linear lowpass filters were designed by using the Parks-McClellan algorithm, and then the prototype filter was optimally designed through the interpolation and cascade operation. Compared to the conventional direct method, the simulation results show that the modulated filter banks designed by the proposed method in this paper present better performance in the length of filter coefficients and the alias errors.

Modeling and simulation for high-frequency IP wide-area network

JING Yuan HUANG Guorong YANG Ming QI Yunjun CHEN Shangguang

2014, 34(2):  333-337. 

Asbtract ( )   PDF (740KB) ( )  

Related Articles | Metrics

〖JP2〗With different way of link established, the high frequency IP wide-area network shows a different topological feature during the network operation process. Modeling study and simulation analysis were made with a modified harmonious unifying hybrid preferential model on high frequency IP wide-area network. And the results were found that the degree distribution, shortest path and clustering coefficient would be impacted by the different node selection method for new connection. Mean-while, the average shortest path of the network would be affected by the different edge deletion method. What's more the topological characteristics of the network were determined by the proportion of different node selection method.〖JP〗

Optimization of intra-MAP handover in HMIPv6

SUN Xiaolin ZHANG Jianyang JIA Xiao

2014, 34(2):  338-340. 

Asbtract ( )   PDF (450KB) ( )  

Related Articles | Metrics

In the pointer forwarding schemes of Hierarchical Mobile IPv6 (HMIPv6), the influence of the distance between the Access Routers (ARs) on the handover performance has not been taken into consideration. To solve this problem, the optimization of intra-MAP (Mobile Anchor Point) handover in HMIPv6 based on pointer forwarding (OPF-HMIPv6) was proposed. The OPF-HMIPv6 compared the distance between ARs with the distance between AR and MAP firstly and gave priority to registering to MAP, rather than built a pointer chain immediately by registering to AR. The simulation results have shown that OPF-HMIPv6 can decrease the registration cost by 39% compared to HMIPv6 when the distance between AR and MAP is greater than the distance between ARs, which proves that the optimization reduces the overhead caused by the binding update and improves the efficiency of the intra-MAP handover.

Enhanced distributed mobility management based on host identity protocol

JIA Lei WANG Lingjiao GUO Hua XU Yawei LI Juan

2014, 34(2):  341-345. 

Asbtract ( )   PDF (724KB) ( )  

Related Articles | Metrics

The Host Identity Protocol (HIP) macro mobility management was introduced into Distributed Mobility Management (DMM) architecture, and Rendezvous Server (RVS) was co-located with the DMM mobility access routing functionality in Distributed Access Gateway (D-GW). By extending the HIP protocol package header parameters, the HIP BEX messages carried host identifier tuple (HIT, IP address) to the D-GW new registered, and the new D-GW forwarded the IP address using the binding massage. Through the established tunnel, data cached in the front D-GW would be later loaded to the new D-GW. This paper proposed a handover mechanism to effectively ensure data integrity, and the simulation results show that this method can effectively reduce the total signaling overhead. Furthermore, the security of HIP-based mobility management can be guaranteed.

Analysis and suppression of influence on spotbeam selection of GMR-1 system under antenna oscillation

LIN Xiaoxu LIU Naijin QIAN Jinxi ZHAO Danfeng

2014, 34(2):  346-350. 

Asbtract ( )   PDF (758KB) ( )  

Related Articles | Metrics

Considering the antenna oscillation phenomenon, the performance of spotbeam selection in Geostationary Earth Orbit Mobile Radio Interface (GMR-1) system under antenna oscillation was analyzed and an improved spotbeam selection algorithm was proposed. The improved algorithm could dynamically set hysteresis using the distance between the Mobile Earth Station (MES) and its Gateway Station (GS). A simulation model was implemented using OPNET. The simulation results show that the MES at different location is influenced by antenna oscillation to different extent. Besides, the wrong times of spotbeam selection increases with the increase of hysteresis and the maximum amplitude in the traditional algorithm. Finally, the improved algorithm can reduce the wrong times of spotbeam selection and restrain the influence on spotbeam selection under antenna oscillation efficiently.

Advanced computing

Artificial immune algorithm for dynamic task scheduling on cloud computing platform

YANG Jing WU Lei WU Dean WANG Xiaomin LIU Nianbo

2014, 34(2):  351-356. 

Asbtract ( )   PDF (933KB) ( )  

Related Articles | Metrics

In the field of cloud computing, it is a key problem that how task schedules. This paper presented an artificial immune algorithm for dynamic task scheduling on cloud computing platform. Firstly, the algorithm used the queuing theory to determine the conditions of cloud computing platform to maintain steady-state, and provided the basic data for the following algorithm. Then, this paper used the clone selection algorithm to search out the approximate optimal configuration which calculated resources for different virtual machines of different nodes in the cluster. Finally, proper load balancing processing algorithm joined with immune theory improved the antibody genes. The results of simulation experiment show that, this algorithm can effectively improve the convergence speed and accuracy, search reasonable allocation quickly and improve the cluster resource utilization.

Virtual machine deployment strategy based on improved genetic algorithm in cloud computing environment

YUAN Aiping WAN Chanjun

2014, 34(2):  357-359. 

Asbtract ( )   PDF (604KB) ( )  

Related Articles | Metrics

Aiming at improving the resource utilization of data center by balanced usage of multiple resources, a scheduling algorithm based on group genetic algorithm for multi-dimensional resources coordination was proposed to solve the virtual machine deployment problem. To guide the solution searching, a fuzzy logic based multi-dimensional fitness function was raised. Meanwhile, innovative optimization of crossover and mutation was put forward to improve the solution quality. The results of simulation in CloudSim environment prove that using the proposed algorithm can obtain better multi-dimensional resources performance and higher resource utilization rate.

Load balancing technology based on naive Bayes algorithm in cloud computing environment

CAI Song ZHANG Jianming CHEN Jiming PAN Jingui

2014, 34(2):  360-364. 

Asbtract ( )   PDF (718KB) ( )  

References | Related Articles | Metrics

For the the heavy complexity of scheduling algorithm and the misallocation of assignment occurring in the cloud computing environment, a load balancing technology based on naive Bayes algorithm was proposed. This technology made use of the heartbeat mechanism to gather every node's load information comprehensively, so as to classify the load state of all nodes based on naive Bayes algorithm. Then, according to the classification, it achieved reasonable dispatch of the task and resource for each node. The results of the experiments show that, this load balancing technology improves the efficiency of the allocation of tasks and avoids the frequent migration between nodes, so that it can achieve the purpose of balancing the load rapidly and effectively.

P2P streaming media server cluster deployment algorithm based on cloud computing

MO Zhichao ZHANG Weizhan WANG Jun ZHEN Yan

2014, 34(2):  365-368. 

Asbtract ( )   PDF (562KB) ( )  

Related Articles | Metrics

Concerning the high bandwidth occupation problem caused by deploying the P2P (Peer-to-Peer) streaming media server cluster on the Data Center Network (DCN) in cloud, a P2P streaming media server cluster deployment algorithm based on cloud computing was proposed. This algorithm modeled the P2P streaming media server cluster deployment as a quadratic assignment problem, and sought the mapping relationship between each virtual streaming media server and each deployment point to realize the P2P streaming media server cluster deployment based on cloud computing. The simulation experiment demonstrates that the P2P streaming media server cluster deployment algorithm based on cloud computing can effectively reduce the bandwidth usage of DCN in cloud.

Implementation of Laplace transform on heterogeneous multi-core engineering and scientific computation accelerator coprocessor

HE Zhangqing HUANG Wei DAI Kui ZHENG Zhaoxia

2014, 34(2):  369-372. 

Asbtract ( )   PDF (767KB) ( )  

Related Articles | Metrics

Engineering and Scientific Computation Accelerator (ESCA) is a heterogeneous multi-core architecture to accelerate computation-intensive parallel computing in scientific and engineering applications. This paper described an implementation of Laplace transform on the hybrid system based on ESCA coprocessor, and the performance of Laplace transform on the quad-core prototype ESCA was exploited. The experimental results show that the ESCA can accelerate program of compute-intensive applications fairly well.

Security analysis and improvement of access control scheme for cloud storage

WANG Guan FAN Hong DU Dahai

2014, 34(2):  373-376. 

Asbtract ( )   PDF (594KB) ( )  

Related Articles | Metrics

An access control scheme for cloud storage proposed by Tang et al. (TANG Y，LEE P，LUI J，〖WTBX〗et al.〖WTBZ〗 Secure overlay cloud storage with access control and assured deletion. IEEE Transactions on Dependable and Secure Computing，2012，9(6)：903-916） was analyzed and proved to be vulnerable to collusion attacks, and a detailed attack method was given. To address this problem of the given scheme, this paper took the advantage of the property of collusion attack resistant of the attribute based encryption algorithm and improved a ciphertext-policy attribute-based encryption (CP-ABE) algorithm which used the access tree. Then the improved algorithm could be used seamlessly into the access control and assured deletion scheme for cloud storage without changing the cloud server. Finally, the security against the chosen plaintext attack was proved under the Decision Bilinear Diffie-Hellman (DBDH) assumption, and the ability of resisting the collusion attack of the scheme was proved by analyzing a practical cloud situation.

Dynamic allocation of virtual supplier resources based on cloud procurement platform

HUANG Li DING Yi YAO Jinyuan LIN Guolong

2014, 34(2):  377-381. 

Asbtract ( )   PDF (681KB) ( )  

Related Articles | Metrics

This paper focused on the application of cloud computing technology to purchase link to form a cloud procurement platform, and to explore how to allocate the virtual machine with the virtual suppliers resources, so as to improve the satisfaction of customers. Firstly, this paper proposed the concept of cloud purchase platform, assuming that the virtual machine containing the suppliers of resources; secondly proposed the allocation processes of virtual machines which contained the virtual suppliers resources and modeling; then the Best Fit Decreasing (BFD) and Finder-tracker multi-swarm Particle Swarm Optimization (FTMPSO) were adopted to get the solution; finally the results of computing were analyzed. In the BFD algorithm, the priority of each of the three attributes met different preferences of the customer's requirements. Using FTMPSO algorithm to allocate virtual suppliers resources got higher satisfaction of customer than using BFD to allocated virtual suppliers resources.

Fault-tolerance period optimization method for computational fluid dynamics-oriented application development frameworks

ZHANG Yongjun XU Xinhai

2014, 34(2):  382-386. 

Asbtract ( )   PDF (767KB) ( )  

Related Articles | Metrics

For the fault-tolerance shortage of CFD (Computational Fluid Dynamics)-oriented application development framework, a new fault-tolerance period optimization method was proposed. The method computed the ideal best fault-tolerance period based on the probability model of system's faults, and online determined the occasion of real check points with the consideration of CFD fields output characteristic. The experimental results of three applications show that on the systems with different mean time between faults, compared with the fault-tolerance method based on performing fault-tolerance between fixed steps, the proposed method can always get the best fault-tolerance overheads. Based on this method, user can set the fault-tolerance period with framework interfaces conveniently and reduce the fault-tolerance overheads.

Reconfigurable hybrid task scheduling algorithm

SHEN Dhu ZHU Zhiyu WU Jiang

2014, 34(2):  387-390. 

Asbtract ( )   PDF (705KB) ( )  

Related Articles | Metrics

An important component of reconfigurable task scheduling is how to hide and reduce the configuration time. A reconfigurable hybrid task scheduling algorithm was proposed at solving the problem that the hybrid task was relevant for software and hardware simultaneously. The task and its chronological order should be figured out first by means of pre-configuration and priority algorithm and the successive task should be hidden into the run-time for predecessor task afterwards. In the meantime, the strategy of configuration reuse can be adopted in order to reduce the quantity of configuration for same tasks. Compared to the existing algorithms, the new algorithm is much more effective and its cost is less.

Edge-balanced index sets of five-power-cycle nested network graph（When m is divided by 3,the remainder is 2）

ZHEN Yuge LIU Jinmeng

2014, 34(2):  391-395. 

Asbtract ( )   PDF (798KB) ( )  

Related Articles | Metrics

To cope with the edge-balanced index sets of network graph labeling, on the basis of the equal-cycle nested network graph, a new concept of power-cycle nested network graph was proposed. Moreover, the edge-balanced index sets of five-power-cycle nested network graph were investigated. It reduced the difficulty of five-power-cycle nested network graph labeling because of the new design of the basic graph, nested-cycle subgraph with gear and five-vertex sector subgraph group. The results show that the edge-balanced index sets of five-power-cycle nested graph when m is divided by 3, the remainder is 2.At the same time, the design method of the corresponding graphs is also provided.

Data technology

Distributed rules mining algorithm with load balance based on vertical FP-tree

FENG Yong YIN Jiena XU Hongyan

2014, 34(2):  396-400. 

Asbtract ( )   PDF (724KB) ( )  

Related Articles | Metrics

In mass data era, the research on knowledge discovery of massive and distributed data has become the hot spot in both academic field and industry. The problem of load balance is one of the important factors that must be considered in developing a distributed mining algorithm. Therefore, a distributed association rules mining algorithm with load balance based on vertical FP-tree (VFP-LBDM) was proposed in this paper. Vertical frequent pattern tree was used in this algorithm to store items and their associations, and there was no need to combine the local mining results. Therefore, the communication cost was reduced and the processing procedure was also simplified. At the same time, the algorithm used the hybrid architecture in which the central site assigned tasks according to the processing capacity of each local site. It realized the load balance and improved the performance of the algorithm. The experiment shows that the algorithm given in this paper is feasible and has higher efficiency.

Continuous-valued attributes reduction algorithm based on gray correlation

ZHANG Jian WANG Jindong YU Dingkun

2014, 34(2):  401-405. 

Asbtract ( )   PDF (725KB) ( )  

Related Articles | Metrics

Since most current attributes reduction algorithm can be only used for discrete decision tables, the correlation degree between condition attributes and decision attributes was defined as the importance degree of attributes, and meanwhile the overlap degree was defined based on the correlation degree and importance degree among attributes. The condition attributes' importance was renewed according to the overlap degree. To achieve the reduction of continuous-valued attributes set, an attributes reduction algorithm based on gray correlation analysis was proposed. The feasibility and effectiveness of the algorithm were verified in the simulation.

Simple continuous near neighbor chain query in constrained regions

ZHANG Liping Lisong ZHAO Jiqiao HAO Xiaohong

2014, 34(2):  406-410. 

Asbtract ( )   PDF (800KB) ( )  

Related Articles | Metrics

The exiting methods of the nearest neighbor query can not search the simple continuous near neighbor chain in the constrained regions. To remedy the deficiency of the existing work, according to the complexity of the constrained regions and the obstacles, the simple continuous near neighbor chain query with non obstacles and with obstacles were studied respectively. The VOR_NB_CRSCNNC algorithm and the VOR_CB_CRSCNNC algorithm were presented. The spatial data were filtered and computed based on the Voronoi diagram and the judging circles. The calculations of each query were reduced by only considering the points which lay in the Voronoi polygon and the juding circles. The theatrical study and the experimental results show that the redundant calculation is reduced and the query efficiency is less affected by the constrained regions.

Trust-based information propagation model in online social networks

ZHANG Xiaowei

2014, 34(2):  411-416. 

Asbtract ( )   PDF (908KB) ( )  

Related Articles | Metrics

As a new media, social network gains a wide range of social influence, and the social network based e-commerce becomes more and more popular, which make the study of information propagation of great significance. A trust based information propagation model was presented in this paper according to the trust relationship between people in daily life. First, the algorithm of data mining was employed on personal information to make the classification of the users. And then the value of trust between the users was calculated according to their relationships. At last, this paper predicted the range of information propagation by using the trust value between the users and messages. Compared with two basic methods, the final experiment shows that the results generated by the model are enhanced by 15% in precision, while the time used decreases more than 50%. The results differ with the statistic results on the dataset at 5%, which shows that the model preforms well in practice.

Method of creating file based on big directory of NTFS

WU Weimin LIN Shuibin JIANG Daqiang LI Haiming SU Qing

2014, 34(2):  417-420. 

Asbtract ( )   PDF (632KB) ( )  

Related Articles | Metrics

In the available literatures, creating new files with New Technology File System (NTFS) that does not depend on calling Windows Application Program Interface (API) takes place in small directory. Therefore, a new technological realization of creating files in big directories was proposed in this paper. Firstly, it located the index buffer by traversaling the B+tree. Secondly, by judging whether the index buffer had an index node, it would put the created index entry into the specified location of index buffer respectively. Next, the index buffer inserted by the index was written to disk. Finally, it created new files in the big directories successfully. The experiments prove that the files can be created correctly in a large directory using the new creating technology.

Computer security

Conflict analysis of distributed application access control policies refinement

WU YinghongWU HUANG Hao ZHOU Jingkang ZENG Qingkai

2014, 34(2):  421-427. 

Asbtract ( )   PDF (1019KB) ( )  

Related Articles | Metrics

With the growth of cloud technology, distributed application platform develops towards elasticity resources and dynamic migration environment. The refinement of distributed application access control policies was associated with resources and environment, which also needs to improve performance to adapt to the dynamics. Although present access control space policies conflict analysis methods could be used in the conflict analysis of distributed application access control policies refinement. The granularity of its calculating unit is too fine to make batter performance. In this article, the authors designed a conflict analysis algorithm used in distributed application access control policies refinement, the conflict analysis algorithm was based on recursive calculation the intersection of sets and the calculation unit of the algorithm was permission assignment unit which improved computing granularity. The experimental results and analysis show that the proposed algorithm has better performance, and fits the needs of improving computing performance of cloud platform access control policies refinement.

Reachability analysis for attribute based user-role assignment model

REN Zhiyu CHEN Xingyuan

2014, 34(2):  428-432. 

Asbtract ( )   PDF (755KB) ( )  

Related Articles | Metrics

It is difficult to express diversity policy by traditional RBAC (Role-based Access Control) management model. In order to solve the problem, an Attribute based User-Role assignment (ABURA) model was proposed. Attributes were adopted as prerequisite conditions to provide richer semantics for RBAC management policy. In distributed systems, user-role reachability analysis is an important mechanism to verify the correctness of authorization management policy. The definition of user-role reachability analysis problem for ABURA model was given. According to the characteristics of state transition in ABURA model, some reduction theorems for policy were given. Based on these theorems, user-role reachability analysis algorithm was proposed, and the algorithm got verified through examples.

Remote attestation mechanism for platform integrity based on unbalanced-Hash tree

WENG Xiaokang ZHANG Ping WANG Wei ZHU Yi

2014, 34(2):  433-437. 

Asbtract ( )   PDF (716KB) ( )  

Related Articles | Metrics

In order to improve the remote authentication efficiency for integrity measurement of computing platforms, this paper proposed a platform remote authentication mechanism based on unbalanced-Hash trees. Hash values of platform's trusted entities were stored in the structure of leaf nodes of unbalanced-Hash trees. Effectiveness of the metrics was verified through seeking corresponding leaf nodes of measured entities, recording the validation paths from leaf nodes to root nodes, passing from root nodes to the prover and finally recalculating the root nodes according to validation paths. The experimental results show that the proposed mechanism can effectively reduce time and space overhead of storing Hash values and the time complexity of integrity measurement authentication is O(lb N).

Secure quantum communication protocol based on symmetric W state and identity authentication

LIU Chao GENG Huantong LIU Wenjie

2014, 34(2):  438-441. 

Asbtract ( )   PDF (600KB) ( )  

Related Articles | Metrics

Due to the better robustness of entangled W state, it is considered to be better qualified as information carrier for quantum information processing and quantum secure communication. Recently, many kinds of quantum direct communication protocols based on four-particle W state or three-particle asymmetric W state have been proposed. However, these protocols either have low communication efficiency or are difficult to be implemented in physics experiment. By utilizing three-particle W state and the mechanism of quantum identity authentication, a new deterministic secure quantum communication protocol was proposed. This protocol consisted of five parts: authentication code generating, quantum states preparation, quantum states distribution, eavesdropping check and identity authentication, and information communication. The two participants only needed to perform the two-particle Bell measurement, the single-particle 〖WTBX〗Z〖WTBZ〗-basis or 〖WTBX〗X〖WTBZ〗-basis measurement, and the communication efficiency was also improved: One W state can transmit one classical bit of information. The security analysis shows that the present protocol is secure against various eavesdropper Eve's attacks and impersonation attacks, so it has better security.

Arithmetic correlations of symmetric Boolean function

ZHAO Qinglan ZHEN Dong DONG Xiaoli

2014, 34(2):  442-443. 

Asbtract ( )   PDF (423KB) ( )  

Related Articles | Metrics

The arithmetic correlation function is a new method for studying the cryptographic properties of Boolean functions. Based on the basic definitions of addition and multiplication of multi-2-adic integer, the study constructed a new algebraic ring and realized the arithmetic or “with-carry” analogs of classic correlation functions. In this paper the definition of arithmetic autocorrelation function was introduced. The arithmetic correlation value of symmetric Boolean functions was studied. The results show that the arithmetic autocorrelation function of symmetric Boolean functions is a real symmetric function with at most n1 values.

Construction of even-variable rotation symmetric Boolean functions with optimum algebraic immunity

CHEN Yindong XIANG Hongyan ZHANG Yanan

2014, 34(2):  444-447. 

Asbtract ( )   PDF (646KB) ( )  

Related Articles | Metrics

Algebraic immunity is one of the most significant cryptographic properties for Boolean functions. In order to resist algebraic attack, high algebraic immunity is necessary for those Boolean functions used in stream ciphers. This paper constructed more than one even-variable rotation symmetric Boolean functions with optimum algebraic immunity by giving an even n. Based on majority function, some orbits of different hamming weights were chosen, then the values of functions on these orbits were changed. Given a sufficient condition of Boolean functions with optimum algebraic immunity, the new constructed Boolean functions were proved to satisfy the condition. Therefore, it shows the algebraic immunity of the functions is optimum. Thus, algebraic attacks can be resisted effectively.

Differential power analysis attack based on algebraic expression for power model

CAI Zemin WANG Yi LI Renfa

2014, 34(2):  448-451. 

Asbtract ( )   PDF (735KB) ( )  

Related Articles | Metrics

Differential Power Analysis (DPA) attack is the most efficient attack to encryption device. Some existing DPA methods have high demands for differential information and their stabilities are not strong. In this paper based on the analysis of DPA, the authors reconstructed the model of DPA, which reduced the complexity of attack. A new DPA attack combining new power model based on algebraic expression was proposed, and the experimental results show that the proposed DPA attack has the advantages of increasing the correctness of attacking without increasing the time complexity and reducing the number of the needed differential information from thousands to hundreds compared with the existing method.

UAPL: Wireless sensor network user authentication based on improved Das protocol

WAN Zhiping

2014, 34(2):  452-455. 

Asbtract ( )   PDF (721KB) ( )  

Related Articles | Metrics

When obtaining node data through user identification in wireless sensor networks, passwords may be cracked and some other security problems such as being prone to network attacks may occur. Concerning these problems and based on the improved Das'protocols of two-factor user authentication, UAPL protocol was proposed after introducing a verification mechanism between users and gateway nodes as well as between gateway nodes and sensor nodes, and a mechanism for changing's password. This protocol had security features that prevented gateway node sideway attacks, masked attacks and other network attacks and its provided capability of password change protection could prevent security problems when passwords were leaked out. The experimental results show UAPL protocol offers much higher security than other improved Das'protocols.

Low-cost mutual authenticate and encrypt scheme for active RIFD system

YE Xiang XU Zhan HU Xiang LIU Dan

2014, 34(2):  456-460. 

Asbtract ( )   PDF (798KB) ( )  

Related Articles | Metrics

In order to solve the safety problems of privacy in the processes of authentication and communication of Radio Frequency IDentification (RFID) system, a mutual authenticate and encrypt scheme with low resource consume, high-level security and applicable for most of RFID systems was designed. This scheme combined the improved Elliptic Curve Diffie-Hellman (ECDH) algorithm and Advanced Encryption Standard (AES) algorithm to implement functions of key distribution, certification and communication encryption. It used dynamic key to enhance security. In addition, this scheme reduced the operation scale with original security strength, and saved the overhead of system resources. The measured results show that this scheme can resist replaying attacks, impersonation attacks, man-in-the-middle attacks and Denial of Service (DoS) attacks so as to save system resources. It can be applied in the field of Internet of Things (IOT) which has requirements on security and costs.

Fined-grained access control protocol for privacy preservation in wireless sensor network

HU Peng ZUO Kaizhong GUO Liangmin LUO Yonglong

2014, 34(2):  461-463. 

Asbtract ( )   PDF (462KB) ( )  

Related Articles | Metrics

In order to protect user's identity privacy and data security for access control in wireless sensor networks, a privacy-preserving access control protocol in multi-user wireless sensor networks was proposed. The protocol employed attribute-based encryption algorithms and distributed access control mode, using the attribute certificates, digital signatures and threshold mechanism to achieve the pay access, fine-grained access control and anonymous access. And it also ensured the confidentiality of data transmission and data integrity of query command. Analysis and protocol comparison shows that the proposed protocol has several advantages over the current access control methods: lower cost in computation, communication and storage, better scalability and better adaptation to access control requirement of payment wireless sensor network.

Universal designated verifier signcryption scheme in standard model

MING Yang ZHANG Lin HAN Juan ZHOU Jun

2014, 34(2):  464-468. 

Asbtract ( )   PDF (702KB) ( )  

Related Articles | Metrics

Concerning the signature security problem in reality, based on the Waters'technology, a universal designated verifier signcryption scheme in the standard model was proposed. Signcryption is a cryptographic primitive which performs encryption and signature in a single logical step. Universal designated verifier signature allowed a signature holder who had a signature of a signer, to convince a designated verifier that he was in possession of a signer's signature, while the verifier could not transfer such conviction to anyone else, only allowed the designated verifier to verify the existence of the signature. The scheme by combining universal designated verifier and signcryption eliminated the signer and signture holders for signature transmission required for a secure channel. Under the assumption of Computational Bilinear Diffie-Hellman (CBDH) problem, the scheme was proved to be safe. Compared with the existing schemes, the proposed scheme has better computational efficiency.

Blind watermarking algorithm of double keys based on Markov chain Monte Carlo sampling

XIAO Jiawei ZHANG Li LUO Jingyun

2014, 34(2):  469-472. 

Asbtract ( )   PDF (636KB) ( )  

Related Articles | Metrics

In order to improve the security of watermarking algorithm, a robust blind watermarking based on two forms of key was proposed. Firstly, the watermark was encrypted by a key, then matrix Q was consisted of the first singular value of each block carrier and block Discrete Wavelete Transform (DWT) again to acquire four subbands, the k-th watermark bit was chosen to be embedded in the k-th block's low-frequency, horizontal, vertical and high-frequency subbands of matrix Q by Markov Chain Monte Carlo (MCMC) sampling of four subbands and record the current key of embedded subband. It not only made watermark bit randomization, but also improved the safety of the watermark algorithm. The experimental results show that the proposed watermarking has strong robustness against conventional attacks under the condition of satisfying invisibility, meanwhile, it enhances the security of the watermark algorithm, which is embedded with a different key by MCMC sampling in the watermark embedding process.

Taint-marking based access control model and its implementation on Android

WU Zezhi XHEN Xingyuan YANG Zhi DU Xuehui

2014, 34(2):  473-476. 

Asbtract ( )   PDF (568KB) ( )  

Related Articles | Metrics

For protecting the sensitive data on mobile operation system, a Taint-marking Based Access Control (TBAC) model was presented and a Taint-marking Information Flow Control (TIFC) framework was proposed. To improve fine-grained data sharing, labels were designed for each data. To support for least privilege characteristic, capacities were defined to each subject. To avoid accumulating of contamination, decontamination capacities of trust subjects were introduced. Compared with BLP, TBAC is more available, flexible and fine-grained. The results show TIFC is an effective, flexible and accurate framework in tracking and controlling the information flow at runtime, and TIFC solves the problem of covert channel caused by control flow during program execution.

Design of file system encryption and decryption for Xen based on QEMU

CHEN Teng HE Qin

2014, 34(2):  477-480. 

Asbtract ( )   PDF (579KB) ( )  

Related Articles | Metrics

Concerning the storage of the Xen disk image as plain text, the paper proposed a real-time encryption and decryption method for the disk image of Xen. Using the transparent encryption and decryption method, and inserting the transparent encryption and decryption module into the QEMU of Xen, this method encrypted and decrypted the disk image of virtual machine and solved the problem of the security threat to the virtual machine disk data of the Xen's users. Through the contrast test for the encrypted and unencrypted virtual machine, the effectiveness and performance reliability of the method were verified.

Artificial intelligence

Sentiment analysis on Web financial text based on semantic rules

WU Jiang TANG Chang-jie LI Taiyong CUI Liang

2014, 34(2):  481-485. 

Asbtract ( )   PDF (922KB) ( )  

Related Articles | Metrics

In order to effectively improve the accuracy of sentiment orientation and intensity analysis of unstructured Web financial text, a sentiment analysis algorithm for Web financial text based on semantic rule (SAFT-SR) was proposed. The algorithm extracted features of financial text based on Apriori, constructed financial sentiment lexicon and semantic rules to recognize sentiment unit and intensity, and figured out the sentiment orientation and intensity of text. Experiment results demonstrate that SAFT-SR is a promising algorithm for sentiment analysis on financial text. Compared with Ku’s algorithm, in sentiment orientation classification, SAFT-SR has better classification performance and increases F-measure, recall and precision; in sentiment intensity analysis, SAFT-SR reduces error and is closer to expert mark.

Bursty topics detection approach on Chinese microblog based on burst words clustering

GUO Yixiu LYU Xueqiang LI Zhuo

2014, 34(2):  486-490. 

Asbtract ( )   PDF (951KB) ( )  

Related Articles | Metrics

Bursty topics detection on microblog is an import branch of online public opinion analysis, and has attracted much attention from international scholars. In this paper, a new approach of calculating users' influence was proposed based on the analysis of users' behavior characteristics. Combining the user influence with text features and propagation features, this paper defined a concept named Bursty which is used to judge if a word was a burst word. Being judged by Bursty, burst words can be extracted from microblog corpus. Hierarchical clustering algorithm was introduced to cluster the burst words and chose appropriate burst word clusters to describe bursty topics on microblog in order to realize bursty topics detection on microblog. In experiments, the precision, recall and F-measure reached 63.64%,87.5% and 74% respectively. The method is proved effective on bursty topic detection based on mass microblog data.

Situation assessment method based on improved evidence theory

WANG Yongwei LIU Yunan ZHAO Cairong SI Cheng QIU Wei

2014, 34(2):  491-495. 

Asbtract ( )   PDF (721KB) ( )  

Related Articles | Metrics

Evidence theory is one of the main approaches to implement situation assessment based on rules. But evidence theory can result in paradox problem in conflicting evidence combination. Concerning this problem, by dissimilarity calculation, the importance of evidence was measured and original evidence was modified. A new approach based on the improved evidence theory was proposed. The new approach contained four steps including rules measurement, evidence modification, rules fusion and situation decision. The experiments show that the new approach can avoid paradox problem in the process of fusion based on evidence theory, and it is superior to typical approaches, such as Dempster approach, Yager approach and Leung approach, etc, in efficiency and accuracy of situation assesment.

Quantum-inspired clonal algorithm based method for optimizing neural networks

QI Hao WANG Fubao DENG Hong ZHAO Kun WANG Liang MA Yin DUAN Weijun

2014, 34(2):  496-500. 

Asbtract ( )   PDF (719KB) ( )  

Related Articles | Metrics

In order to reduce the redundant connections and unnecessary computing cost, quantum-inspired clonal algorithm was applied to optimize neural networks. By generating neural network weights which have certain sparse ratio, the algorithm not only effectively removed redundant neural network connections and hidden layer nodes, but also improved the learning efficiency of neural network, the approximation of function accuracy and generalization ability. This method had been applied to wild relics security system of Emperor Qinshihuang's mausoleum site museum, and the results show that the method can raise the probability of target classification and reduce the false alarm rate.

Weight-based cloud reasoning algorithm

YANG Chao YAN Xuefeng ZHANG Jie ZHOU Yong

2014, 34(2):  501-505. 

Asbtract ( )   PDF (732KB) ( )  

Related Articles | Metrics

Although the normal cloud model is universally used, it faces some difficulties when describing some monotonic rise/fall conceptions. This model also has big subjective influence under multiple conditions and large computation consumption. To overcome these shortcomings, a new kind of exponential cloud model was provided along with a weight based cloud reasoning algorithm. By splitting the multi-condition generator to several single-condition generators, the algorithm firstly used Analytic Hierarchy Process (AHP) method to get weight of each property, and then used them to calculate weighted average of single-condition generator output to quantitfy value. The validation and effectiveness of this method is checked through a comparison between fuzzy reasoning and stimulation of torpedo avoid system.

Diversity feedback and control particle swarm optimization algorithm

RAO Xinghua WANG Wenge HU Xu

2014, 34(2):  506-509. 

Asbtract ( )   PDF (712KB) ( )  

Related Articles | Metrics

Concerning the premature convergence problem in Particle Swarm Optimization (PSO) algorithm, a Diversity Feedback and Control PSO (DFCPSO) algorithm was proposed. In the process of search, the algorithm dynamically adjusted the algorithm parameters according to the feedback information of diversity; as a result, the distribution of iterations in the diversity curve was improved. When the population diversity or the variance of the population's fitness dropped to the given thresholds, the proposed algorithm would let the particle swarm initialize based on the repulsion of the global best position and fly away from the gathering area efficiently to search again, hence the diversity was controlled in a reasonable range, which avoided premature convergence. The experimental results on several well-known benchmark functions show that DFCPSO has stronger global optimization ability in the complicated problems and multi-modal optimization when being compared with the existing Diversity-Controlled PSO (DCPSO).

Path planning for intelligent robots based on improved particle swarm optimization algorithm

ZHANG Wanjian ZHANG Xianglan LI Ying

2014, 34(2):  510-513. 

Asbtract ( )   PDF (593KB) ( )  

Related Articles | Metrics

As regards the poor local optimization ability of Particle Swarm Optimization (PSO), a nonlinear dynamic adjusting inertia weight was put forward to improve the particle swarm path planning algorithm. This algorithm combined the grid method and particle swarm algorithm, introduced the two concepts of safety and smoothness based on path length, and established dynamic adjustment path length of the fitness function. Compared with the traditional PSO. The experimental results show that the improved algorithm has stronger security, real-time and optimization ability.

On-line gait planning by using preview control of zero moment point

ZENG Peng YAGN Yimin

2014, 34(2):  514-518. 

Asbtract ( )   PDF (643KB) ( )  

Related Articles | Metrics

This paper introduced a method of on-line gait planning based on preview control of ZMP (Zero Moment Point). With reference to the ZMP expression of humanoid robot, the horizontal momentum was introduced into the table-cart model's expression. Based on the extended table-cart model and combined with preview control theory, the on-line gait planning of robot was completed. Furthermore, to improve the stability of robot, the optimization problem of hip trajectory was transformed into the adjustment problem of the centroid trajectory, and the centroid trajectory was compensated by preview control to achieve robot gait optimization. The simulation results show that this method is effective.

Dynamic evaluation of ecological security based on set pair analysis and Markov chain

SHI Xin ZHANG Tao LEI Luning

2014, 34(2):  519-522. 

Asbtract ( )   PDF (711KB) ( )  

Related Articles | Metrics

Concerning the situation that the ecological security has a lot of uncertaint factors and is dynamic, the Set Pair Analysis (SPA) theory and Markov chain were combined for dynamic assessment of ecological security, and a dynamic assessment method of ecological security was proposed combining the state assessment and trend analysis. The method adopted connection degree of SPA to represent uncertain knowledge, used the connection number of SPA to classify ecological security level, and built the comprehensive evaluation model of the system. Through the analysis of the development trend of ecological security, using the ergodicity of Markov chain and statistical quality of Monte Carlo method, the state of ecological security in the next moment could be predicted. This method uses limited assessment data and historical data, dynamically assesses the development and changes of ecological security, and provides a theoretical basis for the safety management.

Hybrid cuckoo search algorithm for solving constrained chemical engineering optimization problems

LONG Wen CHEN Le

2014, 34(2):  523-527. 

Asbtract ( )   PDF (677KB) ( )  

Related Articles | Metrics

The cuckoo search (CS) algorithm has a few disadvantages in the global searching, including slow convergence and high possibility of being trapped in local optimum. In overcome these disadvantages, a effective hybrid CS algorithm based on Rosenbrock local search and Cauchy mutation is proposed to solve constrained numerical and chemical engineering optimization problems. Firstly, good point set method was used to initiate bird nests position, which strengthened the diversity of global searching. Secondly, for the current best position, Rosenbrock local search technique is introduced to improve the convergence speed of CSA. Thirdly, a Gaussian mutation operator would be given on the global optimum of each generation, thus, the algorithm could effectively jump out of local minima. Experimental results are examined with several constrained numerical functions and chemical engineering optimization problems and the results show a promising performance of the proposed algorithm.

Discrete harmony search algorithm for lot-streaming flow shop scheduling problem with setup time

PAN Yuxia XIE Guang XIAO Heng

2014, 34(2):  528-532. 

Asbtract ( )   PDF (782KB) ( )  

Related Articles | Metrics

In this paper, two discrete Harmony Search (HS) algorithms were proposed to solve lot-streaming flow shop scheduling problem with setup time under both the wait and no-wait cases. The objective was to minimize the maximum completion time or makespan. Unlike the original HS algorithm, the proposed algorithm represented a harmony as a discrete job permutation and applied inver-over and reconstruction operators to generate a new mechanism. An efficient initialization scheme based on the modified Nawaz-Enscore-Ham (NEH) heuristic was presented to construct an initial population with a certain level of quality and diversity. A simple but effective local search was added to enhance the intensification capability. The computational results and comparisons show that the proposed algorithm is effective and efficient in finding better solutions for the problem considered.

Mouse behavior recognition based on human computation

LIU Jing DENG Shasha TONG Jing CHEN Zhengming

2014, 34(2):  533-537. 

Asbtract ( )   PDF (828KB) ( )  

Related Articles | Metrics

The mouse behaviors cannot be accurately recognized by the existing computer-based automatic analysis system, and the ground truth is generally achieved from experts’ annotation on a massive number of video images. However, to some extent, subjective misjudgments are unavoidable. To solve these problems, a human computation-based mouse behavior recognition method was proposed in this paper. Because of the superiority of human visual perception, and the decentralization and cooperation of the internet, human brains were treated as processors in a distributed system. Firstly, every mouse behavior frames were distributed to on-line individuals randomly, and each behavior frame was classified by a large number of on-line individuals. Secondly, all the effective classifications from the on-line individuals were collected, analyzed and processed by computer system, realizing the final mouse behavior classification based on these frame sequences. The experimental results show that the proposed method is effective to improve the correct recognition rate of mouse behaviors with limited cost.

Simultaneous recursive identification algorithm of system order and parameters based on determinant ratio method

ZHAO Yongli ZHONG Heng LI Dingyuan HU Tao

2014, 34(2):  538-541. 

Asbtract ( )   PDF (501KB) ( )  

Related Articles | Metrics

Concerning the output error model, order identification and parameter estimation were integrated and extended, and the determinant ratio method based on the auxiliary model was put forward. The system order and parameter estimation were got simultaneously with this method, so it could reduce calculation time in the process of system identification. Considering the inaccuracy of the determinant ratio method, a model validation method was proposed to enhance the identification ability. At last, the simulation indicates that the expended determinant ratio method effectively estimates the system order and parameters.

Concept drift detection based on distance measurement of overlapped data windows

LIU Mao ZHANG Dongbo ZHAO Yuanyuan

2014, 34(2):  542-545. 

Asbtract ( )   PDF (721KB) ( )  

Related Articles | Metrics

To solve the false detection and detection delay of concept drift for data stream, a new online concept drift detection method based on the distance measurement of overlapped data windows was proposed in this paper. By dividing the data stream into overlapped data windows and computing the heterogeneous Euclidean distance of neighboring windows, and measuring the inconsistency of the data windows through the nearest neighbor principle, the authors could achieve the evaluation of distribution diversity and the detection of concept drift. To evaluate the effectiveness of the proposed method, experiments were made on some public data sets with different drift severity and drift speed. The experimental results show that the proposed method can detect different types of concept drift quickly and accurately and can figure out the locations where concept drift appeared. Key words: concept drift; data stream; heterogeneous Euclidean distance; overlap data windows

Single sample face recognition based on orthogonal gradient binary pattern

YANG Huixian CAI Yongyong ZHAi Yunlong LI Qiuqiu FENG Junpeng

2014, 34(2):  546-549. 

Asbtract ( )   PDF (590KB) ( )  

Related Articles | Metrics

To overcome the limitations of traditional face recognition methods for single sample, an improved gradient face algorithm named Orthogonal Gradient Binary Pattern (OGBP), which is robust to variations of illumination, face expression and posture, was proposed. Firstly, the features of the image samples were extracted by orthogonal gradient binary pattern. Then the feature vectors of each direction were concatenated into the general feature vector for face recognition. Finally the Principle Component Analysis (PCA) method was used to reduce dimensions and the nearest neighbor classifier was used for face image classification and recognition. Experimental results on YALE and AR face database indicate that the proposed method is simple, effective and better than the original gradient face algorithm, and also has better performance in face description for single sample.

Face recognition based on symmetric Gabor features and sparse representation

HE Lingli LI Wenbo

2014, 34(2):  550-552. 

Asbtract ( )   PDF (442KB) ( )  

Related Articles | Metrics

Inspired by prior knowledge of face images' approximate symmetry, an algorithm based on symmetric Gabor features and sparse representation was proposed, which was successfully applied into face recognition in the paper. At first, mirror transform was performed on face images to get their mirror images, with which the face images could be decomposed into odd-even symmetric faces. Then, Gabor features were extracted from both odd faces and even faces to get the Gabor odd-even symmetric features，which could be fused via a weighting factor to generate the new features. At last, the newly obtained features were combined to form an over-complete dictionary which was used by sparse representation to classify the faces. The experimental results on AR and FERET face databases show that the new method can achieve high accuracy even when face images are under expression, pose and illumination variations.

Virtual reality and digital media

Compressing-sensing cone-beam CT reconstruction algorithm of fixed step-size

ZHANG Xiaomeng YANG Hongcheng ZHANG Tao

2014, 34(2):  553-557. 

Asbtract ( )   PDF (680KB) ( )  

Related Articles | Metrics

To solve the problem of image reconstruction of incomplete projection data from cone-beam CT, a fast cone-beam CT reconstruction algorithm was proposed. In this work, the cone-beam CT reconstruction problem was reduced to an unconstrained optimization problem of minimizing an objective function which included a squared error term combined with a sparseness-inducing regularization term. The Lipschitz continuity of the objective function was analyzed and the Lipschitz constant was estimated based on its definition. The gradient descent step-size was calculated by the Lipschitz constant and the reconstructed image was updated by gradient method. Finally simultaneous algebraic reconstruction technique was used to reconstruct image from limited-angle projections and to meet the constraint of the projection data. An adaptive step-size technique was accommodated as so to accelerate the convergence of proposed algorithm. Simulation with noiseless Shepp-Logan shows: In comparison with simultaneous algebraic reconstruction technique, adaptive steepest descent-projection onto convex sets algorithm and gradient-projection Barzilari-Borwein algorithm, the proposed algorithm has higher SNR (Signal-to-Noise Ratio) by 13.7728dB, 12.8205dB, and 7.3580dB respectively. The algorithm has better performance in convergence speed and reconstruction accuracy, and can greatly improve the quality of images reconstructed from few projection data.

Parameter extraction method for Mel frequency cepstral coefficients based on Fisher criterion

XIAN Xiaodong FAN Yuxing

2014, 34(2):  558-561. 

Asbtract ( )   PDF (734KB) ( )  

Related Articles | Metrics

Concerning the low identification precision of Mel Frequency Cepstral Coefficients (MFCC) parameters in high frequency signals and the problem that the influence of each dimension feature parameters has not been considered to identify, the method of extracting features based on MFCC, IMFCC (Inverted MFCC) and MidMFCC (Mid-frequency MFCC) combined with Fisher criterion was adopted. Extracting MFCC, IMFCC and MidMFCC parameters from speech signals and calculating the Fisher ratio of components of three parameters, useful parameters were chosen by using Fisher standard and a mixture feature was constructed to improve mid-frequency and high frequency recognition accuracy. The experimental results show that the new feature has better recognition results compared with MFCC in the same environment.

Image super-resolution algorithm based on improved sparse coding

SHENG Shuai CAO Liping HUANG Zengxi WU Pengfei

2014, 34(2):  562-566. 

Asbtract ( )   PDF (904KB) ( )  

Related Articles | Metrics

The traditional Super-Resolution (SR) algorithm, based on sparse dictionary pairs, is slow in training speed, poor in dictionary quality and low in feature matching accuracy. In view of these disadvantages, a super-resolution algorithm based on the improved sparse coding was proposed. In this algorithm, a Morphological Component Analysis (MCA) method with adaptive threshold was used to extract picture feature, and Principal Component Analysis (PCA) algorithm was employed to reduce the dimensionality of training sets. In this way, the effectiveness of the feature extraction was improved, the training time of dictionary was shortened and the over-fitting phenomenon was reduced. An improved sparse K-Singular Value Decomposition (K-SVD) algorithm was adopted to train low-resolution dictionary, and the super-resolution dictionary was solved by utilizing overlapping relation, which enforced the effectiveness and self-adaptability of the dictionary. Meanwhile, the training speed was greatly increased. Through the reconstruction of color images in the Lab color space, the degradation of the reconstructed image quality, which may be caused by the color channel's correlation, was avoided. Compared with traditional methods, this proposed approach can get better high-resolution images and higher computational efficiency.

Speech enhancement using subband spectral-subtraction

CAI Yu HAO Chengpeng HOU Caohuan

2014, 34(2):  567-571. 

Asbtract ( )  

Related Articles | Metrics

A subband spectral-subtraction method for speech enhancement was proposed. Time series were decomposed into frequency subbands through the filterbank and in each subband, an improved spectral-subtraction technique was applied. This method mainly considered that most environmental noises would affect the speech spectrum nonuniformly within different frequencies and multiband processing would be more accurate and effective. In the speech processing experiments, objective evaluation reveals that the proposed algorithm performs well in noise suppression and speech quality improvement, which makes the speech after processing more comfortable and intelligible.

Design of campus network video broadcast based on cloud computing

LIU Jing

2014, 34(2):  572-575. 

Asbtract ( )   PDF (793KB) ( )  

Related Articles | Metrics

This article analyzed the structure of traditional campus network live video technologies. It proposed a live video design method, based on cloud computing, to solve current shortcomings and deficiencies. The article began with a description of the whole live video structure in cloud computing environment, and then made a thorough analysis on the related key issues. Finally, a test was carried out on a real campus network. This method adopted multi-layer construction thoughts. It is flexible and expandable. It substantially saves a lot of the main campus network broadband and physical calculation resources. It reduces the difficulty in the operation and maintenance of the live video platform.

Optimized data association algorithm based on visual simultaneous localization and mapping

ZHAO Liang CHEN Min LI Hongchen

2014, 34(2):  576-579. 

Asbtract ( )   PDF (612KB) ( )  

Related Articles | Metrics

The scale of data association increases as the map grows, which is one of the major reasons for the poor real-time performance of robot in the process of Simultaneous Localization And Mapping (SLAM). In visual SLAM system, SIFT (Scale Invariant Feature Transform) algorithm was used to extract the natural landmarks. Two improvements were introduced to improve the real-time of data association：firstly，extracted the "interest region"； secondly，took into account the physical location of current landmarks. The experimental results indicate that this kind of improvement method is reliable, and the capability of reducing computational complexity is obvious.

Moving object detection algorithm of improved Gaussian mixture model

HUA Yuanlei LIU Wanjun

2014, 34(2):  580-584. 

Asbtract ( )   PDF (773KB) ( )  

Related Articles | Metrics

For the traditional Gaussian mixture model cannot detect complete moving object and is prone to detect the background as the foreground region, an improved algorithm was proposed for moving object detection based on Gauss mixture model. The Gaussian background model mixed with improved frame difference method for integration, distinguished the uncovered background area and moving object region, which could extract the complete moving object. To give a larger background updating rate of uncovered background area, the background exposure of regional influences was eliminated. In complex scene, it used the method of replacement by background model to improve the stability of the algorithm. The experiments prove that the improved algorithm has been greatly improved in the aspects of adaptability, accuracy, real-time, practicality and so on, and can correctly and effectively detect moving object in the situation with various complicated factors.

People counting based on skeleton feature

XIA Jingjing GAO Lin FAN Yong DUAN Jingjing REN Xinyu LIU Xu GAO Pan

2014, 34(2):  585-588. 

Asbtract ( )   PDF (589KB) ( )  

Related Articles | Metrics

Concerning the problem that pedestrians would be partially or seriously shaded by each other in video monitoring, this paper proposed a people counting algorithm based on human body skeleton feature. At first, the initial human skeleton was extracted by morphological skeleton extraction algorithm. Then the optimal skeleton feature was obtained by eliminating outliers and pseudo branches. Finally, this paper established a head detection response rule through analyzing the characteristics of skeleton in head areas to detect the head of pedestrian, and completed people counting by counting the heads of pedestrians. The experimental results show that the algorithm can solve the problems of partial and serious shading in video monitoring. For relatively sparse scene, the overall people counting accuracy rate of the algorithm is about 95%.

Design of live video streaming, recording and storage system based on Flex, Red5 and MongoDB

ZHEN Jingjing YE Yan LIU Taijun DAI Cheng WANG Honglai

2014, 34(2):  589-592. 

Asbtract ( )   PDF (632KB) ( )  

Related Articles | Metrics

In order to improve the conventional situation that network video does not play smoothly during live or on-demand and find storage strategy of mass video data, this paper presented an overall design scheme of a real-time live video recording and storage system. The open source streaming media server Red5 and the rich Internet application technology Flex were utilized to achieve live video streaming and recording. The recorded video data would be stored in the open source NoSQL database MongoDB. The experimental results illustrate that the platform can meet requirements of multi-user access and data storage.〖JP〗

Brain tumor segmentation based on morphological multi-scale modification

WAN Shengyang WANG Xiaopeng HE Shihe WANG Chengyi

2014, 34(2):  593-596. 

Asbtract ( )   PDF (626KB) ( )  

Related Articles | Metrics

As many methods of brain tumor Magnetic Resonance Imaging (MRI) segmentation are usually driven by such conditions as noise, intensity inhomogeneity within tumor, fuzzy and discontinuous boundaries, it is difficult to segment tumor accurately. To improve the segmentation results, morphological multiscale modification of controlled marker was proposed. Firstly, this method was based on morphological gradient images because the adaptive structure elements were utilized on different pixels in different areas. In addition, modifying gradient image was key to avoid a larger misregistration of target boundaries. Finally, marker-controlled watershed was applied to segment brain tumor. The experimental results show that the method of brain tumors has more accurate segmentation results. Key words：brain tumor; morphological multi-scale modification; watershed transform

Industries and fields application

Washout control and stability analysis for cyclic traffic flows

XUE Peng REN Pengfei WANG Hua

2014, 34(2):  597-600. 

Asbtract ( )   PDF (525KB) ( )  

Related Articles | Metrics

Concerning the traffic jams due to bad speed control for cyclic traffic flows, a suppression method was proposed on Washout control. With optimal velocity function, a nonlinear dynamic mathematical model for cyclic traffic flow was derived. To reduce the unreasonable factors of taking drivers' sensitivities as main parameters, Washout control was employed to obtain stability on its equilibrium. Parameters to keep system stability were also considered by using small gain theorem. Simulating a cyclic traffic flow with 20 cars, the simulation results show that the traffic flow reaches its equilibrium in 100 seconds with the proposed controller.

Multi-Agent urban traffic coordination control research based on game learning

ZHENG Yanbin WANG Ning DUAN Lingyu

2014, 34(2):  601-604. 

Asbtract ( )   PDF (626KB) ( )  

Related Articles | Metrics

The coordination problem between Agents in traffic intersections is a gambling problem. On the basis of bounded rationality, this paper tentatively made use of game learning thought to build the multi-Agent coordinate game learning algorithm. This learning coordination algorithm analyzed travelers' unreasonable behavior and corrected it to realize the urban traffic intersections unimpeded, so as to achieve regional and global transportation optimization. At last, its feasibility is verified by means of an example and simulation.

Bottom-following control for underactuated unmanned underwater vehicle based on altimeter information processing

YAN Zheping DENG Lirong SUN Haitao

2014, 34(2):  605-609. 

Asbtract ( )   PDF (803KB) ( )  

Related Articles | Metrics

Concerning the problem of bottom-following of underactuated Unmanned Underwater Vehicle (UUV) in the condition of output of the altimeter with noisy measures, combining intrinsic characteristic for underactuated UUV, a nonlinear bottom-following control method was proposed based on backstepping theorem. First, owing to the influence of seawater temperature and salinity, a Kalman filter was applied to solve the inaccurate measuring data to improve the accuracy for altimeter information. Then, a bottom-following controller was designed by resorting to backstepping and Lyapunov-based techniques, and the asymptotic convergence of the control system was proved. Finally, simulation and sea trial were performed to verify the feasibility, and the results demonstrate that the proposed nonlinear controller including processed altimeter information can achieve precise bottom-following for underactuated UUV.

Taxiway conflict control strategy based on objective perception events driven model

CHEN Ping TANG Xinmin XING Jian

2014, 34(2):  610-614. 

Asbtract ( )   PDF (714KB) ( )  

Related Articles | Metrics

To avoid conflict incurring in airport taxiway and ease air traffic controller load, a control strategy of taxiway conflict based on sensor network was proposed. The dynamic model of taxiway based on sensor network was proposed according to taxiway movement process and the taxiway movement controlling regulations are defined, then the problems of taxiway conflict are transformed into state forbidden problems. Controllers were designed using the partial correlation matrix method and logical mutual exclusion method for state forbidden problems, and a way is proposed for control command of lights decided based on the state of transition. Taxiway conflict can be avoided and guided automatically using navigation light. A simulation was provided to testify the effectiveness of the control strategy finally.