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

20 December 2006, Volume 32 Issue 24
    

  • Select all
    |
    Degree Paper
  • ZHANG Jizheng; JIA Huibo
    Computer Engineering. 2006, 32(24): 1-3. https://doi.org/10.3969/j.issn.1000-3428.2006.24.001
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Along with widely using information technology, modern storage system is improved to satisfy user needs. Flexible networked data storage center(data center) is an IP-based storage system in which storage devices can be accessed directly by hosts without passing through a server. This paper analyzes the system architecture of data center. The experimental results show that data center provides higher performance than server-based storage system. Network attached optical jukebox leads data center to a hierarchical storage structure. Mass disk buffer combined with CD mirror technology makes jukebox more efficient. Security of data center is also considered. A biological immunity——inspired security mechanism in data center is used to protect storage nodes from abnormal access and operation.
  • ZHANG Chongyang; YANG Jingyu; ZHANG Yan
    Computer Engineering. 2006, 32(24): 4-5. https://doi.org/10.3969/j.issn.1000-3428.2006.24.002
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Legal amount characters extracting from chinese bankcheck images represents an important challenge in the field of automatic check processing. Difficulties are derived mainly from the complex backgrounds, including preprinted lines, texture lines and seal images with different types and positions, since they are often dark and stroke-like. This paper proposes a new legal amount image segmentation method. Preprinted lines are removed with morphological method. The new image is pre-binaried based on the analysis of gray level feature and local double edge feature. Broken strokes are connected through region growing procedure. Comparative experiment results on real-life check images demonstrate the effectiveness of the method.
  • ZHANG Xueyuan; WANG Zhiliang; Nagai Masatake
    Computer Engineering. 2006, 32(24): 6-8. https://doi.org/10.3969/j.issn.1000-3428.2006.24.003
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For human users interacting with computers in a harmonious way, this paper conceives a structure model of affective robot based on multi-agent. The modeling methods of affective interaction are proposed. It introduces affective model and affective correlation model based on grey system, and shows the robot’s learning model. The models are experimented on the robot platform, and the results prove that robot has the ability of affective and intelligent interaction.
  • SHI Zhenguo; LIU Zongtian; CHEN Feng; JIN Qingjiang
    Computer Engineering. 2006, 32(24): 9-12. https://doi.org/10.3969/j.issn.1000-3428.2006.24.004
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a new model for grid resource management by employing fuzzy concept lattice and fuzzy concept trie and combines FCA(Formal Concept Analysis) theory with grid resource management technology. The formal concept definitions of grid and resource are given and the fuzzy concept lattice for the grid resources is constructed. The extent trie and intent trie of fuzzy concepts for the grid resources are created and the algorithms are developed for trie creation and retrieval to resources and services by FCA methods. Experiments and application examples show that the method of resource organization is feasible and effective.
  • LI Yuan; CHEN Xinmeng
    Computer Engineering. 2006, 32(24): 13-14. https://doi.org/10.3969/j.issn.1000-3428.2006.24.005
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to solve the bandwidth reservation conflict caused by the common links of QoS routes in mobile ad hoc networks, this paper proposes a disperse link-state multi-path QoS routing. It dynamically collects disperse link-state information from source to destination, and finds node-disjoint paths. According to the LBHBF strategy, it chooses proper paths whose delay and aggregate bandwidth to meet the QoS requirement, and reserves the bandwidth of corresponding paths. Simulation results show this scheme increases the call success rate and decreases the network cost.
  • TONG Yuanman; DAI Kui; LU Hongyi; WANG Zhiying
    Computer Engineering. 2006, 32(24): 15-16. https://doi.org/10.3969/j.issn.1000-3428.2006.24.006
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To protect modular exponentiation against simple and differential power analysis, a new method is presented. In this method, primitive operation is defined as fined grained operation which granularity is less than a whole modular multiplication’s. Then modular exponentiation is transformed to a complete randomized sequence of primitive operations. Besides, the scheduler and computation is performed in parallel. As the minimal controllable operation is fined grained, the method presented in this paper is not only easily implemented with much flexibility, but also is easy to enhance performance.
  • CHEN Gang; CHEN Xinmeng
    Computer Engineering. 2006, 32(24): 17-19. https://doi.org/10.3969/j.issn.1000-3428.2006.24.007
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The performance of language identification depends heavily on the description of differences between languages. This paper exclusively describes one language through two sets of data—the basis functions of the feature space and the probability distribution of every dimension of coefficient vector, which are calculated using independent component analysis method on its training data. A posterior probability is computed through the two sets of information when a match between the test speech and one specific language is evaluated. The language corresponding to the maximum posterior probability serves as the identification result. The algorithm is proven to be fast and effective by the result of experiments.
  • HAN Chao; JU Rusheng; HUANG Kedi
    Computer Engineering. 2006, 32(24): 20-22. https://doi.org/10.3969/j.issn.1000-3428.2006.24.008
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The high level architecture(HLA) is a framework facilitating the development of distributed simulations. Recently, much research and development has centered on addressing the shortcomings of the HLA. Using Web services to extend HLA simulation system can solve current problems and improve the interoperability of the system. The paper describes the benefits of using Web services. The methods for using Web services to extend HLA simulation system are given.
  • ZHAO Yue; MU Zhichun
    Computer Engineering. 2006, 32(24): 23-25. https://doi.org/10.3969/j.issn.1000-3428.2006.24.009
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper modifies the query-by-committee(QBC) method of active learning by combining vote entropy and kullback-leibler divergence for learning TAN classifier to model telecom clients’ credit classification. Experimental results show that the proposed QBC is better than previous QBC approach in classification accuracy with a few labeled training examples.
  • DONG Chunli; HAN Lin; ZHAO Rongcai
    Computer Engineering. 2006, 32(24): 26-28. https://doi.org/10.3969/j.issn.1000-3428.2006.24.010
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For high-performance parallel computer, finding a good decomposition of computation and data, minimizing communication by increasing the locality of data references is an important optimization for achieving high performance. This paper describes a linear decomposition algorithm that automatically finds computation and data decomposition and no data reorganization communication.
  • Software Technology and Database
  • WANG Dan; ZHANG Hao; LU Jianfeng
    Computer Engineering. 2006, 32(24): 29-30. https://doi.org/10.3969/j.issn.1000-3428.2006.24.011
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Mining of association rules is an important research topic among the various data mining problems, during which Apriori algorithm is a classic algorithm. And the most significant part of Apriori is the extraction of the frequent itemsets. This paper analyzes the performance of Apriori in mining association rules. To improve the connection step and pruning step of Apriori, a new algorithm named MApriori is introduced. In order to compare the two algorithms, an algorithm emluator is used. And the result indicates that the improved algorithm can accelerate the generating speed of the frequent multi-itemset, and improve the efficiency of mining accordingly.
  • HUANG Yingjiang; CHEN Yifeng
    Computer Engineering. 2006, 32(24): 31-33. https://doi.org/10.3969/j.issn.1000-3428.2006.24.012
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The source codes of Linux OS are open. When Linux kernel is running, it uses a lot of structural objects , called kernel objects. How to manage the creation, usage and recycle of these objects requires a perfect management mechanism. This paper discusses the theory of Slab memory buffer manager and how to use Slab manager to manage all kinds of kernel objects in Linux kernel.
  • LUO Shengtao
    Computer Engineering. 2006, 32(24): 34-36. https://doi.org/10.3969/j.issn.1000-3428.2006.24.013
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents the unified authority system architecture based on Web services technology. According to the architecture, the business systems share the single same authority system, then the developers of the business system needn’t care about the implement detail of the authority, so they can put all their heart to develop the business function.
  • ZHANG Ping; LI Qingbao; ZHAO Rongcai
    Computer Engineering. 2006, 32(24): 37-40. https://doi.org/10.3969/j.issn.1000-3428.2006.24.014
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    OpenMP is widely used in parallel programming for its portability and simplicity. This paper introduces the compiler optimization algorithms for OpenMP parallel program. In compiling, parallel regions are reconstructed through extension and combination. And a barrier synchronization optimization algorithm based on cross-processor dependence graph is developed to eliminate redundant barriers in each parallel region. Analysis show that these strategies reduce the number of parallel region and barrier synchronization, and can improve the parallel performance of OpenMP program.
  • ZHENG Jianghua; YAN Lei; LIU Yuefeng; HE Lina;
    Computer Engineering. 2006, 32(24): 41-43. https://doi.org/10.3969/j.issn.1000-3428.2006.24.015
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A successful personal navigation application needs not only stable communication technique, accurate positioning methods and highly efficient routing algorithms, but also reasonable data organization. The key problems of data organization for personal navigation lie in several aspects. One is properly to manage the spatial data for representation with multiple scale levels. Another is to cope with the real-time data organization. The third is to arrange data in different layers and sections. The fourth is to make multiple levels of network representation for navigation computing. Also data compression and data model are also important. The paper discusses the data organization for an application case, NAVISTAR.
  • JIN Wei; ZHANG Kejun; QU Wenlong; YANG Bingru
    Computer Engineering. 2006, 32(24): 44-47. https://doi.org/10.3969/j.issn.1000-3428.2006.24.016
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a distributed Web log mining system model based on Web text(DWLMST). It is presented that the more general incremental updating algorithms of local interest transfer patterns (LITP) and global interest transfer patterns (GITP) in a distributed database system based on DWLMST for discovering the user interest transfer patterns. The algorithms better solve troubles which are made by the real time incremental distributed Web access information and the more communication number.
  • LIN Weiwei; QI Deyu; LI Yongjun
    Computer Engineering. 2006, 32(24): 48-49. https://doi.org/10.3969/j.issn.1000-3428.2006.24.017
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A grid-based integration model of distributed heterogeneous data is present based on the analysis of the shortcomings of the existent heterogeneous data integration system. Using grid data services developed by Globus Toolkits 4, it can highly effective access to separate data sources via the grid and uses the reliable file transfer service to transfer large-scale data on demand. Finally, an example of the model-based is achieved.
  • ZHANG Hongtao; DUAN Fajie; WANG Xueying; YE Shenghua
    Computer Engineering. 2006, 32(24): 50-51. https://doi.org/10.3969/j.issn.1000-3428.2006.24.018
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To achieve reusability, expandability and maintainability, various design patterns are used to design the framework of application program. Message is elementary driving model on the Windows platform. Based on this point, this paper devises a universal application framework by using MVC and Publish design patterns. This framework isn’t limited by specific embedded system platform, and code of key class in system is presented in this paper.
  • CHEN Dungen; CHEN Wensheng; FAN Yuezu
    Computer Engineering. 2006, 32(24): 52-54. https://doi.org/10.3969/j.issn.1000-3428.2006.24.019
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyzes the memory format of the Shape document series (*.shp, *.shx and *.dbf), studies the method of the Shape document management in the relational database, realizes managing the Shape document in relational database and the correlation map demonstration process.
  • LI Qinghu; WANG Jianmin
    Computer Engineering. 2006, 32(24): 55-57. https://doi.org/10.3969/j.issn.1000-3428.2006.24.020
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In remote education program, large amounts of educational resource files and large numbers of users should be managed. In such a grid environment, a high scalable, distributed file sharing approach with dynamic replication is needed. This paper reviews related activities in file sharing and proposes a Web-based distributed file management architecture called grid file system (GridFS) and describes its two fundamental services (namely, file access service and metadata service). GridFS would benefit most grid applications, interlinkage among digital libraries and hierarchical Web cache systems.
  • MA Long; LIN Huaizhong
    Computer Engineering. 2006, 32(24): 58-59. https://doi.org/10.3969/j.issn.1000-3428.2006.24.021
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Optimistic replication is widely used in mobile environment. This paper presents a log-based data replication model, which records and reconciles changes to data more efficiently and causes less communication and storage overhead. Compared with traditional approach, this model is especially suited to large quantity of small data.
  • ZHANG Hejun; ZHANG Yue
    Computer Engineering. 2006, 32(24): 60-62. https://doi.org/10.3969/j.issn.1000-3428.2006.24.022
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    】A Bootloader remote cross debug model is designed and realized to solve debug problem of embedded system in stand-alone environment. Hosts analyze debug information of object file, and send debug commands being machine level to Bootloader of target machine; Bootloader receives and handles debug commands. This model provides a good debug method for development of embedded system.
  • GUO Zhenyu; LIU Li; CHEN Yu; TANG Zhizhong
    Computer Engineering. 2006, 32(24): 63-65. https://doi.org/10.3969/j.issn.1000-3428.2006.24.023
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Runtime optimization analyzes the runtime information it collects, identifies hot spots, applies optimization on them, thus speedups the execution of the programs. However, the system itself may consume critical resources, which sometimes counteracts or even outweighs the benefit it gains, and leads to the failure of the optimization. This paper implements an adaptive binary optimization/compilation framework on SMP/IPF (Intel Itanium processor family)/Linux, among which runtime optimization is included. It also analyzes the stage and cost of runtime optimization, introduces the ideas and ways which are conducted to reduce them, during the implementation of the framework.
  • XU Yongfeng; LI Qingshan; CHEN Ping; SHI Hongjun; XIA Hui
    Computer Engineering. 2006, 32(24): 66-68. https://doi.org/10.3969/j.issn.1000-3428.2006.24.024
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The paper emphasizes on the research of the representation technology of UML activity diagram based on the dynamic information collected by dynamic analysis, presents the algorithm of activity diagram representation and discusses representation for fork type of dynamic information showing creation relations among processes and wait type of dynamic information showing synchronizing relations among processes and representation for inter-process communication relations based on object flow. Finally, the validity of the algorithm is verified by a practical system.

  • ZHAO Yuehua; CAI Guixian; JIANG Jun
    Computer Engineering. 2006, 32(24): 69-71. https://doi.org/10.3969/j.issn.1000-3428.2006.24.025
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the requirements for storing file and secure operations in some electric application, this paper refers to the BLP security module and builds a secure and embedded file system——esfs ( embedded and secure file system ). This file system builds file mapping mechanism in RAM, which operates the files loaded from flash in high-speed RAM. It is characterized by non-directory management, security and small size, which make it useful in the area of electric application specially.
  • GUO Chengdong; YANG Guanzhong; TANG Jinpeng; JIANG Peihang
    Computer Engineering. 2006, 32(24): 72-74. https://doi.org/10.3969/j.issn.1000-3428.2006.24.026
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To improve performance of resource share and scope clear-cut in test and evaluation system in e-learning environment, a model of test and evaluation system is put forward based on objects and ontology. In this model, a test objects base is built based on ontology, and then the test request of user is segmented, ontology extracted and test objects found, and an individual test is provided based on user’s private information. In the model, the effect of share, reuse of resource and scope clear-cut of the test and evaluation and flxibile selection of question are good.
  • SHAO Weifeng; YANG Yang
    Computer Engineering. 2006, 32(24): 75-77. https://doi.org/10.3969/j.issn.1000-3428.2006.24.027
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The management of multipleversions of XML documents represents an key problem for many traditional applications, such as software configuration control and computer supported cooperative work(CSCW). this paper presents a novel approach to achieve storage and query of multiversion XML documents by a scheme based on Sparse Preorder and Range and timestamps for the elements of XML documents.
  • ZHANG Zhiming; HUANG Longjun; YU Min; HUANG Minghe
    Computer Engineering. 2006, 32(24): 78-80. https://doi.org/10.3969/j.issn.1000-3428.2006.24.028
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The paper proposes a dynamic algorithm of frequent itemsets mining based on undirected itemsets graph. The algorithm can get the new frequent itemsets through search the undirected itemsets graph once again, when the database and the minimum support are changed. Compare with the previous algorithm of frequent itemsets mining, the efficiency is distinctly improved in discovers frequent itemsets.
  • ZOU Yueliang; SHEN Yunfu
    Computer Engineering. 2006, 32(24): 81-83. https://doi.org/10.3969/j.issn.1000-3428.2006.24.029
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    As the numerical simulations in the continuous casting mould is characterized as high cost of calculation, time-consuming and the traditional serial algorithm is hard to meet the demand of the modern industry, MPI-based parallel algorithm is studied in this paper. The parallel algorithm of continuous casting simulation based on data-division and function-partition is given for SIMPLER algorithm. Through the result of the experiment on the Ziqiang 3000 high performance cluster computation environment, it is proved that the parallel algorithm has good parallel performance.
  • Networks and Communications
  • LIU Ming; DOU Wenhua; ZHANG Heying
    Computer Engineering. 2006, 32(24): 84-86. https://doi.org/10.3969/j.issn.1000-3428.2006.24.030
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Much recent work has focused on improving AQM performance through alternate approaches. There are no universally acceptable solutions in this area. This paper reviews the current AQM schemes and provides some open issues including the model, link characteristics, stability of the closed-loop system and wireless networks.
  • YANG Yulu; HE Kai; YU Yang; YANG Xuegang
    Computer Engineering. 2006, 32(24): 87-89. https://doi.org/10.3969/j.issn.1000-3428.2006.24.031
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A self-coordination grid computation model without resource management is proposed. The architecture, information management and recursive resource schedule algorithm of this model are presented. In this model, there hasn’t any managing node, and all the nodes have the same function, it uses the algorithm of evolutional eager scheduling to solve the dynamic of environment. Furthermore the preliminary performance evaluations are made, the simulation results show that this model can harvest the idle time of Internet connected computers to run very large distributed applications.
  • CHEN Jun; LIU Anfeng
    Computer Engineering. 2006, 32(24): 90-92. https://doi.org/10.3969/j.issn.1000-3428.2006.24.032
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The usability of Web service is often influenced since nodes have generated and disappeared dynamically in the oriented service next generation network. How to organize effective Web service of WAN to form useful candidate set of service, duplicate and backup service effectively to improve the usability of service when the usability is not high, are the important problems to be solved by oriented service network. The paper proposes a high usability service model—HighServer, which can be expanded and dynamic self-adaptive. This model is gathered into a lot of service set according to the relation of Web service, and organizes every service set by Spanning Tree, then confirms the quantity of backup service for each service set according to the usability demanded of application. The theory analyses verify the validity of the model, and an instance of this algorithm is stated at the end of paper.
  • SUN Hongbing; CHEN Mo; CAI Yibing; LI Zhongcheng
    Computer Engineering. 2006, 32(24): 93-95. https://doi.org/10.3969/j.issn.1000-3428.2006.24.033
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper discusses and defines a number of tests that may be used to describe the performance characteristics of an IPv4/IPv6 transition gateway. A commix network setup is proposed for TCP concurrent connections test. This paper proposes test method which can used in different conditions.
  • HU Jianli; WANG Jiazhen; YANG Sumin
    Computer Engineering. 2006, 32(24): 96-97. https://doi.org/10.3969/j.issn.1000-3428.2006.24.034
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The traditional routing algorithms can meet general requirements in low traffic environments, but in the complex network environments, the algorithms usually show the features of great fluctuation in traffic, and unstability. Based on analyses of shortcomings of traditional routing algorithms, a mobile agent based routing algorithm is purposed. Simulation experiments show this algorithm is good and robust in functionality and performance.
  • SONG Naibin; GAO Suixiang
    Computer Engineering. 2006, 32(24): 98-100. https://doi.org/10.3969/j.issn.1000-3428.2006.24.035
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Multiple constrained QoS routing optimization is an important problem in the current communication network research. Despite the broad application of Genetic Algorithm(GA) in multicast routing problem, it still has the paradox between the convergence speed and the global astringency. Aa improved GA is referred. It uses the preprocessing mechanism, the tree structure coding, the reasonable crossover technique and mutation process. It can simplify the coding and recoding process and increase the convergence speed based on the global astringency. Simulation results show that the proposed algorithm performs better than other algorithms when it be used to solve the multicast routing problem.
  • ZHOU Yixin; LV Weifeng; ZHU Tongyu
    Computer Engineering. 2006, 32(24): 101-103. https://doi.org/10.3969/j.issn.1000-3428.2006.24.036
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper takes some analysis on inter-vehicle oriented mobile ad hoc network communication in metropolitan area, making the routing research into real world. It documents vehicle motion behavior and concludes rule of vehicle movement. Basd on this motion rule, it proposes an improved ad hoc routing protocol and a network architecture adapted to the protocol. At the end , it valuates performance of the improved network, utilizing real-world vehicle movement data.
  • XIONG Yan; LV Tianxing; MIAO Fuyou; WANG Xingfu
    Computer Engineering. 2006, 32(24): 104-106. https://doi.org/10.3969/j.issn.1000-3428.2006.24.037
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    In the two-tiered wireless sensor networks(WSN), how to design a more efficient distributed cluster head election algorithm is a crucial problem. In all algorithms proposed before, some depend on random greatly, and others only take homogeneous into account. On the basis of them, this paper proposes a new practical approach, in which the old cluster head, as to the power information, chooses the two nodes which supply the cluster with the maximum lifetime if they are elected as the new cluster head and the new one’s assistant. The simulation performance results demonstrate the efficiency of the method compared with the random choosing algorithm in much longer network lifetime.

  • ZHANG Zhengqiu; WENG Zumao; YU Min
    Computer Engineering. 2006, 32(24): 107-109. https://doi.org/10.3969/j.issn.1000-3428.2006.24.038
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In the mobile agent system environment, the problem of how to distribute effectively and rationally resource and to improve the utilization of the resources is a new key technology to solve. By analyzing current researches of applying microeconomic theory to resource management and allocation field, the paper designs a model of mobile agent resource management and allocation based on market mechanism. The model can allocate optimally resource according to general equilibrium and market mechanism and provide the double QoS guarantee for resources.
  • ZHAO Ni; YAN Xiaojun
    Computer Engineering. 2006, 32(24): 110-111. https://doi.org/10.3969/j.issn.1000-3428.2006.24.039
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    It is a focal point of the work in application study on VVA technology to evaluate the accuracy class and confidence level of communication network’s simulation software by integrating the simulated test and actual test. This thesis puts forward a workable method for validity verification of communication network’s simulation software on the basis of mathematical procedure of evaluation and characteristics of simulation of communication network.
  • HUANG Xiaotao; YE Huaiguang
    Computer Engineering. 2006, 32(24): 112-114. https://doi.org/10.3969/j.issn.1000-3428.2006.24.040
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In grid, which is a distributed and heterogeneous environment, a fundamental problem is to locate required resource. In secure grid naming protocol, it has unique naming space, which can identify grid resource. This article tries to use DHT, which is a common route algorithm in peer-to-peer, as a new naming resolution way for secure grid naming protocol. The result is the features of DHT, including scalability, decentralization, availability, load balance, could be used in grid.
  • YOU Lantao; ZHU Qiaoming; LI Peifeng
    Computer Engineering. 2006, 32(24): 115-117. https://doi.org/10.3969/j.issn.1000-3428.2006.24.041
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The article puts forward a fast discovery algorithm for network topology based on OSPF to aim at the existing problems in the network topology discovery system. Then it discusses the algorithm of adding, modifying topology information and drawing topology map, and analyses the performance and characteristic of this algorithm. It also discusses the technology of fast displaying topology information with graph and the key techniques to implement the display system. The experimental result shows that the new system has the features of fast discovering the topology and good displaying effects compared with the similar system in the WAN environment.
  • DENG Shuguang; HU Saichun; YANG Bing
    Computer Engineering. 2006, 32(24): 118-120. https://doi.org/10.3969/j.issn.1000-3428.2006.24.042
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A unidirectional QoS routing protocol based on energy conserving is proposed on the ground that each node in ad hoc network possesses some problems, such as energy conserving, hidden terminal, QoS requirements, and so on. In order to maximize the network lifetime, this protocol takes full advantage of unidirectional links, adopts QoS policy, and selects the optimal flow paths by assigning traffic between more proportion to routes’ energy reserves and shorter routes. Simulation results show that this protocol is superior network performance than other protocols, and efficient supports information transmitting with QoS requirements in ad hoc network with unidirectional link.
  • CHEN Li; LI Xiaoping; WANG Qian
    Computer Engineering. 2006, 32(24): 121-123. https://doi.org/10.3969/j.issn.1000-3428.2006.24.043
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In the process of discovery and selection of grid service, it is a key issue that how to select grid services according to varied clients’ demand and dynamic changes of grid QoS. A grid service selection algorithm based on varied QoS priorities is proposed. The grid service with higher ratio of performance to price could be obtained according to the computation.
  • Security Technology
  • LI Chunyan
    Computer Engineering. 2006, 32(24): 124-125. https://doi.org/10.3969/j.issn.1000-3428.2006.24.044
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Trusted computing platform(TCP)found on the TCG(trusted computing group) criterion is the base of trusted computing technique. This paper introduces the development of the TCP, and analyses the key technology and main characteristics of the TCP. At last, an instance is given to show the application of TCP.
  • HAN Xu; LIU Kejun; ZU Xianfeng
    Computer Engineering. 2006, 32(24): 126-128. https://doi.org/10.3969/j.issn.1000-3428.2006.24.045
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper introduces a three-factor authentication project for the thin client/server system, which adds a device authentication factor on the traditional double-factor authentication. The realization method of the authentication protocol is also given, followed by a rough valuation on its practicability and security. Practical applications prove this authentication project is feasible.
  • WU Zhenfei; CHEN Kefei
    Computer Engineering. 2006, 32(24): 129-131. https://doi.org/10.3969/j.issn.1000-3428.2006.24.046
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Trusted computing platform develops rapidly in these years, but research on policy control system under trusted computing platform is not enough. To supply the gap, this paper represents a brand new policy control solution for trusted computing which uses XrML technology. The system is fit for the requirement of trusted computing platform and it also affords more ability of control, configuration and extension. How to applie the system on Microsoft NGSCB platform is represent.
  • QIAN Jinghui
    Computer Engineering. 2006, 32(24): 132-134. https://doi.org/10.3969/j.issn.1000-3428.2006.24.047
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Traditional cryptographic technologies can protect digital information by encrypting the file or the whole disk volume. The encrypted cipher text itself is the evidence of existence of the valuable data, which could prompt a motivated attacker to circumvent the protection. Cryptography also provides little protection against instruments that force the owner of the data to unlock it. This paper presents steg B+-tree which uses steganographic technologies to overcome weakness by hiding the existence of the data so that an adversary gets no information about whether the protected data ever exists without correct object name and access key.
  • YANG Bin; ZHANG Yuqing; SONG Wenjing; HU Yupu
    Computer Engineering. 2006, 32(24): 135-137. https://doi.org/10.3969/j.issn.1000-3428.2006.24.048
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Instant messengers facilitate communications in accompany with some secure questions that should not be neglected. This paper gives an analysis to the communication mode and protocol of instant messenger. It develops an instant messenger text message monitor based on NDIS intermediate driver, which realizes effective monitoring and guarantees the system safety.
  • DONG Bin; LIN Xiaozhu; XU Feng;
    Computer Engineering. 2006, 32(24): 138-140. https://doi.org/10.3969/j.issn.1000-3428.2006.24.049
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyzes a digital watermark in wavelet domain and improves it with the human visual model. The watermark is a meaningful binary image. It selects the wavelet coefficients based on HVS, and then the coefficients is modified to embed the watermark. It is improved that the processed image has better transparency, robustness to JPEG compression, additive noise and filter etc.
  • GAO Liyuan; NI Yousheng
    Computer Engineering. 2006, 32(24): 141-143. https://doi.org/10.3969/j.issn.1000-3428.2006.24.050
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This article introduces the main concept of private information retrieval, trusted computation and the concept of PIR based on TC. It also gives some existing model of PIR based on TC and performance, and finally creates a new model in order to further improve SC’s complexity of creating a shuffled database from O(N3/2) to O(cN), where c is a constant greater than 1.
  • WU Hao; JIANG Xiangtao; WANG Yong; LIU Gangchang
    Computer Engineering. 2006, 32(24): 144-145. https://doi.org/10.3969/j.issn.1000-3428.2006.24.051
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    In view of existing stealth-scanning detection technology insufficiency, providing a new model based on characteristic of network’s traffic for detecting stealth-scan, it adopts a different way from most existing detection techniques. It not only checks packet individually, but also combines the way based on conversation, and removes various kinds of “noise” activity of scanning that interference detection to go. Primary experiment indicates that this detection model has higher rate of accuracy and lower rate of false negatives to various stealth-scan.

  • YANG Xuanyuan; LIU Yan; LU Jiande
    Computer Engineering. 2006, 32(24): 146-148. https://doi.org/10.3969/j.issn.1000-3428.2006.24.052
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper brings forward an improved path construction algorithm under the hybrid model that uses the hierarchical construction in the same trust domain and the mesh construction between different trust domains. It analyzes the trust model of the prototype, and gives out the FIFO breadth-first algorithm based on the weighted trust list, advances further design thoughts.
  • LIU Hongwei; ZHU Guangzhi
    Computer Engineering. 2006, 32(24): 149-151. https://doi.org/10.3969/j.issn.1000-3428.2006.24.053
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    An important component of trusted computation is attestation. This paper analyzes two authentication protocols——the trusted third party modle and the direct anonymous attestation, which are adopted by the trusted computation group on the trusted computing platform and whose advantage and disadvantage are pointed out. It gives the key point when implementing the direct anonymous attestation. Its application on secure log-on to intranet and an extend to DAA are designed for better privacy.
  • DING Bao; BAO Wansu; WANG Xiang
    Computer Engineering. 2006, 32(24): 152-154. https://doi.org/10.3969/j.issn.1000-3428.2006.24.054
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper combines the SST algorithm with SEA algorithm, and substitutes λ-modular polynomial for modular polynomial in the SST algorithm. It proposes an algorithm to generate Legendre form elliptic curves based on lift. The algorithm not only improves the speed of generation of the elliptic curve, but also enhances the efficiency of the curve selection.

  • JIANG Wei; GAO Zhixin; LI Benxi
    Computer Engineering. 2006, 32(24): 155-156. https://doi.org/10.3969/j.issn.1000-3428.2006.24.055
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    The mechanism for multi-dimensional cloud model is studied. The formal representation of a clouds model for transform action between qualitative and quantitative knowledge is presented. This kind of representation reflects fuzziness and randomness contained in linguistic concepts, and can interpret uncertain reasoning process rationally when several qualitative rules are activated simultaneously. Using the data sets of KDD99, the experiment result shows that this approach can detect unknown intrusions efficiently in the real network connections.

  • Artificial Intelligence and Recognition Technology
  • DING Weidong; YUAN Jingqi
    Computer Engineering. 2006, 32(24): 157-158. https://doi.org/10.3969/j.issn.1000-3428.2006.24.056
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    As a precondition of the computer aided design(CAD), the engineering drawing vectorization has high research value and broad applications. This paper discusses the engineering drawing vectorization methods. Based on the study and analysis of the existing problems in vectorization, the future research direction is introduced. There are certain practical signification for avoiding, reducing vectorization errors and improving the vectorization quality of the complicated engineering drawings.

  • ZHANG Xiaoyan; ZHAO Rongchun; NIE Xuan
    Computer Engineering. 2006, 32(24): 159-161. https://doi.org/10.3969/j.issn.1000-3428.2006.24.057
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    An automatic video object segmentation algorithm based on wavelet transform and moving edge detection is proposed. Firstly, the new method makes the two-dimensional wavelet transform for two successive frames. Then change detection method and Canny edge detection are applied in wavelet domain. After merging the different edge masks with the union operation, the robust difference edge map of the inter-frame difference image can be obtained. Combining with the current frame edge map, background edge map and previous frame’s moving edge, the current frame’s moving edge can be calculated to extract video object. The algorithm is robust to the entire motion and local deformation of object. The experiment results show that the proposed algorithm is fast, simple and accurate.

  • ZHAO Peng; CAI Qingsheng; GENG Huantong; YUN Kun
    Computer Engineering. 2006, 32(24): 162-163. https://doi.org/10.3969/j.issn.1000-3428.2006.24.058
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Traditional CBR system is planar architecture. With the system’s running and learning, case base will become larger and larger. When the numbers of cases surpass some boundary, there will be swarming problem. To settle this problem, this paper presents a CBR system based on quotient space model, which is hierarchical architecture. It combines active learning with lazy learning in system running phase. Experimental results show that based on this method, the system performance is greatly increased.
  • LV Zhimin; YANG Juan; XU Jinwu
    Computer Engineering. 2006, 32(24): 164-166. https://doi.org/10.3969/j.issn.1000-3428.2006.24.059
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The object and characteristic of m-team orienteering problem (m–TOP), and a new solution framework based on ant colony algorithm for m–TOP are introduced. In the solution framework, different ants in one sub-colony exchange the information of visited control points by tabu table, and cooperate with in optimizing visit route; the visited route of ant in different sub-ant colony is controlled by pheromone. The simulation results proved the model and solution framework are effective.
  • TANG Weining; XU Fuyuan
    Computer Engineering. 2006, 32(24): 167-169. https://doi.org/10.3969/j.issn.1000-3428.2006.24.060
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The paper discusses knowledge integration method of supply chain management system by use of ontology、semantic Web、Web services and multi-agent. The framework of supply chain knowledge integration is presented. Intelligent service mechanism based on semantic Web services and collaboration based on metontology and share ontology are discussed.
  • LIU Qun; LIANG Bing
    Computer Engineering. 2006, 32(24): 170-171. https://doi.org/10.3969/j.issn.1000-3428.2006.24.061
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper suggests a method of temporal finite automata modeling for data association problem. A lot of data association algorithm is proposed, but there is no data association model for the performance evaluation. In order to support temporal observation for data association, timed sequence is introduced to finite automata, and temporal finite automata is defined to model data association problem. This method is applied to validate the veracity of multi-target track.
  • ZHANG Boquan; YANG Yimin
    Computer Engineering. 2006, 32(24): 172-174. https://doi.org/10.3969/j.issn.1000-3428.2006.24.062
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyses the general structure of robot soccer decision subsystem, and makes the production reasoning model and the expressional model of decision-making. Thus it constructs decision-making program’s structure for this robot soccer system. A new structural variable type for decision storage is also defined. Eight menus are created, through which decision programming is visualized.
  • MA Li; CHANG Faliang; QIAO Yizheng; LIU Zengxiao
    Computer Engineering. 2006, 32(24): 175-177. https://doi.org/10.3969/j.issn.1000-3428.2006.24.063
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    An improved mean shift algorithm is proposed based on color feature. The target point which accords with the color template has the largest weight regardless of its probability in the histogram, making the target density peak and overcoming the serious clutter and occlusion. Effective occlusion detection method based on sub-block is put forward and the color template isn’t updated to resume the accurate tracking after occlusion. Experimental results indicate it is robust and has good performances under complex background.
  • ZHU Ling; SHI Xinling; LIU Yajie; TIAN Xi
    Computer Engineering. 2006, 32(24): 178-179. https://doi.org/10.3969/j.issn.1000-3428.2006.24.064
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The thyroid nodule in the ultrasound images is usually blur and difficult to discern and analyze. A new algorithm which is based on the ant colony algorithm (ACA) for extracting the edges of thyroid nodule in ultrasound images is presented. Taking the characters of ultrasound images into account, the method of setting up the pheromone and the food-source is developed and the algorithm is elaborated. Compared with other image segmentation algorithms, such as the Canny operator and the Sobel operator, ACA can achieve better segmentation results.
  • LUO Xuefang; XUE Huifeng; JIANG Wei; WU Xiaojun
    Computer Engineering. 2006, 32(24): 180-182. https://doi.org/10.3969/j.issn.1000-3428.2006.24.065
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Recursive transform on constrained set and order reduce with preceding matrix are used to deal with multi-constrained conditions in activities schedule of software process. A method based on genetic algorithm, of which the individuals’ structure is matrix, for activities schedule and resource assignment is proposed. Relative sequential crossover operator and mutation operation of two layers are adopted. The results show the method is effective to cut costs and compress duration of software process.
  • XU Zhengguang; YAN Hengchuan; ZHANG Lixin
    Computer Engineering. 2006, 32(24): 183-185. https://doi.org/10.3969/j.issn.1000-3428.2006.24.066
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This article gives analysis on independent component analysis (ICA) based on the recognition of facial expression. It trys to find the influence of single IC to the recognition rate of facial expression. Then the article concludes the way of how to select independent subspace efficiently.

  • XU Zhengguang; BAO Donglai; ZHANG Lixin
    Computer Engineering. 2006, 32(24): 186-188. https://doi.org/10.3969/j.issn.1000-3428.2006.24.067
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    On the foundation of studying former connecting area algorithms, the paper presents a pixel labeled algorithm based on recursive method of connecting area in binary images. The algorithm determines the distribution and count of connecting areas through once scanning of image. It mainly includes two steps in the algorithm. Firstly, scanning the input binary image is used to get the whole connecting labeled area and the equal marks list. The second step is to analyze the equal marks list by recursive method to ascertain the right distribution and count of connecting areas. Experiments show that it can exactly detect any connecting areas in binary images, which contains complicated shapes and random number (less than 1 000).

  • LI Yang; YUE Xiaobo
    Computer Engineering. 2006, 32(24): 189-191. https://doi.org/10.3969/j.issn.1000-3428.2006.24.068
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    It is significant and being unsolved yet for building a fuzzy Petri net to determine all parameters of fuzzy production rules. Genetic algorithm combined with BP algorithm is originally introduced into the procedure of exploring parameters of FPN. An exploring strategy based on double-stage optimization is proposed. Realization of this strategy don’t depend on experiential data and requirements for primary input are not critical. Simulated experiment shows that the trained parameters gained from above strategy are highly accurate and the resultant FPN model owns strong generalmzing capability and self-adjustmeion purpose.

  • WU Qingjiang; XU Wenfang; WANG Qingli
    Computer Engineering. 2006, 32(24): 192-194. https://doi.org/10.3969/j.issn.1000-3428.2006.24.069
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper proposes a novel and simple method of gait feature extraction. Body silhouette extraction is achieved by background subtraction. The body silhouette is projected along its midline to obtain the fore-and-aft midline projection vectors, which are then combined into one dimensional data vector as the gait feature. PCA is applied to reduce data dimension, and gait classification and recognition is performed by support vector machine. The result of the experiment demonstrates that the approach is effective and has encouraging recognition performance.

  • LIU Hongxia; TAN Lu; WU Yi
    Computer Engineering. 2006, 32(24): 195-197. https://doi.org/10.3969/j.issn.1000-3428.2006.24.070
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A new method on the region-of-interest image is presented, the image is parted. By the greatest expression of the partition, the relations of the different partitions are gained. At last, according to the MDS, the low-dimension is achieved. Through analyzing the low-dimension data, the precision location of the region-of-interest can be denoted. The examples validate the feasibility and validity.
  • YUAN Hong; SHUI Penglang
    Computer Engineering. 2006, 32(24): 198-200. https://doi.org/10.3969/j.issn.1000-3428.2006.24.071
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In this paper, a new way to image size zooming is proposed. The algorithm to design two dimensional nonseparable linear phase finite-impulse response (FIR) interpolation filter is given. Comparing with the nearest neighbor interpolator, the bilinear interpolator, the bicubic interpolator and the cubic B-spline interpolator methods, this interpolator algorithm is better according to the experimental effects and theoretical analysis.
  • WANG Song; WANG Weihong; QIN Xujia
    Computer Engineering. 2006, 32(24): 201-203. https://doi.org/10.3969/j.issn.1000-3428.2006.24.072
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Several content-based image clas¬sification techniques based on fusing various low-level MPEG-7 visual descriptors are proposed in this paper. The goal is to fuse several descriptors in order to improve the performance of several machine-learning classifiers. Three approaches are described: A “merging” fusion combined with an SVM classifier, a back-propagation fusion combined with a K-Nearest Neighbor classifier and a Fuzzy-ART neurofuzzy network. In the latter case, fuzzy rules can be extracted in an effort to bridge the “semantic gap” between the low-level descriptors and the high-level semantics of an image. Experimental results on the beach/urban scenes classification problem show the best.
  • WANG Xilei; WANG Lei
    Computer Engineering. 2006, 32(24): 204-205. https://doi.org/10.3969/j.issn.1000-3428.2006.24.073
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper extracts the features of Chinese characters, letters, numbers and short across line based on Rough sets. Result by template matching can be obtained. The time complexity of feature selection algorithm based on Rough sets is O(mn2). Before, people think that the time complexity of feature selection algorithm based on Rough sets can not be under O(m2n2) in which m is the number of features, n is the number of samples in datasets. Finally, the experiment and results in license plate recognition are presented.
  • ZHONG Minjuan; LING Chuanfan; BAI Yaohui; GUO Pan
    Computer Engineering. 2006, 32(24): 206-208. https://doi.org/10.3969/j.issn.1000-3428.2006.24.074
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    CDSE, a model for domain-based intelligent search engine is proposed. The model can help people to retrieval what they need by combining text classification with key phrase extraction. Several algorithms that use key technology are proposed, such as statistics, data mining and agent. These algorithms solve the shortcomings effectively of low precision and relevant document ranking behind in now search engine.
  • CHEN Rongyuan; JIANG Jiafu; JIANG Weixiang
    Computer Engineering. 2006, 32(24): 209-210. https://doi.org/10.3969/j.issn.1000-3428.2006.24.075
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The paper presents a method of pose-varied face recognition based on neural network and hierarchical support vector machines. At the stage of training, it transforms the feature vector of pose-varied image to the feature vector of standard image using neural network, then clusters the standard image feature vector, and trains the hierarchical support vector machines using the result of clustering. At the stage of the recognition, it transforms the feature vector of pose-varied image to the feature vector of standard image using the neural network, estimates which person the image mostly belongs to using hierarchical support vector machines, and confirms estimation using negative algorithm. The experiment shows that the effect is better.
  • Multimedia Technology and Application
  • XU Yan; LI Guiling; LIU Yu; GUO Ying
    Computer Engineering. 2006, 32(24): 211-212. https://doi.org/10.3969/j.issn.1000-3428.2006.24.076
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This article studies the compressed domain motion compensation technology in video transcoding, complements and perfects existing algorithm, solves the problem in existing algorithm: can’t handle negative motion vectors, and gives out detailed algorithms and some necessary analysis from the realization point of view. The result of the experiment shows that MPEG-2 TM5 decoder reconstructed based on the algorithms and analysis this article gives out can realize compressed domain motion compensation and spatial definition downscaling correctly.
  • LIU Nan; FU Xianping; ZHANG Weishi
    Computer Engineering. 2006, 32(24): 213-215. https://doi.org/10.3969/j.issn.1000-3428.2006.24.077
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A new approach for the development of Video-on-Demand system based on .NET platform is introduced. Adopting Browser/Server and integrated three-tier structure, this system is implemented using the C# language. Media file’s category management and automatic client update are supported. Multi users can access the system subsequently. Large capacity video files upload technology, the method of embedded media player and video file management are discussed. The decode system auto update and distributed storage technology are also given. Besides stream media file, some others file’s types, such as PPT and Flash, are also usable in the system.
  • SHI Jian; HE Chenglin; DU Limin
    Computer Engineering. 2006, 32(24): 216-218. https://doi.org/10.3969/j.issn.1000-3428.2006.24.078
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper describes a method to acquire microphone array speech data using FPGA and based on USB2.0 device interface, and how to acquire synchronous real-time and high SNR speech data, and USB2.0 transfer control. The method has merit in that it is easy to use and has simple interface and good expansibility.
  • YAO Xiaoming; QIAN Qingquan
    Computer Engineering. 2006, 32(24): 219-220. https://doi.org/10.3969/j.issn.1000-3428.2006.24.079
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    By exploiting the temporal similarity between VOPs extracted from the video sequence, a novel video coding approach by equivalent reuse of the VOPs is proposed, not necessarily the same as the original ones though. It features on: (1) direct object-based manipulations; (2) Very low bit rate, but high reconstruction quality; (3) low computation complexity. Simulation results substantiate its effectiveness.
  • MA Yan; LI Cun; LI Xiaoyong; LIU Haitao
    Computer Engineering. 2006, 32(24): 221-222. https://doi.org/10.3969/j.issn.1000-3428.2006.24.080
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper designs a state machine system for the multimedia player based on ARM platform and takes a series of measures to optimize the system performance. It implements high performance calculation like soft-decoding on a restricted general-purpose processor and realizes an embedded system with high performance, low power and low cost.
  • MENG Jing;XU Gang
    Computer Engineering. 2006, 32(24): 223-225. https://doi.org/10.3969/j.issn.1000-3428.2006.24.081
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper explores the evaluation of speech enhancement algorithm performance. The approach it uses is to compute the distance measure of the original and degraded speech signal and then accomplishes the evaluation of speech quality according to the distance measure. It selects several speech enhancement algorithms and compares their performances through comparing the distance measure. In the end, it concludes an effective evaluation for speech enhancement.
  • LI Guodong; ZHANG Linlin; LIU Chang’an
    Computer Engineering. 2006, 32(24): 226-228. https://doi.org/10.3969/j.issn.1000-3428.2006.24.082
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    To the problem such as low efficiency, highly consumed that appears during video transmission in teleoperation system, this research uses sequence number, slide windows, retransmission, acknowledgement and congestion control technique which include RUDP protocol for the video transmission in teleoperation system. The research indicates that RUDP is more efficient on transmission than TCP or UDP.

  • ZHENG Qingshuai; ZHANG Luoping
    Computer Engineering. 2006, 32(24): 229-231. https://doi.org/10.3969/j.issn.1000-3428.2006.24.083
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Traditional methods on 3D-restruction are not fit to rotary slice, a feasible method based on B-spline interpolation is posed, aimed at 3D-restruction on rotary slice. It can not only solve the problems on 3D modeling but also remarkably improve the quality compared with using triangular faces while drawing the curve because of using the NURBS interface programming in OpenGL. In addition, the method is also suited to parallel slice.

  • Engineer Application Technology and Realization
  • CHEN Weinan; ZOU Bo; PENG Chenglian; WU Rongquan
    Computer Engineering. 2006, 32(24): 232-233. https://doi.org/10.3969/j.issn.1000-3428.2006.24.084
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The honeycomb-like rapid embedded system platform (HLRESP) is a kind of general-purpose platform based on field programming gate arrays (FPGA). It has a modularized and honeycomb-like structure. According to the feature of HLRESP, design for testability methods based on boundary scan technology are applied to the board level and system level design. The structure of boundary scan chain can be configured flexibly. Boundary scan test as well as in-system-programming(ISP) for programmable logic devices can be implemented. This gives facilities to test and debug the HLRESP, and development period of the system can be effectively shortened.
  • XU Yiping; ZHOU Manli
    Computer Engineering. 2006, 32(24): 234-236. https://doi.org/10.3969/j.issn.1000-3428.2006.24.085
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This Paper introduces the development of the intelligent building, analyzes the system integration levels and discusses the interconnection between information network and control network. Then the paper presents a Web-based integration model of system integration of intelligent building, and describes the key technologies.
  • QIAO Baojun; SHI Feng
    Computer Engineering. 2006, 32(24): 237-239. https://doi.org/10.3969/j.issn.1000-3428.2006.24.086
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    FPGA is more and more used in many kinds digital signal processing systems. A preprocessor for S-FGS based on FPGA is presented which can produce five description coding streams of video images. The preprocessor does not use very large RAM to store frame data, and can fully apply the parallel and pipeline of data operation. Experimental results show the design can meet the function and real-time requirement of S-FGS.
  • YU Weihong; JIA Chuanying
    Computer Engineering. 2006, 32(24): 240-242. https://doi.org/10.3969/j.issn.1000-3428.2006.24.087
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper gives the decision factor collector of selecting rescue ships, and analyses the advantage of using BP neural network to decide the weight of every factor, sets up BP neural network which solves the problem of deciding the weight of every factor in selecting rescue ships. As a result, it carries on decision simulation after training BP neural network with the samples, and the experimental result is compared with expert’s expected value.
  • CHEN Xiaowei; LIN Jiajun; ZHANG Jie
    Computer Engineering. 2006, 32(24): 243-244. https://doi.org/10.3969/j.issn.1000-3428.2006.24.088
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The quality of data source plays an important role in MMT system performance evaluation. The performance of MMT can not be evaluated exactly without taking data source quality into consideration. This paper presents a new metrics of data source to evaluate data source from target numbers, echo number and quality and density of echo.
  • XIE Jiang; JIANG Yangyi; LI Xuewen; CHEN Deng
    Computer Engineering. 2006, 32(24): 245-246. https://doi.org/10.3969/j.issn.1000-3428.2006.24.089
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The principle of combination prediction based on modified genetic algorithm is expatiated. The modeling method and the validity evaluation index of the combination prediction are given. Compared with other prediction methods using computer simulation, the combination prediction is more valid and accurate in the prediction of demand for military aero-engine.
  • PENG Youming ; XIAO Zifeng ; GUO Meng ; WANG Zhensong
    Computer Engineering. 2006, 32(24): 247-250. https://doi.org/10.3969/j.issn.1000-3428.2006.24.090
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents the scheme to implement the bridge between VMEBus and CPCI using Universe II from Tundra Company. It also introduces its characteristic, applications and working principle. Meantime it discusses how to port the bridge driver and deal with the problems in the debugging. The experiments show that the developed backplane with the CPCI-VME bridge is practical.
  • YANG Xiaowei; LIAO Guangdeng; HU Yueming
    Computer Engineering. 2006, 32(24): 251-253. https://doi.org/10.3969/j.issn.1000-3428.2006.24.091
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Now there are few efficient ways to tune the performance of virtual machine, excepts utilizing those general benchmark tools. This paper presents Exentrace, a low level Xen virtual machine performance tuning tools, with two keys features: Lasylog and Smartfilter. It is used to collect and parse data of virtual machines with different workloads. Looking into the data, it successfully resolves a critical performance issue.
  • HU Zeming; YUE Chunsheng; WANG Zhigang
    Computer Engineering. 2006, 32(24): 254-256. https://doi.org/10.3969/j.issn.1000-3428.2006.24.092
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Real-time response is the basic request of embedded navigation terminal. Considering embedded hardware studio, application functions and GIS data requirement, based on hierarchy spatial data model, this article puts up complementary grade spatial data model, causing low embedded GIS data redundancy and good real-time response.
  • LI Chunli; ZENG Zhiyuan; XU Xuejun
    Computer Engineering. 2006, 32(24): 257-259. https://doi.org/10.3969/j.issn.1000-3428.2006.24.093
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper introduces the feature of ArcGIS Engine. Application of ArcGIS Engine component in vehicle surveillance system is discussed. On the basis of analysis of vehicle surveillance system’s composition and work principle, using VB and integrating ArcGIS engine component, realizes function of map control, vehicle orientation, track replay, special data query and path programming. Then it achieves design of system, describes how to implement system.
  • CAO Licheng; YANG Yizhong; FAN Haiqiu; XIE Guangjun
    Computer Engineering. 2006, 32(24): 260-262. https://doi.org/10.3969/j.issn.1000-3428.2006.24.094
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A new algorithm for regular ICs’ placement problem is presented. It is resulted from the combination of the genetic algorithm and simulated annealing algorithm, the genetic algorithm is served as the main flow of the new algorithm for global search, simulated annealing algorithm adjusts the optimization population to avoid trapping in the local optimum. In the genetic algorithm, a new crossover operator involved Gauss probability to determine the crossover slot is described. The new algorithm has been run on a variety of test instances; the result is superior to that of simple GA.
  • Developmental Research
  • ZHOU Chuansheng; LIU Jie
    Computer Engineering. 2006, 32(24): 263-265. https://doi.org/10.3969/j.issn.1000-3428.2006.24.095
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In multi-agents ERP system, how to apply agent technologies to develop and deploy ERP system rapidly has become a new trend. By research of model technologies, agent technologies and ERP business logic, this paper introduces a model based design of ERP business agent to provide people a different solution for their ERP applications.
  • LI Minquan; WU Xianliang
    Computer Engineering. 2006, 32(24): 266-268. https://doi.org/10.3969/j.issn.1000-3428.2006.24.096
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Based on the technology of RFID and contactless IC card positioning and wireless local network, a design of an abstemious intelligent warehouse is given. The intelligent warehouse system program is realized using Visual C++ language. It is proved that this design is economical and useful. This paper is helpful to design a logistics system and build an intelligent warehouse.
  • LI Bo; WANG Juan; QIN Zheng; LI Aiguo
    Computer Engineering. 2006, 32(24): 269-271. https://doi.org/10.3969/j.issn.1000-3428.2006.24.097
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Multi-resolution image fusion is one focus of the image fusion technology and the implementation of image fusion application system has played an important role in the field of information fusion. The open image fusion simulation platform put forward in this paper can supplies people with a general platform on which people can select different image fusion algorithms and compare their fusion results, or integrate new methods into the platform. The platform employs a novel and general architecture for fusing multiresolution image and implements fifteen pixel-level image fusion algorithms. The fifteen methods are as follows: twelve typical methods including simple methods, methods based on the pyramid transform and methods based on the wavelet transform and three novel ones. In order to verify the function of the platform, an engineering application and a new fusion algorithm’s comparison and validation example are presented.
  • TANG Yingjun
    Computer Engineering. 2006, 32(24): 272-274. https://doi.org/10.3969/j.issn.1000-3428.2006.24.098
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    The paper analyzes the problems of image transmission in the HIFU tele-medicine system, and puts forward a method to cut a trapezoid area from the ultrasound image. It is based on C/S network model to implement no interval image transmission by Winsock programming that helps to control and judge the transmission status. The thesis employs multi-thread method to make good use of system resources, speed up communication velocity, reduce the coupling degree and meet the needs of image transmission in tele-medicine application.

  • YIN Tianming; LI Yebai; ZHANG Qiuhe; WANG Yuge
    Computer Engineering. 2006, 32(24): 275-276. https://doi.org/10.3969/j.issn.1000-3428.2006.24.099
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper discusses the construction of workflow design platform in E-government system. It can customize detailed workflows via graphics and implement dynamic workflow based on workflow engine. It monitors process of workflow and dynamically adopts it, so insuring customized workflow to execute effectively.

  • HAI Shen; LU Yang; YUAN Fei
    Computer Engineering. 2006, 32(24): 277-279. https://doi.org/10.3969/j.issn.1000-3428.2006.24.100
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    As embedded data acquisition system is evolved continuously, data is stored in storage in term of a usual file system´s format more and more. Aimed at the characteristics of embedded system itself and the problem with cache mechanism, it is very necessary for data storage system to adopt some kinds of recovery mechanism to settle system fault. This paper presents a kind of recovery mechanism based on specialities of embedded data acquisition system, and analyzes and realizes it.

  • SUN Chuanming; FU Yuzhuo; XU Ruhao
    Computer Engineering. 2006, 32(24): 280-282. https://doi.org/10.3969/j.issn.1000-3428.2006.24.101
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents a bit manipulation accelerator for high performance DSP. The accelerator is implemented with multiple levels of bit manipulator instead of MUX, it reduces the time complexity of the accelerator from O(N) to O( ). Synthesis results indicate that the 32-bit bit manipulation accelerator implemented with this method has great improvement in terms of delay.
  • WU Junmin; LI Huanghai; HUANG Liusheng; BAO Chunjian; WANG Wentao
    Computer Engineering. 2006, 32(24): 283-284. https://doi.org/10.3969/j.issn.1000-3428.2006.24.102
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This article designs and implements a high available application development platform, which provides a flexible programming environment. It not only includes a high available application development framework, but also includes the checkpoint service, distributed lock service, event service, message service and membership service which are indispensable for high available application. Based on this platform, developer can concentrate on the application’s business feature, not the high availability.