Table of Content

01 December 2013, Volume 33 Issue 12

Previous Issue    Next Issue

2013 National Open Distributed and Parallel Computing Confernece of China (DPCS2013)

Accelerating hierarchical distributed latent Dirichlet allocation algorithm by parallel GPU

WEN La RUI Jianwu HE Tingting GUO Liang

2013, 33(12):  3313-3316. 

Asbtract ( )   PDF (802KB) ( )  

Related Articles | Metrics

Hierarchical Distributed Latent Dirichlet Allocation (HD-LDA), a popular topic modeling technique for exploring collections, is an improved Latent Dirichlet Allocation (LDA) algorithm running in distributed environment. Mahout has realized HD-LDA algorithm in the framework of Hadoop. However the algorithm processed the whole documents of a single node in sequence, and the execution time of the HD-LDA program was very long when processing a large amount of documents. A new method was proposed to combine Hadoop with Graphic Processing Unit (GPU) to solve the above problem when transferring the computation from CPU to GPU. The application results show that combining the Hadoop with GPU which processes many documents in parallel can decrease the execution time of HD-LDA program greatly and achieve seven times speedup.

Improved parallel simulation of silicon anisotropic etching based on GPU

CHEN Jingyuan LI Jianhua GUO Weibin

2013, 33(12):  3317-3320. 

Asbtract ( )   PDF (666KB) ( )  

Related Articles | Metrics

Silicon anisotropic etching simulation is time-consuming due to its complex chemical process. In order to accelerate the process, the GPU-based silicon anisotropic etching parallel simulation was discussed, and an improved parallel method was proposed to improve the direct parallelization of serial algorithms method with low efficiency. In this method, the parallel load of the direct parallelization was increased, the memory management cost was reduced, and the acceleration performance was improved. The experimental results show that the method can achieve a simulation with higher speedup.

Parallelism of adaptive Hungary greedy algorithm for biomolecular networks alignment

MA Jin XIE Jiang DAI Dongbo TAN Jun ZHANG Wu

2013, 33(12):  3321-3325. 

Asbtract ( )   PDF (790KB) ( )  

Related Articles | Metrics

Biomolecular networks alignment is an important field, and it is an effective way to study biomolecular phenomenon. Adaptive Hungary Greedy Algorithm (AHGA) is one of the valid biomolecular networks alignment algorithms. Commonly, biomolecular networks have large scale and biological background, so the data of biomolecular networks are special. In order to get the alignment results of biomolecular networks in acceptable time, considering the biological significance when aligning them, two methods including MPI (Message Passing Interface) and CUDA (Compute Unified Device Architecture) were used to parallelize the adaptive hybrid algorithm. The methods were analyzed and compared to find the suitable one for biomolecular networks alignment.

Energy saving and load balance strategy in cloud computing

QIAN Yurong YU Jiong WANG Weiyuan SHUN Hua LIAO Bin YANG Xingyao

2013, 33(12):  3326-3330. 

Asbtract ( )   PDF (867KB) ( )  

Related Articles | Metrics

An adaptive Virtual Machine (VM) dynamic migration strategy of soft energy-saving was put forward to optimize energy consumption and load balance in cloud computing. The energy-saving strategy adopted Dynamic Voltage Frequency Scaling (DVFS) as the static energy-aware technology to achieve the sub-optimized static energy saving, and used online VM migration to achieve an adaptive dynamic soft energy-saving in cloud platform. The two energy-saving strategies were simulated and compared with each other in CloudSim platform, and the data were tested on PlanetLab platform. The results show that: Firstly, the adaptive soft and hard combination strategy in energy-saving can significantly save 96% energy; secondly, DVFS+MAD_MMT strategy using Median Absolute Deviation (MAD) to determine whether the host is overload, and choosing VM to remove based on Minimum Migration Time (MMT), which can save energy about 87.15% with low-load in PlanetLab Cloudlets than that of experimental environment; finally, security threshold of 2.5 in MAD_MMT algorithm can consume the energy efficiently and achieve the adaptive load balancing of virtual machines migration dynamically.

Energy-saving optimization in datacenter based on virtual machine scheduling

XIANG Jie DING Enjie

2013, 33(12):  3331-3334. 

Asbtract ( )   PDF (774KB) ( )  

Related Articles | Metrics

With the increasing energy consumption in current data centers, many emerging energy-saving mechanisms have been proposed to reduce the energy consumption, but most of these methods assume data center is in a homogeneous environment. However, most of current data centers are heterogeneous as different types of servers are purchased at different time in reality. An energy-efficient method named Primary Virtual Machine Allocation Policy (PVMAP) was proposed, with the performance/power introduced as a parameter to indicate the energy efficiency of each server. The server of high energy efficiency would be fully utilized with high priority in the dynamic Virtual Machine (VM) consolidation. Also the consolidation process would try to minimize the VM migrations and running hosts in the end. The simulation results demonstrate that the PVMAP can guarantee the energy conservation and Quality of Service (QoS) at the same time, and it has better stability and extensibility.

Architecture and scheduling scheme design of TsinghuaCloud based on OpenStack

Shaoka ZHAO LI Liyao LING Xiao XU Cong YANG Jiahai

2013, 33(12):  3335-3338. 

Asbtract ( )   PDF (809KB) ( )  

Related Articles | Metrics

Based on cloud computings architecture and the actual demands of Tsinghua University, followed by utilizing the advanced OpenStack platform, adopting hierarchical design method, the TsinghuaCloud platform that could be used to perform integrated management on cloud resources was designed and implemented. The advantages and main required module functions of this system were analyzed. Focusing on the resource scheduling, a strategy based on task scheduling and load balancing was proposed. The experiment and analysis of the scheduling plan verify that the scheduling strategy can balance servers resource load on the basis of ensuring its service performance and execution efficiency, so as to make the cloud platform relatively stable.

Approach of large matrix multiplication based on Hadoop

SHUN Yuanshuai CHEN Yao GUAN Xinjun LIN Chen

2013, 33(12):  3339-3344. 

Asbtract ( )   PDF (1071KB) ( )  

Related Articles | Metrics

Large and very large matrix cannot be dealt by current matrix multiplication algorithms. With the development of MapReduce programming frame, parallel programs have become the main approaches for matrix computing. The matrix multiplication algorithms based on MapReduce were summarized, and an improved strategy for large matrix was proposed, which had a tradeoff in the data volume between the computation on single work node and the network transmission. The experimental results prove that the parallel algorithms outperform the traditional ones on the large matrix, and the performance will improve with the increase of the clusters.

Massive medical image retrieval system based on Hadoop

FAN Min XU Shengcai

2013, 33(12):  3345-3349. 

Asbtract ( )   PDF (776KB) ( )  

Related Articles | Metrics

In order to improve the retrieval efficiency of massive medical images, a new medical image retrieval system was proposed based on distributed Hadoop to solve the low efficiency of medical image retrieval system based on single node. Firstly, the features of medical image were extracted by using Brushlet transform and Local Binary Pattern (LBP) algorithm, and the feature database was stored in the Hadoop Distributed File System (HDFS). Secondly, the Map was used to match the features of retrieval images and medical images in the library, and the matching results of the Map task were collected and sorted by the Reduce function. Finally, the optimum results of medical image retrieval were obtained according to the ordering. The test results show that, compared with other medical image retrieval systems, the proposed system reduces the time of image storage and retrieval, and improves the image retrieval speed.

Design and implementation of E-mail security service system with cloud computing

DAI Jin LIU Bo BIAN Haoyu

2013, 33(12):  3350-3353. 

Asbtract ( )   PDF (687KB) ( )  

Related Articles | Metrics

E-mail security scanning software is being widely used. With the rapid increase of user number and system flow, there are insurmountable problems in terms of performance, robustness, maintainability and scalability in the traditional tightly-coupled and synchronous IMHS (Inter-scan Message Hosted Security) system. With regards to the system bottleneck by the mass users, a loosely-coupled, asynchronous, stateless principle was proposed for system design. Through the integration of cloud computing and Service Oriented Architecture (SOA) technique, a P2P-based E-mail secure cloud service system was designed and implemented. The system supports dynamic collaborative process, and effectively improves the efficiency of resource use and system scalability. The results and analysis of typical operation tests in real system verify the feasibility and effectiveness of the system architecture.

