Current Issue

25 January 2015, Volume 36 Issue 1

Previous Issue    Next Issue

Academic paper

Tone mapping based on variational model in gradient domain

IZhi-hong X,Lan-fei ZHAO,Chi ZHANG,Zhong-min ZHANG

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

Asbtract ( 293 )   HTML ( 8)   PDF (1804KB) ( 601 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Due to the low dynamic range image which was generated by the gradient domain high dynamic range compression algorithm contain the artificial boundaries and local detail distortions,a variational model in gradient domain was proposed to improve the performance of the traditional algorithm.First of all,a variational model in gradient domain was introduced to compress dynamic range,meanwhile details and edges were preserved simultaneously.Afterwards,the rate of convergence was improved by introducing the ideology of Gibbs sampler.Eventually,the improved method was employed to obtain the optimal solution of the variational model.Experimental results demonstrate that proposed algorithm reduces the degree of artificial boundaries,meanwhile low dynamic range image represents excellent capacity of detail preservation.Moreover,the real-time performance is guaranteed by the improved steepest descent method.

Performance of cellular network embedded in the cell edge with vertical coverage by co-frequency

HUJin-kang Z,ENGNa D,HAOMing Z

2015, 36(1):  9-17.  doi:10.11959/j.issn.1000-436x.2015002

Asbtract ( 358 )   HTML ( 3)   PDF (1387KB) ( 484 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A new hybrid cellular network structure is proposed,where the small base stations equipped with the downward vertical coverage of antenna beam are embedded in the cell edge of current cellular using the same frequency,thereby suppressing the inter-cell interference and improving the signal to interference ratio in the cell edge.Specifically,the radio coverage of these small stations is called vertical coverage,and the coverage of current cellular is called horizontal coverage.Since the proposed network structure does not modify the current cellular network infrastructure,it is easy to operate and implement.The cell interference depth and the interference characteristics in the horizontal coverage and the vertical coverage,as well as their spectral efficiencies are analyzed respectively.Then,the spectral efficiencies of the cell center and the cell edge with vertical coverage are investigated concerning on the proposed new hybrid cellular network structure.The results show that the new hybrid cellular network structure proposed can suppress inter-cell interference and improve cell-edge performance effectively,while achieving higher spectral efficiency.

Fault localization approach for null pointer exception

Shu-juan JIANG,Xing-ya WANG,Yan-mei ZHANG,Wei LI,Xiao-lin JU,IUYing-qi L

2015, 36(1):  18-29.  doi:10.11959/j.issn.1000-436x.2015003

Asbtract ( 356 )   HTML ( 9)   PDF (735KB) ( 842 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A novel approach to locate the fault for null pointer exception is presented.The approach first computes the static slice guided by the runtime stack,then conducts a null-pointer analysis and aliases analysis on the sliced program and obtains the suspicious statements that throw null-pointer exceptions,and finally generates a fault localization report.The experimental study indicates that,although time spent in runtime stack information collecting and aliases transferring,the proposed approach can narrow the searching space of the problem with runtime stack,and discover the value transfer process with aliases analysis,thereby eliminating false negative and false positive,and improving the effectiveness of fault localization.

VHSAP-based approach of defending against DDoS attacks for cloud computing routing platforms

UZhi-jun W,UIYi C,UEMeng Y

2015, 36(1):  30-37.  doi:10.11959/j.issn.1000-436x.2015004

Asbtract ( 299 )   HTML ( 3)   PDF (833KB) ( 641 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Based on the analysis of security overlay service (SOS) approach of defending against DDoS attacks in large scale network,the vulnerability in the exit mechanism of being attacked nodes in SOS approach is explored.The vulnerability is solved by improving the Chord algorithm according to the routing strategy in cloud computing.Hence,the virtualization hash security access path (VHSAP) in three-layer structure is proposed to protect the cloud computing platform.In VHSAP,the heartbeat mechanism is applied to realize virtual nodes by using the virtual technology.Therefore,the virtual nodes have the ability of resilience,which can complete the seamless switching between being attacked nodes in cloud computing platform,and guarantee the legitimate user's authority of accessing to the resource in cloud computing platform.Experiments of VHSAP defending against DDoS attacks are carried out in simulation network environment.The parameters,such as the number of being attacked nodes in hash secure access path (HSAP),and the switching time and the handoff delay between nodes,are focused in experiments.The result shows that VHSAP achieves a higher data pass rate than that of SOS approach,and enhances the security of cloud computing platform.

Social attributes aware data forwarding strategy in intermittently connected wireless networks

UDa-peng W,ONGXiao-long K,HANGHong-pei Z,IUQiao-shou L,IONGYu X,ANGRu-yan W

2015, 36(1):  38-47.  doi:10.11959/j.issn.1000-436x.2015005

Asbtract ( 278 )   HTML ( 2)   PDF (851KB) ( 290 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The nodes in the intermittent connection wireless network have the aggregation feature,the relation between nodes should be considered by the packet transmitting procedure.A social attributes aware data forwarding strategy in ICWN is proposed.According to the multiple parameters of network status,the social attribute of nodes is evaluated with the distribute manner; moreover,the relation between nodes is determined.Consequently,the packets are forwarded to their destination nodes.Results show that the packet delivery ratio and the delay can be optimized by proposed strategy.

Multi-link minimum change dynamic bandwidth allocation algorithm with QoS support

IANGGen L,UHe-wei Y,UNLi-min S,INYong Q

2015, 36(1):  48-56.  doi:10.11959/j.issn.1000-436x.2015006

Asbtract ( 289 )   HTML ( 2)   PDF (1293KB) ( 352 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A multi-link minimum change dynamic bandwidth allocation (MCDBA) algorithm that supports QoS is proposed in this research.This algorithm realizes the supports of different levels of QoS and quantifies the size of bandwidth allocation.Under the condition of meeting certain QoS limitations,the minimal bandwidth changing amount is achieved.The simulation results verify that MCDBA can effectively reduce the latency of data packet and improve the system bandwidth utilization.Thus,it is believed that MCDBA can be used in the addressing of complex QoS control under large-scale multi-link access network.

Mobility model detection method based on birth and death model in DTN environment

ENGGuang-hong D,AOWan-hua C,HANGJian Z,HENGXiong C,ENGLi F

2015, 36(1):  57-67.  doi:10.11959/j.issn.1000-436x.2015007

Asbtract ( 301 )   HTML ( 4)   PDF (1295KB) ( 499 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A mobility model detection method based on birth and death model (MMD-BDM) in DTN environment was proposed.It first computed the connected channel capacity of sampling times according to the data traffic during the data transfer process,and then constructed the time varying intercommunication metrics at local,which composed of channel capacity between local node and others.Based on these,the connection birth and death mode of nodes based on connected edges was deduced,and then the birth and death features of the connected nodes was analyzed to detect the mobility model,which used to improve the routing strategy during the packages deliver process.Ultimately,the mobility model detection method was put into use in spray and wait routing (SWR) method and random network coding routing (RNCR) method to experiment,the simulation results show that,it can improve the opportunity routing performance of the data deliver rate and transfer latency in DTN environment.

Energy-efficient optimal algorithm based on uplink multi-user very large MIMO system

UYing H,IBao-feng J,UANGYong-ming H,UFei Y,ANGLV-xi Y

2015, 36(1):  68-74.  doi:10.11959/j.issn.1000-436x.2015008

Asbtract ( 370 )   HTML ( 17)   PDF (1053KB) ( 683 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Using the energy efficiency lower bound as the optimization criterion,a resource allocation algorithm was investigated under uplink multi-user very large MIMO systems.Specifically,both the number of antenna arrays at the BS and the transmit data rate at the user are adjusted to maximize the energy efficiency,in which the power consumption accounts for both transmit power and circuit power,meanwhile the BS uses a zero forcing(ZF) receiver.The existence of a unique globally optimal resource allocation solution was demonstrated by exploiting the properties of objective function.Furthermore,by transforming the originally fractional optimization problem into an equivalent subtractive form using the properties of fractional programming,an iterative resource allocation algorithm was developed to achieve the optimum was developed.Simulation results show that the algorithm converge to a near optimal solution only with a small number of iterations.

Coordinate transformation based coefficients estimation algorithm for digital predistortion of RF power amplifiers

GHao HUAN,Hua QIAN,Sai-jie YAO,Xiu-mei YANG

2015, 36(1):  75-83.  doi:10.11959/j.issn.1000-436x.2015009

Asbtract ( 321 )   HTML ( 5)   PDF (1565KB) ( 565 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Based on the low-IF digital predistortion (DPD) architecture,a coordinate transformation based low-complex coefficients estimation algorithm is proposed to reduce the hardware implementation cost and numerical calculation complexity significantly.The proposed algorithm transforms the complex multiplication of the conventional DPD coefficients estimation method to amplitude multiplication and phase addition in polar coordinates.To complete the same calculation,times of multiplications and accumulations are reduced by 75% and 50%.The algorithm is derived from the general Volterra pass-band nonlinear model,and proves the equivalency of baseband predistortion and IF predistortion.The proposed low-IF architecture and the coefficients estimation algorithm are verified by the measurement results on a practical radio frequency power amplifier.

Cooperative spectrum sensing algorithm based on limiting eigenvalue distribution

Yin MI,Guang-yue LU

2015, 36(1):  84-89.  doi:10.11959/j.issn.1000-436x.2015010

Asbtract ( 318 )   HTML ( 12)   PDF (664KB) ( 549 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A novel maximum-minimum eigenvalue (NMME) cooperative spectrum sensing algorithm and threshold decision rule are proposed via analyzing minimum eigenvalue limiting distribution of the covariance matrix of the received signals from multiple cognitive users (CU) by means of latest random matrix theory (RMT).The proposed scheme could not need the prior knowledge of the signal transmitted from primary user (PU) and could effectively overcome the noise uncertainty.At a given probability of false alarm (P_fa),simulation results show that the proposed scheme can get lower decision threshold and higher probability of detection (P_d) compared with the original algorithm,and it can also get better detection performance with fewer CU and smaller sample numbers.

Underwater acoustic OFDM channel equalization based on virtual time reversal mirror

Yan-ling YIN,Gang QIAO,Song-zuo LIU

2015, 36(1):  90-99.  doi:10.11959/j.issn.1000-436x.2015011

Asbtract ( 535 )   HTML ( 41)   PDF (1421KB) ( 844 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To solve the problem of the severe inter-symbol interference of orthogonal frequency division multiplexing (OFDM) communication caused by underwater acoustic multipath channel,a virtual time reversal channel equalization scheme was proposed.VTRM was able to shorten the channel impulse response and alleviate the phase distortion caused by the acoustic channel for its characteristic of the temporal compression and phase conjugation in frequency domain.The matching pursuit (MP) algorithm was applied to estimate the channel impulse response which could estimate the channel amplitude,time delay and phase accurately.It provided the channel information for the VTRM channel equalization.It also improved a lot compared to the traditional matching correlation channel estimation method which couldn't estimate the channel phase and the estimation precision was low.The simulation,pool trail and Songhua lake experiment show that the performance of VTRM channel equalization is better than that of the PTRM and LS channel equalization in the OFDM underwater acoustic communication.

Research on trust measure and management for open distributed systems based on dynamic grouping

Li-ming JIANG,Zhi-ming LIU,Kun ZHANG,Jian XU,Hong ZHANG

2015, 36(1):  100-110.  doi:10.11959/j.issn.1000-436x.2015012

Asbtract ( 272 )   HTML ( 2)   PDF (1334KB) ( 343 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A stability enhanced group-based trust model(denoted by SEGTM) for open distributed systems was presented to solve the problems of not sufficiently maintaining trust relation between peers due to the dynamic changes in trust network topology.First,the formation and dynamic management of peers' group were depicted in detail,including nodes gathered into the same group with similar interests,competition for group head and nodes within the group leave in active or passive ways.Then,the trust relation in proposed model was categorized into three kinds and subsequently each solution for these kinds was also put forward.So,the problems of decline in accuracy of computational trust degree between peers due to the difference of peers' interests and low probability of repeated transactions between them were addressed.Simulation results show that the model not only enhances the fairness and stability in response to dynamic changes in network topology,but also can effectively resist the attacks of malicious nodes.

Dynamic spectrum access method for femtocells in LTE

Xu-zhou ZUO,Wei-wei XIA,Lian-feng SHEN

2015, 36(1):  111-120.  doi:10.11959/j.issn.1000-436x.2015013

Asbtract ( 254 )   HTML ( 2)   PDF (2677KB) ( 556 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Dynamic spectrum access method for femtocells in LTE using cognitive radio method to meet the communication requestions was investigated.An uplink sensing method was proposed.By this method,femtocells could not only identify occupied spectrums but also identify service categories of those spectrums.A dynamic spectrum assess method of power control and frequency hopping for femtocells that ensured a low pre-definable performance impact to macro users was proposed.The femtocell could adopt power control to access the spectrum that carried data service while adopt frequency hopping to access the spectrum that carried voice service.Simulation results show that the downlink throughput of the femtocell can be significantly increased by using proposed spectrum access method.

Blind audio watermarking mechanism based on variational Bayesian learning

Xin TANG,Zhao-feng MA,Xin-xin NIU,Yi-xian YANG

2015, 36(1):  121-128.  doi:10.11959/j.issn.1000-436x.2015014

Asbtract ( 320 )   HTML ( 4)   PDF (1263KB) ( 708 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to improve the performance of audio watermarking detection,a blind audio watermarking mechanism using the statistical characteristics based on MFCC features of audio frames was proposed.The spread spectrum watermarking was embedded in the DCT coefficients of audio frames.MFCC features extracted from watermarked audio frames as well as un-watermarked ones were trained to establish their Gaussian mixture models and to estimate the parameters by vatiational Bayesian learning method respectively.The watermarking was detected according to the maximum likelihood principle.The experimental results show that our method can lower the false detection rate compared with the method using EM algorithm when the audio signal was under noise and malicious attacks.Also,the experiments show that the proposed method achieves better performance in handling insufficient training data as well as getting rid of over-fitting problem.

Problem of the dynamic topology architecture of rechargeable wireless sensor networks

Xu DING,Jiang-hong HAN,Lei SHI,Wei XIA,Zhen-chun WEI

2015, 36(1):  129-141.  doi:10.11959/j.issn.1000-436x.2015015

Asbtract ( 347 )   HTML ( 10)   PDF (3042KB) ( 1018 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The time-varying dynamic topology model for rechargeable wireless sensor networks is proposed in accordance with the scenario that the wireless charging equipment plays the role of a data collector while charging sensor nodes at the meantime.An optimization problem aiming to maximize the vacation time ratio of the wireless charging equipment is then raised from the study of the model established.Through comprehensively analyzing of the working states and constraints of different sensor nodes as well as the wireless charging equipment during different time instances,the multi-phase linear programming problem with the identical optimality is then obtained.The optimal dynamic data routing schemes of different phases compatible with the dynamic topology architecture are acquired from solving this optimization problem.What is more,the working strategies of the wireless charging/data collecting equipment are also obtained,simultaneously.Compared with the results of the previous work,the objective values are increased by no less than 20%.

Chosen-plaintext power analysis attack against SMS4 with the round-output as the intermediate data

Min WANG,Zhi-bo DU,Zhen WU,Jin-tao RAO

2015, 36(1):  142-148.  doi:10.11959/j.issn.1000-436x.2015016

Asbtract ( 383 )   HTML ( 6)   PDF (1858KB) ( 645 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The method of chosen-plaintext power analysis attack against SMS4 with the round-output as the intermediate data is proposed.Firstly,this method attacks out the output of the iterative function.Then the sub key can be achieved by the output of the iterative function.And it is achieved to make the attack real and improve the efficiency,when SMS4 is attacked by taking of the method.In particular,the actual experiment of the method is done,and the results show that the attack algorithm is correct and effective.

Energy-aware scheduling policy for data-intensive workflow

Peng XIAO,Zhi-gang HU,Xi-long QU

2015, 36(1):  149-158.  doi:10.11959/j.issn.1000-436x.2015017

Asbtract ( 251 )   HTML ( 3)   PDF (1937KB) ( 699 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

With the increasing scale of data centers,high energy consumption has become a critical issue in high-performance computing area.To address the issue of energy consumption optimization for data-intensive workflow applications,a set of virtual data-accessing nodes are introduced into the original workflow for quantitatively evaluating the data-accessing energy consumption,by which a novel heuristic policy called minimal energy consumption path is designed.Based on the proposed heuristic policy,two energy-aware scheduling algorithms are implemented,which are deprived from the classical HEFT and CPOP scheduling algorithms.Extensive experiments are conducted to investigate the performance of the proposed algorithms,and the results show that they can significantly reduce the data-accessing energy consumption.Also,the proposed algorithms show better adaptive when the system is in presence of large-scale workflows.

Improved anticipatory scheduling algorithm based on workload characteristic and service time evaluation

Jin-zhong CHEN,Nian-min YAO,Shao-bin CAI,Mei-ling SUN

2015, 36(1):  159-166.  doi:10.11959/j.issn.1000-436x.2015018

Asbtract ( 254 )   HTML ( 2)   PDF (1242KB) ( 583 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Anticipatory scheduling (AS) of Linux I/O schedule layer assigns fixed anticipation period length to each process.It will introduce extra delay if I/O request does not arrive in time.The improved anticipatory scheduling (WPCAS) algorithm is proposed which is based on workload characteristic and service time.WPCAS includes process classifier(PC) module and request service time evaluation (STE) module.PC module assigns different anticipation period lengths in terms of workload characteristic.STE module decides whether to anticipate the coming request according to service time.Experimental results show that WPCAS algorithm is superior to 95%-Heuristic and AS in terms of throughput,average waiting time of anticipation success and deceptive idleness.

Research on algorithms of data encryption scheme that supports homomorphic arithmetical operations

ANGPan Y,UIXiao-lin G,AOJing Y,INJian-cai L,IANFeng T,HANGXue-jun Z

2015, 36(1):  167-178.  doi:10.11959/j.issn.1000-436x.2015019

Asbtract ( 536 )   HTML ( 18)   PDF (1579KB) ( 1474 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An efficient homomorphic encryption scheme called CESIL was proposed to meet the requirements of operating on encrypted data when protecting users' privacy in computing services.CESIL included key generation algorithm,encryption algorithm,decryption algorithm and calculation algorithm.In CESIL,a polynomial coefficient vector ring was established by defining addition and multiplication using polynomial ring; by using ideal lattice,the vector ring was partitioned into many residue classes to produce a quotient ring and its representative set; the plaintext was encrypted by mapping it to a representative and replacing the representative with another element in the same residue class.The features of operations in quotient ring ensured CESIL operate on encrypted data.Furthermore,the fast Fourier transform (FFT) algorithm was used to increase the efficiency and decrease the length of key.Theoretical analysis and experimental results show that CESIL is semantically secure,and can do addition and multiplication operations on encrypted data homomorphically in a specific scope.Comparing to some existing homomorphic encryption schemes,the CESIL runs efficiently,and has shorter length in key and ciphertext.Thus,the CESIL fits the practical applications better.

Distributed refinement algorithm for WSN localization

Ying-biao YAO,Nan-lan JIANG

2015, 36(1):  179-188.  doi:10.11959/j.issn.1000-436x.2015020

Asbtract ( 346 )   HTML ( 14)   PDF (2477KB) ( 539 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A distributed refinement algorithm was proposed based on the error analyzing of range-based WSN localization.In each iteration,the proposed algorithm identified “error nodes” and “effective nodes” according to the idea of“magnetic pole”at first; then,it choosed two nodes with the minimum relative deviations in the 1-hop neighbors set of error node,and getted the intersection points of two circles whose centers were the positions of above two nodes and radiuses are the range distances from above two nodes to the error node respectively; at last,it choosed the position with minimum error,from its current position and above two intersection points as refinement position of error node after this iteration.Simulation results show that the proposed algorithm can reduce the localization error of multilateral positioning model and improve the localization accuracy efficiently.

Region-based lossless data hiding with high capacity for medical images

Xiao-hong DENG,Zhi-gang CHEN,Di-qing LIANG,Yi-min MAO

2015, 36(1):  189-198.  doi:10.11959/j.issn.1000-436x.2015021

Asbtract ( 300 )   HTML ( 13)   PDF (1269KB) ( 809 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In view of the significant regional features of medical images,a new high capacity lossless data hiding method based on region and histogram shifting was presented.Firstly,the presented method utilized segmentation method of the maximum class separation distance to get the foreground region of medical images,and then used the polymeric polygonal approximation and image fitting algorithm to get the embedding region of region foreground.In the embedding procedure,the difference histogram circular shifting method and the code-based histogram shifting method were presented to embed hidden data in foreground and background region respectively,which improved the limit embedding capacity and resolved the overflow and underflow in traditional histogram shifting method.Experimental results show that the proposed method achieves high embedding capacity with 1 bit/pixel and stego-image quality about 40 dB.The presented method can be applied to the quality of sensitive image's large capacity information hiding with regional feature.

Academic communication

Vehicular social network:a survey

Xiang WANG,Su-peng LENG,Ke ZHANG,Hao LIU

2015, 36(1):  199-210.  doi:10.11959/j.issn.1000-436x.2015022

Asbtract ( 465 )   HTML ( 11)   PDF (1331KB) ( 958 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Combining techniques of social networks and wireless communications,vehicular social network (VSN) aim to provide a variety of data delivery services based on the social relationship among vehicle users.With the extensive survey and analysis of existing research work on mobile social network (MSN) and vehicle networks,the architecture and applications of vehicular social network (VSN) as well as the relationship between vehicle networks and social network from a technical viewpoint are presented.The key technologies in VSN are summarized,including the problems and solutions in terms of information delivery,bandwidth allocation,distributed caching,security and privacy.Moreover,future research directions and challenges are presented.

Multipath traffic splitting algorithm based on adaptive granularity

Peng WANG,Ju-long LAN,Shu-qiao CHEN

2015, 36(1):  211-217.  doi:10.11959/j.issn.1000-436x.2015023

Asbtract ( 345 )   HTML ( 8)   PDF (1148KB) ( 877 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the dilemma between load balancing and packet reordering in multipath routing,an adaptive dynamic multipath traffic splitting(ADTS) algorithm was proposed.The algorithm classified Internet flows into two categories:the aggressive and the normal through analyzing the characters of the traffic,and applies different splitting granularities to the two classes of flows based on the idea of differentiated service.The theoretical analysis and simulation results show that ADTS algorithm reduces the number of reordering packets while has better performance of load balancing.

Fractional time delay estimation method based on the minimum CIM and the Farrow structure

ULing Y,IUTian-shuang Q

2015, 36(1):  218-223.  doi:10.11959/j.issn.1000-436x.2015024

Asbtract ( 291 )   HTML ( 7)   PDF (754KB) ( 494 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A fractional time delay estimation algorithm is proposed which is based on the minimum CIM and the Farrow structure (referred to as MCIMFarrow).The proposed MCIMFarrow algorithm performs well in symmetric Alpha stable noise conditions.And it needs little observation data to gain high accuracy estimation results.The theoretical analyses and the simulation results show that the MCIMFarrow is much better than the LETDE algorithm based on the fractional lower order moments in the accuracy of the time delay estimation and the robustness in impulsive noise conditions.

Research on relevance between k-core and clustering coefficient in complex network

Jun LIU,Jian-zhong QIAO

2015, 36(1):  224-229.  doi:10.11959/j.issn.1000-436x.2015025

Asbtract ( 475 )   HTML ( 13)   PDF (706KB) ( 1311 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

K-core analysis is an effective way to simplify the graphic topological structure.Many researches considered that the higher value k is,the more important the core is in complex network.But the relevance analysis between k-core and clustering coefficient has not been made.Experimental results show that with the k-core analysis,the trend of the clustering coefficient is consistent with k.The proposed conclusions can provide theoretical basis and guidance for the future applications of k-core analysis in complex network.

Checkpoint trust evaluation method based on Markov

Jun-feng TIAN,Ya-jiao ZHANG

2015, 36(1):  230-236.  doi:10.11959/j.issn.1000-436x.2015026

Asbtract ( 266 )   HTML ( 5)   PDF (667KB) ( 176 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

According to the trust evaluation of software and its modules after running for a period of time a checkpoint trust evaluation model was presented based on Markov to find the vulnerability of software by monitoring software behavior dynamically.The model reflected the software running situation by some checkpoints worked in the software behavior trace,then divided some trust levels to reflect the checkpoint trusted situation by the Markov model and the weight of checkpoint,and finally synthesized the checkpoint trusted situation to determine the software trust value.Experimental results showed that the model could effectively reflect the trusted situation of the various parts of the software,and verify the rationality and availability of the model.

Minimum-cost network hardening algorithm based on stochastic loose optimize strategy

Guang-sheng ZHAO,Qing-feng CHENG,Yong-lin SUN

2015, 36(1):  237-245.  doi:10.11959/j.issn.1000-436x.2015027

Asbtract ( 242 )   HTML ( 5)   PDF (1324KB) ( 402 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To construst a minimum-cost network hardening (MCNH) scheme in large-scale network,a stochastic loose optimize strategy based algorithm (MCNHA-SLOS) was proposed,and its effectiveness was analyzed.MCNHA-SLOS was a near-optimal approximation algorithm,which could achieve iterative computations in the array of sparse spaces of the whole plan space,so that the near-optimal scheme must exist in the low cost plan space.Instantiation analysis and experimental results show that the MCNHA-SLOS algorithm to be efficient,precision controllable and asymptotically optimal,and thus very applicable for large-scale network.