Author Login Editor-in-Chief Peer Review Editor Work Office Work

15 February 2016, Volume 42 Issue 2
    

  • Select all
    |
  • WENG Chichi,QI Fazhi,CHEN Gang
    Computer Engineering. 2016, 42(2): 1-6. https://doi.org/10.3969/j.issn.1000-3428.2016.02.001
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Aiming at the problem that the existed host Security Risk Assessment(SRA) index is not complete,difficult to operate and the result is hard to understand,this paper proposes a method for host SRA based on Analytic Hierarchy Process(AHP) and cloud model.It integrates the national information security classified protection policy,designs a multi-level index system using AHP and cloud model to assess the risk of host security fuzzily and quantifiably.Experimental results show that the proposed method achieves a satisfactory result in quantitative evaluation of complex host system,and effectively improves the accuracy and scientificity of the detection results.

  • CUI Jingsong,TIAN Changyou,GUO Chi,YIN Xue
    Computer Engineering. 2016, 42(2): 7-14. https://doi.org/10.3969/j.issn.1000-3428.2016.02.002
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Most cloud platforms like CloudStack have no safety plug-in or function to protect the virtual machines.Aiming at this problem,this paper proposes a monitoring framework for malicious hidden process based on Xen virtual machine monitor on CloudStack.Firstly,the monitor client installed in the privileged virtual machine requests to monitor the processes in the target virtual machine,and the daemon process passes the request to the Xen virtual machine monitor using the event channel,then the event registration/capture module in the virtual machine monitor registers the event hook in the guest virtual machine.After listening CR3 register content changing in the target virtual machine kernel,this event is notified to the monitor response module,and then it uses the virtual machine introspection technology to get memory data of the target virtual machine and restores them by semantic restoration technology,and finally passes the processes monitor information from the virtual machine monitor to the monitor client through shared memory mechanism.Experimental results show that the proposed framework can accurately find malicious hidden processes in the target virtual machine,and obtain resource usage information of hidden processes.
  • WANG Huifeng,LI Zhanhuai,ZHANG Xiao,SUN Jian,ZHAO Xiaonan
    Computer Engineering. 2016, 42(2): 15-20. https://doi.org/10.3969/j.issn.1000-3428.2016.02.003
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Audit of data possession is the key technique of ensuring the cloud data integrity,but the concurrent update operation makes the audit system efficiency dramatically decreased.Aiming at this problem,this paper proposes an audit method of cloud storage data possession supporting concurrent update.By improving Merkle Hash Tree(MHT) structure,it makes multiple updated requests of MHT intermediate node delay execution and generates updated state tree.It separates multiple leaf nodes and combines them to execute,which can significantly eliminate duplicate nodes in MHT,and effectively reduce the update cost of cloud storage data integrity audit system.Both formal analysis and the experimental results indicate that the proposed method can efficiently reduce the number of updating MHT nodes,and improve the update efficiency for the audit of cloud storage data possession.

  • CHENG Guang,WANG Xiaofeng
    Computer Engineering. 2016, 42(2): 21-25,32. https://doi.org/10.3969/j.issn.1000-3428.2016.02.004
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Under the environment of big data,the traditional association rule mining algorithms have lower efficiency caused by the rapidly increasing data.Aiming at the problem,this paper proposes a parallel incremental updating algorithm of association rules based on the Frequent Pattern Growth(FP-growth) algorithm.Each step of incremental FP-growth algorithm is realized to parallel process by using the MapReduce programming model and cloud computing platform.In the updating process,it uses the existing incremental of frequent itemsets and 1-set to construct frequent pattern tree of the new transaction after completing frequent itemsets updating by scanning the original transaction database one time.Experimental results show that the algorithm has better efficiency and expansibility compared with the traditional association rule mining algorithm,therefore it can be applied to the association rules incremental mining of massive data.
  • ZHU Chunxiang,CHEN Shiping,CHEN Mingang
    Computer Engineering. 2016, 42(2): 26-32. https://doi.org/10.3969/j.issn.1000-3428.2016.02.005
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Hadoop platform has over 200 configuration parameters,it can improve the performance of the system by deploying these parameters in reason.Aiming at the optimization of Hadoop configuration parameters problem,a black box optimization strategy based on recursive random sampling is proposed.It utilizes the initial high efficiency of random sampling,constantly adjusts the sample space to start recursive random sampling,and searches the approximate global optimal configuration quickly and efficiently.Experimental results show that,the configuration method based on black box optimization strategy can improve the job processing speed by 14%~25% than traditional method,and it has good stability and reliability.
  • GAN Qingqing,WANG Xiaoming
    Computer Engineering. 2016, 42(2): 33-37,44. https://doi.org/10.3969/j.issn.1000-3428.2016.02.006
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the key management problems during data sharing,this paper proposes a key-aggregate encryption scheme based on multilinear mapping through the idea of broadcast encryption scheme based on multilinear mapping.In the proposed scheme,user private keys can be aggregated together to generate a single key,and the single key can decrypt the corresponding multiple encrypted files.It simplifies the user key management and realizes data sharing securely and efficiently in cloud storage.The proposed scheme is proved security of selective Indistinguishability Under Chosen Plaintext Attack(IND-CPA) based on DHDHE assumption in the standard model.Compared with the existing schemes,the proposed scheme can save the cost of storage and transmission efficiently.
  • ZHENG Yaguang,PAN Jiuhui
    Computer Engineering. 2016, 42(2): 38-44. https://doi.org/10.3969/j.issn.1000-3428.2016.02.007
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The backtracking function of Sliding Blocking Algorithm with Backtracking Sub-block(SBBS) becomes partial or even complete failure when the bytes are inserted or deleted,which are close to the two sides of the matching failure data segments.Aiming at the problem,this paper proposes an improved algorithm for duplicate data detection.This algorithm takes advantage of a new movement pattern which combines with gliding and rolling to reduce the computation overhead of window,and it improves the matching speed by adopting Rsync rolling checksum algorithm and MD5 algorithm.By backtracking matching failure data segments,it detects contained duplicate data segments to improve the detection accuracy of duplicate data.Experimental results show that,compared with SBBS,the recall ratio of this algorithm in uniform distribution and non uniform distribution of duplicate data segments are increased by 4.32% and 5.28% respectively.
  • WEI Yong,HU Danlu,HAO Chenguang,OU Xiaoping
    Computer Engineering. 2016, 42(2): 45-50. https://doi.org/10.3969/j.issn.1000-3428.2016.02.008
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    To solve the no-structuring problem of Term Frequency-Inverse Document Frequency(TF-IDF) model in topical crawler,this paper proposes a novel topical crawler based on Classified Keyword Term Frequency (CKTF) model.A Webpage is divided into five parts,according to the Webpage document structure characteristics and the distribution information of topical works.Geopolitical topical words and their correlative rates are calculated based on Wikipedia and Sougou internet corpus.Then,Webpage vector classification are learned and classified by Support Vector Machine(SVM).Experimental result shows that geopolitical topical crawler based on CKTF model can mine the rich meaning of the geopolitical topic,and measure effectively correlation between a Webpage and a topic with a higher accuracy and stability.

  • SHEN Ruoliang,CHEN Yaowu
    Computer Engineering. 2016, 42(2): 51-55. https://doi.org/10.3969/j.issn.1000-3428.2016.02.009
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to avoid spurious wave impact to Electrocardigram(ECG) test during sports,the paper designs a ECG detection system with a combination of the acceleration.By using analog front end to acquire the ECG,with the help of the triaxial accelerometer,the system can assess the exercise intensity and filter the signals generated while doing strenuous sports.By using Digital Signal Processor(DSP) to preprocess the ECG,the system raises an optimized adaptive threshold method to detect QRS.The dealt data results are sent to Android mobile phone via Bluetooth and shown on the screen.Experimental results show the accuracy of the system is 82.5% when in motion,and it can avoid Pseudo wave under moving.By using MIT-BIH database signals,the detection rate of QRS can reach 98.2%,and the system can do real-time detection of ECG.
  • WEI Jiaxin,YE Feiyue
    Computer Engineering. 2016, 42(2): 56-61. https://doi.org/10.3969/j.issn.1000-3428.2016.02.010
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem that Web Query Interface(WQI)from different Web sites can not be found automatically due to their highly heterogeneous structure,this paper proposes a method to find WQI based on Hyper Text Markup Language(HTML)features and hierarchical clustering.It establishes a proper page model in the form of tree with a method combined with pre-order traversal and post-order traversal,according to the facts that HTML elements are organized in a hierarchical,attached relationship and interactive elements generally exist in the terminal part of a DOM tree.Local WQIs are detected and the set for clustering,in which each local WQI is considered as one class and named as interaction group,is initially referenced to the interaction density in the model.It clusters different interaction groups hierarchically by structure distance and label the interaction nodes of substantial WQI with the nearest text node around in structure.Non-query WQI is filtered out by text filter.This method avoids the excessive dependency on tag “form” and presents a better performance in property of generality than traditional methods.Experimental results show that this method has advantage over researches before,the recognition accuracies of them reach up to 90.7% and 92% respectively.
  • CAO Yi,TAO Hongyu,LUO Xia
    Computer Engineering. 2016, 42(2): 62-65. https://doi.org/10.3969/j.issn.1000-3428.2016.02.011
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Information asymmetry problem is eased by taxi-hailing apps to a large extent,which changes the searching behavior of vacant taxi.In order to improve the prediction accuracy for vacant taxi trip distribution,this paper considers that vacant taxi selects the next passenger origin area and adopts either of the two kinds of service modes based on operating characteristics of vacant taxis.By comparing the difference of utility between cruise service mode and dispatch service mode,a trip distribution model for vacant taxis is established.When the model is applied to Chengdu taxi market,data analysis result shows that major vacant taxi tends to select dispatch service mode in certain conditions.The taxi-hailing apps creats an information system which can reduce travel times of vacant taxis,which can offer some beneficial guidance and theoretic basis to the planning and management of urban taxi operation.
  • LIU Lifang,LUO Yahui,KANG Jiang
    Computer Engineering. 2016, 42(2): 66-69,76. https://doi.org/10.3969/j.issn.1000-3428.2016.02.012
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For remote Automatic Meter Reading(AMR) systems that require high reliability data storage characteristics,a power failsafe and minimal footprint lightweight Flash file system is designed.The file system uses a hierarchical,modular,and cross-platform design and has great flexibility and versatility,and can be easily ported to a variety of resources limited platforms like ARM Cortex-M Micro Control Unit(MCU).For the realization of power fail-safe,a design method similar to the journaling file system is used.The Flash space is divided into 5 regions.Numbers of physical pages are used as the management area,recording the operations of safe erase and write operations.Finally,a hardware platform based on Freescale MK60 and MQX RTOS is used to test the file system.The results indicate that the file system is less resource consumption,has high reliability,and can meet the data storage requirements of AMR systems.
  • ZHANG Ting,PENG Dunlu,ZOU Mengping
    Computer Engineering. 2016, 42(2): 70-76. https://doi.org/10.3969/j.issn.1000-3428.2016.02.013
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    To solve the problems of the difficulties of most smart home control system installation deployment and high cost,the paper puts forward a kind of family-oriented WiFi smart power plug scheme.This scheme uses an embedded PIC32 microcontroller,uses applications of smart phones which are based on Android,and uses IP to connect remote access control and devices which link smart power plug.It utilizes Representational State Transfer(REST) based Web services to monitor home appliances.The user uses point to point mode and basic networking mode to visit smart power plug.Experimental results show that the hardware intelligent of smart power plug is simple,the cost is low,reliability is high,and it is easy to extend.

  • WANG Dahai,PENG Hua,LI Tianyun
    Computer Engineering. 2016, 42(2): 77-80. https://doi.org/10.3969/j.issn.1000-3428.2016.02.014
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In software radio transmitter,some applications(such as communication electronic warfare jamming transmitter) need to generate arbitrary symbol rate baseband signal in a certain range in the condition of fixed sampling rate.For this application,an arbitrary symbol rate baseband signal generation algorithm in the condition of fixed sampling rate is presented in this paper.The thought of the algorithm is arbitrary neighbor decimation from large integer multiple symbol rate baseband signal.It takes the neighbor error equivalent as the loss of baseband Signal Noise Ratio(SNR).Theoretical derivation and simulation results show that the neighbor error makes little impact on the baseband signal quality by using a few storage resources.It is enough to satisfy the requirements of the practical system.
  • CAI Shengsuo,LEI Lei,ZHENG Xin,DONG Tao,ZHU Gang
    Computer Engineering. 2016, 42(2): 81-85. https://doi.org/10.3969/j.issn.1000-3428.2016.02.015
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In large scale mobile IP networks,the registration request from the mobile nodes collides at the agent node,and results large handoff delay.To solve this problem,a one-dimensional Markov chain model is proposed,which takes the mobile nodes needing to register into consideration.On the basis of the model,the relationship between the total time for all the mobile nodes finishing their registration and the value of their contention window is derived.Mobile nodes can adjust the value of their contention window to avoid collisions,thus achieve better registration time performance.Afterwards,the mobile IP protocol is implemented in GloMoSim.The effectiveness of the model in optimizing the value of the contention window is validated by comparing the simulation results with the theoretical results.
  • SU Qiao,SHEN Yuehong,XU Pengcheng
    Computer Engineering. 2016, 42(2): 86-92. https://doi.org/10.3969/j.issn.1000-3428.2016.02.016
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In view of the separation for the mixture of bounded signals,this paper proposes a Bounded Component Analysis(BCA) algorithm for detection and removing of steady state fluctuation.The algorithm takes advantage of assumptions of compactness and Cartesian decomposition of convex support of sources.It can separate both independent and dependent sources up to permutation,scaling and phase ambiguities.The algorithm detects the fluctuation of the steady state learning curve by the correlation at the steady state,uses the iteration of variable step to remove the fluctuation of the steady state learning curve.This leads to a faster convergence speed and better performance.Simulation results show that the proposed algorithm can separate the dependent and independent sources efficiently and the convergence speed and accuracy are superior to existing BCA algorithms in the noisy or noiseless circumstance.
  • LIU Zhiguo,SHI Erxin,MA Yue
    Computer Engineering. 2016, 42(2): 93-97,103. https://doi.org/10.3969/j.issn.1000-3428.2016.02.017
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to allocate the bandwidth equitably,reduce resource waste and satisfy the bandwidth requirement of different priority traffic in a satellite communication network,an improved bandwidth allocation method based on dynamic token bucket is proposed.In this method,the strategy that each priority level corresponds to a token bucket is improved.The leaky buckets are embedded in the token buckets so that the bandwidth is allocated twice.To adapt to the changes of traffic rate,traffic weight is set for diffident priority traffic,and tokens can be allocated dynamically by the occupation ratio of traffic weight.At the same time,the overflow tokens can be also allocated accordingly by the difference of the traffic priority so as to reduce resource waste.Simulation results show that compared with to Dynamic Bandwidth Allocation Algorithm with Token Bucket(DBAATB),the throughput of satellite communication network of this method can be improved effectively,the bandwidth requirement of the high priority traffic can be satisfied,and the low priority traffic can achieve the bandwidth resource equitably.
  • HU Ke,LIAO Xingyu,YU Min,WANG Lunjie
    Computer Engineering. 2016, 42(2): 98-103. https://doi.org/10.3969/j.issn.1000-3428.2016.02.018
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To compensate blind for GPS positioning in indoor environments,provide accurate and seamless positioning in indoor and outdoor environments,based on GPS satellite positioning technology and Wi-Fi location fingerprint positioning technology,an indoor and outdoor seamless positioning algorithm GPS and Location Fingerprint(GPS-LF) is proposed.GPS-LF algorithm uses the GPS satellite positioning technology for outdoor environments positioning,after entering the room switched to the position of the Wi-Fi localization algorithms based on location fingerprint.Unknown node to positioning themselves by receiving multiple Wi-Fi signal intensity value matches the fingerprint database which is previously downloaded to the node.It estimates the location of unknown nodes in order to achieve positioning.Experimental results on real scenarios indicate that GPS-LF algorithm can be well positioned to meet the demand for seamless indoor and outdoor.
  • LI Yu,HE Shijun
    Computer Engineering. 2016, 42(2): 104-107,112. https://doi.org/10.3969/j.issn.1000-3428.2016.02.019
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In blind signal separation process,the Non-negative Matrix Factorization(NMF) based on multiplicative iteration has the problem of large computation and slow decomposition speed.So a new blind signal separation algorithm for NMF based on projected gradient method is proposed.The problem is transformed into solving alternating least squares problem by adding the determinant constraint,sparse constraint and correlation constraint,by using the projected gradient method to solve blind signal separation problems.Simulation result shows that this algorithm can reduce reconstruction error,and ensure the separation of signal sparse in realization of mixed signal only on the basis of decomposition.Compared with the classical NMF algorithm and NMFDSC algorithm,it converges faster and decomposes more quickly,and the Signal Noise Ratio(SNR) of reconstructed signal is also higher.
  • YING Lan,LIN Yimin,CHI Kaikai
    Computer Engineering. 2016, 42(2): 108-112. https://doi.org/10.3969/j.issn.1000-3428.2016.02.020
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The existing Energy-harvesting Wireless Sensor Network(EH-WSN) routing schemes almost do not consider some important issues like the link quality,whether the node energy is enough,etc..So,the energy wastage-aware residual-energy-maximized routing problem for EH-WSN is formulated.Taking into account the energy overcharge wastage and link packet delivery rate based communication energy consumption,an improved wastage-aware routing scheme is proposed,which finds the route with low communication energy consumption and energy overcharge wastage.Simulation results demonstrate that,compared with the wastage-aware routing scheme proposed by Martinez G,et al(IEEE Sensors Journal,2014,No.9),the proposed routing scheme is able to improve the node residual energy by about 50%.
  • HE Jingsha,PAN Libin
    Computer Engineering. 2016, 42(2): 113-117. https://doi.org/10.3969/j.issn.1000-3428.2016.02.021
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Due to the limited size and energy,the computing power and storage space of Internet of Things(IoT) nodes are always limited.For this problem,this paper proposes and designs a kind of IoT communication protocol based on asymmetric mode.The protocol establishes the communication link between IoT nodes and nearest server,and transforms the task which is originally executed by single node to compute between node and server.The protocol asymmetrically distributes between node and server,and assigns the server a more complex calculation,thus reduces the energy consumption of calculating of nodes,and realizes the energy-saving demand of IoT nodes.Simulation results show that compared with traditional RSA encryption and decryption operations,the asymmetric mode can significantly reduce the calculate time and energy consumption,the range is about 20%.The protocol proposed in this paper effectively improves the computation efficiency,and prolongs the life of nodes.
  • LI Hefei,HUANG Xinli,ZHENG Zhengqi
    Computer Engineering. 2016, 42(2): 118-123. https://doi.org/10.3969/j.issn.1000-3428.2016.02.022
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the characteristics of Distributed Denial of Service(DDoS) attack and OpenFlow technology,this paper proposes a novel DDoS attack detection method based on Software Defined Network(SDN).It gets flow-table item installed in OpenFlow switch,constructs the effective global network flow-table characteristic values for destination address,and classifies the training sample by using Support Vector Machine(SVM) to realize DDoS attack on-line detection.It implements prototype system of DDoS attack detection methods and makes it integrate into the SDN environment to verify the correctness and validity of the method.Experimental result shows that this method can improve the DDoS attack Detection Rate(DR) and decrease False Alarm Rate(FR),and it has good comprehensive performance.
  • QU Chunyan,GUAN Yating,LIU Guiquan
    Computer Engineering. 2016, 42(2): 124-130. https://doi.org/10.3969/j.issn.1000-3428.2016.02.023
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem that the collaborative filtering algorithm in online recommender systems is very vulnerable to the profile injection attacks,this paper considers target attack item and attacker and defines the concept of attack-block.Combining with the information of Block Area Ratio(BAR) and Block Rate Ratio(BRR) contained in the attack-block respectively,this paper proposes an algorithm called Mining Attack-block(MAB) to detect the attack behavior on a given rating transaction database,and uses pruning strategy based on the upper bounds of BAR and BRR to narrow space and time for searching.Experimental results on two real data sets demonstrate the algorithm can detect attack-block in different attack scenarios,and it has higher efficiency than comparing algorithm.
  • ZHANG Fengbin,YANG Ze,GE Haiyang
    Computer Engineering. 2016, 42(2): 131-136. https://doi.org/10.3969/j.issn.1000-3428.2016.02.024
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Neighborhood Negative Selection(NNS) algorithm needs to traverse the whole self-samples and leads to large amount of calculation.At the same time there are phenomena about overlap rate higher at matching stage.To address this issue,making in-depth study on NNS and clustering method,it proposes a novel neighborhood detector algorithm.The self-samples are mapped to neighborhood space and they are used to clustering.Random detectors are trained and become mature neighborhood detectors.The algorithm generates detectors by shortening the time and solving the high overlap problem.In KDD CUP 1999 data sets to evaluate the results of simulation show that,the algorithm can solve the above mentioned problems effectively and increase the detection efficiency.
  • ZHANG Hong,CAO Zhenfu,DONG Xiaolei
    Computer Engineering. 2016, 42(2): 137-141,145. https://doi.org/10.3969/j.issn.1000-3428.2016.02.025
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    As the third party payment is introduced into a Four-participants Virtual Economy System(4P_VES) to detect and prevent collusion cheat,so many interactions are added,and the system performance is affected.Aiming at the problem,this paper proposes an improved 4P_VES by commitment-signature scheme based on fusion primitive.Commitment-signature scheme realizes commitment verification and signature authentication,and simplifies the interactions.Multisignature reduces the times of signature verification.Analysis result shows that the improved 4P_VES scheme maintain the properties of unforgeability,consistency,unreusability,and it can reduce time cost,improve system overall performance.
  • FEI Xiang,ZHOU Jian
    Computer Engineering. 2016, 42(2): 142-145. https://doi.org/10.3969/j.issn.1000-3428.2016.02.026
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    D-S evidence theory is an effective method dealing with the dubious information and is widely used in the field of data fusion.There generates a wrong conclusion when using classical D-S evidence theory to handle the highly conflict evidence information.This paper introduces the concept of contradiction ratio between conflict evidences,uses the conflict information effectively and presents a new determine method for evidence weight.After that,it uses D-S evidence theory combination rules for data processing.The fusion results show the efficiency of the proposed method and provide a new way for D-S evidence theory algorithm improving.
  • PAN Daoxin,WANG Yijun,XUE Zhi
    Computer Engineering. 2016, 42(2): 146-150,156. https://doi.org/10.3969/j.issn.1000-3428.2016.02.027
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In view of Trojan’s control of the popular Advanced Persistent Threat(APT) attack’s method,this paper presents an active defense idea,namely for fuzzing and paralysis attack of closed source code Trojan.It uses generalized suffix tree and hierarchical clustering algorithm to learn characteristics of Trojan’s network traffic to construct protocol format.Then it combines Peach with this Fuzz framework,automatically generating configuration file of Fuzz test through the protocol format,so as to largely enhance efficiency of Fuzz test.After a series of tests through remote control Trojan,it successfully discovers several Trojan’s vulnerabilities,which illustrates that the remote control Trojan vulnerability mining method is a kind of innovative and effective solution.
  • ZHANG Guolin,GUAN Juhua,ZHANG Shuye
    Computer Engineering. 2016, 42(2): 151-156. https://doi.org/10.3969/j.issn.1000-3428.2016.02.028
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For the problem of perceptual distortion is too large and the high image error rate exists in steganography technology of the current information security area,an image steganography based Karhunen-Loeve Transform(KLT) optimization technology is designed.This method introduces KLT algorithm to compress the image data,instead of the encrypting data with the Least Significant Bit(LSB),and a matrix of pixel levels is introduced to obtain an effective image information.Experimental results show that this algorithm improves capacity,higher Signal-to-Noise Ratio(SNR) and smaller image data distortion,compared with the commonly used algorithms in terms of volume.
  • LIU Yisong,ZHU Dan
    Computer Engineering. 2016, 42(2): 157-163. https://doi.org/10.3969/j.issn.1000-3428.2016.02.029
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to efficiently and accurately locate semantic Web service,a new semantic Web service discovery method is proposed based on clustering and bipartite graph matching.In this method,services are clustered according to the service description information,in which Vector Space Model(VSM) is adopted to indicate the service.The K-Means algorithm based on k value optimization and Particle Swarm Optimization(PSO) optimization is proposed to resolve the two major defects of standard K-Means algorithm.Then the attributes of services’ functions are matched by optimal matching of weighted bipartite graph,and a method based on WordNet is proposed to calculate the similarity between concepts which is the weight of bipartite graphs.A new solution is proposed to build the weighted bipartite graph which meets the optimal matching criteria.Experimental results show that the proposed method is superior to OWLS-MX method on the recall and matching efficiency.
  • WANG Xuyang,REN Guosheng
    Computer Engineering. 2016, 42(2): 164-168. https://doi.org/10.3969/j.issn.1000-3428.2016.02.030
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In classical PageRank algorithm,transition probability of page is equally distributed to the outlinks.There are few links of new page,so its PR value is generally low.Classical PageRank algorithm is used to calculate the PR value through links,without taking into account the content of the page,so there is topic drift.To solve these problems,this paper introduces authoritative factor and time factor to explore the importance of Web pages,and after keywords researching,it counts the number of clicks.According to their position of initial sorted results,then iteration correcting PR value of Web page,it returns a new sorted result.The algorithm uses improved TD-IDF algorithm to slove page’s relevance by content analysis,improving the topic drift.Simulation results show that the improved algorithm can improve the quality of page ranking.A high degree of correlation of pages obtains different degrees weighted by the people choose.A weighted page is enhanced in ranking of the search results,and improves the precision of user demand pages.
  • ZHANG Zhichang,ZHOU Huixia,YAO Dongren,LU Xiaoyong
    Computer Engineering. 2016, 42(2): 169-174. https://doi.org/10.3969/j.issn.1000-3428.2016.02.031
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Automatic recognition of English lexical entailment relation has many researches,and many recognition models are presented.But study on Chines lexical entailment is not sufficient while there have many studies on English lexical entailment from different points of view.This paper proposes a recognition method of Chinese lexical entailment relation based on word vector,it uses word vector technology on Chinese Wikipedia corpora,and word is represented as word vector.Word vector based classification features are designed,and Support Vector Machine(SVM) model for Chinese noun lexical entailment classification is trained on manually created Chinese lexical entailment data set.Experimental results show that the method and designed classification features have good performance on lexical entailment relation recognition compared with traditional cosine similarity method.
  • YAO Hongliang,MA Xiaoqin,WANG Hao,LI Junzhao
    Computer Engineering. 2016, 42(2): 175-183. https://doi.org/10.3969/j.issn.1000-3428.2016.02.032
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Based on the typical M form of the block volatility,this paper puts forward a ridge regression stock market trend prediction algorithm based on causality.Stock form reflects the stock fluctuations of energy change.According to the characteristics of the fluctuations in the form of M introducing energy ideas,based on edge,peaks and troughs in the form of M nodes,it builds a Bayesian network structure model in the form of M.By using Markov blanket algorithm and asymmetric information entropy,it gets a local causal structure in the form of M.The introduction of the strength of causal metrics is introduced to the M shape causality in ridge regression model for its stock market trend prediction of the model through stock form and causation of energy fluctuations,which can effectively find the abrupt change point of the stock market.Results on real data sets show that,compared with ridge regression algorithm and radial basis neural network algorithm,the proposed algorithm has better prediction effect.

  • ZHENG Cheng,SHEN Lei,DAI Ning
    Computer Engineering. 2016, 42(2): 184-189,194. https://doi.org/10.3969/j.issn.1000-3428.2016.02.033
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper studies the problem of emotion classification in Chinese microblog texts.It introduces a novel approach based on class sequential rules for emotion classification of microblog texts.This approach obtains two potential emotion labels for each sentence in a microblog text by using an emotion lexicon and a machine learning approach respectively,and regards each microblog text as a data sequence.It mines class sequential rules from the dataset.It derives new effective features from the mined rules for emotion classification of microblog texts and other text features to train classifier.Experimental results on a COAE dataset show its validity compared with the traditional methods.
  • SHEN Xiajiong,WANG Long,HAN Daojun
    Computer Engineering. 2016, 42(2): 190-194. https://doi.org/10.3969/j.issn.1000-3428.2016.02.034
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The existence of traditional BP neural network is easy to fall into local optimum,slow convergence and other shortcomings.According to the features of global optimization and swarm intelligence of Artificial Bee Colony(ABC) algorithm,in the neural network parameter initialization,this paper uses the deviation of the neural network as a fitness of ABC algorithm,selects the best fitness of a set of parameters as a nerve power networks and thresholds.Doing so can avoid falling into local optimum neural network and slow convergence problem.The BP neural network model of ABC optimization applied to intrusion detection.Simulation results show that the network model is optimized to accelerate the convergence rate and improve the detection accuracy.
  • YAN Lina,WANG Lifang
    Computer Engineering. 2016, 42(2): 195-199,205. https://doi.org/10.3969/j.issn.1000-3428.2016.02.035
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For the disadvantage of poor local search ability of traditional Copula Estimation of Distribution Algorithm(EDA),a Copula EDA based on Centroid(CEDAC) is proposed.On the basis of traditional algorithm,it joins the centroid mutation operator to make the individual species with better information searching to the direction of the optimal solution.Through the optimination of initial weights and threshold of BP neural network,it effectively distinguishes the noise pollution pixels.Experimental results show that the optimized BP neural network classifies pixels more accurate and images present a higher Peak Signal to Noise Ratio(PSNR) after denoising through classification.
  • LIAO Ruihua,LI Yongfan,LIU Hong
    Computer Engineering. 2016, 42(2): 200-205. https://doi.org/10.3969/j.issn.1000-3428.2016.02.036
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problems that the existing face recognition methods are hard to efficiently overcome the effect of noise and error disturbance (such as illumination,occlusion,and face expression).Kernel sparse representation classification based on Robust Principal Component Analysis(RPCA) is proposed for face recognition.The training sample matrix of each class is decomposed into a 1ow-rank matrix and an error matrix by RPCA algorithm,and the redundant dictionary is constructed by these two matrices.Kernel sparse representation problem is converted to normal sparse representation problem by matrix transformation,and Orthogonal Matching Pursuit(OMP) technology is used to solve sparse representation problem to obtain sparse representation coefficients.The reconstruction error associated with the each class can be calculated by the sparse coefficients to achieve classification of the test sample.Experimental results show that,compared with Sparse Representation-based Classification(SRC),ESRC(Extended SRC) algorithms,the proposed algorithm has a higher recognition rate and it is robust to noise and error disturbance.
  • JIA Yang,LIN Gaohua,WANG Jinjun,FANG Jun,ZHANG Yongming
    Computer Engineering. 2016, 42(2): 206-209,217. https://doi.org/10.3969/j.issn.1000-3428.2016.02.037
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    An accurate candidate smoke region segmentation method using saliency-based method and Gaussian Mixture Model (GMM) for Video Smoke Detection(VSD) is proposed.According to Visual Attention Mechanism(VAM),smoldering smoke can be seen as a salient region in a video with its turbulence behavior and grayish color.A saliency-based method is used to do candidate smoke region segmentation.Saliency map is calculated using the nonlinearly enhanced luminance image and motion energy map.Suspected smoke regions are segmented from the saliency map using a motion estimation function calculated with GMM.The results are compared with those of three other methods used in the literature,revealing the proposed method has both a better segmentation result and better precision,and much faster operation speed than the existing methods.The proposed method is appropriate for real time VSD applications.
  • TIAN Jinhua,SUN Li
    Computer Engineering. 2016, 42(2): 210-217. https://doi.org/10.3969/j.issn.1000-3428.2016.02.038
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to improve the computation efficiency of the subspace clustering algorithm,this paper gives a general fault-tolerance subspace clustering definition according to the number of objects,dimensions,mode tolerance and relative threshold constraint,proves its monotonicity,and proposes a fault-tolerance subspace clustering algorithm for dealing with missing value in constrained attributes.It searches subspace grid by using depth-first strategy to delete low dimensional redundancy clustering,and avoids traversing the subspace effectively and improves the efficiency of clustering.Experimental results on real data and synthetic data show that the average speed of this algorithm improves 60% ~90% compared with CLIQUE,SCHISM clustering algorithm,and it can quickly determine the subspace clustering results even in the face of missing values,so it has higher clustering quality.
  • ZHOU Yinping,DENG Yangdong
    Computer Engineering. 2016, 42(2): 218-223. https://doi.org/10.3969/j.issn.1000-3428.2016.02.039
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Existing LEGO model automatic construction algorithms resort to stochastic optimization techniques to find the solution.Such approaches tend to be time-consuming when dealing with extremely large models.By generalizing and comparing existing research results,this paper proposes a highly efficient LEGO automatic construction algorithm.It devises a partition based top-down optimization flow,which significantly reduces the search space to speed up the arrival of convergence.It develops a delayed graph construction technique,which builds the vertical graph after pre-hollowing to expedite the pre-hollowing process.Experimental results show that,compared with the existing algorithms,the algorithm reduces the total construction time by 50%~78% and improves the efficiency.
  • WANG Wei,LIU Yang,LIU Jing,LI Ji
    Computer Engineering. 2016, 42(2): 224-228. https://doi.org/10.3969/j.issn.1000-3428.2016.02.040
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In the study about the change detection of complex land surface,the change of texture feature can reflect the characteristics of land surface in different periods.This paper focuses on the methods to detect the change of the texture features,it adopts the improved method of variogram to reinforce the texture features,and uses the Stractural Similarity of Variogram(VSSIM) to extract the texture difference in different frequency bands of multi-scale image.A fuzzy C means clustering method based on relation degree is presented to classify the differences,and the regional growth is used to optimize the classification so as to achieve the final results.Compared with traditional method such as NSCTKFCM and UDWTKMEAN in the references,experimental results show that the detect result of the method is more precise,the extracted regional edges are more clear,and the influence caused by light and noise is reduced simultaneously.
  • Pak Chun-hyok,ZHAO Hai,ZHU Hongbo,XU Jiuqiang
    Computer Engineering. 2016, 42(2): 229-235. https://doi.org/10.3969/j.issn.1000-3428.2016.02.041
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper focuses on an object segmentation algorithm based on the interactive information as the prior knowledge between user and system,and then proposes a level set object segmentation algorithm based on improved speed function.It improves speed function of Chan & Verse (CV) model by regional and contour information.The input contour is gradually close to the actual one by using gradient descent vector.Probability density model ensures all the pixels in the images approximate Gaussian probability distribution.To speed-up the convergence,it utilizes the boundary of convergence model.Experimental results show that this algorithm has the better segmentation performance and robustness than the segmentation algorithms based on CV model and Mean Square Error(MSE) level set for the images including noise and object edge blur.
  • LIU Huayong,XIE Xinping,LI Lu,ZHANG Daming
    Computer Engineering. 2016, 42(2): 236-241,248. https://doi.org/10.3969/j.issn.1000-3428.2016.02.042
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In computer aided geometric design,the representation of closed curves and surfaces usually uses the method of joint,but this method is relatively complex and has lower continuity.In order to better represent the closed curve and surface,the integration method of non Uniform Quartic Triangular Spline(UQT-spline) is proposed.Firstly UQT-spline basis functions are constructed and the properties of the UQT-spline curves based on five points are discussed,then the UQT-spline curves and surfaces are constructed by using the idea of blending curve.Experimental results show that the integration of curve and surface can well represent closed curves and surfaces with no additional control points,and are easy to interact.
  • CHEN Guodong,YE Dongwen,DANG Qiqi
    Computer Engineering. 2016, 42(2): 242-248. https://doi.org/10.3969/j.issn.1000-3428.2016.02.043
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    In a hybrid scene of local and remote rendering,in order to make the scene more realistic,a shadow rendering method is proposed based on the characteristics of simple mobile terminal scene,and strong object interaction.On the server side,a combination of improved Parallel Split Shadow Mapping(PSSM)and Percentage Closer Filtering(PCF) algorithm is used to improve the unity of the reality and real-time shadow rendering.A combination of classic Shadow Mapping(SM) and PCF algorithm is used to draw a shadow on mobile terminals.Then the integration is done on mobile terminal based on the actual relative position of the two scenes which are processed on server side and mobile side.Experimental results show that the seamless fusion of scene can be realized on the mobile terminal through the proposed method,and it brings higher efficiency when drawing graph.

  • LI Xiaojie,LI Guangxu
    Computer Engineering. 2016, 42(2): 249-253,265. https://doi.org/10.3969/j.issn.1000-3428.2016.02.044
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Groupwise surface correspondence is the crucial step to construct the Statistical Shape Model(SSM).However,the quality of the models using the equally-placed landmarks method is not sufficient.Aiming at this problem,this paper proposes a novel correspondence method using particle filte algorithm.All the 3D training surfaces are mapped to a unified spherical parameter space based on the spherical conformal mapping at first.The corresponding parts of the surfaces can be found according to the local geometric characters as well as the global structures,which can be integrated by the frameworks of particle filters.Experimental results illustrate that compared with the equally-placed landmarks method,the SSM models obtained by proposed method can perform well on the general ability and the specific ability.
  • HOU Zhanwei,JIA Yulan,WANG Zhiheng
    Computer Engineering. 2016, 42(2): 254-260,271. https://doi.org/10.3969/j.issn.1000-3428.2016.02.045
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The length and width of the irregular object is difficult to be unified in an image,and the traditional detection algorithm is not accurate enough.For this problem,this paper states an automatic location detection algorithm.In order to obtain the minimum bounding rectangle of the jewelry,firstly it estimates the target direction of the principal axis and the initial target rectangle related to the principal axis,following by finding out the optimal rectangle profile with the center of rotation formatted by the initial rectangle’s geometric center.It performs translational optimization on the rotated shape of rectangle to achieve the final positioning of the jewelry outline.Experimental results show that this algorithm is more accurate than the existing minimum rectangle algorithm MBR for the detection of irregular object in capable to locate the exact jewelry outline.
  • YAO Weixin,YANG Dan,GE Yuan
    Computer Engineering. 2016, 42(2): 261-265. https://doi.org/10.3969/j.issn.1000-3428.2016.02.046
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    It is prone to lose pocket when audio and video stream transfers in wireless channels.An adaptive temporal-spatial domain error concealment scheme based on H.264/AVC is proposed.It can adaptively select the temporal error concealment or spatial error concealment according to the change of scenes.Temporal concealment adopts temporal-spatial domain boundary matching algorithm which preserves smoothness properties and structural similarity.Spatial error concealment makes use of multi directional interpolation which is performed in three steps.First,significant edges are recovered.Second,based on the predicted significant directions,an approximation is obtained for each missing pixel.Finally,weighted average algorithm is made use to recover each pixel.Experimental results show that the technique can effectively enhance the performance of error concealment and image quality when compared with Motion Copy,JM10.2 and kung algorithms.
  • ZHUANG Yanbin,WANG Zunzhi,XIAO Xianjian,ZHANG Xuewu
    Computer Engineering. 2016, 42(2): 266-271. https://doi.org/10.3969/j.issn.1000-3428.2016.02.047
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In view of the traditional underwater video coding requiring higher underwater acoustic channel and the scenes of underwater video with uneven illumination being complex and not fixed,this paper presents a reconstruction algorithm with Three Dimension(3D) tree structure Bayesian compressive sensing for underwater video.At the encoder side,analog color coded aperture compressive temporal imaging system is used to code the video signal.At the decoding end,based on the model of Bayesian compressive sensing,by exploiting the 3D tree structure of the wavelet and Discrete Cosine Transformation(DCT) coefficients,a Bayesian compressive sensing inversion algorithm is derived to reconstruct color video frames from a single monochromatic compressive measurement.Experimental results show that the algorithm is able to reconstruct the complex video scenes accurately.
  • SUN Chengli,MU Junsheng
    Computer Engineering. 2016, 42(2): 272-277,282. https://doi.org/10.3969/j.issn.1000-3428.2016.02.048
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A subspace speech enhancement approach is proposed for a better reconstructed speech quality.On the basis of Generalized Eigenvalue Decomposition(GEVD) subspace approach for speech enhancement,speech quality is improved by eigenvalue substitution.The study shows that after the generalized eigenvalue decomposition for the covariance matrices of the clean speech signal and the noise,the larger eigenvalue component contains the main information of speech signal,while the smaller eigenvalue component contains noise information.After the eigenvalue ordering,the smaller eigenvalue and its corresponding eigenvectors are replaced with the larger ones so that there is a better enhanced speech signal and the correlation of the speech frame can be improved greatly.Compared with other subspace methods,the proposed method can restrain strong noise more effectively,and get a higher signal noise ratio.
  • LI Liangkai,XU Qing,LUO Xiaoxiao
    Computer Engineering. 2016, 42(2): 278-282. https://doi.org/10.3969/j.issn.1000-3428.2016.02.049
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to summarize the main content of a video sequence quickly and effectively,this paper proposes a new method for extracting video key frames.The proposed technique makes use of Jensen-Tsallis distance to estimate the frame-by-frame distance between consecutive video images,to segment a video into shot,and into subshot either with or without large change of the video content.Video key frames are selected based on the subshot.It also proposes a measure for the difference between video frames to adaptively set an optimal index used for Tsallis entropy.Experimental result shows that the novel method is simple yet effective,and has better ability to identify the moving objects.
  • WANG Fengsui,YANG Huicheng,WANG Guanling,HAN Chao
    Computer Engineering. 2016, 42(2): 283-286,292. https://doi.org/10.3969/j.issn.1000-3428.2016.02.050
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to solve greatly computational complexity in Multi-view Video Coding(MVC),a fast prediction algorithm is proposed based on inter-view correlation for multi-view video coding.This method computes the Rate istortion(RD) cost of the Direct mode and compares its RD cost with an adaptive threshold as an efficient early termination scheme.If this RD cost is smaller than the adaptive threshold,the Direct mode is selected as the optimal mode and the mode decision process is early terminated.Otherwise,motion complexity is used to divide the current macroblock into different motion types.And only assigned modes are checked for each macroblock,and the unnecessary mode checking process can be early terminated.Experimental results show that the proposed algorithm can significantly reduce the computational load for MVC,while keeping almost the same coding efficiency.
  • LIAN Yueyong,ZHANG Chao,LI Qiang
    Computer Engineering. 2016, 42(2): 287-292. https://doi.org/10.3969/j.issn.1000-3428.2016.02.051
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In view of the defect existed in the time synchronization of Local Area Network(LAN) using hardware and software methods,this paper introduces the principle of time synchronization in LAN and the method of robust estimation.The model of time comparison is established.A new method for time synchronization in LAN using the robust estimation method is proposed,and uses the clock retaining strategy to save the overhead of CPU.The least squares adjustment method and the robust estimation method are respectively used for measuring data processing to analyze the accuracy difference.Experimental results show that the synchronization method has the advantages of simple hardware configuration with high synchronization precision,and it effectively restrains the influence of network delay while keeping the good stability of system.
  • HU Peng,SHEN Jianjing,TAO Linbo
    Computer Engineering. 2016, 42(2): 293-299. https://doi.org/10.3969/j.issn.1000-3428.2016.02.052
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Syntactic and semantic composition has problem in achieving the integrity,validity and practicability of simulation component composition.In view of this,this paper analyzes pragmatic composition and simulation context,and proposes the formal definition of Simulation Context Space(SCS) as well as the approach of static pragmatic composition verification based on SCS matching index calculation,including concept semantic matching index and value matching index.It analyzes the features of the Extended Finite State Machine(EFSM),and designs the formal description of Simulation Component Model(SCM) including context constraint based on EFSM.It develops the mapping between SCM and Color Petri Net (CPN) model,so the dynamic pragmatic composition verification of the composed model can be done by CPN Tools.Application result of the static and dynamic analysis of the simulation component composition shows that,it can provide quantifiable,intuitive basis for component discovery,model optimization,and composition verification on pragmatic level.

  • HAN Daojun,GAN Tian,YE Manman,SHEN Xiajiong
    Computer Engineering. 2016, 42(2): 300-306. https://doi.org/10.3969/j.issn.1000-3428.2016.02.053
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To solve these problems during traditional ontology construction like relying on artificial,wasting time and energy,subjective interference,lack of latent concept extraction and so on,researchers propose methods of ontology construction based on Formal Concept Analysis(FCA).According to the structure level of data resource using in ontology construction,these methods are divided into three classes:methods based on structured resource,methods based on unstructured resource,combine ontology construction based on different structure resource.This paper analyses a series of representational methods of these three classes respectively about their advantages and disadvantages,and finds that there is big improvement space on the choice between objects and attributes as well as making context aiming at different language combined with the constrction of the specific application domain.
  • ZENG Xianliao,LI Wei
    Computer Engineering. 2016, 42(2): 307-311. https://doi.org/10.3969/j.issn.1000-3428.2016.02.054
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The twice position nested uniform linear array configuration is proposed to eliminate the localization ambiguity and improve the localization accuracy.In the first localization,array elements spacing is not greater than the minimum half wavelength of speech signals.The second localization is depend on the previous results,using the array elements spacing larger than previous for precise localization.Moreover,as the utilization of near-field acoustic source 3D MUSIC algorithm with high resolution results in high computing complexity,wideband focusing algorithm is adopted to make the delay time being reduced greatly.Simulation results show that this scheme has better localization effect than that of non-nested localization algorithm.
  • YAN Lihui,SHI Changqiong,CHEN Rong,CHEN Yinghui,ZOU Qiang
    Computer Engineering. 2016, 42(2): 312-315. https://doi.org/10.3969/j.issn.1000-3428.2016.02.055
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Aiming at the collision problem of Radio Frequency Identification(RFID) multi-tag identification system,the multi-cycle collision tree algorithm for RFID tag identification based on parity packet is proposed.It divides all the identification tags into two groups according to the parity by the sum of each tag’s bits in order to reduce the probability of collision.After making use of odd group or even group and the respond of the first bit either 0 or 1,it can be divided into two sub periods in response to reader queries.Using the feature of binary either 0 or 1 and properties of parity,two collision bits can be identified by the reader in one time.Mathematics analysis and simulation results show that the proposed algorithm can reduce the times of reader request and improve recognition efficiency,compared with Collision Tree(CT),Query Tree(QT) and Binary Search(BS) algorithms.

  • CAO Jing,SUN Changning,ZHANG Ruimei,SONG Zhigang,LIU Haiming
    Computer Engineering. 2016, 42(2): 316-321. https://doi.org/10.3969/j.issn.1000-3428.2016.02.056
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Because of the uncertainty factors such as test condition,the variability of soil properties,soil sampling methods,sample disturbance and so on,test results of soil parameters obtained by field test have the discreteness.And results obtained by laboratory test have some difference with in-situ soil properties.This paper puts forward a kind of back analysis algorithm of soil parameters.The measured targets are selected.Combining with uniform test and non-parametric regression,the efficient response surface between soil parameters and the measured targets is established.The calculated values of targets are obtained by calculating soil parameters samples enumerated in the definite range for each working condition.Considering the measurement uncertainty of the target values,the calculated values are screened by combining with the variable tolerance method according to the measured target values and the order of working conditions.The ranges of soil parameters that correspond to the qualified calculated values are obtained.A foundation pit engineering example is used to show the feasibility of the algorithm.