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

20 September 2011, Volume 37 Issue 18
    

  • Select all
    |
    Networks and Communications
  • HUANG Beng, XU Jin-Yang, YUAN Yong-Quan
    Computer Engineering. 2011, 37(18): 1-3. https://doi.org/10.3969/j.issn.1000-3428.2011.18.001
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper describes a niching multi-objective Particle Swarm Optimization(PSO) algorithm. The algorithm applies ring neighborhood topology, which does not require any niching parameters. Hence, it can resolve the problem of traditional parameters setting. Non-dominated sorting and dynamic weight method are used to select the best particles. To enhance the global exploratory capability, a mutation operation is to operate when the crowding-distance decreases to the required precision. The proposed algorithm is tested by five well-known benchmark test functions ZDT1~ZDT4 and ZDT6. Simulation results prove that this algorithm performs better than those classical algorithms do in convergence and diversity.
  • BO Yan-Hui, WANG Tao, LI Hua
    Computer Engineering. 2011, 37(18): 4-6. https://doi.org/10.3969/j.issn.1000-3428.2011.18.002
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Balancing network traffic is one of the important problems for LEO satellite network. An approach of balancing network traffic by combining the merit of Genetic Algorithm(GA) and linear programming is given. The corresponding load balancing algorithm is designed. And it is simulated in NS2. Result shows that it has good performance in distributing network traffic among ISLs for network traffic balancing, which is an advantage to improve network average throughput.
  • YANG Ying-Chao, WANG Ti-Gang, DENG Wei-Jiang, LI Ren-Bing
    Computer Engineering. 2011, 37(18): 7-9. https://doi.org/10.3969/j.issn.1000-3428.2011.18.003
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Analogous circuit fault diagnosis is influenced by parameter selection of classical machine learning approach, the result of classification relies on parameter whether suitable or not, that is unable to carry on diagnosis online. This paper proposes an analogous circuit fault diagnosis model based on Relevant Vector Machine(RVM) from the sparse Bayesian theory, and improves the weight renewal algorithm. The hypothesis threshold value picks out unrelated weights before they approach infinity, this can reduce the algorithm running time and speed up the weight refresh. RVM can infer the discriminant function under the Bayesian framework. Moreover, it can obtain posterior probability of each classification, thus can judge the degree of classification result confidence, assist diagnosis decision-making. The result indicates that RVM need less relevance vectors than support vector machine with comparative default accuracy, sparser and generalizing. It suits to online fault detection.
  • WEI Dong-Mei, ZHOU Wei-Dong
    Computer Engineering. 2011, 37(18): 10-11. https://doi.org/10.3969/j.issn.1000-3428.2011.18.004
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper introduces the theory of Compressive Sensing(CS), and three main problems and their solutions when using CS for face recognition. The over complete dictionary is formed by using the training set, and the random matrix with Gaussian entries builds the sensing matrix with normal row vectors. In the test stage, the sensing matrix is projected onto the test vector, and the minimum l0-norm solution is computed with Orthogonal Matching Pursuit(OMP) algorithm. The distance between the reconstruction vector and the train vector is employed to determine the class of the test data. Experiment results show the CS promising aspects for face recognition has high accuracy and efficiency.
  • LI Xue, HE Yu-Yao, WU Ai-Sheng
    Computer Engineering. 2011, 37(18): 12-15. https://doi.org/10.3969/j.issn.1000-3428.2011.18.005
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The heterogeneous surveillance sensor network energy consumption model which can balance the energy consumption and maximize the network lifetime is established. Based on the model and considering the factors of node energy restriction and data integrality, the network lifetime model of heterogeneous surveillance sensor network in hexagon coverage condition is presented. The optimal solution of the network lifetime model is obtained in hexagon coverage condition when the intra-cluster and inter-cluster key nodes almost run out of energy at the same time. Based on the network lifetime model, the minimum node density for satisfying a given lifetime constraint is gotten.
  • CUI Jian, LI Jiang, TUN Xia
    Computer Engineering. 2011, 37(18): 16-18. https://doi.org/10.3969/j.issn.1000-3428.2011.18.006
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    One airborne radar database with a large scale contains massive continuous attributes and categorical attributes. An improved algorithm of fuzzy association rule mining is presented. It improves the computational efficiency of frequent itemsets by introducing the DAG and the byte-vector structure for reducing the I/O overhead generated during the database mining. Meanwhile, the algorithm defines new fuzzy measure to enhance the recognition probability of the positive rules. Experimental results show that the algorithm has a better performance than the traditional algorithm.
  • LEI Han-Liang, LI De-Jun, YANG Can-Jun, JIN Bei, CHEN Ying
    Computer Engineering. 2011, 37(18): 19-21. https://doi.org/10.3969/j.issn.1000-3428.2011.18.007
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem of long-term continuous observation for deep seafloor environment, a deep seafloor observatory network based on underwater junction box is designed. The deep seafloor observatory network consists of shore station control center, underwater junction box and seafloor observatory sensors. Embedded industrial personal computer and microcontroller unit are used to implement data collection and electric energy management for underwater junction box. This paper focuses on the hardware and software design scheme of the deep seafloor observatory network. Experimental result shows that the system can be used for the long-term continuous real-time observation in the special high-pressure deep seafloor environment.
  • JI Hui-Fang, HAN Wen-Bao, LIU Lian-Dong
    Computer Engineering. 2011, 37(18): 22-24. https://doi.org/10.3969/j.issn.1000-3428.2011.18.008
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Several identity-based signcryption schemes for multiple Private Key Generator(PKG) are proved security in random oracle model, a new identity-based signcryption scheme for multiple PKG is proposed with security proof in standard model. The confidentiality against adaptive chosen ciphertext attack is obtained under DBDH assumption, and the unforgeability against adaptive chosen message attack is derived under the CDH assumption. Compared with the existing schemes, the new scheme’s signcryption phase is more efficient.
  • WU Guo-Jiang, LIN Bao-Jun, ZHANG Shan-Cong
    Computer Engineering. 2011, 37(18): 25-27. https://doi.org/10.3969/j.issn.1000-3428.2011.18.009
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    By the use of PCI Express interface, and parallelization and pipelining technology, the rate of read and write is raised. A reasonable Flash Translation Layer(FTL) algorithm is designed, the great convenience data management without reducing read and write performance is supplied. The design is implemented on the Virtex 5 FPGA, and its performance is tested. The consecutive write rate is about 400 MB/s, and read rate is up to 500 MB/s. This can meet the demand for high level application.
  • XU An-Bin, WU Jian-Feng, BAI Shuo
    Computer Engineering. 2011, 37(18): 28-31. https://doi.org/10.3969/j.issn.1000-3428.2011.18.010
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Focusing on building the low-latency trading system, this paper gives definition of the securities trading latency and presents the analytical framework and the breakdown of trading latency. The key technologies of operating systems, message middleware, applications, and performance testing and tuning for building a low-latency trading system are studied. In each part of that, existing methods and techniques of eliminating or relieving corresponding latency are discussed and the developing trends of which are provided. It concludes that systematical analysis methodology should be applied and continuously tuning and optimizing should be conducted for building a low-latency trading system.
  • LI Xiao-Qiang, CUI Jian, CA Li-Zhi
    Computer Engineering. 2011, 37(18): 32-34. https://doi.org/10.3969/j.issn.1000-3428.2011.18.011
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Because UML statecharts is different from traditional stateflow charts, traditional method to get test path is not suitable for UML statecharts. This paper gives out a method of getting test path from UML statecharts by analysis of every UML statecharts level and combination of concurrent substate. It is proved that this method can get test path from UML statecharts.
  • CUI Xia, GAO Jian-Hua
    Computer Engineering. 2011, 37(18): 35-37. https://doi.org/10.3969/j.issn.1000-3428.2011.18.012
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the defects of automatic method for test scene generation, it standardizes the designator of fork-join pair, adds some data structures such as ant memory body, system information body and so on, processes multinest fork-join pair by recursion. The paper presents an activity diagram example of Shanghai Metro line 6 and tests the validity of the improved anti-ant algorithm.
  • FANG Gang
    Computer Engineering. 2011, 37(18): 38-40. https://doi.org/10.3969/j.issn.1000-3428.2011.18.013
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In spatial topology association mining, in order to extract topology association rule with given spatial layout relation, this paper proposes an algorithm of topology association rule mining based on spatial layout constraint, which is able to extract topology association rule with spatial layout constraint in multi-spatial relation patterns. The algorithm turns spatial relation transaction into integer, and refactors weight vector of non-target spatial object class via spatial layout constraint, and decreases refactoring weight value to generate candidate frequent item set, and computes its support via Boolean operation. When mining topology association rule with given spatial layout relation, the algorithm is faster and more efficient than traditional mining algorithm by these ways.
  • JIA Ting, ZHONG Cai-Meng, CHEN Hui
    Computer Engineering. 2011, 37(18): 41-43. https://doi.org/10.3969/j.issn.1000-3428.2011.18.014
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Nodes in the same community are connected densely, and nodes from different communities are connected sparsely. According to this character, if two nodes and any other one node can constitute three-node complete subgraph, the two nodes are considered in the same community. Some nodes are not satisfied with complete subgraph, or are satisfied with complete subgraph for different communities at same time. A node rate of community ownership is proposed for solving those problems. The algorithm is not requested to set any parameters, and it is tested on the computer-generated and real network. Experimental results show the effectiveness and correctness of the algorithm.
  • WANG Gang, CHE Ying, LV Min, ZHOU Yu-Feng, LIN Bing-Yin
    Computer Engineering. 2011, 37(18): 44-46. https://doi.org/10.3969/j.issn.1000-3428.2011.18.015
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The ontology based transformation method from Computation Independent Model(CIM) to Platform Independent Model(PIM) is divided to two parts: the discovering of meta-ontology mapping rules and transformation execution based on meta-ontology mapping rules. The first one is its basis. It is necessary to provide an effective mapping discovering method for realizing transformation. The meta-ontology is abstracted based on meta-models in CIM and PIM. Combined with the similarity based ontology mapping technology, ontology mapping relationships between them are formulated, which are taken as the foundation of semantic matching reasoning in transformation. An example is given for validating the practicability and feasibility of proposed theories.
  • HUANG Hui-Min, LIU Qiu-Rang, ZHANG Kai-Long
    Computer Engineering. 2011, 37(18): 47-49. https://doi.org/10.3969/j.issn.1000-3428.2011.18.016
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    After analyzing the special self fault-tolerant requirements of embedded systems in safety critical applications, a formalization method of critical tasks and a self fault-detect mechanism is studied and proposed. A new policy-based self-recovery mechanism is researched for embedded multi-tasks software, which allows the embedded system to recovery faults of tasks according to the run-time status and the special policy. The realization of all the methods and technology is useful to advance the self fault-tolerance capability of the whole embedded system without any redundancy hardwares.
  • CHEN Pan-Ping, LI Xiang
    Computer Engineering. 2011, 37(18): 50-52. https://doi.org/10.3969/j.issn.1000-3428.2011.18.017
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to represent the relation between different Web service classes, service requester’s preference as well as internal relation between different Quality of Service(QoS) factors in Web service composition, this paper proposes a determination algorithm of Web service composition based on QoS relation. And in evaluating the quality of service composition, it can consider relations on QoS properties between different service classes to some extend. Result shows algorithm holds good executive efficiency, stability as well as outstanding selecting result.
  • YANG Lei, LI Xian-Guo, ZHANG Xiao
    Computer Engineering. 2011, 37(18): 53-55. https://doi.org/10.3969/j.issn.1000-3428.2011.18.018
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For the energy consumption of network storage system, this paper establishes an energy consumption model which relates to system expansion and workload. By the methord of analyzing each module’s energy consumption in network storage system and combined with an actual system testing, it analyzes the energy consumption architecture about network storage system, further more, it describes each module’s atomic energy consumption and the energy consumption related to model workload in the system. By comparison, the model is proved to be able to reflect the true situation of system.
  • YU Wen-Ju, SUN Xin, LI Fei-Feng, FU Feng, LIU Yan-Hang
    Computer Engineering. 2011, 37(18): 56-58. https://doi.org/10.3969/j.issn.1000-3428.2011.18.019
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a new generation algorithm for Peer-to-Peer(P2P) network topology with controllable clustering according to the analysis of P2P network connect behaviors. It analyses the generation and development of directed weighted network. The algorithm can effectively control the clustering coefficient by regulating the connection area. Experimental results indicate that the algorithm can model the P2P network with power law distributions of node degree and strength.
  • LIU Yu, DAI Hong-Jun, GUO Feng-Hua, DIAO Guo-Ling
    Computer Engineering. 2011, 37(18): 59-61. https://doi.org/10.3969/j.issn.1000-3428.2011.18.020
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to solve data synchronization interruption caused by instability of mobile communication network, this paper uses Extensible Markup Language(XML) to design incremental synchronizable network protocol, and tags-bit to record incremental synchronization information. The protocol achieves the incremental synchronization process by coordinating of database and file system to improve the system performance and security. The incremental file transfer technology used in the protocol can improve the efficiency of data synchronization. The network protocol is applied to a dormitory management system on mobile phone with Android. Experimental results show that the system supports transmission interrupt and the reliability of the data synchronization is improved.
  • TUN Yi-Zhi, JIA Pan-Ling, HU Gong-An, DIAO Chen-Xu
    Computer Engineering. 2011, 37(18): 62-64. https://doi.org/10.3969/j.issn.1000-3428.2011.18.021
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To meet the high reliability and real-time transmission needs of industrial monitoring Wireless Sensor Network(WSN), an improved hierarchical Collection Tree Protocol(CTP) called MM-CTP is proposed. The link-layer Markov chain analysis model for the IEEE 802.15.4 WSN is built. The link-quality estimation method of the CTP is improved to calculate routing gradient value and setup the routing hierarchy. The MM-CTP is implemented on the TinyOS and runs on TinyOS mote SIMulator(TOSSIM) simulation platform. Experimental results show the MM-CTP satisfies the reliability and real-time requirement of industrial monitoring network.
  • ZHOU Yu, ZHOU Gong-Qiong, XIE Qiang-Wei, WANG Xiao-Dong
    Computer Engineering. 2011, 37(18): 65-67. https://doi.org/10.3969/j.issn.1000-3428.2011.18.022
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at quality evaluation of IP network problem, this paper proposes an evaluation model of subjective and objective fusion by using Back Propagate(BP) neural network. The two neural networks of subjective and objective characteristic are self-adapting learned separately until the output is stable. The two BP neural networks are resonated mutually, and the subjective evalution and objective evalution are fused each other by the resonance learning of two networks. An accordant evaluation is obtained after the resonance study. Simulations of users subjective evaluation and many objective indexes of IP network are practiced, which indicate that the fusion model in this paper has stronger performance of noise resistance. The fusion model can better satisfy the composite requirements of IP network quality evaluation.
  • HU Xiao-Ning, WU Guo-Feng, HU Gan-Yang
    Computer Engineering. 2011, 37(18): 68-70. https://doi.org/10.3969/j.issn.1000-3428.2011.18.023
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to maximize the spectrum sensing efficiency in the interference-limited primary systems, this paper proposes an optimization scheme for cooperative spectrum sensing mechanism in Cognitive Radio(CR) system. It defines the system model, jointly optimizing the crucial sensing parameters of sensing duration, transmission duration and the numbers of CR users participating in cooperative spectrum sensing. Simulation results show that the proposed scheme is capable of maximizing the spectrum sensing efficiency while satisfying the interference-limited.
  • YANG Shu-Chun, YANG Rui-Juan, XIAO Yu-Fen
    Computer Engineering. 2011, 37(18): 71-73. https://doi.org/10.3969/j.issn.1000-3428.2011.18.024
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    An improved reliable multicast routing protocol is presented based on On-demand Multicast Routing Protocol(ODMRP). The protocol using NACK aggregation is to contain number of control group as precondition. The loss events of data packet in amount are centralized in an aggregated NACK. The aggregated NACK is added into Join Table group to realize the retransmission by father node to get reliable ODMRP communication. Simulation result shows that the packet delivery ratio of the improved protocol enhances mostly up to 2.5%.
  • WANG Lei, CA Huan-Dong, KONG Jie
    Computer Engineering. 2011, 37(18): 74-76. https://doi.org/10.3969/j.issn.1000-3428.2011.18.025
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents an eMule file download control method for Kad network based on keywords poisoning pollution and Kad index pollution. It gets ED2K link of the specific file from the Web Server, parses the link to get the attribute information of the file. According to pollute the dictionary of keywords and the dictionary of file index by fake information which created by the attribute information to control the propagation of eMule file in Kad network. Experimental result shows that this method can delay the connections time between eMule peers to achieve the purpose of eMule download file control.
  • HE Zhong-Yang, LI Ou, YANG Bai-Wei, LIU Xiang
    Computer Engineering. 2011, 37(18): 77-80. https://doi.org/10.3969/j.issn.1000-3428.2011.18.026
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a formal description method of TCP protocol based on Timed Colored Petri Net(TCPN). Three parameters of sequence number, confirmation number and data unit are adopted to describe the packet more accurately. A time parameter is introduced to evaluate the performance of the protocol. The model is closer to the actual running order agreement because of timeout retransmission, flow control and validation data piggyback transmission. CPN Tools is used for modeling dynamic simulation, and its result proves the correctness of the model.
  • LONG Dun-Bei, HONG Hai-Bin, CHA Dai-Feng
    Computer Engineering. 2011, 37(18): 81-83. https://doi.org/10.3969/j.issn.1000-3428.2011.18.027
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to solve the problem that adaptive time-frequency distribution method is invalid in α stable distribution noise environment, this paper proposes an improved Fractional Low-order Adaptive Time-frequency Distribution(FLO-ATFD). And it proposes Fractional Low-order Short Time Adaptive Time-frequency Distribution(FLO-STATFD) to analyze time-frequency distribution of long-time signals and process signals on-line in α stable distribution noise environment. Simulation results indicate that two methods perform effective time-frequency distribution analysis in α stable distribution noise and Gaussian distribution noise environment.
  • CHEN Bai, WANG Li-Li, LI Yu-Xian, DU Shuo, HAO Xiao-Chen
    Computer Engineering. 2011, 37(18): 84-86. https://doi.org/10.3969/j.issn.1000-3428.2011.18.028
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to increase the energy utilization ratio of Wireless Sensor Network(WSN), this paper proposes a connected cover set construction algorithm based on energy consumption balance named EBACCS. It takes the probable cover model as foundation, divides the target area by using Voronoi graph, and gets redundant nodes of network. Some necessary connected nodes from the redundant nodes are chosen to build an optimized connected cover set according to the energy right value function. Theory analysis and simulation show that EBACCS ensures the connectivity and coverage of network, balances the energy consumption of nodes and prolongs network lifetime.
  • NA Xiang, QIN Gui-He, DONG Jin-Nan, GAO Xiang
    Computer Engineering. 2011, 37(18): 91-93. https://doi.org/10.3969/j.issn.1000-3428.2011.18.030
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper designs and implements a vehicle-mounted Media Oriented System Transport(MOST) network management system based on Finite State Machine(FSM) model. It uses central registry mechanism to manage MOST network address resources, distributes each node’s logical address dynamically so as to realize plug and play working way of multi-media equipments and constructs the finite automaton model in order to manage MOST network system state. Test results show that this system can enhance the flexibility, stability and compatibility of vehicle-mounted MOST network, and it can satisfy the demand for plug and play working way of car entertainment information system.
  • BO Wen-Hu, ZHANG Rui-Hua
    Computer Engineering. 2011, 37(18): 94-96. https://doi.org/10.3969/j.issn.1000-3428.2011.18.031
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the data collection problem of Wireless Sensor Network(WSN), this paper presents an improved Minimum Weighted Sum First(MWSF) algorithm. Improved algorithm using A* algorithm to find the shortest distance between sensor nodes, chooses the next sensor node which mobile sink can access by MWSF algorithm. The mobile sink reaches the sensor node and collects the data of other sensor nodes in single-hop communication range. Simulation results show that the algorithm reduces data overflow and guarantees more effective data transmission.
  • BAO E-Ping, JIANG Li, SHU Xiao-Mei
    Computer Engineering. 2011, 37(18): 97-99. https://doi.org/10.3969/j.issn.1000-3428.2011.18.032
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper researches the primary user’s detection based on cyclostationary characteristic in non-Gaussian noise. Combining with multiple cyclostationary characteristic of primary user, through summation criteria and maximum criterion, spectral correlation functions of multiple cyclic frequencies are integrated to improve the reliability of detection results. On the basis of equal weighted sum criteria, according to different levels of cyclostationary characteristic on different cyclic frequencies, a weighted summation criterion based on spectral correlation function is proposed. Simulation results show that the cooperation of multiple cyclic frequencies can improve detection results; the weighted summation criterion has better detection performance than equal weighted summation criteria.
  • CHEN Ku-Da, TUN Zhen-Jiang
    Computer Engineering. 2011, 37(18): 100-102. https://doi.org/10.3969/j.issn.1000-3428.2011.18.033
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Time delay and jitter resulting from mobile termination handoff between the Access Point(AP) are serious impact on the quality of real-time business. In order to solve this problem, this paper proposes a fast handoff scheme based on access point. It uses a two-stage trigger mechanism to reduce the workload of mobile termination and AP, utilizes improved priority neighbor cache mechanism to avoid cache outflow coming from frequent switch, uses neighbor AP information table and switching decision strategy make out the best target AP. Analysis and experimental results show that this scheme has the high safety and low network throughput and power consumption, and it can effectively reduce the 77% handoff delay.
  • GUO Jian-Feng, CHEN Xiao-Jun, KE Jia, CHEN Jie-Jue
    Computer Engineering. 2011, 37(18): 103-105. https://doi.org/10.3969/j.issn.1000-3428.2011.18.034
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to make the fusion of different geographic dimension of data types reasonable, this paper proposes a Generic Search Tree(GiST) structure based on the sub-cluster topology. It uses the location information to establish node cluster, and uses GiST algorithm to cluster in the region to block all organizations and the establishment of tree topology. Simulation results show that this system based on GiST structure has a good multi-dimensional characteristics. It has better performance than other topologies.
  • SHAO Hai-Xia, LIU Jiong, LI Zhi-Yong, WEI Jin
    Computer Engineering. 2011, 37(18): 106-108. https://doi.org/10.3969/j.issn.1000-3428.2011.18.035
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Because of the problem of preempting more Label Switched Path(LSP) with higher priority when Min_BW algorithm optimizes the priority of LSPs to be preempted, this paper proposes Improved_Min_BW(I_Min_BW) algorithm based on Min_BW algorithm. In order to optimize the priority of LSPs to be preempted, I_Min_BW algorithm considers the number of LSPs to be preempted and the highest priority of LSPs to be preempted and the sum of priority of LSPs to be preempted. It analyzes and compares two algorithms from the perspective of theory and simulation study and shows that the performance of I_Min_BW algorithm is better than Min_BW algorithm in optimizing the priority of LSPs to be preempted as well as the number of LSPs to be preempted.
  • FENG Wen-Jiang, ZHANG Zhi-Zhong, JIANG Wei-Heng
    Computer Engineering. 2011, 37(18): 109-111. https://doi.org/10.3969/j.issn.1000-3428.2011.18.036
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper studies the multi-traffic resource allocation and schedule strategy in Wireless Regional Access Network(WRAN). Based on the features of Cognitive Radio(CR), an improved multi-traffic schedule algorithm is proposed. Through calculating the priority of different traffic Quality of Service(QoS) requirements in single user, at the same time, considering the schedule fairness between multi-users, the proposed algorithm selects the optimal channel of traffic schedule for users and dynamic adjusts the QoS priority by use of outage management in transmissions. Simulation results show that the algorithm can guarantee multi-traffic QoS requirements for single users and fairness between multi-users, while utilizing the bandwidth effectively.
  • WANG Dong-Dong
    Computer Engineering. 2011, 37(18): 112-114. https://doi.org/10.3969/j.issn.1000-3428.2011.18.037
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Bit parallel, Bit Vector(BV) and Aggregated Bit Vector(ABV) algorithms are the most representative of the parallel packet classification algorithm. The algorithms accelerate the classification speed by parallel processing multiple domains, but because the data structure used too much memory usage, not suitable for large rules sets of applications. To address this issue, Compressed Bit Parallel(CBP) algorithm is proposed, by compressing repeated rules on each domain, and reorganized set of rules, greatly reducing the length of bit string which in bit map, thus reducing memory space occupancy. Experimental result proves that the CBP algorithm in the firewall environment saving 35% memory than the BV algorithm, saving about 60% than the bit parallel algorithm, and the algorithm has a good performance under access control list environment.
  • WANG Li, YI Hui-Ti, CHEN Bin, HU Hong-Lin
    Computer Engineering. 2011, 37(18): 115-117. https://doi.org/10.3969/j.issn.1000-3428.2011.18.038
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper studies the dynamic spectrum allocation problem in wireless networks under the Coordinated Dynamic Spectrum Access(CDSA) model. Considering spectrum demands of base stations, it formulates spectrum allocation under physical interference models as a nonlinear optimization problem. It proposes a demand-driven dynamic spectrum allocation algorithm in wireless networks by transforming this nonlinear optimization problem into linear programming problem. The proposed algorithm computes initial spectrum allocation and then applies iterative enhancement. Simulation results show that the proposed algorithm outperforms the existing algorithms in effective spectrum utilization efficiency and in average satisfaction degree.
  • LV Zhuo, FAN Lei
    Computer Engineering. 2011, 37(18): 118-120. https://doi.org/10.3969/j.issn.1000-3428.2011.18.039
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the Domain Name System(DNS) attack, this paper proposes a simple and robust detection mechanism. The core of this mechanism is based on the inherent DNS protocol behaviors and applies an instance of change point detection algorithm to detect attack behavior. To make the detection mechanism insensitive to attack and low computational complexity, based on the nonparametric Cumulative Sum(CUSUM) algorithm, it makes some improvements in view of DNS protocol behavior. Simulation results show the mechanism can detect the DNS attack, it makes good compromise between the detection rate and the false alarm rate.
  • LIU Jiu-Fen, FU Lei, ZHANG Wei-Meng
    Computer Engineering. 2011, 37(18): 121-123. https://doi.org/10.3969/j.issn.1000-3428.2011.18.040
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents a new information hiding algorithm used for binary image with a small distortion, aiming at the feature that the changing trace is obvious in binary image. The selection criteria of turning point is presented and the set of pixels suitable for turning is denoted. Considering the visual features, the method for computing the scores of the turning pixels is presented. An image block containing the turning pixel can be viewed as a cover block containing the hidden data after the threshold of choosing the turning point is set up. The binary image is divided into blocks, and the STC(Syndrome-trellis Codes) encoding is used to choose the optimal path in the sequence of cover blocks for hiding message. Experimental results show that the proposed algorithm can reduce the distortion of the cover image, and the stego image has good visual effect, while the statistical properties of the variance of L-type in a binary image can be maintained. Therefore, it can be effective against the related steganalysis.
  • ZHANG Jing
    Computer Engineering. 2011, 37(18): 124-126. https://doi.org/10.3969/j.issn.1000-3428.2011.18.041
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The paper analyzes the user name and password storage methods and their risks on the internet. On this basis, it analyzes MD5 message digest encryption weaknesses and deciphering means. In response to these decoding methods, it proposes an iterative algorithm based on MD5. This algorithm is immune to the second birthday attack, meanwhile improve the complicates of the the first birthday attack. It is also useful for rainbow table attack. The algorithm can enhance password security features, thereby enhancing the network information transmission and storage security.
  • CHEN Lan-Xiang
    Computer Engineering. 2011, 37(18): 127-130. https://doi.org/10.3969/j.issn.1000-3428.2011.18.042
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Some security threats exist in file services of data center, such as access without authorization. A session-based secure Web file service model is established. It is described and analyzed in formal. To separate computing and storage resources, the idea of separating the meta-data from file resource data is introduced. According to the threats of the model, corresponding security model and protocol are established. Performance test based on Apache show the model has higher security and better practicability.
  • MIAO Fu, WANG Zhen-Xin, ZHANG Lian-Cheng
    Computer Engineering. 2011, 37(18): 131-133. https://doi.org/10.3969/j.issn.1000-3428.2011.18.043
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to detect malicious codes which utilize encryption technology and tunnels encapsulation, a new malicious code detection model based on traffic statistical fingerprinting is presented. The packet-level features and flow-level features are extracted from each flow in a training set. The flow-level features are filtered by the Principal Component Analysis. The detection model is constructed after malicious code’s traffic statistical fingerprinting is got from these features’ probability density functions. Experimental results indicate that this model can effectively detect encrypted or tunneled malicious codes.
  • LIU An-Cong, HUI Dong-Li, ZHANG Hua
    Computer Engineering. 2011, 37(18): 134-135. https://doi.org/10.3969/j.issn.1000-3428.2011.18.044
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    It is an important challenge to find out a suitable key establishment protocol for Wireless Sensor Network(WSN) due to limitations of energy, computation capability and storage resources. Many traditional protocols are not suitable. This paper presents a certificateless authentication and key agreement protocol for WSN. The protocol does not need for certificate management, and solves the key escrow problem in the identity-based cryptography. The new protocol achieves kinds of the desired security attributes, and it keeps the nice computational efficiency compared with other protocols.
  • SHU Dun-Jie, WEI Li-Xian, YANG Xiao-Yuan, TAO Wu-Jun
    Computer Engineering. 2011, 37(18): 136-138. https://doi.org/10.3969/j.issn.1000-3428.2011.18.045
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    H.264 video includes a great deal of motion vector information. This paper mentions concept of motion offset based on motion vector, and a novel steganography scheme on motion vector of H.264 video is proposed. When searching for hiding place, motion offset connects both movement and phase angle. Compared with other algorithms in the motion vector, the algorithm locates more hiding place. Experimental results show that the algorithm has large capacity and well fidelity.
  • WANG Gan, SHU Hui, LI Xiang, HUANG He-Ji
    Computer Engineering. 2011, 37(18): 139-141. https://doi.org/10.3969/j.issn.1000-3428.2011.18.046
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a method based on dynamic binary analysis to analyze malicious code behavior and designs and implements a prototype malicious behavior analysis system based on DynamoRIO. Experimental results show that the system can capture Application Programming Interface(API) functions calling sequence and transfer parameter information completely. Based on correlative analysis of the calling sequence and the parameter information, malicious behaviors which cover files, the registry, services, processes, threads and so on are identified.
  • ZHANG Xin-He, ZHANG Ru-Hua, BAI Ru-Xue, LIU Hong-Yan
    Computer Engineering. 2011, 37(18): 142-144. https://doi.org/10.3969/j.issn.1000-3428.2011.18.047
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper introduces an optimization of Advanced Encryption Standard(AES) with 128-bit block length and key length. It can speed up execution on ARM microprocessor. The block and key are processed as arrays of bytes that are formed by dividing these sequences into groups of 4×4 to form arrays of bytes. The row mix, opposite row mix and key extension are optimized. The optimized algorithm is realized in S3C2440 processor by loop unrolling and iterative loop. Experimental results show that AES can be realized efficiently on ARM process, and consume less ROM.
  • CA Zhi-Wei, WANG Li-Bin, MA Chang-She
    Computer Engineering. 2011, 37(18): 145-147. https://doi.org/10.3969/j.issn.1000-3428.2011.18.048
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper using the subgroup decision assumption proposes an identity-based efficient short group signature scheme by using the hierarchical identity-based group signature construction method. It allows new members to join in the group dynamically without updating the group public key and other group members’ private signing keys. The length of the signature is independent of the amount of the group members, and the group manager can not forge any other member’s signature. Experimental results show that, this scheme satisfies anonymity, unforgeability, traceability and non-frameability of the security requirements of group signature under Chosen Plaintext Attacks(CPA). This scheme is more efficient and the length of the signature is shorter.
  • WANG Jing, WANG Bing
    Computer Engineering. 2011, 37(18): 148-150. https://doi.org/10.3969/j.issn.1000-3428.2011.18.049
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The robustness of watermark is largely influenced by texture of image background, texture, edge and so on. This paper proposes an image watermark algorithm based on Discrete Cosine Transformation(DCT) domain and texture complexity, including preprocessing the watermark information, and calculating each image block’s variance and sort the value, then transferred by DCT. It also calculates each varied image block’s variance and sorts the value. It insets the watermark image block which goes through the variance yields sort into the carrier image. Experimental results show that the algorithm compared with the primitive DCT-based transformed watermark algorithm has great robustness and invisibility.
  • HAN Jie-Sai, CHEN Jian-Jing
    Computer Engineering. 2011, 37(18): 151-153. https://doi.org/10.3969/j.issn.1000-3428.2011.18.050
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In this paper, a new steganalysis for Model-based(MB) steganography of JPEG images is proposed. MB lead the veins distributing of image tending to be accordant, but airspace gradient can measure veins of image commendably. So the new method use airspace gradient by transform of MB steganography, combined with calibration and re-embedding technology. Experimental results validate that this method is good at detecting MB1 and MB2 with low false rate.
  • HU Sai-Yuan, ZHENG Tao
    Computer Engineering. 2011, 37(18): 154-156. https://doi.org/10.3969/j.issn.1000-3428.2011.18.051
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Cross-site Scripting(XSS) attack can attack a user’s Web browser when the user visits Web applications which evil scripting code is injected into. According to the problem proposed above, this paper makes a research on the server-client cooperation XSS defense method. When uses methods such as policy file, Document Object Model(DOM) integrity test and scripting obfuscation monitor, it can ehance the detection efficiency and accuracy. Experimental results show that, this method can get good attack defense effect.
  • CAO Su-Zhen, WANG Cai-Fen, CHENG Wen-Hua, ZHANG Yu-Lei
    Computer Engineering. 2011, 37(18): 157-159. https://doi.org/10.3969/j.issn.1000-3428.2011.18.052
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at aggregation signature scheme for the low efficiency of existing defects, this paper proposes a new certificateless aggregation signature scheme based on bilinear pairing. This scheme uses binding techniques and hash functions with the public key binded into the partial private key generating and signature algorithms. It can solve the problem that certificateless public key cryptography in the presence of two public key substitution attack. Analysis demonstrates that the scheme can prevent existential forgery under adaptive chosen-message attacks assuming. Compared with the known solutions, the proposed scheme has less calculating cost.
  • WANG Pei-Dong, CONG Die-Shu, LIANG Li-Li
    Computer Engineering. 2011, 37(18): 160-163. https://doi.org/10.3969/j.issn.1000-3428.2011.18.053
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In accordance with the existing problem that the random key pre-distribution scheme of wireless sensor network can not acquire the high network connectivity probability and reach strong resilience against the nodes compromise simultaneously, a novel key pre-distribution scheme based on double chaotic map is proposed. In the scheme, the chaotic map is introduced to generate the chaos sequence with good randomness and self-correlation property. Nodes only need to preload a few ID keys in the pool and can establish pair-wise keys amongst all the sensor nodes with high probability. In addition, this scheme improves the method to generate the session key, reduces the probability of the key being cracked. The theoretical analysis and simulation experiments show that the whole network can afford the best security to the node capture attack and perform good ability in network connectivity.
  • WANG Feng-Ling
    Computer Engineering. 2011, 37(18): 164-166. https://doi.org/10.3969/j.issn.1000-3428.2011.18.054
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyzes the formation of the Chinese abbreviations, defines the morphology similarity between two words, and proposes the story similarity computation method based on the longest string matching. It explores the usage of this similarity computation method in the Chinese report link recognition system. Experimental results show this method performes well, reduces the normalized detection cost by 12.96%, and greatly improves the performance of the story link recognition system.
  • GAN Zao-Bin, SHU Chun-Chi, XIAO Guo-Jiang
    Computer Engineering. 2011, 37(18): 167-170. https://doi.org/10.3969/j.issn.1000-3428.2011.18.055
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Existing researches on multi-agent multi-issue negotiation are based on the assumption that the relationship among issues is independent and weights are given fixed. To solve these problems, an issue grouping algorithm is presented in this paper. The function of computing the initial value of a single issue’s weight and the rule of calculating the weight of issue group are given by means of moving average method and case-based reasoning. In addition, a dynamic weight algorithm for group changing is studied. Compared with similar operations in existing multi-issue negotiation models, the interdependency of mutli-issue can be solved well and the dynamic weight evaluation can be implemented, the negotiation result is more scientific and more reasonable.
  • NIU Wu-Ze, DAN Lin-Suo, JIN An-Zhi, LI Chi-Lai, BAI Xiang-Feng
    Computer Engineering. 2011, 37(18): 171-173. https://doi.org/10.3969/j.issn.1000-3428.2011.18.056
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Moving object detection is the basic technology of intelligent video surveillance. The background of scene is modeled on every pixel in traditional algorithms which performs poorly in the scenes with waving leaves and rippling water. Aiming at the problem of background disturbance in dynamic scenes, a kind of time and space information fusion target detection algorithm is put forward. In this algorithm, spatial background information is extracted by incremental Principal Component Analysis(PCA). Decision is made by combination with three frame difference method extracting information of time domain. Experimental results show this algorithm can effectively extract moving targets in dynamic scenes and performs better than Gaussian Mixture Model(GMM) algorithm.
  • SHU Ning-Bei, ZHANG Chun-Feng, ZHENG Bi-Juan
    Computer Engineering. 2011, 37(18): 174-176. https://doi.org/10.3969/j.issn.1000-3428.2011.18.057
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Due to the problem of high complexity and lack of adaptability, an algorithm based on adaptive LBP for video text detection is put forward. The algorithm uses the divided difference of global and local pixel grey to determine the size of adaptive threshold. However, it, having strong adaptability, can maximize the removal of background. At the same time, to reduce the complexity, approximate round masking which simplifies the algorithm by covering multi-direction judgments is presented. Experimental results show that the proposed algorithm can detect characters accurately even in video with complex background, and it is of strong adaptability and good practicality, also has low complexity.
  • QIU Guo-Qiang, JIE Wen-Ban, XU Xun-Li, LIAO Wei, WANG Che-Dian
    Computer Engineering. 2011, 37(18): 177-179. https://doi.org/10.3969/j.issn.1000-3428.2011.18.058
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the combined optimized problem for transportation mission distribution and vehicle routing, this paper gives out the improved genetic algorithm with two dimension chromosome. It builds the mathematic model. With natural number coding, it designs selection, crossover, mutation, inspecting operator, and the key parameters, the end conditon of the algorithm. It develops experimental platform based on C#, and by test, the performance of the algorithm is proved to be pretty good.
  • LI Yu-Qi, GAN Run-Sheng, YANG Yong-Gong, SHI Shui-Cai
    Computer Engineering. 2011, 37(18): 180-182. https://doi.org/10.3969/j.issn.1000-3428.2011.18.059
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper studies different features based up on the type of noun phrase in Chinese coreference resolution based on machine learning, and proposes features selection strategy to be applied to coreference resolution, the approach selects pronouns and other noun phrases features respectively, so this method can reduce some “noise” and utilize features effectively. Experimental results show that the method can improve the performance of coreference resolution system, and F-measure reaches 80.72%.
  • CAO Ju, HOU Hua-Qing
    Computer Engineering. 2011, 37(18): 183-184. https://doi.org/10.3969/j.issn.1000-3428.2011.18.060
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Inspired by explosion of fireworks(bomb), a new intelligence search algorithm is proposed, which is called Explosion Search Algorithm(ESA). One theory defined as neighborhood search is proposed in ESA and the algorithm includes three important operator: explosion search operator, moving operator, mutation operator. This new algorithm has stronger ability of global search as well as local search. And it also has fast convergence and good stability features. Simulation result using standard benchmark functions and comparison with other algorithms proves the efficiency of the new algorithm.
  • CHEN Jian-Dong, WANG Xiao-Meng
    Computer Engineering. 2011, 37(18): 185-187. https://doi.org/10.3969/j.issn.1000-3428.2011.18.061
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For Least Squares-Support Vector Machines(LS-SVM), model selection techniques based on re-sampling strategy suffer from high computational burden. To solve this problem, this paper proposes a new model selection method——order criterion, based on a penalization of the model complexity. A new fast robust algorithm is given for estimating the tuning parameter. Simulation study shows the proposed method is the huge merit over the fast bootstrap strategy on computational time, at the same time it is close to the Fast Bootstrap(FB) on both model prediction accuracy and model robustness.
  • LI Wei-Sheng, SONG Tun-Bin, ZHOU Li-Fang
    Computer Engineering. 2011, 37(18): 188-189. https://doi.org/10.3969/j.issn.1000-3428.2011.18.062
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For the use of Locality Preserving Projections(LPP) for face recognition and the real flow is damaged by noise, this paper presents a new method, named HaarLPP method, to solve the noise. The method uses Haar wavelet transformation to reduce the effect of noise. Face recognition is completed by the LPP dimensionality reduction and the nearest neighbor criteria. Experimental results based on AT&T and Sheffiled face database show that the method is superior to the traditional LPP algorithm in term of the noise sensibility.
  • ZHANG Ru-Qin, DING Xu-Ling
    Computer Engineering. 2011, 37(18): 190-191. https://doi.org/10.3969/j.issn.1000-3428.2011.18.063
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to solve the problem of selection of the center cover, this paper combines fitness function of the genetic algorithm with covering algorithm, and presents an improvement on neighborhood covering algorithm. Most samples are covered, and fitness function is designed. Decision weights are calculated by using neural networks and sensitivity of the method of combining. Experiments show this algorithm which searches the best coverage center in the sample space, ensures that the coverage is stable, and the number is less.
  • CHEN Zhi-Long, GUO Ta-Liang, TAO Jian-Min, LIN Zhi-Xian, XU Qing
    Computer Engineering. 2011, 37(18): 192-194. https://doi.org/10.3969/j.issn.1000-3428.2011.18.064
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to achieve automatic detection of the phone keys, this paper proposes a method to recognize the phone keys. It uses the multichannel Gabor filter to filter the images, detectes local energy extremum as the feature vectors, and recognizes the keys by the feature vectors. It proposes a method with estimating the rotation angle of the target image based on frame aspect ratio of the keys, and improves the efficiency of matching algorithm. Experimental result shows that the identification rate of recognition method proposed here is over 90% in the case of various disturbances and it is available.
  • XU Ji, ZHANG Yu-Jin
    Computer Engineering. 2011, 37(18): 195-197. https://doi.org/10.3969/j.issn.1000-3428.2011.18.065
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper investigates a facial expression recognition system based on variant sampling method and different scales of local Gabor features optimized by Principal Component Analysis(PCA)+ Linear Discriminant Analysis(LDA). The sampling method not only reduces the need of compute time and storage memory, but also improves the recognition rates. The result obtained from the sampling in the vertical direction expresses that this direction includes much more facial expression information. Also the influence on facial expression recognition rates based on variant Gabor filters in different scales and directions can be concluded that the primitive information of facial expression features have redundancy in scales and directions.
  • CHEN Dun
    Computer Engineering. 2011, 37(18): 198-200. https://doi.org/10.3969/j.issn.1000-3428.2011.18.066
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To deal with the following three issues: the high computational complexity, the controversial modeling on the visual cortex relationship, and the blind feature selection due to the characteristics of similar feed-forward framework that exists in Biologically Inspired Model(BIM), this paper proposes to build a smiling face classification system based on BIM. It extracts Pyramid Histogram of Oriented Gradients(PHOG) features form the mouth region of the facial expression image, reduces the BIM feature vector dimensions using Locality Preserving Projection(LPP), and adopts Adaboost algorithm for BIM feature selection. Experimental results demonstrate that the best recognition rate is up to 96.5%.
  • ZHANG Zhi-Hui, TIAN Yu-Ling, YUAN Xin-Fang
    Computer Engineering. 2011, 37(18): 201-203. https://doi.org/10.3969/j.issn.1000-3428.2011.18.067
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the low stability and poor detection performance of the traditional immune algorithm in the network fault detection, an artificial immune system algorithm based on the clonal selection and immune memory mechanism is proposed. In the algorithm, the way that immature detectors added to is adjusted. A method for evaluating the effectiveness of the memory detectors is designed, and the classification strategy is implemented according to the effectiveness of the detectors. Different sub group is imposed different evolutionary strategy. The experiments show that the stability and the detection performance have obvious improvement.
  • XIAO Xuan, XU Pei-Jie-
    Computer Engineering. 2011, 37(18): 204-205. https://doi.org/10.3969/j.issn.1000-3428.2011.18.068
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Amino acid numeric coding model is used to convert protein sequences into numeric sequences, and the protein Hasse matrix is constructed based on partial ordering. It is assumed that proteins belonging to a same class must have some sort of similar texture of the protein Hasse matrix images. Based on this, geometric invariant moment factors derived from the image are used as the pseudo amino acid components to predict G-Protein Coupled Receptor(GPCR) classes in two levels. Through a benchmark dataset, the overall success rates achieved by the test are 92.33% and 85.48% in the first and second level respectively. Experimental results show that this method is viable.
  • TANG Chao-Hui, SUN Wan-Wan, GUI Wei-Hua, LIU Jin-Beng
    Computer Engineering. 2011, 37(18): 206-208. https://doi.org/10.3969/j.issn.1000-3428.2011.18.069
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    With the changes in flotation conditions, fine froth show obvious texture features due to the features of uneven distribution of brightness and great difference of gray level distribution. In order to analyze the relation between texture features of bubble surface and flotation conditions, a multi-resolution analysis method based on wavelet transform is presented. This work aims to extract texture features called uniformity, achieve the quantitative description of bubble surface texture, and acquire the best texture range through analysis. Experimental results in the industrial field show that the method can realize the changes of bubble surface texture in real-time monitoring and provide a basis for production index of floatation to achieve optimal control.
  • SHU Xi-Jun, LIU Da-Zhuan, ZHOU Zhao-Shan, ZHANG Qiu-Lin, LIANG Wen-Hua
    Computer Engineering. 2011, 37(18): 209-210. https://doi.org/10.3969/j.issn.1000-3428.2011.18.070
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a thenar palmprint classification method based on Support Vector Machine(SVM). It uses high-frequency emphasis filter to enhance the thenar palmprint image. Eight textural features which come from four directions are extracted as classification feature vectors. It compares the accuracy rate of classification in different kernel function, results show that the kernel-based SVM method which use combined feature vectors can give the best performance.
  • YANG Xiao-Ji, YANG Yu-Gong, WANG Ci
    Computer Engineering. 2011, 37(18): 211-213. https://doi.org/10.3969/j.issn.1000-3428.2011.18.071
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a multi-focus defocus image restoration algorithm. Basing on the degraded Point Spread Function(PSF), it generates all-focus image from two arbitrarily focused images on the same scene(foreground and background). It can estimate the depth of the object from the relationship between the blur radii and depth. Experimental results prove the validity of the algorithm.
  • QIN Dong, BI Du-Pan, LI Quan-Ge
    Computer Engineering. 2011, 37(18): 214-216. https://doi.org/10.3969/j.issn.1000-3428.2011.18.072
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem that the Intersecting Cortical Model(ICM) works at a low speed, this paper proposes a Mixed Cortical Model(MCM) used in image processing. It combines Weber’s Law trait of Human Visual System(HVS) and ICM, and in MCM the firing threshold of the nerve cell is set according to the Weber trait, while the pyramid decomposing algorithm is adopt to enlarge the nerve cell’s sensitive field, the property of ICM to transmit synchronous pulse is also adopt in MCM, therefore, the novel model can process images rapidly. Algorithms based on MCM to do image denoising and image segmentation are proposed in the following section, and compares with the algorithm based on ICM. Experimental results show that the algorithm based on MCM yields some promising results and realizes rapid processing.
  • GAO Long, WANG Xiao-Tong, XU Xiao-Gang, WANG Jian-Guo
    Computer Engineering. 2011, 37(18): 217-218. https://doi.org/10.3969/j.issn.1000-3428.2011.18.073
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Nonlinear algorithms have some shortcomings in keeping the image edge when being used in image filtering. This paper defines the edge by the difference of local extrema, and a new image edge-preserving decomposition algorithm is proposed. It adjusts the value of extrema by the weighted mean method, and the basic image can be got by solving an optimistic problem. These steps are repeated to realize the image decomposed into different scales. Experimental results show that compared with other algorithms, the algorithm is more powerful in edge-preserving while smoothing the image.
  • TUN Hao, FANG Xian-Yong, LUO Bin, HE Biao
    Computer Engineering. 2011, 37(18): 219-221. https://doi.org/10.3969/j.issn.1000-3428.2011.18.074
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem that images may be partially blurred because of moving object or out of focus. This paper proposes a method consisting of two steps for detect and extract the blur region automatically. To realize rough position of the blurry and the non-blurry regions, it combines Gaussian mixture model of image gradients in spatial domain and the statistical analysis of power spectrum in frequency domain. According to the results of the rough position, it uses the improved lazy snapping method to realize automatic and precise extraction of the blur area. Experimental results demonstrate the efficiency of the method.
  • JIAO Yang, GAO Feng-Juan, JIANG Pan-Min, BO Zhi-Bin, JIAO Rui-Ping
    Computer Engineering. 2011, 37(18): 222-225. https://doi.org/10.3969/j.issn.1000-3428.2011.18.075
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Planar Voronoi Diagram Search(PVDS) algorithm always searches a fixed number of ripple waves, so its search range is too large. This paper proposes an adaptive search algorithm for ripple waves based on Voronoi diagram named Adaptive PVDS(APVDS). A set of reasonable thresholds are found based on experiments. Whether to terminate the whole search flow after finishing each ripple search depends on the thresholds. Experimental results show that APVDS achieves almost the same Peak Signal to Noise Ratio(PSNR) compared with PVDS, and reduces the search space and the coding time.
  • NA Dong, BI Du-Pan, LI Quan-Ge, HE Yi-Bao
    Computer Engineering. 2011, 37(18): 226-228. https://doi.org/10.3969/j.issn.1000-3428.2011.18.076
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The haze image has the problems of low contrast, low illumination, color distortion and blurry edge, aiming at these problems, this paper proposes a haze image enhancement method based on human visual properties. By using the method of Bidimensional Empirical Mode Decomposition(BEMD), an image is decomposed, and multiple Intrinsic Mode Function(IMF) image layers with different resolution and a trend layer are obtained, then the layers are adjusted according to the proposed vision adaptability model to make it agree with human visual properties. Experimental results show that the enhanced image has an appropriate illumination and contrast, more comfortable to people’s eyes.
  • HU Hui-Xiang, CENG Li
    Computer Engineering. 2011, 37(18): 229-232. https://doi.org/10.3969/j.issn.1000-3428.2011.18.077
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem that Digital Radiography(DR) images have blurred edges and low contrast, this paper uses a method combining wavelet multi-scale decomposition and Chan-Vese(CV) model to expedite the active contour converges to the defect edges. The edge reaches sub-pixel accuracy combining with the improved linear interpolation and the sub-pixel measurement of defects is obtained. Simulation results show that the measuring accuracy of the method is superior to the traditional methods. Experiment on real casting DR images indicates it is feasible and efficient.
  • ZHOU Ku-Chuan, MA Chun-Yong, HAN Yong, ZHANG Chao, CHEN Ge
    Computer Engineering. 2011, 37(18): 233-235. https://doi.org/10.3969/j.issn.1000-3428.2011.18.078
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper designs and complements a curved surface multi-channel stereoscopic projection system to correct geometric distortion in curved surface display system and provides high accurate registration in stereoscopic projection. It maps curved projection surface to the imaginary plane through perspective transformation, converts the plane to render coordinate through re-projection transformation. By constructing a NURBS surface according to the re-projection result, the geometric distortion and biases of stereo images can be resolved in an effective and accurate way. High-performance edge blending is achieved by using Graphics Processing Unit(GPU) accelerating technology. Experimental result indicates that the system has high calibration precision and rendering speed.
  • XIE Yi-Sheng, CHEN Guo-Jiang, TUN Qi-Can
    Computer Engineering. 2011, 37(18): 236-239. https://doi.org/10.3969/j.issn.1000-3428.2011.18.079
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to solve the problems of high frequency road accident and automobile can not go to the freeway under the atrocious weather like dense fog and sandstorm, this paper presents a kind of velocity and distance measurement system by using vehicle-mounted radar. The system with the kernel of 16 bit Ultra Low Power(ULP) microprocessor MSP430F436, adopts the value of anterior target vehicle’s velocity and distance by detecting the frequency and amplitude of the microwave radar sensor’s output maxing signal. And it displays the values at real time. To avoid colliding with the target vehicle ahead, it alarms to drivers in reaction time with light and sound when the measurement is above the critical value. Testing result of experiments indicates that the system has the excellences of high measurement precision, large measuring range, and low power consumption.
  • YAN Shao-Hua, ZHANG Wei, TENG Shao-Hua
    Computer Engineering. 2011, 37(18): 240-242. https://doi.org/10.3969/j.issn.1000-3428.2011.18.080
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A method of density-based local outlier mining method is proposed. The method by use of the dataset of KDD99 experiment, executes feature extraction on 41 properties of the dataset. It exploits density-based clustering to program by pruning on the statistics of processed data sets, cuts off the most intensive data objects in the dataset and reserves the candidated outlier set of object which can not be cut off. It uses local outlier mining method to count the Local Outlier Factor(LOF) of the outlier candidated object and detects anomaly attacks. Experimental results demonstrate that it can guarantee higher detection rate and lower false alarm rate.
  • NIE Yu, LIU Liang, XIE Fan, LIN Dun-Pan
    Computer Engineering. 2011, 37(18): 243-245. https://doi.org/10.3969/j.issn.1000-3428.2011.18.081
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyzes the effect of channel gains on the performance of signal detection in Multiple Input Multiple Output(MIMO) systems, and based on that this paper proposes an intelligent MIMO signal detection algorithm. It dynamically chooses child-node number according to the gains between antennas. While keeping the detection performance close to Maximum Likelihood(ML) algorithm, it can reduce up to 54% extension nodes compared with traditional K-best algorithm. Based on the proposed algorithm, a dynamic reconfigurable Very Large Scale Integrated Circuit(VLSI) MIMO detector is designed and implemented, and it can support 4×4 antennas, demodulates QPSK and 16-QAM signals with throughput up to 800 Mb/s.
  • ZHANG Jian-Wu, YA Huan, BAO Jian-Rong
    Computer Engineering. 2011, 37(18): 246-248. https://doi.org/10.3969/j.issn.1000-3428.2011.18.082
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a design scheme of intelligent family gateway. With the LPC2103 micro-controller and RTL8019AS module, it realizes the intelligent family information processing platform gateway based on the improved User Datagram Packet(UDP) protocol. It takes advantage of present network infrastructure to interconnect with the appliances. And it collects messages and sends corresponding commands to control the terminals to obtain the effect of intelligent networking and information processing. Application results in the Internet of Things(IOT) show that the gateway has good merits of low-cost, real-time, and security.
  • LOU Jian-An, CUI Xin-Feng, ZHANG Zhi-Wu, CHU Jie
    Computer Engineering. 2011, 37(18): 249-251. https://doi.org/10.3969/j.issn.1000-3428.2011.18.083
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In the research of digital circuit evolution, sequential circuit evolution is very hard task because it is inconvenient to be described and simulated for the existence of feedback loop. In this paper, a single-layered fully-connected circuit network model is constructed using D flip-latch and logic gate as the basic element, and the one-to-one mapping existed in the mathematical encoding, circuit topology, and HDL file is established. The method to obtain Hardware Description Language(HDL) file according to circuit encoding is designed, the circuit evaluation process was automated by using of batch processing technology. Experiment of fourfold frequency divider proved the feasibility and validity of the method.
  • HUANG Chao, CHEN Xiang-Xian, HUANG Hai
    Computer Engineering. 2011, 37(18): 254-257. https://doi.org/10.3969/j.issn.1000-3428.2011.18.085
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper designs a safety computer system based on 2 out of 3 redundant structure. The system consists of CPU modules, communi- cation modules and I/O modules. For the data communications between modules the triple modular CPU bus with synchronizing and voting functions, redundant Controller Area Network(CAN) bus and redundant Ethernet are applied. The 2 out of 3 hardware voter by using dynamic plus is implemented in the system outputs. Test result shows that the implemented prototype of 2 out of 3 safety computer system meet the expected goal design.
  • LU Jing, ZHANG Jing
    Computer Engineering. 2011, 37(18): 258-259. https://doi.org/10.3969/j.issn.1000-3428.2011.18.086
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyzes the advantages and disadvantages of current schedule algorithms based on execution strategies for Programming Temporally Integrated Distributed Embedded Systems(PTIDES), considers both event deadline and event execution time, improves the traditional minimum slack time priority algorithm, configures the slack time as event scheduling priority, and presents a new zero slack time priority PTIDES scheduling algorithm——ZSFPTIDES. The example shows that ZSFPTIDES scheduling algorithm avoids mortality of events due to the lack of real-time processing, reduces the rate of event scheduling switch, and optimizes the performance of distributed real-time embedded system.
  • GUO Xiao-Meng, MA Liang-Li, XU Xin-Hua
    Computer Engineering. 2011, 37(18): 260-263. https://doi.org/10.3969/j.issn.1000-3428.2011.18.087
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to realize the information integrity of assembly modeling process, this paper proposes the hierarchical constraint assembly model which is based on assembly object properties. Using the concept of requirement block in this model, and adopting the method that manages the assembly object by way of first blocked then layered, it can analyse complex constraint relation among different blocks and layers in detail, then structure hierarchical constraint assembly graph, and realize the generating algorithm of assembly sequence at last. Experimental results show that the model can express the forming process of assembly sequence, and realize the decomposition and time series of assembly relation, and make the interaction process of each objects, real, simple, and easily operated.
  • HU Hui-Li, CHEN Qiang-Kui, PENG Song-Lin
    Computer Engineering. 2011, 37(18): 264-265. https://doi.org/10.3969/j.issn.1000-3428.2011.18.088
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Traditional methods for evaluating video definition can not be adopted on 3G networks due to the required real-time property. Therefore, a new video definition assessment utilizing Computer Unified Device Architecture(CUDA) technique for meeting the real-time requirement is proposed. Experimental result indicates that the proposed method not only ensures the accuracy in assessment comparing with conventional strategies, but also achieves a significant processing speedup level up to 30.
  • MA Zhu-Jing, ZHANG Jian-Xiong, WANG Yu-Yan
    Computer Engineering. 2011, 37(18): 266-268. https://doi.org/10.3969/j.issn.1000-3428.2011.18.089
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Comparing with existed pseudo-random instruction generation method which is not sufficient and flexible for microprocessor, this paper presents a method that generates instructions oriented to general microprocessor by using constraint solving and building constraint library using C++ program language. This method is applied on the embedded microprocessor to illustrate the usefulness of the approach.
  • LI Hua-Lai, HU Ji-Beng, LIU Zai-Wen, WANG Xiao-Yi
    Computer Engineering. 2011, 37(18): 269-271. https://doi.org/10.3969/j.issn.1000-3428.2011.18.090
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper improves Judicature De-noising Algorithm(JDNA) in intelligent mechanical ventilation bed system. The judicature process is induced into the de-noising disposal of time series in algorithm, which builds a new de-nosing algorithm. On this basis, this paper optimizes key parameters that affect de-noising effects: illegal factor, the number of data used to formulate noise regulation, the first i legislative data weight, the number of largest evidence data. Through improvements upon the algorithm, it is relatively loose for requirements applicable scope of handling signal sequences, wide for applicable scope, the forecasting effect is obvious, to achieve the ideal of the treatment effect.
  • WANG Xiu-Hui, WANG Li-Zhen, BAO Wen-Pan
    Computer Engineering. 2011, 37(18): 272-274. https://doi.org/10.3969/j.issn.1000-3428.2011.18.091
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To promote the transaction efficiency of micropayment system. The thought of the binary tree is used to present a new micropayment system based on self-updatable two-dimensional Hash chain. It values specific evaluation to the node, thus the user can complete the transaction by lbN times( is electronic cash total amount which user can spend). It uses the regeneration method of the multi-Hash chain, and avoids initiation once more by user. Analysis results show its practicability and unforgeability.
  • HU Xu, JIANG Cong-Feng
    Computer Engineering. 2011, 37(18): 275-277. https://doi.org/10.3969/j.issn.1000-3428.2011.18.092
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The difference between embedded systems can cause application program transplanting difficulty. This paper proposes a lightweight multi-platform Graphics User Interface(GUI) library——huG to solve the problem introduced above. The functions of the two library files designed by the library include: part responsible for specific platform and the classes of the system interaction which constitutes to be a backend library. The core library offers basic programming functions to applications. Test results show that huG has reduced structure, easy programming model and good portability.
  • XIE Hua-Yong, XIAO Meng-Qing, LI Bin, CHEN Zi-Liang
    Computer Engineering. 2011, 37(18): 278-280. https://doi.org/10.3969/j.issn.1000-3428.2011.18.093
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Parallel test, whose kernel is task schedule, is one of the key technology of the NxTest. Task schedule algorithm for Parallel Automatic Test System(PATS) based on ameliorated Ant Colony Algorithm(ACA) is brought forward to get the optimization task schedule sequences. And simulation results of Matlab show the validity of ACA. The model of PATS is built based on Timed Colored Petri Net(TCPN). The boundedness, conservation, liveness and fairness of the model are validated based on linear algebra. Results of performance analysis shows that parallel test can improve the utilization rate of instruments greatly and it can save a lot of time.
  • TUN Yong-Long, FU Mao-Qing, LUO Bin
    Computer Engineering. 2011, 37(18): 281-283. https://doi.org/10.3969/j.issn.1000-3428.2011.18.094
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes video clips clustering method based on spectral of correlative graph. It constructs the correlative graph of the video clips, changes it to an adjacency matrix, and extracts the spectral characteristics of adjacency matrix which includes the leading eigenvalues, inter-mode adjacency matrices and inter-mode edge-distance. These vectors are embedded into the pattern space by using Principal Component Analysis(PCA) and Independent Component Analysis(ICA), and k-means method is used for clustering analysis. Experimental results show that the method is effective in distinguishing different types of video clips.
  • LIU Chen, HUI Xiao-Wei
    Computer Engineering. 2011, 37(18): 284-286. https://doi.org/10.3969/j.issn.1000-3428.2011.18.095
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem that the system throughput rate of traditional Radio Frequency Identification(RFID) anti-collision algorithm is usually very low, a new anti-collision algorithm based on Carrier Sense Multiple Access(CSMA) and RFID is proposed. Before sending data, the algorithm increases a protective period, and synchronizes the detective operation, thus increases the accuracy of the detective operation, and reduces the blindness of channel detection. Experimental results show that compared with other algorithms, this algorithm has higher system throughput rate and shorter data transmission delay.
  • ZHENG Bin, CHEN Meng-Xia
    Computer Engineering. 2011, 37(18): 287-289. https://doi.org/10.3969/j.issn.1000-3428.2011.18.096
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    By researching the ASCIIMathML conversion document, a rich text formulas editor design scheme based on ASCIIMathML is presented. The What You See What You Get(WYSWYG) editing formula is realized in FireFox by using JavaScript, Document Object Model(DOM) and XHTML technology. By applying to the Web test editor, it has functions of displaying, reediting, saving and loading formulas, and is much more convenient for on-line editing and transmitting formulas.
  • CHEN Zi-Han, TUN Meng-Hui, YING Jing
    Computer Engineering. 2011, 37(18): 290-292. https://doi.org/10.3969/j.issn.1000-3428.2011.18.097
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Porting mobile applications can be time-consuming, and usually repeats coding work. MDMF, a framework based on Model Driven Architecture(MDA), is proposed to abstract the mobile application model in this paper. With the help of template, abstract Platform Independent Models(PIM) is transformed into platform specific models. This paper focuses on the key technique used in MDMF. Result shows that it is usefulness by developing an application in MDMF to support multi-devices.