Collaborative filtering model combining users' and items' predictions

YANG Xingyao YU Jiong TURGUN Ibrahim LIAO Bin

2013, 33(12):  3354-3358. 

Asbtract ( )   PDF (792KB) ( )  

Related Articles | Metrics

Concerning the poor quality of recommendations of traditional user-based and item-based collaborative filtering models, a new collaborative filtering model combining users and items predictions was proposed. Firstly, it considered both users and items, and optimized the similarity model with excellent performance dynamically. Secondly, it constructed neighbor sets for the target objects by selecting some similar users and items according to the similarity values, and then obtained the user-based and item-based prediction results respectively based on some prediction functions. Finally, it gained final predictions by using the adaptive balance factor to coordinate both of the prediction results. Comparative experiments were carried out under different evaluation criteria, and the results show that, compared with some typical collaborative filtering models such as RSCF, HCFR and UNCF, the proposed model not only has better performance in prediction accuracy of items, but also does well in the precision and recall of recommendations.

Analysis of characteristics of social networks in terms of microblog impact

LV Feifei XU Yabin LI Zhuo WU Zhuang

2013, 33(12):  3359-3362. 

Asbtract ( )   PDF (794KB) ( )  

Related Articles | Metrics

The influence of social network is closely related with its structural characteristics. Based on the data from Sina microblog, the distributions of the number of followers and followings were analyzed and found that the number of followers and followings both were power-law distributed. The distance characteristic between different pairs of nodes was discussed, and it was found and proved that there was "small-world" phenomenon in the microblog network. At last, the links between nodes in the network were investigated and found that the formation of the link satisfied triple closure principle. The investigation results on the above three topics are important for us to explore the relationship between the influence of micro-blog and the structural characteristics of its underlying social network, as well as to the design of mechanisms to control the influence.

Case study of achieving context-awareness based on predicate detection

FANG Chao YANG Yiling HUANG Yu

2013, 33(12):  3363-3367. 

Asbtract ( )   PDF (859KB) ( )  

Related Articles | Metrics

Currently, to develop context-aware applications that are flexible and adaptable is complex and laborious. There are many unexpected cases to handle. As one of the important approaches to achieve context-awareness, predicate detection can represent context effectively. However, how predicate detection supports the development of context-aware applications on a real device is still largely unknown. In order to cope with these issues, a simple scenario was created. Predicate detection was practically applied to control the car running in a designated environment. The original context was formally modeled and contextual properties were specified into snapshot predicates and sequence predicates. By detecting these specified predicates in the case study, predicate detection was applied to the robot car. The performance analysis shows that predicate detection can effectively detect the car's contextual properties and successfully help the car finish the running task.

Parallel recognition of illegal Web pages based on improved KNN classification algorithm

XU Yabin LI Zhuo CHEN Junyi

2013, 33(12):  3368-3371. 

Asbtract ( )   PDF (828KB) ( )  

Related Articles | Metrics

There are many illegal Web pages on the Internet, which may have pornographic, violent, gambling or reactionary content. Without being filtered effectively, they will exercise a malign influence on the searching services. An improved K-Nearest Neighbors (KNN) classification algorithm to promote the recognition accuracy was proposed and implemented on a virtualized platform following the MapReduce model provided by the open source software Hadoop, which made it distributed and parallel. Through experiments and comparison with the existing work, it is proved that the proposed recognition method improves the accuracy and efficiency greatly. The algorithm is implemented on a virtualized platform following the MapReduce model provided by the open source software Hadoop, which makes it distributed and parallel. Through experiments and comparison with existing work, it is proved that the recognition method we propose improves the accuracy and efficiency greatly.

Adaptive particle swarm optimization algorithm based on diversity feedback

TANG Kezong WU Jun ZHAO Jia

2013, 33(12):  3372-3374. 

Asbtract ( )   PDF (620KB) ( )  

Related Articles | Metrics

In order to further improve the efficiency of the population diversity in the implementation process of the Particle Swarm Optimization (PSO), an Adaptive PSO (APSO) algorithm based on diversity feedback was proposed. APSO adopted a new population diversity evaluation strategy which enabled the automatic control of the inertia weight with population diversity in the search process to balance exploration and the exploitation's process. In addition, an elite learning strategy was used in the globally best particle to jump out of local optimal solution. It not only ensured the convergence rate of the algorithm, but also adaptively adjusted the search direction to improve the accuracy of solutions. The simulation results on a set of typical test functions verify the validity of APSO.

Multi-objective optimization algorithm based on dynamic multiple particle swarms

LIU Bin ZHANG Renjin

2013, 33(12):  3375-3379. 

Asbtract ( )   PDF (753KB) ( )  

Related Articles | Metrics

To keep the diversity of particles when multi-objective particle swarm optimization is running, a multi-objective optimization algorithm was proposed based on particle swarms initialization and dynamic multiple particle swarms cooperation. The quantity of swarms was increased or decreased dynamically according to the distribution of particle swarms in the decision space. To avoid converging too quickly, the factors, which affected the flying speed of a particle, were improved to depend on the current velocity inertia of the particle, the best value of the particle, the best value of the swarm which the particle belonged to, and the optimal value of all swarms. This algorithm was tested by five benchmark functions and compared with the multi-objective particle swarm optimization. The experimental results indicate that the proposed algorithm is superior to the multi-objective particle swarm optimization.

Artificial fish swarm parallel algorithm based on multi-core cluster

LI Shuang LI Wenjing SHUN Huanlong LIN Zhongming

2013, 33(12):  3380-3384. 

Asbtract ( )   PDF (769KB) ( )  

Related Articles | Metrics

Concerning the problems of low accuracy, limitations of stagnation and slow convergence speed in the later evolution process of Artificial Fish Swarm Algorithm (AFSA), a Parallel Dynamic weigh Niches Artificial Fish Swarm (PDN-AFS) algorithm based on multi-core cluster was proposed. Firstly, the advantages and disadvantages of AFSA were analyzed, and dynamic weighting factor strategy and niche mechanism were adopted, hence a new Dynamic weigh Niches Artificial Fish Swarm (DN-AFS) algorithm was put forward. Then parallel design and analysis of DN-AFS algorithm based on parallel programming model (MPI+OpenMP) were introduced. Finally, the simulation experiments on multi-core cluster environment were given. The experimental results show that PDN-AFS can effectively improve the convergence speed and optimization performance of the complex multimodal function optimization problem, and achieve high speed ratio.

Broadcast-based multiparty remote state preparation protocol

GENG Huantong JIA Tingting LIU Wenjie

2013, 33(12):  3385-3388. 

Asbtract ( )   PDF (617KB) ( )  

Related Articles | Metrics

Remote State Preparation (RSP) is a branch of quantum information processing. In order to prepare the same state to multiple recipients, a broadcast-based RSP protocol was proposed for one sender and two receivers, and then it was extend to N receivers. GHZ states were used as shared quantum resources. By constructing two special measurement bases, the sender realized two times of multi-particle projective measurement; then the receivers used unitary operation to recover the prepared state depending on the measurement results. Analysis shows that multiparty RSP protocol can be used to broadcast information in quantum network.

Optimization methods for application layer multicast

SHEN Hua FENG Jing YIN Min MA Weijun JIANG Lei

2013, 33(12):  3389-3393. 

Asbtract ( )   PDF (793KB) ( )  

Related Articles | Metrics

The performance requirements of application layer multicast are not identical in different business areas, and the network environment is more complex as follows: the multicast node is diversified, the communication channel is complex, the node scale is large, the amount of data is magnified and so on. The multicast programs should be optimized by analyzing the existing application layer multicast and combining new applications demands. By analyzing the evaluating indicator of application layer multicast, application layer multicast optimization method would be divided into the coding features optimization, the hierarchical clustering optimization, the node performance optimization, the optimal parent selection optimization and the routing information maintenance optimization. Through comparing the performance indicators of different types of optimization methods, the applicable environments were introduced separately, and further research directions were discussed finally.

