Current Issue

25 April 2015, Volume 36 Issue 4

Previous Issue    Next Issue

academic paper

Based on improved malthusian model microblogging topic trend forecast

Yan-xiang HE,Jian-bo LIU,Nan LIU,Min PENG,Qiang CHEN,Jing HE

2015, 36(4):  1-8.  doi:10.11959/j.issn.1000-436x.2015094

Asbtract ( 375 )   HTML ( 3)   PDF (842KB) ( 994 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Although trend forecasting problem is the research focus of social computing，yet the topic trend forecast of micro logging platform is still at the exploratory stage.Based on the analyzing，extracting and defining the influencing factors of the trends of event，the improved Malthus model，which is more applicable to solve microblogging topic trend forecast problem is presented.Then the model is mapped to the neural network，and the genetic algorithms are used to predict the trend of events.Experiments show that this method can predict the trend of long-term events in the social network with good results，and can predict the outbreak point and posting volume effectively.It is worth nothing that the method is also suitable for small sample forecasting problems.

Local congestion control algorithm with fair channel allocation

Geng-ming ZHU,Zhi-qiang WANG,Zhe-tao LI,Ren-fa LI

2015, 36(4):  9-18.  doi:10.11959/j.issn.1000-436x.2015169

Asbtract ( 448 )   HTML ( 5)   PDF (1979KB) ( 1076 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A local congestion control algorithm with fair channel allocation (FCA) was presented to mitigate local congestion as well as to improve the fairness of channel utilization.In order to decrease the extra communication overhead for obtaining the real-time buffer length of neighbors and improve the accuracy of congestion detection model based on buffer occupancy of single node，FCA presented a new model considers the total buffer length of neighbors with predict-based mechanism for real-time buffer occupancy and the average transmission time of packet.To avoid deteriorating congestion with an explicit notified package，FCA embedded an additional node address to the ACK control frame to carry congestion information.During the congestion alleviation stage，FCA presented a fair channel allocation mechanism based on real-time buffer occupancy and queue priority to prevent some nodes from overflowing resulting in package loss due to the growth of buffer fast.Simulation results show that the proposed protocol has comparative advantages compare with 802.11，CODA and PCCP in terms of collision，package delivery ratio，throughput and fairness.

Two-level feature selection method based on SVM for intrusion detection

Xiao-nian WU,Xiao-jin PENG,Yu-yang YANG,Kun FANG

2015, 36(4):  19-26.  doi:10.11959/j.issn.1000-436x.2015127

Asbtract ( 424 )   HTML ( 13)   PDF (492KB) ( 1424 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To select optimized features for intrusion detection，a two-level feature selection method based on support vector machine was proposed.This method set an evaluation index named feature evaluation value for feature selection，which was the ratio of the detection rate and false alarm rate.Firstly，this method filtrated noise and irrelevant features to reduce the feature dimension respectively by Fisher score and information gain in the filtration mode.Then，a crossing feature subset was obtained based on the above two filtered feature sets.And combining support vector machine，the sequential backward selection algorithm in the wrapper mode was used to select the optimal feature subset from the crossing feature subset.The simulation test results show that，the better classification performance is obtained according to the selected optimal feature subset，and the modeling time and testing time of the system are reduced effectively.

Improved spectral clustering algorithm and its application in MCI detection

Jie XIANG,Dong-qin ZHAO

2015, 36(4):  27-34.  doi:10.11959/j.issn.1000-436x.2015181

Asbtract ( 369 )   HTML ( 8)   PDF (809KB) ( 819 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to detect mild cognitive impairment (MCI) using functional magnetic resonance imaging (fMRI)，a method based on fMRI clustering was proposed fMRI data were clustered to obtain the blood oxygen level dependence( BOLD) change model of MCI patients，then abnormal patterns were used to detect disease.The traditional spectral clustering algorithm needs to calculate all of the eigenvalue and eigenvector，so time and space complexity is higher.An improved spectral clustering method was proposed which modified the similar matrix construction method and the setting method of σ and k，and then this method was applied to clustering and detection of MCI patients.To verify the performance of the proposed method，the comparison of the clustering result，classification accuracy using traditional algorithm and Nystr?m is also done.The comparative experimental results show that the proposed method can get BOLD pattern more accurately，the accuracy of MCI detection is higher than the other two algorithms，and the time and space complexity are less than the traditional algorithm.

Bypass node non-redundant adding algorithm for crossing-level data transmission in two-dimension reconfigurable cell array

Nai-jin CHEN,Zhi-yong FENG,Jian-hui JIANG

2015, 36(4):  35-51.  doi:10.11959/j.issn.1000-436x.2015132

Asbtract ( 357 )   HTML ( 1)   PDF (1689KB) ( 598 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

As for the problem of hardware task crossing-level data transmission，a preorder traversing backtracking adding_bypass_node (PTBA) algorithm is presented which maintains logic relation among original computing nodes and does not add redundancy nodes based on data flow graph with crossing-level-in-tree(CLIT) and crossing-level-out-tree (CLOT).The pipelined model of partitioning mapping and the quantitative evaluation indexes are presented for the dynamic reconfigurable system.The critical condition of PTBA mapping is proposed.Compared with preorder traversing backtracking no adding_bypass_node (PTBNA) mapping，and under the premise of critical condition，experimental results show PTBA mapping can improve the number of modules，the number of non-original input times and non-original output times，the total execution delay and powers of all partitioning based on the same system architecture and partitioning mapping algorithm.The proposed algorithm obtains the less average execution total cycles by 23.3%(RCA_5×5)，30.5%(RCA_8×8)，and the less average power consumption by 15.7%(RCA_5×5)，18.6%(RCA_8×8) than previous advanced split-push kernel mapping(SPKM).PTBA has rationality and effectiveness.

Adaptive co-site interference cancellation algorithm with multiple virtual references

Yue-lei XIE,Jie LIU,Min-zheng LI,Shan OUYANG,Gui-sheng LIAO

2015, 36(4):  52-57.  doi:10.11959/j.issn.1000-436x.2015122

Asbtract ( 372 )   HTML ( 8)   PDF (989KB) ( 915 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Wireless radio communication is usually deteriorated by co-site interferences produced by collocated transmitters.A two-stage adaptive filter with multiple virtual references that drew from over sampled receiving signal is proposed to cancel the co-site interferences.Co-site interferences can be cancelled and the desired signal can be recovered by adjusting the weights of the first filter when pure interferences are received and adjusting the weights of the second filter when the desired signal is consisted in received signals.The simulation results show that the proposed adaptive co-site interferences cancellation algorithm without the coupling device can achieve better performance than traditional algorithms.

Route optimization scheme for nested mobile networks based on extending neighbor discovery protocol

Xing YIN,Guo-xin WU,Yong-qiang DONG,San-feng ZHANG

2015, 36(4):  58-69.  doi:10.11959/j.issn.1000-436x.2015179

Asbtract ( 348 )   HTML ( 4)   PDF (1223KB) ( 846 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Nested mobile networks face the challenge of route optimization (RO) even it can expend the scope of communications.The existing RO approaches have the limitation of low performance and difficulty of deployment.A nested mobile networks route optimization (NMNRO) scheme is proposed by extending the neighbor discovery protocol，in which foreign prefixes in nested networks are advertised，and the destination caches of access routers and the routing tables of mobile routers are updated accordingly.After that，a correspondent registration is performed in order to implement RO.Performance analysis shows that NMNRO provides an overall RO solution with lower overhead，better compatibility，and higher deployability.Simulation results demonstrate that NMNRO has lower handover delay and higher goodput than other schemes，and the performance advantage appears more significant with the increase of nesting level.

Adaptive node scheduling algorithm for target tracking in wireless sensor networks

Xu LU,Liang-lun CHENG,Shi-liang LUO

2015, 36(4):  70-80.  doi:10.11959/j.issn.1000-436x.2015113

Asbtract ( 418 )   HTML ( 10)   PDF (1214KB) ( 752 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An efficient node scheduling algorithm can significantly improve both the perceived ability and the energy efficiency for wireless sensor networks.Based on the model analysis of network node power consumption，an energy-efficient adaptive node scheduling algorithm for target tracking (ANSTT) is proposed for wireless sensor network.The algorithm automatically adjusts the working mode of sensor nodes according to the perceived ability on moving target and the relative remaining energy level (RREL) of nodes.Experiment results show that the proposed ANSTT algorithm effectively reduces system energy consumption and prolongs network lifetime while maintaining low detection delay and high target perceived rate.

Virtual network embedding approach to survive multiple node failures

Ai-ling XIAO,Ying WANG,Luo-ming MENG,Xue-song QIU,Wen-jing LI

2015, 36(4):  81-88.  doi:10.11959/j.issn.1000-436x.2015141

Asbtract ( 366 )   HTML ( 6)   PDF (1161KB) ( 721 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Considering the survivability of virtual networks in a network virtualization environment，a virtual network embedding approach was proposed to survive multiple node failures.It de backups proportionally in the substrate network and constructed a candidate set for each substrate node beforehand.To increase the long term business profit，it chosen the failover targets in the candidate set and dynamically allocates backups to recover the affected virtual networks after substrate node failures.The validity of this method is assessed by simulation experiments in terms of applicability，stability and performance under a multiple node failures model.

Load balancing multicast routing based on network coding in wireless mesh network

Xiao-jian SHEN,Zhi-gang CHEN,Li LIU

2015, 36(4):  90-95.  doi:10.11959/j.issn.1000-436x.2015134

Asbtract ( 340 )   HTML ( 6)   PDF (540KB) ( 691 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A new load balancing routing measure CRM-LB based on network coding was presented，the CRM-LB increased the considerations of traffic concentration level congestion level all nodes on the path p based on CRM.Wireless mesh network multicast routing CLR based on the CRM-LB was put forward.The protocol can increase network coding opportunities considering the load balancing in network.The performance analysis and simulation results show that the protocol，under the premise of improving multicast throughput，not only to support network coding better，and achieve load balancing in network.

Privacy preserving approach based on proximity privacy for numerical sensitive attributes

Jing XIE,Jian-pei ZHANG,Jing YANG,Bing ZHANG

2015, 36(4):  97-104.  doi:10.11959/j.issn.1000-436x.2015093

Asbtract ( 326 )   HTML ( 7)   PDF (1202KB) ( 674 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A model based on proximity breach for numerical sensitive attributes is proposed.At first，it divides numerical sensitive value into several intervals on the premise of protecting the internal relations between quasi-identifier attributes and numerical sensitive attributes.Secondly，it proposes a (k，ε)-proximity privacy preserving principle to defense proximity privacy.In the end，a maximal neighborhood first algorithm (MNF) is designed to realize the (k，ε)-proximity.The experiment results show that the proposed model can preserve privacy of sensitive data well meanwhile it can also keep a high data utility and protect the internal relations.

Spatial spectrum based blind spectrum sensing for multi-antenna cognitive radio system

Chang LIU,SajjadAli Syed,Rui ZHANG,Si-ying LI,Jie WANG,Ming-lu JIN

2015, 36(4):  115-124.  doi:10.11959/j.issn.1000-436x.2015087

Asbtract ( 422 )   HTML ( 6)   PDF (1507KB) ( 956 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

State-of-the-art sensing methods only exploit three dimensions of the spectrum space:frequency，time and space whereas the angle dimension has not been exploited well enough for opportunistic spectrum access.Motivated by this，the authors apply angle of arrival (AOA) estimation algorithm to spectrum sensing and propose two blind spectrum sensing methods based on spatial spectrum.First is based on the ratio of maximum to minimum delay-sum spatial spectrum; the other is based on the ratio of average to minimum delay-sum spatial spectrum.Taking the advantage of spatial matched filtering，the proposed methods can achieve high probability of detection as well as offer the AOA information for spectrum access，which improve the spectrum efficiency.In addition，utilizing latest random matrix theories (RMT)，this work quantifies the detection threshold and derives the probabilities of detection for the proposed methods in theory.Extensive simulations carried out in Nakagami-m fading channel indicate that the proposed methods outperform the existing blind spectrum sensing methods.

Research of LBS privacy preserving based on sensitive location diversity

Chang-li ZHOU,Chun-guang MA,Song-tao YANG

2015, 36(4):  126-136.  doi:10.11959/j.issn.1000-436x.2015160

Asbtract ( 406 )   HTML ( 10)   PDF (2652KB) ( 910 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Before getting location-based query service，constructing a cloaking region or picking an anchor which is still in a sensitive area is vulnerable to lead location privacy exposure.An algorithm of selecting anchor is proposed based on sensitive location diversity.By defining sensitive locations and filtering different ones according to users’ visiting number and peak time，locations with similar features are chosen to construct a diversity zone，and the centroid of the zone is chosen as an anchor that raises location diversity.Referring to SpaceTwist，a query algorithm (HINN) is proposed to get places of interest (PoI)，and query results can be inferred without providing any user’s actual location.The defect in SpaceTwist that PoIs are found around the anchor is modified，which improves querying accuracy.The experiments show that users’ location privacy is protected well when the user is staying at a sensitive place，and the method has good working performances.

Effective fault localization technique using parameter-value replacement

Xing-ya WANG,Shu-juan JIANG,Xiao-lin JU,He-ling CAO

2015, 36(4):  138-145.  doi:10.11959/j.issn.1000-436x.2015095

Asbtract ( 342 )   HTML ( 4)   PDF (545KB) ( 659 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Statistic-based fault localization and slice-based fault localization cannot locate the omission faults effectively.A method-level fault localization approach based on parameter-value replacement was proposed.Those methods appearing in failed executions were treated as the fault methods candidate set (FMCS).For each element contained in FMCS，its impact to the execution result was measured and then the FMCS elements based on the impact were classified.For each method with high impact，its interesting parameter value mapping pair (IPVMP) was searched by using parameter-value replacement.According to the impact and IPVMP，a method list of FMCS elements was finally provided to debuggers.Empirical results show that the proposed approach performs better than other fault localization approaches.

Block ciphers identification scheme based on the distribution character of randomness test values of ciphertext

Yang WU,Tao WANG,Meng XING,Jin-dong LI

2015, 36(4):  147-155.  doi:10.11959/j.issn.1000-436x.2015107

Asbtract ( 623 )   HTML ( 18)   PDF (1435KB) ( 1527 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

By researching deficiency of current encryption algorithms identification schemes，a block ciphers identification scheme is proposed based on the distribution character of randomness test values for ciphertext.Firstly，the numbers of randomness test values for AES，Camellia，DES，3DES，SMS4 are respectively calculated based on the frequency test，frequency test in block，run test and originally clustered by the k-means algorithm.Secondly，in order to identify the block ciphers in each clustering，the dimensions of eigenvectors to the frequency test，frequency test in block，run test are calculated on the principle of reducing the comparability between eigenvectors.Eventually，the experimental results of AES，Camellia，DES，3DES，SMS4 demonstrate that the proposed scheme effectively identified the above representative block ciphers，and the correlative research can promote the further encryption algorithms identification research.

Single-channel blind separation of co-frequency modulated signals based on Gibbs sampler

Yong YANG,Dong-ling ZHANG,Hua PENG,Shi-long TU

2015, 36(4):  157-162.  doi:10.11959/j.issn.1000-436x.2015090

Asbtract ( 396 )   HTML ( 8)   PDF (1380KB) ( 964 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A Gibbs-sampler-based separation algorithm was proposed for single-channel co-frequency digital-modulated signals，which were received in non-cooperative ways.The probability density samples of unknown symbol sequences can be obtained by statistic method，and the computation complexity was not growing exponentially with the increase of channel order.With special emphasis on the separation algorithms of single pair of symbols，multiple pair of symbols and the tracking of channel responses.Moreover，the separation performance between Gibbs sampler and per-survivor processing(PSP) algorithm were analyzed and compared in detail.Simulation results show that，compared with PSP algorithm with L=4 for two co-frequency QPSK-modulated signals，Gibbs sampler can be nearly 17 times lower in computation complexity when the approximately performance is obtained.

Academic communication

Companding transform technique combined with iterative filtering for reducing PAPR of OFDM signals

Chao YANG,Yong WANG,Jian-hua GE

2015, 36(4):  164-169.  doi:10.11959/j.issn.1000-436x.2015091

Asbtract ( 527 )   HTML ( 4)   PDF (759KB) ( 812 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Considering the drawbacks of the traditional companding transforms，an efficient companding scheme combined with iterative filtering was proposed to reduce the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals.By introducing a joint optimization approach for PAPR and bit error rate (BER) performances along with remaining an unchanged average output power level，the scheme could achieve significant reduction in PAPR as well as an improved BER simultaneously.Moreover，by adaptively adjusting the transform parameters in the iterative process，more design flexibility in companding form and lower out-of-band radiation could also be given to satisfy various system requirements.The proposed scheme had a simple functional form and less computational complexity.The theoretical results regarding the transform gain and impact of companding distortion were derived.Simulation results show that this scheme can substantially offer better overall performances in terms of PAPR reduction，BER performance and bandwidth efficiency.

Modified SLM algorithm based on cyclic shift and signal combination in MIMO-OFDM system

Wu-jun HU,Lin YANG

2015, 36(4):  171-177.  doi:10.11959/j.issn.1000-436x.2015088

Asbtract ( 381 )   HTML ( 12)   PDF (724KB) ( 683 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to reduce the computational complexity of conventional selective mapping (SLM) algorithm in multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM) system，more candidate sequence sets will be produced.With different peak to average power ratio (PAPR) by time domain cyclic shift and signal combination between the antennas.The receiving part can restore the rotation signals by using the sequence selection order of the transmitting part and also the original signals by comparing the inversed rotation sequence with its nearest constellation points.The simulation results show that the proposed method can effectively reduce the PAPR of OFDM signals.In addition，compared with the conventional SLM algorithm，the proposed method can reduce the algorithm computation complexity significantly and obtain similar bit error rate (BER) performance.

Improved method for local image feature region description

Ren-huan ZHU,Qing-wei GAO,Yi-xiang LU,Dong SUN

2015, 36(4):  179-184.  doi:10.11959/j.issn.1000-436x.2015089

Asbtract ( 343 )   HTML ( 6)   PDF (1847KB) ( 698 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A robust method for local image feature region description was proposed based on the problem of contradiction between performance and dimension of descriptor.First，the local feature region was divided into several subregions according to their intensity order.Then，the method of segmented local feature description based on threshold was used to compute the descriptor，and the method of the weighted texture spectrum was used to cumulate the local descriptor.At last，concatenate the descriptors of every subregion together to get the final descriptor of the interest region.This method combined overall information and local information together，and robust to noise when ensure the dimension of descriptor was small.The experimental results show that the proposed descriptor is not only invariant to monotonic intensity changes and image rotation but also robust to many other geometric and photometric transformations.

Certificateless signature scheme without random oracles

Yan-qiong LI,Ji-guo LI,Yi-chen ZHANG

2015, 36(4):  186-194.  doi:10.11959/j.issn.1000-436x.2015098

Asbtract ( 364 )   HTML ( 13)   PDF (2479KB) ( 857 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The security of certificateless signature schemes can be proved under the random oracle model.However，any implementation of the random oracle may result in insecure schemes.Some certificateless signature schemes without random oracles are not secure against key replacement attack.In order to solve this problem，a new certificateless signature scheme in the standard model had constructed.Based on the NGBDH and Many-DH assumption，the scheme was proved secure against existentially unforgeable under adaptive chosen message attack.In addition，the proposed scheme enjoys less computation cost and lower communication bandwidth and can resist against key replacement attack.