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

05 September 2009, Volume 35 Issue 17
    

  • Select all
    |
    Degree Paper
  • ZHAO Hui; LIN Cheng-long; TANG Chao-jing
    Computer Engineering. 2009, 35(17): 1-3. https://doi.org/10.3969/j.issn.1000-3428.2009.17.001
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to realize visual speech synthesis, a satisfied bimodal database needs to be built up. This paper proposes an automatic corpus selection algorithm, according to features of lip pronunciation in video, visual triphone modal is established. Proposed algorithm automatically selects corpus from original corpus. Evaluation function is utilized to score sentences from original corpus. Compared to other bimodal databases, coverage rate, coverage efficiency and high-frequency words distribution are greatly improved, it builds a firm foundation for realistic visual speech synthesis.
  • YUAN Zheng-wu; LI Yu-sen; ZHANG Xue-ying
    Computer Engineering. 2009, 35(17): 4-6. https://doi.org/10.3969/j.issn.1000-3428.2009.17.002
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Documents similarity computing with attribute barycenter coordinate model is a relatively new method, but the semantic information easily loss and is inefficient. For resolving these problems, an improved algorithm based on the attribute barycenter coordinate is presented. The method is inspired from the satisfying degree function in decision-making assessment theory. Matching the points between the intersection of query line and document complex and document barycenter using the new algorithm can keep the character of document vector within the result and improve the precision as well as efficiency. Experimental results show that the recall, precision and value of F1 of the model can increase 2%~4%.
  • WANG Lei; HU Xiao-bo
    Computer Engineering. 2009, 35(17): 7-10. https://doi.org/10.3969/j.issn.1000-3428.2009.17.003
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For the problem that the centralized mechanism for semantic service discovery is becoming a choke point during service discovery and matching, a novel model of Web Services is proposed which makes use of some ideas from the peer-to-peer technology and the clustering method. Both theoretical analysis and simulation results show that this model is able to improve the matching speed as well as to raise the precision, and moreover, it can provide users with of value-added response from Web Services combination, and also deal with the problem of the centralized mechanism for semantic service discovery during the service-oriented computation.
  • JI Shu-juan; LIANG Yong-quan; ZHANG Chun-jin; TIAN Qi-jia
    Computer Engineering. 2009, 35(17): 11-13,1. https://doi.org/10.3969/j.issn.1000-3428.2009.17.004
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem that the common framework which implement the negotiation from the viewpoint of the personalized service and the Agent-based service is still lack, this paper proposes a common framework and a method about how to transform user’s personalized requirement into Agents’ implementation. The implementation steps of Agents are given in detail. The practicability of this framework is specified by the realization and analysis of a typical negotiation case.
  • MA Yu-xin; XIE Jian-cang; LUO Jun-gang
    Computer Engineering. 2009, 35(17): 14-18. https://doi.org/10.3969/j.issn.1000-3428.2009.17.005
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to overcome the disadvantages of classical genetic algorithm of low convergence speed and avoid prematurity, this paper proposes an improved Genetic Algorithm of Directional Self-Learning(DSLGA). The directional information is introduced in local search process of the self-learning operator. And the search direction is guided by the false derivative of the function fitness. By the competition, cooperation and learning among the individuals, best solution is updated continuously. And a deletion operator is proposed to increase diversity. So the prematurity is avoided. In experiments, DSLGA is tested by four bi-dimension functions and three unconstrained benchmark problems, and the results are compared with CGA, MGA, FEP and OGA/Q. It shows that DSLGA performs much better than the above algorithms both in quality of solutions and in computational complexity. So the validity of the algorithm is obvious.
  • CHEN Fei-yun; YANG Jing-xin; LONG Feng
    Computer Engineering. 2009, 35(17): 19-21,2. https://doi.org/10.3969/j.issn.1000-3428.2009.17.006
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyzes several reasons which bring on timing-errors in real-time system, and proposes different monitor methods according to each reason. It analyzes timing errors on PF power control system to find out some key factors affecting the time performance. Experimental results show that those methods offered to handling timing errors in real-time system can work successfully and availably.
  • YUAN Man; LIU Jun-mei; LIU Tie-liang; LI Xiu-jun
    Computer Engineering. 2009, 35(17): 22-24. https://doi.org/10.3969/j.issn.1000-3428.2009.17.007
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Replica management is the efficient method of improving grid performance and reducing client delay. Replica deployment strategy is the key problem of replica management. The simulated annealing algorithm is introduced to the replication deployment strategy. The optimal model and algorithm are given in this paper. The strategy is simulated using OptorSim simulator and the results show that the strategy can be effective in reducing the response time of operation which request the documents and improve the system’s integral performance. The optimization strategy is applied successfully in the Daqing oilfield magnanimity data center duplication disposition.
  • DENG Ya-dan; JING Ning; XIONG Wei
    Computer Engineering. 2009, 35(17): 25-27. https://doi.org/10.3969/j.issn.1000-3428.2009.17.008
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem that current database could not predict pages will be access, this paper presents application Call Graph(CG) model and correlative CG algorithms, and the performance of CG algorithm is analyzed. In the experiments, basing on GKD-Base, this paper realizes CG algorithms, and predicts the pages which will not be accessed in a period of time, then according to the prediction, these pages could be replaced out of page buffer ahead of schedule to optimize buffer space. Experimental results show that the database performance does not reduce after adding CG algorithms in database kernel, and instead, due to buffer space optimization, SQL execution speed is improved.
  • ZHANG Ying-ju; ZHONG Qiu-yan; YE Xin; QIU Jiang-nan; QU Xiao-fei
    Computer Engineering. 2009, 35(17): 28-30. https://doi.org/10.3969/j.issn.1000-3428.2009.17.009
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes an universal mode to represent and store emergency cases based on three-tier structure to avoid the limitation of presenting research that representing one kind of emergency cases at a time only. The mode is proved to be applicable by the development of Case-Based Reasoning(CBR) prototype system which thereby provides an universal platform of representing and storing emergency cases.
  • Software Technology and Database
  • JIN Shun-fu; LI Guo-ping; ZHANG Jin-liang; WANG Yan
    Computer Engineering. 2009, 35(17): 31-33. https://doi.org/10.3969/j.issn.1000-3428.2009.17.010
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Based on Automatic Repeat request(ARQ) operation mechanism, the discrete-time Geom/G/1 queue model with setup is built. With the method of embedded Markov chain, some queue system performance measurements that the length of queue under steady state, waiting time, busy period and busy circle are derived. The formula of the average frame response time, channel utility ratio and system throughput are presented. To explain these formulas, a numerical example is given and a simulation experiment is performed with Matlab.
  • WANG Yi-chen; XU Ping
    Computer Engineering. 2009, 35(17): 34-36,3. https://doi.org/10.3969/j.issn.1000-3428.2009.17.011
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Software Build-In-Test(BIT) is now used widely in embedded area. This paper analyses the general architecture of the embedded system, introduces three types of BIT structure pattern. For each pattern, the arithmetic design is described with real practice. It presents a new BIT approach based on fault injection. Four important phrases in this approach: test requirement analysis, fault injection, test design and result analysis are described thoroughly.
  • ZHANG Jing-feng; LIU Hai-yan; ZHANG Yun-feng
    Computer Engineering. 2009, 35(17): 37-39. https://doi.org/10.3969/j.issn.1000-3428.2009.17.012
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For streaming multicast data transmission in the process of source authentication, this paper presents a solution based on hash tree model. Hash tree is a source certification cost-sharing digital signature technology, and its application to the multicast transmission of streaming media is an effective way to improve the efficiency of the certification. Based on theoretical study and a large number of experiments, it gives a full realization of the process, including sending and receiving data, as well as possible ways to deal with the situation, and does introduction on Net 2.0 platform involves the introduction of key technologies.
  • DUAN Fei-lei; WU Xiao; ZHANG Fan; DONG Yun-wei
    Computer Engineering. 2009, 35(17): 40-42,4. https://doi.org/10.3969/j.issn.1000-3428.2009.17.013
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper studies syntactic tree of combination of conditions and decision, and what is influence of decision of the left and right branches of the syntactic tree, and how it does on results. According to the influence, an algorithm is presented to rapidly generate minimum test case on MC/DC without concerning structure of syntactic tree. An implementation of this algorithm is developed to do an experiment. Comparing with others, experimental data shows that it is excellent to rapidly generate test case set with MC/DC.
  • LIU Mei-ling
    Computer Engineering. 2009, 35(17): 43-45. https://doi.org/10.3969/j.issn.1000-3428.2009.17.014
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The concept and properties of frequent itemsets are introduced. The maximal frequent itemsets is made as clustering basis. A new Clustering Algorithm Based on Maximal Frequent Itemsets(CABMFI) is proposed, which integrates the association analysis and clustering analysis. The relevance between data items is fully used, and need not input the clustering number. It is tested with several datasets. Experimental results show that, compared with traditional distance-based K-Means clustering algorithm, this algorithm can reduce the time cost of computing the distance of objects, improve the efficiency, and has better accuracy. The interpretability of clustering results is also well.
  • PEI Jing; BAO Hong
    Computer Engineering. 2009, 35(17): 46-48. https://doi.org/10.3969/j.issn.1000-3428.2009.17.015
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    By improving the traditional Chinese sentence similarity model, this paper proposes a method based on key words weighted to compute sentence similarity, and a question answer system based on Frequently Asked Question(FAQ) is implemented. This system automatically computes sentence similarity between users’ questions in natural language and questions in FAQ, and returns the answer to the user. It can also automatically update and maintain FAQ. Test result shows that compared with traditional sentence similarity model, this method has more precision in matching question.
  • LIU Dan; XIE Wen-jun
    Computer Engineering. 2009, 35(17): 49-51. https://doi.org/10.3969/j.issn.1000-3428.2009.17.016
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at shortcomings of performance bottleneck in traditional centralized spatial data management systems and the faults that spatial semantic information can not be retained caused by consistent data distribution in Peer-to-Peer(P2P) systems, a grouping P2P network architecture is put forward, as well as a description of the spatial data operation and peer’s joining and departure in the network. Simulation experimental results verify the architecture.
  • CHEN De-hua; GUO Yong-ming; LE Jia-jin
    Computer Engineering. 2009, 35(17): 52-54. https://doi.org/10.3969/j.issn.1000-3428.2009.17.017
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Many applications are required to support both spatial joins and keyword-based search. This paper aims to present efficient methods to answer Keyword-based Spatial Join(KSJ) queries, constructs MIR2-tree indexing structures on the datasets for KSJ, and uses them to answer KSJ with breadth-first traversal method. In addition, some search pruning strategies are applied to enhance the efficiency of MIR2-tree traversing. Experimental results show that the algorithm is effective for keyword-based spatial join queries.
  • LIU Hong-wei; YU Jiong; TIAN Guo-zhong; GONG Hong-cui
    Computer Engineering. 2009, 35(17): 55-57. https://doi.org/10.3969/j.issn.1000-3428.2009.17.018
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the tasks’ dependence and deadline of grid workflow, effective degrees and MIPS of the grid resources, the task priority schedule algorithm based on grid resource forecast is presented. The algorithm uses DAG to find the critical path, obtains the deadline of every task and computes their PRI. The algorithm considers the request of user, the type of resources and re-schedule of failed tasks. Experimental result shows that the algorithm is effective.
  • LV Lv
    Computer Engineering. 2009, 35(17): 58-59. https://doi.org/10.3969/j.issn.1000-3428.2009.17.019
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Logical errors is easy to appear in the process of Ontology designing. It is hard to diagnose and amend these errors by using existing tools for Ontology debugging. Aiming at this problem, this paper proposes an interactive method for Ontology debugging. By analyzing the unsatisfiable concept, it generates correlative questions and automatically repairs the Ontology based on users’ reply. Experimental results show that this method can achieve the repair purpose by a few questions.
  • YUAN Yuan
    Computer Engineering. 2009, 35(17): 60-63. https://doi.org/10.3969/j.issn.1000-3428.2009.17.020
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper takes the non-determinism introduced by decoupling on time dimension as starting point. Through temporal analysis method, the guarantee of the reliable delivery of information in this paradigm is surveyed. After defining the usability of delivery information, it provides the essential computational property on reliable delivery of information to subscriber. It concentrates on the effect of communications infrastructure on reliable delivery of information to subscriber, and devises an event broker which increases dependable degree in Publish/Subscribe(Pub/Sub) system. The result of analysis shows that the computational conditions are vital factors to guarantee durable resource sharing, and the reliable delivery has direct correlations to the active interval of subscription, the delay of subscription, the delay of publication diffusion.
  • SUN Ming-song; YAO Liang; ZHANG Xiao-yi
    Computer Engineering. 2009, 35(17): 64-65. https://doi.org/10.3969/j.issn.1000-3428.2009.17.021
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to promote the Quality of Service(QoS) of streaming Video-on-Demand(VoD) system based on P2P technology, a distributed streaming media caching strategy based on economy model is proposed, which adopts distributed averaging algorithm to compute the popularity degree of video segments, and gives corresponding replacement strategies according to the content popularity degree. Simulation experimental results show this strategy can reduce consumption of server’s load effectively, and obtain better performance.
  • XUE Li-xiang; QIU Bao-zhi
    Computer Engineering. 2009, 35(17): 66-68. https://doi.org/10.3969/j.issn.1000-3428.2009.17.022
    Abstract ( )   Knowledge map   Save
    In order to cluster multi-density dataset, a clustering algorithm based on density-reachable for multi-density is proposed. Grid partition method is used to improve efficiency when computing each point’s density. A clustering starts with the highest density point and uses expansion to form a cluster based on density-reachable and breadth-first strategy. Experimental results show that this algorithm can effectively discover clusters of arbitrary shapes for multi-density and uniformity density data sets with noises. It can get good cluster quality and is more efficient than SNN algorithm.
  • XU Huan-huan; WU Xiu-chuan; WU Jia-wei; LI Jin-cheng; TONG Xiang-rong
    Computer Engineering. 2009, 35(17): 69-70. https://doi.org/10.3969/j.issn.1000-3428.2009.17.023
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problems in scheduling the data-intensive application program of Deadline and Budget Constrain(DBC) resource scheduling algorithm, a novel grid resource scheduling algorithm based on communication cost is proposed, which considers the time constrain and budget requirement of users to select resource nodes as target nodes with higher computation capacity and lower communication cost according to the quantity of computation and communication for users’ operating. By reducing this kind of communication cost, the completed time of the whole application program is reduced. Experimental results show this algorithm can obtain better performance.
  • KOU Yan-ge; JIANG Shui; ZHANG Wei-wei
    Computer Engineering. 2009, 35(17): 71-74. https://doi.org/10.3969/j.issn.1000-3428.2009.17.024
    Abstract ( )   Knowledge map   Save
    The old object-based rank algorithms are not satisfactory because of ignoring the Web features of the object and neglecting the correlation between objects and user’s searching. An improved H-PopRank algorithm is proposed in this paper aiming at these shortcomings by taking the following factors into account such as the Web features of the object, the correlation between objects and searching. The experiments indicate that the H-PopRank algorithm can improve recall level precision average and user’s acceptance.
  • WANG Ping-jing; LIU Xiao-xia
    Computer Engineering. 2009, 35(17): 75-77. https://doi.org/10.3969/j.issn.1000-3428.2009.17.025
    Abstract ( )   Knowledge map   Save
    To solve the problem focuments of repetitive labeling process and Document Type Definition(DTD) verification process executed by the eXtensible Markup Language(XML) access control system for update operators, action type is defined. Using these action types, user queries are distinguished semantically and unnecessary queries are filtered out at the early stage, so memory and other system resources used in Document Object Model(DOM)-based DTD verification process and labeling process can be saved. The proposed access control technique shows better performance in an environment where update queries occur frequently after compared with existing one.
  • ZENG Fan-zhi; XU De-zhi; LI Peng
    Computer Engineering. 2009, 35(17): 78-80. https://doi.org/10.3969/j.issn.1000-3428.2009.17.026
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the current problems that when the mapping algorithms are applied to different mapping tasks, most mapping strategies cannot do different operations on ontology mapping according to the differences existed in ontology and the semantic information of the ontology is not made to full use when integrating each strategy, this paper proposes a self-adapting mapping method. It improves some key strategies, and according to the result of evaluating the multi-strategies, considers whether the different strategies are not integrated by Fuzzy Analytical Hierarchy Process(FAHP). Experimental results show that this method improves the recall and precision of ontology mapping while maintaining currency and stability.
  • QIN Guang-jie; ZHANG Ying
    Computer Engineering. 2009, 35(17): 81-83. https://doi.org/10.3969/j.issn.1000-3428.2009.17.027
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To address the low accuracy of identifying nearest neighbors and bad recommendation performance in traditional collaborative filtering algorithms, the concept of comprehensive interest measure which is a full description of user interest is proposed. Based on this, a novel collaborative filtering algorithm is introduced. Experimental results suggest that this algorithm can efficiently improve the accuracy of computing nearest neighbors and provid better recommendation results than traditional collaborative filtering algorithm.
  • WAN Hong-yun; ZHANG Zhi-li; LI Zhong-rui
    Computer Engineering. 2009, 35(17): 84-85. https://doi.org/10.3969/j.issn.1000-3428.2009.17.028
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a new external sorting algorithm. The algorithm need not to produce original merged segment in advance and can immediately get the anticipant sorting result. Under the particular data and hardware configure, the performance of this algorithm exceeds two-ways balance mergesort and two-ways many steps mergesort. It analyzes the memory space spending of this algorithm, proves its correctness and realizes it in C++ on PC/586.
  • JIANG Jian-jun; WANG Yi-qun
    Computer Engineering. 2009, 35(17): 86-88. https://doi.org/10.3969/j.issn.1000-3428.2009.17.029
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the existing implicit information of rural social security system in China, association rules mining of data stream has become an important research to the system. Owing to this, this paper presents several processes to produce association rules and the method of correspondence realization. It includes the replacement method in sampling of data stream and MFI-TCQ method in producing frequent itemsets. It introduces the producing of association rules tree and gives an example to explain.
  • ZHONG Qin; WU Shi-liang
    Computer Engineering. 2009, 35(17): 89-91. https://doi.org/10.3969/j.issn.1000-3428.2009.17.030
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The character of business model and requirement model are introduced. The computing model framework in Model Driven Architecture(MDA) is extended. The ideas of multiple views division and refining by step in ARIS structure are given. The MDA-oriented enterprise management software model is set up. The elements and the advanced relation between models are researched. On this basis, an enterprise management software model based on business process orientation is proposed, which supports model to drive.
  • SU Yi-juan; ZHONG Zhi
    Computer Engineering. 2009, 35(17): 92-93,9. https://doi.org/10.3969/j.issn.1000-3428.2009.17.031
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Missing data imputing effect affects the following processes of the learning algorithms and mining algorithms. Cost-sensitive decision tree method does not consider the imputing order and imputing cost at the same time. Aiming at this problem, this paper proposes a new algorithm to impute missing data with ordering. This algorithm considers the economic factor and effective information for imputing machine establishment synthetically. Experimental results demonstrate that this algorithm has high prediction accuracy and classification accuracy than existing algorithms.
  • (College of Computer and Electronic Information; Guangxi University; Nanning 000)
    Computer Engineering. 2009, 35(17): 94-96. https://doi.org/10.3969/j.issn.1000-3428.2009.17.032
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the character of Web service and in view of service dependent correlation and reliability requirement, a hierarchical failure detection architecture construction algorithm based on service dependent correlation and reliability requirement is presented. The dynamical adaptation mechanisms including reactive strategy and proactive strategy are studied. Simulation experimental results show this algorithm can improve the accuracy and adaptation of failure detection and avoid fake failure case.
  • ZHU Yong-zhi; WANG Guo-ren; LI Bing-feng; WEI Rong-hui
    Computer Engineering. 2009, 35(17): 97-99. https://doi.org/10.3969/j.issn.1000-3428.2009.17.033
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Efficiency and scalability are two important concepts for analyzing the performance of parallel computing systems. Although heterogeneous systems have become more and more common, the research of the heterogeneous system’s scalability returns very few back. This paper presents a definition of efficiency that can be fit for homogeneous and heterogeneous systems. According to this definition, it presents a scalability model that can be applied to both heterogeneous systems and homogeneous systems. Experimental results show that the model can estimate preferably the efficiency and scalability of parallel computing systems.
  • Networks and Communications
  • HE Tao
    Computer Engineering. 2009, 35(17): 100-103. https://doi.org/10.3969/j.issn.1000-3428.2009.17.034
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper introduces matroid into network coding, transforms an arbitrary network to a multiple-unicast network which has the same solvability property, and replaces the complicated nodes in the network with a gadget, made all the nodes in the network have the same form. It analyzes the relationship of the input and output data streams of the network, constructs corresponding matroid of a network, and gets some characteristics of the network by the character of the matroid of that network. Result show that it gives more opinions about the reversibility of the multiple-unicast network.
  • GAO Qian
    Computer Engineering. 2009, 35(17): 104-105. https://doi.org/10.3969/j.issn.1000-3428.2009.17.035
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to overcome the lack of the current DiffServ multicast proposals, this paper proposes a new approach of multicast in DiffServ networks, which not only solves Neglected Reserved Sub-tree(NRS), scalability and heterogeneous QoS problem, but also improves link utilization ratio through using link resource allocation strategy. In addition, it can alleviate inter-class fairness problem by integrating with proper multicast routing algorithm.
  • MA Dong-chao; PENG Da; WANG Li-qian; CHEN Xue
    Computer Engineering. 2009, 35(17): 106-109. https://doi.org/10.3969/j.issn.1000-3428.2009.17.036
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem that multicast data forwarding efficiency on edge network is not high enough, this paper proposes a source-specific multicast scheme for Ethernet switch. The multicast data of specific source is forwarded by snooping the IGMPv3 message. This paper describes the operation mechanism of management flow and data flow, simulates and analyzes the mechanism. Comparison results with the IGMPv2 snooping scheme show that this scheme has higher efficiency.
  • GUO Ding-ding; LIANG A-lei; NI Zhi-qiang
    Computer Engineering. 2009, 35(17): 110-111. https://doi.org/10.3969/j.issn.1000-3428.2009.17.037
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the application scene of electronic mice self-deployment, this paper designs and implements a distributed system-based Wireless Sensor Networks(WSN) routing protocol. This protocol considers the two situations of the highest frequency of communication during electronic mice self-deployment process and establishes the network by the way of minimum spanning tree. The network reconfiguration algorithm is used while there are node addition and node invalidation to improve the network running efficiency. Simulation results show that compared with existing routing protocol suit for this scene named AODV, this protocol provides lager throughput and shorter delay of communication.
  • TANG Jing-xin; LI Jing-tao; ZHAO Yi-ming
    Computer Engineering. 2009, 35(17): 112-114. https://doi.org/10.3969/j.issn.1000-3428.2009.17.038
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes an Improved Semi-structured Adaptive Topology Scheme(ISATS). Based on its features of notable free-rider phenomenon, it proposes an improvement to its topologic structure. By imposing the ranked neighbor caching scheme which is used for Gnutella querying, it proposes a new adaptive topology scheme. Simulation data analysis shows this scheme makes significant reduction in the network load and the response time. It enhances the efficiency of enquiries and the success rate of enquiries.
  • FENG Jin-sheng; XUE Guang-tao; LI Ming-lu
    Computer Engineering. 2009, 35(17): 115-116,. https://doi.org/10.3969/j.issn.1000-3428.2009.17.039
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In Vehicular Ad hoc Networks(VANET), nodes have no stable infrastructures to use, network topology and states may change rapidly and many obstacles spread in the network. This paper presents a routing mechanism for VANET, the Passive Geographical Routing(PGR) algorithm, which uses prior location information of the nodes and city road map. PGR uses road and speed info to prejudge nodes’ location, uses non-broadcast mechanism to reduce routing overhead. Simulation experimental results show that the algorithm can give the high delivery performance with low routing overhead.
  • ZHENG Guo-qiang; SUN Ruo-yu
    Computer Engineering. 2009, 35(17): 117-119. https://doi.org/10.3969/j.issn.1000-3428.2009.17.040
    Abstract ( )   Knowledge map   Save
    In order to eliminate the conflict between node energy consumption and network performance for Medium Access Control(MAC) protocol in single-layer network, this paper designs an energy efficient protocol named CLR-MAC based on AS-MAC. It uses the information of routing layer for MAC layer and modifies the control frame of AS-MAC to solve the compulsory wake-up problem. Through performance analysis and simulation, CLR-MAC protocol is linearity elevation along with the increasing sensor density.
  • JIN Shan; XIONG Shao-xue
    Computer Engineering. 2009, 35(17): 120-122. https://doi.org/10.3969/j.issn.1000-3428.2009.17.041
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the degree and delay constrained overlay multicast topology maintenance problem, this paper proposes a topology maintenance protocol based on proactive strategy called Local Tree Reconstruction Protocol(LTRP). In order to reconstruct the multicast tree effectively, each node pre-calculates a parent-to-be before the tree splits by running LTRP. Experimental results show that, the average number of nodes contacted in LTRP is 1/3 of that in reactive strategies when the multicast group scale is small, and the proportion decreases to about 1/6 when the group scale is large.
  • PENG Duo; ZHANG Qiu-yu; JIA Ke-jun
    Computer Engineering. 2009, 35(17): 123-125. https://doi.org/10.3969/j.issn.1000-3428.2009.17.042
    Abstract ( )   Knowledge map   Save
    Designing clustered routing protocol for Wireless Sensor Network(WSN) need consider the energy of single node and the balance of the whole network energy consumption of. On the basis of analyzing the characteristics and shortcomings of clustered routing protocols, this paper proposes an energy-efficient clustered routing protocol. It considers the energy of nodes when selecting cluster heads, limits number of nodes in each cluster and sends the data to the base station by means of improved inter-cluster transmission, so that the protocol can reduce the energy consumption of nodes and balances the energy consumption among clusters. Simulation results show that the protocol can reduced energy consumption of WSN and prolong the network lifetime.
  • Security Technology
  • LIU Zai-xin; DONG Xiao-lei; CAO Zhen-fu
    Computer Engineering. 2009, 35(17): 126-128. https://doi.org/10.3969/j.issn.1000-3428.2009.17.043
    Abstract ( )   Knowledge map   Save
    Mobile Agents can be executed in heterogeneous network and used by mobile users for transactions, but they can not authenticate transactions in hostile environment, so the transactions may be unfair. This paper proposes a mobile Agent E-commerce model based on proxy signature, and gives a proxy signature scheme applied in the model, which is proved secure and suitable for low bandwidth situation because of its short signature property.
  • WU Wen-jun; TANG Gui-lin; HUANG Zhi-ping
    Computer Engineering. 2009, 35(17): 129-131. https://doi.org/10.3969/j.issn.1000-3428.2009.17.044
    Abstract ( )   Knowledge map   Save
    An improved algorithm of fast correlation attack on stream cipher is proposed. The attack of stream cipher is regarded as the decoding of linear block code, and the linear block code is decoded by the ML-decoding strategy. With the Walsh transform, the computing complexity of this algorithm is reduced sharply. The selection of two important parameters of the algorithm, that are the number of the exhaustively searched initial bits and the weight of parity-check, are further studied. The analytic relation between the weight of parity-check and the probability of success attack is deduced. These discussions of parameter selection provide a better guidance for practical application. Simulations results show that the new algorithm performs better than previous algorithms.
  • ZENG Zhi-qiang; GAO Ji; ZHU Shun-zhi
    Computer Engineering. 2009, 35(17): 132-134. https://doi.org/10.3969/j.issn.1000-3428.2009.17.045
    Abstract ( )   Knowledge map   Save
    The larger the number of support vectors is, the slower the detection speed of network intrusion detection system based on SVM is. Aiming at this problem, a novel method to simplify SVM is presented. The support vectors are organized in clusters in the feature space. For each cluster centroid, it finds the pre-image in input space and adopts it as a reduced vector to compress the number of support vectors. Experimental results show that this method can improve detection speed of SVM engine and enhance the real-time response capability of intrusion detection system.
  • WEN Sheng-jun; ZHANG Lu-guo
    Computer Engineering. 2009, 35(17): 135-137. https://doi.org/10.3969/j.issn.1000-3428.2009.17.046
    Abstract ( )   Knowledge map   Save
    Aiming at the status that it is easier for secure chip to be attacked by error inject attack, this paper proposes a protection scheme of error inject attack for secure chip. By analyzing the reasons error inject attack occurs, it designs memory secure manage logic, hardware protection mechanism and data interactive protocol to enhance the chip’s protection ability and improve the chip’s security and stability.
  • GUI Qiong; CHENG Xiao-hui; RAO Jian-hui
    Computer Engineering. 2009, 35(17): 138-140. https://doi.org/10.3969/j.issn.1000-3428.2009.17.047
    Abstract ( )   Knowledge map   Save
    Combining advantages of the RSA public-key encryption and pseudorandom generator technology, a privacy preserving distributed mining algorithm of association rules, PPD-ARBSM is proposed. It introduces Cryptogram Management Server(CMS) and Data Mining Server (DMS) in the algorithm, PPD-ARBSM effectively protects security of sensitive data, and can make full use of similarity matrix of transactions to generate intensively and quickly global k-frequent itemsets, thus greatly cut down communication costs of contrasting local support between sites. Theoretical analysis and experimental results show that PPD-ARBSM algorithm can achieve improvements in terms of privacy, accuracy, and efficiency.
  • LI Yao; TU Song; HAO Wen
    Computer Engineering. 2009, 35(17): 141-142. https://doi.org/10.3969/j.issn.1000-3428.2009.17.048
    Abstract ( )   Knowledge map   Save
    A secure store software is designed and implemented in this paper. It is different from other store software, it achieves data confidentiality, integrity and availability by secret sharing. The software in the credit region work together to achieve data scattering, store, assembling and destroy. The secure store software base on secret sharing can be applied to intrusion tolerance and so on because of its especial implementation principle.
  • LIU Jing; LIU Gang; LI Ai-min; JIN Hai-yan
    Computer Engineering. 2009, 35(17): 143-145. https://doi.org/10.3969/j.issn.1000-3428.2009.17.049
    Abstract ( )   Knowledge map   Save
    The image watermark scheme based on Non-Subsampled Contourlet Transform(NSCT) is proposed for resisting Rotation Scale Translation(RST) attack. Feature points are extracted by utilizing the characteristic of image from the greatly directional band pass coefficients of the NSCT processed by binary. When watermark is detected, the feature points matching measure for the geometric manipulation is computed. Compared with other algorithm, the method can transform the image back to its original size/orientation, i.e, recover the lost synchronism. Experimental results show that it is robust to common geometric attacks.
  • WANG Zhi-gang; SHI Ying
    Computer Engineering. 2009, 35(17): 146-148,. https://doi.org/10.3969/j.issn.1000-3428.2009.17.050
    Abstract ( )   Knowledge map   Save
    As a result of extensive application of Internet/Intranet technology in the information system of the enterprise, the information of social and more and more sharpening problems of network security and information secrecy. This paper gives a resolving scheme of Virtual Private Network(VPN) security gateway with firewall and network encryption technology, based on IP Security(IPSec) protocol and VPN technology, it gives a design of main software module, and a deep analysis is made into the application of the scheme.
  • HE Yun-peng
    Computer Engineering. 2009, 35(17): 149-151. https://doi.org/10.3969/j.issn.1000-3428.2009.17.051
    Abstract ( )   Knowledge map   Save
    An attack on a reduced-round version of Crypton algorithm is presented, which is based on the dedicated Square attack. This paper defines a -set for the Crypton algorithm, and proves in detail that all the 16 byte positions in the output of a -set after 4-round of Crypton encryption are balanced, and this balancedness can be used to attack the 4-round Crypton algorithm. When the way is used to attack 6-round cipher algorithm, it improves the method to guess keys, and gets rid of the parts which are repeatedly calculated so that the time complexity of attacking the 6-round Crypton algorithm is reduced to 250.
  • LIU Wei
    Computer Engineering. 2009, 35(17): 152-154. https://doi.org/10.3969/j.issn.1000-3428.2009.17.052
    Abstract ( )   Knowledge map   Save
    The essence of network security situation assessment has been studied by the formal method, and this paper thinks that the network security situation assessment is the process of uncertainty reasoning on network security situation using the information and knowledge of security incidents. The three-tier model for network security situation assessment is proposed. The theoretical analysis method using information entropy theory is studied, which demonstrate the scientific feasibility of the information fusion and situation assessment applied in network security situation assessment system.
  • JIN Yu-xing; RU Xiu-juan
    Computer Engineering. 2009, 35(17): 155-156. https://doi.org/10.3969/j.issn.1000-3428.2009.17.053
    Abstract ( )   Knowledge map   Save
    This paper proposes a new general verifiable secret sharing scheme based on blind signature, in which no secure channel is needed. It cuts the cost of transition, the security is based on discrete logarithm and one-way function. It is more computable and low cost. In this scheme, the sub-secret of participant can be used reiterative. It can solve the mutile-secret sharing problem.
  • LI Yun-feng; HE Da-ke; LU Xian-hui
    Computer Engineering. 2009, 35(17): 157-159. https://doi.org/10.3969/j.issn.1000-3428.2009.17.054
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper finds that in improved Perfect Concurrent Signature(iPCS), the signer can bind multiple messages with one Keystone but let the other signers know only one of the messages, which is unfair for signers. The accountability of Concurrent Signature(CS) is proposed and defined, and an attack case which breaks the accountability in one scheme of Perfect Concurrent Signature(PCS) and an update version of the perfect concurrent signature are proposed, in which the Keystone transfer function takes the exchanged message and Keystone as the input parameters to realize the binding between Keystone and messages. The scheme satisfies the accountability of CS.
  • ZHANG Hong-qi; ZHANG Wen-bo; ZHANG Bin; CAO bing-hua
    Computer Engineering. 2009, 35(17): 160-162. https://doi.org/10.3969/j.issn.1000-3428.2009.17.055
    Abstract ( )   Knowledge map   Save
    In Grid Security Infrastructure(GSI), cross-domain authentication between entities adopts the traditional certificate-based Public Key Infrastructure(PKI) which limits grid scale since the management of certificates is too complicated. By analyzing the security demands, this paper introduces Identity-Based Cryptography(IBC) to grid and proposes a cross-domain signcryption scheme to solve the problem brought by authentication between Virtual Organizations(VO) with different system parameters. Its security and performance are analyzed.
  • Artificial Intelligence and Recognition Technology
  • WANG Yue-ling; SHEN Shu-kun; WANG Hong-bin
    Computer Engineering. 2009, 35(17): 163-166. https://doi.org/10.3969/j.issn.1000-3428.2009.17.056
    Abstract ( )   Knowledge map   Save
    The dynamic model of a kind of 2-DOF parallel mechanism driven by linear motor is established by Lagrange method combined with the dynamics characteristic of the linear motor. Adaptive neural network iterative learning control is proposed considering repetitive action, uncertainty and nonlinearity of the system. Using this control algorithm, the outputs of the system can track the desired trajectories. The strict proof and simulation results validate the validity of the controller.
  • ZHOU Kai; YANG Lu-ming; SONG Hong; ZENG Qing-dong; SHAO Ping
    Computer Engineering. 2009, 35(17): 167-169. https://doi.org/10.3969/j.issn.1000-3428.2009.17.057
    Abstract ( )   Knowledge map   Save
    This paper proposes a method of face recognition, which is based on Multi-Threshold Local Binary Pattern(MTLBP). The gray-scale difference is calculated between each pixel and its local neighborhoods of an image. Different thresholds are chosen to code the foregoing gray-scale difference. Face image is divided into multi-regions. Histogram vectors extracted from multi-regions are adopted to describe the human face. Face recognition is completed by blurring the matching results. Experimental results show that the proposed method is robust to expression variations by combining texture and grads information.
  • JIANG Xiu-qin
    Computer Engineering. 2009, 35(17): 170-171,. https://doi.org/10.3969/j.issn.1000-3428.2009.17.058
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For heaps-like, or data sets of large discrepancy of every class specimen number, Fuzzy C-Means(FCM) algorithm and semi-supervised FCM clustering algorithm may not be the right partition of the data, because they have limitation of equal demarcation trend for data set. To solve this problem, this paper using distributing density size of the data dot as weighted value, together with semi-supervised learning, presents a semi-supervised and dot density weighted FCM algorithm. Through semi-supervised learning, it uses simulated annealing method to get the minimized result. Results show that this algorithm can improve the accuracy of the clustering.
  • ZHANG Ling; ZHU Jia-gang
    Computer Engineering. 2009, 35(17): 172-174. https://doi.org/10.3969/j.issn.1000-3428.2009.17.059
    Abstract ( )   Knowledge map   Save
    NPKMR is a method of Non-Positive Kernel Machine Regression(NPKMR), in which only the total regression error is constrained, but each sample regression error is ignored. Therefore, the accuracy and the generalization performance of NPKMR can not be satisfied. To improve the accuracy and the generalization performance of NPKMR method, this paper proposes that each sample regression error is constrained besides the total regression error. It introduces norm-r loss function and slack variable in order to constrain each sample regression error. Experimental results show that improvement on NPLMR method is effective and feasible.
  • LI Guang; XIE Qiang; DING Qiu-lin
    Computer Engineering. 2009, 35(17): 175-177. https://doi.org/10.3969/j.issn.1000-3428.2009.17.060
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to solve the problem of using partial content of the huge Ontology effectively, a method of ontology partition is proposed based on Tabu and Genetic Algorithm(TGA). In this method, the digital sequence composed of the number of the sub-Ontology whose concepts will be allocated in is taken as a chromosome according to Ontology partition request. The fitness degree function of TGA is designed, and the concrete steps of Ontology partition algorithm are presented. According to the correlation contrast experiment, it finds that its division balance degree and accuracy are better than other methods.
  • DAI Jie-yong; SU Dan; LUO Chuan
    Computer Engineering. 2009, 35(17): 178-180. https://doi.org/10.3969/j.issn.1000-3428.2009.17.061
    Abstract ( ) Download PDF ( )   Knowledge map   Save
  • LIU Xiao; ZHANG Jian-ming
    Computer Engineering. 2009, 35(17): 181-183,. https://doi.org/10.3969/j.issn.1000-3428.2009.17.062
    Abstract ( )   Knowledge map   Save
    A novel method based on Bilateral Two-Dimensional Linear Discriminant Analysis(B-2DLDA) and symmetry average of local Singular Value Decomposition(SVD) for face recognition is presented. B-2DLDA is used to extract features on the whole face image. Symmetry average of local SVD is used to extract the local facial features. By fusing the extracted features from both two methods above, the nearest neighbor classifier based on the weighted-Euclidean distance is employed to accomplish the task of classification. Experimental results carried on ORL face database validate the efficiency of the method.
  • HUA Xiao-peng; LI Xian-feng; GAO Jun; TIAN Ming
    Computer Engineering. 2009, 35(17): 184-186. https://doi.org/10.3969/j.issn.1000-3428.2009.17.063
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the flaw that the recognition precision of Support Vector Data Description based on K-Means(KMSVDD) clustering is lower than traditional Support Vector Data Description(SVDD), an improvement algorithm is proposed. This algorithm learns support vectors of every cluster and produces middle model, then finds out the data against middle model’s Karush-Kuhn-Tucker(KKT) condition from non-support vectors and obtains the final studying model by leaning them with all support vectors. Experimental result proves that this improvement algorithm has similar computing expenditure with KMSVDD and its recognizing accuracy is higher than KMSVDD and similar to traditional SVDD.
  • SHEN Jun-qiang; XIAO Gang; GAO Fei; CHEN Jiu-jun
    Computer Engineering. 2009, 35(17): 187-189,. https://doi.org/10.3969/j.issn.1000-3428.2009.17.064
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The recognition of the ballot table’s geometry structure is the key of the recognition of ballot image’s geometry structure. This paper presents a method which is based on run-length of table line to extract the ballot table’s regional, and realize the recognition of ballot table’s geometry structure. This method uses run-length of table line as the vector basic elements to detect the table lines, and merging run-length of table line under certain constrains to find table lines, which are used to extract the table regional. Experimental result shows that this method can identify the ballot image’s geometry quickly and efficiently.
  • TU Xiong-gang
    Computer Engineering. 2009, 35(17): 190-192. https://doi.org/10.3969/j.issn.1000-3428.2009.17.065
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To assess situation precisely is a key technology to develop advanced decision support system. To improve precision of situation assessment in robot soccer match, this paper concludes the key factors affecting match situation and develops a new situation decision model based on expertise and case study of many matches. In the model, the soccer robots consist of a decision group, which has better decision performance with high intelligence. The model proves to be effective and has high efficiency in simulation experiments and actual soccer matches.
  • WU Bin; SHAO Jian-feng; FANG Ye-xiang
    Computer Engineering. 2009, 35(17): 193-194,. https://doi.org/10.3969/j.issn.1000-3428.2009.17.066
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The mathematical model of Open Vehicle Routing Problem(OVRP) based on satisfaction of customers is founded according to setting virtual delivery center. The hybrid Particle Swarm Optimization(PSO) algorithm is presented for the problem. The improvement nearest neighbor algorithm and cheapest insertion algorithm are combined with PSO as the post-optimization-procedure. The hybrid algorithms’ complexities are analyzed. These algorithms are analyzed and compared through experiments.
  • NIU Jie; SHEN Xiao-feng
    Computer Engineering. 2009, 35(17): 195-197. https://doi.org/10.3969/j.issn.1000-3428.2009.17.067
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To solve the insufficiency of distinguishing the state of eyes in the supervising system for identifying the driver’s fatigue, this paper proposes a fast algorithm for eyes’ state identifying which integrates image processing, complexity, combines projection and geometry feature. The detail of distinguish process is described and the core algorithm is discussed. Tests verifie that this algorithm can be used to distinguish the eyes’ state under complex situation, such as different backgrounds, rotation angle, deflexion. This algorithm has good universal application, fast processing speed, and can solve instances of different ambient brightness and wearing glasses.
  • CHEN Xuan; WU Qing-jiang
    Computer Engineering. 2009, 35(17): 198-200. https://doi.org/10.3969/j.issn.1000-3428.2009.17.068
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Traditional Gaussian mixture model of RGB has some drawbacks such as bad detection on rate of low contrast pixel. Aiming at that, this paper proposes Gaussian mixture model of chromaticity coordinates, which brings better result in target detection in gait detection. Converting RGB into chromaticity coordinates, color contrast and detection on rate of low contrast pixel are enhanced. It adds lightness information to reduce shadow. In the part of target extracting, mechanism of noise suppressor is accessed. Experimental result shows the improvement gets half error detection rate than before at the same color contrast rate.
  • DING Rui; DONG Hong-bin; FENG Xian-bin
    Computer Engineering. 2009, 35(17): 201-203. https://doi.org/10.3969/j.issn.1000-3428.2009.17.069
    Abstract ( )   Knowledge map   Save
    A hybrid particle swarm Genetic Algorithm(GA) is presented to solve the classification question. Based on the relation between the individuals, the algorithm regulates the optimization with the “race” method and controls the individuals in a micro way with race crossover, meanwhile commixed the crossover operator based on the thought of Particle Swarm Optimization(PSO) in GA. With these operators, the speed of convergence and the diversity of the population are well balanced. According to the classification question’s characteristic, it designs the corresponding encoding method, the fitness function, and uses sowing seeds way to produce initial population to get better classification precision. Through classifying the international data sets and comparing with other algorithms classified effect, experimental results show the effectiveness of this algorithm.
  • Graph and Image Processing
  • HE Xiao-hu; YANG Wei; CHENG Shi-dan; ZHANG Su
    Computer Engineering. 2009, 35(17): 204-205. https://doi.org/10.3969/j.issn.1000-3428.2009.17.070
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The electronic gastroscope image, which is sensitively affected by gastric peristalsis, air bubble, food, illumination and camera moving during the capturing, has some defect such as large illumination variety, so common computer aided analysis method can not achieve good result. Based on analyzing the characteristic of electronic gastroscope image, a new method to distinguish between carcinoid electronic gastroscope image and malignancy ones is presented. It uses the Local Binary Pattern(LBP) method in RGB channel of images and extracts the texture feature which is subsequently trained and classified by Support Vector Machine(SVM), gets the classification of all three channels and decides the image carcinoid or malignancy through voting principle to supply the clinical analysis. Experimental result indicates the method gets a recognition rate of 92.2%.
  • HAO Peng-yi; DING You-dong; FANG Yu-chun; HUANG Dong-jin
    Computer Engineering. 2009, 35(17): 207-209,. https://doi.org/10.3969/j.issn.1000-3428.2009.17.071
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to use quadtree algorithm widely in scope of image retrieval, the requirements of content-based image retrieval to target object shape are analyzed. An image retrieval based on quadtree and edge invariant moments is proposed. The image retrieval system is set up, in which, five different types of images are tested. Simulation experimental results show this method is simple and effective with low complexity, and the retrieval efficiency is promoted.
  • WANG Hao-ran; ZUO Cheng-lin; WANG Tao; ZHANG Mao-jun; TAN Shu-ren
    Computer Engineering. 2009, 35(17): 210-212. https://doi.org/10.3969/j.issn.1000-3428.2009.17.072
    Abstract ( )   Knowledge map   Save
    A generation method for complete-view image based on common digital camera and the conical mirror is proposed. The object placed in the conical mirror is captured by the digital camera, which gets the complete-view image. The anti-projection transformation formula is obtained by deducing. This method can transfer the complete-view image to arbitrary-view one, and make the users skim the images from all directions. Simulation experimental results show this method is effective.
  • XU Peng-yu; FU Shan
    Computer Engineering. 2009, 35(17): 213-214,. https://doi.org/10.3969/j.issn.1000-3428.2009.17.073
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problems in process of reconstruct images for super resolution reconstruction algorithm based on Maximum A Posteriori(MAP), a super resolution reconstruction based on Huber-Markov Random Field(HMRF) prior model is proposed. The HMRF model is used as image prior model, and the images are reconstructed with super resolution partly. Simulation experimental results show that, compared with tradition MAP algorithm, this method can reserve the edge details of reconstruction images better, and promote their qualities.
  • WANG Yi-min; AN Jin-wen; QIN Yong-yuan
    Computer Engineering. 2009, 35(17): 215-216. https://doi.org/10.3969/j.issn.1000-3428.2009.17.074
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A target detection method in SAR images series is proposed. The first frame SAR image is segment by using Maximum A Posteriori(MAP) rules, in which the paramount is got. On this basis, the image is detected. The latter frame image is detected with the information and paramount vector got in former one. The paramount vector of the pigeons data is modified. Simulation experiemtal results show this method has better performance of target segmentation.
  • Multimedia Technology and Application
  • LI Guang-lun; SHU Wei-qun
    Computer Engineering. 2009, 35(17): 217-218,. https://doi.org/10.3969/j.issn.1000-3428.2009.17.075
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Realization of robust and real-time object division is a crux of video monitor system. Aiming at the situation that the pixel gray of background image changes continually in monitor environment with continually changing lighting conditions, this paper presents a background updating algorithm which is self-adaptive to changes in illumination. The moving object is ascertained by using inter-frame difference and background difference. Experimental results demonstrate that this algorithm is quick and robust, and can be applied in monitor equipment in outdoor and indoor environments.
  • XU Xin-wen; LI Guo-hui; FU Chang-jian;
    Computer Engineering. 2009, 35(17): 219-222. https://doi.org/10.3969/j.issn.1000-3428.2009.17.076
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the heterogeneous features of news video accompany text and multimode key frame image, the Multi-Wing Harmoniums(MWH) model is set up, which contains two submodels of multivariate text Poisson distribution and multivariate color histogram Gaussian distribution. By researching the doubleaction dependent relation of implication theme and observation input, this model is extended to two layer random field model, which conducts the semantic mining to news video. It is tested in CCTV news video sets, and the results show this model is effective.
  • WANG Ming; PENG Cheng-lei; DU Si-dan
    Computer Engineering. 2009, 35(17): 223-225,. https://doi.org/10.3969/j.issn.1000-3428.2009.17.077
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem that video files can not be played fluently on the Loongson 2E platform, this paper optimises the video transform process and uses a new Discrete Cosine Transform(DCT) algorithm. This algorithm is realized based on multimedia instruction set of Loongson 2E platform and used to alternate the DCT algorithm in FFmpeg software. Text results show that the performance of new DCT algorithm is nearly 11 times higher than the traditional one, and the coding rate of optimised FFmpeg software increases nearly by 10%.
  • ZHENG Cong-zhuo; LI Jun-li; CHEN Gang; SUN Yao-feng; MAN Jia-ju
    Computer Engineering. 2009, 35(17): 226-228. https://doi.org/10.3969/j.issn.1000-3428.2009.17.078
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the application of digital video storage, this paper analyzes the theory and characteristics of Variable Bit Rate(VBR) control for secondary coding, and proposes a VBR algorithm for applications of fixed-size video storage. It dose Consistent Bit Rate(CBR) coding on the sequence, counts and notes the important coding information. During the data processing process, it analyzes the video characteristics of every scene such as the complexity and allocates the bits in advance. Secondary coding is done for the same sequence by using VBR coding. Experimental results show that this algorithm can realize high quality video with smaller PSNR variation.
  • LI Wen-juan; ZHANG Wen-jun; ZHANG Ying; PAN Jin
    Computer Engineering. 2009, 35(17): 229-231. https://doi.org/10.3969/j.issn.1000-3428.2009.17.079
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper extracts feature parameters of the test vocality and the corresponding original vocality, such as sound intensity, pitch, and breath. It uses feature matching method to compare these parameters and obtains objective assessment score by using assessment mechanism according to the similarity of these parameters. An objective assessment system of multimedia vocality is established to improve the intuitiveness and interactivity of vocality teaching. Simulation experimental results show that this method has a low algorithm complexity and consistent with human’s subjective feeling.
  • Developmental Research
  • TANG Wei; WU Huan-ping; LUO Bing; LIU Liang; LV Zhong-liang; ZHENG Wei-jiang
    Computer Engineering. 2009, 35(17): 232-234. https://doi.org/10.3969/j.issn.1000-3428.2009.17.080
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to supply meteorological services and solve the current problems in producing processes, this paper designs a background manufacture system for meteorological service product by using extensible framework, remoting technology and ArcGIS GeoProcessing. The system is structured by 3-tiered C/S architecture, including client layer, data layer and service layer. Practical cases prove that the system is automatic, ease of use and extensible.
  • JI Cui-ling; XIAO Yong-kang
    Computer Engineering. 2009, 35(17): 235-237,. https://doi.org/10.3969/j.issn.1000-3428.2009.17.081
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper extends the star model according to the spatial characteristic of air quality monitor data, and utilizes Oracle10g and ArcGIS 9.0 to design and implement an air quality data warehouse prototype system in China. The system can organize and manage the data effectively to support the requirement of complicated analysis, mining and decision-making. To query and analyze the data in the data warehouse conveniently, this paper designs a Web spatial OLAP system to improve the ability of spatial analysis and visual presentation of the traditional OLAP system.
  • WU Su-qin; AN Ke; LIU Rui-dong
    Computer Engineering. 2009, 35(17): 238-240. https://doi.org/10.3969/j.issn.1000-3428.2009.17.082
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents mixing test flow generating technology as the example of IXP2400 which is a typical multi-core processor, combines the accuracy need of test flow. The technology uses null operating cycle substituting clock provided by processor, receives test time layoff between frame by imposing improved secant method, and applies results to test flow generating. It can control the sending speed of mixing test flow. Experimental result proves that the technology can control the average error of test flow at 0.497 MB/s when line speed within 1 GB/s.
  • WANG Zhe; WANG Xi-min
    Computer Engineering. 2009, 35(17): 241-243,. https://doi.org/10.3969/j.issn.1000-3428.2009.17.083
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to improve the portability of the parallel Digital Signal Processing(DSP) system, this paper designs a message-passing routing algorithm. It advances the efficiency of algorithm through using adjacency list to store the structure of system hardware topology and enhances information of node data flows as restrictive qualification for algorithm searching. ADSPTS101 parallel system is as an example, it implements and validates the routing algorithm using VisualDSP++ platform. Result shows that the algorithm solves the problem of message-passing in parallel DSP system effectively, enhances the performance of system, and it has more applicability in parallel DSP system.
  • DU Shu-xing; JIA Jian-yuan; LIU Xiao-yuan; HU Wen-jing
    Computer Engineering. 2009, 35(17): 244-246. https://doi.org/10.3969/j.issn.1000-3428.2009.17.084
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents a re-development method towards appropriate and effective use of Pro/E. By using popular parts such as gears, axletrees and springs as examples, a product model management and part and components reuse designing system is built up. This system is embedded in Pro/E and is man-computer interactive. It provides effective technological support and implementation approaches towards fast product design and CAD integration. This method is applied the customized development on a product, and makes good effect.
  • MA Qian-li; LIAO Ming-hong; GAO Zhen-guo; XU Wen-xu
    Computer Engineering. 2009, 35(17): 247-248,. https://doi.org/10.3969/j.issn.1000-3428.2009.17.085
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to comprehend the service discovery protocols better, this paper proposes several criterions about service discovery protocol in pervasive computing environments, and compares a few service discovery protocols based on different architectures in different environments and categorized in terms of network type and storage mode of service information. The five service discovery protocols in wireless Ad hoc network are introduced, and their characteristics and performances are compared and analyzed.
  • ZHU Fei; DIAO Hong-jun
    Computer Engineering. 2009, 35(17): 249-251. https://doi.org/10.3969/j.issn.1000-3428.2009.17.086
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper designs a general framework based on Event-Condition-State. It resegments context of GOF state pattern into two classes: One is responsible for management and the other is responsible for operation interface. Implementation parts such as state management, state transferring index and event triggering mechanism are embodied in the framework. With general framework, development of the system based on Event-Condition-State is simplified. The framework is utilized in developing mobile Input Method(IM) system for various different platforms. Practice proves it can simplify IM developing process and provide convenience in multiple various IM systems maintenance.
  • LIU Jing-yong; ZHANG Li-chen; CHEN Cheng
    Computer Engineering. 2009, 35(17): 252-254. https://doi.org/10.3969/j.issn.1000-3428.2009.17.087
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Real-time systems have many non-functional requirements, which crosscut entire system and are difficult to be handled. This paper presents a real-time system development method based on aspect-oriented Model-Driven Architecture(MDA). It separates the handing of non-functional requirements from the functional ones in design phase, which reduces the complexity of real-time systems development and improves reusability and maintainability of real-time systems, and modularization of crosscutting concerns. Application case proves that the method is effective.
  • XU Xue-xia; LING Gang; XU Shuang
    Computer Engineering. 2009, 35(17): 255-257,. https://doi.org/10.3969/j.issn.1000-3428.2009.17.088
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to international body unites’ promulgation in view of 2006 the gymnastics competition new rule, this paper joins the database the safe audit function to the gymnastics competition result statistical software, designs and develops gymnastics competition result statistics software with characteristics such as strong security, perfect function, friendly interface, simple operation and strong versatility. Through the sixth intercity games of the People’s Republic of China gymnastics competition’s actual test, it proves that the software of the indicators achieves the expected results.
  • YU Guo-hong
    Computer Engineering. 2009, 35(17): 258-261. https://doi.org/10.3969/j.issn.1000-3428.2009.17.089
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A cellphone instant messaging software based on bluetooth called BlueIM is presented, which uses bluetooth protocol stack and J2ME wireless communication technology to implement instant messaging. The design process of BlueIM is introduced, including requirements analysis, software layer analysis, and software architecure analysis. Some relevant problems to BlueIM are researched, such as database management, cellphone memory management optimization, and cellphone interface image process design. Simulation experimental results show BlueIM lives up to the function design requirements, and can obtain better performance in short distance wireless communication.
  • HUANG Qiang; XU Wei-hua; LIN Guo-an
    Computer Engineering. 2009, 35(17): 262-264. https://doi.org/10.3969/j.issn.1000-3428.2009.17.090
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Vision Automated Guided Vehicle(AGV) evaluation platform exploited independently simulates operating environment of realistic machinery vehicle. It designs or implements algorithm by using Matlab, and validates by machinery vehicle. This paper proposes a new vision information measure algorithm based on vision AGV evaluation platform. The algorithm unites self-adaptive median filter, reversal scenograph, edge detecting technology. The simulation and experimental results show the test of algorithm is more simple, and it is realized by embedded system easily.
  • WANG Ye-song; HU Gu-yu; NI Gui-qiang
    Computer Engineering. 2009, 35(17): 265-267,. https://doi.org/10.3969/j.issn.1000-3428.2009.17.091
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to guarantee reliable running of Operation Control System(OCS) for satellite communication, it should monitors courses and nodes of operation courses in the OCS. This paper proposes a system monitor framework based on CORBA/XML. The framework is a layered design based on federation of different target clusters, uses on a multicast based monitor/report protocol to monitor state within clusters, a federation of a tree structure among clusters is used to conformity their state. Experiment proves the framework can realize monitoring the nodes of different monitoring field for different level users, guarantee real-time of satellite communication networks.
  • YU Cheng-xian; XU Li-ying; XING Bin; WANG Jian-qin; LI Dao-liang
    Computer Engineering. 2009, 35(17): 268-270. https://doi.org/10.3969/j.issn.1000-3428.2009.17.092
    Abstract ( )   Knowledge map   Save
    Aiming at the problems of risk caused by water quality in aquaculture farm, this paper proposes a water quality early warning system for intensive aquaculture. It uses system dynamic principle to analyze the factors affecting dissolved oxygen in the water and confirm the input and output parameters of the water quality predicting network, and decrease the time of error alarm through an optimized back propagation neural network algorithm and a rule based early warning strategy. Experimental result proves the system implements voice and short-message early warning for aquaculture, it is applied in aquaculture farm of Shandong province, and accuracy of the early warning is 94.9%.
  • LU Wen-juan; XIA Huo-song; WANG Qian-qian
    Computer Engineering. 2009, 35(17): 271-273,. https://doi.org/10.3969/j.issn.1000-3428.2009.17.093
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the inherent limitations of the single application Case-Based Reasoning(CBR) system that it is difficult to be integrated with experience-based recessive knowledge, this paper designs the based on Service Oriented Architecture(SOA) multiple CBR system application integration framework and integration system platform architecture. The integration framework and platform architecture based on analysis of the CBR system evolution and the application integration model, unites SOA encapsulation reasoning model and reasoning process, exploits integration system. The integration system progresses pilot application, implements integration and share of inner or outer multiple recessive knowledge for enterprise .
  • XIA Jian-ming; WEI De-min
    Computer Engineering. 2009, 35(17): 274-276. https://doi.org/10.3969/j.issn.1000-3428.2009.17.094
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents a new algorithm for computing matrix-vector multiplication based on a Graphics Processing Unit(GPU). A matrix is presented by a texture and matrix-vector multiplication can be realized by rendering a quadrilateral one pass. Instead of vector reduction, it presents a new algorithm for summing all entries of a vector, not requiring the size of the vector be the power of two. Based on these algorithms, the conjugate gradient method for solving linear equations is implemented using the GPU with OpenGL Shading Language(GLSL). The computation is compared against that on Krüger’s algorithm, proving the efficiency of the proposed algorithms.
  • ZHANG Jian; LUO Peng-fei; ZHANG Wen-ming
    Computer Engineering. 2009, 35(17): 277-279. https://doi.org/10.3969/j.issn.1000-3428.2009.17.095
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper designs a Radar Data Processing(RDP) platform adopting a plug-in system of micro-kernel. The platform is as the center of data processing. The operational modules are converted to plug-in through uniform function interfaces. It composes complex data processing flow managed by micro-kernel. It is an object-oriented developing mode realizing the block-like software structure and the separation of the interface and the algorithm. The platform has the ability of extension and maintainability. According to the technology of Component Object Model(COM) encapsulation, it expands the valid field of such plug-in, realizes mixed programming with multi-language.
  • ZHANG Chen-xu; LV Ling-bao; SUN Lin
    Computer Engineering. 2009, 35(17): 280-282. https://doi.org/10.3969/j.issn.1000-3428.2009.17.096
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In the current strategic simulation, the training of high-level strategic seminar gaming needs to integrate real-time and dynamic virtual Web information to synthesis information service system in time and asynchronously. Aiming at this problem, to build a virtual web information integrating system by constructing Ajax engine, space registration of virtual Web information and building Web/XML Servers are considered. Result shows that it becomes more capable in alternating information by separate data and presentation, eases the load of servers and provides faster access service.
  • CHEN Xiang; LIU Yi; CHAI Yue-ting
    Computer Engineering. 2009, 35(17): 283-封三. https://doi.org/10.3969/j.issn.1000-3428.2009.17.097
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the flaws in electronic barter based on intermediary broker, this paper proposes a design of automatic commodities matching system of electronic barter based on graph theory without intermediary broker. According to users’ demands and supply, the system produces recommendation information to barter participants for their reference, promotes the transaction rate and makes the barter market prosperous. An instance of book barter proves the effectiveness of the system.