Collection tree-based opportunistic routing protocol with low duty cycle

XU Dan CHEN Xiaojiang HUANG Junjie YIN Xiaoyan FANG Dingyi

2013, 33(12):  3394-3397. 

Asbtract ( )   PDF (652KB) ( )  

Related Articles | Metrics

The critical issues in design of routing protocol for Wireless Sensor Network (WSN) are energy awareness and maximizing the lifetime. Focus on those challenges, a new routing algorithm named CTOR was proposed based on time synchronization sleeping schedule with low duty cycle. In CTOR, a node selected several proper forwarders in order to gain assured delivery ratio, and then broadcasted the packets to forwarders; in order to reduce replication packets and yield much gain efficiently, forwarders that received packets forwarded packets according to a probability. Then the sink node broadcasted control messages to make all nodes time synchronized, the other nodes turned into sleeping mode according to the permanent duty cycle. This mechanism can reduce the power consumption and hence the network can work longer. The experimental results show that CTOR can alleviate the routing hole problem, prolong the lifetime of the network and increase the delivery ration of packets.

Interference characteristic simulation in CSMA/CA-based wireless multi-hop networks

TAN Guoping TANG Luyao HUA Zaijun LIU Xiuquan

2013, 33(12):  3398-3401. 

Asbtract ( )   PDF (606KB) ( )  

Related Articles | Metrics

Conflict interference is one of the key factors affecting the performance of wireless multi-hop network. In view of the different distribution of interference nodes in the network, adopting stochastic point process simulation, the cumulative interference characteristics of nodes were studied based on different stochastic point processes in Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. Then the interference simulation platform based on NS2 was established to simulate the realistic interference distribution. Finally, the comparison between them shows that there is a certain difference between the simulation and the reality, and the reasons were also pointed out.

Lightweight protocol with anonymity for Ad Hoc network based on bilinear pairings

LIANG Yumin CAO Tianjie

2013, 33(12):  3402-3405. 

Asbtract ( )   PDF (767KB) ( )  

Related Articles | Metrics

Lots of anonymous protocols for Ad Hoc network have been proposed to enforce the anonymity of the nodes in the network. However, most of the protocols utilize many asymmetric key computations which consume vast time and resources, thus, these protocols are not so suitable for those nodes in Ad Hoc network with limited power and poor computational ability. Hence, a new lightweight protocol with anonymity for Ad Hoc network was proposed. The new protocol ensured many security features and anonymity; most importantly, it employed bilinear pairings to realize the authenticated key exchange. Compared with other protocols, the proposed protocol is more efficient in routing construction by lowering the computing time to large extent and reducing the asymmetric key computation.

Directional simple auction aggregation protocol for wireless sensor and actor network

ZHENG Ruoqin DU Jinglin XIE Li

2013, 33(12):  3406-3409. 

Asbtract ( )   PDF (570KB) ( )  

Related Articles | Metrics

To minimize the communication cost and response time, actors are expected to coordinate among themselves to make task assignment to respond service request in Wireless Sensor and Actor Network (WSAN). In the existing solutions, the market-based distributed Simple Auction Aggregation Protocol (SAAP) is suitable for the resource-limited WSAN. A Directional Simple Auction Aggregation Protocol (DSAAP) was proposed based on SAAP, which screened the next-hop child node and restricted the retransmission to reduce the message transmission during auction. The simulation results show that the proposed protocol has lower communication cost compared to the SAAP without performance loss of the optimal node ratio and the distance ratio of the selected to the optimal.

Energy balanced uneven clustering algorithm based on ant colony for wireless sensor network

MIAO Congcong CHEN Qingkui CAO Jianwei ZHANG Gang

2013, 33(12):  3410-3414. 

Asbtract ( )   PDF (807KB) ( )  

Related Articles | Metrics

In the Wireless Sensor Network (WSN) routing, if the node does not fully consider the path node residual energy and link status of the route, some nodes will be dead early, hence the lifetime of the network will be shorten seriously. To resolve this problem, a uneven clustering routing algorithm for wireless sensor network was proposed based on ant colony optimization algorithm. Firstly, the method clustered nodes using uneven clustering algorithm which considered the node energy. Then considering the node need to transmit data as source node, the sink node as destination node, ant colony optimization algorithm was used to do multipath searching, and the searching process fully considered the factors such as transmission energy consumption, path minimum residual energy, transmission distance and transmission hops, time delay and bandwidth of selected link. Several optimal paths that met the conditions were given to complete the information transmission between source and the destination nodes at last. The experimental results show that the lifetime of WSN can be effectively prolonged while fully considering the path transmission energy consumption, path minimum residual energy and transmission hops.

Heterogeneous node distribution clustering routing algorithm for wireless sensor network

QIAN Kaiguo DAI Zucheng SHEN Shikai

2013, 33(12):  3415-3418. 

Asbtract ( )   PDF (626KB) ( )  

Related Articles | Metrics

In the existing clustering routing protocol for Wireless Sensor Network (WSN), the election of cluster head nodes in monitoring area is unevenly distributed. A Heterogeneous Node Distribution Clustering Routing Algorithm (HNDCRA) was put forward, in which the election probability of the cluster heads was controlled by the number of the distributed nodes in local area. The detection area of sensor network was divided into squared grids, and the distribution of the sensor nodes in the grids was computed to determine the election probability of the nodes. This could ensure that each grid would have cluster head and the nodes in grid with more nodes that would have bigger election probability, which made the cluster heads have uniform distribution to balance the energy consumption. The performance analysis and simulation experiments show that, compared with the classical LEACH protocol, HNDCRA can evenly distribute cluster heads to the network area, balance energy consumption of entire network distribution, improve the energy utilization, thus prolonging network life time.

Formal verification of railway interlocking system based on ladder logic

YU Lizhen XU Zhongwei CHEN Zuxi ZHANG Shuqin

2013, 33(12):  3419-3422. 

Asbtract ( )   PDF (748KB) ( )  

Related Articles | Metrics

Ladder logic was used to model the railway interlocking system. In order to achieve the purpose of formal verification of the railway interlocking system, the model of the railway interlocking system expressed by ladder logic was converted to NuSMV language, which was a temporal logic model checker. Then Computational Tree Logic (CTL) specification representing the safety requirements of the railway interlocking system was verified. Finally, the formal verification of computer design model of the railway interlocking system was implemented based on NuSMV.

Formal semantics of Agent-based distributed computing model

HOU Jinkui WANG Lei

2013, 33(12):  3423-3427. 

Asbtract ( )   PDF (985KB) ( )  

Related Articles | Metrics

To resolve the problems of system composition and semantic verification in the construction process of distributed computing model, a semantic description framework for Agent-based distributed computing system was proposed based on category theory and process algebra. The structural semantics of the system model was described within category diagrams, and the relations between components were formally described by morphisms. On this basis, the semantic properties that should be preserved during the process of system modeling, refinement and migration were further analyzed and discussed. The application research shows that the proposed framework can not only be used for distributed system modeling, but also be used for the correctness analysis of system decomposition and composition.

Recovery method for high-level language control structures based on structural analysis

HUO Yuanhong LIU Yi JI Weixing

2013, 33(12):  3428-3431. 

Asbtract ( )   PDF (578KB) ( )  

Related Articles | Metrics

To correctly obtain the high-level language control structures of embedded executables and assembly code, and resolve the problem that the existing recovery methods for high-level language control structures cannot handle the unstructured region, the classical control analysis method, structural analysis algorithm, was introduced to study the recovery method for high-level control structures of embedded assembly code. The structural analysis algorithm was improved according to the characteristics of embedded executables, and the high-level language code was generated by using the program control tree, which can be obtained from the results of structural analysis algorithm. Compared with the open source decompiler named DCC, the results show that the improved algorithm is feasible and efficient.

