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

05 April 2011, Volume 37 Issue 7
    

  • Select all
    |
    Networks and Communications
  • LIU Ji-Lie, CHU Meng-Wei, HUANG Wei, TANG Li-Jun, LI Yun, BO Yang-Dun
    Computer Engineering. 2011, 37(7): 1-3. https://doi.org/10.3969/j.issn.1000-3428.2011.07.001
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The wireless link characteristic has an important influence on the performance of the opportunistic network. So it is necessary to study the characteristics of wireless link of the opportunistic network. In this paper, according to statistical analysis and numerical methods, the link statistical characteristic in the real opportunities network is analyzed from the contact times of the nodes. The distribution function and the rules with changes of the contact duration of the nodes are gotten through the curve fitting, and are simulated through Matlab. Results show that the probability distribution of the contact duration of wireless link is as the law of exponential distribution.
  • GUO Zhi-Jiang, YANG Jie, JIAO Hui-Fang
    Computer Engineering. 2011, 37(7): 4-6. https://doi.org/10.3969/j.issn.1000-3428.2011.07.002
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem that Two-Dimensional Locality Preserving Projections(2DLPP) only in the horizontal direction of the image data compression and feature’s dimension is high, an Alternative Two-Dimensional Locality Preserving Projections(A2DLPP) method is given, and Two-direction data compression Two-Dimensional Locality Preserving Projections((2D)2LPP) is proposed. The algorithm executes 2DLPP separately from both horizontal and vertical directions, so that the image of the horizontal and vertical dimensions is an effective reduction. Experimental results show that both the recognition rate and recognition time of (2D)2LPP are better than 2DLPP and A2DLPP.
  • MA Bo, YANG Ya-Ting, ZHOU Chi, HU Bin-Hua
    Computer Engineering. 2011, 37(7): 7-9,17. https://doi.org/10.3969/j.issn.1000-3428.2011.07.003
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In informatization evaluation, traditional Associative Classification(AC) algorithms can not give priority to find short rules and the classification accuracy highly depends on the sequence of the rules. To solve these problems, this paper proposes a new AC algorithm based on sub-support and multi-rules. The training set is classified according to the attribute of the class, and associative rules are found by comparing the sub-support, the test set is classified by calculating the average support of the rule set. Experimental result shows that the new algorithm has stronger ability on finding rules and higher classification accuracy than traditional methods.
  • LIU Dong, GENG Wei-Yan, DIAO Zhong-Wen, WANG Zhi-An
    Computer Engineering. 2011, 37(7): 10-11,20. https://doi.org/10.3969/j.issn.1000-3428.2011.07.004
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Since the known Cut Sequence Set(CSS) model has to face large complexity, the paper provides two modularization methods, namely the modularization of static sub-trees and dynamic sub-trees. Dynamic Fault Tree(DFT) can be partitioned into several static sub-trees and dynamic sub-trees. For a static sub-tree, Binary Decision Diagram(BDD) is used to compute its probability. For a dynamic sub-tree, CSS model is used to analyze it. If a static sub-tree exists in a dynamic sub-tree, it is treated as a whole. An example is used to illustrate the applications of the simplification methods. The analysis results show that the provided methods can decrease the computational complexity of CSS model.
  • LIN Yong-Gong, SUN Yu-Ai, LV Zhen
    Computer Engineering. 2011, 37(7): 12-14,23. https://doi.org/10.3969/j.issn.1000-3428.2011.07.005
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    It is difficult to find small community in complex network. Aiming at this problem, this paper presents a community detection method using local information based on CNM algorithm. Several measures are adopted such as the definition of both the vertices strength and the vertex’s contribution to community, the improvement of modularity of community structure making the method useful for weighted network, and the calculation of small community set with local information of community. It uses the small community to set as the input of CNM algorithm, the method gets the result by computing the increment of modularity among small communities and merging the small communities with minimum increment. Experimental results show that the modularity of community structure found by the method and the algorithm efficiency are higher than the state-of-the-art algorithms.
  • LI Wei, FAN Beng-Yi
    Computer Engineering. 2011, 37(7): 15-17. https://doi.org/10.3969/j.issn.1000-3428.2011.07.006
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper introduces an overview of the applications of network coding in wireless relaying networks. Two typical scenarios of wireless network coding are two-way relay networks and multicast retransmission networks. Some key problems of network coding in wireless relaying networks are as follows: (1)Design implementations of wireless network coding; (2)Analyze the capacity of network coding and the corresponding transmission schemes in actual network environments; (3)Investigate how to separate the required signal from the mixed signal for physical layer network coding. Future work on network coding is also summarized.
  • ZHANG Hui-Ling, SUN Jian, SHAO Hai-Feng
    Computer Engineering. 2011, 37(7): 18-20. https://doi.org/10.3969/j.issn.1000-3428.2011.07.007
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper validates the HCM2000 delay model at the normal traffic condition using 1 cycle as the duration analysis period. The precision of the HCM 2000 delay model is tested using the t-test method. The saturation, geometry parameter and the start-up loss time parameters in the model are analyzed. Bayesian inference and Markov Chain Monte Carlo(MCMC) simulation are used to revise the models parameters. The method can improve the model’s precision when using 1 cycle as the duration of analysis period.
  • GUO Wen-Hua, YANG Wei, DAN De-Gan
    Computer Engineering. 2011, 37(7): 21-23. https://doi.org/10.3969/j.issn.1000-3428.2011.07.008
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes an asynchronous sequential track fusion algorithm for maneuvering target tracking. The fusion center includes one CV fusion model and one CA fusion model. Both models implement asynchronous track fusion based on the information decorrelation method, and avoid fusion divergence by adjusting the process noises. The maneuvering detection is implemented by the significance test of the acceleration estimates of the CA model. If the maneuver is detected, the fusion result of CA model is output, otherwise fusion result of CV model is output. Simulation results show that the algorithm can track the maneuvering target stably and has higher tracking precision.
  • CHEN Yu, SHU Jian-Feng, TUN Yi-Jian, DIAO Wen-Yun
    Computer Engineering. 2011, 37(7): 24-27,43. https://doi.org/10.3969/j.issn.1000-3428.2011.07.009
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A method for new term expansion based on domain ontology is proposed. This method combines linguistic rules and statistical methods to get the infection degree from a word to a document. It optimizes the term candidate result, uses domain ontology to recognize concept in document and to calculate correlation degree between word, document and specific domain. The validity of the method is proved with a practical case.
  • ZHANG Zhi, ZHANG Lin, CENG Qiang-Kai
    Computer Engineering. 2011, 37(7): 28-30. https://doi.org/10.3969/j.issn.1000-3428.2011.07.010
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents two points of improvements for model checking temporal safety properties of program: more efficient model checking algorithm is proposed, which can simplify the checking process and reduce the time cost by extending the state machine model with each function. Alias analysis is used to determine the dataflow dependency between safety operations, which makes the checking process more accurate. Experimental results show that the method can work more efficiently and exactly.
  • WEI Jian-Guo, PENG Li-Wei, ZHANG Xiao-Yu, WANG Jian-Lin, ZHONG Hai-Yun
    Computer Engineering. 2011, 37(7): 31-34. https://doi.org/10.3969/j.issn.1000-3428.2011.07.011
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the characteristics and the lack of agro-meteorological applications software adaptability, this paper sums up variables and the change features of agro-meteorological software. It applies parameter adapttive method and combination adaptive method to agro-meteorological applications designed adaptive model. From the operating system layer, data layer, the system component level, advanced function layer model discussion platform choice and adaptive model and gives practical ideas and methods to solve. Combined with the application of business practices to achieve the separation of aggregate function and system framework, to achieve the data changes to the parameters of the transformation. Business changes into changes in parameter variations and combinations to reduce costs and change the software to change the scope of agro-meteorological applications enhanced adaptability to the environment.
  • XUE An-Rong, WANG Fu-Jiang, LI Meng-
    Computer Engineering. 2011, 37(7): 35-37. https://doi.org/10.3969/j.issn.1000-3428.2011.07.012
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Some existing algorithms for mining Maximal Frequent Itemset(MFI) limit in scanning data sets frequently and tremendous candidate set size, etc. Based on Iceberg concept lattice model, this paper presents a maximal frequent itemsets mining algorithm——Iceberg Concept Lattice Maxmal Frequent Itemset Algorithm(ICMFIA) in the Iceberg concept lattice. The algorithm builds the Iceberg concept lattice through scanning the data sets at a time, by using the coverage relationship between frequent concepts in the Iceberg concept lattice, it can quickly calculate the maximum frequent concepts corresponding to the maximum frequent itemsets. The intension of all maximal frequent concepts is the set of all maximal frequent itemsets. Experimental results show that ICMFIA algorithm outperforms other existing algorithms in the number of scan data sets and mining efficiency.
  • ZHANG Xiao-Min, LIN Ai-Hua
    Computer Engineering. 2011, 37(7): 38-40. https://doi.org/10.3969/j.issn.1000-3428.2011.07.013
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Size estimation is the basis of project estimation. However, no effective solution is proposed with respect to the size estimation in an Service-Oriented Architecture(SOA) environment. This paper explores the application of the full function point method in estimating the size of an SOA system. Based on the research on the full function point method and Business Process Modeling Notation(BPMN), the mapping rules are defined and the estimation step is given, with an example explaining the estimate process.
  • LIU Wen-Ting, GAO Jian-Hua
    Computer Engineering. 2011, 37(7): 41-43. https://doi.org/10.3969/j.issn.1000-3428.2011.07.014
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    An approach to speeding up state-space exploration of object-oriented programs is proposed in this paper. State-space exploration is the essence of software test. A key issue in exploration is handling the program state. The fact is exploited that many execution paths in state-space exploration partially overlap. The advanced execution simultaneously operates on several states and shares the common parts across the executions, separately executing where the executions differ. The advanced execution is implemented in Java Path Finder(JPF), an explicit-state model checker for Java programs. Results show that the advanced execution significantly reduces the time for state-space exploration.
  • BO Yang, MA Man-Fu, NIU Ceng-Han
    Computer Engineering. 2011, 37(7): 44-46,49. https://doi.org/10.3969/j.issn.1000-3428.2011.07.015
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Most of fails in schedule algorithm based on QoS parameters is due to the QoS parameters miss, so the system is not very robust. According to some QoS parameters’ accumulative property, it can achieve fault-tolerance between tasks. Based on the user preference, this paper analyzes the QoS parameters and a parameters fault-tolerance schedule algorithm as to time and cost is proposed. The algorithm can improve success rates of implementing task on the base of not increasing cost, and meets the user preference. Experimental results show that the fault-tolerance on QoS parameters can improve the reliability of schedule.
  • SONG Wei, CHEN Jian-Xiong, YANG Gen-Xin, CA Li-Zhi
    Computer Engineering. 2011, 37(7): 47-49. https://doi.org/10.3969/j.issn.1000-3428.2011.07.016
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In this paper, a function testing size estimation model based on function point analysis is proposed. The model applies to black box testing, and can be used in system test and acceptance test. Its basic steps are: define test scope, estimate software size, define size factor, and calculate test points. The model is applied in some function test projects. The applications indicate that this model can be used to estimate the size, and bring positive effect to software test.
  • DIAO Xiao-Bing, E Xu, LI Ke, LI Yan-Gong, WANG Quan-Tie
    Computer Engineering. 2011, 37(7): 50-52,55. https://doi.org/10.3969/j.issn.1000-3428.2011.07.017
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper defines a concept of attribute significance based on the granular fineness, and uses the significance as the inspiration for attribute reduction. From the original uncertainty information systems, a space of granular based on equivalence relation of rough sets is defined. This method greatly reduces the space occupied by the original system to avoid duplication of the calculation object. And the computation scale can be decreased.
  • LONG Wen-Meng, BANG Dui-Liu, JIANG Xin-Long
    Computer Engineering. 2011, 37(7): 53-55. https://doi.org/10.3969/j.issn.1000-3428.2011.07.018
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the analysis of the user roles, this paper uncovers one reason of the disadvantage of PageRank–based searching engines, that is, lack of the evaluation of the pages’ importance from the point of view of all the roles. A comprehensive page ranking algorithm——ComPageRank(CPR) is proposed. The algorithm takes account the evaluation of all the roles. In addition, a Click-ThroughRank(CTR) algorithm is developed to analyze the click-through. Experimental results show that CPR is more comprehensive and reasonable compared with the PageRank-based algorithms.
  • TUN Chang-Zhi, GOU Beng-Zhang
    Computer Engineering. 2011, 37(7): 56-58,61. https://doi.org/10.3969/j.issn.1000-3428.2011.07.019
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper expounds the basic conceptions of the rough set theory and information entropy. In order to find the effective approach of attribute reduction, an algorithm of attribute reduction based on rough set and information entropy is put forward. In decision table, a size of mutual information caused by an attribute reflects on the attribute significance, and gets the relative reduction. The studies show that the algorithm not only can get the optimal decision rules, but also can greatly decrease search space that the information system requires, and get more perfect attribute reduction effect.
  • CHEN Fu-Jiang, XI Jian-Qing
    Computer Engineering. 2011, 37(7): 59-61. https://doi.org/10.3969/j.issn.1000-3428.2011.07.020
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper brings forward a new data compression technology: condensed cover quotient cube, this technology shrinks the volume of quotient cover cube by omitting contained base single tuples. Algorithms for generating and quering of condensed quotient cover are provided. Experimental result shows that the count of records in condensed quotient cover cube is only 62% of the original quotient cover cube, which validates the efficiency of this technology.
  • WANG Huo, TAN Shu-Qiu, LIU E-Hui
    Computer Engineering. 2011, 37(7): 62-64. https://doi.org/10.3969/j.issn.1000-3428.2011.07.021
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Bayesian network structural learning plays a very important role in the processing of Bayesian network’s construction, and an effective structural learning algorithm is the base of constructing the optimum Bayesian network. An algorithm of Bayesian network structural learning(called MIBNS) based on mutual information is proposed. The algorithm can give the concealed dependency relationships among data attributes, and make dimension reduction at the right moment, which can improve the performed efficiency and ensure the accuracy rate. Experimental result shows that the algorithm is effective. Compared with the SGS, the algorithm of MIBNS is more effective in the similar results.
  • NIU Ceng-Han, MA Man-Fu, BO Yang
    Computer Engineering. 2011, 37(7): 65-67. https://doi.org/10.3969/j.issn.1000-3428.2011.07.022
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the subjectivity of trust evaluation of grid resources, a model of resources trust audit is introduced. The method of exception judgment to the trust evaluation value of resources is introduced, based on the judgment, exception results are traced, and the main factor on every exception value are found. The audit feedback to trust evaluation model is provided. The audit algorithm is described based on the model. The model reduces the influence of biased evaluations to resource by some users and makes trust evaluation value reflect the QoS of resources more exactly, which makes the users make right choices. Experimental results show that the audit model can improve the utility rate of resources, ensure the success rate of scheduling, reduce the average completion time of the task, and improve the stability of system.
  • CUI Meng-Lu, WANG Chi-Jiang, LIU Wei
    Computer Engineering. 2011, 37(7): 68-71,96. https://doi.org/10.3969/j.issn.1000-3428.2011.07.023
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    An art of satellite-to-ground single-photon communication full-link simulation system with Monte Carlo method is introduced aiming at the present research on satellite-to-ground single-photon communication and complicated system’s characters. Accurate statistical results are obtained by constructing satellite-to-ground single-photon communication system based on OMNeT++ and simulating with Monte Carlo method. Various of factors in the simulation are considered to estimate performance and key parameters of the system synthetically and accurately. It supports to design and optimize the system and verifies the usability of the Monte Carlo method in such systems.
  • GUO Xiao-Lei, YANG Shou-Bao, HE Wei-Qing
    Computer Engineering. 2011, 37(7): 72-74,102. https://doi.org/10.3969/j.issn.1000-3428.2011.07.024
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a multi-path routing protocol Cross-layer Load Balance Routing Protocol(CLBRP). Through analyzing MAC packet transmittal, CLBRP can get the quality of links. In further, CLBRP makes reasonable packet dispatch and takes an instant action to face the congestion. Simulation of CLBRP on NS2 is made, and it indicates CLBRP has a good performance on load-balance, congestion avoidance, decreases client delay, and justice.
  • WANG Yu-Chi, XIE Wei-Kai
    Computer Engineering. 2011, 37(7): 75-77. https://doi.org/10.3969/j.issn.1000-3428.2011.07.025
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the lackness of large-scale study of users’ network access condition in China, this paper conducts a large-scale measurement study of residential broadband access conditions by examining more than 1 700 broadband hosts. Based on the data, it finds that the probability to build a reliable connection between two peers in the P2P network is 95.7%. It also analyzes the actual effectiveness of P2P services deployed in the wild. According to the analysis, it gives some guidelines for operators of P2P services to make a successful deployment of such services in China.
  • LIN Chao, LAN Ju-Long, HU Gong-Chao
    Computer Engineering. 2011, 37(7): 78-80. https://doi.org/10.3969/j.issn.1000-3428.2011.07.026
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    As most Combined Input and Crosspoint Queuing(CICQ) scheduling algorithms are disigned without sufficiently making use of cross-point buffer state information, a CICQ State Heap Scheduling(CSHS) algorithm is proposed. This algorithm runs in a distributed manner at each input port and output port. Simulation results show it can achieve the similar performance as Output Queuing(OQ) does and can get high delay performance both under uniform and nonuniform traffic.
  • TANG Meng-Na, XIONG Wei-Li, XU Bao-Guo, WANG Yue
    Computer Engineering. 2011, 37(7): 81-83,86. https://doi.org/10.3969/j.issn.1000-3428.2011.07.027
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper uses wireless sensor nodes instead of micro-jammer to get the approximate number of the nodes from the point of the node selection and power allocation, and establishes a model for the optimal allocation of jamming resource because of the limited nature of the energy for Wireless Sensor Network(WSN). The aim is to achieve the jamming effect through using the least jamming resources, extend the life cycle of the WSN as far as possible at the same time. Simulation results show this method is effective.
  • FAN Xun-Li, ZHENG Feng, Lin GUAN
    Computer Engineering. 2011, 37(7): 84-86. https://doi.org/10.3969/j.issn.1000-3428.2011.07.028
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper studies the relationship between the changing rate of drop probability and the queue stability, and specifically researches computing function of dropping probability of Adaptive Random Early Detection(ARED) algorithm and Random Exponent Marking(REM) algorithm respectively. As a result, a Non-Linear Adaptive Congestion Control Algorithm(NLACCA) is proposed. Based on the Active Queue Management(AQM) scheme, which provides a non-linear adaptation to the dropping probability function of the ARED, NLACCA enables the dropping probability gradient to vary along with the deviation that is between the instantaneous queue length and the target queue length. NLACCA can not only reduce the jitter of the target queue length, but also improve the stability of the algorithm. Simulation results demonstrate that the NLACCA algorithm outperforms in most scenarios, such as the jitter of queue length, delay, and packets dropped.
  • DIAO Guo-Feng, LEI Yu-Ai, XU Chuan
    Computer Engineering. 2011, 37(7): 87-90. https://doi.org/10.3969/j.issn.1000-3428.2011.07.029
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper designes a specific network measurement and data storage to solve the packet loss and massive data storage in gigabit network traffic collection, including adding fast matching algorithm in TCP/IP stack of the linux kernel, distributing multi-server collection mechanisms and multi-grain aggregates of massive data storage. This system achieves the expected degsign objective by operator’s real-time test.
  • ZHANG Gao, LI La-Yuan
    Computer Engineering. 2011, 37(7): 91-93,111. https://doi.org/10.3969/j.issn.1000-3428.2011.07.030
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyzes LEACH protocol, pointing out the shortcomings in the selection of cluster heads and communication between cluster heads and base station. For the lack of LEACH, it starts form balancing energy consumption and saves energy, proposes an improved LEACH protocol named LEACH-EB. Simulation results show LEACH-EB can effectively save energy, balance energy consumption and prolong the network life cycle.
  • CHEN Xiao-Long, ZHANG Yun, TIAN Xi-Jiang, LIU Chi
    Computer Engineering. 2011, 37(7): 94-96. https://doi.org/10.3969/j.issn.1000-3428.2011.07.031
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the parameter selection problem of FAST TCP preferences selection scheme, the FAST TCP network congestion control model which includes the window update period parameter and the exponent filter element is established, and the stability of this model is analyzed with Routh-Hurwitz stability criterion. An improved preferences selection scheme is proposed to ensure the FAST TCP network stability according to the controller gain parameter, the window update period, and the network relevant parameters. The theoretical computation and the simulation results demonstrate that this improved scheme possesses more accurate select ranges in contrast to other related scheme.
  • OU Yang-Xiang-Jing, CHEN Shu-Xin, BAO Rong-Wei, ZHANG De-Chun
    Computer Engineering. 2011, 37(7): 97-99. https://doi.org/10.3969/j.issn.1000-3428.2011.07.032
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyzes the transfer characteristic of the mobile communication channel on nearby space, including multipath fading, shadow effect and Doppler effect. On the basis of GWSSUS model, it proposes near space communications model of the channel. According to the state of flight, long-distance, short-range and over the top models are respectively built up. The bit error rate of the three flight states are simulated. Simulation results show that the model is able to reflect a more realistic approach of space communication channel characteristics.
  • LV Ying-Ying, MU Ling-Ling, LI Xiang-Li
    Computer Engineering. 2011, 37(7): 100-102. https://doi.org/10.3969/j.issn.1000-3428.2011.07.033
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    On the basement of research on the Fast handover for Mobile IPv6 protocol(FMIPv6), this paper proposes an improved scheme of fast handover which is based on multi-tunnel. Through improvement of the fast handover procedure and introduction of the tunnel status and life cycle management mechanism, this scheme can avoid forecasting the handover information of mobile node, decrease the effects caused by the moving speed of mobile node and reduce the spending of signaling that is from ping-pong movement. Simulation results show that the fast handover scheme based on multi-tunnel has good performance.
  • LONG Ji-Zhen, CHEN Yuan-Chao, DENG Dong-Mei, LI Bin, LI Fang
    Computer Engineering. 2011, 37(7): 103-105. https://doi.org/10.3969/j.issn.1000-3428.2011.07.034
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    On the basis of LEACH, this paper proposes an assistant cluster head clustering algorithm. In Wireless Sensor Network(WSN), according to the cluster head node’s geographical location, remaining members of the cluster energy and the number of nodes in the cluster, the algorithm can dynamically determine whether to generate assistant cluster head and choose appropriate nodes in it, thus reducing the energy consumption of cluster head communication, while addressing some of the cluster head and base station communications. Simulation results show that this algorithm can effectively reduce the energy consumption, and extend the network lifetime.
  • LIU Xiao-Qian, YU Hou-Jiang
    Computer Engineering. 2011, 37(7): 106-108. https://doi.org/10.3969/j.issn.1000-3428.2011.07.035
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper compares the advantages and disadvantages of additive increase and multiplicative decrease control mechanism and proportional fair schedule on TETRA trunked network, and it finds that the additive increase and multiplicative decrease scheme of TCP can degrade QoS performance of TETRA trunked system. For solving this problem, it puts forward a new TETRA trunked queue management method, and designs a queue management counter based on dynamic starting mechanism to manage queue based on average channel quality. The effectiveness of the method on TETRA trunked network is demonstrated by simulation.
  • WANG Shuang, YU Ji-Guo
    Computer Engineering. 2011, 37(7): 109-111. https://doi.org/10.3969/j.issn.1000-3428.2011.07.036
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problems of redundant query messages and long search delay on rare resources in LightFlooding, this paper proposes a hybrid search method which combines unstructured P2P search with bidirectional Chord ring. Based on the k-walker random walk, it utilizes the node heterogeneity to modify the query request-forward manner by considering the ability of neighbor nodes. Resources that can not be found by unstructured P2P search are searched along bidirectional Chord ring. Simulation results show that the method has better performance on redundant query messages and search delay on rare resources compared to LightFlooding.
  • LIAO Meng-Hua, ZHANG Hua, WANG Dong
    Computer Engineering. 2011, 37(7): 112-114. https://doi.org/10.3969/j.issn.1000-3428.2011.07.037
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to reduce the energy of clustering in Low Energy Adaptive Clustering Hierarchy(LEACH), this paper proposes an improved cluster-head election algorithm namely Election of Cluster Heads in the Cluster(LEACH-ECHC). If the residual energy of each cluster-head is lower than the given threshold, cluster-head election is done in the whole network. If the cluster-head’s residual energy is lower than the average residual energy, the election is done in the cluster. And the selection method of the threshold for electing cluster-head is optimized. Simulation results demonstrate that LEACH-ECHC has better energy efficiency, prolongs network lifetime, and makes node energy consumption more balanced.
  • XIE Chuan
    Computer Engineering. 2011, 37(7): 115-117. https://doi.org/10.3969/j.issn.1000-3428.2011.07.038
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problems of Cluster-Tree algorithm that cluster head node demands high energy and the routes selected between nodes is not optimal in ZigBee, this paper proposes an advanced method for forming the cluster head nodes resulting from node energy and neighbor table and a method for finding the best route resulting from AODVjr algorithm. Simulation results indicate that the advanced algorithm can effectively improve the success rate of packet transmission, cut down the hops between the target and the source node, reduce the end-to-end packet transmission delay, and enhance the network value.
  • TANG Quan, GAO Zhi-Jiang
    Computer Engineering. 2011, 37(7): 118-120. https://doi.org/10.3969/j.issn.1000-3428.2011.07.039
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    By researching four classical Combined Input and Crosspoint Queued(CICQ) scheduling algorithms, this paper proposes a high- performance scheduling algorithm called LQF_DRR. It uses Longest Queue First(LQF) scheduling strategy at the input ports and Dynamic Round Robin(DRR) strategy at output ports. The cooperation between input and output scheduling makes the long queues have a prior to be serviced, which improves the performance of switch fabric. Simulation result shows that LQF_DRR exhibits good delay performance and stability under any admissible traffic.
  • LI Jun, HUANG Lan, WANG Zhong-Xi
    Computer Engineering. 2011, 37(7): 121-124. https://doi.org/10.3969/j.issn.1000-3428.2011.07.040
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    By analyzing ZigBee compliant Z-Stack 1.4.3 release, this paper obtains the periodic data from Wireless Sensor Network(WSN). Setting the sleep conditions properly not only minimizes the energy consumption but also satisfies synchronization of WSN. Energy efficient WSN are constructed with tree topology and the management software is developed to provide the function of displaying of dynamic data of sensors and energy of nodes, monitoring the network topology, etc. Application results show the system can run reliably under the condition of low power consumption and realize the monitoring of environmental data.
  • SHU Ru-Zhen
    Computer Engineering. 2011, 37(7): 125-126,129. https://doi.org/10.3969/j.issn.1000-3428.2011.07.041
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Based on ID-based proxy re-signature, an ID-based bidirectional threshold proxy re-signature scheme without random oracles is presented, and its security in the standard model is proved. The analysis result shows that it is robust and secure against existential forgery under the adaptive chosen identity and message attacks. The length of public parameters of the scheme is shorter than that of previously known ID-based bidirectional threshold proxy re-signature scheme in the standard model, and the security of the scheme is tightly reduced to the security of the q-Strong Diffie-Hellman(q-SDH) problem.
  • DIAO Fu-Xiang, LONG Liao-Jun, WANG Yo-Min
    Computer Engineering. 2011, 37(7): 127-129. https://doi.org/10.3969/j.issn.1000-3428.2011.07.042
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To solve the problems of hard to maintain system and manage key in practical applications of the full disk encryption mode, this paper puts forward a full disk encryption scheme based on logic password lock by using the generation key structure of two-layer based on password lock. Techniques of dynamic group key and secret splitting and threshold access for security parameters are applied in the scheme, so the scheme achieves respective accesses by multi-users and free storage disk key. Theory analysis and experimental results show that the scheme has higher security and its performance is better than its counterparts.
  • TUN Heng-Xu, CHEN Kai-Ya, DENG Gao-Meng, JU Cheng
    Computer Engineering. 2011, 37(7): 130-132,135. https://doi.org/10.3969/j.issn.1000-3428.2011.07.043
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper goes on modeling attack to chips by using power consumption side channel leak signal with the idea of reverse engineering and the method of Side Channel Attack(SCA), selects the effective instruction power consumption path to establish side channel template for instructions, and proposes partitioning method for instruction class. The single cycle and single-byte side channel template analysis against the instructions executed in a microcontroller AT89C52 validates the effective of the instructions reversing.
  • HAN Qiu-Jun, DING Yue-Wei
    Computer Engineering. 2011, 37(7): 133-135. https://doi.org/10.3969/j.issn.1000-3428.2011.07.044
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In Software-as-a-Service(SaaS) mode, for the application and security issues of the authentication protocol, this paper proposes a new authorization scheme, raises an improved OTP technology. It transfers the hash result for user password by encrypting on the network that only can decrypt by the server private key, and it implements the two-way authentication between the client and the server. It can improve the security of the authentication system, and adopts the SVO logic formal analysis to validate the results of this protocol.
  • BANG Chao, DOU Mo-Feng, QU Yong-Hua
    Computer Engineering. 2011, 37(7): 136-138. https://doi.org/10.3969/j.issn.1000-3428.2011.07.045
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the actual trust need in Collaborative Decision Support System(CDSS), this paper proposes a trusted decision model. In order to ensure the decision is trusted, the trust model evaluates the trust value of decision participants and decision results by evaluating entities’ action and actual decision tasks. It realizes comprehensive methods of trust value computation, such as direct trust value computation, recommendation trust value computation and decision task familiarity value computation. The trust model evaluates the subjective trust using numerical value that provides objective and reliable methods to make security decision for CDSS system.
  • TU Yong-Gong, BAI Wen-Yang
    Computer Engineering. 2011, 37(7): 139-141,159. https://doi.org/10.3969/j.issn.1000-3428.2011.07.046
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Previous outsourced database server based on all data encryption can not effectively balance the relationship between data processing properties and the data privacy protection. Aiming at the shortages, this paper presents a privacy protection method based on a single outsourced database server. It combines fragmentation and encryption that can provide both efficient privacy protection and query processing. Based on the approximation algorithm for the minimal encryption attribute fragmentation, the method allows storing the outsourced data on a single database server and minimizing the amount of data represented in encrypted format. Theory analysis shows that this method has efficient privacy protection and query processing.
  • ZHOU Li-Jing, YANG Jin-Ji
    Computer Engineering. 2011, 37(7): 142-144,147. https://doi.org/10.3969/j.issn.1000-3428.2011.07.047
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper studies the various structures of three-round optimistic contract signing protocol. The protocol structures are modeled by protocol motion chart and the property of timeliness is analyzed. Getting the structures which meet the timeliness requirement, it further analyzes and verifies the fairness property. Counterexamples are given by the model checker SPIN. Result shows that three-round protocols can not achieve both the fairness and timeliness.
  • ZHANG Yu-Lei, WANG Cai-Fen
    Computer Engineering. 2011, 37(7): 145-147. https://doi.org/10.3969/j.issn.1000-3428.2011.07.048
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The analysis of the ID-based aggregate signature schemes proposed by Zhou-Du and Zhao respectively reveals that they are insecure. The partial and aggregate signatures in Zhou-Du’s scheme can be fabricated. Likewise, in Zhao’s scheme, the adversary can utilize the partial signature to gain access to the signer’s private key for any attacks. The schemes are modified respectively. The modified scheme of Zhou-Du achieves non-forgeability while the modified scheme of Zhao succeeds to avoid the private key leakage. The modified scheme of Zhou-Du is more efficient than the original one, the modified scheme of Zhao works as efficiently as the original one.
  • ZHANG Qiu-Tu, ZHANG Yan, YUAN Tie-Ting
    Computer Engineering. 2011, 37(7): 148-150,162. https://doi.org/10.3969/j.issn.1000-3428.2011.07.049
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the complex computation of existing evaluation methods and weight setting methods are not reasonable enough, this paper proposes a method to evaluate and compare different steganalysis algorithms. The weighted grey correlation degree between the target index vector and optimal index vector is obtained by the grey correlation synthetical evaluation method, and steganalysis algorithms’ performances is sorted by the size of the weighted grey correlation degree. The instance simulation result proves that the proposed method can reasonably evaluate the steganalysis algorithm and verifies it is a feasible method.
  • LIU Xue-Yan
    Computer Engineering. 2011, 37(7): 151-153,156. https://doi.org/10.3969/j.issn.1000-3428.2011.07.050
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Based on secret key generation technique of the certificateless public-key cryptosystem and features of Bloom Filter, an efficient ID-based identification scheme with privilege is presented under Computational Diffie-Hellman Problem(CDHP) assumption. Under standard mode, the scheme is proved that it is secure. Analysis result shows that the scheme not only can overcome domain user, but also can be against playback attack, impersonation attack and modification privilege.
  • XIE Jing, TAN Liang
    Computer Engineering. 2011, 37(7): 154-156. https://doi.org/10.3969/j.issn.1000-3428.2011.07.051
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents a honeypot-prescient semi-distributed P2P Botnet. The robustness of such a Botnet is discussed based on two metric functions C(p), D(p), and the robustness change when the peer-list updating procedure runs once with different number of servent bots. Results show that the new P2P Botnet has higher robustness than traditional Botnet.
  • WANG Yong-Bing, ZHANG Hua-Liang, CHOU Bin
    Computer Engineering. 2011, 37(7): 157-159. https://doi.org/10.3969/j.issn.1000-3428.2011.07.052
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Through the security analysis of an ID-based proxy signature scheme (Journal of Harbin Institute of Technology, 2008, No2), this paper points out it is unsafe and suffers from forgery attack launched by PKG. PKG not only can counterfeite proxy-authorization, but also can forgery a valid proxy signature. An improved scheme based on the property of original scheme is proposed and its security weakness is overcome. In the new scheme, the power of PKG is limited and the benefit of signer is protected, so it is more secure and efficient.
  • GUI Yi-Gong
    Computer Engineering. 2011, 37(7): 160-162. https://doi.org/10.3969/j.issn.1000-3428.2011.07.053
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Wireless Sensor Network(WSN) has very high safety and efficiency requirements, the existing general safety program does not meet this requirement. This paper proposes a Homomorphic Encryption and Digital Signature Algorithm(HEDSA). The homomorphic encryption technology can aggregate the encrypted data and improve the efficiency of the network data transfer. Digital signatures provide integrity and non-repudiation. The mathematical proof and simulation experiments confirme that the algorithm has strong security and high efficiency.
  • LI Xiao-Xi, LI Chi-Jun, JIANG Shou-Xu
    Computer Engineering. 2011, 37(7): 163-165. https://doi.org/10.3969/j.issn.1000-3428.2011.07.054
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    By analyzing the main strategies and methods of six free-riding attacks including BitThief, BitTyrant, Large View exploit, Sybil, advertising pieces it does not have, downloading only from seed and three malicious attacks including advertising false piece, Noncooperation and Eclipse in BitTorrent network, this paper compares the similarities of free-riding attacks and malicious attacks, and concludes the problems in BitTorrent, which can provide reference for improving the BitTorrent network protocol.
  • LV Xin-Rong, LIU Shi-Wei
    Computer Engineering. 2011, 37(7): 166-167,170. https://doi.org/10.3969/j.issn.1000-3428.2011.07.055
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Existing botnet detection schemes require some prior knowledge of botnet to generate matching patterns, and it can not perform detection online. To solve these problems, according to the characteristic of botnet, this paper proposes a botnet detection scheme based on clustering technology by the similarity of botnet channel message strings. Experimental results show that this scheme can detect the bot channels which are hidden in the normal network data flow effectively.
  • LIU Shu-Kai, GUAN Jie, CHANG E-Qi
    Computer Engineering. 2011, 37(7): 168-170. https://doi.org/10.3969/j.issn.1000-3428.2011.07.056
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proves that the resulting guess and determine attack on K2 which needs only 9 guessed elements is incorrect, introduces a guess-and-determine attack with the result of 10 guessed elements, and reduces the computational complexities from O(2192) to O(2160) by implementing guess and determine attack on the simplified K2 without LFSR-A. Analysis results show that the dynamic feedback control mechanism introduced by K2 has strong resistance against guess and determine attacks.
  • ZHANG Jian-Zhong, XUE Rong-Gong
    Computer Engineering. 2011, 37(7): 171-172,177. https://doi.org/10.3969/j.issn.1000-3428.2011.07.057
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper structures an ID-based threshold proxy signature scheme by using bilinear pairings. It is a short signature. The signers send the signature together with their public keys to the receiver. Then, the receiver can confirm that the signers’ public keys are granted by Private Key Generator(PKG). through the verification. In this case, it avoids requesting signers’ public keys from a third party, thus enhancing the effectiveness. Analysis results show that the scheme not only satisfies security properties, but also has the property of anonymity.
  • ZHANG Jian-Zhong, LI Rui
    Computer Engineering. 2011, 37(7): 173-174,180. https://doi.org/10.3969/j.issn.1000-3428.2011.07.058
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a publicly verifiable secret sharing scheme on access structures based on the discrete logarithm problem under non-interactive proof protocol. Multiple secrets can be recovered in a sharing session, and each participant’s sub-secret is selected by the participant himself, so a secure channel does not need. Anybody is allowed to check the secret shadows provided by participants. Analysis results show that the scheme not only has the properties of security, but also is carried out easily, and it can be used on access structure.
  • ZHANG Cha, BIAN Dun-Gong
    Computer Engineering. 2011, 37(7): 175-177. https://doi.org/10.3969/j.issn.1000-3428.2011.07.059
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the blind search of the chaotic particle swarm algorithm, Particle Swarm Optimization(PSO) based on dynamic chaotic perturbations is proposed. The dynamic chaotic perturbations are introduced for the standard PSO. Small disturbances are used when the optimal value changes. The chaotic disturbances within dynamical range of disturbances are used when the optimal value unchanges many times. It not only can reduce the blind search of the chaotic particle swarm algorithm, but also can improve the search speed and search efficiency, so that the limited time is spent on the most effective search. The algorithm is applied to the K-means algorithm, which can overcome the shortcomings of the local optimum and the sensitive to initial value in the K-means algorithm, and it can stably acquire the global optimal solution. The efficiency and stability of the algorithms are confirmed by the simulation experiments.
  • CHEN Shan-Jing, YANG Hua, CENG Kai, DU Dan-Meng
    Computer Engineering. 2011, 37(7): 178-180. https://doi.org/10.3969/j.issn.1000-3428.2011.07.060
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The traditional particle filter tracking algorithms is only based on color feature. And under complex background or shelter with color closing to targets’, particle filter tracking algorithm can almost fail. Particle filter based on multi-feature fusion fuses targets’ color characteristics and edge feature according to certain weighting coefficient to build a likelihood function as a criterion for tracking targets. It overcomes the shortage of tracking algorithm based on color feature only. Experimental results show that multi-feature particle filter tracking algorithm has good performance of tracking.
  • BI Jing
    Computer Engineering. 2011, 37(7): 181-183,186. https://doi.org/10.3969/j.issn.1000-3428.2011.07.061
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For the Non-Player Character(NPC) cooperative motion which realizes the swarm behaves model in conformity to the states and scenarios of games, this paper presents a cooperative motion strategy of multi-NPC for online games, which describes games states by artificial potential field and computes the next best position of NPC by PSO. It realizes the self-determination motion of individual NPC based on the goal of collective campaign. Experimental results show that the presented method can assure that NPC confronts with the players effectively and independently in online games.
  • DING Huang, BANG Li-Hui, ZHANG Xiu, LIU Jiang, TAO Dan-E
    Computer Engineering. 2011, 37(7): 184-186. https://doi.org/10.3969/j.issn.1000-3428.2011.07.062
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    It is a hotspot that detecting moving objects from complex traffic video sequences in ITS field. Background-frame subtraction method is widely used currently. To generate and update qualified background images is the core of the whole method. This paper proposes an improved method based on traditional mixed Gaussian modeling algorithm. This method makes use of the relationship between neighbored pixels to adjust the learning rate of parameter estimation in Gaussian model, which strongly enhances the improved algorithm the ability of anti-interference. It also proposes an improved method of shadow removing based on statistical texture character in shadow region. Experimental results show that the combinations of the two methods can accurately detect moving objects from complex traffic video sequences.
  • LIU Jian, SUN Feng, NI Hong
    Computer Engineering. 2011, 37(7): 187-189,192. https://doi.org/10.3969/j.issn.1000-3428.2011.07.063
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The Aiming at the requirements for estimating the user interest degree in the personalization services researching, this paper analyzes the relationship between the characteristics of user’s behavior and the interest degree and selects the page-concerned time, number of page rolling and page size as the implicit indicators, then proposes a method based on RBF neural network to quantitatively estimate the user interest degree. Experimental results show that compared with the multiple linear regression model, this method achieves better results both on the average residuals and the predicting accuracy.
  • HAN Yan-Ban, LI Jin-Bing
    Computer Engineering. 2011, 37(7): 190-192. https://doi.org/10.3969/j.issn.1000-3428.2011.07.064
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a target tracking algorithm, which is based on multiple color information fusion and projection vector, and can describe the space information of target more than camshift. The method adopts the statistical projection of multiple colors, which includes Y, U, V and H etc, to fuse information, to describe the interesting moving target, and uses level and vertical histogram projection to describe the space information of target. Results show that the multiple color information fusion and projection vector can improve the tracking effect of moving target.
  • CHENG Zhi-Chao, DAO Xiao-Feng
    Computer Engineering. 2011, 37(7): 193-195. https://doi.org/10.3969/j.issn.1000-3428.2011.07.065
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the low accuracy and poor intelligibility of current algorithms for semantic analysis, a semantic similarity computing method based on Wikipedia is proposed. Different from computing word’s semantic similarity by category information, this method uses link information to calculate the similarity of different words in a way like human thinking. Result can be easily understood and the accuracy rate can be increased with semantic category. Experiment compared with current algorithms proves its advantage.
  • ZHANG Feng, LIN Jie, LIU Sai-Wei
    Computer Engineering. 2011, 37(7): 196-198. https://doi.org/10.3969/j.issn.1000-3428.2011.07.066
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Deficiencies of existing Mass Customization(MC) supply chain schedule models are summarized. According to the characteristics of distributed schedule and large scaled computing, a MC supply chain schedule model is designed. Multiple ant colony algorithm is introduced to achieve this scheduling model. Collaborations among ant colonies distributed in different location of supply chain fully takes the advantages of whole computing resources of supply chain, obtained fairly solving speed, and fulfilled schedule requirements of multi-order including supplier selection and inter-enterprise schedule. Practical manufacture instance is used to prove the algorithm’s validity, stability and order adaptability.
  • CENG Yang-Lan, ZHENG Jin-Hua, WU Jun, LUO Biao
    Computer Engineering. 2011, 37(7): 199-200,203. https://doi.org/10.3969/j.issn.1000-3428.2011.07.067
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    After a deep analysis of the faults of traditional MOEAs on solving the complex Pareto Set(PS) problems, this paper proposes a multi-objective evolutionary algorithm on solving the complex PS problems(SA-MODE). According to the dominated relationship between individual X which is chosen in the parent population and the individual Y in the current population, control the distance between new individual and the parent one by altering the size of scaling factor. The new individual is close to X when X dominates Y, the other hand away from X. When the X and Y do not dominate each other then create two new individuals, one near the X and the other from X. Experimental results demonstrate that SA-MODE can deal with complex PS problems more effectively compared with GDE3 and NSGA-II.
  • SHU Hao-Dong, LI Gong-Chan
    Computer Engineering. 2011, 37(7): 201-203. https://doi.org/10.3969/j.issn.1000-3428.2011.07.068
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Based on sphere crossover strategy, a dynamic adaptive clone selection algorithm is proposed. Mutation probability of each antibody is dynamically calculated. According to antibody affinity, antibody populations are dynamically divided into memory antibody units and general antibody units. Antibody populations are adjusted by sphere crossover so that global search speed of the proposed algorithm is accelerated. The effectiveness and the feasibility of the proposed algorithm are verified by examples.
  • ZHONG Shan, CHANG Jin-Xi, CHEN Qiu-E, SHU Dan-Xiang
    Computer Engineering. 2011, 37(7): 204-206,209. https://doi.org/10.3969/j.issn.1000-3428.2011.07.069
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To solve the difficulty of the representation of the dynamics, asynchronism and concurrency in the former planning system, a formalized method representing Agent planning problem is advanced by using Predicate/Transition(Pr/T) net. The dynamics, asynchromism and concurrency are used to represent the planning problem, the inhibitor arc is added to the predicate/transition net, and the actions of Agent are divided into two sorts such as ordinary action and test action. The compound action can be obtained just by combining the two sorts of actions. Through an algorithm the Pr/T net with inhibitor arc is proved feasible.
  • WANG Hong-Bin, ZHANG Li-Yi
    Computer Engineering. 2011, 37(7): 207-209. https://doi.org/10.3969/j.issn.1000-3428.2011.07.070
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Using genetic algorithm global search capability and Back Propagation(BP) algorithm for local search and fast speed, two-stage training methods are taken. The two both not only avoid falling into local minimum, but also speed up the convergence speed. Multi-user detection algorithm based on optimization neural network weight with GA is proposed. In the algorithm, use real encoding, choose the traditional neural network energy function as fitness function, selection operator selection of roulette operator, crossover operator selection of one-point crossover operator, mutation operator chosen normal mutation operator. Simulation experiments show that the algorithm’s bit error rate, signal to interference ratio, channel tracking capability and performance have significant improvement compared with traditional feed forward neural networks.
  • JU Jiu-Peng, ZHANG Wei-Wei, NING Jian-Jun, ZHOU Guo-Dong
    Computer Engineering. 2011, 37(7): 210-212,215. https://doi.org/10.3969/j.issn.1000-3428.2011.07.071
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A GeoSpatial Named Entities Recognition(GSNER) method based on combination of Conditional Random Fields(CRF) and rules is proposed. This method takes extensive knowledge as trigger conditions. Triggered text fragments are put into CRF Named Entity Recognition(NER) module, and recognized NEs are deconstructed to several components, CRF and knowledge are also employed for classification of GSNE. Experimental results show that, this combination method and the NE deconstruction strategy effectively promotes the performance of GSNER: the overall Precision, Recall, F1 achieves 92.86%, 90.91%, 91.87%.
  • YU Long, TIAN Sheng-Wei, FENG Guan-Jun
    Computer Engineering. 2011, 37(7): 213-215. https://doi.org/10.3969/j.issn.1000-3428.2011.07.072
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For expanding uyghur emotional vocabulary and identificating emotional words automatically, efficiency of artificial works is improved. Combined with the specific characteristics of the uyghur subjective text corpus, this paper proposes the full analysis of characteristics of uyghur emotional words in the text, establishes uyghur emotional words feature template, using Conditional Random Fields(CRFs) model to achieve the uyghur emotional words automatic identification method. Experimental results show that the method can effectively recognize the emotional words, and reduce the workload of manual identification of emotional words.
  • HE Xiao-Ying, YUE Jian-Wei, ZHANG Xu-Ran
    Computer Engineering. 2011, 37(7): 216-218,230. https://doi.org/10.3969/j.issn.1000-3428.2011.07.073
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Research on Scale-Invariant Features Transform(SIFT) feature match algorithm is done in order to make the algorithm more suitable to Unmanned Aerial Vehicles(UAV) images matching. Results of image match in different scales are analyzed and compared. A conclusion can be drawn that image match in reduced-scale costs shorter time but the match accuracy is still high. Image strategy combined with rough match and block match is proposed. Experiments prove this strategy is put out to get higher match efficiency.
  • HAN Chen-Shou, JIA Shi-Xiong, ZHANG Lei, SHU Chang-Cheng
    Computer Engineering. 2011, 37(7): 219-221,236. https://doi.org/10.3969/j.issn.1000-3428.2011.07.074
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The current trajectory data clustering algorithms do clustering directly on the whole trajectory, or on sub-trajectory after partitioning. The sub-trajectory clustering algorithms abandon all the points within the sub-trajectory, that is to say, this kind of algorithms loose sub-trajectory’s internal features, while not considering the speed impact of points. A method for sub-trajectory data clustering taking the speed impact on consideration is proposed. The method uses speed restriction and two-pass corner detection in the segment of trajectories. It adds speed restriction in neighborhood computations and do sub-trajectory distance compared with Discrete Fréchet Distance, which keeps the internal features of sub-trajectory. Besides, TraDBSCAN algorithm that is similar to DBSCAN algorithm is applied for the clustering of sub-trajectory. Experimental results show that the new algorithm is effective and it perfectly considers the speed factor.
  • GUO Qiang-Chao, ZHENG Tao
    Computer Engineering. 2011, 37(7): 222-224,233. https://doi.org/10.3969/j.issn.1000-3428.2011.07.075
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper conducts a survey of pricing models, relevance match algorithms, and effective statistical models for computing advertising, analyzes and compares these approaches, like Cosine, Okapi BM25, feature learning, hierarchy-learning and Multinomial language model, and conclusively points out the feasible improvement and future of research in this field.
  • LIU Feng, WANG Ye-Han, SHANG Bu-Zhou, WANG Xiao-Long, WANG Han
    Computer Engineering. 2011, 37(7): 225-227. https://doi.org/10.3969/j.issn.1000-3428.2011.07.076
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper introduces the basic principles of sentence level Chinese phonetic input method, and discusses the difficulties and solutions of achieving it on mobile device. It achieves a input method on Android OS. By now, it runs well on Dopod’s mobile phone A3288 with high efficiency. The conversion accuracy is 86.92%, and with the training of input method, the accuracy can raise quickly.
  • ZHANG Yan, WU Yu-Jiang
    Computer Engineering. 2011, 37(7): 228-230. https://doi.org/10.3969/j.issn.1000-3428.2011.07.077
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    An improved modular Two-Dimensional Principal Component Analysis(2DPCA), modular 2DPCA based on sub-distance, is proposed. The original images are divided into sub-images in proposed algorithm. Each kind of sub-images at the same position is disposed by 2DPCA independently, and the sub-distance between the corresponding sub-images of the test sample and the train sample can be given. The distance between the test sample and the train sample can be calculated by adding all these distances between the sub-images together, and the nearest distance classification is used to distinguish each face. Experimental results on ORL face database indicate that the improved modular 2DPCA is obviously superior to that of general modular 2DPCA and amendatory modular 2DPCA.
  • SU Na, XUE He-Ru
    Computer Engineering. 2011, 37(7): 231-233. https://doi.org/10.3969/j.issn.1000-3428.2011.07.078
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    It is important for cell accurate count to overlapping cell recognition and segmentation. The shape characteristic of overlapping milk somatic cells is attended. Through experimental data analysis, selection of a suitable form factor threshold judges whether it occurs in overlapping, which is order to reduce false segmentation. Seed point extraction and merging by this paper are used for overlapping cell. Segmentation points are determined through the concept of positive skip variable, and segmentation lines are selected appropriately. Experimental results show this method can accurately and quickly separate milk overlapping somatic cell, and prevent the watershed over-segmentation in effect.
  • DIAO Dun-Sheng
    Computer Engineering. 2011, 37(7): 234-236. https://doi.org/10.3969/j.issn.1000-3428.2011.07.079
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The Village Postman Problem(VPP) is NP-complete problem. Most of the algorithms for it are intelligence algorithm and linear programming. Aiming at basic Quantum Evolution Algorithm(QEA) is easy to trap into local deceptive optima, an improved QEA is proposed. Experimental result demonstrates the improved algorithm can get better solution to the VPP than basic algorithm. It has better diversity and global search capacity. It indicates the algorithm is effective to solve the VPP.
  • ZHOU Zhi-Yong, ZHANG Chao
    Computer Engineering. 2011, 37(7): 237-240. https://doi.org/10.3969/j.issn.1000-3428.2011.07.080
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The accuracy of medical image registration based on mutual information can reach sub-pixel level, with high accuracy and good robustness. However, frequent involving a huge amount of floating-point calculation, the rate of registration is very slow and can not achieve real-time requirements of clinical use. Because the rate of mutual information is relative to the amount of gray-scales, this paper presents a method based on a nonlinear grayscale mapping method which uses the gradient information of the image. A different image is decomposited and recomposited by a wavelet. Experimental result shows the method can reduce the gray scale of a image at the premise of preserving the image details. Moreover, this algorithm reduces the registration time and maintain the accuracy of registration.
  • SHU Mei, LI Zhang-Wei
    Computer Engineering. 2011, 37(7): 241-242,252. https://doi.org/10.3969/j.issn.1000-3428.2011.07.081
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the second generation Bandelets transform, the paper proposes an algorithm which is based on the objective function calculation from father and son to optimize the quadtree construction when the image is subdivided. The principle of the least squares is also applied to the optimal direction search so as to achieve efficient image compression. The edges and texture features are retained, and the computational complexity is also reduced. Experimental results show the peak signal to noise ratio is increased by more than 0.1 dB compared with JPE2000 scheme.
  • LIN E-Heng, WEN Pei-Zhi, HUANG Wen-Meng, TUN Xiao-Jun, DAN Dun-Chao
    Computer Engineering. 2011, 37(7): 243-245,248. https://doi.org/10.3969/j.issn.1000-3428.2011.07.082
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In response to the poor real-time ability of traditional Ostu in segmenting of pat sperm images, it proposes a new method to segment such images based on improved Ostu, which reduces the execution time by Newton iteration, removes impurities according to the shape factor, and applies morphology to mark each sperm with digital tags. Experimental results show this method can achieve fast and accurate segmenting of sperm images, and automatically count the number of sperms in the images.
  • LEI Jun, LI Yang, DIAO Kang-Lian, DOU Sai-Dan
    Computer Engineering. 2011, 37(7): 246-248. https://doi.org/10.3969/j.issn.1000-3428.2011.07.083
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents a digital camouflage texture feature extraction method based on dominant colors and co-occurrence matrix. The factor of proportion is added to RWM in extracting dominant colors, and the factor of dominant colors is added to Gray Level Co-occurrence Matrix(GLCM) in extracting texture feature. Experimental results in visual observation are good, which indicates that the method can be used in designing digital camouflage for specific environment.
  • WANG Zhi-Jiang
    Computer Engineering. 2011, 37(7): 249-252. https://doi.org/10.3969/j.issn.1000-3428.2011.07.084
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyzes the internal relation of wavelet shrinkage and nonlinear diffusion, and the equivalence of them is proved. A new diffusion equation is constructed according to the characteristics between wavelet shrinkage and nonlinear diffusion. A new hybrid image de-noising algorithm based on wavelet shrinkage and nonlinear diffusion is proposed. Experimental results show that compared with the other de-noising methods, this hybrid algorithm has the better general performance on computational complexity and de-noising result.
  • LI Chang-Cheng, LUO Yu-Bin, ZHENG Xiao-Meng
    Computer Engineering. 2011, 37(7): 253-254,267. https://doi.org/10.3969/j.issn.1000-3428.2011.07.085
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper builds a raindrop degradation model based on imaging experiment, which models the image distortion caused by raindrop on the lens of camera from four aspects, including blurring, distortion, displacement and attenuation. According to this model, it proposes a restoration algorithm including inverse scaling, overlapping separation, and filtering, etc. Experimental results show that it can depict the distortion caused by raindrop well, and can get a promising result by separating overlapping images and correcting distortion effectively in general.
  • WANG Li-Feng, HU Shan-Qing, LIU Feng, LONG Teng
    Computer Engineering. 2011, 37(7): 255-257,261. https://doi.org/10.3969/j.issn.1000-3428.2011.07.086
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at increasing requirement for bandwidth and capacity in the field of embedded real-time storage, the design of a high speed and large capacity storage module is presented, which consists of high density NAND flash array, large scale FPGA and high performance DSP. Under the combined control of FPGA and DSP, ultra-high speed storage is achieved for mass data. The design of storage management and DSP software are presented. Practical application proves the practicality of this storage module.
  • BO Hai-Xiang, YANG Hua-Qiu, DUAN Xin, CHEN Li-Guang, LAI Jin-Mei, BAO Li-Chun
    Computer Engineering. 2011, 37(7): 258-261. https://doi.org/10.3969/j.issn.1000-3428.2011.07.087
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to improve the speed of on-chip evolution, this paper proposes an embedded accelerator of genetic algorithm in the evolvable system chip FDP2009-2-SOPC. It improves the implementation of genetic algorithm through hardware implementation of random number, and changes implementation of genetic operations in embedded CPU to improve the on-chip evolution flow. After the tape-out and verification of the evolvable system chip FDP2009-2-SOPC with the genetic algorithm accelerator, test results show that the performance of genetic algorithm accelerator and on-chip evolution speed are improved greatly.
  • HONG Wen-Xi, WANG Lin-Kai, ZHOU Jin-Yuan, ZHOU Xiao-Fang
    Computer Engineering. 2011, 37(7): 262-264. https://doi.org/10.3969/j.issn.1000-3428.2011.07.088
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes an improved radix-24 DIF Fast Fourier Transform(FFT) algorithm. On the basis of this algorithm and Single-path Delay Feedback(SDF) architecture, it proposes an improved multi-path radix-24 FFT processor architecture. It minimizes the number of general complex multiplier and the hardware cost can be reduced without sacrificing the throughout by sharing trivial complex multipliers. A two-path 256 points FFT processor adopting modified architecture is designed. The processor is synthesized, placed and routed using the SMIC 0.13 μm process with a layout core area of 1.12 mm2 and a max work frequency of 100 MHz.
  • CANG Meng-Xiang, WANG Tian-Tian, HUANG Zhan-Wu
    Computer Engineering. 2011, 37(7): 265-267. https://doi.org/10.3969/j.issn.1000-3428.2011.07.089
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    To avoid the errors of the circuit board design resulting in the processing and manufacturing errors, a former intelligence review method about circuit board is posed in this paper. By using the design review rules expressed by first-order predicate logical and membership function and based on knowledge base, in accordance with the given review model, it extracts and reviews the processing and manufacturing data generated by different EDA design software, and directly visualizes the review results. Experimental results verify that the method is feasible, available, and has high error review rate.

  • ZHOU Ying-Bei, KUANG Ji-Shun, YANG Feng
    Computer Engineering. 2011, 37(7): 268-270,281. https://doi.org/10.3969/j.issn.1000-3428.2011.07.090
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem that it is too slow to run genetic algorithm with software, this paper designs a pipelining of FPGA-based genetic algorithm. The system is implemented by means of a four-cascade full pipeline, i.e., dividing the system into reproduction, crossover, mutation and calculating fitness pipeline cells. The whole design is implemented in the Cyclone serial chips, and experimental result shows that the hardware implementation runs over three orders of magnitude faster than usual software implementation.
  • CA Yan-Beng, LI Ai-Hua, LI Ren-Bing, LI Chi-Lai, BAI Xiang-Feng
    Computer Engineering. 2011, 37(7): 271-273. https://doi.org/10.3969/j.issn.1000-3428.2011.07.091
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to suppress the cross-term of Wigner-Ville distribution(WVD), this paper proposes a WVD cross-term suppressing method based on Empirical Mode Decomposition(EMD). It calculates the Intrinsic Mode Function(IMF). WVD after delete the false components generated by EMD, and then the original signal WVD is reconstructed by linear superposing the IMF WVD results. Simulation results show that the method can effectively suppress the cross-term of WVD, ensure WVD time-frequency concentration, analysis the signal amplitude modulation phenomenon.
  • TUN Long-Shu, CAO Fei-Long
    Computer Engineering. 2011, 37(7): 274-275,278. https://doi.org/10.3969/j.issn.1000-3428.2011.07.092
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper researches the reverse 1-median problem under the hamming distance and l1-norm in condition that the weights of vertices in a network can be changed. Under the hamming distance, by transforming this problem to a 0-1 knapsack problem, it proves that even in chain network, this problem is NP-hard. Under l1-norm, it presents a polynomial time algorithm to solve the problem in general network.
  • LIU Ji-Yuan, HOU Fang, HUANG Cheng-Hui
    Computer Engineering. 2011, 37(7): 276-278. https://doi.org/10.3969/j.issn.1000-3428.2011.07.093
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A direct interpolation method for fractional pixels is proposed to cope with the tremendous memory consumption and high computational complexity of H.264 Fidelity Range Extension(H.264 FRExt) decoding. It overcomes the calculation dependency for 1/4 pixels in H.264 FRExt and only computes the required fractional pixels. An error elimination approach for the method is given to produce the same result as H.264 FRExt. Experimental results show that the method can lower the memory requirement for decoding and save a lot of redundant computation for unused fractional pixels.
  • ZHANG Ai-Hua, DIAO Chi-Ru, YANG Hua
    Computer Engineering. 2011, 37(7): 279-281. https://doi.org/10.3969/j.issn.1000-3428.2011.07.094
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to detect and evaluate visual fatigue from biomedical signal, this paper simulates Visual Display Terminal(VDT) operating environment, and tests 35 healthy subjects for 1.5 h VDT fatigue experiment. Electrocardiograph(ECG) signals and pulse wave are collected from the subjects by using the MP425 data acquisition card and LabVIEW acquisition system. ECG and pulse wave signal features are extracted by analyzing and processing before and after VDT fatigue experiment. Analysis results show that ECG and pulse wave signal features change significantly before and after VDT fatigue experiment, the accuracy rate of classification is reached 100% by using Support Vector Machine(SVM) method and combination features of ECG and pulse wave signals.
  • LU Feng-Fei, LI Dun
    Computer Engineering. 2011, 37(7): 282-284. https://doi.org/10.3969/j.issn.1000-3428.2011.07.095
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the deficiency in controlling arrears risk of traditional balance allocate algorithm, in Online Charging System(OCS), based on customer’s consumption history, using cluster analysis method, this paper designs an adaptive balance allocate algorithm based on user habit, which can be optimized by table looking-up and fractionation strategy. Test results show that the optimized algorithm can highly reduce the arrears risk, improve user experience and system performance of OCS.
  • TANG Wei, ZHENG Xiao-Lin
    Computer Engineering. 2011, 37(7): 285-287. https://doi.org/10.3969/j.issn.1000-3428.2011.07.096
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problems that stem and penalties are not enough for fraud trading which exist in the complex e-commerce environment using P2P trust model, this paper proposes a P2P e-commerce trust model based on transaction success rate. It gives the model implementation method in a single trust value, integrated trust value, the success rate of direct transactions and indirect transaction success rate. Simulation results show that the model is better than Taobao’s trust model in assessment of accuracy and transaction success rate.
  • LI Yong, LI Ying, TU Qing-Qing
    Computer Engineering. 2011, 37(7): 288-290. https://doi.org/10.3969/j.issn.1000-3428.2011.07.097
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to take full advantage of the information contained in the eco-environmental sounds, this paper presents a ecological environmental sounds classification technology based on manifold learning algorithm and Support Vector Machine(SVM). Select four different kinds of audio characteristics those are dynamics, timbre, pitch and rhythm and then calculate the feature vectors corresponding to those four audio characteristics. So as to reduce the complexity of data processing, it makes use of an improved Laplacian feature mapping for dimensionality reduction. To improve the accuracy, the SVM classifier is used to classify the dimension-reduced feature vectors because SVM have advantages in dealing with the data that is of few samples, nonlinear and high dimension. Experimental results show that the technology can be used to classify ecological environmental sounds quickly and accurately.
  • LI Juan-Juan, SHU Yi-Biao, RUI Xian-Xi
    Computer Engineering. 2011, 37(7): 291-292. https://doi.org/10.3969/j.issn.1000-3428.2011.07.098
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the shortages that G.729A speech compression algorithm has considerably complexity and computational cost, this paper presents a Aitken Polynomial Ferrari- Line Spectrum Pairs(APF-LSP) algorithm which can quickly calculate LSP coefficient. In order to be real-time implementation on TMS320C5510 DSP platform to fairly meet the requirement for real-time processing, realizes a three-level optimization in algorithm, language and compiler for G.729A algorithm. Test result shows the calculation complexity of optimized G.729A algorithm reduces from 590.097 MIPS to 50.523 MIPS, and the executing speed increases over 11 times.