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

20 December 2008, Volume 34 Issue 24
    

  • Select all
    |
    Degree Paper
  • LI Chang-geng; LI Xin-bing
    Computer Engineering. 2008, 34(24): 1-3. https://doi.org/10.3969/j.issn.1000-3428.2008.24.001
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A new range-free sensor node localization algorithm is proposed based on Monte Carlo method in wireless sensor networks. By computing the distance between random particles and anchor nodes, compared with the farthest RF sending distance and filtered according to power value, the algorithm ensures the unknown node’s position. It simulates at different quantity particles and anchors. At the same time, it is compared with DV-Hop algorithm’s localization performance in 0.1~0.5 ratio of anchor. Simulation result shows that the algorithm makes full use of node’s localization information, and reduces the complexity of computing with high accuracy and well robustness.
  • YE Jun-min; XIONG Hua-gen; DONG Wei; QI Zhi-chang
    Computer Engineering. 2008, 34(24): 4-6. https://doi.org/10.3969/j.issn.1000-3428.2008.24.002
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming to the problem of obtaining fault scene information from the actual fault diagnosis, this paper proposes a method to obtain fault scene information through software runtime fault injection, designs and implements a runtime software fault injector, and gives the grammar of fault script, fault library and the algorithm of the injector. Experimental results show that the injector can inject fault into software and obtain fault scene information effectively.
  • NIU Er-li; SHAN Ming-hui; CHEN Jun; WANG Jing-lin;
    Computer Engineering. 2008, 34(24): 7-10. https://doi.org/10.3969/j.issn.1000-3428.2008.24.003
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    In tThis paper proposes, a distributed and scalable community discovering approach namely PDC (Power based Distributed Clustering Approach) is proposed for P2P networks. PDC adopts Power value of nodes to measure new measurement of community structure and includes newto select center node selection algorithm. Experimental results show that the effect of PDC has better effect and scalability compared to other algorithms is five percent5% higher than FDC and CDC, but the number of messages generated by PDC is nearly ten percent10% of FDC.

  • WEN Qi; MA Jian-wen
    Computer Engineering. 2008, 34(24): 10-12. https://doi.org/10.3969/j.issn.1000-3428.2008.24.004
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    When aerospace earth observation systems acquire earth surface information by using remote sensing data, there are the uncertainty caused by data error and incompleteness caused by imaging time constraints. A software based on Bayesian network and its related algorithms, namely BayesNetEX, is developed to address the problem. This paper introduces the architecture of the software and the way to use it. The change detection of three TM images of Beijing district is presented to verify the functions of BayesNetEX. The results show that BayesNetEX can be applied in remote sensing image processing effectively.

  • WANG Bin; DING Piao; TAN Yun-qiao; GUI Wei-hua
    Computer Engineering. 2008, 34(24): 13-15. https://doi.org/10.3969/j.issn.1000-3428.2008.24.005
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Anti-worms are good mobile codes which can travel over the computer networks to fight against malicious worms. Existing anti-worms are often written by hackers. Sometimes these anti-worms even do more harm to networks than malicious worms. Recently, their effect has not been fully explored. This paper proposes a new kind of anti-worm called P2P anti-worm which propagates using P2P techniques. It presents a mathematical analysis and gives a mathematical mode of P2P anti-worm to analyze the propagation and uses SSFNET to simulate the P2P anti-worm vs. pure random scan worm. Results show that P2P anti-worm can slow down the speed of the malicious worm. The paper discusses the relation between the propagation speed and the P2P overlay average degree, the initial number of the anti-worm and the release time delay. Moreover, it finds that the P2P feature makes the anti-worm safer, propagate more stabile, more controllable and cost less.
  • QIU Wei-gen; ZHANG Guo-dao
    Computer Engineering. 2008, 34(24): 16-18. https://doi.org/10.3969/j.issn.1000-3428.2008.24.006
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    As two effective and important approaches from mathematic theory in artificial intelligence fields, the formal concept analysis and the rough set theory offers a serial of excellent algebraic tools for the data analysis and knowledge treatment. This paper studies the representation form of the concept lattice by the composition rough set, and proves that the concept intension and extension are respectively the fixed points of some composition rough approximate operators. The paper reveals the close inner relationships between the formal concept lattice and the rough approximate space, and it is useful to perfect the mathematic model of formal concept lattice.
  • ZHAO Xue-song; SUN Yuan-yun; MA Jun-pei
    Computer Engineering. 2008, 34(24): 19-21. https://doi.org/10.3969/j.issn.1000-3428.2008.24.007
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The middle layer is virtual resource layer. It plays a crucial role in grid architecture. A modified access control model based on virtual organization in grid is proposed. It makes grid resource more administrable and more convenient to lookup based on abstracting and programming virtual organizations and corresponding mapping rules. The security policies of the resource are mapped while the resource is mapped to the virtual organization. The owner of the resource determines the security policies of the resource, which strengthens the safety of the grid.
  • LOU Yan; LU Yong-ming; HE Han-wu
    Computer Engineering. 2008, 34(24): 22-24. https://doi.org/10.3969/j.issn.1000-3428.2008.24.008
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In the past microcosmic traffic system, the research on various dynamic factors is less in constructing three-dimensional traffic environment than the research on objects building-up. The vision behavior and decision-making behavior are studied. The vision perception picture and fuzzy neural networks decision-making picture are developed and the platform of dynamic intelligent traffic environment is built by using the EONSDK technology. It can improve the reality of traffic environment, and make out the different traffic environment and simulate various road accident circumstances.
  • ZHAO Jie; XIAO Nan-feng
    Computer Engineering. 2008, 34(24): 25-27. https://doi.org/10.3969/j.issn.1000-3428.2008.24.009
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To meet the individual and changing demand of the small and medium-sized manufacturing enterprises, this paper designs and realizes a multi-tier SmartERP system based on .NET. Various design patterns are used. The system can be tailored, its components can be plus in and out and it can provide flexible core services such as common data access, object cache and so on. Practice proves that it is flexible, can be integrated with electronic commerce system seamlessly and provides support for enterprise-level decision.
  • LI Feng; WEI Ying
    Computer Engineering. 2008, 34(24): 28-30. https://doi.org/10.3969/j.issn.1000-3428.2008.24.010
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Case-Based Reasoning(CBR) is a problem solving technique that solves new problems by finding a similar past case, and reusing it in the new problem situation. Noticing the shortcomings of K-Nearest Neighbors algorithm, this paper proposes an improved case retrieval algorithm measuring the similarity of new problem case and historical cases of case-based not only by difference of their feature values, but also by attribute(sensitivity) of reasoner. In this improved algorithm, original distance of feature of two cases is replaced by the reasoner’s utility value of the distance value. In addition, a variance indicator is introduced to balance equilibrium degree of all differences. The proposed algorithm is compared with other popular algorithms and verified numerically.
  • ZHAO Jing-jing; SUN Ji-gui; YIN Ming-hao; CAI Dun-bo
    Computer Engineering. 2008, 34(24): 31-33. https://doi.org/10.3969/j.issn.1000-3428.2008.24.011
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyzes the strategies of the state-of-the-art conformant planners and presents the primary factors affecting the performance of conformant planner, regarding the high complexity of conformant plan. These factors are the validity of heuristic information, the compactness of belief state representation and the efficiency of the final solving strategies. This paper emphasizes on analyzing the representation methods for belief state as well as the corresponding strategies, compares the merits and the defects of each belief state representation and its solving strategy under different conditions. The future research directions and trends are also discussed.

  • LI Jie; LV Bing; HAN Zhi-jie;
    Computer Engineering. 2008, 34(24): 34-37. https://doi.org/10.3969/j.issn.1000-3428.2008.24.012
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the characters of MPEG Variable Bit Rate(VBR) traffic, this paper proposes a new network traffic prediction model combinated wavlet analysis and Kalman filter. A VBR traffic congestion management scheme based on the model is presented that is composed of Dual Leaky Bucket(DLB). Simulation on NS platform shows that the scheme can effectively avoid network congestion effectively, reduces the time-delay of network transmission and the lose packet rate, and improves the bandwidth usage.
  • Software Technology and Database
  • HUA Hai-yang; ZHAO Huai-ci
    Computer Engineering. 2008, 34(24): 37-39. https://doi.org/10.3969/j.issn.1000-3428.2008.24.013
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper considers cluster analysis, which is the most often applied in commerce area and discusses three algorithms: DBSCAN, K-means and X-means based on the bank customer standard dataset. It compares algorithms concerning their effectiveness, scalability, outliers detection ability, and builds some bank customer models with X-means, which provides more powerful suggestions for bank decision-making man.
  • YU Yong; PENG Yan
    Computer Engineering. 2008, 34(24): 40-42. https://doi.org/10.3969/j.issn.1000-3428.2008.24.014
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Workflow management system applications are used in various fields now. Its flexible mechanisms cause great concern. This paper introduces the basic concept and structure of a flexible workflow management system. It describes the characteristics of the system’s flexible expansion, and analyses those mechanisms to achieve it. A more flexible workflow management system with high adaptability is designed and developed. These mechanisms have been proved available with the practices. Implementation of the system is supplied for remote processing of workflow, and even for workflow’s organizations and processing which is cross-platform.
  • ZHONG Lin-hui; YE Mao-sheng; ZHENG Yi
    Computer Engineering. 2008, 34(24): 43-45. https://doi.org/10.3969/j.issn.1000-3428.2008.24.015
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Software refactoring at software architecture level can improve software maintainability and decease the cost for maintenance. In order to automate the software architecture refactoring, this paper proposes a way for software architecture refactoring, which consists of interface specification rewrite operators and implementation rewrite operators.
  • ZHANG Gui-jie; YUE Li-hua; JIN Pei-quan
    Computer Engineering. 2008, 34(24): 46-48. https://doi.org/10.3969/j.issn.1000-3428.2008.24.016
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The Historical R-tree(HR-tree) is a spatial-temporal access method. Since all objects are indexed by a single tree, the size and height of the tree is expected to be larger than that of the corresponding HR-tree at the query timestamp. However, the space requirements of HR-trees are still prohibitive in practice, because for most typical datasets HR-trees almost degenerate to independent R-tree, one for each timestamp. Their performance deteriorates very fast for interval queries as the interval length increases. And 3D-tree is another spatial-temporal access method. The retrieval of objects according to their spatial-temporal relationships with others, demands access to both indexes and, in a second phase the computation of the intersection set between the two answer sets. Access to both indexes is usually costly and, in many cases, most elements of the two answer sets are not found in the intersection set.

  • CHEN Li; WU Jie; MA Jing; XUE Hao
    Computer Engineering. 2008, 34(24): 49-51. https://doi.org/10.3969/j.issn.1000-3428.2008.24.017
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyzes the advantages and disadvantages of the current Internet search engine. Using ontology to create the domain knowledge, ontology based reasoner, etc, it designs and realizes the model of the ontology based domain knowledge search system. Through the choice of client’s ontology, clients can get the related aim ontology. If the client wants to know more about the knowledge, he will get the search results which are exactly related with the domain knowledge by the reasoner and search engine. It discusses the function of every module and the characteristic of the system.

  • HU Kai; JIANG Yan; YANG Zhi-bing; ZHANG Xin-yu
    Computer Engineering. 2008, 34(24): 52-54. https://doi.org/10.3969/j.issn.1000-3428.2008.24.018
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Considering the fact that the EST value in scheduling DAG is composed of the means of computation and communication time, some researches on parallel tasks scheduling algorithms are done while one typical algorithm ETF is analyzed, and SETF algorithms for the expanded stochastic DAG is presented correspondingly. Then a method to compute the nodes’ EST is provided. And experiments are done to simulate it. Experimental results indicate that a significant improvement in the average parallel execution times of expanded stochastic DAG can be achieved by the proposed approaches and it is able to more accurately predict the actual performance than the algorithms ETF.
  • GONG Xiao-yong; ZHU Qing-sheng
    Computer Engineering. 2008, 34(24): 55-57. https://doi.org/10.3969/j.issn.1000-3428.2008.24.019
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a QoS-aware model for Web service selection called WSSM-Q. A set of QoS categorization tModels is defined in the model to describe the QoS attributes of a Web sevice. QoS advertisements of service providers are represented by QoS quantification values. QoS requirements of service consumers are represented by constraint and preference values. Web services to meet the requirements of consumers are selected by four phases algorithm. Experimental results indicate the feasibility and efficiency of this model.

  • Zhu Jie; Ngodrup; GeSang Dorje
    Computer Engineering. 2008, 34(24): 58-60. https://doi.org/10.3969/j.issn.1000-3428.2008.24.020
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    With the widespread use of Internet and the development of Tibetan information technology, there are a lot of Websites of Tibetan information resource. This paper identifies Tibetan Web page and crawls it according to features of Tibetan syllable dot. Based on DOM, it analyzes relevance between linked and non-linked Web page text with topical information via pruning semantics algorithm to extract Tibetan topical information. Test result shows that the algorithm to identify and extract in the Tibetan Websites topical information has good adaptation.
  • FU Xi-mei
    Computer Engineering. 2008, 34(24): 61-63. https://doi.org/10.3969/j.issn.1000-3428.2008.24.021
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Version management of Computer Support Collaborative Design(CSCD) must store all version of design during the course for inquire and search. With full storage, versions access fast, but they take up huge storage space and have a mass of storing redundancy information of version. Difference storage can save storage space, however, with a slow versions access speed and depressed security. This paper proposes two models of difference storage based on STEP, and combines difference storage and full storage by constructing storage threshold function, so space efficiency and time efficiency are balanced effectively.
  • ZHANG Ling-da; JIN Lin; CHENG Xiu-xia; JIANG Fei
    Computer Engineering. 2008, 34(24): 64-66. https://doi.org/10.3969/j.issn.1000-3428.2008.24.022
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Most text filtering systems are based on keywords, which can accomplish filtering task without high precision requirement. To improve the efficiency of filtering, this paper presents a composite mode filtering model based on content. The matching of semantic framework based on the matching technology of keywords ensures the speed of information filtering, and improves the precision of information filtering. Its validity is proved by instances.
  • ZHANG Zhu-xi; LI De-cai; WANG Huai-min; LIU Hai
    Computer Engineering. 2008, 34(24): 67-68. https://doi.org/10.3969/j.issn.1000-3428.2008.24.023
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper applies Aspect-Oriented Programming(AOP) in the research of the thread runtime management, and proposes a model of thread automatic management. Based on this model, it implements a General Thread Automatic Control(GTAC) which can wave into the system automatically without changing any source codes. Accroding to the user policy, GTAC can provide the function of thread automatic management by making use of reflection mechanism. GTAC is used in some application systems, and obtains good results.
  • GENG Bo; ZHONG Hong; PENG Jun; WANG Da-gang
    Computer Engineering. 2008, 34(24): 69-70. https://doi.org/10.3969/j.issn.1000-3428.2008.24.024
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper brings forward such a problem: there are multiple partners, one of them owns part of records, and no one has all of the records, then they want to divide their temporal sequence without leaking their private information. For this, it proposes a method for finding temporal sequence rule distribution based on untrusted third-party. Then the problem of calculating the frequency by multiple partners together will be converted into the problem of the comparing size of figures. Accordingly it designs an arithmetic based on untrusted third-party to resolve the problem of calculating the frequency.
  • GE Fang-bin; YANG Lin; WANG Jian-xin; DING Li
    Computer Engineering. 2008, 34(24): 71-73. https://doi.org/10.3969/j.issn.1000-3428.2008.24.025
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To satisfy the demand of access control in multi-domain systems, a developed RBAC model——Domain Role and Type-Based Access Control(DRTBAC) model is proposed. Concepts of domain, type, role association, etc. are introduced, mechanism of setting permissions flexibly is appended, and essential security principles penetrate roles partition, assignment and association. The problem that access control supports multi-domain systems is resolved, permission management is simplified, and access controls complying security principles are realized.
  • WANG Lei; PENG Xin; ZHAO Wen-yun
    Computer Engineering. 2008, 34(24): 74-76. https://doi.org/10.3969/j.issn.1000-3428.2008.24.026
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the requirement of dynamic adaptation evolution in software system, a framework for software dynamic adaptation evolution based on non-functional features is proposed, which combines non-functional features with the aspect implementation of different targets. The positive/negative influences and the balance relationship between them are also described. Moreover, the dynamic adaptation evolution is implemented by dynamic weaving of corresponding aspects. Experimental results show this framework is effective and feasible.

  • ZHA Qi; ZHENG Cheng; CHEN Tao;
    Computer Engineering. 2008, 34(24): 77-78. https://doi.org/10.3969/j.issn.1000-3428.2008.24.027
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    RDF/RDF Schema(RDFS) are techniques of semantic Web architecture. Although XML/RDF database arises very fast, RDBMS is still a popular choice of enterprise. In order to mix RDBMS and RDF/RDFS in applications, it is proposed to use RDFS to describe table schema in RDBMS. Based on the RDFS, a method is implemented to acquire data instance. This paper focuses on the way of building description of abstract data structure based on RDFS, and the method of achieving the purpose of configuration of RDF data structure and acquisition of RDF data.
  • WANG Hong-xia; ZHAO Xian-sheng; ZHOU Yun; QIN Si
    Computer Engineering. 2008, 34(24): 79-81. https://doi.org/10.3969/j.issn.1000-3428.2008.24.028
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper gives the general formula of finite field multiplication in optimal normal basis. Toward the trouble of precomputation in Rosing, by adopting Ning-Yin algorithm idea, it puts forward an improved algorithm and three precomputation methods. As a result, the new algorithm improves its efficiency by about 20% compared with Ning-Yin algorithm.
  • QI Wen; BAO Yu-bin
    Computer Engineering. 2008, 34(24): 82-84. https://doi.org/10.3969/j.issn.1000-3428.2008.24.029
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In real-time data warehouse, real-time or timely event-handling and decision automation are critical after acquiring real-time data. Aiming at resources competition in real-time warehouse system, the paper puts forward a reliable, scalable, and load-balance system scheme for asynchronous event-driven handling automation, which uses message queue and the improved active rule techniques. Furthermore, the paper proposes a practice reference system. It utilizes advanced queue and J2EE technology. Experimental results show that the scheme is feasible.
  • Networks and Communications
  • CHEN Lei; YANG Peng; HE Jian-feng
    Computer Engineering. 2008, 34(24): 85-87. https://doi.org/10.3969/j.issn.1000-3428.2008.24.030
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problems of handover existed in the inter-domain of Hierarchical Mobile IPv6(HMIPv6) protocol, an interactive fast seamless handover scheme in the inter-domain of HMIPv6 for real-time application is presented, which optimizes the handoff delay and the delay for packet sending of mobile IPv6. Simulation experimental results show this scheme is effective and feasible.

  • ZHOU Juan; LIU Jue-fu; LI Pei-song; MA Feng-wei
    Computer Engineering. 2008, 34(24): 88-90. https://doi.org/10.3969/j.issn.1000-3428.2008.24.031
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper discusses the problem of scheduling resource on tree-based grid computing platforms, and turns the question of different speeds of computation and communication in resource scheduling into linear programming problem. A tree-Petri model is presented and the performance of tree-Petri net model based on priority-computation heuristic algorithm for task allocation is analyzed, and the peculiarity of single-port model in tree-Petri net is validated.
  • LI Lu-jiao; LI Yun; CHEN Qian-bin; NIE Neng
    Computer Engineering. 2008, 34(24): 91-93. https://doi.org/10.3969/j.issn.1000-3428.2008.24.032
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In Wireless Sensor Network(WSN), congestion may occur when sensor nodes are densely distributed or burst a mass of data flows, the congestion tends to cause packet loss, which sequentially causes lower throughput and wastes energy. This paper proposes a new congestion control scheme, phase-divided TCP. It controls the congestion through phase-divided adjusting of the growth rate of the TCP window in the slow-start. Simulation results demonstrate that this scheme can dramatically resolve congestion control problem, and improve TCP performance of WSN.
  • CHEN Dan-dan; XIA Li; WANG Hai-feng
    Computer Engineering. 2008, 34(24): 94-95. https://doi.org/10.3969/j.issn.1000-3428.2008.24.033
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The performance of Networked Control System(NCS) depends on the message scheduling. However, most scheduling algorithms make the time characteristic as the basis for establishing the priority, which can not show the importance of information. A mixed scheduling algorithm based on Maximum Error First(MEF) algorithm is proposed, in which the Maximum Change First(MCF) algorithm is major and the Larger Delay Lower Priority(LDLP) algorithm is minor. This new algorithm enriches the basis for establishing the priority. Simulation experimental results show this mixed scheduling algorithm can promote the whole performance of the control system effectively.
  • ZHU Hong; SHAN Hong; HUANG Jun
    Computer Engineering. 2008, 34(24): 96-97. https://doi.org/10.3969/j.issn.1000-3428.2008.24.034
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the capability deficiency of AODV routing protocol in situation where nodes move at high speed, this paper proposes a routing protocol called GAODV which using the greedy algorithm and considering nodes’ moving state fully. This protocol includes extending Hello packet, restricting the number of control packet, establishing steady route and forbidding local routing repair. Simulation analysis shows that compared with AODV, GAODV has better throughput, and the average end-to-end delay is decreased by 55% when the node’s speed comes to 80 m/s.

  • DONG Jin-nan; QIN Gui-he; YU He; MIAO Li-ying; LIU Wen-jing
    Computer Engineering. 2008, 34(24): 100-102. https://doi.org/10.3969/j.issn.1000-3428.2008.24.035
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    As a key technique of software and hardware development related with interconnection between Universal Vehicle Network(UVN) and IPv6, the gateway between UVN and IPv6 is the basis of interconnection and the hard point of development. This paper presents the design process of a kind of Controller Area Network(CAN) application layer protocol which supports the connection with IPv6 backbone. As a structure of mapping the function between the IPv6 protocol and CAN application layer protocol, the Order/Fault Code Table(OFCT) is constructed and the software operation flow of gateway is described. The effectiveness and accuracy of this CAN application layer protocol are validated in the self-development automotive body network.
  • CHEN Feng; SONG Ling; MA Qiang
    Computer Engineering. 2008, 34(24): 103-105. https://doi.org/10.3969/j.issn.1000-3428.2008.24.036
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes an anycast routing algorithm supporting QoS in Multi-Protocol Label Switching(MPLS) networks. It pre-computes anycast path with least hop numbers. This path can fulfill bandwidth constraint by link state routing protocol from the destination node(server) of an anycast datagram to its source node(client). The algorithm reserves bandwidth on LSP using constraint routing-label distribution protocol. Simulation results indicate that the algorithm results about delay and data loss-rate are good, and it banlances the server load to some extent.
  • HAN Ying-qiang; HU Yue-ming
    Computer Engineering. 2008, 34(24): 106-108. https://doi.org/10.3969/j.issn.1000-3428.2008.24.037
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper applies the network processor into the network test field, designs and implements a network test system. It discusses the research and development status about the network test field, depicts the main functions about the the software and hardwar of the system, and analyses the disposal flow and the key problem in the system designing. It validates the capability of the system by testing its main modules, and testing results show that the network processor provides a good solution for the exploitation of a network test system with high capability.
  • GAO Zhen-guo; WANG Chun-sheng; LI Xiang; ZHAO Jing; LIU Sheng
    Computer Engineering. 2008, 34(24): 109-111. https://doi.org/10.3969/j.issn.1000-3428.2008.24.038
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Network simulation is a basic technique for researching on network technologies, including service discovery protocol for Mobile Ad-hoc NETworks(MANETs). However, no network simulator widely available nowadays provides the framework for service discovery protocol simulation. This paper demonstrats the method of constructing simulation framework for service discovery protocols using GloMoSim, including the extension of GloMoSim’s node layer model, message transmission type, as well as global simulation statistics. It is a reference for researchers to adapt GloMoSim to their special simulation requirements.
  • ZHANG Bo; WANG Bin-qiang; ZHANG Xiao-hui
    Computer Engineering. 2008, 34(24): 112-114. https://doi.org/10.3969/j.issn.1000-3428.2008.24.039
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper constitutes net traffic joint multifractal model based on multiplicative cascades process via symmetrical Beta distribution fitting multiplicator factor and absolute pareto distribution fitting random variable. It settles average value, variance and covariance of mixture traffic, and analyzes the model’s pure, long-range dependence and not two rank stableness characteristic, and uses DEC-PKT-1 of LBNL data to fit and test. Result proves this model is operative on fitting real networks traffic.

  • WANG Ze-jun; CHEN Xin; WANG Yong; GAO Bao-qing
    Computer Engineering. 2008, 34(24): 115-116. https://doi.org/10.3969/j.issn.1000-3428.2008.24.040
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper designs a monitoring system of enterprise Ethernet names NetMonitor, which supports Web services based on J2EE technologic. It introduces the method of dynamic load balancing, which is the core of cluster monitoring system, to use and distribute resource of system high effectively, and it manages distributed message utilizing dynamic library manager and affords a lot of strategies of task assignment based on route distribute strategy. This paper presents the results of experiments that systematically evaluate the performance of dynamic load balancing strategies, analyzes the matter of effect system performance and researches the improving method. The testing results show that the monitoring system supports dynamic load balancing has powerful analysis, query and diagnosis monitoring functions, and has the load balancing advantages of fast response time, high effective and high availability.
  • XU Tan; YANG Shou-bao; HOU Guan-bo; SUN Wei-feng
    Computer Engineering. 2008, 34(24): 118-120. https://doi.org/10.3969/j.issn.1000-3428.2008.24.041
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In view of the differences between CSMA/CA protocol and CSMA/CD protocol, the characteristic of stream competition is different from the one of cable network. The stream competition among wireless data is researched by the experiment conducted in Wireless Mesh Network(WMN) bed. Experimental results show the fact that UDP stream is much more dominant than TCP stream in sharing channel WMN, the throughput of downlink TCP stream is higher than uplink TCP stream, and the throughput of two-hop TCP stream is higher than three-hop TCP stream.
  • TAO Ting; SUN Le-chang
    Computer Engineering. 2008, 34(24): 121-123. https://doi.org/10.3969/j.issn.1000-3428.2008.24.042
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Rerouting mechanism is the main kind of the method to achieve anonymous communication system. Based on the model of rerouting-based anonymous communication system, this paper gives a new rerouting arithmetic that can build the rerouting path with N-path redundancy and work well in hard conditions. It calculates rerouting path dependability of the system and payload performance of the nodes, and analyzes its anonymity. The result shows that the N-path redundancy rerouting arithmetic satisfies the user’s requirements for dependability, and it increases the dependability of the rerouting path and ensures the sender’s anonymity. But it increases the node’s payload and decreases capacity of the system.
  • FAN Lun-ting; WANG Zhi-liang; YIN Xia; CUI Sai-hua
    Computer Engineering. 2008, 34(24): 124-127. https://doi.org/10.3969/j.issn.1000-3428.2008.24.043
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    OSPFv3 is one of the widely used intra-area routing protocols in IPv6. Aiming the problem of the routing monitoring for OSPFv3, this paper designs and implements a routing monitor system based on passively listening OSPFv3 network. By collecting packets from the target network, it can statistic and analyze the OSPF packets, display current and history topology, compare current topology with standard or history topology. Experimental results show that this method can work effectively, and achieves the expected results.


  • LIAO Bin-bin; ZHAO Zhi-jing; ZHANG Fu-hong
    Computer Engineering. 2008, 34(24): 128-130. https://doi.org/10.3969/j.issn.1000-3428.2008.24.044
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper introduces the principia of Cyclic Redundancy Check(CRC), CRC-5 algorithm and CRC-16 algorithm used in the CRC standard. The 8 bit byte-lookup-table algorithm and a method of generating the lookup-table are deducted. The hardware schematic diagram and software implementation pseudo code of CRC-5 and CRC-16 are presented. The software implementation of CRC-5 and CRC-16 is tested by Query and Select command specified in the Gen2 standard, and the results prove the correctness of the two algorithms.
  • Security Technology
  • WU Hua-feng; DAI Xin-fa; CHEN Peng
    Computer Engineering. 2008, 34(24): 131-133. https://doi.org/10.3969/j.issn.1000-3428.2008.24.045
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a hierarchical access authentication mechanism based on MIP-RR. It establishes authentication frame for MIP-RR protocol, and implements mutual authentication between neighboring mobile sustain nodes by using identity signature and digital envelope, which protects the integrality and confidentiality for registration message. Compared with access authentication mechanism based on base mobile IP protocol, security and encryption for the mechanism are enhanced, which can resist common security attacks effectively.
  • ZHANG Jin; LI Qing-cheng; ZHANG Zhen-hua; ZHAO Liang
    Computer Engineering. 2008, 34(24): 134-136. https://doi.org/10.3969/j.issn.1000-3428.2008.24.046
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper builds a distribution model for describing distribution problems between consumers’ diversified distribution demands and strictly restricted scope of the spread in Digital Rights Management(DRM). A related distribution mechanism based on the model, which takes different licenses for different distribution, is substituted. And consumers can configure distribution rights inherited with distribution processing with the help of separate keys chain, license chain mechanism and distribution rights management.
  • ZHAO Geng; YAN Hui; TONG Zong-ke;
    Computer Engineering. 2008, 34(24): 137-139. https://doi.org/10.3969/j.issn.1000-3428.2008.24.047
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper introduces the definiteness and properties of Chebyshev polynomial based on finite fields. It studies the security of the ElGamal-like cryptosystem based on Chebyshev polynomial of finite fields, and proposes a modified public-key cryptosystem. In the modified public-key cryptosystem, the secret key is hidden from public key, and it can not be calculated by public key. Analysis shows that the modified system is accurate and doable, and it is better than the ElGamal public-key cryptosystem based on finite fields Chebyshev polynomial.
  • CHEN Yue; KOU Hong-zhao; FEI Xiao-fei
    Computer Engineering. 2008, 34(24): 140-142. https://doi.org/10.3969/j.issn.1000-3428.2008.24.048
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To solve the scalability problem in Application Level Multicast(ALM) group key management scheme. MGKT, a multi-group key tree based large-scale ALM group key management scheme is proposed. To reduce the communication overhead for group key management, MGKT manages group members in clusters and confines each rekeying operation in one cluster. Analysis and simulation show that MGKT has preferable scalibility without sacrificing security.
  • WU Ping; WANG Bao-yun; XU Kai-yong
    Computer Engineering. 2008, 34(24): 143-145. https://doi.org/10.3969/j.issn.1000-3428.2008.24.049
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Following the analysis of existing distributed trust model to Ad Hoc networks, this paper presents an ID-based key management scheme using bilinear pairing. It employs the secret-sharing technique to distribute system key among a pre-selected set of nodes, called D-PKGs, which offers a collaborative private-key-generator service. The construction method not only ensures secure and efficient network-wide key update, but also establishes session key via only a single message using property of bilinear pairing. Analysis show the scheme is secure and effective.

  • CHEN Jia-yong; LIU Jiu-fen; ZHOU Han; ZHANG Wei-ming
    Computer Engineering. 2008, 34(24): 146-148. https://doi.org/10.3969/j.issn.1000-3428.2008.24.050
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Sequential LSB steganography embeds message into cover image by sequential LSB substitution. The problem of extracting attack to sequential LSB steganography is essentially equivalent to the problem of estimating the beginning and the end of the secret message. This paper constructs an extract attack model for sequential LSB steganography, by translating the problem of extracting attack into a sort-problem. It proposes an algorithm whose complexity is O(n) when the embedding rate p is unknown and a fast algorithm whose complexity is O(2logn) when p is known. The extracting attack to sequential JSteg is successfully made.

  • LIU Jiu-fen; LI Yu-hui; CHEN Jia-yong; ZHANG Wei-ming
    Computer Engineering. 2008, 34(24): 149-151. https://doi.org/10.3969/j.issn.1000-3428.2008.24.051
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Encoding method for steganographic codes based on GF(3) is presented. A ternary steganographic code is obtained through ternary steganographic Golay codeswhich is better than binary codes. This paper proposes a fast algorithm based on ternary Golay steganographic codes. This algorithm can reduce computational complexity of encoding, improves the efficiency of the steganographic algorithm.
  • CHEN Guang-xi; CHENG Yan
    Computer Engineering. 2008, 34(24): 152-154. https://doi.org/10.3969/j.issn.1000-3428.2008.24.052
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a video watermark scheme resistant to geometry transformation attacks. Image normalization is used to achieve synchronization by comparing the normalization information before watermark embedding or detection. Certain numbers of DCT feature blocks are selected based on Human Vision System(HVS) as the embedding points. Before watermark detection and after normalization, the fluctuating points caused by interpolation normalizing are adjusted. Experiments show that the scheme can be resistant to geometry transformation attacks well and satisfy invisibility, robust and security properties.
  • SUN Mei-feng; HUANG Fei; CHEN Yun-jing; YIN Xin-chun
    Computer Engineering. 2008, 34(24): 155-156. https://doi.org/10.3969/j.issn.1000-3428.2008.24.053
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to improve the accuracy and maintain an acceptable algorithm complexity, this paper proposes a new method for anomaly detection based on characteristic patterns and Markov chain model. It extracts the short sequence of system calls as a characteristic pattern if this sequence satisfies the certain support degree, and proposes an improved Markov model CPMC on this basis. When detecting intrusions, it uses the program trace to match characteristic patterns, and calculates the trace’s probability under CPMC model. Small probability means anomaly. Experimental results show that higher detection accuracy can be got than that with other current single methods. Compared with DBCPIDS, the method has the approximate accuracy but lower computational complexity.
  • GUO Cheng; LI Ming-chu; YAO Hong-yan; HU Hong-gang
    Computer Engineering. 2008, 34(24): 157-159. https://doi.org/10.3969/j.issn.1000-3428.2008.24.054
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper introduces the normal probability density function to describe the trustworthiness, and presents a trust evaluating model for quantifying the trustworthiness of peers based on recommendations, which can dynamically adjust its security level according to user’s request. The model is more logical to the social network than before. It introduces a probability method to relieve the influence of multi-path propagation of trust and improves the stability of the result. Analysis and simulation show that the new trust model is necessary and effective. The architecture possesses several desirable properties that are increasingly suitable for security requirements in the P2P networks.
  • LI Xiong; LI Zhi-hui; YU Jing
    Computer Engineering. 2008, 34(24): 160-161. https://doi.org/10.3969/j.issn.1000-3428.2008.24.055
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    YCH scheme is an efficient multi-secret sharing scheme based on two-variable one-way function and Shamir(t, n) threshold secret sharing scheme, but the scheme does not have the property of verification. This paper presents a verifiable multi-secret sharing scheme based on YCH scheme, RSA cryptosystem and intractability of discrete logarithm. It has the property of verification as well as the other properties of YCH scheme. It does not need a secure channel and each participant chooses his secret shadow by himself, so the scheme provides great capabilities for many applications.
  • LEI Xin-feng; LIU Jun; XIAO Jun-mo; ZHOU Hai-gang; ZHANG Yi-dan
    Computer Engineering. 2008, 34(24): 162-164. https://doi.org/10.3969/j.issn.1000-3428.2008.24.056
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyzes the possible faults in policy, formally defines the consistency and completeness of the security policy. By building the state model of security policy, the algorithm for formally verifying security policy is proposed. Based on the eXtensible Access Control Markup Language(XACML), a system to formally specify and verify the security policy is designed and implemented. This system makes the process of the formal verification automatic, and provides an efficient tool for a normal user to verify the security policy in a visual form.

  • GUO Yu-yan; WEI Shi-min
    Computer Engineering. 2008, 34(24): 165-166. https://doi.org/10.3969/j.issn.1000-3428.2008.24.057
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    It is the first time to prove the Miao Xianghua’s modified version of Needham-Schroeder protocol with the theory of strand space which is a rising formal analysis tool. Its authentication is analysed, the analysis contains responser’s authentication and sponsor’s authentication. Its confidentiality is analysed, and two concepts “honest” and “ideal” are used to simplify the process of verification. It indicates that K, Nb, Nb0 are secret. Result shows that the amended N-S protocol can reach the goal, and it is consistent with the result of Miao Xianghua’s analysis.
  • JIANG Li; LIU Ying-hua
    Computer Engineering. 2008, 34(24): 167-169. https://doi.org/10.3969/j.issn.1000-3428.2008.24.058
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Security problem is critical but hard to solve for mobile Agent system, so this paper integrates the E-commerce security system into the protection of mobile Agent, and puts forward a new protocol named Mobile Agent Secure Transfer Protocol(MASTP). The protocol is applied and actualized on Aglets platform. It is proved that the Aglets platform based on MASTP is secure and it is not complicated to develop or execute the software.
  • TIAN Zhi-gang; BAO Wan-su; ZHANG Wei
    Computer Engineering. 2008, 34(24): 170-171. https://doi.org/10.3969/j.issn.1000-3428.2008.24.059
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Most threshold proxy signature schemes are constructed on the base of discrete logarithm in infinite fields. Discrete logarithm cryptography based on ElGamal has some drawbacks such as long keys and difficult key management, which seriously limit its practical application. Elliptic curve cryptography is introduced and a threshold proxy signature scheme based on the cryptography is proposed, which can satisfy the properties of the threshold proxy signature, and withstand the conspiracy attack.
  • ZHANG Wen; ZHENG Quan; SHUAI Jian-mei; CHEN Chao
    Computer Engineering. 2008, 34(24): 172-174. https://doi.org/10.3969/j.issn.1000-3428.2008.24.060
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to improve the current malicious detection technology based on signature, this paper presents a method based on data mining. By researching the rules of API calling sequences during executing viruses, the method uses Apriori algorithms to extract some valuable related rules which hide out in a lot of API calling sequences of viruses. These rules can be used to detect Viruses. Experimental results validate its effection.
  • ZHAO Hui; LI Ming-chu
    Computer Engineering. 2008, 34(24): 175-176. https://doi.org/10.3969/j.issn.1000-3428.2008.24.061
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Multi-user coordinative computing in grid environment is an important research field. The security requirements in grid computing are very complex due to the complexity of grid computing. This paper proposes a multi-user coordinative relationship specification model based on Virtual Organization(VO) for grid computing. A grid security requirement analysis model is defined to provide formal security requirement specifications so that different security requirements are unified into one single theory architecture for multi-user coordinative computing in grid environment.

  • LU Yi; TANG Yuan-sheng
    Computer Engineering. 2008, 34(24): 177-179. https://doi.org/10.3969/j.issn.1000-3428.2008.24.062
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Chameleon signature is a non-interactive signatures, and its building block is Chameleon Hash function, a trapdoor one-way Hash function. The distinguishing characteristic of Chameleon signature is non-transferable and non-repudiation. This paper proposes a ID-based Chameleon digital signature which makes use of ID-based signature scheme from bilinear pairings byte Combining with Chameleon Hash function. Compared with the conventional Chameleon Hash functions, the owner of a public Hash key in the ID-based Chameleon Hash scheme does not necessarily need to retrieve the associated secret key in the scheme and it is an appointed verifier scheme.
  • Artificial Intelligence and Recognition Technology
  • JIANG Shui-lang; YANG Ming
    Computer Engineering. 2008, 34(24): 180-182. https://doi.org/10.3969/j.issn.1000-3428.2008.24.063
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Drowsy driving can be detected by the eye states. Eye location is the key problem for eye states detection. In order to improve real-time performance and solve uncertainty of head gesture, an eye lactation detection method based on dual spaces is proposed. Characteristics of skin-colors are used to detect face and saturation and lightness are used to detect the iris. Custom convolution template is used to locate no-close eye. Experimental results show that the correction rate of the algorithm is 94.76% and it is robust to faces with glasses, illumination changing, head gesture with good real-time performance.
  • ZHANG Qing-bin; WU Ti-hua; ; LIU Bo; PIAO Li-hua
    Computer Engineering. 2008, 34(24): 183-185. https://doi.org/10.3969/j.issn.1000-3428.2008.24.064
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to improve the performance of the compact Genetic Algorithm(cGA) to solve more complicated optimal problems, an improved cGA with higher selection pressures is proposed. In the proposed algorithm, S(S>2) individuals are generated from the probability vector, and then the best individual selected as the winner is obtained by their ranking order of the fitness value. In the competition process, the winner solution competes with the virtual solution composed of the linear combination of the other S-1 solutions. The probability vector is then updated towards the winner until the probability vector is converged. Experimental results on three different kinds of benchmark functions show that the proposed algorithm has higher precision of optimization than that of the standard cGA and the cGA with higher selection pressures.
  • WANG Lei; LIU Ge-feng; LI Yuan-yuan
    Computer Engineering. 2008, 34(24): 186-189. https://doi.org/10.3969/j.issn.1000-3428.2008.24.065
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    With regarded to the problem that the current system’s self-learning ability usually appears weak during service discovery, a novel Artificial Immune System(AIS) based service match model is proposed, which is based on the reference to the principles of cell’s mutation, evaluation and the secondary response abilities, as well as simulation on the antibody-antigen identification mechanism. Theoretical analysis and simulations show that the model can increase the recall ratio and match speed, and realize the function that similar services can be obtained by known services. Furthermore, this service match model is able to improve a system’s self-learning, memory and dynamic evaluation capabilities.
  • DONG Xiang-jun; SHI Hao-shan; JIANG Fei; ZHAO Yong-hui
    Computer Engineering. 2008, 34(24): 190-193. https://doi.org/10.3969/j.issn.1000-3428.2008.24.066
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper mentions an improved Genetic Algorithm(GA) used in mobile agent-based application system to calculate the best routing for mobile agent’s migration. By improving the arithmetic operators, the improved GA can optimize the performance of mobile agent-based systems. Qualities of the solution and convergence speed are evaluated in the followed examination compared with the classical GA. The result shows that the improved GA mentioned in this paper can ensure the quality of the solution, and has better convergence speed. This helps the application system run with higher efficiency.
  • YUAN Jin-ping; BAO Ai-hua; YAO Li
    Computer Engineering. 2008, 34(24): 194-196. https://doi.org/10.3969/j.issn.1000-3428.2008.24.067
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    With the birth and development of semantic Web, the communication and cooperation between human and computer or computer and computer become more and more convenient. This paper introduces the concept of semantic Web and its architecture, then analyses the key-techniques including XML, Resource Description Framework(RDF) and Ontology contrastively. After that, logic foundations(description logics) of semantic Web is researched, as well as its syntax, semantics and reasoning tasks. And a prospect of the hotspot in the future of semantic Web is given.
  • YANG Peng; JIANG Wei; LIU Pin-jie; ZHANG Yan
    Computer Engineering. 2008, 34(24): 197-199. https://doi.org/10.3969/j.issn.1000-3428.2008.24.068
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Based on Matlab RTW semi-physical simulation platform, a siding mode control algorithm is presented for a kind of uncertain time-delay system. Through a particular linear transformation, the original uncertain time-delay system is first transformed into a delay-free system. Based on the transformed system, a design method of optimal sliding mode with a quadratic performance index minimized is proposed. An appropriate control law which is approached by a RBF Neural Network(RBFNN) and the weight of the network is tuned on line using adaptive algorithm to force the system states to reach the sliding manifold in finite time. Simulation results show the efficiency and superiority of the proposed method.
  • LU Gui-ming; WANG Xiao-bing
    Computer Engineering. 2008, 34(24): 200-201. https://doi.org/10.3969/j.issn.1000-3428.2008.24.069
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The problem of task schedule is an NP problem. The algorithm about this problem is an important research direction. Through researching and analyzing the model of task scheduling and the immune algorithms existed, the paper presents a task scheduling algorithm based on real-coded immune algorithm. It discusses the style of coding, the generation and update of stocks, the update of memory cells and the value of parameters, and explores the functions of affinity and concentration degree. This algorithm is realized with the software of the VC++, and through the example comparative analysis, this algorithm is proven validity and feasibility.
  • ZHOU Zhen-yi; HU Fu-qiao
    Computer Engineering. 2008, 34(24): 203-205. https://doi.org/10.3969/j.issn.1000-3428.2008.24.070
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Background modeling is an important issue in accurate detection of moving objects. This paper presents a novel non-parametric foreground-background model which explores the complex temporal and spatial dependencies in nonstationary scenes. The model estimates the probability of observing pixels’ five-dimensioned feature vector which represents its intensity values and spatial position information. The model is built and rolling-updated by kernel density estimation. And a Maximum A Posteriori-Markov Random Field(MAP-MRF) decision framework is used to segment the foreground and background by solving a graph-cut. Extensive experiments with nonstationary scenes demonstrate the utility and performance of the proposed approach.
  • YAN Jian-yun; ZHENG Jiang-bin; LI Xiu-xiu
    Computer Engineering. 2008, 34(24): 206-207. https://doi.org/10.3969/j.issn.1000-3428.2008.24.071
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problems that the marks can not be matched and tracked in video motion parameter capture system, a 3D stereo multi-targets tracking algorithm is proposed, which locates the position of the marks by using 2D and 3D Kalman filters prediction. This algorithm also adopts 3D stereo matching method and the constrain relationship of epipolar line to complete matching and tracking of multi-targets. Experimental results demonstrate that the algorithm is effective.
  • SUN Qi; WANG Dong
    Computer Engineering. 2008, 34(24): 208-210. https://doi.org/10.3969/j.issn.1000-3428.2008.24.072
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problems such as long computing time and easy to fall into local best for ant colony algorithm in practical application, a new optimization parallel ant colony algorithm with particle swarm features is proposed. Combined with other relevant algorithms, this one is also applied in the case of logistics alliance vehicle routing. Experimental results show this algorithm has better performance in view of decreasing computing time and avoiding early maturing phenomenon.

  • LI Xiao-yong; ZHANG Shao-gang
    Computer Engineering. 2008, 34(24): 211-212. https://doi.org/10.3969/j.issn.1000-3428.2008.24.073
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A novel quantization model of adaptive dynamic trust relationship is proposed, in which the direct trust computing method based on history function and the feedback trust converging model based on path function are set up. Then, two new parameters, confidence factor and feedback factor, are introduced to establish and adjust the weight of direct trust and feedback trust automatically. Simulation experimental results show that, compared with the existed relevant models, this model can improve the accuracy of trust decision effectively.
  • XIE Shen-quan
    Computer Engineering. 2008, 34(24): 213-215. https://doi.org/10.3969/j.issn.1000-3428.2008.24.074
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    An algorithm for generating de Bruijn sequences by raising stage is presented. According to the given look-up table label of n stage de Bruijn sequences, the look-up table label of n+1 stage de Bruijn sequences is constructed by using synthesis method. Then, the n+1 stage is produced. Experimental results show this algorithm is effective.
  • SUN Ling-yu; PENG Xuan-ge; LENG Ming;
    Computer Engineering. 2008, 34(24): 216-217. https://doi.org/10.3969/j.issn.1000-3428.2008.24.075
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    On the basis of analyzing an attribute reduction algorithm based on static discernibility matrix, an attribute reduction algorithm based on dynamic discernibility matrix is proposed. Two different adjustment schemes are used to give the existed reduction and the effect of the extra contidion attribute to information system objectively and timely. Experimental results show this algorithm can not only find attribute reduction of information system, but also reduce the quantity for computing the attribute reduction effectively, and promote the efficiency of the computation.
  • CHEN Bing; ZHANG Hua-xiang
    Computer Engineering. 2008, 34(24): 218-220. https://doi.org/10.3969/j.issn.1000-3428.2008.24.076
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to improve the classification performance of dataset, a dynamic combinatorial method of multiple classifiers on ensemble learning DEA is proposed in the paper. DEA is tested on the UCI benchmark data sets, and is compared with several member classifiers trained based on the algorithm of Adaboost. In this way, the utility of DEA can be proved.

  • Multimedia Technology and Application
  • BI Xin-min; WU Jie; LV Zhi-hui; ZHONG Yi-ping
    Computer Engineering. 2008, 34(24): 221-224. https://doi.org/10.3969/j.issn.1000-3428.2008.24.077
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper designs and develops a P2P streaming living broadcast system which ensures node robustness. It introduces a way of choosing best neighbors from some given nodes, makes information of all the nodes in the area known by the strong nodes while minimizing the communication with strong nodes. It must be making quick responses to the new joining in nodes and leaving nodes. Comparison with the PeerCast system proves the design is effective and advanced.
  • ZHAO Zhi-jie; LIU Zeng-yu; ZHANG Li-zhi; LI Yun; SHAN Da-wei
    Computer Engineering. 2008, 34(24): 225-227. https://doi.org/10.3969/j.issn.1000-3428.2008.24.078
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyzes features of bitstream generated by Embedded Zerotree Wavelet(EZW) in scalable video coding system, and presents a new method that combines arithmetic coding and run length coding though optimal predictor to optimize entropy coding. Experimental results show that the coding efficiency average increases about 10% by using the new method than using traditional arthmetic, and it obtains the purposes of further data compression.
  • LU Ye-xu; RONG Lu; LIU Qi
    Computer Engineering. 2008, 34(24): 228-229. https://doi.org/10.3969/j.issn.1000-3428.2008.24.079
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the characteristic of Broadband Wireless Multimedia(BWM) system, a random access scheme based on BWM system is proposed, which can multiplex several random access signals effectively, and promote the operating factor of frequency spectrum. Moreover, the detection method of single threshold with low complexity is also implemented, which makes the system achieve better detection performance under low false detection probability. Experimental results show this scheme is feasible.
  • DONG Peng-yu; LIN Tao
    Computer Engineering. 2008, 34(24): 230-232. https://doi.org/10.3969/j.issn.1000-3428.2008.24.080
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a new approach combing beamforming and subspace filter for noise reduction under multi-microphone condition. The directional characteristic of beamforming provides nulls against the noise signal and directional lobe to the target signal. The output of beamforming acts as input signal of subspace filter. Experimental results show that the method outperforms conventional algorithms in noise reduction, while its computation complexity is reduced.
  • WANG Lei; PAN Liang; WU Guo-bin; NI Hong
    Computer Engineering. 2008, 34(24): 233-235. https://doi.org/10.3969/j.issn.1000-3428.2008.24.081
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Embedded digital broadcasting terminal has two problems in receiving and saving broadcasting information. In the process of data receiving, the processing speed of embedded system is too low to receive the data in time and packets will be missed. When mass data is dynamically saved, continual requests for memory will result in memory fragments and influence the performance of the whole system. Directing at the characteristics of data broadcasting, this paper adopts loop buffer and bidirectional queue to solve the problems. Experiments validate that the method is feasible and reliable.
  • FAN Zhi-hao; XU Ping; FAN Ying-le; PANG Quan
    Computer Engineering. 2008, 34(24): 235-237. https://doi.org/10.3969/j.issn.1000-3428.2008.24.082
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a multi-reference motion estimation algorithm for H.264 based on multi-resolution. It imports the multi-resolution to get the motion vector rapidly, and utilizes the motion vector and the temporary motion vector map to predict optimal motion vector for a reference frame, which does not need the same search complexity. Experimental results under x264 software platform show that the algorithm can decrease the multi-reference motion estimation time notability, while the quality of video image degrades little.
  • Engineer Application Technology and Realization
  • DUAN Xiao-dong; GU Li-zhi
    Computer Engineering. 2008, 34(24): 238-240. https://doi.org/10.3969/j.issn.1000-3428.2008.24.083
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper studies and designs a high performance radix-4 Fast Fourier Transform(FFT) processor. Based on the radix-4 algorithm, butterfly-like computing cell of pipeline structure, the processor is improved to work at a more rapidly processing speed and a higher clock frequency. By using the spilling state machine, the spilling detection for the output data of each butterfly-like computing cell with the block floating-point algorithm is reliable to determine the state of spilling. Validation and performance evaluation results show that the FFT processor has high performance.
  • XIAO Jian-feng; YOU Zhi-qiang; KUANG Ji-shun
    Computer Engineering. 2008, 34(24): 241-243. https://doi.org/10.3969/j.issn.1000-3428.2008.24.084
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In terms of the problems in extended compatibility scan tree construction algorithm based on weighted compatible clique when creating compatible clique, three improvements of this algorithm are proposed by following rules: to select the scan cells which have more Xs in its test vector, to select the scan cells which have smaller degree to create XOR clique, and to allow an XOR clique to create other new XOR clique. Experimental results show this improved algorithm is more effective.

  • LV Feng; LI Fen; WU Kai
    Computer Engineering. 2008, 34(24): 244-245. https://doi.org/10.3969/j.issn.1000-3428.2008.24.085
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aimming at problems of the integration of RT CORBA and FT CORBA as the infrastructure for DRE systems are analysed, the real-time fault-tolerant model based on semi-active replication strategy is proposed and applied in DRE system. Correlative tests are done. Tests prove that the model which adoptes semi-active replication is better suited for real-time systems than other replication strategies, and it can offer fault-tolerant support to system on the premise of assuring real-time requirements.
  • FENG Yu-long; ZHANG Wei
    Computer Engineering. 2008, 34(24): 246-249. https://doi.org/10.3969/j.issn.1000-3428.2008.24.086
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Under the research background of the network mobility based on mobile satellite communication, using the network simulation software NS as the simulation platform, by extending and improving the module of the Mobile IPv4 model in NS, this paper realizes the double IP tunnel, which can sustain the function of NEtwork MObility(NEMO) with fixed topo. By improving the module of the wireless channel, the satellite channel is simulated, the BMSC-NEMO model based on mobile satellite communication which can simulate the transmission performance of IP data is built, and the validity and veracity of the model is validated by simulation experiment.
  • Developmental Research
  • SHI Song; CHEN Chong-cheng; WANG Qin-ming; TANG Min
    Computer Engineering. 2008, 34(24): 250-252. https://doi.org/10.3969/j.issn.1000-3428.2008.24.087
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Tree modeling is the key work of constructing the virtual forest landscape, and is also the basic of 3D forestry Geographic Information System(GIS). A tree parameterized modeling method under constraint of morphological characters is presented, in which the shape of truck and branch is controlled by introducing Bezier curve. This modeling method is designed and implemented in the case of lichee tree and redpine. Experimental results show this modeling method can improve the interactive ability in the process of tree modeling effectively, and reflect the morphological characters of trees better.

  • LIU Xiao-sheng; CAO Jing-hua; SHEN An-dong
    Computer Engineering. 2008, 34(24): 253-255. https://doi.org/10.3969/j.issn.1000-3428.2008.24.088
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Based on the differences of programming and debugging on microcontrollers of HC08 family, this paper presents a universal design model of programmer and debugger, expounds universal design elements of software and hardware, explains how to design and realize the sub-routines of erasing or writing flash in details. Experimental result shows that the programmer and debugger is applicable to HC08 family Micro Controller Unit(MCU) with good universality.
  • PENG Xin-lin; WANG Ning-ming; ZHOU Jian-feng; WANG Jing-cheng ; XU Wen-yan
    Computer Engineering. 2008, 34(24): 256-257. https://doi.org/10.3969/j.issn.1000-3428.2008.24.089
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    It is inconvenient to collect traffic data from Sydney Coordinated Adaptive Traffic System(SCATS) by using special software. In order to solve this problem, this paper proposes a software solution for data collection system, which uses ITS interface to collect traffic data from SCATS and stores them into SQL Server 2000. Result shows that it can successfully collect traffic data from SCATS, and it is convenient to collect traffic data form the database.
  • WENG Yun-jian; ; JIANG Zhuo-ming; FAN Hua-xiang; LIANG Dong; SUN Gong-xing
    Computer Engineering. 2008, 34(24): 258-260. https://doi.org/10.3969/j.issn.1000-3428.2008.24.090
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Quattor starts the node’s PXE network card by long-distance installment. Automatic installment contains software package, service installment and so on. Even the node environment is installed. Templates which describes installment condition are used by PAN language compilations. Templates end with the suffix tpl. The system manager doesn’t master Quattor. It is possible to run Quattor without knowing where to begin. However, the template automatic production system exactly solves this difficulty. It can support HTTPS in the long-distance by (on SSL HTTP) Web browser to make Quattor on the Web flat automatically produce templates. It is under the secure premise to use long-distance template automatic production.

  • LI Guang-min; CHEN Nian-sheng
    Computer Engineering. 2008, 34(24): 261-262. https://doi.org/10.3969/j.issn.1000-3428.2008.24.091
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to solve the problem with information sharing, updating & maintenance of farmland-grading results, a solution based on the WebGIS in ArcIMS platform is developed. The farmland grading information publication system is designed and constructed and can be convenient for the ministry of land and resources to manage and utilize the national land and resources effectively. From the successful operation of the pilot project carried out in Hubei Province, it is proved that the system is stable, high-performance and achievable.
  • CHEN Yi-fang; CHEN Qing-kui; XU Fu-yuan
    Computer Engineering. 2008, 34(24): 263-265. https://doi.org/10.3969/j.issn.1000-3428.2008.24.092
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To solve the problem that application systems in current government are isomerous, collaboration and management difficulty and each other can not share resurce, this paper provides an efficient model, which is the platform composed of external and internal application and data conformity. Two core components are described. An example of the model is given. This model can efficiently utilize the existing resources, integrate the various applications and the isomerous data resources, which conveniently make all kinds of e-government applications to interact.
  • YAO Liang; XU Shao-bin; HU Xue-gang;
    Computer Engineering. 2008, 34(24): 266-267. https://doi.org/10.3969/j.issn.1000-3428.2008.24.093
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Tax date has a large mount and FP_TREE algorithm needs huge memory for data mining. To solve these problems, an association rule algorithm based on binary tree frequency pastern tree is announced. The algorithm stores data by binary tree to decrease the time that accessing database. It reduces the memory needed by pre-build the binary pastern of the binary pastern. It is applied to the analysis of the data of taxation law enforcement, and the potential rules of faults accrued during taxation law enforcement are found out. It raises the scientificalness and actual effect of management for taxation law enforcement.
  • ZHANG Bai-hua; YE Xiao-feng; WANG Yi-gang ; SHAO Jian
    Computer Engineering. 2008, 34(24): 268-271. https://doi.org/10.3969/j.issn.1000-3428.2008.24.094
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The collaborative viewing and markup becomes an important research field in the collaborative technology and facing a increasingly demand to support the heterogeneous product design platform. This paper studies the technology of viewing and markup on Web-based supporting heterogeneous data, the Web-based collaborative technology, file versions management and security management for collaborative viewing and markup, and develops a prototyping Web-based collaborative viewing and markup system supporting the heterogeneous data. Results show that the system can realize Web-based collaborative viewing and markup supporting heterogeneous data, promote the progress of product design and improve design efficiency.

  • CAO Xiao-hua; TAO De-xin
    Computer Engineering. 2008, 34(24): 272-274. https://doi.org/10.3969/j.issn.1000-3428.2008.24.095
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to characteristic of radio wave diffraction in container Radio Frequency IDentification(RFID) system, this paper establishes the forecast model of radio wave propagation fading between reader and tag. Using the model to analyze performance parameter of container RFID system, this paper obtains some relation curves among identification distance, sending power and BER. The research results show that, TE polarization can not be applied in container RFID system and the fading value caused by multi-path propagation should be reduced to minimum during designing and applying RFID system.
  • ZHANG Bin; LUO Gui-e
    Computer Engineering. 2008, 34(24): 274-275. https://doi.org/10.3969/j.issn.1000-3428.2008.24.096
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents a fast design method of soft keyboard in MiniGUI. It creates soft keyboard panel by MiniGUI’s Coolbar control and sends proper messages to input method window through clicking corresponding buttons on soft keyboard panel. It realizes a soft keyboard including Chinese character input easily. According to the method, test procedures including character input by soft keyboard run successfully. The results show that the design program is simply and effective.
  • SHANG Jie; XIONG Yue-shan; XU Xing-hua; KANG Yong
    Computer Engineering. 2008, 34(24): 276-278. https://doi.org/10.3969/j.issn.1000-3428.2008.24.097
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the gradient domain method with two features, this paper propose an improved method for large deformation of 3D model with skeleton. It adds a virtual node near the model part that may introduce most of the volume degradation during deformation, such as joint part in the articulated deformation, and adjusts the weights in the energy function to make the deformation material-aware. Experiment shows the effectiveness and efficiency of the method in virtual knee joint surgery.

  • ZHANG Jun-yao; CHENG Yun; ZHENG Bing-hui
    Computer Engineering. 2008, 34(24): 279-281. https://doi.org/10.3969/j.issn.1000-3428.2008.24.098
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper designs the water environment management information system of river delta based on Web Geographic Information System (GIS). The system, with ArcIMS as the platform, SQL server as the database, which assures the ecological environment dynamic change can be monitored in real time, simulates the water quality pollution diffusion, forecasts the changing tendency of the water quality, appraises the quality of ecological environment, and offers early-warning and Spatial Decision Support(SDS). It realizes standardization and schematization of the water environment management.
  • YANG Chao; ZHAO Qun-fei
    Computer Engineering. 2008, 34(24): 282-284. https://doi.org/10.3969/j.issn.1000-3428.2008.24.099
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a solution using embedded system to provide navigation for the blind or visually impaired persons. Integrating with the high performance fix-point DSP ADSP-BF533 and video codec SAA7113, a hardware platform using as image processing is designed while recognition algorithms implemented on ported embedded operation system and optimizing methods are given. Results of experiment suggest that this system has good real-time property and recognition accuracy, which can serve the blind’s need for walking outdoors independently.