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

20 September 2007, Volume 33 Issue 18
    

  • Select all
    |
    Degree Paper
  • YANG Shu-qin; YANG Qing; WANG Yan-qing
    Computer Engineering. 2007, 33(18): 1-3,7. https://doi.org/10.3969/j.issn.1000-3428.2007.18.001
    Abstract ( )   Knowledge map   Save
    This paper systematically discusses a new modeling methodology in BPR——i* modeling system which is based on artificial intelligence (AI). The article analyzes meta-models of strategic dependency (SD) model and strategic rational (SR) of i*modeling system, and it also gives their formal models. The example and process of BPR adopting i* model has been analyzed as it can contribute to combine strategic intentions with business processes during enterprise modeling.
  • JIANG Jing-fei; NI Xiao-qiang; ZHANG Min-xuan
    Computer Engineering. 2007, 33(18): 4-7. https://doi.org/10.3969/j.issn.1000-3428.2007.18.002
    Abstract ( )   Knowledge map   Save
    This paper analyzes the point multiplication in EC and educes the modular multiplication formula in GF(2m) for systolic implementation with partial-parallelism in MSB mode. Following the formula, it designs an efficient architecture of systolic array, studies the performance of the array element and compares with the performance in LSB mode. The simulation result proves that the partial-parallel architecture in MSB mode which supports flexible irreducible polynomials of GF(2m) can process modular multiplication efficiently with proper hardware cost, while the partial-parallel architecture which supports fixed irreducible polynomials can save the hardware cost and archive high performance at the same time. Both can improve the performance of ECC algorithms in GF(2m) efficiently.

  • TONG Chao; GAO Xiao-peng; CHEN Wei; PENG Ling-yun; LONG Xiang
    Computer Engineering. 2007, 33(18): 8-12. https://doi.org/10.3969/j.issn.1000-3428.2007.18.003
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Mobile IP has problems such as lack of agents, triangle routing and limitation of the support of the operating system. Therefore, mobile IP has not been put into widespread use. This paper proposes a novel mobility support scheme based on embedded technology. The scheme realizes the mobile management with embedded mobile agent and address trail server, reduces the dependence on the network infrastructure and provides the transparent mobile service for mobile equipments. Simulation study shows that this mobility scheme costs little, has high efficiency and is easy to realize.
  • WU Wei; ZHOU Jian-zhong; YANG Jun-jie; MO Li
    Computer Engineering. 2007, 33(18): 12-14. https://doi.org/10.3969/j.issn.1000-3428.2007.18.004
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Electricity market price classification and forecast are important elements in the theoretical study. This paper proposes a hybrid numeric Bayesian with support vector machine(BE-SVM)method that integrates a Bayesian statistical method for electricity price classification with experience distribution approach in data information mining, and SVM technique for electricity forecasting. The Bayesian prior distribution and posterior distribution are used to evaluate the parameters in the SVM. Experimental results show that the proposed BE-SVM method has a higher forecast accuracy compared with three models BE-SVM, SVM and ANN.
  • YE Li; CHEN Jun-liang
    Computer Engineering. 2007, 33(18): 15-17. https://doi.org/10.3969/j.issn.1000-3428.2007.18.005
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The automatic composition approach is an application of deductive program synthesis method in semantic Web services. The semantic of a service is defined as , which stands for “input”, “output”, “precondition”, “effect”, and “IO-vinculum” of the service. A template is used to transform this semantic into a first-order-logic formula. Based on the “proofs are programs” theory, by using an automated theorem prover, the proof from available services to object service is searched, and the implementation of the object service is extracted from the recorded proof path. A brief introduction of the prototype system is given.
  • HUANG Bing-qiang; CAO Guang-yi; LI Jian-hua
    Computer Engineering. 2007, 33(18): 18-19,3. https://doi.org/10.3969/j.issn.1000-3428.2007.18.006
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Discounted reward reinforcement learning is the mainstream of reinforcement learning research and its short-term reward is more important than a long-term reward owing to the discount factor. However, sometimes the long-term reward is optimal and it is reasonable to use the average reward reinforcement learning method. This paper presents average reward reinforcement learning including R-learning and H-learning. The application is proposed.
  • LIN Huai-qing; ; LI Zhi-tang; HUANG Qing-feng
    Computer Engineering. 2007, 33(18): 20-21,2. https://doi.org/10.3969/j.issn.1000-3428.2007.18.007
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Managing trust relationships are important part of trust model. An important challenge in managing such trust relationships is to design a protocol to secure the placement and access of these trust ratings. In this protocol, a verifiable threshold cryptosystem without a trusted center is applied to generate system public/private keys. K managers can generate certification for peer. The protocol provides an anonymous server for peer. The security analysis shows that the protocol has desirable features of anonymity, reliability, accountability and is secure in the presence of a variety of possible attacks.
  • ZUO Min; LI Jian-hua
    Computer Engineering. 2007, 33(18): 22-25. https://doi.org/10.3969/j.issn.1000-3428.2007.18.008
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyses the problem of file pollution on P2P file sharing networks, presents various kinds of pollution techniques, and puts forward possible counter-measures to them. In particular, a novel cooperative “warning-delete” approach is proposed to alleviate the most serious version pollution. The effectiveness of this approach is proved by simulation experiments.
  • HE Yang-fan; HE Ke-qing
    Computer Engineering. 2007, 33(18): 26-27,3. https://doi.org/10.3969/j.issn.1000-3428.2007.18.009
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Accurate description about the relationship between ontologies is critical for reliable semantic interoperation between ontology based information systems. This paper proposes an ontology evolution management framework MFI-3, which consists of kernel model, change model, constrain model, evolution information model and change propagation model. This framework provides reference models for the semantic interoperation related tasks. And reliable ontology mapping with the information specified in MFI-3 can be obtained.

  • LI Qian-mu; XU Man-wu; ZHANG Hong; LIU Feng-yu
    Computer Engineering. 2007, 33(18): 28-30. https://doi.org/10.3969/j.issn.1000-3428.2007.18.010
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Mobile switch center is an important part of the mobile communication system, exchanging diversified control signal with other entities in real-time. This paper presents an autonomous-object based mobile switch center model method (AOMSCM), based on the real-time communication software modeling method and design pattern technology, changing the foreground process to object. A formal definition is given for the autonomous object, which is abstracted from net-service object. It accumulates practical experience for using services-oriented method in the future.
  • LIU Sheng-peng; FANG Yong
    Computer Engineering. 2007, 33(18): 31-33. https://doi.org/10.3969/j.issn.1000-3428.2007.18.011
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a Contourlet domain image denoising method based on Bayesian estimation. By using Contourlet transform, the noised image is firstly decomposed into a low frequency subband and a set of multisacle and multidirectional high frequency subbands. The high frequency coefficients of the original image are estimated by the minimizing Bayesian risk. The denoising image is gotten by performing the inverse Contourlet transform to these estimated coefficients. Experimental results show that the denoising effect is better than that of other methods based on Contourlet transform.

  • ZHENG Yong-an; SONG Jian-she; ZHOU Wen-ming; ZHANG Jie
    Computer Engineering. 2007, 33(18): 34-36,5. https://doi.org/10.3969/j.issn.1000-3428.2007.18.012
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The fusion of multiband SAR(synthetic aperture radar) images is an important application of SAR system. This paper presents a new fusion algorithm in the Contourlet transform domain. Compared with the wavelet transform, the Contourlet transform not only can capture the multiresolution and local information of an image, but also obtain its directional information in a flexible way by using different number of directions at different scales. The multiband SAR images are decomposed into different low-frequency coefficients and directional high-frequency coefficients. An edge information measurement is designed to select the fused directional high-frequency coefficients and weighted averaging method is employed for obtaining the fused low-frequency coefficients. Experiments show that the proposed algorithm works better in preserving the edge and texture information than the wavelet transform method do in image fusion.
  • GAO Xin; JIA Qing-xuan; SUN Han-xu; SONG Jing-zhou
    Computer Engineering. 2007, 33(18): 37-39. https://doi.org/10.3969/j.issn.1000-3428.2007.18.013
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper uses edge collapse method with discrete curvature error metric to construct multi-resolution models, simplified models are provided to view-dependent simplification method to deal with, and implement it with a conventional distributed parallel rendering system; While this paper uses the algorithm called geometry tracking that avoids the redundant geometry transmission by indexing geometry data, alleviating network bandwidth bottleneck.
  • Software Technology and Database
  • ZHOU Hong-fang; FENG Bo-qin
    Computer Engineering. 2007, 33(18): 40-41,4. https://doi.org/10.3969/j.issn.1000-3428.2007.18.014
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To interpret the procedure of hypertext induced topic search based on a semantic relation model, the reason about the topic drift of HITS is found that Web pages are projected to a wrong latent semantic basis. A new fuzzy set based algorithm for topic distillation and hierarchical exploration (FSTH) is presented to improve the quality of topic distillation. Personalized root set and base set with query expansion is constructed using individual query logs to avoid the topic drift, and applying a hierarchical division algorithm based on fuzzy set to explore relative topics of user query, and then using HITS to evaluate and return authority pages of relative topics to end-users. The experimental results on 10 queries show that FSTH reduces topic drift rate by 7% to 53% compared to that of HITS, and discovers several relative topics to queries that have multiple meanings.
  • LIU Gui; ZHU Hong-yu; XIE Xiang-hui; HE Hong-qi; WEI Hai-liang; CHEN Lin; LU Lin-sheng
    Computer Engineering. 2007, 33(18): 42-44. https://doi.org/10.3969/j.issn.1000-3428.2007.18.015
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    The implementation schema of access agent middleware in data grid environment is proposed, which provides the support of universal data access interface through implementing the conversion operation for real data sources in the access agent layer. In a sense, it implements the data transparence. Two kinds of access agent of structured and non-structured oriented data are described. One supports the plugin of Oracle database, while the other provides the access operation through self-defined big file, which implements the plugin of self-defined data resource.

  • LUO Hong-bing; ZHANG Yu; ZHANG Xiao-xia
    Computer Engineering. 2007, 33(18): 45-47. https://doi.org/10.3969/j.issn.1000-3428.2007.18.016
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper introduces a scalable parallel job simulator named ParaSim. ParaSim makes use of the event-driven executing model and adopts matrix to represent computation resources, so it can support both space-sharing and time-sharing scheduling strategies in the same framework. It also provides many policies and scheduling parameters like real system. At present, ParaSim has been implemented and used in scheduling strategy research. The experiment based on ParaSim shows that it can benefit from ParaSim on research and selection of scheduling strategies in real job system.
  • JIA Xiao-xia; WU Ji; LI Guo-huan; JIN Mao-zhong
    Computer Engineering. 2007, 33(18): 48-50. https://doi.org/10.3969/j.issn.1000-3428.2007.18.017
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    How to describe and visualize the program behavior is an important measure to comprehend the program. This paper presents a novel object behavior model named lifetime behavior model based on the method invocation and invocated sequence of object, and visualizes the model in LBMTree. The model and visualization is displayed through a demo program, which demonstrates that the LBM is helpful to understand the differences between the different objects.
  • PENG Yu-wei; PENG Zhi-yong
    Computer Engineering. 2007, 33(18): 51-52,5. https://doi.org/10.3969/j.issn.1000-3428.2007.18.018
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Spatial data fusion technique is an important part of GIS integration. In research area of multi-representation or multi-resolution spatial databases, spatial data fusion technique is important. Some techniques are proposed. But most of them stay on theoretical and experimental stages. There is no practical technique now. This paper introduces several spatial data fusion techniques and compares them. The results show the technique is effective. Spatial data fusion technique development in the future is described.
  • TIAN Tian; NI Lin
    Computer Engineering. 2007, 33(18): 53-55. https://doi.org/10.3969/j.issn.1000-3428.2007.18.019
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    There is equitable distribution thinking in authorities of other pages linked to PageRank. As pages are different, the method has some limitation. This paper takes advantage of Web link structure, proposes an unequal way to treat the different pages when distributing authorities and call it improved PageRank. Experimental results show that IPR improves relation degree by about 90%, comparing to PageRank.
  • MA Ting-huai; ZHAO Ya-wei
    Computer Engineering. 2007, 33(18): 56-58. https://doi.org/10.3969/j.issn.1000-3428.2007.18.020
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Attribute reduction is the most important technique of rough set. Once it gets whole reductions, the reasoning capability under multi attribute absent can behave well. How to get whole reductions based on reduction’s concept is discussed. After getting rough reduction by pruning, and whole really reductions with back elimination, reduction pruning and discernibility matrix based heuristic reduction algorithm are compared. The experimental results show reduction-pruning algorithm is effective.
  • PANG Qing-hua
    Computer Engineering. 2007, 33(18): 59-61,7. https://doi.org/10.3969/j.issn.1000-3428.2007.18.021
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Human computer interface(HCI) plays an important role in software quality, so it is necessary to search a logical and scientific method to evaluate the HCI quality of software system. The paper analyzes the factors of HCI, then establishes the comprehensive evaluation model. In the course of solvent, it uses grey relation analysis to obtain the weight of every index and grey statistic method to establish fuzzy evaluation matrix, then appraises HCI in terms of fuzzy comprehensive evaluation, so the evaluation can be more scientific and objective.
  • ZHANG Jing; DING Yi-xin; LIU Shan
    Computer Engineering. 2007, 33(18): 62-63,6. https://doi.org/10.3969/j.issn.1000-3428.2007.18.022
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In the process of querying and managing XML data, structural join algorithm based on range partition is an efficient algorithm when the XML data are not sorted or indexed. In this paper, this algorithm takes advantage of the region numbering scheme to recursive partition the input sets exhaustively and with the cost of partition, the structural relation between ancestors and offspring can be localized. The partition of dichotomy before structural join enhances the efficiency of join. The experiment indicates that this algorithm is an efficient one when querying and managing XML data.
  • WANG Hao; QUAN Jin-guo; LIN Xiao-kang;
    Computer Engineering. 2007, 33(18): 64-66. https://doi.org/10.3969/j.issn.1000-3428.2007.18.023
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The significance of the study on mapping rules of SDL model into C language is introduced. According to TETRA protocol, this paper analyzes some mapping rules of the two languages, which is presented in four aspects: data type, signal transferring, signal reservation and process schedule. It discusses the issue about enhancing the efficiency of mapping in the practical application. The rules can enhance the efficiency of the generated code. It is suitable for the particular operation system that the automatic mapping tool can not employ.
  • WANG Zhan-gang; ZHUANG Da-fang; QIU Dong-sheng
    Computer Engineering. 2007, 33(18): 67-68,7. https://doi.org/10.3969/j.issn.1000-3428.2007.18.024
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Based on the relation between visualization and spatial data mining, every step about the application of visualization in visual data mining is discussed. Application is divided into three levels: concept level, logistic level and base level. Taking geological model mining as an example, pivotal techniques are brought forward in accordance with the three levels: geological model visualization, interactive data mining and exploratory visual analysis. A prototype system is developed and visual data mining is realized.
  • YUAN Pei-sen; PI De-chang
    Computer Engineering. 2007, 33(18): 69-71. https://doi.org/10.3969/j.issn.1000-3428.2007.18.025
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Telecom has became a data-intensive industry, which enlists the support of high performance database. Disk-resident database(DRDB) can’t satisfy the demand of real-time or nearly real-time performance, so to design a kind of new database system, in which "core data" reside in main memory is considered, is needed. Hash index technique is a kind of index technique, used in database system, which can quickly access data, easy to design and implement. According to the features of main memory database, this paper designs and implements a kind of Hash index used in telecom network’s main memory database system.
  • XIN Ming-jun; WU Chao; LI Wei-hua
    Computer Engineering. 2007, 33(18): 72-74. https://doi.org/10.3969/j.issn.1000-3428.2007.18.026
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    On the basis of network-based distributed application system, this paper discusses the process description of composite model collaborative solving for large scale complexity problem. An multi-agent based active control strategy is put forward to support distributed domain problem solving, including four kinds of agent named user agent(UA), system agent(SA), collaborative agent(CA), model agent and data agent(MA&DA) separately. By using the multi-agent architecture, an adaptive QoS adjusting mechanism for composite model collaborative solving is presented to enhance the capability of network resource sharing both in the scope of model-base system and database system. An algorithm to schedule and plan the composite model sequence for distributed problem solving is implemented so as to improve the running efficiency and quality of service under distributed computing environment.
  • LI Guo-hui; FU Pei; CHEN Hui; ZHAO Hai-bo; CHEN Na
    Computer Engineering. 2007, 33(18): 75-77,9. https://doi.org/10.3969/j.issn.1000-3428.2007.18.027
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Many traditional methods in the field of forecasting, including curve simulation, linear regression, etc, which are applied only to solve simple polynomial functions. Adopting gene expression programming (GEP), this paper proposes a predictive mathematical model for forecasting the aggregatde value over data streams. The algorithm is simple and easy to operate which search functions in the great space. As a result, this forecasting model can be used in many kinds of the data stream. When the frequency of forecast failing is greater than a predefined threshold, an adaptive strategy for the predictive mathematical model is proposed.
  • CAO Wan-hua; XIE Bei; WU Hai-xin; CHENG Xiong
    Computer Engineering. 2007, 33(18): 78-80,8. https://doi.org/10.3969/j.issn.1000-3428.2007.18.028
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper designs a new publish/subscribe middleware based on data distribution service(DDS), which is published by OMG. Data centric-data real-time transferring in distributed environment is realized, and QoS restriction and a single point of failure are solved. Dynamical adding and deleting of communication nodes are realized by managing global data space in a special way. Compared with CORBA and other publish/subscribe models, this middleware is more flexible, realtime, scalable and reliable.
  • JI Zhong; SU Yu-ting; AN Xin
    Computer Engineering. 2007, 33(18): 81-83. https://doi.org/10.3969/j.issn.1000-3428.2007.18.029
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Video data mining is an emerging research area and some of the existing classifications are unable to highlight the “novelty” nature of the data mining. This paper attempts to clarify these problems. According to the characteristics of data mining and video sequences, concept of video data mining is defined in a narrow sense and a broad sense respectively. The broad definition is classified into two categories: descriptive video data mining and predictive video data mining. This paper proposes a technique taxonomy framework, discusses some existing approache. It makes an expectation on valuable future work in this area.
  • CHANG Pei; WANG Hong-mei; BAI Zhong-ying
    Computer Engineering. 2007, 33(18): 84-86,8. https://doi.org/10.3969/j.issn.1000-3428.2007.18.030
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    On the basis of analyzing the concept and feature of ILM, this paper puts forward a new cube model(C-ILM). The model depicts three kinds of basic technology(hierarchical storage, ANS, virtual storage), hardware-software hierarchy and six phases (creation, protection, access, transfer, archive, deletion) of ILM. And a storage management architecture of satellite ground application system based on C-ILM is implemented.
  • ZHAO De-ping; SHI Gui-ying
    Computer Engineering. 2007, 33(18): 87-89. https://doi.org/10.3969/j.issn.1000-3428.2007.18.031
    Abstract ( )   Knowledge map   Save
    The major technology of LNRM system realization mirrors the whole device or partition by network based on RAID1 over NBD, which is regarded as a Net_RAID. In Linux, NBD is the technology which controls the remote network resources by simulating a local block device, accomplishes date different area transparently access and a new method which stores enormous date through network. This paper discusses the principle of block device and software RAID, and analyzes the superiority of it when NBD is used as components in Net_RAID arrays. Design and implementation of Net_RAID in Linux is presented. An alternative approach that system can share network resource is provided.
  • CHEN Xiao-ping; XIE Bin; LI Bin
    Computer Engineering. 2007, 33(18): 90-92. https://doi.org/10.3969/j.issn.1000-3428.2007.18.032
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A co-development supporting technology based on target server and target agent model is proposed. With this model, all host-resident tools can interact with target machine through target server, regardless of whether the target is resource-rich or resource-constrained. This paper discusses its structure and its key techniques. The mechanism has been successfully applied in ReWorks RTOS.
  • ZHANG Wei; LU Kai
    Computer Engineering. 2007, 33(18): 93-94,1. https://doi.org/10.3969/j.issn.1000-3428.2007.18.033
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Quality of service(QoS) supporting technology and security isolation technology are both hotspots in the research fields of server OS, which are also crucial for the servers’ competition. This paper discusses some important resource control technologies, and proposes a FreeBSD chamber(FC) mechanism—the QoS supporting and security isolation solution for the FreeBSD OS. The FC mechanism, which includes virtual execution environment in the superstratum and resource management framework in the downstratum, can provide total isolating execution environment and QoS support.
  • ZHOU Deng-peng; XIE Kang-lin
    Computer Engineering. 2007, 33(18): 95-96,1. https://doi.org/10.3969/j.issn.1000-3428.2007.18.034
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    As an information retrieval library written in Java, Lucene, with high performance and easy to scale, can easily add searching and indexing capabilities to applications. This paper discusses the vector space model used in Lucene, analyzes the structure of index files and ranking algorithm, and describes the compressing algorithm in Lucene. An experiment is done to test the indexing process of Lucene.
  • ZHANG Lei; ZHAO Yue-long;
    Computer Engineering. 2007, 33(18): 97-99. https://doi.org/10.3969/j.issn.1000-3428.2007.18.035
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming to solve the problem in network storage system, this paper proposes a scheme named intelligent network disk based on the intelligent arithmetic, discusses the construction of the IND system frame, designs correlative protocols, and implements intelligent arithmetic. A virtual storage via protocol is achieved, single nod exception and capability choke point is avoided via transferring the function of file server down to IND, and a parallel file transfer via the intelligent scheduling arithmetic in IND is implemented. A simulating program is designed and implemented. Experimental results show that IND helps avoid single nod exception and improves the file transfer efficiency.
  • JI Lei
    Computer Engineering. 2007, 33(18): 100-102. https://doi.org/10.3969/j.issn.1000-3428.2007.18.036
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A number of Web services are available and it therefore seems natural to reuse existing Web services to create composite Web services. This paper gives a method of model-driven Web services composition and a PIM and PSM of Web services composition to solve the problem above static modeling of Web services composition. The translation rules between these models are given.
  • YANG Liang-jie; MOU Nai-xia
    Computer Engineering. 2007, 33(18): 103-105. https://doi.org/10.3969/j.issn.1000-3428.2007.18.037
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Traditional surveying process lags behind, because it has many shortcomings in mapping cost, mapping period, data storage and further usage. It is an effective way to use high spatial resolution remote sensing image to make large-scale urban maps. This paper discusses the relationship between mapping scale and image spatial resolution, and explains the data-abstracted method based on customized rules, intelligent symbols and automated topology. Then it expatiates on the core technology of geo-database based on large-scale digital maps and high spatial resolution image, and argues how to establish and maintain a spatial database and serve other different applications by the public interface. Different format data are stored into the same spatial database which further provides comprehensive data and the thematic maps for urban administration, urban plan, digital city and GIS. The spatio-temporal geo-database is established by the “versioning” which can manage different spatial and temporal data.

  • ZHAO Rong; SHI Wei-feng; ZHENG Chao
    Computer Engineering. 2007, 33(18): 106-108. https://doi.org/10.3969/j.issn.1000-3428.2007.18.038
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Concurrent manipulation control scheme is crucial for CAD system. This paper proposes several design considerations for concurrency manipulation control scheme, and introduces the nested transaction of a semantic-based concurrency to solve the problem of lower consistency and difficulty in managing middle version and so on. The model for concurrent DorCAD system is described.
  • Networks and Communications
  • GUAN Shang-yuan; XUE Zheng-hua; SHI Wei-qiang; DONG Xiao-she
    Computer Engineering. 2007, 33(18): 109-111,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.039
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents a mechanism to deal with IPv4/IPv6 packets, which improves the speed of protocol processing through placing the module of protocol translation into the kernel of the frontal subsystem of cluster server NVS (network virtual server). This mechanism achieves that transparent applications of the underlying IP protocols and with high availability, high scalability, load balancing software of the frontal subsystem can be run on NVS without any modification. Experimental result shows that the delay of this mechanism is less than that through a NAT-PT gateway and it is characterized by high throughput.
  • LI Xiao-jun
    Computer Engineering. 2007, 33(18): 112-115. https://doi.org/10.3969/j.issn.1000-3428.2007.18.040
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    SIP is proposed by IETF as IP phone call order protocol which is totally a text modality that to be used to establish, modify and terminate multimedia calls and conversation. This paper introduces SIP and its implementation method, designs the structure of SIP message and transaction layer with class diagram, state diagram, sequence diagram etc. of UML.
  • QIN Si-lin; ZHANG Sheng-bing; ZHOU Xi-ping
    Computer Engineering. 2007, 33(18): 116-118. https://doi.org/10.3969/j.issn.1000-3428.2007.18.041
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper introduces the basic configuration mode of network processor, including parallel configuration and serial configuration. Based on parallel configuration, the action of router in IPv4 is analyzed. After abstracting the common characteristic of diverse NP of processing packet, the relationship between the number of thread and number of micro-engine is analyzed. The efficiency of the NP is discussed with focus on how to improve the efficiency under limited resources.
  • QIAO Hong-lin; MA Yue
    Computer Engineering. 2007, 33(18): 119-121. https://doi.org/10.3969/j.issn.1000-3428.2007.18.042
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    With the rapid development of mobile telecommunication, more and more mobile equipments need to access Internet. The handover performance of mobile IPv6 is one of the key factors which guarantee the QoS of mobile Internet. This paper describes the handover procedure of MIPv6 and FMIPv6. It gives a detailed analysis of handovers in MIPv6, FMIPv6, analyzes problems in the procedures of MIPV6 and FMIPv6 handovers, and proposes ideas and solutions which could improve the handover performance of MIPv6 and FMIPv6.
  • SUN Min-zhi; XU You-yun
    Computer Engineering. 2007, 33(18): 122-124. https://doi.org/10.3969/j.issn.1000-3428.2007.18.043
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Synchronization is a key technology of OFDM systems. This paper introduces synchronization algorithms in OFDM systems and proposes a hardware implementation scheme of synchronization subsystem according to parameters of hardware systems and the hardware architecture. It discusses some key modules in the hardware scheme. The measured data in wireless channel indicates that the proposed hardware implementation scheme of synchronization subsystem not only has a good performance but also can be easily expanded and ported because of the modularization feature of the hardware architecture.
  • JIN Rong; ZHAO Jun-fu; GAO Yong-bing; SHI Hai-jun
    Computer Engineering. 2007, 33(18): 125-127. https://doi.org/10.3969/j.issn.1000-3428.2007.18.044
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    With the development of the Web services application, it is necessary to resolve sharing and interaction in massive application services. Dynamic composition of Web services provides new solution to solve bottleneck brought by information sharing and aplication corporation. Through introducing active XML(AXML) and expanding Web services, this paper proposes dynamic composition Web services architecture based on AXML. The architecture supports dynamic services composition building in time, deployment and delivering in dynamic environment is implemented.
  • YUAN Jin-xiu; QIAN Xue-zhong; WANG Jin-ling
    Computer Engineering. 2007, 33(18): 128-129,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.045
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To build various applications in wireless ad hoc networks, an efficient data sharing mechanism is needed to facilitate cooperation and interaction among different nodes in the network. A novel data sharing solution is proposed for wireless ad hoc networks, namely Location-based DHT(LDHT), which combines the basic idea of distributed hash table(DHT) with the geographic routing technologies of ad hoc networks. Compared with traditional DHT schemes, LDHT is built upon the physical topology of the network rather than the logical overlay, so it eliminates the topology mismatching problem that exists in traditional DHT schemes and greatly improves the efficiency of data sharing in wireless ad hoc networks.
  • WANG Hai-long; YANG Yue-xiang
    Computer Engineering. 2007, 33(18): 130-133. https://doi.org/10.3969/j.issn.1000-3428.2007.18.046
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents a new method of network-wide traffic anomaly detection. The method is based on entropy, which absorbs the idea of subspace method and combines K-means clustering method. In experiment environment of campus networks, the process of detecting network traffic anomalies is realized by applying the method based on entropy. Through the comparison of the results from the experiment and standard subspace method analysis of measurement data, it shows that network-wide traffic anomaly detection based on entropy has a higher detection precision.
  • KANG Xin; ZHOU Hao; ZHAO Bao-hua
    Computer Engineering. 2007, 33(18): 134-136. https://doi.org/10.3969/j.issn.1000-3428.2007.18.047
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the characteristic of IS-IS protocol, this paper introduces a hierarchical method of conformance test for IS-IS protocol. The method can be used to cut off the dependency of test cases and reduce the influence of non-conformance in testing procedure, and increase the reliability and coverage of testing. Test of some different implementations of IS-IS protocol is accomplished. An example is given.
  • SHAO Shu-chao; ZHANG Hui; ZHANG Si-dong
    Computer Engineering. 2007, 33(18): 137-138,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.048
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    MPLS multicast networks can forward the data packets fast and efficiently, and the mechanism of path recovery in MPLS multicast networks ensures the persistence of network services. This paper proposes a path recovery solution with shared resources in MPLS multicast networks. The solution maintains a database in the entry of every entry that records the utilization of link resources, and pre-establishes the backup path with bandwidth guaranteed and shared resources. This solution can optimize the utilization of network resources and lessen the switching duration.
  • DONG Ting
    Computer Engineering. 2007, 33(18): 139-142. https://doi.org/10.3969/j.issn.1000-3428.2007.18.049
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For the sake of balancing energy expenditure of sensor nodes and improving the performance of routing, a self-adaptive routing algorithm based on analytic hierarchy process(AHP) is proposed. The new algorithm induces AHP to cluster self-adaptively, i.e. it selects cluster-heads by considering the working order synthetically instead of periodically. And then it makes virtual backbone network by clusters and sinks. Furthermore data is forwarded via routes built among virtual backbone networks instead of being sent directly to Sinks which may be faraway. Theoretic analysis and simulation results prove it’s more effective than LEACH, which supports lower-class sensors and can balance the energy expenditure.
  • SUN Xue-jun; DONG Zhi-ming; MENG Tian-ge
    Computer Engineering. 2007, 33(18): 143-144,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.050
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Mobile IP solves the macro-mobile problem in the network layer, but it’s not a good solution for micro-mobile problem. As distributed routing can settle the problem, optimizations are proposed to a distributed-agent scheme in order to improve the performance further, i.e. change the buffer in redirection agent to circular list, in order to reduce the number of the out-of-order packets; when shifts redirection agent, the mobile node sends binding update message to the former redirection agent, in order to decrease the number of the lost packets; introduce Snoop mechanism to the redirection agent to reduce the number of the retransmission packets sent by the correspondent node. Results from simulation confirm that both the retransmission packets and the out-of-order packets are reduced, remote signaling and data traffic are decreased, and the utilization of the network resource is enhanced. The performance of mobile IP is improved effectively using this scheme.
  • Security Technology
  • ZHANG Ming-wu; YANG Bo; ZHANG Wen-zheng
    Computer Engineering. 2007, 33(18): 145-147. https://doi.org/10.3969/j.issn.1000-3428.2007.18.051
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Encounter or interactions between nodes unknown to each other are inevitable in Internet transaction. Reputation mechanism is to facilitate the entities trust relationship in decentralized environments. This paper provides a computational model based on directed trust and recommender trust, introduces a self-constraint reputation updating model, which focuses on the reputation rating fluctuating factor. It puts forward an idea about malicious user’s reputation punishment. By comparing with Bayesian probabilistic trust model, it shows some benefits from simulation result: in the model, reputation rating will drop off fast whenever continuous failure transactions.
  • WANG Zhen-zhong; GUAN Yuan; LU Jian-de; CHEN Yu-chun
    Computer Engineering. 2007, 33(18): 148-150,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.052
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A routing security mechanism for on-demand routing in MANET— NRR (neighbor monitoring, node reputation and route healing) is examined and proposed. This mechanism includes three parts: neighbor monitoring and detecting, node reputation and route healing. This mechanism realizes fully distributed instruction detection. The theme can prevent inner non-cooperative nodes from attacking, can heal the damaged routing caused by attacks and ensure the stability of the on-demand routing protocol in its best.
  • WU Tao; ZHENG Xue-feng; YAO Xuan-xia
    Computer Engineering. 2007, 33(18): 151-153. https://doi.org/10.3969/j.issn.1000-3428.2007.18.053
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    As one of the key problem of secure multicast, group key management has become the research hotspot in recent years. This paper proposes an efficient scheme for the secure one-to-many multicast based on some current group key management schemes. Compared with the previous schemes, the proposed scheme has much lower communication overhead and less computation, with great value for many multicast applications which are sensitive to time delay.
  • ZHOU Xuan-wu; YANG Xiao-yuan; WEI Ping; HU Yu-pu  
    Computer Engineering. 2007, 33(18): 154-155,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.054
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Security threats and system weakness of present subliminal channel schemes are analyzed. Combining Shamir Lagrange interpolation formula based secret-sharing scheme and subliminal channel, a threshold subliminal channel scheme with conditional anonymity based on (t, n) threshold cryptosystem is presented. The threshold secret-sharing of the scheme enables the subliminal message to be recoverable only by no less than t members of the n receivers, and the secret piece of each member can remain valid and secure after subliminal message recovering, so the scheme achieves multi-secret sharing. The probabilistic encryption algorithm and identity blinding make the subliminal message sender indistinguishable with other ordinary signers for secrecy protection, and the anonymity can also be conveniently revoked if necessary. The scheme prevents coalition attack and generalized signature forgery, avoids the misuse of subliminal message producing and recovering. Further detailed analyses also justify its brevity, security, high efficiency, and thus considerable improvement on system overheads regarding software and hardware application.

  • LIU Bao-li; XIAO Xiao-chun; ZHANG Xu; ZHANG Gen-du
    Computer Engineering. 2007, 33(18): 156-158. https://doi.org/10.3969/j.issn.1000-3428.2007.18.055
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    With the progressively development of PKI, the assessment of PKI has become more and more important. Security assurance level assessment is a key aspect of PKI assessment. Combined with analytic hierarchy process, linear weighted assessment, this paper provides an assessment method of PKI security assurance level.
  • LI Hai-bao; ZHANG Yu-qing; HAN Zhen
    Computer Engineering. 2007, 33(18): 159-161. https://doi.org/10.3969/j.issn.1000-3428.2007.18.056
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    JXTA proposed by SUN Corporation is designed to provide a uniform development platform for P2P application. Although there is a peer membership protocol used to validate Peer during joining Peer Group in JXTA, it does not support to modify the demand of authentication and other peers do not participate in the application. This paper proposes a novel peer group authentication protocol which is based on voting and very flexible. The validity and feasibility of peer group authentication protocol is validated by an experiment.
  • LI Yan-jun; WU Yu-hua; OU Hai-wen; YANG Gang
    Computer Engineering. 2007, 33(18): 162-163. https://doi.org/10.3969/j.issn.1000-3428.2007.18.057
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Yan Yajun proposed a blind group signature scheme and claimed that it is efficient. However, it is carefully analyzed and found that it could be forgery attacked. Any one of the group members can make forgery signature, which can be verified efficient but can not be open by the group authority. This paper proposes an effective forgery attack scheme, and the reason is also be given.
  • ZHANG Bin; JIN Chen-hui
    Computer Engineering. 2007, 33(18): 164-166. https://doi.org/10.3969/j.issn.1000-3428.2007.18.058
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyzes a resisting cropping robust watermarking algorithm based on chaotic map. Two plaintext-chosen attacks are proposed respectively according to the two different ways of choosing key spaces. Data complexities of the two attacks are 1 cover image and watermark images, and the computing complexities are 1 and computations of watermarking algorithm respectively. Success rates of them are both 1. Theoretic analysis and experimental results show the watermarking algorithm is insecure.
  • WANG Yong; ; YUN Xiao-chun; ; LI Yi-fei
    Computer Engineering. 2007, 33(18): 167-169. https://doi.org/10.3969/j.issn.1000-3428.2007.18.059
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    P2P worms are the most serious threats to P2P applications and Internet security. This paper presents a novel P2P worm spreading model, which considers the P2P network topology characteristics. The numerical simulation results based on Gnutella topology snapshots indicate that the spreading model can provide a set of metrics to evaluate the harms of P2P worms.
  • LIU Ming; SU Jin-hai
    Computer Engineering. 2007, 33(18): 170-171,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.060
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    iSCSI-SAN with out-band storage virtualization has some security hidden dangers: one is the storage resource exposed at IP network, which is vulnerable to forgery attack. The other one is the storage data transmitted on IP network, which faces the security threat of network sniffer. Based on ECC, a security model suited to above-mentioned network storage structure is designed, which provides two-side authentication to prevent forgery attack and encryption mechanism to ensure the security of storage data transmission. Consequently, the security of storage system is enhanced.
  • DONG Jian-quan; WANG Meng-meng; WANG Hong-yu; LI Chao
    Computer Engineering. 2007, 33(18): 172-175. https://doi.org/10.3969/j.issn.1000-3428.2007.18.061
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Although the technology of anonymous communication based on P2P network can hide the communicating relations of both sides, the informations are divulaged on the channel of communication. The information hidden in a blindage will not be discovered by the technology of information hiding. This paper utilizes information hiding technology based on P2P and anonymous system’s advantage, not only hides how peers commutate but also hides information self, guarantees information security to a greatest degree.
  • CHAI Ya-qin ; LAN Hai-bing ; TANG Xiang-hong
    Computer Engineering. 2007, 33(18): 176-177,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.062
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In traditional watermark detection scheme, watermark information is extracted by minusing the original media from the received watermarked media. Because of the attack noise, the information can not be completely extracted. This paper proposes a novel detection scheme. It makesa full use of the cover media’s information, determines what kind of attack that the watermarked media has suffered. Then, it attacks the original media using the same kind of attack to higher the relevance between the original media and the watermarked media. In this way, the attack noise can be counteracted when embedded information is extracted with the help of the attacked cover media. Results show that this scheme is especially efficient, and can obviously improve the whole system’s capability. Furthermore, this method can be applied into other domain and various kinds of algorithm, which is promising.
  • Artificial Intelligence and Recognition Technology
  • LIU Li; CHEN Zhi-gang; YANG Bo; HU Chun-hua
    Computer Engineering. 2007, 33(18): 178-180,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.063
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Matching is considered as one of the crucial factors to ensure dynamic discovery and composition of grid services. Current matching methods are inadequate given their inability to abstract and classify the underlying data of grid services. This paper proposes a semantic grid services discovery arithmetic which exploits FMD in order to abstract and classify the underlying data of grid services. Experimental results show FMD has more precision ratio and recall ratio.
  • YANG Bo; CHEN Zhi-gang; LIU Li
    Computer Engineering. 2007, 33(18): 181-183. https://doi.org/10.3969/j.issn.1000-3428.2007.18.064
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Task scheduling is an important part in grid computing. For heterogeneous and distributed grid, a combined evolutionary computing based grid task schedule algorithm is presented, combining the advantage of genetic algorithm with that of ant algorithm, based on a double-deck genetic structure. Simulation results show that the algorithm performs better than other scheduling algorithms obviously in grid.
  • CAO Li-juan; WANG Xiao-ming
    Computer Engineering. 2007, 33(18): 184-186. https://doi.org/10.3969/j.issn.1000-3428.2007.18.065
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    One popular algorithm for training support vector machine (SVM) is sequential minimal optimization (SMO), but it still requires a large amount of computation time for solving large size problems. This paper proposes one parallel implementation of SMO for training SVM. Experiments show that the algorithm is effective, and there is great speedup in the parallel SMO when many processors are used.
  • LIU Chuan-chang; CHEN Jun-liang
    Computer Engineering. 2007, 33(18): 187-189. https://doi.org/10.3969/j.issn.1000-3428.2007.18.066
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Goal Web services description languages and service discovery algorithms are methods of dealing with the Web services discovery problem. Based on the analysis of the current Web services description languages, the paper designs a goal Web service description ontology which can depict the functional features, the performance features and the semantic features of Web services. With the principle of enhancing efficiency and quality of the service discovery, it presents a Web services feature elements-based service discovery model, and implements a prototype system in the tourist domain.
  • LIU Dao-hua; YUAN Si-cong; LI Xiang-ying; WANG Fa-zhan
    Computer Engineering. 2007, 33(18): 190-192,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.067
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyzes the basic principle of automatic knowledge gaining method based on rough sets theory, introduces the automatic gaining process, and studies the method of data generalization, the concrete algorithm of the attribute reduction, solution of the smallest policy-making rule set and the method of decision-making rule. A concrete example is given about the knowledge’s automatic gaining method. The example shows the method is effective and feasible.
  • CHEN Zeng-zhao; YANG Yang; HE Xiu-ling; YU Ying; DONG Cai-lin
    Computer Engineering. 2007, 33(18): 193-195. https://doi.org/10.3969/j.issn.1000-3428.2007.18.068
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the characteristics of handwritten financial Chinese characters, original features are mapped to higher dimension by applying kernel clustering. Each group is classified by a support vector machines (SVM) classifier. These binary classifiers are seen as the nodes of decision tree, and construct a decision classifying tree. The algorithm of grouping financial Chinese characters and creating decision tree is given. The method of controlling overlap by overlap coefficient is proposed and it can overcome misclassification accumulation. Experimental results show that, with this approach, the speed rate and accuracy rate of recognition meet the requirements.
  • WANG LI; YU Xue-li
    Computer Engineering. 2007, 33(18): 196-198,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.069
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Knowledge communication is one of the valid approach that realizes the semantic Web. A new definition of knowledge communication is put forward and a kind of P2P knowledge communication structure consisting of dynamic virtual communities based on ontology is established. In order to improve routing quality, task-meta-knowledge-base, task-case-base, rule base, ontology knowledge base are designed based on ontology. Routing service agents are created who can accomplish discovery, mediating and locating service resources. All of these constitute the decentralization controlling knowledge routing system.
  • GAO Fei; ZHANG Xian-min
    Computer Engineering. 2007, 33(18): 199-201,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.070
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a novel method for computing the eye-gaze direction and position in the eye-gaze tracking system. The eye corner is applied as the reference point instead of mark and Purkinje points in traditional ones. The difference of the moving point and the reference one is employed to compute the eye-gaze direction and position in the presented method. The center of iris is explored as the moving point due to that it can accurately reflect the moving state of eye. The eye corner is exploited as the reference point due to that it is the most stable point and relatively insensitive to facial expressions. The proposed method overcomes the shortcomings of conventional ones that adopt the mark and Purkinje as the reference points, and it does not need users to mark the marks on faces and allow the moderate variations of hear pose. Experimental results indicate that the method of the eye corner locating is fast and precise. In this way, the relative distance problem of eye motion arising in the eye-gaze tracking system can be well handled.
  • GUO Da-qing; LI Xiao; ZHAO Yong-jin;
    Computer Engineering. 2007, 33(18): 202-204. https://doi.org/10.3969/j.issn.1000-3428.2007.18.071
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper studies the self-tuning problem of proportional-integral-derivative(PID) controller. A novel approach based on improved particle swarm optimization(PSO) algorithm is proposed to design the PID parameters. A real coding method and an exponential curve idea of decreasing inertia weight are used. This approach is easy to realize, and it increases optimal speed and precision. Simulations show the effectiveness of the new method.
  • SHU Hong-xia; YANG Jun-min
    Computer Engineering. 2007, 33(18): 205-207. https://doi.org/10.3969/j.issn.1000-3428.2007.18.072
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Template matching and median filtering are fundamental operations in image processing. For image, template, and window, this paper proposes a time parallel template matching algorithm and a time parallel median filtering algorithm on LARPBS with processors, where .
  • LI Zhang-fan; ZHANG Bi-yin; ZHANG Tian-xu
    Computer Engineering. 2007, 33(18): 208-210. https://doi.org/10.3969/j.issn.1000-3428.2007.18.073
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a new method for calculating the ground truth image by image fusion, and designs the calculation approach for the processing. Using the correlation coefficient between the different detection results, reference ground truth(RGT) images for each detector is obtained. The ground truth (GT) images are calculated by image fusion based on confidence measures, using the RGTs. The method suggests a general tool to assist in practical evaluation of parametric edge detectors where an automatic process is required.
  • WANG Shan; XU Gang
    Computer Engineering. 2007, 33(18): 211-213. https://doi.org/10.3969/j.issn.1000-3428.2007.18.074
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a model of speech separation based on the principle of computational auditory scene analysis, to separate a mixture of two speeches. Different from other models, the model uses different methods to separate resolved and unresolved harmonics, so as to avoid the problem of inability to separate unresolved harmonics successfully. Experimental results show excellent performance of the model.
  • XU Zheng-guang; SHEN Si
    Computer Engineering. 2007, 33(18): 214-216. https://doi.org/10.3969/j.issn.1000-3428.2007.18.075
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A new method to get intercrossed features according to the ratio between class and within class variance of feature vectors’ each component is proposed. The intercrossed features are composed of two kinds of statistical features: PCA and compressed discriminante information among mean vectors of different classes. The method can make use of both the descriptive information and classificatory information. The method is evaluated by the recognition rates over two ear image databases. Experiment results show that the method outperforms traditional PCA or PCA and LDA methods. The method is also proved to work well under some variations in lighting and position.
  • SU Ying-xue; FU Yao-wen
    Computer Engineering. 2007, 33(18): 217-218,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.076
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    As feature dimension increases continually, search algorithms costs a lot of time. Therefore, much attention is paid to no-search method owing to their small time cost and efficiency in reducing redundant features. KNN method, which is based on measuring similarity between features whereby redundancy therein is removed is introduced. And a no-search combined feature selection method based on KNN is proposed.
  • ZHANG Guo-hua; WAN Jun-li
    Computer Engineering. 2007, 33(18): 219-221. https://doi.org/10.3969/j.issn.1000-3428.2007.18.077
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To overcome the difficulty of fusing statistical feature and structural feature in the research on handwritten numeral recognition, principal component analysis is used to reconstruct numeral model and estimate the numeral reconstructive error based on the statistical information of digit structural feature. At the same time, the height-width ratio and Euler value of numeral is extracted. Recognition of digital character is completed through the combination of Bayes classifier corresponding to the three type features. The recognition rate of the method is 90.73% in handwritten numeral database.
  • DUAN Xiao-dong ; GAO Hong-xia ; LIU Xiang-dong ; ZHANG Xue-dong
    Computer Engineering. 2007, 33(18): 222-223,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.078
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes an adaptive particle swarm optimization algorithm and two benchmarks are used to test it. The results show that the algorithm can keep good balance between the exploration and the exploitation. When solving the problem of multi-modal function optimization, the algorithm has better capability of jumping out of local optimum than basic particle swarm optimization algorithm, and the executing efficiency does not reduce distinctly.
  • ZHAO Yong-jian; YUAN Sheng-zhong; WANG Hong-run
    Computer Engineering. 2007, 33(18): 224-226. https://doi.org/10.3969/j.issn.1000-3428.2007.18.079
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents a new approach to identify Chinese signatures based on the wavelet transform. The extracted shape eigenvalues are effective and accurate when the signature is decomposed into character strokes. The B-spline function has the significant characteristic of processing curve and surface in computer graphics. A group of 4-spline wavelet bases are proposed by B-spline function and applied in each stroke of the signature. It also designs a set of formulas to synthesize the extracted eigenvalues for each stroke so that the resulting signature eigenvalues are more effective and stable.
  • LIU Ai-ping; ZHOU Yan; GUAN Xin-pu
    Computer Engineering. 2007, 33(18): 227-229,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.080
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents an improvement on the conventional active shape model(ASM) for face alignment. In this method, DCT coefficients of rectangular domain centering the lineament points are used in lineament matching, and a 2-D texture pattern search-and-fitting scheme instead of an 1-D analysis is used to improve the precision of the ASM method. DCT has good capability in abandoning correlation of data and concentrating energy of images. It withholds 95% energy of all by extracting only 3.52% DCT coefficients and also enhances the orientation speed. Experiment results demonstrate the efficacy of the method in locating facial features.
  • ZHANG Zhao; ; XIA Guo-ping; LI Xue-feng; ; WANG Jun
    Computer Engineering. 2007, 33(18): 230-232,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.081
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Design is a knowledge-intensive process. Considering the features of ripple down rules (RDR) method, this paper proposes and analyzes a framework for RDR-based design knowledge management system (RDR_DKMS). The functions of the system are analyzed. An example is given to describe the application of the RDR_DKMS. The proposed framework and the critical functions can assist enterprises to build their design knowledge management systems more easily.
  • HUANG Li-guo; WANG Shi-tong
    Computer Engineering. 2007, 33(18): 233-235,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.082
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    The clusters of a high dimensional dataset are often hidden in the subspaces of the corresponding low dimensional datasets. In order to successfully find the subspaces, Agrawal proposes the conception of projective clustering, converting the data into subspaces with mapping and using another method to find clusters. EPCH is the latest projective clustering algorithm. This paper incorporates Mean-Shift into EPCH to divide a high dimensional dataset into the corresponding subspaces. Experiments demonstrate that the approach is comparable to EPCH in the sense of obtaining the reasonable clusters, however, it doesn’t require any parameter and can reduce the number of subspaces.

  • Multimedia Technology and Application
  • LI Su-jun; WU Ling-da
    Computer Engineering. 2007, 33(18): 236-238. https://doi.org/10.3969/j.issn.1000-3428.2007.18.083
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The paper presents a method on real time generation of cloud based on hydrodynamics and the particle system theory. It shapes the rain particle as rectangle. It simulates the cloud’s radiometry using dynamic texture mapping and transparency disturbance, describes the cloud’s movement using simple physical equations when different size particles suffered gravity, buoyancy and resistance. Compared with the traditional method of cloud’s simulation, it can generate realistic visual effect of rain, accurately simulate the cloud’s behavior and reduce the computing complexity, realize the 3D effects of rain. And it can interact in the 3D scenes of rain and as same as the real rain scenes, which proves its usefulness.
  • LIN Ai-hua; ZHANG Wen-jun; WANG Yi-min; ZHAO Guang-jun
    Computer Engineering. 2007, 33(18): 239-241. https://doi.org/10.3969/j.issn.1000-3428.2007.18.084
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A new approach of speech-driven facial lip synchronized animation is presented. Based on the analyzing mechanism of the facial lip motion, the physical model of muscles and mandible corresponding to lip motion is established, and the input speech is analyzed and parameterized into the feature coefficients, and that are mapped to the control coefficients of the lip model, then the lip animation is driven directly by input speech, and its real-time synchronization is realized. The results of simulations show that the input speech and facial lip animation is synchronized more precisely and efficiently in this way, and the effect realities of facial lip animation during speech are greatly improved, and due to the lip model is independent to the geometric facial model, it is also suitable for speech driven lips in the field of various facial animations.
  • XU Guo-jing; LUO Zhi-xiang; CAO Ming-cui
    Computer Engineering. 2007, 33(18): 242-244,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.085
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    When the MPEG-4 visual stream is transferred in wireless channel, the visual data must be in accordance with certain structure for better error control when the bit error happens. The grouping of the payload of the visual data according to certain structure is called as packetization. The model of the packetization is analyzed and an algorithm of adaptive packetization based on both encapsulation efficiency and video quality is proposed. Experiments using real-time transport protocol over GPRS (general packet radio services) network are used to validate the analysis of the most efficient scheme.
  • JIANG Chun-ying; FANG Li-jin; ZHAO Ming-yang
    Computer Engineering. 2007, 33(18): 245-248. https://doi.org/10.3969/j.issn.1000-3428.2007.18.086
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A real-time multitask system for the space aircraft docking simulation is presented and the system composition, the functions requirement and the system structure are introduced. Based on the methods of finite state machine (FSM) and Petri net, the single task and the multitask models are built respectively. According to these models, the system design is accomplished. By applying the fork and the resources sharing prototypes, the synchronization and the mutex functions can be realized. In actual application, the engineering and modularization methods are used and the system performances are good as a result. Experimental results show that the methods for the system analysis and design are rational and feasible.
  • Engineer Application Technology and Realization
  • YANG Jun-jie; ZHOU Jian-zhong; FANG Ren-cun; ZHONG Jian-wei
    Computer Engineering. 2007, 33(18): 249-250,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.087
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A new multi-objective particle swarm optimization(MOPSO) is proposed. The proposed algorithms employs three techniques: adaptive grid algorithms, which can obtain the valid density value of particles in Archive set; Pareto optimal solution searching algorithm, which can equalize the ability of global and local searching; Archive pruning techniques, which can remove inferior particles in Archive set to fix the size of Archive set. The algorithm is applied to solve multi-objective optimal regulation of Three Gorges. The simulation performance indicates the effectiveness of the presented algorithm with regard to solving the large scale complex multi-objective optimization problem.
  • ZHANG Xiang-lin; BAI Yan-qi; LI Sheng-hong
    Computer Engineering. 2007, 33(18): 251-252,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.088
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper describes the normal development process FEDEP model, and two kind of VV&A process model basis of FEDFEP model, and analyses the advantage and disadvantage of them. It gives an introduction to the MDA, and analyses the VV & a process of HLA system basis of MDA.
  • QIAN Chen; LI Ming-lu; ZHANG Ji
    Computer Engineering. 2007, 33(18): 253-255,. https://doi.org/10.3969/j.issn.1000-3428.2007.18.089
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Based on the application technology background of the digital setup-box and the requests of the interactive applications, this paper introduces the MHP specification which is related with the middleware technology of the digital TV and presents a scheme for an open implementation of the fundamental software elements of MHP. With view to GNU/open source, the paper puts emphasis on some key technologies related with the openness of the implementation. It also makes an analysis of the middleware technology of the digital TV, the development trend of MHP and the status quo of the digital TV in China.
  • WANG Yue; ZHANG Xiao-tong; LI Lei; FAN Yong
    Computer Engineering. 2007, 33(18): 256-258. https://doi.org/10.3969/j.issn.1000-3428.2007.18.090
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    DDR DIMM interface has the maximal data exchange rate with CPU in normal PC, so the devices based on this interface can have high bandwidth. As the DDR DIMM interface is managed and used by OS, user programs can’t use it to transmit or receive data. This paper brings forward a solution under Linux. It uses the device based on DDR DIMM interface as an external device and maps memory space into the user process’s address space, so the user programs can access the device memory directly. Referring to the related data structures and functions of Linux2.4.20-8, a device driver is programmed and tested for the device based on DDR DIMM Interface.
  • REN Ji; FAN Xiao-guang; TIAN Tao
    Computer Engineering. 2007, 33(18): 259-261. https://doi.org/10.3969/j.issn.1000-3428.2007.18.091
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Since theres a lack of universal test platform for embedded system, a new solution is presented. It is based on the PCX low layer equipment bus with which equipments can be connected by adapters, so that differences between interfaces of equipments is prevented. The unit under test is tested with the method of HILS(hardware in the loop simulation) to fulfill realtime requirement. The commercial software, Matlab/Simulink, Labwindwos/cvi, and open source software TCL/Tk is introduced to realize the construction of the platform. The data preparation before the test and data backup, analysis and processing after the test on the connected systems are realized based on the TCP/IP network, so that good reusability, extensibility and universality are acquired. UML and CSR(condition-signal-response) are introduced to make the test requirement normalized.
  • LI Xin-ming; LI Yi; WANG Peng; LIU Dong
    Computer Engineering. 2007, 33(18): 262-264. https://doi.org/10.3969/j.issn.1000-3428.2007.18.092
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the running environment and characteristics of distributed spacecraft system, requirements of embedded systems are analyzed on space environments, real-time, fault tolerance and distribution. An integrative design of distribution, real-time and fault tolerance is proposed. Details of the design are described from four aspects: real-time fault tolerant ability based on accomplishing the real-time requirements, integrated fault tolerant ability integrated immunity and self cure, distributed fault tolerant ability integrated fault tolerance on single node and among multi nodes and the integration of multi fault tolerant techniques.
  • Developmental Research
  • ZHANG Fan; LI Lin-na; YANG Bing-ru
    Computer Engineering. 2007, 33(18): 265-267. https://doi.org/10.3969/j.issn.1000-3428.2007.18.093
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    With the rapid development of Internet, collecting and exploiting Web information is extensively addressed. This paper designs and realizes one intelligent system on Web information collection and processing. On one hand, thanks to unrepreated URLs and template-based downloading, the collection performance is improved greatly. On the other hand, mature and advanced natural language processing techniques are used for classifying and abstracting the collected information. Thus, the personalization is highlighted. Experimental results show that the proposed system outperforms related work greatly.
  • LIU Lian-hao; LEI Fang
    Computer Engineering. 2007, 33(18): 268-269. https://doi.org/10.3969/j.issn.1000-3428.2007.18.094
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper introduces current situation of MMI software development adopted by main mobile development companies in China and analyses the disadvantages of it. To improve the development efficiency of MMI software, a technique is brought up to develop MST which divides the customized characters from working code completely. It discusses the principle of the function implementation of MST, and clarifies the design mentality. The structure, the function and the development platform of the whole system are explained. The system has been adopted in mobile development and outputs obvious profits.
  • PANG Shi-chun; LIU Shu-fen
    Computer Engineering. 2007, 33(18): 270-272. https://doi.org/10.3969/j.issn.1000-3428.2007.18.095
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The research and implementation of GMT (generic modeling tool) is discussed. The object-oriented modeling standard and software development paradigm which the modeling tool GMT supports is explained briefly, the system structure and functions of GMT are expatiated, and a method of implementing object-oriented software modeling tools is presented. The advantage and disadvantage of GMT is discussed and a way of mend is provided.
  • CAO Li-gang; WANG Xu-ben
    Computer Engineering. 2007, 33(18): 273-275. https://doi.org/10.3969/j.issn.1000-3428.2007.18.096
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    By using modern exploration and IT, in traditional archaeological field, this paper illustrates the process of transforming multi spatial data into the standard GMl form which is in conformity with W3C. And the form is transformed to SVG, so as to relize the interative operation with users. GML and SVG Technology are introduced. This paper analyzes the system structure of archaeological detect, studies data transform, and establishes simulation results.
  • PAN Hua-wei; ZOU Bei-ji; LI Li; ZHU Li
    Computer Engineering. 2007, 33(18): 276-278. https://doi.org/10.3969/j.issn.1000-3428.2007.18.097
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    View separation is one of the important steps in 3D reconstruction of engineering drawing. This paper proposes a new method aiming at separating views by scan-converting all the primitives into an image, and then utilizes the continuity of the dispersal pixel in image to find the outline and the approximate minimum bounding rectangle (MBR) of each view efficiently. The precise MBR of each view is computed in graphics. Compared with other existing methods, the advantage of this method is regardless of how complex the combination of primitives and can automatically separate free numbers of orthographic views from a drawing.
  • WU Wei-guo; CHEN Chang-hong; ZHANG Hu; QIAN De-pei; HU Lei-jun
    Computer Engineering. 2007, 33(18): 279-282. https://doi.org/10.3969/j.issn.1000-3428.2007.18.098
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The structure of common file systems is analyzed and a management framework applicable to a group of parallel file systems is suggested. Based on the management framework, management tools for PVFS file systems are implemented and a single image management platform is provided. Functional evaluation shows that the file system management tool can effectively reduce complexity in file system management.