Distributed data storage method based on consistent tree distribution

GUO Dong WANG Wei ZENG Guoshun

2013, 33(12):  3432-3436. 

Asbtract ( )   PDF (828KB) ( )  

Related Articles | Metrics

With the development of cloud computing and big data, traditional single storage medium based data storage cannot meet the demands of large data processing, thus distributed data storage has been widely used recently. However, some existing distributed ways of storage cannot perfectly meet the needs of the distribution system. In order to achieve the distributed data storage and redundancy more effectively, a new distributed method and backup strategy based on Consistent Tree Distribution (CTD) was proposed to achieve the location mapping of data indexing and storage. The new method featured load balancing, no single point of failure, high scalability and easy programming. In addition, a method based on Consistent Binary Tree Distribution (CBTD) was also put forward. Analysis of the application system verifies that the method can satisfy the data balance, load balance and high scalability requirements of the distributed system.

One-site multi-table and cross multi-table frequent item sets mining with privacy preserving

LIN Rui ZHONG Cheng HUA Pei

2013, 33(12):  3437-3440. 

Asbtract ( )   PDF (666KB) ( )  

Related Articles | Metrics

To achieve the goal that personal and original information is not disclosed to each other when several parties cooperatively mine several data tables at different computational sites, based on secure triple-party protocol, a triple-site cross multi-table frequent item sets mining algorithm with privacy preserving was proposed in distributed environment with multiple tables at each site. The proposed algorithm disturbed data by generating random numbers, mined frequent item sets of inter-site in parallel, and linked the data with equal-value by common link attribution of the tables among the sites and applied secure protocol to compute the global support of inter-site cross-table frequent item sets. The experimental results show that the proposed algorithm is efficient, and it can not only mine the cross multi-table frequent item sets, but also preserve the private data at each site.

Hyperspectral image classification based on active learning

HAO Zedong YU Songsong GUAN Jihong

2013, 33(12):  3441-3443. 

Asbtract ( )   PDF (675KB) ( )  

Related Articles | Metrics

Most supervised classification methods require large training samples to avoid the well-known Hughes effect. However, labeling samples is often very expensive in actual world applications. In order to reduce the number of training samples, high-quality training samples are extremely important. A hyperspectral image classification based on active learning was proposed. It provided a new calculation method for concerning region attention degree to combine spectral and spatial characteristics of the image effectively, and used active learning method to obtain training set with the most abundant information and improved the classification accuracy ultimately. The experimental results show that the proposed method performs particularly well for the classification of hyperspectral images, when compared to random sampling supervised classification method and active learning approaches.

Vehicle navigation algorithm based on unscented Kalman filter sensor information fusion

LIANG Dingwen YUAN Lei CAI Zhihua GU Qiong

2013, 33(12):  3444-3448. 

Asbtract ( )   PDF (709KB) ( )  

Related Articles | Metrics

A new autonomous vehicle navigation model was proposed based on multi-sensor system for vehicle navigation and Global Positioning System (GPS) under complex road conditions. And the Unscented Kalman Filter (UKF) was used to overcome some security issues due to the sudden error produced by the Kalman filters with extensions, which belonged to Sigma point based sensor fusion algorithm. It is more suitable than the Kalman filters with extensions that the UKF can calculate the evaluation satisfied the requirement in vehicle navigation. Comparison experiments with the Kalman filter based on polynomial expansion were given in terms of estimation accuracy and computational speed. The experimental results show that the Sigma-point Kalman filter is a reliable and computationally efficient approach to state estimation-based control. Moreover, it is faster to evaluate the motion state of the vehicle according to the current direction situations and the feedback information of vehicle sensor, and can calculate the control input of vehicle adaptively in real time.

Network and communications

Building algorithm for tree-ring application layer multicast based on ant colony algorithm

XU Jianzhen HE Tingting HE Dan ZHOU Tong

2013, 33(12):  3449-3452. 

Asbtract ( )   PDF (798KB) ( )  

Related Articles | Metrics

As an improvement of IP multicast technology, Application Layer Multicast (ALM) has many advantages such as unlimited network architecture, rich resource and high data transfer rate. Considering node performance and end to end delay, a fast and efficient method was proposed to establish application layer multicast tree, it was named Ant Colony Algorithm based Tree-ring Application Layer Multicast Model (ACOTRM). The available studies only gave a topology cursory and had no complete and clear description of the concrete construction process. In view of this, a complete ALM hierarchical tree-ring concrete construction process was put forward including several key steps, such as clustering division, connection in cluster ring, generation of feasible solution and maintenance of the model in survival time. In addition, in order to optimize the ALM state tree, each node was set with a specific priority. The simulation results show that the proposed model provides lower average delay and higher average data delivery ratio, which increases the system stability and forwarding efficiency at the same time.

Data compression and optimization algorithm for wireless sensor network based on temporal correlation

WANG Ling SHI Weiren SHI Xin SONG Ningbo RAN Qike

2013, 33(12):  3453-3456. 

Asbtract ( )   PDF (751KB) ( )  

Related Articles | Metrics

Concerning to the problem that Wireless Sensor Network (WSN) data collection has large data redundancy, large cumulative error and low data accuracy, according to the temporal correlation between collection data, a data compression and optimization algorithm for WSN was proposed. It established segmented one-dimensional linear regression model by analyzing linear relationship of collection data in temporal series. According to the error between collection data and predicted value of regression model, it adaptively adjusted next collection time, and dynamically adjusted the regression model. The simulation results show that the proposed algorithm can reduce the data redundancy and network traffic, and improve the reconfiguration precision of the collection data under different conditions of data changes. The test results in a real scenario show the feasibility of the proposed algorithm.

Estimation algorithm for missing data in wireless sensor network

QIU Baozhi ZHEN Qianqian Yaohua

2013, 33(12):  3457-3459. 

Asbtract ( )   PDF (637KB) ( )  

Related Articles | Metrics

In order to improve the accuracy of the estimated missing data in Wireless Sensor Network (WSN), a self-decision interpolation algorithm was proposed. The algorithm selected different estimation strategies of missing data according to the spatial correlation of the data sets and the continuity of missing data, then introduced the Auto-Regressive and Moving Average (ARMA) model into the study of missing data interpolation. In corresponding to the traditional missing value estimation algorithm, the proposed algorithm not only considered the characteristics of wireless sensor networks, but also took the characteristics of the data themselves into account. The experimental results on the real data sets show that the proposed algorithm improves the precision of the estimation for missing data.

Geographic routing algorithm based on anchor nodes in vehicular network

ZHENG Zheng LI Yunfei YAN Jianfeng ZHAO Yongjie

2013, 33(12):  3460-3464. 

Asbtract ( )   PDF (775KB) ( )  

Related Articles | Metrics

Vehicular network has the following characteristics such as nodes moving fast, topology changing rapidly. The direct use of Global Positioning System (GPS) devices causes large positioning error and low routing connectivity rate. Therefore, the packet delivery rate of the existing location-based routing algorithm is not high enough to provide reliable routing. A geographic routing algorithm based on anchor node in vehicle networks named Geographic Routing based on Anchor Nodes (GRAN) was proposed. Using street lamps as anchor nodes, a vehicle could locate itself through the anchor nodes. Combined with the road gateway and the central data, GRAN established a hierarchical routing structure, thus removing the steps of route discovery and the whole network broadcast. Thus, the routing overhead was reduced and the routing efficiency and the packet delivery rate were improved. By using the NS-2 software and selecting a realistic urban scene, a simulation was conducted on Greedy Perimeter Stateless Routing (GPSR), Graphic Source Routing (GSR) and GRAN. The experimental results show that GRAN can provide a lower average delay, higher packet delivery ratio and throughput at a lower load, compared with several typical location-based routing protocols.

Design of multi-carrier transceivers based on modified discrete fourier transform filter bank

JI Xiang ZHUANG Ling SHAO Kai WANG Guangyu

