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

20 March 2012, Volume 38 Issue 06
    

  • Select all
    |
    Networks and Communications
  • FENG Yu-Meng
    Computer Engineering. 2012, 38(06): 1-6. https://doi.org/10.3969/j.issn.1000-3428.2012.06.001
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In current electronic voting schemes, there are the following preconditions that must be met, the clients that using by voters are secure, and the anonymous or secret communication channels are existent between the voters and administers. Therefore, a new scheme based on trusted computing technology is proposed, which can protect the clients, decrease the use of anonymous or secret communication channels, promote the practicability of the electronic voting system, meet the demands of security attributes such as confidentiality, receipt-free, open verification, etc. Analysis result shows that compared with similar schemes, this scheme has lower communication traffic and better voting efficiency.
  • LI Wei-Beng, LIN Hui-Peng, SUN E-Gong
    Computer Engineering. 2012, 38(06): 7-9. https://doi.org/10.3969/j.issn.1000-3428.2012.06.002
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a context-aware procurement decision method in supply chain management. The context-awareness concept is introduced and the architecture of the context aware service system is also proposed. It puts forward the context space concept, and a key-value based context model is defined accordingly. Also the rule-based reasoning method is adopted in the model. An open source rule engine, Drools, is integrated into the system to perform rule definition and reasoning. The context aware decision method is testified by a purchase decision process in a supply chain procurement system.
  • LIU Jin-Mei, ZHANG Wei, QIU Shui-Sheng
    Computer Engineering. 2012, 38(06): 10-12. https://doi.org/10.3969/j.issn.1000-3428.2012.06.003
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Tent chaotic maps have good ergodicity and uniformity, but fail the NIST randomness tests. Therefore, a new measure is proposed for improving the randomness of Tent chaotic sequences. According to the method, Tent chaotic maps are transformed into the piecewise Tent maps that are featured by greater Lyapunov exponents, better performance of correlations and power spectrum. Besides, the sequences of piecewise Tent maps are tested by NIST randomness tests. Results indicate that the sequences of the proposed chaotic maps are random enough and suitable for future applications in communication and information security.
  • TUN Chao, LI Ping, WANG Yuan-Jiang
    Computer Engineering. 2012, 38(06): 13-15. https://doi.org/10.3969/j.issn.1000-3428.2012.06.004
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Constructive Machine Learning(CML) algorithm needs larger numbers of labeled examples to train a classification network, but it is difficult to obtain a mass of labeled examples. So this paper proposes a constructive learning method based on Tri-training algorithm. According to the labeled examples, it constructs three initial classification networks by using different strategies with lager differences. Unlabeled examples can be labeled by using the initial classification networks, so that the examples can be joined into the labeled examples and the parameters of the classification network can be rectified. The steps are repeated to increase the labeled samples until a steady classifier is trained. Experimental results show that the algorithm is feasible and effective than CML and semi-supervised learning algorithm based on Na?ve Bayes(NB) classifier.
  • JI Xiao-Jiang, DAI Meng, SUN Li-Na, YIN Chuan-Li, CHEN Xiao-Lou, WANG Zi-Chen
    Computer Engineering. 2012, 38(06): 16-18. https://doi.org/10.3969/j.issn.1000-3428.2012.06.005
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to improve the reliability and stability of airborne imaging system, in this paper, a multiplex video image acquisition and transmission system based on Field Programmable Gate Array(FPGA) is designed combing the practical project to process the image data. FPGA is used to control the whole timing sequence and realize the interface control logic, data storing, control the working mode of camera and the image desampling filter. The system is successful applied in an aerial photoelectric imaging platform. Result through practical test and simulation indicates that all the indicators meet the actual project requirements and the system is versatile, practical and expanding.
  • MO Jing, WANG Wen-Cong, YI Jun-Kai
    Computer Engineering. 2012, 38(06): 19-21. https://doi.org/10.3969/j.issn.1000-3428.2012.06.006
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To break through the limitations in traditional queries based on keyword search and improve search recall and precision, a semantic extended search approach, which is based on ontology in knowledge base, is proposed in this paper. This approach extends the user’s search query, and sorts search results according to relevance analyses. Experimental results show that the approach in this paper can effectively improve the recall and precision.
  • DIAO Wen-Ban, DIAO Zheng-Xu
    Computer Engineering. 2012, 38(06): 22-24. https://doi.org/10.3969/j.issn.1000-3428.2012.06.007
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to conversion relationship between engineering software data format, this paper establishes a network graph which takes software and data format as node. By statistical relationship of software and data format, the distribution of software and data format nodes in two-dimensional plane are determined, thus this network graph is visualized by Voronoi diagram. Experimental result shows the method can effectively analyze complex relationship between engineering software and data formats, and increase the mobile storage efficiency of information.
  • FENG Hui-Fang, LIU Lei
    Computer Engineering. 2012, 38(06): 25-27. https://doi.org/10.3969/j.issn.1000-3428.2012.06.008
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    As the particularities of transmission medium of the wireless networks, the traditional Transmission Control Protocol(TCP)-based technology degrades the performance of wireless network with poor quality of transmission link. In order to improve the TCP performance of wireless networks, an enhanced congestion control algorithm(NewLIAD) is proposed, which can figure out the optimal congestion windows by the bandwidth in slow start phase, and reduce the congestion windows dynamically in network congestion phase. Simulation results show that the proposed scheme can decrease the fluctuation of sending data and improve the TCP performance efficiently in wireless network.
  • ZHANG Bei-Wei, CHEN Qing-Yong, WANG Zi-Wei
    Computer Engineering. 2012, 38(06): 28-31. https://doi.org/10.3969/j.issn.1000-3428.2012.06.009
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    With the characteristics of the vision system composed by a parabolic mirror and a CCD camera, this paper proposes a calibration method for parabolic camera system. It introduces the concept of expanded fundamental matrix and applies it for the calibration of system parameters. The nonlinear imaging process of the system is completely encoded into the expanded fundamental matrix, and the numerical complexity is thus reduced. Experimental results are given to show that fine results can be obtained with this method.
  • CHEN Zhuo, XUE Fei-Teng
    Computer Engineering. 2012, 38(06): 32-33. https://doi.org/10.3969/j.issn.1000-3428.2012.06.010
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a Peer-to-Peer(P2P) resource searching strategy based on social characteristics. It clusters the nodes which hold similar interests into a specific cluster, result into a multi-cluster interconnected overlay topology. Every node select most similar candidate node as its neighbors. When confronts with resource searching, node combines biased random walk with breadth first search strategy to locate the searching object. Experimental results indicate that the strategy is a high efficiency searching strategy.
  • NA Li-Chun
    Computer Engineering. 2012, 38(06): 34-36. https://doi.org/10.3969/j.issn.1000-3428.2012.06.011
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A fuzzy clustering partition model of cluster resource is proposed in this paper. It quantizes and normalizes the computer resource parameters of CPU, memory, I/O, network adapter and net. It uses fuzzy clustering technique to realize the partition of the computing nodes in the computer clusters. By using of the vector of resource demand and the vector of lowest inaccuracy tolerance, it can divide the computer cluster into several classes and the performance of these computers in one class is more similar. Test results show that this model can effectively partition the computer cluster and it fits the resource schedule of cloud computing.
  • GU Beng, ZHANG Feng, ZHOU Hai-Chao
    Computer Engineering. 2012, 38(06): 37-39. https://doi.org/10.3969/j.issn.1000-3428.2012.06.012
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a method of program source code similarity measurement. According to the structure feature of the C program language source code, by using the division of function scope, the rules normalize source code. The generated Token sequence is calculated Hash value. It uses the Hash value matching algorithm to measure the program source code similarity. Experimental results show that the accuracy of similar degree can be measured well and run-time efficiency is high.
  • TAO Lin, ZHANG Yong-Ku
    Computer Engineering. 2012, 38(06): 40-42. https://doi.org/10.3969/j.issn.1000-3428.2012.06.013
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The traditional relational database can not meet the storage and access requirements. Aiming at this problem, this paper presents a solution of NoSQL distributed storage and extension. It analyzes and improves the NoSQL, and discusses the solution on NoSQL key/value distributed storage based on consistent hashing algorithm and extension based on double hash ring. NoSQL is led into the current structure as a mirror system. The practical application results show that the solution can avoid the waste of resources and server overload.
  • WANG Shao-Pei, TUN Jian, RUAN Wan
    Computer Engineering. 2012, 38(06): 43-46. https://doi.org/10.3969/j.issn.1000-3428.2012.06.014
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to validate the security of CoSy compiler, and roughly determine the location of the insecure factors, this paper puts forwards a method making use of control flow graph isomorphism comparison to estimate the security of CoSy compiler. After creating the control flow graphs of C program and Common CoSy medium-level intermediate representation with the method, the control flow graph of object assembler produced by CoSy compiler is generated, and estimates whether the control flow graphs are isomorphic, which determines the insecure factors are in front-end or back-end of CoSy compiler, according to isomorphism algorithm. Experimental result indicates that the method can satisfactorily validate the security of the compiler.
  • WEI Xue-Fei, TUN Jian, RUAN Wan
    Computer Engineering. 2012, 38(06): 47-49. https://doi.org/10.3969/j.issn.1000-3428.2012.06.015
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to improve the procedure accuracy and reduce software development and maintenance costs, this paper proposes a static code analysis method based on fault mode and model check. Common C program fault modes are described as CTL formulas form, and an extendable CTL formula library is established. Control Flow Graph(CFG) is generated from testing procedure, and then converted into an equivalent Kripke structure. Labeling algorithm is used to realize model check, so that the procedure can be checked whether it is correct. Experiments based on CoSy compiler platform indicate that the method can correctly find out the fault modes in procedure with good scalability.
  • FENG Guo-Fu, WANG Meng, LI Liang, CHEN Meng
    Computer Engineering. 2012, 38(06): 50-52. https://doi.org/10.3969/j.issn.1000-3428.2012.06.016
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to tune performance of thread-based cloud computing in shared memory, this paper proposes a performance test method for shared memory MapReduce cloud computing. Based on Oprofile, it collects the performance data from application logic dynamic shared library and the kernel system call. Valgrind and Ptrace are used to evaluate memory system and monitor the system calls invoked by application. Experimental results show that the proposed method can analyze the application performance form different levels, and find performance bottleneck in the application.
  • TAN Xiao-Tian, TU Jian-Qiao
    Computer Engineering. 2012, 38(06): 53-55. https://doi.org/10.3969/j.issn.1000-3428.2012.06.017
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem of current index’s redundant search, this paper presents an efficient index of moving object full-time state for road network which considers conditions of network topology and intersection turning constraints. It uses the method of adding near sections information to index former trajectories and current trajectories, and designs a new window query algorithm to achieve moving objects search. It also applies the exponential smoothing method for trajectories prediction. Experimental results show it has good update and query performance.
  • ZHANG Shu-Chun, SUN Xiu-Yang
    Computer Engineering. 2012, 38(06): 56-59. https://doi.org/10.3969/j.issn.1000-3428.2012.06.018
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to improve the accuracy and efficiency of Clustering Large Applications based on Randomized Search(CLARANS) algorithm, this paper combines the idea of data space division which comes from grid-based algorithm Statistical Information Grid(STING), improves the CLARANS algorithm by optimizing the selection of initial node and neighbor node, optimizing the calculation of total node replaces cost. Experimental results show that, compared with the CLARANS algorithm, the improved algorithm has better accuracy and stability for the clustering results, and significantly reduce the execution time.
  • LIU Wen-Juan, CHEN Hua-Beng, HAO Chang-Gang
    Computer Engineering. 2012, 38(06): 60-62. https://doi.org/10.3969/j.issn.1000-3428.2012.06.019
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a resource allocation strategy to meet task deadline on cloud platform. It constructs a two-level hierarchical model for resource allocation according to practical cloud platforms. An improved Banker’s algorithm is presented to minimize the execution cost while meeting the deadline. Computational experiments are performed in the CloudSim environment to test the effectiveness of the strategy. The results show that the proposed strategy can meet the task deadline, reduce the task cost and improve the system performance.
  • CHEN Wen
    Computer Engineering. 2012, 38(06): 63-65. https://doi.org/10.3969/j.issn.1000-3428.2012.06.020
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents a new algorithm for mining weighted frequent item sets without generating candidate. A weight set of attributes is normalized to avoid weighted approval rate greater than 1. The new algorithm is testified to satisfy weighted downward closure property. An effectively mining pruning strategy based on weighed Fp-tree is structured. Example analysis and experimental results show that the algorithm can reduce the weighted frequent item sets formation process of computation, and improve weighted frequent item sets generation efficiency.
  • DONG Feng-Cheng, SHU Hui, KANG Fei, WANG Gan, WEI Wei
    Computer Engineering. 2012, 38(06): 66-68. https://doi.org/10.3969/j.issn.1000-3428.2012.06.021
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes an process analysis method for buffer overflow based on dynamic binary platform, and a prototype system based on this method is implemented. According to the principle of buffer overflow attacks, overflow detection method based on exception caught, control flow analysis, and memory status checks is implemented. By monitoring memory read and write, control transfer instructions, system obtains call sequences and data transfer flow. Through analysis of memory data and function calls, orientation code leads to buffer overflow. Experimental results show that the system can detect buffer overflows, and accurate positioning code results in buffer overflow.
  • BAI Shan, DAO Shi-Qun-?
    Computer Engineering. 2012, 38(06): 69-70. https://doi.org/10.3969/j.issn.1000-3428.2012.06.022
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the system overhead problem of traditional twig pattern query algorithm for XML document, this paper proposes a twig pattern query algorithm for XML data stream. By integrating a type of data structure of multi-layer related queues with SAX data stream parse technology, it uses the method of dynamic gernerating the region code for the querying and avoids the creation of index file. Experimental results show that the algorithm promotes the querying efficiency through reducing I/O operation and querying time on certain data set.
  • LIN Dao-Miao, GU Hui
    Computer Engineering. 2012, 38(06): 72-74. https://doi.org/10.3969/j.issn.1000-3428.2012.06.023
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a comprehension and description algorithm for object-oriented program with the code analysis of compiling technique. It analyzes object-oriented program, and concludes the knowledge related to the program information. It abstracts the knowledge of program information, and expresses program details in visual form. Program comprehension penetrates into algorithm structure analysis under function-level. Test result proves that the algorithm can accurately understand and express the structure information of object-oriented program.
  • XU Hong-Feng, LONG Jun, ZHANG Hao
    Computer Engineering. 2012, 38(06): 75-77. https://doi.org/10.3969/j.issn.1000-3428.2012.06.024
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Unreliable data may appear in the peer review process of science and technology evaluation. It may draw the wrong results if using these data directly when evaluating experts’ capability. In order to solve this problem, according to the phenomenon that the unreliable data can only be distributed in both ends of the assessment data, this paper applies Grubbs’ test method to detect the outliers, takes Euclidean distance as index, and considers other indexes to realize anti-assessment. Experimental results demonstrate the effectiveness of the method.
  • ZHOU Zheng-Guo
    Computer Engineering. 2012, 38(06): 78-79. https://doi.org/10.3969/j.issn.1000-3428.2012.06.025
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To solve the problem that the same accuracies of approximations and roughness are obtained in different covering hierarchical structures, this paper proposes a novel measurement method. The concept of knowledge granularity is introduced into a covering approximation space, the concept of covering granularity is proposed. Based on this, the covering granularity based accuracies of approximation and roughness are further presented. Example result indicates that this method can distinguish the same accuracies of approximation and roughness obtained in different covering hierarchical structures.
  • LIN Cheng, CHEN Shu-Xin, SU Yi-Dong
    Computer Engineering. 2012, 38(06): 80-82. https://doi.org/10.3969/j.issn.1000-3428.2012.06.026
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to describe the near space communication channel efficiently, a simple near space channel geometric model is proposed. It estimates the parameters of the multipath channel, builds the corresponding channel simulation model, simulates and analyzes the phase and bit error ratio characteristics of the channel for the Quadrature Phase Shift Keying(QPSK) scheme, validates the correctness of the model. When the transmission rate is too high, the performance of the channel worsens and needs equalization in next step.
  • ZHANG Wen-Bei, ZHANG Xiao-Xiao, TAN Xiao-Bei, FU Li-Dong
    Computer Engineering. 2012, 38(06): 83-85. https://doi.org/10.3969/j.issn.1000-3428.2012.06.027
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to reduce the energy consumption of the agents during the process of Wireless Sensor Network(WSN) management, this paper proposes a new network management method for WSN based on Virtual Object Identifier(VOID) computation and the local polling, and realizes the network management primitives used for the local polling and the VOID method. The VOID technique provides a computation function for agents, by which the information communicates between the manager and the agents. The management information by local polling exchanged between the network manager and the agents is reduced either. Experimental results show that the network management method can effectively reduce the energy consumption of agents, and the original language meets the demand of WSN management.
  • CHEN Chao, WANG Lei, ZHOU Chun-Zhi, SHU Gong-Yang, CAO Hong-Xin, YANG Tu-Wang
    Computer Engineering. 2012, 38(06): 86-88. https://doi.org/10.3969/j.issn.1000-3428.2012.06.028
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper constitutes a localization model which is based on that dose rate is inversely proportional to square of distance, proposes and implements a scheme which is based on Wireless Sensor Network(WSN). It introduces the overall system network model, radiation sensors and long-distance wireless communication node design. It gets anchor nodes’ locations and radiation values with radiation sensors and GPS sensors to implement radiation localization. Experimental results show that the method system is efficient, and the location accuracy is less than three meters.
  • DENG Xue-Bei, WANG Xiao-Jiang, CHEN Xi, MA Dui, LIAO Yong, LI Beng
    Computer Engineering. 2012, 38(06): 89-91. https://doi.org/10.3969/j.issn.1000-3428.2012.06.029
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The channel allocation with high-density Access Point(AP) coexistence is the main challenge to improve the system throughput. It is an unsolved problem to consider both the Quality of Service(QoS) of Basic Service Set(BSS) service and the throughput fairness within BSS. Based on the analysis model in IEEE 802.11e and comprehensively considering the throughput attenuation caused by adjacent AP, this paper puts forward a channel allocation algorithm CAQFT based on minimum spanning tree under the restricted condition to meet maximum fairness and minimum channel interference, which is gained through the introduction of Jain indicator to measure the fairness of throughput within BSS. Numerical analysis indicates that the CAQFT algorithm not only can effectively meet the QoS request in BSS service, but also can improve the overall throughput of system at largest possibility as well as the fairness of system throughput within BSS.
  • HUANG Man, CHENG Liang-Lun
    Computer Engineering. 2012, 38(06): 92-94. https://doi.org/10.3969/j.issn.1000-3428.2012.06.030
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to prolong the life of Wireless Sensor Network(WSN) and balance energy consumption of the node, a Path-loss Based Energy-aware Topology Control(PLEATC) algorithm for WSN is proposed based on PLBD algorithm in this paper. This algorithm not only considers the path-loss as a measure, but also takes the residual energy of the nodes into account in order to void some node running out of energy early. Simulation results show that PLEATC algorithm can ensure the connectivity of the network and has good performance in robustness and balanced energy consumption.
  • WANG Yu-Jin, LIU Xing-Jia, WANG Zhi
    Computer Engineering. 2012, 38(06): 95-97. https://doi.org/10.3969/j.issn.1000-3428.2012.06.031
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the multi-user diversity characteristic of Orthogonal Frequency Division Modulation(OFDMA) system, an adaptive resource allocation algorithm based on Quality of Service(QoS) is proposed. The algorithm adopts simple equal power distribution because of the multiuser-diversity and the Adapt Modulation Coding(AMC), so the algorithm complexity is distinctly reduced. Simulation results indicate that the proposed algorithm has better system performance on users QoS satisfaction and user fairness although it sacrifices a little system throughput.
  • FU Yun-Qing, WANG Xin-Qin
    Computer Engineering. 2012, 38(06): 98-100. https://doi.org/10.3969/j.issn.1000-3428.2012.06.032
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Because the physical topology can not match with the logical topology for structured Peer-to-Peer(P2P) model, so this paper puts forward a physical topology model based on Chord model and hybrid Chord model. It selects the node with maximum degree as Super Node(SN) in Autonomous System(AS) using network regionality, different SN forms Chord ring. In this case, the model logical topology can match with physical topology, which reduces the hop counts in resource location and access. On this basis, improvement of routing table makes less network time delay. Simulation experimental result shows that the model has less average hop counts and lower average time delay.
  • LIU Shun-Lan, XU Guang-Jian
    Computer Engineering. 2012, 38(06): 101-103. https://doi.org/10.3969/j.issn.1000-3428.2012.06.033
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Based on multi-user non-regenerative collaborative network, this paper proposes an improved relay selection strategy of multi-user cooperative communication system. It defines an Equivalent Channel Gain(ECG), according to the channel statistical properties of source to relay and relay to the destination nodes, that is, combined with the Signal to Noise Ratio(SNR), to choose different sets of relay nodes to make outage probability of system minimum. Experimental results show that when the outage probability is 10?3 at the high SNR, this paper’s algorithm outperforms All Relays Amplify-and-Forward(AAF) algorithm with about 0.2 dB SNR gain, and system resource utilization is improved. The algorithm outperforms Single Relay Amplify-and-Forward(SAF) algorithm with about 3.5 dB SNR gain.
  • LV Yi, FAN Sai-Long, TUN Da-Feng, KONG Xiao-Long
    Computer Engineering. 2012, 38(06): 104-106. https://doi.org/10.3969/j.issn.1000-3428.2012.06.034
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In opportunistic networks, spreading extent of packets has close relationship with packet delivery status. This paper proposes a packet scheduling mechanism with spreading extent estimation in opportunistic networks. It estimates the spreading extent of each packet according to delivery mechanism in opportunistic networks and their utilities by dynamic utility function. When it schedules the packets, the packet whose utility is smaller should be deleted first. And the nodes’ meeting probability is taken into account when packets are forwarded. Compared with the other traditional methods, simulation results show that the algorithm can improve the packet delivery probability effectively and reduce the network overhead and the latency of packet delivery.
  • DANG Xiao-Chao, LI Xiao-Yan, HAO Tie-Jun
    Computer Engineering. 2012, 38(06): 107-110. https://doi.org/10.3969/j.issn.1000-3428.2012.06.035
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Multiple Rounds Clustering Algorithm(MRCA) is proposed for the problem of frequent-changing cluster head in wireless sensor network and most energy is used to send clusters information, through improvement wheel model to reduce the number of changing cluster head. Meanwhile, the assistant cluster head is used to share the energy consumption of main cluster head, for balancing the whole network energy consumption. Simulation results show that compared with LEACH and HEED, MRCA is improved in prolonging network life cycle and equilibrium network performance.
  • DING Zhen-Quan, DONG Kai-Kun
    Computer Engineering. 2012, 38(06): 111-112. https://doi.org/10.3969/j.issn.1000-3428.2012.06.036
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to solve high resource consumption of large-scale network simulation, an topology aggregation algorithm based on polymerization coefficient is presented. All the nodes on the network topology are assigned to weights, and the weight threshold that is defined by methods of combining polymerization coefficient is used to aggregate network topology. Two methods are used by the algorithm: The tree aggregation and weight estimation aggregation, and the tree aggregation aggregates the child nodes to the root node, and the weight estimation aggregation aggregates the nodes whose weights are below the weight threshold. Experimental result shows that the algorithm can aggregate nodes of more than seventy percent when the shortest path keeps constant.
  • CHANG Xin-Hong, JIAN Huan-Yan, GAO De-Min
    Computer Engineering. 2012, 38(06): 113-115. https://doi.org/10.3969/j.issn.1000-3428.2012.06.037
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the maximum lifespan problem of multiple source and base stations in Wireless Sensor Network(WSN), this paper proposes a communication model based on optimization theory. It establishes integer nonlinear programming model according to the WSN data flow restrictions and energy conservation principle, with the maximum lifespan network for the best goal, makes energy and bandwidth as a limitation on the constraint conditions, uses optimization technology of distributed algorithm to solve the model. Simulation results show that, in many of the base station environment, this model can prolong the network life period.
  • CHEN Yuan-Yuan, FENG Hui-Fang
    Computer Engineering. 2012, 38(06): 116-118. https://doi.org/10.3969/j.issn.1000-3428.2012.06.038
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the characteristics of the mixed business in WiMAX system, this paper proposes a dynamic bandwidth allocation algorithm based on Fibonacci. It introduces Fibonacci sequence, and the system structure of bandwidth schedule. For Real Time Polling Service (RTPS) service, it finishes the bandwidth allocation before the last tolerant delay. Experimental results show that compared with the deficit fair priority queue algorithm, the proposed algorithm can satisfy the Quality of Service(QoS) requirement of different types. It also improves the throughput of system and good service fairness.
  • TANG Bin, KANG Bao-Sheng, WANG Guo-Dong, KANG Jian-Chao, DIAO Jian-Dong
    Computer Engineering. 2012, 38(06): 119-122. https://doi.org/10.3969/j.issn.1000-3428.2012.06.039
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A robust dual digital blind watermark is proposed based on three-dimensional mesh model in order to solve the weakness of the single watermark’s difficulty to resist against various attacks. The scheme embeds the watermark by modifying the location of vertices in their related space and topological information of 3D mesh, which makes the model resist not only large scaled cropping operation but also high strong noising. With this approach, the original model is not required during detecting watermarks. Experimental results show that the algorithm has good visualizing quality and robustness which can be against the attacks such as translation, rotation, scaling, model cropping and vertex permutation etc.
  • YAN Jian-Gong, BANG Xin-Guang
    Computer Engineering. 2012, 38(06): 123-125. https://doi.org/10.3969/j.issn.1000-3428.2012.06.040
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The RSA key mechanism of Trusted Computing(TC) restricts encryption speed. In order to reduce time, hybrid key mechanism of data seal base on Trusted Software Stack(TSS) is proposed. The structure of TSS is introduced, the process of sealing and unsealing is illustrated and function of Trusted Platform Module(TPM) is improved. Experimental results show that the scheme can reduce the encryption time and it is suitable for encryption of mass data and can wrap data for protecting privacy efficiently with little cost.
  • LI Jian, LIU Dun-Min, WANG Xiao-Meng, GAI Lei
    Computer Engineering. 2012, 38(06): 126-128. https://doi.org/10.3969/j.issn.1000-3428.2012.06.041
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The existing inadequacies of CTBT beijing NDC broadband access system is analyzed in this paper, such as no authentication and audit, being susceptible to network attacks and so on. A new security broadband access solution is designed. The security broadband access system is set up, including dual ISP access, PPPOE+RADIUS access authentication system and query system based on JSP are realized. The system’s security, availability, reliability are proved in application.
  • WANG Shuo, LUO Ying, SUN Ling, HE Shi-Wei
    Computer Engineering. 2012, 38(06): 129-131. https://doi.org/10.3969/j.issn.1000-3428.2012.06.042
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem of the authentication and privacy preservation in pervasive environment, a new privacy preservation authentication protocol is proposed based on hash chain and partially blind signature. The protocol uses hash chains to constructe credential access to guarantee every credential access only once, and uses partially blind signature to embed user credential access number to limite user access frequency. The anonymity access and the mutual authentication are achieved, while the abusing service and non-authorization are solved. Simulation result shows that compared with the available scheme, the proposed protocol has higher security and efficiency.
  • LIU Jing-Lei, HU Gong-Yu, AI Ling-Xian
    Computer Engineering. 2012, 38(06): 132-134. https://doi.org/10.3969/j.issn.1000-3428.2012.06.043
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a new ID-based group authenticated key agreement protocol with a formal security proof in standard model based on the Decision of Bilinear Diffie-Hellman(DBDH) assumption. This protocol considers the dynamic property for group members completely which can solve the problem that the dynamitic of the members. Security performance analysis shows that the protocol can realize the secure key agreement with low computational cost.
  • CHEN Wei, SUN Zhi-Yong, HU De-Wu
    Computer Engineering. 2012, 38(06): 135-138. https://doi.org/10.3969/j.issn.1000-3428.2012.06.044
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to improve the efficiency of the benign worm when fight against the malicious worm, this paper proposes a B+ address tree diffusion strategy for benign worm. It actively spreads the parallel information. In passing information, there is control information, so as to make the benign worms in a controllable diffusion state. According to B+ address tree, it designs the dynamic generation algorithm, and uses Scilab to do the diffusion simulation test. Testing results show that this strategy has faster propagation speed and less network impact on network compared with the traditional ones.
  • SONG Cheng-Yuan, ZHANG Chuan-Rong, CAO Shuai
    Computer Engineering. 2012, 38(06): 139-141. https://doi.org/10.3969/j.issn.1000-3428.2012.06.045
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A new identity-based blind signature scheme is proposed. An electronic voting protocol is designed based on the scheme and its security is analyzed. Besides, it solves the problems in Foo such as vote collision, too much administration authority, anonymity, et al, which give every vote the only number and introduce secret sharing programming to the watching balloting center.
  • ZUO Li-Meng, LIU Er-Gen, SHANG Feng-Zhi, XU Bao-Gen
    Computer Engineering. 2012, 38(06): 142-144. https://doi.org/10.3969/j.issn.1000-3428.2012.06.046
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A security analysis of a key agreement protocol on the braid group is made. The key agreement protocol is not reliable because it can not resist man in the middle attack. The detailed attack method is given. On the basis of the original protocol, an improved braid key agreement protocol is presented. By using the signature scheme on braid groups in the key agreement authentication process, the improved protocol can prevent man in the middle attack and replay attack effectively. Analysis result proves the security of the scheme.
  • DIAO Han-Song, TUN Cheng-Rong, WANG Guo-Beng
    Computer Engineering. 2012, 38(06): 145-147. https://doi.org/10.3969/j.issn.1000-3428.2012.06.047
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Through analysis of the network data packets about Session Initiation Protocol(SIP)-based Voice over Internet Protocol(VoIP) in the case of bypass monitoring, a method is proposed to recover the VoIP information on bypass monitoring. This method can deal with all kinds of complex situation, filter out the network data packets which have nothing to do with VoIP communications effectively and recover the behaviors and contents of VoIP communications correctly. This method implements a VoIP behavior analysis and content recovery system based on SNORT that is applied to practical projects.
  • HU Meng-Xia-
    Computer Engineering. 2012, 38(06): 148-150. https://doi.org/10.3969/j.issn.1000-3428.2012.06.048
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Traditional intrusion detection algorithm for the existence of a relatively high false negative rate and high false alarm rate defects, based on the advantages of BP neural network algorithm, this paper proposes a new algorithm that uses genetic algorithm to optimize BP neural network algorithm for the intrusion detection. The genetic algorithm finds the most appropriate BP neural network weights, and uses the optimized BP neural network learning and network intrusion detection data. Algorithm effectively improves the classification accuracy of BP neural network. Matlab simulation experimental results show that the training samples of the proposed detection algorithm have less time, with better recognition rate and detection rate, compared with traditional intrusion detection algorithm.
  • TUN Ying-Bin, GENG Guo-Hua, HE Yi-Yue
    Computer Engineering. 2012, 38(06): 151-152. https://doi.org/10.3969/j.issn.1000-3428.2012.06.049
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A novel method which is based on Discrete Wavelet Transform(DWT) for digital watermark of a 3D point cloud model is presented. The distance of each vertex in the 3D model to the center point is calculated. The distance is transformed into a signal in frequency domain using one-dimensional DWT and the watermark is embedded in the low frequency of the signal in frequency domain. Experimental results show that the scheme is simple, efficient, easy to implement, and robust against attacks, such as affine transformation, resorting, simplification, cropping and nosing distortion.
  • WANG Guo-Cai, KE Fu-Song, WANG Fang
    Computer Engineering. 2012, 38(06): 153-155. https://doi.org/10.3969/j.issn.1000-3428.2012.06.050
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to against dictionary attack and server compromise attack, this paper proposes a Elliptic Curve Digital Signature Algorithm(ECDSA)-based password authenticated key exchange protocol for three-party. ECDSA is divided into public key generation, signature verification process and verification process. On the bases of it, this protocol is divided into six steps, and designs mutual authentication mechanism. And any two clients can accomplish key exchange relying on the server. Analysis results show that this protocol can reduce the calculation difficulty and storage cost, and can resist dictionary attacks and server compromise attack.
  • WANG Guo-Xin, SHU Xian-Hua
    Computer Engineering. 2012, 38(06): 156-157. https://doi.org/10.3969/j.issn.1000-3428.2012.06.051
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Design and Realization of Distributed Information Security Defense System
  • WU Shu-Ti, TU Jie, FAN Xiao-Beng
    Computer Engineering. 2012, 38(06): 158-160. https://doi.org/10.3969/j.issn.1000-3428.2012.06.052
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The Co-training method requires the independence of two data vectors, which is far from the characteristic of real dataset in network intrusion detection. This paper proposes a intrusion detection method based on Tri-training. It exploits the large amount of unlabeled data, and increases the detection accuracy and stability by Co-training three classifiers. Simulation results show that this method is 2.1% more accurate than the SVM Co-training method, and it performs better with the increase of the loop number.
  • GONG Chang-Jing, TANG Hu, ZHANG Da-Wei
    Computer Engineering. 2012, 38(06): 161-162. https://doi.org/10.3969/j.issn.1000-3428.2012.06.053
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper discusses the quantum one-way function and the information-splitting principle, proposes an identity authentication and key distribution protocol. It uses the trusted server provides random dentity and completes the final confirmation of the protocol. Key distribution is interspersed in the authentication process. Quantum one-way function can improve the authentication security. Experimental results show that the quantum communication technology about the protocol is easy to implement and can improve the efficiency of key distribution.
  • ZHANG Bin, XIONG Hou-Ren, YANG Yan
    Computer Engineering. 2012, 38(06): 163-166. https://doi.org/10.3969/j.issn.1000-3428.2012.06.054
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Due to the drawbacks of weak history relativity, little attention paid to characteristic of trust decrease with time, and lack of incentive mechanism in existing trust evaluation methods, a novel method is proposed to evaluate the direct trust. Historical direct trusts are taken account to emphasize the history relativity and characteristic of trust decrease with time. Utilizing Induced Ordered Weighted Averaging(IOWA) algebra to compute the weights of these historical direct trusts, IOWA-based direct trust evaluation method is presented. An incentive mechanism based on authorization feedback is proposed to update the direct trust. Test results indicate that the proposed method can evaluate and update the direct trust between two entities effectively.
  • LI E-Lin, CENG Yang-Lan, LI Mei-Yi
    Computer Engineering. 2012, 38(06): 167-171. https://doi.org/10.3969/j.issn.1000-3428.2012.06.055
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Based on the research of the negotiation strategy and communication protocol between agents in multi-agents system, the one to one negotiation model is analyzed. Response strategy and think strategy are combined in the proposed model in this paper, fully account the preference, maximize the utility value of each sides. Then use the multi-objection evolutionary to establish the pre-providing proposal set and the dominated set. Multi-agent auto-negotiation is realized. Experimental results verify the validity of this method.
  • CHA Feng, XIAO Shi-De, FENG Liu-Zhong, GONG Yun-Long
    Computer Engineering. 2012, 38(06): 172-174. https://doi.org/10.3969/j.issn.1000-3428.2012.06.056
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the environment identification and categories of mobile mechanical mouse walking the labyrinth, a multi-mode wall-following navigation strategy and algorithm for the mobile mechanical mouse based on infrared sensor is proposed. The strategy and algorithm are implemented on mechanical mouse in indoor labyrinthine environment. Experimental result shows that the mobile mechanical mouse can follow a wall smoothly, and collisions and out-of-control are effectively inhibited during walking. The proposed strategy and algorithm are verified to be high reliability.
  • FAN Hai-Ju, ZHANG Yu-Shan, FENG Ai-Qi
    Computer Engineering. 2012, 38(06): 175-177. https://doi.org/10.3969/j.issn.1000-3428.2012.06.057
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the shortcomings of big recognition error and many searching times by the Minimum Directional Derivative(MDD), a modified MDD algorithm is put forward. Local maximum difference of blurred image is calculated to enhance texture details in blurred direction. The blurred direction is obtained by the directional derivation summation curve. Based on the changing regularity of directional derivation summation curve, an iterative searching model which can reduce searching times is proposed to detect blurred direction. Simulation results show that this algorithm not only has high precision, but also executes fast.
  • LI Dan-Jiao, BANG Jin-Ye, FENG Xiao-Yi, WANG Jun
    Computer Engineering. 2012, 38(06): 178-180. https://doi.org/10.3969/j.issn.1000-3428.2012.06.058
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem that the common static gesture features which are used in vision based recognition often only focus on gestures in a single aspect, and lack of effective gesture description for combination of wholeness and local part, this paper proposes an approach which extracts Fourier descriptor as a kind of global feature, and CSS shape descriptor as a kind of local feature, and then combines them into the final feature. Experimental results verify the effectiveness of this new feature on static gesture recognition by its high correct rate 98.3%, compared with traditional approaches.
  • TAN Dui, CHEN Xiu-Hong
    Computer Engineering. 2012, 38(06): 181-183. https://doi.org/10.3969/j.issn.1000-3428.2012.06.059
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Existing algorithms can not effectively use rich labeled and unlabeled sample contains valuable information, which is useful for dimensionality reduction. Aiming at this problem, this paper proposes a novel method called Semi-supervised Locality Preserving Projection (SSLPP). It redefines the between-class similarity and within-class similarity, which is used to maximize the between-class separability and minimizes the within-class separability. In addition, the proposed method preserves the global and locality structure of unlabeled samples. Experimental results in artificial data sets, UCI databases and Olivetti face databases show the usefulness of SSLPP.
  • GAO Xian-Wen, FU Wei, CHU Feng
    Computer Engineering. 2012, 38(06): 184-186. https://doi.org/10.3969/j.issn.1000-3428.2012.06.060
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents an expression recognition method based on Contourlet transform and Locality Preserving Projection(LPP). It divides the face expressions image into three parts: left eye(including their eyebrows), right eye(including their eyebrows) and mouth. By using local Contourlet transform to process the local expression image and original image, it gets the low-frequency components and high-frequency components of the image. Combining with the low-frequency components of local expression image and high-frequency components of the original image, it extracts feature by using LPP algorithm, after that it uses Support Vector Machine(SVM) as the classifier. Experimental results indicate that the method has high recognition rate.
  • YANG Wen, ZHANG Hong-Yi, PU Jie-Shen
    Computer Engineering. 2012, 38(06): 187-189. https://doi.org/10.3969/j.issn.1000-3428.2012.06.061
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To solve the problems of the traditional algorithm based on sparse analysis, the good sparsity requirement of signals, unsatisfactory results in the noise case, the method based on hyperplane membership function is proposed to estimate the mixing matrix fast and precisely according to the assumption of K-SCA. For the good locality of the function, the noise problem which the classical method can not solve can be solved well using the proposed method. Experimental result shows that compared with other methods, the required key condition on sparsity of the sources can be considerably relaxed.
  • WANG Che-Lin, QIN Gui-He, XU Hai-Yi, CHEN Jun-Han
    Computer Engineering. 2012, 38(06): 190-192. https://doi.org/10.3969/j.issn.1000-3428.2012.06.062
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper combines the remote control technology of robot and Internet, and designs a P2P based robot remote control scheme by introducing Network Address Translation(NAT) traversal technology. In the WAN simulation experiment, a platform of P2P mobile robot remote control system is built. The objective of peer-to-peer remote control and mobile robot feedback data display is achieved, making effective use of the limited bandwidth resource, and expanding the control range of remote control part to robot part. The proposed system shows great generality and real-time, in execution and time delay tests.
  • WANG Xiao-Feng, ZHANG Li-Jun
    Computer Engineering. 2012, 38(06): 193-195. https://doi.org/10.3969/j.issn.1000-3428.2012.06.063
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    On traditional computer visual field, the task is widely considered to be independent bottom-up, this causes low recognition rate of image. This paper proposes the facial expression recognition method based on the topology consciousness theory. The method applies the stability of human face topology invariance to abstract the facial outline. And adds the PCA to integrate as the facial large extent characterized information, applies large range priority principle to facial expression recognition, and designs the RBF+Adaboost classification. Experimental results show this method can improve the rate of facial expression recognition.
  • WANG Xuan, WANG Feng, LIANG He-Yan
    Computer Engineering. 2012, 38(06): 196-197. https://doi.org/10.3969/j.issn.1000-3428.2012.06.064
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper describes palmprint verification based on the Contourlet transform and Support Vector Machine(SVM). Palmprint images are normalized in the orientation, position and illumination conditions based on the integrated optical density, central moments, and one order statistics of each sub-band are calculated in their Contourlet domains and regarded as features. A SVM-based classifier is employed to implement recognition. Experimental results show that the recognition rate is higher than that of palmprint recognition algorithms based on statistical features.
  • XU Min
    Computer Engineering. 2012, 38(06): 198-200. https://doi.org/10.3969/j.issn.1000-3428.2012.06.065
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a new neural network ensembles method for intrusion detection system. In order to improve the diversity among component networks, different training sets are used for training different networks. On the basis of ensuring the numbers of the component networks, the algorithm selects the networks with proper diversity factor. Experimental results show that the performance of this ensemble method is better than the existing popular. While keeping high detection rate, it has a low false positive rate and is also better for unknown intrusion detection.
  • JIAO Li
    Computer Engineering. 2012, 38(06): 201-203. https://doi.org/10.3969/j.issn.1000-3428.2012.06.066
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The problem of low success rate of case retrieval is caused by the first mapping failure of target case in case retrieval algorithm based on the K-means clustering. Aiming at this problem, this paper proposes a case retrieval algorithm based on the sliding window and analyzes the maintain strategy of sliding window. It utilizes the sliding window to collect the cases which have high weight and recently the most frequency of use so that it adds the sampling number of case and improve the speed of case retrieval. Experimental results show that the algorithm can improve the success rate of retrieval, and obtain the better performance at the aspect of the retrieval time and the mapping number of target case.
  • TAO Ta-Wei, WANG Hui-Qin, HU Yan
    Computer Engineering. 2012, 38(06): 204-206. https://doi.org/10.3969/j.issn.1000-3428.2012.06.067
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Through analyzing the movement rule of early fire smoke, traditional single background difference method and adjacent frame difference method can not effectively solve the light and noise influence and background can not update itself. This paper presents a new segmentation method based on block and background self-adaptive, extracting the movement part. In order to segment the smoke suspected area, it establishes the smoke color model in RGB space and the brightness change model in HSV space respectively. The high/low frequency energy eigenvalues is obtained through discrete wavelet transform in gray space. Meanwhile, the average displacement distance value and phase value are obtained based on L-K optical flow algorithm. The eigenvalues are combined and used to determine whether the suspicious region is smoke or not. Many experiments are carried out and result proves the robustness of the method is strong. The method improves the accuracy of smoke detection.
  • ZHANG Juan, DAN Yong-Zhao, MAO Qi-Rong, JU Xiang
    Computer Engineering. 2012, 38(06): 207-209. https://doi.org/10.3969/j.issn.1000-3428.2012.06.068
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    By analyzing the biology background and mathematical properties of Gabor wavelet and sparse representation, a new approach for facial expression recognition based on Gabor wavelet and sparse representation is presented in this paper. Gabor wavelet transformation is adopted to extract features for the static facial expression image. The over-complete dictionary is constructed by the Gabor features of all training samples and sparse feature vector of this facial expression image is obtained by using sparse representation model. It uses a fusion recognition method for implementing multiple classifiers fusion. Experimental results show that integrating Gabor wavelet transformation and sparse representation is more effective for extracting expression image information. The approach effectively raises the accuracy of expression recognition.
  • SU Qing-He, CHENG Gong, WANG Zhi-Jiang, LEI Yong-Ji
    Computer Engineering. 2012, 38(06): 210-212. https://doi.org/10.3969/j.issn.1000-3428.2012.06.069
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a remote sensing image correction method based on SA-WPSO. The geometric polynomial model is used as early correction of images to obtain polynomial coefficients, an improved hybrid optimization algorithm SA-WPSO is used to optimize the polynomial correction factor, and the optimized polynomial is utilized to the final geometric correction. Experimental results show that compared with correction algorithms based on quadratic polynomial and cubic polynomial, improved method has higher precision and better robustness.
  • GONG Beng, YU Zhen-Meng
    Computer Engineering. 2012, 38(06): 213-215. https://doi.org/10.3969/j.issn.1000-3428.2012.06.070
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a blurred image restoration model based on zero boundary pixels. By analyzing the causes of horizontal motion blur, it establishes matrix format of blurred model. The restoration model is perfected with conditions of zero boundary pixels to reduce cycle interference. Experimental results show that compared with Wiener filtering method, image restoration effects are better with the model when there is no noise.
  • WEN Pei-Zhi, HUANG Jin-Fang, NING Ru-Hua, TUN Xiao-Jun
    Computer Engineering. 2012, 38(06): 216-218. https://doi.org/10.3969/j.issn.1000-3428.2012.06.071
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes an algorithm based on tensor voting to extract the boundary of active contour. It encodes the image and transforms it to a second order symmetric semi-definite tensor. Each input tensor takes spare voting to neighboring points through a predefined tensor field. After voting, the tensor collects acquired votes and takes dense voting for getting salient feature of contour. The boundary is extracted by implementing extremal algorithm for salient feature. Experimental results show that the algorithm can extract contour edge for image and get better active contour model of object.
  • LI Wen-Jie, HE Jia-Feng
    Computer Engineering. 2012, 38(06): 219-220. https://doi.org/10.3969/j.issn.1000-3428.2012.06.072
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Because the general thining algorithms often generate problems such as multiple-pixel width and excessive corrosion, this paper proposes an improved rotation invariant thinning algorithm named A-W algorithm. The original image is smoothed by Gaussian smoothing filter, and then is thinned the first time by using the A-W thining method which adds three groups of thining templates and four new kinds of thining templates are designed to achieve the second thining. Experimental results show that the proved algorithm can better keep connectivity of the curve, keep the details of the main features, and after thinning of the image smooth without burr.
  • LONG Xi-Hua, HAN Bei, YANG Xin-Jia
    Computer Engineering. 2012, 38(06): 221-223. https://doi.org/10.3969/j.issn.1000-3428.2012.06.073
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper summarizes four indexes, including color transfer efficiency, art perception effect, expected intention of image and the possibility of offering new products and service, which can be used as the evaluation criterion for the effect of color transfer. According to the actual problem, it establishes an evaluation model for the image color transfer based on Analytic Hierarchy Process(AHP). By establishing the judgment matrix, and finding the largest eigenvalue and the weight, consistency test and ranking of the alternatives, the final results of the evaluation are gained. Experimental result shows that the model gets a reasonable outcome.
  • FU Yong-Qiang, JIANG Ling-Ling, LIU Di-Ming
    Computer Engineering. 2012, 38(06): 224-226. https://doi.org/10.3969/j.issn.1000-3428.2012.06.074
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The context-based adaptive variable length entropy decoding quoted in H.264/AVC video coding standard can greatly reduce data redundancy and improve the decoding efficiency, meanwhile the complexity of Context-based Adaptive Variable Length Coding(CAVLC) decoding is increased. In this paper, a rapid and effective new entropy decoder which is based on entropy decoding algorithm is proposed. The decoder realizes entropy decoding to video compression streaming. In this process, parallel processing way is imported, and binary tree method is improved. Waveform simulations for the proposed decoder in QuartusⅡ7.2 and hardware implementation using FPGA prove the correctness of the design for proposed entropy decoder, besides, the proposed decoder has better performance in savings in hardware resources and decoding speed.
  • WANG Qi-Jun, HU Rui-Min, WANG Zhong-Yuan
    Computer Engineering. 2012, 38(06): 227-229. https://doi.org/10.3969/j.issn.1000-3428.2012.06.075
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes an intra-frame template matching prediction algorithm with boundary texture consistency. Boundary texture consistency constraint is formulated and added to the determination criteria of intra template matching with the purpose of improving the correlation between the generated prediction and current block’s neighborhood. Experimental results show that the enhanced template matching prediction based on boundary texture consistency outperforms intra-frame template matching prediction by an average of 0.11 dB and maximum of 0.17 dB. The new intra-frame coding algorithm can improve the coding efficiency of intra-frame template matching prediction and have good potentials in next generation video coding standard formulation.
  • JI Wen-Guang, AN Gang, GONG Zheng-Bei
    Computer Engineering. 2012, 38(06): 230-232. https://doi.org/10.3969/j.issn.1000-3428.2012.06.076
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In view of the problem that the gray projection algorithm can not deal with low contrast ratio image sequences accurately, this paper presents an Electronic Image Stabilization(EIS) algorithm based on gradient projection method. It can utilize the distribution of the image gradient to estimate motion according to the advantage of gradient feature changes violently intra-frame and changes steadily inter-frame. Experimental results demonstrate that the algorithm can effectively improve the motion estimated accuracy under low-light level image sequence.
  • SHU Dong-Dong, HE Jia-Ming, FAN Ling-Hui
    Computer Engineering. 2012, 38(06): 233-235. https://doi.org/10.3969/j.issn.1000-3428.2012.06.077
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to implement smooth playback of streaming media in real time by mobile terminals aiming at the high complexity of loop filtering in H.264/AVC and limited mobile terminals resource, this paper proposes a new approach for optimizing loop filtering algorithm and screen display. The improved method is put forward based on sequence of loop filtering and the calculation of boundary strength. The method can take full advantage of the storage speed advantage of register and spatial correlation of image, combining with the characteristics of Symbian platform, and the output image of screen is optimized with double buffering and direct screen access. Experimental results demonstrate that the approach not only can improve the speed of decoding, but also can make fluency of the screen better.
  • LIU Li, LI Xiao-Ju, LI Ling-Ling
    Computer Engineering. 2012, 38(06): 236-237. https://doi.org/10.3969/j.issn.1000-3428.2012.06.078
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For unidirectional, uniqueness and robustness of robust video hashing, mathematical model is built for the video hashing scheme based on the 3D Discrete Wavelet Transform(3D-DWT), and the unidirectional of the scheme is proved, using the unconditionally secure of cryptology. It computes the probability density of hamming distance between the referenced hashing sequence and the calculated hashing sequence, and proves theoretically the uniqueness of the video hashing scheme based on 3D-DWT and the scheme based on 3D Discrete Cosine Transform(3D-DCT) under the same condition. According to the theoretical and experimental results, analyze the robustness of the two schemes under different attacks and conclude that the uniqueness and robustness of video hash are interact on each other.
  • DING Wen, ZHANG Gao-Beng, HU Feng-Sha
    Computer Engineering. 2012, 38(06): 238-240. https://doi.org/10.3969/j.issn.1000-3428.2012.06.079
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes an improved rate control algorithm for the basic-unit layer encoder of JVT-H017. Adopting a new weighted time and space model to predict the Mean Absolute Difference(MAD) and according to the Human Visual System(HVS) characteristic to design a weighted Y component of Peak Signal to Noise Ratio(PSNR), it recalculates the picture complexity of current basic-unit layer with the new MAD and PSNR, which highlights the importance of Y component compared to UV component, and then allocates target bits with above. Experimental results show that compared with the algorithms of JVT-H017, proposed algorithm is closer to the target bit, the average error rate reduces 0.269%. The average of PSNR raises 0.278 dB. The proposed algorithm still ensures the quality of the video after transporting in the 3G wireless channel.
  • CHEN Bin, YANG Hong-Zhen, WANG Li-Wen
    Computer Engineering. 2012, 38(06): 241-243. https://doi.org/10.3969/j.issn.1000-3428.2012.06.080
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the temperature turbulence problem of aircraft deicing heating system, this paper presents the single neuron PID control strategy which combines the advantage of conventional PID control with artificial neuron control. By building the mathematical model of aircraft deicing fluids heating system on the basis of data gathered by experiments, simulation of single neuron PID control is executed. Results show that the single neuron PID control strategy performs effectively on the temperature turbulence problem of aircraft deicing fluids heating system.
  • WANG Xiao-Yan, YANG Xian-Wen
    Computer Engineering. 2012, 38(06): 244-246. https://doi.org/10.3969/j.issn.1000-3428.2012.06.081
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at SM3 cryptographic Hash algorithm released by state cryptography administration, the general working flow of the algorithm is summarized in this paper. Based on Field Programmable Gate Array(FPGA) platform, the IP architecture of the SM3 is proposed, and the optimization design of its relevant crucial path is discussed. Choosing three Cyclone FPGAs of Altera corporation as the target devices, the fast implementation of the SM3 is achieved and is compared with some other existing research fruits. Comparison results indicate that the IP implementation of the SM3 consumes smaller logic element and memory bit but has higher algorithm performance. It can provide the algorithm engine for the development of cryptography System on Chip(SoC) products in practice.
  • LUO Xiao-Min, CHU Shi-Liang, TANG Zhi-Jiang, LING Yu, HUA Meng
    Computer Engineering. 2012, 38(06): 247-249. https://doi.org/10.3969/j.issn.1000-3428.2012.06.082
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Based on some thorough analysis of OSEK/VDX specification, this paper presents how to design an 8 bit OSEK/VDX-based Real- time Operating System(RTOS)——FDOSEK from the task schedule, resource management and event mechanism, and then realizes its kernel on the MC9S08DZ60 chip of Freescale. It tests the task schedule time and storage requirements. Test results show that FDOSEK is suitable for automotive electronics industry with a strong real-time capability and low storage requirements.
  • DONG Wen-Hong, YI Bei, LI Fei
    Computer Engineering. 2012, 38(06): 250-252. https://doi.org/10.3969/j.issn.1000-3428.2012.06.083
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to solve the air route plan problem of unmanned mine-laying aerial vehicle, the Memetic algorithm is adopted and simulated. The Particle Swarm Optimization(PSO) is selected as the main planning method while the simulated annealing algorithm is applied in the local search to complete the whole process of route planning. Taking the practical necessary of mining, the route plan simulation system of UMAV is designed. By OpenGL programmer in MFC of the Visual C++, the process of flying is simulated, and a 3-D route planning simulation platform is established by GUI in Matlab.
  • HUANG Qi, DAN Guo-Fei, LING Rui, YAN He-Biao, HUANG Xiao-Wei
    Computer Engineering. 2012, 38(06): 253-255. https://doi.org/10.3969/j.issn.1000-3428.2012.06.084
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Combining the work principle of photovoltaic system and sliding mode control, this paper proposes a Maximum Power Point Tracking(MPPT) control scheme of photovoltaic system. The sliding mode control is applied to MPPT of the system. It includes improving the transform circuit, and designes the sliding mode variable structure controller. Experimental results show that this scheme can fast track the solar cells maximum power point, make the system working stability in the maximum power point nearby, reduce the output power, voltage fluctuations and overshoot, and weaken the steady of chattering sliding mode control.
  • CHEN Hua-Li, TUN Qiong
    Computer Engineering. 2012, 38(06): 256-258. https://doi.org/10.3969/j.issn.1000-3428.2012.06.085
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For the poor real-time of collision detection algorithm, based on bounding volume and spatial decomposition, this paper proposes a hybrid collision detection algorithm. By constructing AABB boxes of the objects can rule out the disjoint objects quickly, the algorithm does spatial decomposition test to realize fast collision detection of the virtual environment objects. Compared with the classical Rapid algorithm, experimental results show that the algorithm can save test time, and improve the efficiency of collision detection effectively.
  • ZHANG Zhi-Wei, LIU De-Di, SHU Jin-Hui, YUAN Kun-Gang, WANG He, JIANG Dao-Gang
    Computer Engineering. 2012, 38(06): 259-261. https://doi.org/10.3969/j.issn.1000-3428.2012.06.086
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper focuses on the problem that there is no integration framework in distributed aerospace simulation, and proposes a research on STKX and HLA-based aerospace simulation system. It develops a STKX adaptor which can support variable parameter and contain all CONNECT commands. Object oriented encapsulation is conducted on basic RTI and a HLA adaptor including runtime library and auxiliary supporting tools are created. It creates a space-ground integrated simulation framework based on the two level STKX adaptor and HLA adaptor. Application result shows the framework can simplify call process, and enhance the execution efficiency.
  • MA Bao, LUO Xiao-Min, CHU Shi-Liang, CHEN Hao, CHOU Rui
    Computer Engineering. 2012, 38(06): 262-264. https://doi.org/10.3969/j.issn.1000-3428.2012.06.087
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to overcome the shortages such as the incomplete test routes and high redundancy in traditional operating system test by using the classification tree method, this paper comes up with a flow chart method which takes the system service interface as target and is divided by the type of conformance class. It also assesses the importance of each interface. This test method can fully list all kinds of combinations of each interface in the called process. So it not only raises the rate of test coverage, but also reduces coding work via code reuse, which improves test efficiency. The outcome shows that the workload by using this method is only two-thirds of that in the traditional method.
  • LIU Xiao-Dan, LIU Yan
    Computer Engineering. 2012, 38(06): 265-268. https://doi.org/10.3969/j.issn.1000-3428.2012.06.088
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the characteristics of urban road in high-resolution remote sensing image, this paper presents an approach to extract the urban road from high-resolution remote sensing images based on Hough transform and path morphology. The method uses Hough transform to detect the direction and the length of main roads, and to construct the adjacency graph, according to each direction adjacency graph determine the path. These paths can be regarded as narrow, the elongation but not completely straight structure elements. Experimental results show that it not only can detect straight road information easily, but also can detect the wide crooked road information and the curvature of smaller slender road information.
  • LI Jing-Xian, LI Xiao-Run
    Computer Engineering. 2012, 38(06): 271-272. https://doi.org/10.3969/j.issn.1000-3428.2012.06.090
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Because the repair time is not taken into account, Dijkstra algorithm can not find the optimum path in a traffic network after earthquake. To solve the problem above, an improved Dijkstra algorithm with repair time is proposed in this paper. It considers the influence factors of repair time. The side is not connected until it is repaired. In order to pass the side, waiting for it to be connected is needed. According to this idea, the Dijkstra algorithm is improved. It uses mathematical induction to prove the desired path of the improved algorithm is the shortest path. Experimental result shows that the time of this algorithm to find the optimum path is less than Dijkstra algorithm.
  • WANG Guang, QIU Yun-Fei
    Computer Engineering. 2012, 38(06): 273-275. https://doi.org/:10.3969/j.issn.1000-3428.2012.06.091
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A plant model based on fuzzy neural network is proposed. Measured physiological data of plant are used as the input of fuzzy neural networks. The model can automatically learn and fit plant growth function and extract rules of plant growth. The plant growth is driven by carbohydrate. The structural attributes of virtual organs are modified by physiological process. The model can automatically adjust parameters of growth function and growth rules in response to environmental heterogeneity. Experimental results show that this method can accurately extract the growth function and growth rules, vividly simulate the growth of plant.
  • MA Yu, WANG Hao-Tong, ZHANG Bing-Jiang, LI Wei-Meng, WANG Pan, GUO Shao-Jun
    Computer Engineering. 2012, 38(06): 276-278. https://doi.org/10.3969/j.issn.1000-3428.2012.06.092
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the needs of the management of messages for data-link simulation system, this paper proposes a message management model of data-link system. It uses the messages’ properties, the transmission process and the queuing theory to establish the messages generating and close-looped message transmission framework with feedback. It analyzes the management performance of messages with different priority under non-preemptive priority mode and preempted priority mode. Analysis result shows that this system can satisfy the requirement of message serves quality, and that priority rule and closed loop can keep the system safe and stable.
  • WU Chi-Gong, CENG Feng
    Computer Engineering. 2012, 38(06): 279-281. https://doi.org/10.3969/j.issn.1000-3428.2012.06.093
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aho-Corasick(AC) algorithm needs big memory space spending, and is not conducive to the hardware realization. In order to solve this problem, this paper proposes an AC multiple pattern matching algorithm. This paper analyzes the AC algorithm, and uses bitmap storage technique and compressed technique to improve the AC algorithm. Through running an experiment from patterns and length of modes, result shows that this algorithm can improve the speed of pattern matching and pattern visiting.
  • YUAN Man, LI Jin-Rong, GAO Dun-Chao, FAN Zhong-Yu
    Computer Engineering. 2012, 38(06): 282-284. https://doi.org/10.3969/j.issn.1000-3428.2012.06.094
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Combing with the status of enterprise application integration based on Geographic Information System(GIS), this paper puts forward a User-Entity-Application(UEA) model, which is based on metadata-driven and has none relationship with the GIS workbench lonbuilder. It defines an algorithm for automatic integration and constructs a series of models to support application integration based on GIS. The method of UEA with ArcGIS Server for development platform is well applied to the application system integration on distributed oilfield production area, which meets the need of the GIS integration of Daqing oilfield.
  • HUANG Jing, TUN Dun-Min, LI Li-Feng, JIANG Nan, SHU Xiao-Dong, SHU Yu
    Computer Engineering. 2012, 38(06): 285-287. https://doi.org/10.3969/j.issn.1000-3428.2012.06.095
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper divides virtual machine communication into three types according to the implementation of inter-Virtual Machine(VM) communication in different levels, compares inter-VM communication performance between the three communication methods from performance, transparency and portability, and proposes an efficient communication strategy for the virtual machine. This proves that the virtual machine based on shared memory communication is the best overall performance of virtual communication methods, and proves that hardware register based with best performance, and proposes a combination of the two virtual machines communication methods to achieve a communication strategy.
  • ZHENG Jiang-Hua, A De-Li-?Rou-Zi
    Computer Engineering. 2012, 38(06): 288-290. https://doi.org/10.3969/j.issn.1000-3428.2012.06.096
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the service demands based on Geographic Information Technology(GIT) of Uyghur language users, this paper proposes an Uyghur weather information service based on WebGIS. It takes the weather information service as application field, integrates Google Maps API as map service component and real time Yahoo Weather RSS as dynamic weather information. It uses the Web page custom font technology to solve the problem of the Uighur expression and VS2005 development tool to develop the system. Application results show that the system can offer built-in tools, and realizes the real-time searching of Uyghur weather information.
  • FENG Xin, ZHANG Yan, GU Zhi-Cheng
    Computer Engineering. 2012, 38(06): 291-292. https://doi.org/10.3969/j.issn.1000-3428.2012.06.097
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    LT code is a kind of fountain code. When data with degree 1 is proceeded while using BP decoding algorithm, the decoding has to be stopped, which causes stop-set empty, consequently affects the decoding efficiency. This paper proposes a new decoding algorithm for this problem which called the secondary decoding. It carries on a further decoding for the remaining encoding packets with translatability after decoding is stopped. Simulation results show that the secondary decoding increases the efficiency of decoding. When the cost of decoding is between 0.2 and 0.5, the decoding efficiency is generally improved by 20%.