Current Issue

26 February 2016, Volume 37 Issue 2

Previous Issue    Next Issue

academic paper

Trusted cloud platform management model based onTPMalliance

Jun-feng TIAN,Fang-shu CHANG

2016, 37(2):  1-10.  doi:10.11959/j.issn.1000-436x.2016025

Asbtract ( 546 )   HTML ( 10)   PDF (423KB) ( 887 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

On the basis of trusted computing technology, trusted cloud platform architecture and management model based on theTPMalliance was proposed to solve the performance bottleneck of dynamic management of trusted nodes in the building process of trusted cloud platform. MacroTPMproposed to solve the capability limitation of TPM,the concept of time-based tree was introduced to organizeTPMalliance, addressing the problem of high time cost of nodes management in trusted cloud. It usedTPMand authentication encryption technology to solve trusted transmission problem of data among nodes inTPMalliance, and a management strategy of time-based treeTPMalliance was proposed, including node configuration protocol, node registration protocol, node logout protocol, node state real-time monitor protocol, trusted nodes management network repair protocol, node update protoc explains the production algorithm of time-based tree, analyses the effectiveness of the time cost of building trusted node management network and monitoring of node state. The simulation result indicates that the model is efficient, and the time cost in trusted node management can be reduced.

Vector semantic computing method study for short sentence

Fu CHEN,Chuang LIN,Chao XUE,Yue-mei XU,Kun MENG,Yi-han NI

2016, 37(2):  11-19.  doi:10.11959/j.issn.1000-436x.2016018

Asbtract ( 499 )   HTML ( 8)   PDF (343KB) ( 1145 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A vector semantic computing method study for short sentence based on artificial neural network was proposed. And a semantic computational algorithm for social network texts as well as a discovery algorithm for mergencies was provided with reference to the information provided by the social nodes itself and the semantic of the text. Through the numerization of text, the calculation and comparison of semantic distance, the classification of nodes and the discovery of community can be realized. Then, huge quantities of Sina Weibo contents are collected to verify the model and algorithm put forward. In the end, outlooks for future jobs are provided.

Determining substitutability of cloud services supported by semantically extended type theory

Xian-qing WANG,Chang-qin HUANG,UOXuan LUO,Rui-hua NIE,Yong TANG,Xiao-yong MEI

2016, 37(2):  20-31.  doi:10.11959/j.issn.1000-436x.2016026

Asbtract ( 371 )   HTML ( 4)   PDF (498KB) ( 812 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In cloud environments, the high dynamics and more service failures were great obstacles to cloud applications, service substitution was a key research issue and also was a main solution to these challenges. A method of determining substitutability of cloud services was proposed using type theory, in which session types were semantically extended for modeling the behaviors of cloud service, QoS such as price, reliabil ty were introduced as QoS type, and a series of subtyping rules were constructed for SST and QoST. After that, determining consistency and context compatibility of services were put into practice. The method was proved feasibly by a case determining, and the experimental results show that it brings higher success rate of execution.

Self-adaptive price adjustment strategy based on market mechanism in distributed environment

Chang-song DING,Zhi-ying WANG,Zhi-gang HU

2016, 37(2):  32-38.  doi:10.11959/j.issn.1000-436x.2016027

Asbtract ( 371 )   HTML ( 5)   PDF (253KB) ( 732 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To solve the resource pricing problem of the collision among resource utilization, price and benefits in distributed computing environments, a self-adaptive pricing strategy of resource services based on market mechanism was proposed. On the premise of the local resource benefits, this adaptive pricing strategy guaranteed the resource to self-adapt the price dynamically so as to balance the collision between the assigned tasks on the resource node and the benefits of the resource provider. The theoretical ana is proved the effectiveness of the pricing strategy, and the algorithm of the pricing strategy was designed. Resources information in the real distributed systems was used as the performance parameters of experimental node in the sim lation experiments, and the performance of the adaptive pricing strategy was tested in a large-scale grid mission. Experimental results show that, compared with the traditional pricing strategies, the adaptive pricing strategy based on market mechanism has vastly superior performance on the resource benefits and the balance of resource utilization.

Blind signature scheme based on entangled quantum

Jian-wu LIANG,Xiao-hui WANG,Ying GUO,Zi CHENG

2016, 37(2):  39-43.  doi:10.11959/j.issn.1000-436x.2016028

Asbtract ( 464 )   HTML ( 10)   PDF (180KB) ( 716 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Based on the principle of quantum entanglement swapping, a blind signature scheme based on quantum entanglement was proposed.Through being entangled and exchanged, particles prepared before could transform into entangled state. The measurements of new entangled particles complete signature and verification and realize the quantum communication, blind signature and verification. Different from the classical blind signatures which based on the mathematics difficulty, the scheme could guarantee not only the anonymity but also the unconditionally security.

Weighted symbol-flipping decoding for non-binary LDPC codes based on average probability and stopping criterion

Rui GUO,Chun-yu LIU,Mei-jie WANG,Peng PAN,Jian-rong BAO,Chun-sheng GUO

2016, 37(2):  44-53.  doi:10.11959/j.issn.1000-436x.2016029

Asbtract ( 501 )   HTML ( 5)   PDF (392KB) ( 667 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to improve the decoding performance and reduce the decoding complexity of weighted symbols flipping decoding algorithm for nonbinary low density parity-check(LDPC)code, a weighted symbols flipping decoding for nonbinary LDPC codes based on average probability and stopping criterion was proposed. The algorithm puts the average probability of all the information nodes adjacent to the check node as weights to make the flipping-function more effectively and improve the efficiency of the flipping-symbols, and then improves the decoding performance. At the same time, the algorithm adds a stopping criterion controlling decoding iterations to further improve the decoding speed. Simulation results show that compared to WSF algorithm, NSCWSF algorithm(Osc=10)and NSCWSF algorithm(Osc=6), the new algorithm proposed(O =10)is gotten about 0.68dB, 0.83dBand 0.96dBgain at the symbol error rate of 10^-5in thesc presence of additive white Gaussian noise(AWGN), meanwhile, the average number of decoding iterations is also reduced by 78.60%～79.32%, 74.89%～75.95% and 67.2%～70.8%, respectively.

Novel reversible data hiding based on difference expansion

Jian-gao LUO,Guo-qiang HAN,Yan WO

2016, 37(2):  54-63.  doi:10.11959/j.issn.1000-436x.2016030

Asbtract ( 493 )   HTML ( 7)   PDF (391KB) ( 468 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A novel reversible data hiding algorithm based on difference expansion called ACD was proposed, which used the so-called adaptive change direction technology. ACD embeds data by expanding the differences of neighboring pixel values. In a pair of pixels, a pixel was for reference and the other was for transform. ACD first estimates the type of the pixels area, then chooses transform pixels by the type that it chooses the large value pixel in dark areas and the small value pixel in bright areas, or else selects the pixels by default direction. Theoretical analysis and experimental results show that ACD solves the problem of gray overflow increased dramatically in the reversible data hiding based on prediction error expansion (PEE)when the carrier is very dark or bright. Compared with the PEE with the existing gray overflow solution, ACD is suitable for wider types of carrier and has more stable performance.

Power allocation in wireless network virtualization based on resource sharing

Bin CAO,Wen-qiang LANG,Zhuo CHEN,Yun LI

2016, 37(2):  64-72.  doi:10.11959/j.issn.1000-436x.2016031

Asbtract ( 486 )   HTML ( 9)   PDF (347KB) ( 708 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In traditional wireless network, resource couldn’t be efficiently and flexibly. To this end, wireless network virtualization was used to manage and share resource. A game theory based two steps power allocation scheme for wireless network virtualization, called G2SPA, was proposed, which designed a stackelberg equilibrium (SE)price strategy based on the interactions between SP and mobile user equipme (MUE), and then MacAfee based auction to reallocate leisure resource was performed. The numerous experimental simulation results show that the rightness and effectiveness of G2SPA.

Dynamic topology awareness-based reconfigurable service carrying network reconfiguration

Ning-ning LIANG,Ju-long LAN,Zhen ZHANG

2016, 37(2):  73-80.  doi:10.11959/j.issn.1000-436x.2016032

Asbtract ( 356 )   HTML ( 3)   PDF (286KB) ( 687 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Reconfigurable information communication basal network supports self-adaptive services to applications by constructing reconfigurable service carrying network(RSCN). To effectively utilize the limited substrate network resources, an algorithm of dynamic topology awareness-based RSCN reconfiguration (DTAR)was proposed. The algorithm uses the number of shortest paths as resource critical degree which across the node or link to distinguish substrate resource. And it also dynamically awares the states of critical resources, reoptimises the RSCN according to service request. Experimental results show that comparing with the existing algorithms, the sed algorithm achieves higher success ratio, gains higher revenue, cost ratio and load equilibrium for substrate network.

Image information measurement for video retrieval

Qing-sheng YUAN,Dong-ming ZHANG,Guo-qing JIN,Fei LIU,Xiu-guo BAO

2016, 37(2):  81-88.  doi:10.11959/j.issn.1000-436x.2016033

Asbtract ( 420 )   HTML ( 9)   PDF (291KB) ( 1208 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To meet the speed and performance requirements, Sub-region entropy based image information measurement (SEII)method was proposed, which integrates the salie region detection, region division and features fusion. And, performance evaluation method was designed and many experiments were carried out, proving SEII coordinates with human vision evaluation.Also,SEII is evaluated in a real video retrieval system,which shows increase about 4.4% of mAP with 1.5 times speedup.

Approach to detecting SQL injection behaviors in network environment

Yu-fei ZHAO,Gang XIONG,Long-tao HE,Zhou-jun LI

2016, 37(2):  89-98.  doi:10.11959/j.issn.1000-436x.2016034

Asbtract ( 717 )   HTML ( 33)   PDF (304KB) ( 607 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

SQL injection attack is one of the main threats that many Web applications faced with. The traditional detection method depended on the clients or servers. Firstly the process of SQL injection attack was analyzed, and then the differences between attack traffic and normal traffic HTTP request length, HTTP connections and feature string were discovered. Based on the request length, request frequency and feature string, a new method, LFF (length-frequency-feature), was proposed to detect SQL injection behaviors from network traffic. The results of experiments indicated that in simulation environments the recall of LFF approach reach up to 95%, and in real network traffic the LFF approach also get a good detection result.

VI-2 class of Hamming weight of -aryq linear codes with dimension 5

Guo-xiang HU,Huan-guo ZHANG

2016, 37(2):  99-106.  doi:10.11959/j.issn.1000-436x.2016035

Asbtract ( 357 )   HTML ( 3)   PDF (299KB) ( 468 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The Hamming weight hierarchy of a linear [n,k;q] code c over GF(q)is the sequence(d₁,d₂,…,d_k),where d_r is the smallest support weight of an r-dimensional subcode of c.According to some new necessary conditions,the VI class Hamming weight hierarchies of q -ary linear codes of dimension 5 can be divided into six subclasses. By using the finite projective geometry method, VI-2 subclass and determine were researched almost all weight hierarchies of the VI-2 subclass of weight hierarchies of q -ary linear codes with dimension 5.

High-order fuzzy time series self-adaption prediction method based on spectral clustering

Chun-nan ZHOU,Shao-bin HUANG,Rong-hua CHI,Ya LI,Da-peng LANG

2016, 37(2):  107-115.  doi:10.11959/j.issn.1000-436x.2016036

Asbtract ( 382 )   HTML ( 3)   PDF (386KB) ( 560 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A fuzzy time series self-adaption prediction method based on spectral clusterin and data characteristics was proposed. First, based on spectral clustering and the racteristics of data, the number and scope of the discourses was obtained to convert into fuzzy time series self-adaptively. Then, fuzzy relationships based on Markov probability model was presented, and the multi-steps, high-order and steady fuzzy relationship are gotten.Finally, proposed meted obtained the probable fuzzy states, and got its predicted values based on defuzzification methods. Experiments on real-world and synthetic time series data indicate the rationality and effectiveness of the proposed method.

Novel cooperative global spectrum sensing algorithm based on variational Bayesian inference

Ming WU,Tie-cheng SONG,Jing HU,Lian-feng SHEN

2016, 37(2):  116-124.  doi:10.11959/j.issn.1000-436x.2016037

Asbtract ( 498 )   HTML ( 6)   PDF (352KB) ( 874 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To realize multi-dimensional dynamic spectrum access, an approximate model was proposed for the global power spectral density (PSD)of primary users (PU). Based on the proposed model, a novel cooperative spectrum sensing algorithm was proposed, and its overall flow was also built to obtain global information in the network of PU. The global information included locations, occupied frequency bands and transmitting powers of the PU. Then, an estimator of mod-el coefficient vector was designed by utilizing the th of variational Bayesian inference (VBI). Simulation results show that the proposed approximate model has good accuracy, and the corresponding estimation algorithm of model coefficient vector has good convergence and stability. Meanwhile, the relationship between SNR and the leakage of ag-gregate spurious power (LASP)was pointed out, and the influence of SNR and LASP on MSE performance was also discussed. Furthermore, it is proved that the proposed algorithm has better MSE performance than another algorithm since the sparsity of model coefficient vector is util zed.

k-means clustering method preserving differential privacy in MapReduce framework

Hong-cheng LI,Xiao-ping WU,Yan CHEN

2016, 37(2):  125-131.  doi:10.11959/j.issn.1000-436x.2016038

Asbtract ( 683 )   HTML ( 20)   PDF (278KB) ( 979 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the problem that traditional privacy preserving methods were unable to deal with malign analysis with arbitrary background knowledge, a k -means algorithm preserving differential privacy in distributed environment was proposed. This algorithm was under the computing framework of MapReduce. The host tasks were obligated to control the iterations of k -means. The Mapper tasks were appointed to compute the distances between all the records and cluster-ing centers and to mark the records with the clusters which the records belong. The Reducer tasks were appointed to compute the numbers of records which belong to the same clusters and the sums of attributes vectors, and to disturb the numbers and the sums with noises made by Laplace mecha ism, in order to achieve differential privacy preserving. Based on the combinatorial features of differential privacy, theoretically prove that this algorithm is able to fulfill -differentiallye private. The experimental results demonstrate that this method can remain available in the process of preserving privacy and improving efficiency.

Semi-supervised dynamic community detection based on non-negative matrix factorization

Zhen-chao CHANG,Hong-chang CHEN,Rui-yang HUANG,Hong-tao YU,Yang LIU

2016, 37(2):  132-143.  doi:10.11959/j.issn.1000-436x.2016039

Asbtract ( 485 )   HTML ( 12)   PDF (430KB) ( 895 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

How to effectively combine the network structures on different time points was the key and difficulty to affect the performance of detection algorithms. Based on this, a semi-supervised dynamic community algorithm SDCD based on non-negative matrix factorization, which effectively extracted the historical stability structure unit firstly, and then use it as a regularization item supervision of nonnegative matrix decomposition, to guide the network community detection on current moment. Experiments on the real network dat sets show that the method has a higher community detection quality compared with existing methods, which can accurately mine the relationship among different time, and explore network evolution and the law of development more adva geously.

Joint optimization algorithm for enhanced inter-cell interference coordination in heterogeneous networks

Lai-wei JIANG,Xuan-li WU,Nai-tong ZHANG

2016, 37(2):  144-151.  doi:10.11959/j.issn.1000-436x.2016040

Asbtract ( 441 )   HTML ( 3)   PDF (270KB) ( 672 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The total system throughput was improved by means of enhanced inter-cell interference coordination (eICIC)in heterogeneous networks(HetNets)in LTE-Advanced system. Through analyzing the existing system interference, mathematical model was established and a joint optimization algorithm for eICIC was raised based on the reduced power almost blank subframe. By using this optimized method, the relationship between the total system throughput and the re-duced power almost blank subframe was studied, so as to realize the maximized total system throughput and solve the problems of the amount of radio resources that macro cells should offer to pico cells and UE assignments. Simulation re-sults show that, compared with the comparative method, the proposed method has 19.8% improvement in the total system throughput and the optimality gap is 97.4%. Conclusions can be drawn that the proposed method is suitable for the scene where the total system throughput requirement is relat vely high while the performance of the edge user requirement is relatively low.

Quantum identity authentication scheme based on measurement-device-independent quantum key distribution protocol

Ying-di DONG,Jin-ye PENG,Xiao-bo ZHANG,Zhen-long ZHANG

2016, 37(2):  152-157.  doi:10.11959/j.issn.1000-436x.2016041

Asbtract ( 513 )   HTML ( 7)   PDF (563KB) ( 631 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Utilized to security properties of measurement-device-independent quantum key distribution (MDI-QKD)protocol, quantum identity authentication scheme based on MDI (QIA-MDI)protocol was presented. In this protocol, authentication center (AC)and authentication user have encrypted authentication information and next authenticated key by shared key, and then they transmitted the encrypted information to untrusted third party for Bell-state measurement (BSM). The secret authentication information was obtained through the BSM result, which can verify the communicator identity and update shared key. The security performance of the proposed scheme is extensively analyzed and accordingly con?rmed in the case of attacks.

Subtractive pixel adjacency matrix based features for steganalysis of spatial color images

Tao HAN,Xi CHEN,Yue-fei ZHU

2016, 37(2):  158-165.  doi:10.11959/j.issn.1000-436x.2016042

Asbtract ( 513 )   HTML ( 9)   PDF (340KB) ( 994 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Through analyzing the potential security problems of directly extending steganography based on the grayscale spatial image to the color spatial image, novel steganalysis features for detecting the steganographic methods with color spatial images as cover images were proposed. First of all, the Markov transition probability matr of the subtractive pixel adjacency matrices of three color channels were computed, and then the intra-color-channel features were extracted and merged. Afterwards, the transition probability mat ices of the subtractive pixel adjacency matrices among the color channels were calculated, where four horizontal and vertical directions, and four diagonal and anti-diagonal directions are separately merged. And the two parts composed the inter-color-channel features. Finally, the final feature set of the pro-posed method consists of the intra-color-channel features and the inter-color-channel features, and the ensemble classifier was used for the training and testing of the proposed feature. The experimental results show that the proposed method can effectively detect the steganographic schemes based on the color spatial image. Moreover, the proposed in-ter-color-channel features can efficiently capture the effect of the content-adaptive steganography on the correlation among the color channels of color images.

Jointing sparse recovery estimation algorithm of underwater acoustic channels with long time delay spread

Yue-hai ZHOU,Xiu-ling CAO,Dong-sheng CHEN,Feng TONG

2016, 37(2):  166-173.  doi:10.11959/j.issn.1000-436x.2016043

Asbtract ( 478 )   HTML ( 5)   PDF (312KB) ( 694 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Efficient estimation of underwater acoustic channels with a large time ay spread was addressed. For the conventional channel estimation methods such as LS, this type of channel estimation would produce serious estimation noise in zero-value taps which lead to poor performance of channel estimation. At the same time, a large time delay spread posed significant difficulties such as large channel order and the corresponding huge computation complexity. Compressed sensing (CS)channel estimation algorithm offered a solution to this problem by exploiting the sparsity of channel to improve the estimation performance. However to ensure acceptable estimation performance, a long training sequence was needed, which unfortunately would cause additional overhead. A method was proposed which exploiting the joint correlation of sparse multipath structure between adjacent data blocks to deal with the estimation of long time delay channels under the framework of distributed compressed sensing (DCS).Thus the large time delay underwater acoustic channels can be jointly reconstructed by the simultaneous orthogonal matching t (SOMP)algorithm to fa-cilitate the system overhead reduction and estimation ance improvement. Simulation as well as the sea trial re-sults indicate the effectiveness of the proposed method.

Research of composite safety protection for digital maps

Feng XU,Jia-nan LI,Jian-guo SUN

2016, 37(2):  174-179.  doi:10.11959/j.issn.1000-436x.2016044

Asbtract ( 365 )   HTML ( 4)   PDF (190KB) ( 525 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An adaptive watermarking technology for 2D electronic charts was proposed. It took count in the discrete wavelet domain scheme, and obtained an ideal embedding set for watermarks in the electronic chart space. In order to preserve topology of map effectly by the large embedding rates and protect the safety of watermarking scenario, a gray balance means was provided, and the maximum capacity in each divided rectangle blocks in the electronic charts was computed.The experiment also shows that it can adapt to data perturbation by conventional operations.The method has better robustness.

Analysis on the degree of freedom of interference alignment in cognitive radio

UNXian S,HAOXiao-hui Z

2016, 37(2):  180-190.  doi:10.11959/j.issn.1000-436x.2016045

Asbtract ( 471 )   HTML ( 5)   PDF (365KB) ( 714 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The feasibility conditions were still unclear in the case of finite number of signal dimension for most cognitive radio systems. The IA problem of CR system with multiple primary users and multiple secondary users was divided into two sub-problems: the IA problem of primary network and the IA problem of secondary network, based on the cognitive mind. Then, the necessary IA conditions of secondary network were presented (good IA conditions of primary network have been proposed in previous research). Through the necessary conditions, it can obtain the upper bound of the average Dof of the secondary users. An improved minimum interference leakage algorithm was proposed, with which the conclu-sion was verified.

Multi scale power spectral density subband gradient-based spectrum sensing algorithm and performance analysis

Yang ZHANG,Hua PENG,Ke-xian GONG

2016, 37(2):  191-198.  doi:10.11959/j.issn.1000-436x.2016046

Asbtract ( 421 )   HTML ( 7)   PDF (442KB) ( 487 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In response to the challenge of the complex environment such as non-cooperative communication and wide-band electromagnetic spectrum regulation, where existing missing priori information, serious channel distortion and un-even color noise in frequency domain, a novel spectrum sensing algorithm based on multi-scale power spectral density subband gradient(MPSG)was proposed. The proposed algorithm, not relying on any prior information, calculated gra-dients of sections for the power spectrum and detected the narrowband signals by adaptive double threshold, which im-proved the stability of wideband spectrum sensing through multi-scale technique. Theoretically expressions of statistical properties, false alarm probability, detection probability and decision threshold in different channels were deduced. The theoretical analysis and simulation results prove that the novel algorithm overcomes effectively the color noise with low computational complexity and strong real-time in Gaussian noise and fading channel, which can accomplish occupying band range localization of prime users. In addition, the proposed algorithm is robust for noise varia uncertainty, even in the low SNR environment.