2013, 33(12):  3465-3468. 

Asbtract ( )   PDF (634KB) ( )  

Related Articles | Metrics

In order to improve the poor frequency selectivity and spectral leakage of traditional Orthogonal Frequency Division Multiplexing (OFDM) multi-carrier transceiver, multi-carrier transceiver based on modified Discrete Fourier Transform (DFT) filter bank was introduced. The design problem of it was formulated as nonconstrained minimized optimization of perfect reconstruction error of modulated filter banks, and the modified window method was taken to design the prototype filter in the modulated filter banks and linear optimization was used to optimize the objective function. Compared to the traditional window method, a spline function was exploited in the transition band of ideal filter of the modified window to eliminate the Gibbs effect. The simulation results show that the designed filter bank with the proposed method gives a better performance in terms of stopband attenuation, and reconstruction error, and the resulted multicarrier transceiver a better Symbol Error Rate (SER) performance in Quadrature Phase Shift Keying (QPSK) modulation and the 3GPP TS 25.104 vehicular multipath and one-tap frequency-domain equalization.

Fast DOA estimation for coherent wideband sources based on symmetrical spectrum

ZENG Yaoping YANG Yixin LU Guangyue

2013, 33(12):  3469-3472. 

Asbtract ( )   PDF (756KB) ( )  

Related Articles | Metrics

A new fast algorithm was proposed to solve the heavy computational load of coherent wideband signal DOA (Direction Of Arrival) estimation. Firstly, through Toeplitz technique of matrix, incoherent wideband signals were obtained without any division for the array. Secondly, according to the character of Hermitian matrix of received data, utilized the unitary transformation matrix, the real matrix could be acquired and the computation of eigendecomposition could be decreased. Finally, through the orthogonality technique of projected subspaces, new space spectrum was acquired with noise subspace and conjugate noise subspace, and the DOA could be obtained just through the angle search from zero to ninety degree in semi-spectrum according to the symmetrical spectrum, while the computational complexity for the search of spectrum peak was reduced by half. The theoretical analysis and simulation results show that the new algorithm has higher precision and smaller computational load, and it is effective for wideband coherent signals.

Bit-flipping prediction acquisition algorithm of weak GPS signal

LI Weibin ZHANG Yingxin GUO Xinming ZHANG Wei

2013, 33(12):  3473-3476. 

Asbtract ( )   PDF (652KB) ( )  

References | Related Articles | Metrics

Long coherent integration duration is needed for weak Global Positioning System (GPS) signal acquisition. However, it is limited in 10ms by the navigation data bit flipping, which is far from enough. To further improve the acquisition sensitivity, a bit-flipping prediction algorithm was proposed. Firstly, the 5ms signal with possible involve bit-flipping, which was detected through the comparison of the coherent integration results of the several blocks of data, was canceled. Then coherent integration was applied to its sub-block signal in rest 15ms and the results did differential coherent integration to overcome its bit-flip and reduced the square loss of non-coherence. At the same time, the summation operation was done ahead of coherent integration to depress its computational complexity. The theoretical research and simulation results show that the acquisition sensitivity and acquisition efficiency have been improved, and the algorithm even can capture the weak signal with Signal-to-Noise Ratio (SNR) less than -50dB.

Design of multi-serial communication for micro-satellite simulation system

ZHANG Wenkai GUAN Guixia ZHAO Haimeng WANG Zhiming WU Taixia YAN Lei

2013, 33(12):  3477-3481. 

Asbtract ( )   PDF (737KB) ( )  

Related Articles | Metrics

A communication system with several serial ports was developed to realize the communication between On-Board Computer (OBC) and cameras in micro-satellite simulation system. The system was designed in Host-Target model. The Host sever managed the multiplex communications between the host and its clients. It also sent out trigger signal to control five cameras through a Field Programmable Gate Array (FPGA) chipset. In addition, a multiplex serial communication protocol based on RS-232 protocol was proposed to complete the communication. The logic analytical tool SignalTapⅡ was used to capture the real-time signal of FPGA to verify the performance of the system. The results indicate that the system can control and manage a single camera or multiple cameras flexibly.

Performance of PCM/FM telemetry system based on multi-symbol detection and Turbo product code

WANG Li YUAN Fu XIANG Liangjun ZHENG Linhua

2013, 33(12):  3482-3485. 

Asbtract ( )   PDF (631KB) ( )  

Related Articles | Metrics

Multi-Symbol Detection (MSD) and Turbo Product Code (TPC) can greatly improve the performance of PCM/FM (Pulse Code Modulation/Frequency Modulation) telemetry system. To solve the high computational complexity issues in MSD algorithm, an improved algorithm which reduced the computational complexity of MSD was proposed. Chase decoding algorithm for TPC also reduced the system memories by simplifying the calculation of the soft input information. The simulation results show that despite of 1.7dB loss, the improved algorithm still obtains about 8dB performance gain. Because of low-complexity and low system memories, it is more suitable for hardware implementation.

Information security

Protocol state machine reverse method based on labeling state

HUANG Xiaoyan CHEN Xingyuan ZHU Ning TANG Huilin

2013, 33(12):  3486-3489. 

Asbtract ( )   PDF (813KB) ( )  

Related Articles | Metrics

Protocol state machine can describe the behavior of a protocol, which can help to understand the behavior logic of protocol. Oriented towards text protocols, a statistical method was firstly used to extract the semantic keyword of representative message type, and an adjacency matrix was used to describe the sequential relationship between the message types, based on which the protocol states were labeled and a state transition diagram was built. The experimental results show that the method can accurately describe the sequential relationship between the message types and abstract state machine model accurately.

Recommendation-based anti-attack trust model on E-commerce

DENG Pan ZHONG Jiang

2013, 33(12):  3490-3493. 

Asbtract ( )   PDF (742KB) ( )  

Related Articles | Metrics

A recommendation-based centralized trust model was proposed to deal with three kinds of common attacks including self-promoting attack, slandering attack and whitewashing attack. The model calculated the similarity of consumption custom between buyers and the timeliness of the buyers' evaluation opinions to determine the recommendation trust value, and obtained the direct trust value on the basis of the buyer's own trading experience. According to the direct and recommendation trust value, composite trust value could be calculated. Simulations were given by injecting the three kinds of attacks into real transaction data. The results prove that, compared with the existing reputation management models, the proposed model can effectively prevent attacks, and provides more accurate reputation information of sellers and goods to consumers.

Polymorphic worms signature extraction based on improved ant colony algorithm

HUANG Hui GUO Fan XU Shufang

2013, 33(12):  3494-3498. 

Asbtract ( )   PDF (786KB) ( )  

Related Articles | Metrics

Polymorphic worms signature extraction is a critical part of signature-based intrusion detection. Extracting precise signatures quickly plays an important role in preventing the spread of the worms. Since the classical Hierarchical Multi-Sequence Alignment (HMSA) algorithm has bad time performance in extracting signatures when multiple sequences alignment was used and the extracted signatures were not precise enough, a new automatic signature extraction method called antMSA was proposed based on the improved ant optimal algorithm. The search strategy of the ant group was improved, and then it was introduced to the Contiguous Matches Encouraging Needleman-Wunsch (CMENW) algorithm to get a better solution quickly in global range by using the rapid convergence ability of ant colony algorithm. The signature fragments were extracted and converted into the standard rules of the intrusion detection system for subsequent defense. The experimental results show that the new method solves the stagnation problem of the classical ant optimal algorithm, extends the search space, extracts signatures more efficiently and precisely, and reduces the false positive rate and the false negative rate.

Design of pseudorandom-number generator based on spatiotemporal chaos

TU Guangyou HE Bo

2013, 33(12):  3499-3502. 

Asbtract ( )   PDF (613KB) ( )  

Related Articles | Metrics

The spatiotemporal chaotic system has good cryptographic properties, while the efficiency of the existing pseudorandom number generators based on this model is low. A new scheme to generate pseudorandom numbers with high efficiency based on a spatiotemporal chaotic system was proposed. In the process of generating pseudorandom numbers, the time-consuming operations were replaced by some fast ones and the iteration of the spatiotemporal chaotic system was reduced as possible, which made the generator own faster speed. The cryptographic performance of the pseudorandom sequences generated by this scheme was tested. The results show that the proposed scheme not only owns fast running speed and good cryptographic properties, but also has good cryptographic properties.

Construction of almost optimal resilient Boolean functions via concatenation

YUAN Hongbo YANG Xiaoyuan

2013, 33(12):  3503-3505. 

Asbtract ( )   PDF (505KB) ( )  

Related Articles | Metrics

In recent years, research of almost optimal resilient Boolean functions develops rapidly, and it is important to improve the nonlinearity degree of almost optimal functions. Analysis and improvement of an almost optimal function with good performance was given, and an almost optimal function with even variables was constructed using concatenating construction method. A nonlinear optimal function with higher nonlinearity was got while maintaining its resilience and algebraic degree, which improved the performance of the function. And the construction method was also given to construct an elastic Boolean function with high nonlinearity. Analysis shows that the proposed construction method is simple and easy to implement, the nonlinearity is improved with m resilience and unchanged algebraic degree.

Network security situational awareness method of multi-period assessment

LI Chun ZHAO Jianbao SHEN Xiaoliu

2013, 33(12):  3506-3510. 

Asbtract ( )   PDF (819KB) ( )  

Related Articles | Metrics

After analyzing and comparing the existing security situation assessment methods, a network security situation assessment method was proposed based on time dimension, which focused on the necessity of using different methods for short-term and long-term assessment respectively. Based on the alarm information which came from security device such as firewall and Intrusion Detection Systems (IDS), the whole short-term situation was got according to the score of destination host. Combining the result of short-term assessment and static index, the weight of long-term assessment system was determined by entropy method. The proposed assessment method divides network security situation into short-term and long-term, and makes up for the lack of setting situation assessment boundaries in terms.

Reconciliation technology based on low density parity check code

ZHANG YanHuang GUO Dabo WANG Yunyan

2013, 33(12):  3511-3513. 

Asbtract ( )   PDF (448KB) ( )  

Related Articles | Metrics

Low Density Parity Check Code (LDPC) is a kind of (n, k) linear block codes. The conventional encoding method can complete the encoding work when the length of the codes is short, but as the codes become longer, the memory of computer is hard to bear when still using the common encoding methods. To solve this problem, two kinds of effective encoding and decoding schemes were proposed. Firstly, different from the traditional data parity bit decoding, the proposed data reconciliation scheme used side information and syndrome produced by the initial data to employ joint decoding. Secondly, the parity matrix was stored in a way that only the positions of 1 in the form of the cross circular list were recorded, which could greatly save memory space. At last, C implementation could improve effectiveness of the codes. Length of a block of codes in this experiment was 105. The Bit Error Ratio (BER) of codes was converged above 1.0dB, only in need of 4 seconds to decode one block, the code rate could reach 24.85kb/s when the decoder was converged. The results show that the proposed schemes have strong timeliness.

Leakage-resilient designated verifier signature scheme

HONG Xiaojing WANG Bin

2013, 33(12):  3514-3518. 

Asbtract ( )   PDF (764KB) ( )  

Related Articles | Metrics

Designated Verifier Signature (DVS) eliminates the publicly verifiable feature of traditional digital signature to prevent a verifier from proving to a third party the fact that a particular digital signature held by him is issued by a signer. Traditionally, security of digital signature schemes relies on the ideal assumption that an adversary has no access to the information of a secret key. However, side-channel attacks show that the physical implementation of a cryptographic algorithm will leak partial secret information to an adversary. Hence it is necessary to design a leakage-resilient designated verifier signature. Okamoto authentication scheme was converted into a designated verifier signature scheme by using the OR proof technique. Given the leakage bound, the security of the presented scheme was proved under the relative leakage model.

Blind verifiably encrypted signature scheme based on certificateless

LI Yanhong GAO Zhide FENG Wenwen

2013, 33(12):  3519-3521. 

Asbtract ( )   PDF (660KB) ( )  

Related Articles | Metrics

The fairness of verifiable encrypted signature scheme is completely determined by the arbitrators neutral problem, which reduces the security of signature exchange. In order to deal with this issue, using the properties of bilinear pairings and combining with certificateless public key cryptography and verifiable encrypted signature, a blind verifiable encrypted signature was designed without certificate. The adjudicator in this scheme cannot restore the original signature directly, thereby the security of exchange signature protocols was enhanced. The proposed scheme was also provably secure in the random oracle module under Discrete Logarithm Problem (DLP) and Computational Differ-Hellman Problem (CDHP) assumption.

Automatic evaluation scheme for imperceptibility of natural language watermarking

WU Ruifeng HE Lu FANG Dingyi

2013, 33(12):  3522-3526. 

Asbtract ( )   PDF (908KB) ( )  

Related Articles | Metrics

The deficiency of evaluation scheme for the imperceptibility of Natural Language Watermarking (NLW) seriously restricts the development in this field. To resolve this problem, combining the characteristics of natural language and the knowledge of psycholinguistics and considering the difficulty for human to understand natural language, an imperceptibility perceptual model and an automatic evaluation scheme were proposed. The proposed scheme evaluated the imperceptibility from three aspects: syntax error, collocation error and semantic loss. Finally, four different watermarking schemes including the T-Lex watermarking system based on absolute synonym substitution, the relative synonymous substitution watermarking system, the watermarking system based on syntactic tree and the Chinese syntactic watermarking system were used to compare the results of the proposed automatic method and manual method whose confidence coefficient is 90%. The two methods get the same conclusion: the imperceptibility of NLW based on word is better than that of NLW based on sentence, and the automatic evaluation scheme is effective for the imperceptibility of NLW.

Secure multiparty computation solutions of collection member decision

DOU Yongli WANG Haichun KANG Jian

2013, 33(12):  3527-3530. 

Asbtract ( )   PDF (629KB) ( )  

Related Articles | Metrics

The exchangeable key solutions and homomorphic encryption solutions were analyzed. Meanwhile, the deficiencies of these two solutions on the computational complexity were pointed out. On the basis of that, two new solutions were put forward: one was based on chaotic encryption solution, and the other was asymmetric encryption solution which introduced the incredible third party. The correctness, security and complexity of them were analyzed and verified. The comparison between the proposed solutions and the existing ones was given. The experimental results show that the new solutions can reduce the complexity of the algorithm, and greatly improve the execution efficiency of algorithm.

Fast geometric resistant video watermarking scheme for gateway copyright protection

LIU Hongbin DU Ling JI Hongli

2013, 33(12):  3531-3535. 

Asbtract ( )   PDF (799KB) ( )  

References | Related Articles | Metrics

To solve the problem of gateway copyright protection, a new fast approach was put forward for embedding and extracting gateway watermark in digital video. In intra frame watermarking, the method elegantly detected and selected affine covariant regions in nearly linear complexity. Then, the overlapped affine covariant regions were eliminated based on minimal spanning tree. Last, watermark bits were embedded in Discrete Wavelet Transform (DWT) coefficients in linear time. In inter frame watermarking, the method effectively utilized the continuity inside video scenes to predict the affine covariant regions in no-boundary frames based on boundary frame. The attacking experimental results show that under geometric attacks and format conversion attacks, the accuracies of watermark detection are above 93% and 83% respectively. The simulation results show that in local network with 400 online hosts, the proposed method can block gateway watermark video transmission within 10 frames.

Multimedia processing technology

Image inpainting algorithm based on double-cross curvature-driven diffusion model

ZHAI Donghai ZUO Wenjie DUAN Weixia YU Jiang LI Tongliang

2013, 33(12):  3536-3539. 

Asbtract ( )   PDF (672KB) ( )  

Related Articles | Metrics

Currently, various image inpainting algorithms based on Curvature-Driven Diffusion (CDD) model only make use of the reference information of four neighborhood pixels. Therefore, they cannot keep shape edges and their inpainting precisions high enough. To conquer these difficulties, the image inpainting algorithm based on double-cross CDD was presented, in which the reference information for damaged pixel was extended from four into eight neighborhood pixels. Firstly, one inpainting value for damaged pixel could obtain from the reference information of four neighborhood pixels using the original CDD algorithm. Secondly, another new inpainting value was computed with the newly introduced four neighborhood pixels. Finally, the final inpainting value was a weighted mean of the above-mentioned two inpainting computational value. The proposed method, original CDD algorithm and its improved editions were implemented and compared in the experiments. The experimental results show that the proposed algorithm can effectively improve the inpainting precision and keep shape edges without increasing time complexity.

Real-time video super-resolution restruction based on GPU acceleration

CHEN Xiangji HAN Guoqiang ZHANG Zhiyuan

2013, 33(12):  3540-3543. 

Asbtract ( )   PDF (650KB) ( )  

Related Articles | Metrics

The methods of image super-resolution via sparse representation achieve good quality image reconstruction, but the CPU-based implementation of the methods hardly satisfies the requirement of real-time video super-resolution because of high computational complexity. Then, the method of real-time video super-resolution via sparse representation based on GPU acceleration was proposed. It focused on optimizing data parallel processing and improving resource utilization of GPU, including utilizing queues for video sequences, improving memory concurrent access rates, employing Principal Component Analysis (PCA) dimensionality reduction and optimizing dictionary querying operation. As a result, compared with the CPU-based implementation, the speed of data processing is increased two orders of magnitude, and the speed of playing a video with the size of 669×546 reaches 33 frames per second.

Multi-region image reconstruction algorithm

WAN Jinliang YE Long

2013, 33(12):  3544-3547. 

Asbtract ( )   PDF (851KB) ( )  

Related Articles | Metrics

To achieve medium level visual region texture substitution in multi-regions contour curves, a multi-region image reconstruction algorithm was proposed. Firstly, the segmented region and index list of original image were extracted. Secondly, the polynomial coefficients representing region structure feature were got by piecewise iterative curve fitting and the smallest region texture sample was selected. Finally, the reconstructed region contour and synthesized region texture were used to achieve regional restoration. The proposed algorithm can be done successfully for images with massive textures. The experimental results show that it can reduce the amount of data required by image reconstruction and be applied to reconstruct the still background of image and video.

Corner detection algorithm using multi-channel odd Gabor gradient autocorrelation matrix

DENG Chao LI Huoxing WANG Zhiheng

2013, 33(12):  3548-3551. 

Asbtract ( )   PDF (782KB) ( )  

Related Articles | Metrics

A new corner detection algorithm based on the autocorrelation matrix of Multi-channel Odd Gabor grAdient (MOGA) was proposed to suppress the decrease of corner positioning accuracy caused by the smoothed edge. The input image was transformed by 8-channel odd Gabor filter, and then autocorrelation matrices were constructed for each pixel by Gabor gradient correlation of the pixel and its surrounding pixels. If the sum of the normalized eigenvalues of the pixel was local maxima, the pixel was labeled as a corner. Compared with the classical algorithms, such as Harris and Curvature Scale Space (CSS), the proposed algorithm increased the average rate of correct detection by 17.74%, and decreased the average rate of positioning error by 18.15%. The experimental results show that the proposed algorithm has very good detection performance, and gets higher corner detection rate and better corner positioning accuracy.

Fractal image coding method based on Fisher classification and space mapping

LIU Shuqun PAN Zhangrong

2013, 33(12):  3552-3554. 

Asbtract ( )   PDF (604KB) ( )  

Related Articles | Metrics

Concerning the poor matching performance of two-dimensional gray-scale transformation in Fisher classification algorithm, an improved space mapping gray-scale transformation method was proposed. It put position and brightness into the gray-scale transformation at the same time, and formatted linear mapping between three-dimensional curved surfaces. The method quantified the scaling coefficient firstly, then calculated and quantified the other coefficients of improved gray-scale transformation to improve the possibility of successful range-domain matching. The experimental results show that this method reduces the number of coding blocks, improves the compression ratio and shortens the encoding time, while the quality of decoded image does not get much influenced.

Lens distortion correction method based on collinear points

LIU Chao LI Xingfei GUO Jingbin TAN Wenbin

2013, 33(12):  3555-3558. 

Asbtract ( )   PDF (620KB) ( )  

Related Articles | Metrics

To carry out lens distortion correction of unknown camera parameters, a method calibrating distortion center first and distortion coefficient second was proposed. First, with target imaged at two different focal lengths, distortion center could be positioned using relative position relation of the same target points in two pictures; then according to the invariance of line perspective projection, distortion coefficient could be searched by variable step optimization method. The simulation experiment showed that the average error of distortion center was (0.2243,0.1636) pixel, and the distortion coefficient error was 0.28% when target point number was 25, the noise level was 0.2 pixel. Real image experiment shows that distortion center and distortion coefficient obtained by the proposed method can correct the image well. The method is easy to implement, the calibration of camera's internal and external parameters and the knowledge of line grid's world coordinates can be neglected.

Artifical intelligence

Microblog Events Detection and Tracking based on RIHDBSCAN using Cloud Framework

FENG Yong HAN Nan JIA Dongfeng

2013, 33(12):  3559-3562. 

Asbtract ( )   PDF (785KB) ( )  

Related Articles | Metrics

For the purpose of events extraction from large-scale short posts of microblogging service, a complete event detection and tracking algorithm was proposed using cloud framework. First, based on the number of forward and comment of the microblog, the posts were expressed as Vector Space Model (VSM). Then the keywords were extracted using RIHDBSCAN (Incremental Hierarchical DBSCAN based on Representative posts) to realize the event detection and tracking. Considering that a single node cannot quickly and efficiently handle the large amount of data, the algorithm would be deployed on Hadoop, a cloud computing platform. The experiment on real microblog data extracted from Sina microblogging platform shows that the proposed method achieves higher performance than that of TF-IDF (Term Frequency-Inverse Document Frequency) and UF-ITUF (User Frequency-Inverse Thread User Frequency), and the use of cloud framework improves the processing speed. Therefore, it is suitable for data analysis and mining on huge datasets.

Identification method of spam comments in microblog based on AdaBoost

HUANG Ling LI Xueming

2013, 33(12):  3563-3566. 

Asbtract ( )   PDF (623KB) ( )  

Related Articles | Metrics

In view of the existence of a lot of spam comments in microblog, a new method based on AdaBoost was proposed to identify spam comments. This method firstly extracted feature vectors which consisted of eight feature values to represent the comments, then trained several weak classifiers which were better than random prediction on these features via AdaBoost algorithm, and finally combined these weighted weak classifiers to build a strong classifier with a high precision. The experimental results on comment data sets extracted from the popular Sina microblogs indicate that the selected eight features are effective for the method, and it has a high recognition rate in the identification of spam comments in microblog.

Protein-protein interaction network clustering based on artificial immune system

WANG Chong LEi Xiujuan

2013, 33(12):  3567-3570. 

Asbtract ( )   PDF (647KB) ( )  

Related Articles | Metrics

A Protein-Protein Interaction (PPI) network clustering model and an algorithm based on the mechanism of the Artificial Immune System (AIS) were proposed to improve the identification accuracy. In this algorithm, the set of cluster centers was regarded as antigens and the neighbor nodes were regarded as antibodies. The antibodies were regarded as the memory cells of clusters by calculating the affinity between the antibodies and antigens. Then excellent antibodies were selected as vaccines, and they were injected into clustering modules to get update. Finally the memory cells were updated after comparing the fitness of the modules before injection. The simulation results on PPI datasets show that, compared with FLOW algorithm, the f-measure of precision and recall value of the new algorithm have got improved.

Artificial bee colony algorithm inspired by particle swarm optimization and differential evolution

LIN Jinhui CAO Zhong XU Dalin

2013, 33(12):  3571-3575. 

Asbtract ( )   PDF (724KB) ( )  

Related Articles | Metrics

Concerning the problem that Artificial Bee Colony (ABC) is good at exploring but lack of exploitation, two new solution search strategies named PSO-DE-PABC and PSO-DE-GABC were proposed based on Particle Swarm Optimization (PSO) and Differential Evolution (DE). PSO-DE-PABC generated new candidate position around the random particle to improve divergence. PSO-DE-GABC generated new candidate position around the global best solution to accelerate the convergence, and differential vectors were also used to increase the divergence. Besides, Dimension Factor (DF) was introduced to control the search rate of the algorithms. A new scout strategy considering current swarm state was used to replace the original random scout strategy to enhance the local search ability. Comparison with basic ABC, GABC (Gbest-guided ABC) and ABC/best algorithm was given on 10 groups of standard benchmark function. The results show that PSO-DE-GABC and PSO-DE-PABC have better convergence rate and accuracy.

Improved genetic algorithm for solving permutation flow shop scheduling problem

LI Xiaobin BAI Yan GENG Linxiao

2013, 33(12):  3576-3579. 

Asbtract ( )   PDF (600KB) ( )  

Related Articles | Metrics

In the existing genetic algorithms for permutation flow shop scheduling problem, the crossover and mutation operator is complex because of the processing sequence, the offspring is not similar to parent, and the algorithm easily falls into local optimum. To solve these problems, an improved genetic algorithm with priority-based value coding method and optimum limited operator was proposed. The coding method based on the priority values of the workpieces could avoid illegal coding, and the optimum limited operator could limit the propagation of the best individual to prevent falling into local optimum. The experiments show that this coding method is feasible and it can solve the practical problem when urgent workpieces must be processed firstly. The simulation results on benchmarks demonstrate that the proposed algorithm has superiority of smaller relative error and higher stable solution quality.

Advanced computing

Performance evaluation on open source cloud platform for high performance computing

LI` Chunyan ZHANG Xuejie

2013, 33(12):  3580-3585. 

Asbtract ( )   PDF (940KB) ( )  

Related Articles | Metrics

Cloud computing is a new model of the Internet resource utilization to provide a variety of IT services. It has been widely used in various fields, including High Performance Computing (HPC). However, its virtualization has caused some performance overhead. Meanwhile, there are some differences in virtualization technology of different cloud platforms, so the performance in implementing HPC is different among them. The performance and real workload evaluation of HPC of open source clouds platforms, including Nimbus, OpenNebula and OpenStack, were compared and analyzed by HPC Challenge (HPCC) benchmark suite and NAS Parallel Benchmark (NPB) from CPU, memory, communication, scalability and HPC, respectively. The experimental results show that OpenStack has better performance for computation-intensive high performance applications, thus it is a good selection for implementing HPC applications in open source cloud platform.

Energy-aware resource management mechanism for virtualized cloud datacenter

LI Xiaoliu ZHANG Xihuang

2013, 33(12):  3586-3590. 

Asbtract ( )   PDF (758KB) ( )  

Related Articles | Metrics

Concerning the management of the resources in cloud, an energy model and four Virtual Machine Placement (VMP) algorithms were proposed. Firstly, the algorithms calculated the load of the servers in each rack and classified them according to the thresholds. Then the proposed methods selected appropriate virtual machines from servers to migrate using the minimization of migrations policy and accepted the new coming virtual machine allocation requests. At last, the algorithms matched each virtual machine with the servers and found the best server for placement. The experimental results show that, compared with the existing energy-aware resource management algorithm, the proposed technique improves energy efficiency of servers, network equipment, and cooling systems by 2.4%, 18.5%, and 28.1% respectively, resulting in a total of 14.5% improvement on average in the entire datacenter.

Iteration MapReduce framework for evolution algorithm

JIN Weijian WANG Chunzhi

2013, 33(12):  3591-3595. 

Asbtract ( )   PDF (806KB) ( )  

Related Articles | Metrics

Modular programming of MapReduce greatly simplifies the implementation difficulty of distributed programming; however, its application scope is limited. In view of that MapReduce cannot be used to solve iteration algorithm, a new iteration MapReduce framework was proposed for evolutionary algorithm based on the study of MapReduce framework. The basic structure of the MapReduce was introduced, and the defects in implementing iteration algorithm were pointed out. The realization requirements and implementation of the proposed MapReduce framework were introduced, and the feasibility of abnormal mechanism was proposed and verified. At last, the new MapReduce framework was verified on Hadoop. The experimental results show that the parallel genetic algorithm based on the iteration MapReduce framework has higher speedup than that of MapReduce framework.

Typical applications

Path planning for multiple unmanned combat aerial vehicles based on improved artificial bee colony algorithm

CAO Lu JIA Yinping ZHANG An

2013, 33(12):  3596-3599. 

Asbtract ( )   PDF (775KB) ( )  

Related Articles | Metrics

Due to the complex constraints, many uncertain factors and critical real-time demand of path planning for multiple Unmanned Combat Aerial Vehicle (multi-UCAV), an Improved Artificial Bee Colony (I-ABC) algorithm was proposed to solve the model of path planning for multi-UCAV. First, the Voronoi diagram of battle field space was conceived to generate the optimal area of UCAV's paths. Then the chaotic searching algorithm was used to initialize the collection of paths, which was regarded as foods of ABC algorithm. With the limited data, the initial collection could search the optimal area of paths perfectly. Finally simulations of the multi-UCAV path planning under various threats were carried out. The simulation results verify that I-ABC can improve the diversity of nectar source and the convergence rate of algorithm, and it can increase the adaptability of dynamic battlefield and unexpected threats for UCAV.

Precise train stopping method based on predictive control

WU Peng WANG Qinyuan LIANG Zhicheng WU Jie

2013, 33(12):  3600-3603. 

Asbtract ( )   PDF (545KB) ( )  

Related Articles | Metrics

Precise train stopping is a key technology of automatic train operation. On the basis of analyzing the train stopping phase, the delay characteristics of brake model and constraint conditions of train characteristics were considered, using generalized predictive control theory, a multi-objective predictive controller with constraints was designed taking account of train speed and distance as control targets and combining the control constraint conditions. The simulation results show that the proposed controller can accurately track the train stopping curve to achieve high precision stopping requirements and higher comfort.

Embedded motion controller design based on RTEX network

LIN Shiyao WU Chongyang LI Ruifeng

2013, 33(12):  3604-3607. 

Asbtract ( )   PDF (661KB) ( )  

Related Articles | Metrics

Adopting embedded framework and network communication mode, a kind of multi-axis embedded motion controller hardware platform design for Panasonic A5N drive was proposed, which was based on the modular control core (ARM + FPGA) and could adapt to the new real-time network communication named RTEX. It was transplanted in μC/OS-Ⅱ. The processes of controller's functional design, hardware design and software design were explained in detail. Up to now, the motion controller's hardware platform had been completed and verified by communication experiments and position and velocity control experiments based on SCARA robot. The experimental results show that the controller has good communication function and stable performance, and can well accomplish the functions of servo control.

Application of geometric moving average martingale algorithm in anomaly analysis before earthquake based on sliding window

CHEN Liping KONG Xiangzeng ZHEN Zhi LIN Xinqi ZHAN Xiaoshan

2013, 33(12):  3608-3610. 

Asbtract ( )   PDF (506KB) ( )  

References | Related Articles | Metrics

There are various abnormal phenomena before the earthquake, and how to effectively extract exception information before the earthquake is a very important research topic. The geometric moving average martingale algorithm based on sliding window was proposed to extract the anomaly features before earthquake. The seismic data were processed by geometric moving average martingale and sliding window feature extraction, and the anomaly features of earthquake could be effectively extracted before earthquake. Through the analysis of the NOAA (National Oceanic and Atmospheric Administration satellite outgoing long wave radiation information before the Wenchuan earthquake and Lushan earthquake, the experiments show that the algorithm can detect that the earthquake area is more obviously abnormal than the surrounding area. This anomaly can help researchers determine earthquake area before the earthquake.