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

05 December 2010, Volume 36 Issue 23
    

  • Select all
    |
    Networks and Communications
  • XU Chun-Mei, BO Quan, CHENG Yong-Mei, ZHANG Hong-Cai
    Computer Engineering. 2010, 36(23): 1-3. https://doi.org/10.3969/j.issn.1000-3428.2010.23.001
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Fisher Discriminant Analysis(FDA) is a widely used dimensionality reduction technique for fault diagnosis in industry process. Kernel FDA(KFDA) is developed to solve nonlinear problem. Small sample size(3S) problem is arisen in both FDA and KFDA. Regularized FDA is an effective solution for 3S problem. A novel kernel form of regularized FDA which transforms it to equation solving problem and expresses in the dual form is obtained and implementation procedure for fault diagnosis is given. Experimental results on the Tennessee Eastman(TE) process show that the algorithm is valid, and regularized KFDA outperforms FDA for 3S problem.

  • LI Wen-Jie, DIAO Yan
    Computer Engineering. 2010, 36(23): 4-6. https://doi.org/10.3969/j.issn.1000-3428.2010.23.002
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    According to the structural characteristics of ontology model, this paper analyzes the concept similarity computation based on the width, depth and density among the concepts of ontology model. It considers these aspects as structural fact and combines other facts such as semantic contact ratio and semantic distance. An algorithm of semantic similarity computation based on ontology structure is proposed. Through constructing ontology model and analyzing experiment, it summarizes the effects to the ontology concepts semantic similarity of different facts about ontology structure.

  • SUN Shen-Shen, FAN Li-Na, LIN Hui-Zhi
    Computer Engineering. 2010, 36(23): 7-8,12. https://doi.org/10.3969/j.issn.1000-3428.2010.23.003
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Aiming at solving the problem that the dotfilter can not detect Ground Glass Opacity(GGO) nodules, a method based on an adaptive nonlinear filter and dot filter is used to detect them. Experiments are performed at 23 scans of CT images which contain 32 GGO nodule. The sensitivity of the detection method is 84.4%. The time cost is 1.2 minutes per scan. This method is superior to existing methods on the required time and sensitivity.

  • CHEN Tian-Qiang, JIE Jian-Cang, LI Jian-Xun, ZHENG Qiu-Ji
    Computer Engineering. 2010, 36(23): 9-12. https://doi.org/10.3969/j.issn.1000-3428.2010.23.004
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper studies the characteristics of remote sensing data and analyzes application status, combines with LOD ideas and images pyramid model and uses the optimize fragmentary image division algorithm to divide images into several blocks, according to the way of shared directory to organize the fragments. It establishes a Webbased distributed remote sensing image data release framework, achieves the rapid organization and realtime release of remote sensing images, and provides good ideas to solve the problems of sharing remote sensing image data.

  • ZHANG Zheng, WANG Hui-Wen
    Computer Engineering. 2010, 36(23): 13-15,18. https://doi.org/10.3969/j.issn.1000-3428.2010.23.005
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper gives the definition of largescale complex dataset with characteristics of large, multiattribute, temporal and spatial, rough. For the problem of largescale complex dataset mining, according to theory of data reduction of statistics, rough set, fuzzy set, an efficient method is proposed to reduce largescale complex data based on fuzzy clustering and attribute reduction of rough set.

  • SHU Jin-Hui, LIANG Meng-Jie, LIANG Ying-Ju, MIN Hua-Qing, ZHANG Mei
    Computer Engineering. 2010, 36(23): 16-18. https://doi.org/10.3969/j.issn.1000-3428.2010.23.006
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Rapidlyexploring Random Tree(RRT) algorithm is a practical and promising solution to motion planning problem. The algorithm easily falls into local minima which leads to massive failure exploring. To overcome the shortcoming, key factors affecting the exploring of the tree are analyzed and an adaptive weight method is proposed. Nodes are weighted according to the heuristic information collected from the dynamic exploring process, tree extension is guided by the weight. Simulation results show that the method can improve the quality of the tree and shorten the length of planning path.
  • JING Shu-Xu, LIU Wei
    Computer Engineering. 2010, 36(23): 19-21. https://doi.org/10.3969/j.issn.1000-3428.2010.23.007
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Concurrent execution of feature commands will lead to uncertainty of the command execution context and consequent conflict of topological objects’ identification. A state vector based concise description of feature command execution context, which is convenient for communication among participants, is proposed. Together with the feature command list and geometric model on every participant, an accurate description of feature commands’ execution context is achieved. Based on this accurate description, the execution context of feature command at local and remote site can be analyzed. An algorithm to solve the uncertainty of feature command execution context is presented to ensure the validity of topological objects’ identification.
  • GU Rui-Jun, HONG Jia-Cai, CHEN Geng, CHEN Ku-Lei
    Computer Engineering. 2010, 36(23): 22-24. https://doi.org/10.3969/j.issn.1000-3428.2010.23.008
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Affinity Propagation(AP)clustering takes the full similarity matrix to perform propagation, which limits its application in large scale dataset. An improved affinity propagation clustering is proposed specially for processing large dataset, which fully utilizes local distribution to add constraint like semisupervised clustering to construct sparse similarity matrix. AP runs on sparse similarity matrix to obtain an initial cluster partition, and runs iteratively on the exemplars until it obtains a reasonable partition. Experimental results demonstrate that improved affinity propagation performs better both in processing scale and processing time.
  • SHU Jing-Jun, TUN Hai-Yan, GAO Guo-Zhu, CHENG Zhi-Dui
    Computer Engineering. 2010, 36(23): 25-27. https://doi.org/10.3969/j.issn.1000-3428.2010.23.009
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents a Web load test method based on log analysis. This method gets the frequent sequential patterns of Web users from sequential pattern mining. It gets the parameters of Web load from log analysis. It uses them to generate test load closed to realistic load, and uses LoadRunner to do the Web load test. In the experiment, the log generated by test is compared with realistic log, and the similarity between test load and realistic load is validated.
  • ZHANG Yu-Fang, XIONG Zhong-Yang, GENG Xiao-Fei, CHEN Jian-Min
    Computer Engineering. 2010, 36(23): 28-30. https://doi.org/10.3969/j.issn.1000-3428.2010.23.010
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Although level transaction database is adopted in present association rules mining algorithms, plump transaction database has advantage over level transaction database. While Eclat algorithm shows when the Tidsets are very large, this step consumes a lot of time and memories. Contra posed this fault, a new improvement algorithm——Declat is presented. The algorithm applies the method of division to Eclat, reduces the Tidset’s quantity when operate intersects; proposes a priority constraint, reduces the local frequent itemsets’ quantity. Experimental result shows that the improved algorithm has ligher efficiency than the Eclat algorithm.
  • LIAO Hao, LIANG Feng, TAN Jian-Long
    Computer Engineering. 2010, 36(23): 31-33,35. https://doi.org/10.3969/j.issn.1000-3428.2010.23.011
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    During the process of studying data stream, this paper proposes the KBloom Filter structure which is based on the existing synopsis data structure, analyses the false positive misjudgment theoretically, concludes that both can present the upper limits of set scale n0under the same misjudgment rate f0, so the misjudgment rate of KBloom Filter is within the controllable range. The flow counting algorithm based on the KBloom Filter structure is gived, under the same space complexity O(m) and insert time complexity O(k), compared to the flow counting algorithm based on the Bloom Filter structure, the error of the counting result is lower.
  • HUANG Li-Guo, HAN Cong-Yang, SUN Chi
    Computer Engineering. 2010, 36(23): 34-35. https://doi.org/10.3969/j.issn.1000-3428.2010.23.012
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    The present Parallel Variable Transformation(PVT) algorithm is not suitable for large scale optimization problem with bounded constraints. This paper proposes a parallel feasible algorithm for bounded constrained optimization problem by the interiorpoint and the gradual reduction. Yet, the convergence of the algorithm is obtained under the conditions that the reduction direction is gradient dependent and the search step satisfies Goldstein criteria. When the constraints losing effectiveness, it degenerates into the unconstrained PVT algorithm. It is an extension of unconstrained PVT algorithm.

  • LIU Ji-Qiong, LI Xin-Guo, GU Dong-Xiao, FENG Shuai
    Computer Engineering. 2010, 36(23): 36-39. https://doi.org/10.3969/j.issn.1000-3428.2010.23.013
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Information System Planning(ISP) of enterprises mostly depends on previous knowledge and experience. In order to effectively support ISP knowledge reuse and management innovation, this paper uses the CaseBased Reasoning(CBR) technology to the whole process of ISP knowledge reuse and proposes a casebased knowledge reuse method for ISP: Hybrid Retrieval Method combining KnowledgeGuided Approach with NearestNeighbor Approach(HRMKGANNA) method. The application framework, case representation, case retrieval algorithm and case reuse are thoroughly explored. After organizing the cases base, the ISP knowledge retrieval experiment is conducted, and experimental results demonstrate that HRMKGANNA can satisfy retrieval requirements with high retrieval accuracy and efficiency.
  • WANG Liu-Jing, LI Yong, WANG Yi-Chuan
    Computer Engineering. 2010, 36(23): 40-43,46. https://doi.org/10.3969/j.issn.1000-3428.2010.23.014
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Structured data and unstructured information is generated from a company’s operation. The content management theory of unstructured information is discussed. The needs in the content management of the tobacco companies are analyzed. According to the characteristics of the tobacco companies, the information flow is designed into normal information process and prewarning flow. The system framework is discussed, and it can be divided into the client layer, application layer and the intermediate data storage layer. The key technologies of the system implementation are introduced.
  • ZHOU Rui-Qiong, SHU Hao-Dong, TUN Hong-Li
    Computer Engineering. 2010, 36(23): 44-46. https://doi.org/10.3969/j.issn.1000-3428.2010.23.015
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Combining fuzzy set with rough set, attribute reduction algorithm of continuous domain decision table is studied. Continuous attribute values are transformed into fuzzy values with triangular membership function. Similarity degree of two fuzzy objects and similarity class of each fuzzy object are defined. Characteristic vector of continuous attribute which is made up of similarity class of each fuzzy object is provided. Digital characteristic vector of continuous attribute is presented and similar matrix of continuous attributes is proposed. A new attribute reduction algorithm is provided. Also, the algorithm is verified through an illustrative example.
  • SHU Xiao-Hui, WANG Jie-Hua, DAN Zhen-Guo, CHEN Su-Rong
    Computer Engineering. 2010, 36(23): 47-49,52. https://doi.org/10.3969/j.issn.1000-3428.2010.23.016
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problems of the mass images can cause to Web site such as lower access speed, more performance pressure, I/O performance bottleneck, etc., a technology of distributed store and load balance for mass images is proposed. By the means of deploying Web site pages and images separately and recording status of image servers in database, solves the problem of separation for image data and page data. Experimental result shows that the solution can improve the access speeds and running efficiency for Web site, and can add additional image servers to meet the increasing performance demands.
  • XU Jing, LIU Xu-Min, GUAN Yong, DONG Rui
    Computer Engineering. 2010, 36(23): 50-52. https://doi.org/10.3969/j.issn.1000-3428.2010.23.017
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The methods of pruning have great influence on the effect of the decision tree. By researching on the pruning method based on misclassification, this paper introduces the conception of condition misclassification and improves the standard of pruning, it proposes the conditional misclassification pruning method for decision tree optimization and applies it in C4.5 algorithm. Experimental result shows that the condition misclassification pruning can avoid over pruned problem and nonenough pruned problem to some extent and improve the accuracy rate of classification.
  • ZHOU Bin
    Computer Engineering. 2010, 36(23): 53-55. https://doi.org/10.3969/j.issn.1000-3428.2010.23.018
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    By means of the finegrained interference and the disturbed test of the memory bandwidth and the memory space isolation, this paper designs an evaluation system of the memory performance isolation in virtualization from which the interaction of multiple VMs visiting the memory at same time can be obtained. Test result shows that the major flaw still exists in the current hardware and software platforms support with the concern of the performance isolation of the virtualization, and the measured performance of the VMs is down severely in face of interference.
  • LI Liu-Jing, FENG Zhi-Yong, LIU Chao
    Computer Engineering. 2010, 36(23): 56-58. https://doi.org/10.3969/j.issn.1000-3428.2010.23.019
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to solve the problem that global query can not query heterogeneous data sources,this paper proposes to decompose the global query into subqueries against heterogeneous data. It designs query decomposition and subquery reconstruction algorithm. Query decomposition is based on JavaCC and JJTree to abstract the global query into a syntax tree. Subquery reconstruction algorithm traversals the syntax tree, chooses different reconstruction algorithms based on the current node type, and constructs the sunquery based on different datasource.
  • HAN Meng, CHEN Qun, WANG Feng
    Computer Engineering. 2010, 36(23): 59-62. https://doi.org/10.3969/j.issn.1000-3428.2010.23.020
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper gives and analyzes some properties of Exdusive Lowest Common Ancestors(ELCA) based on the semantics of ELCA. It also introduces an XML keyword retrieval algorithm, Bottomup Hierarchical Filtering Algorithm(BHFA), on the basis of the properties above. There are two instances following the BHFA idea, called BHFA I and BHFA II respectively. This algorithm looks for each hierarchical Lowest Common Ancestors(LCA), and gets results through layer by layer selection according to the properties of ELCA. Experimental results show that BHFA outperforms the existing mainstream algorithms in most case.
  • FANG Gang
    Computer Engineering. 2010, 36(23): 63-65,68. https://doi.org/10.3969/j.issn.1000-3428.2010.23.021
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problems that the presented frequent neighboring class sets mining algorithms have repeated computing and superfluous neighboring class sets, this paper proposes an algorithm of frequent neighboring class sets mining dependent on proper subset, which is suitable for mining frequent neighboring class sets of spatial objects in large data. The algorithm uses the way of destructor to create database of neighboring class sets, and uses the way of generating proper subset of neighboring class sets to compute support, it only need once scan database to extract frequent neighboring class sets. The algorithm improves mining efficiency by two approaches. One is that it needn’t generate candidate frequent neighboring class sets, the other is that it needn’t repeated scan database when computing support. The result of experiment indicates that the algorithm is faster and more efficient than presented algorithms when mining frequent neighboring class sets in large spatial data.
  • ZHANG Fan, ZHONG Jin-Hong, HUANG Ling
    Computer Engineering. 2010, 36(23): 66-68. https://doi.org/10.3969/j.issn.1000-3428.2010.23.022
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    There are multiple paths between two concepts in the same domain ontology. The present methods for measuring semantic similarity of concepts cannot fully reflect the similarity between two concepts, because it only considers the path with the shortest distance. A novel method for concept similarity computation based on the weighted semantic distance is proposed. It finds out all paths between two concepts by the proposed searching procedure, calculates concept similarity using the weighted average distance of all paths, and it does not merely consider the shortest distance. In addition, it also considers the influences of the node depth and public parent in the approach. Experimental results show that the concepts similarity calculated by the proposed method is more accurate.
  • LIU Chang, WU Xing, CHI Yi-Lin, ZHANG Wen-Bin
    Computer Engineering. 2010, 36(23): 69-71,75. https://doi.org/10.3969/j.issn.1000-3428.2010.23.023
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    There are some problems in development field of equipment online monitoring system, such as portability, expansibility and reusability. This paper summarizes special knowledge of the field using theory of Software Architecture(SA). A domain model of Online Monitoring System(OMS) is built to guide the analysis and design of software architecture. A software architecture is comprehensively described. An OMS is implemented using this software architecture. It is proved to be legical, correct and effective, and may provide some guide and reference to other researchers and developers.
  • MA Chao, CHEN Wei
    Computer Engineering. 2010, 36(23): 72-75. https://doi.org/10.3969/j.issn.1000-3428.2010.23.024
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Clustering of clickstreams in Weblogs can find Web visitors’ using patterns, and categorize these visitors. However, traditional clustering method faces challenge of extracting representative feature vector, sparse clickstreams and feature vector. To solve the problems, a closed repetitive gapped subsequence mining based clickstream clustering method is proposed. Extract repetitive support of subsequence from clickstream, and construct feature vector. A bidirectional projected Euclidean distance based on fuzzy dissimilarity is proposed and used as distance measure of feature vectors. Clustering quality of BIRCH algorithm on clickstream is enhanced.
  • LI Meng, YANG Hai-Bei, ZHANG Ji-Wen, WANG Xu-Yang
    Computer Engineering. 2010, 36(23): 76-78. https://doi.org/10.3969/j.issn.1000-3428.2010.23.025
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Converting the UML chart into the formal specification is an effective way to achieve more precise semantics and expand the application scope of formal software methods. In view of the strong decidable reasoning ability of Description Logics(DLs), the formalization of UML state chart based on Temporal Description Logics(TDLs) is proposed. The temporal operators are applied to extend the basic description logics, and then get the formal specificationTDLs, which can express the dynamic and temporal semantics. The general mapping rules that state how a state chart is transformed into a TDLs specification are given. The example shows that the method formalizing the UML state chart based on TDLs is feasible.
  • FU Guo-Jiang, GUO Xiang-Yong
    Computer Engineering. 2010, 36(23): 79-81. https://doi.org/10.3969/j.issn.1000-3428.2010.23.026
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Weighted association rule algorithm for less than two: one does not meet the requirement of closed down, that is a subset of frequent sets may not be frequent sets; another weighted association rules can not handle the different importance of different items, and truly embody the the importance of different items different. In this paper, the dynamic weighted association rules algorithm, algorithm based on the importance of the project and the largest number of frequent itemsets at different stages of the project to determine the different weights, fully reflect the importance of different items are different, and algorithms are proven closed down. Experimental results show that the algorithm improves the high accuracy and efficiency.
  • XU Na, WANG Xin-Sheng
    Computer Engineering. 2010, 36(23): 82-84. https://doi.org/10.3969/j.issn.1000-3428.2010.23.027
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    On the basis of the users’ profileexposing in the prediction generation process, a data obfuscation policy without affecting the accuracy of recommender system is proposed, in which the ratings of the responding user are substituted by false data before computing the similarity degree of users. The process does not(or a little) expose the ratings of user and preserves users’ privacy data. Experimental results demonstrate the impact of obfuscation policies on the accuracy of the generated predictions, and show the improvement is effective.
  • LUO Jun, GAO Qi, WANG Yi
    Computer Engineering. 2010, 36(23): 85-87. https://doi.org/10.3969/j.issn.1000-3428.2010.23.028
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A very important premise to achieve the Semantic Web aim is using ontology vocabulary to annotate Web resource. This paper presents a new annotation method which is based on Bootstrapping and rules. Ontology should be parsed to generate the rule files, and domain documents should be filtered by text classifier. Several loops using Bootstrapping to annotate and extract information and infer ontology are maked, so a good annotation result can be achieved by a few straining documents. Experiments show that the method with high recognition rate is effective.
  • WANG Huo-Chao, CHENG Liang-Lun
    Computer Engineering. 2010, 36(23): 88-91. https://doi.org/10.3969/j.issn.1000-3428.2010.23.029
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper focuses on the issue of QoS routing problem in medium and high rate sensor networks. The corresponding model is set up and analyzed. An improved ant colony optimization algorithm to QoS routing problem is introduced. It guarantees that different services have different QoS parameters in medium and high rate sensor networks. Reverse inhibition is set to ensure the service with higher priority can obtain more resorces. Simulation results show that improved routing protocol is suitable for medium and high rate sensor networks, which can meet different QoS requirements of different services.
  • WANG Huo-Chao, CHENG Liang-Lun
    Computer Engineering. 2010, 36(23): 92-94. https://doi.org/10.3969/j.issn.1000-3428.2010.23.030
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper focuses on the issue of QoS routing problem in medium and high rate sensor networks. The corresponding model is set up and analyzed. An improved ant colony optimization algorithm to QoS routing problem is introduced. It guarantees that different services have different QoS parameters in medium and high rate sensor networks. Reverse inhibition is set to ensure the service with higher priority can obtain more resorces. Simulation results show that improved routing protocol is suitable for medium and high rate sensor networks, which can meet different QoS requirements of different services.
  • SUN Chang, BANG Hua
    Computer Engineering. 2010, 36(23): 95-97. https://doi.org/10.3969/j.issn.1000-3428.2010.23.031
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper introduces a method for the design of wideband signal sampling system based on fractional delay filters. The induced error caused by multichannel sampling can be treated as a hybrid system, which can be converted to a finitedimensional linear timeinvariant digital system using H∞ optimization. The equivalent digital system enables the design of digital synthesis filters using linear matrix inequalities. Experimental results show that the proposed approach minimizes induced errors, and yields better performance compared to existing techniques without band limiting assumption.
  • YAN Jin, LI Beng
    Computer Engineering. 2010, 36(23): 98-100. https://doi.org/10.3969/j.issn.1000-3428.2010.23.032
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In view of Wireless Sensor Network(WSN) in hidden terminal and delay question, a kind of progressive MAC protocol based on power control is proposed. The node on the basis of the SMAC protocol through the power control algorithm in each node to save power scale dynamically selects the appropriate power value as part of its transmission power, thus avoids the hidden terminal and delay question. Simulation result shows that compared with SMAC protocol, the improved protocol improves the network throughput, and reduces the source node to destination node of the end to end delay.
  • LV Lin-Chao, HONG Lei, ZHANG Na
    Computer Engineering. 2010, 36(23): 101-103. https://doi.org/10.3969/j.issn.1000-3428.2010.23.033
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Since Wireless Sensor Networks(WSN) can not effectively detect security problems caused by the internal malicious nodes, this paper presents a hierarchical routing trust model for WSN. The model can detect malicious attacks from nodes within the network, and exclude it from the network. Hence the security of the WSN is greatly improved. Simulation results show that compared with the TLEACH protocol, the model is 5% more sensitive and the trust value is 10% higher when the malicious node attacks.
  • LI Bing-Zhi, LIU Bao-Lin, YANG Fu-Liang
    Computer Engineering. 2010, 36(23): 104-106. https://doi.org/10.3969/j.issn.1000-3428.2010.23.034
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    There are presently a lot of problems in TD field test process, such as the operation of equipment is inconvenient, wireless environment is complicated, test scenarios can not be reproduced, etc. To resolve these problems, the TDSCDMA service model and the transfer model are figured out in this paper, by studying the relative 2G and 3G system theories. A method of building up a virtual field test platform under laboratory circumstance, which is based on emulating test of TD field using software and hardware. It relates and analyzes technological makeup of the testing platform, and how to work and how to promote testing efficiency, which can conveniently do a lot of testing under laboratory circumstance.
  • ZHANG Mei-Yang, LI Xin, JI Zhong-Mei
    Computer Engineering. 2010, 36(23): 107-109. https://doi.org/10.3969/j.issn.1000-3428.2010.23.035
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes an algorithm of Direction of Arrival(DOA) estimation in the Orthogonal Frequency Division Multiplexing(OFDM) system. It uses the priori knowledge of angle between the base stations and the buildings around it with oblique projection operator to estimate the unknown angle based on the Least Squares(LS) ideas of MUSIC algorithm. It is proved that the algorithm is the unbiased estimation only for the unknown angles from the view of theory and simulation. Result is free from the priori information, and it is fit for distinguishing the small difference from the known angle, so it outperforms the traditional MUSIC algorithm.
  • HU Ru, SUN Jiang-Lin, ZHOU Qiang
    Computer Engineering. 2010, 36(23): 110-112. https://doi.org/10.3969/j.issn.1000-3428.2010.23.036
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Conventional hash functions can not be computed efficiently in parallel modes, and it can not make full use of the digital images’ properties in image authentication. 2D cellular automata is advanced in its topology, the nature of parallel computation, and higher efficiency in computation. So this paper proposes an image authentication method based on cellular automata. Theoretic analysis and experiment show that the method fulfills the basic requirements of image authentications such as randomness and avalanche criterion, and its efficiency is higher than conventional hash functions.
  • LIU Lu, QUAN Jun-Lin, LI Wei-Chao
    Computer Engineering. 2010, 36(23): 113-115,118. https://doi.org/10.3969/j.issn.1000-3428.2010.23.037
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper designs a clientbased malicious webpage collection system. By setting theme spider, it accesses the webpage file which may contain malicious script. By analyzing the common features of malicious codes, it designs regular expressions to extract character code of malicious codes, and uses algorithm to match and scan the webpage file extracted. If the webpage file contains suspect malicious scripts, domain URL, path of malicious webpage and type of malicious code scripts will be recorded in malicious webpage database to realize collection of malicious webpages.
  • LI Nan, GU Shan, SU Jin-Hai
    Computer Engineering. 2010, 36(23): 116-118. https://doi.org/10.3969/j.issn.1000-3428.2010.23.038
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Separable and Anonymous identitybased Key Issuing(SAKI) scheme can solve the problems that how to authenticate the user’s identity and distribute the user’s private key in identitybased cryptography, but it has secure flaws. This paper investigates the secure flaws of SAKI scheme and proposes an improved scheme. Comparison analysis result shows that the improved scheme keeps simplicity and high efficiency of SAKI, and can resist keyword dictionary attack, stolen verifier attack, maninmiddle attack and privacy key integrality attack.
  • HAO Yao-Hui, LIU Hong-Bei, ZHENG Li, GE Chang-Chao
    Computer Engineering. 2010, 36(23): 119-120,123. https://doi.org/10.3969/j.issn.1000-3428.2010.23.039
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To solve the problems of easy to declassification and inconvenient to use in present software piracy—proof methods, this paper designs and implements a new pirate—proof method based on USB encryption lock. A user key is written into USB encryption lock, and when the software is the first time enabled, the unique key and the user key in the USB encryption lock are written into registration table. By comparing the two keys in the USB encryption lock and registration table, the user's legitimacy is determined. The method is applied in a commercial software, and the result proves it is effective.
  • SHAO Chun-Yu, SU Jin-Hai, LI Nan
    Computer Engineering. 2010, 36(23): 121-123. https://doi.org/10.3969/j.issn.1000-3428.2010.23.040
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to improve the security of IdentityBased Encryption(IBE) algorithm, this paper designs IBE algorithm based on Combined Public Key(CPK). It produces user public key according to the method of user key producing in CPK, realizes the map from identity to the group of points on an elliptic curve simply, replaces single system master key with system master key matrix, and expands the space of system master key and reduces the risk that the system is destroyed for the leak of the single system master key. Theory analysis results show that this algorithm has the characteristics of large scale key management, simple public key authentication, and it does not have the collusion attack.
  • HUANG Qing, WANG E-Di, HAN Ji-Gong, FAN Yu-Dan, LI Da-Hai
    Computer Engineering. 2010, 36(23): 124-126,129. https://doi.org/10.3969/j.issn.1000-3428.2010.23.041
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a timestamp protocol processing method based on event order under the situation of not considering network delay. On the basis of analyzing the timestamp and event order, it proves that if the state satisfies no cycles property of timestamp, the transfer of state can main the timestamp freshness. Verification algorithm of timestamp relation no cycles property based on event order is given. Example shows that this method is simple to realize and it has certain applicability.
  • DING Hui, YAN Xin-Chun
    Computer Engineering. 2010, 36(23): 127-129. https://doi.org/10.3969/j.issn.1000-3428.2010.23.042
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper designs an identitybased authenticated key agreement protocol with perfect forward security of Private Key Generator(PKG). It is proved to provide known key security, forward secrecy, keycompromise impersonation and so on in standard model. Its security is based on Bilinear Decisional DiffieHellman(BDDH) assumption, so its security is higher than the protocols based on the weaker assumption.
  • XIE Dong-Hai, JIANG Guo-Beng, SONG Yu-Rong
    Computer Engineering. 2010, 36(23): 130-132. https://doi.org/10.3969/j.issn.1000-3428.2010.23.043
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper improves the construction algorithm of Multi Local World(MLW) evolutionary model. Cellular Automaton(CA) is used to study the spreading property of MLW complex network. Result shows CA can well reflect the probability event and interaction between units in the progress of virus spreading, the threshold of MLW complex network is not only with the infection rate, but also with the probability of virus outbreak. The choice of initially infected nodes plays an important role in virus outbreak. The speed of virus spreading and its perishing is related to the infection rate and attack mode.
  • LIU Tu-Liang, GUO Gao
    Computer Engineering. 2010, 36(23): 133-135. https://doi.org/10.3969/j.issn.1000-3428.2010.23.044
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In Web site, URL parameter rewriting brings an important influence for Web security test. Aiming at this problem, this paper presents a URL parameter rewriting framework. Test URLs are formed based on the original URL and are submitted to the Web server. By a random URL sampling verification policy based on three differential analysis methods, any fake path in the original URL is detected, rewriting rule is retrieved and URLs with parameter rewriting is detected. URL parameter rewriting detection crawler realized by C# language is validated the effectiveness of this framework.
  • XIANG Li, BO Feng, YANG Xiao-Yuan, CHOU Ge
    Computer Engineering. 2010, 36(23): 136-138. https://doi.org/10.3969/j.issn.1000-3428.2010.23.045
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Combination of Discrete Cosine Transform(DCT) energy compression and multiresolution characteristics of Discrete Wavelet Transform(DWT), this paper presents a video steganography algorithm based on quasi3D DWT/DCT. The algorithm uses 2D DWT to depict intraframe information and uses 1D DCT to depict interframe information of the video sequence,and redundancy data in time and space domain are efficiently used accordingly. During the quantify process, secret message is embedded into coefficients in DCT domain. Experimental results demonstrate that the algorithm not only is imperceptible and has large embedding capacity, but also can extract the secret message without using the original video.
  • ZHANG Zhi-Beng, HONG Qiang-Miao
    Computer Engineering. 2010, 36(23): 139-141,145. https://doi.org/10.3969/j.issn.1000-3428.2010.23.046
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the function of Hidden Markov Model(HMM) in processing continuous dynamic signal and model recognition, Support Vector Machine(SVM) and KNearest Neighbor classifier(KNN) being adapt to deal with pattern classification, this paper presents a new facial expression recognition model based on (HMM+KNN)+SVM. It gets training samples feature sequences, and constructs HMM and SVM, at the same time, training samples are set as KNN classifier’s template. It gets the class results of test sample by HMM and KNN respectively, if these two results are the same, then puts out the result as the test sample’s decision class, otherwise, calls SVM to get the test sample’s class result. Experimental result shows that the method is better than single classifier.
  • FAN Jia, JIAN Hui, SHU Miao-Liang, CHEN Wu-Bin
    Computer Engineering. 2010, 36(23): 142-145. https://doi.org/10.3969/j.issn.1000-3428.2010.23.047
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In this paper, a multirobot task planning framework is proposed by solving optimal path allocation problem. Formal description of task planning problem for optimal path allocation is brought forth and the integral framework is depicted. To implement this framework, three important techniques are explored in depth including Shortest Path with Recourse Problem(SPRP), solving multiple traveling robots problem by randomized algorithms, and update model of probability framework. Exerimental results illustrate that this framework is feasible and practical.
  • GONG Wei-Guo, YANG Jin-Fei, LI Jian-Fu
    Computer Engineering. 2010, 36(23): 146-148. https://doi.org/10.3969/j.issn.1000-3428.2010.23.048
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The MAPMRF model is adopted to locate the Regions Of Interest(ROI). According to the imaging features of human body in infrared system, the intensity of pixels in each cirque is cumulated to construct an intensitydistance joint space based pedestrian feature representation model to hurdle the disadvantage of inertiabased feature. The pedestrian region is classified and recognized using Support Vector Machine(SVM). Experimental results on different infrared image sequences show that the proposed scheme achieves highly accurate human detection.
  • CAO Ju, LI Ting-Ting, GU Gong
    Computer Engineering. 2010, 36(23): 149-151,154. https://doi.org/10.3969/j.issn.1000-3428.2010.23.049
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents a new evolutionary algorithm——entitled Fireworks Explosion Optimization with Genetic operators(GAFEO), that is inspired by fireworks explosion and compromises the idea of genetic algorithm. GAFEO algorithm mainly implements diffuse parallel search in the search space by imitating the process of fireworks explosion. In order to improve the optimal performance, the algorithm introduces the adaptive local search strategy and crossover mutation strategies. Experiments are conducted on 12 benchmark problems which include unimodal and multimodal functions. Results show that the GAFEO algorithm displays better performance compared to PSO and other hybrid algorithms.
  • DING Ti, LIU Jun-Fa, CHEN Yi-Jiang, ZHOU Jing-Shu
    Computer Engineering. 2010, 36(23): 152-154. https://doi.org/10.3969/j.issn.1000-3428.2010.23.050
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents a novel control interface commonly used by medium, the interface can identify the natural gestures expressed by user's mobile phone. Users express their operational intention by waving the mobile phone, the builtin threeaxis acceleration sensor will collect corresponding gesture data. It uses various algorithms, such as Dynamic Time Warping(DTW) to recognize the user's gestures in order to control the multimedia playing. Experimental results show that to a few of common gestures,the interface has a higher recognition rate and it can meet the requirement of the practical application to control media simply and conveniently.
  • ZHOU Yi-Hui, MU Ling-Ling, ZAN Gong-Yang, YUAN Ying-Cheng
    Computer Engineering. 2010, 36(23): 155-157,161. https://doi.org/10.3969/j.issn.1000-3428.2010.23.051
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper focuses on the automatic recognition of Chinese modality usage. It builds the modality usage dictionary and the modality usage rules base from the real usage of Chinese modality. It introduces the concept of semantic field when building the modality usage rules base. It does experiments to automatically recognize Chinese modality usage by using the modality usage rules base. The corpus is the People’s Daily in January 1998, and the correct rate of label is 78.433%.
  • SHANG Xi, LIU Wei-Ming, BAI Ke-Jia
    Computer Engineering. 2010, 36(23): 158-161. https://doi.org/10.3969/j.issn.1000-3428.2010.23.052
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to solve multiobject tracking problems, based on data association matrices, an improved multiobject tracking algorithm is established, and multiobject video tracking is achieved under complex scenes. Sectiondistribution model is established to acquire background and foreground, and motion model is built for foreground target. According to the prediction of motion model and Kalman filter, corresponding matching cost function, correlation matrix and matching list are set up to solve kinds of tracking problems under complex scenes. Experimental results demonstrate better processing effect when object is exposed in scenes such as frequent appearance and disappearance, mutual crossmotion and shorttime occlusion.
  • TUN Xue-Jiao, SUN Meng-Han
    Computer Engineering. 2010, 36(23): 162-164,167. https://doi.org/10.3969/j.issn.1000-3428.2010.23.053
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents timevarying RBF neural networks with capabilities applicable to model nonlinear timevarying systems. For neural network training, the subtractive clustering algorithm is used, and Iterative Learning Least Squares(ILLS) algorithm is applied for updating timevarying weights. Theoretical results show that the timevarying weights of the method proposed updated by ILLS algorithm is bounded, and the modeling error is ensured to converge to zero. Numerical results are given to demonstrate effectiveness of the learning algorithm.
  • HE Xue-Hai, HU Xiao-Bing, DIAO Ji-Dong, WANG Zhi
    Computer Engineering. 2010, 36(23): 165-167. https://doi.org/10.3969/j.issn.1000-3428.2010.23.054
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A new factor in transition rule is employed to overcome the premature behavior in Ant Colony Optimization(ACO). The factor can help the ants to obtain a better result by exploring the arc with low pheromone trail accumulated so far as time elapses. Besides, it can avoid the overconcentration of pheromone trail to enlarge the searching range. Simulation results show that the Improved Ant Colony System(IACS) has better performance in solving Traveling Salesman Problem(TSP) and more outstanding global optimization properties.
  • GE Jun-Wei, SHA Jing, FANG Xi-Qiu
    Computer Engineering. 2010, 36(23): 168-170. https://doi.org/10.3969/j.issn.1000-3428.2010.23.055
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The main weak point of Back Propagation(BP) algorithm is that the optimal procedure is easily trapped into local minimum value and the speed of convergence is very slow. To solve the problem, this paper makes use of ergodicity property of chaos, starts its improvement from the learning rate. The improved algorithm undergoes a simulated operation with Matlab. The outcome shows that the algorithm improves the speed of network study and the accuracy of convergence, and saves the network from the problem of local minima.
  • GU Xue-Feng, WANG Jian-Xin, JI Jian-Dong, SHU Li-Jun
    Computer Engineering. 2010, 36(23): 171-173,176. https://doi.org/10.3969/j.issn.1000-3428.2010.23.056
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Compared with the traditional retrieval model, this paper proposes a retrieval model based on domain Ontology combining with the Ontology concepts. The model uses the concept of Ontology in the semantic relations and semantic extension mechanism to map and expand the keyword querying concept. By calculating the document similarity, the model returns search results and shows the better retrieval precision rate and recall rate.
  • GU Xue-Feng, WANG Jian-Xin, JI Jian-Dong, SHU Li-Jun
    Computer Engineering. 2010, 36(23): 174-176. https://doi.org/10.3969/j.issn.1000-3428.2010.23.057
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Compared with the traditional retrieval model, this paper proposes a retrieval model based on domain Ontology combining with the Ontology concepts. The model uses the concept of Ontology in the semantic relations and semantic extension mechanism to map and expand the keyword querying concept. By calculating the document similarity, the model returns search results and shows the better retrieval precision rate and recall rate.
  • FANG Liang-Da, TU Yong-Quan, ZHANG Rui
    Computer Engineering. 2010, 36(23): 177-179,182. https://doi.org/10.3969/j.issn.1000-3428.2010.23.058
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper takes the extension detection as a foundation and puts forward the third detection problem which is measured matterelement exchange problem. It is detectable and measured which exchanges in the new detection environment. Considering the particularity of this problem, this paper sets the problemsolving framework based on the model of neural network, designs genetic algorithm on the basis of extension transformation and related function, and proposes a solution to this detection problem by extension genetic algorithm and neural network. It is verified by the application of examples.
  • YANG Bao-Hua, GU Li-Chuan, LI Chao-Wen, JIN Xiu
    Computer Engineering. 2010, 36(23): 180-182. https://doi.org/10.3969/j.issn.1000-3428.2010.23.059
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Method for attribute significance evaluation is researched in information system. Attribute significance evaluation algorithm is proposed based on sensitivity coefficient and RBF neural network. Information system about condition attributes and decisionmaking attributes is constructed as a RBF neural network. Attribute significance is determined by RBF neural network training and learning, which analyzes sensitivity between network output and the input. After dynamic adjustment of RBF network topology and judge importance of attribute, the method based on sensitivity coefficient and RBF neural network is proved through the example of redseed watermelon, which shows the algorithm is effective.
  • WANG Xian-Hui, YIN Dong, ZHANG Rong
    Computer Engineering. 2010, 36(23): 183-185. https://doi.org/10.3969/j.issn.1000-3428.2010.23.060
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper extends the typical MeanShift tracking method and makes the feature selection and quantification automatic. It presents an adaptive tracking algorithm that integrates color and shape features and improves the quantification method. Good features and quantification parameter are selected and applied to represent the target according to the descriptive ability of these features. The proposed method is been implemented and tested in different kinds of image sequences. Experimental results show that the tracking algorithm is robust and efficient in image sequences, it is fit for some environment, such as variable light, disturbed background, shaded object and worse colon quality.
  • LI Wei-Qun, WU Jia-Wei
    Computer Engineering. 2010, 36(23): 186-188,191. https://doi.org/10.3969/j.issn.1000-3428.2010.23.061
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem of the high redundancy of constraints potentials in traditional graphical hand model, a novel articulated human hand model that employs clique potentials is proposed. It designs a framework to eliminate part of redundant imformation in the existing graphical hand model and reduces the computation complexity due to the proper utilization of the special physiology strcture and kinematic features of human hand. Meanwhile, it develops the novel clique potentials which describe the hand's 3D structure, kinematics, and dynamics and designs a smart message passing algorithm during the course of inference underlying the cliquebased model. Experimental result shows that the proposed method tracks 3D articulated hand efficiently and accurately, and can meet the requirements of accurate visionbased hand tracking.
  • WANG Yan, SUN Xiang-Feng, LI Meng
    Computer Engineering. 2010, 36(23): 189-191. https://doi.org/10.3969/j.issn.1000-3428.2010.23.062
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To make the particles distribute in the problem search space evenly, a novel Chaos Particle Swarm Optimization(CPSO) is proposed based on the analysis of the ergodicity of chaos and inertia weight of the PSO. The improved circle map is introduced, and the new map is introduced into Particle Swarm Optimization(PSO) to avoid PSO from getting into local optimum. A face recognition method using this improved algorithm to train Support Vector Machine(SVM) is presented. Experimental results show that the presented SVM method optimized by CPSO can achieve higher recognition performance.
  • JI Zhan-Ling, FENG Xiao-Yi, YAN Hun
    Computer Engineering. 2010, 36(23): 192-193,196. https://doi.org/10.3969/j.issn.1000-3428.2010.23.063
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In the Inverse Synthetic Aperture Radar(ISAR)image plane recognition, the traditional features are lowfrequency Fourier coefficients, geometric moment invariants, shape features and energy features of ISAR images. But these features do not take into account the texture of ISAR. This paper introduces a new feature for the ISAR image plane target recognition, the LBP feature is extracted to describe the ISAR image texture, and k neighbor classifier is used to classify. Experimental result shows an average recognition rate of 98.7% is reached, the LBP feature is effective.
  • ZHANG Jing, JIN Gao
    Computer Engineering. 2010, 36(23): 194-196. https://doi.org/10.3969/j.issn.1000-3428.2010.23.064
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The Chinese word sentiment polarity automatic judgment can avoid artificial error and improve the efficiency of the subjective lexicon creation. The technology of the Chinese word sentiment polarity judgment is discussed and analyzed. The polarity is described by using the sentiment characteristics set. The model of the sentiment polarity mutual information characteristics is created based on the bigram dependency of POS tagging. The classifier is available by machine learning to automatically judge, compare and optimize the word sentiment polarity. All of these help to improve the properties, the highest accuracy of SVM reaches 95.47%, and the F value is up to 93.90%. So it is effective to describe the sentiment polarity by using characteristic set and to automatically judge the word sentiment polarity by machine learning and based on the mutual characteristics model.
  • JIA Ze-Ju, DONG Lan-Fang
    Computer Engineering. 2010, 36(23): 197-198,201. https://doi.org/10.3969/j.issn.1000-3428.2010.23.065
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Face morphing animation is a computer animation of the important research. This paper realizes a color facial image autograded system. The system has better facial feature due to the multilayer adaboost algorithm for face detection presented and the morphing effect becomes improved and more table than the original morphing based on the cross fusion between color and gray for color images morphing technology presented. Experimental result shows that the use of the system is convenient and the improvement of the stability is obvious in the morphing.
  • MEI Ling, ZHANG E-Li
    Computer Engineering. 2010, 36(23): 199-201. https://doi.org/10.3969/j.issn.1000-3428.2010.23.066
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Kernels function is a new approach on dealing with the nonlinear problem. But for the data such as strings, graphs and protein which can not input directly, kernels for structured data can be used. This paper introduces the principle of function kernel, discusses a few kernels for structured data explicitly, and summaries the application of the kernels for structured data.
  • CHEN Xiang-Chao, CHEN Yu-Juan, LI Meng-Liang
    Computer Engineering. 2010, 36(23): 202-203,206. https://doi.org/10.3969/j.issn.1000-3428.2010.23.067
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    If the difference of intensity of noise and edge strength is not significant in image, Local Fuzzy Fractal Dimension(LFFD) can make noise larger. For this problem, EFFD algorithm which can reduce image noise availably is proposed. The improved algorithm uses fuzzy entropy to suppress the noise increased, and uses the fractal dimension to describe the image local characteristics. Through edge detection of the noise and saltpepper noise images, experimental results show that the algorithm can suppress the noise expanded to obtain better edge features in the noise image.
  • WEI Gong-Sheng, HE Jian-Nong
    Computer Engineering. 2010, 36(23): 204-206. https://doi.org/10.3969/j.issn.1000-3428.2010.23.068
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The application of wavelet transform in image fusion is carried out widely, but most of the methods often simply replace the low frequency components or weighed mean directly after the pyramid decomposition of wavelet. Thus it can not make good use of the low frequency information of the multisource image. In response to this status quo, this paper puts forward point sharpness method in the integration process of the low frequency components, and combines with the method of local energry in the high frequency part, makes an image fusion experiment of multisource remote sensing image by wavelet transform. Results show that fusion image improves in maintaining details and spectral information and also has good evaluation index.
  • DENG Cheng-Zhi
    Computer Engineering. 2010, 36(23): 207-208,211. https://doi.org/10.3969/j.issn.1000-3428.2010.23.069
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A multiscale ridgelet dictionary is constructed in terms of the perception character of human visual system and geometric properties of the local structures. The multiscale ridgelet dictionary is multiresolution, multiscale, anisotropy and multidirectional. It can provide sparser representation for image. Furthermore, a sparsity constrained image denoising algorithm based on multiscale ridgelet dictionary is proposed. Experimental results indicate that the proposed denoising algorithm can effectively reduce noise, and preserve the image edge details.
  • CUI Cheng-Zong, MA Han-Jie
    Computer Engineering. 2010, 36(23): 209-211. https://doi.org/10.3969/j.issn.1000-3428.2010.23.070
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For the characteristics of image texture, a weighted median filtering algorithm based on minimum spanning tree is proposed. It calculates pixel correlations according to minimum spanning tree, based on which it classifies pixels for the first time. After that, for the pixels that can not be classified, fuzzy theory is used to classify pixels again in order to detect characteristic of pixels. Different filters are used or original pixels are just preserved. Simulation results show this algorithm has much better effects than others in terms of denoising and retention of image details areas.
  • CHEN Mu-Sheng
    Computer Engineering. 2010, 36(23): 212-213,216. https://doi.org/10.3969/j.issn.1000-3428.2010.23.071
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A new image fusion method based on Curvelet transfrom and feature product is presented. Multiresolution decomposition of source images is obtained by Curvelet transform. The corresponding subband images by using different rules are fused, that is, the method based on average is used in low frequency components while high frequency components are fused by local feature product. The fused image is obtained by inverse Curvelet transform. Gradientbased Structural Similarity(GSSIM), Space Frequency(SF) and Peak Signal to Noise Ratio(PSNR) are used to evaluate the image fusion results. The new method is tested by multifocus images. Experimental results show the method can achieve a better fusion performance and is suitable for human vision system observation.
  • XUE Li-Xia, LI Chao, WANG Zuo-Cheng
    Computer Engineering. 2010, 36(23): 214-216. https://doi.org/10.3969/j.issn.1000-3428.2010.23.072
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The traditional edge detection algorithm based on morphology is poor in antinoise and detecting the details of the edge. In order to solve the problem, this paper proposes an adaptive antinoise edge detection algorithm based on morphology. The algorithm uses multiscale structural elements to remove noise, and then automatically selects the appropriate direction structural elements according to the direction of the edge to get more details of the edge. Experimental results show that the algorithm not only is a strong in antinoise, and can detect more edge details, but also is effective in improving the efficiency of the edge detection, so it is an effective edge detection algorithm.
  • HU Hua-Gang, HU Wen-Chao
    Computer Engineering. 2010, 36(23): 217-219. https://doi.org/10.3969/j.issn.1000-3428.2010.23.073
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Specific to the problem that traditional level set need constantly reinitialization and can not be directly applied to the video image segmentation problems, this paper presents a new video image segmentation algorithm. The new method uses the framedifference method based on the adjacent two images sequence to do pretreatment, and through morphological processing, a moving target template can be acquired. The template is used as the initial level set to go through new evolutions and to get the moving targets of the image sequence. Experimental results prove this method can get the exact location of moving targets, which avoids the constant reinitialization of the level set and reduces the computational complexity.
  • CHEN Dao-Ning, CHEN Yao-Wu
    Computer Engineering. 2010, 36(23): 220-222. https://doi.org/10.3969/j.issn.1000-3428.2010.23.074
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In H.264/AVC codec standard, deblock filter can reduce the block artifact. Because it is very complicated, optimization of the deblock filter is one of the key points of the H.264 codec’s optimization. The design is one part of the realtime H.264 standarddefinition codec software based on TITMS320DM6437. Except for the optimization of the block strength’s judging, the design offers a whole optimization plan by the feature of Davinci platform. Simulation result demonstrates high efficiency of the plan under the same PSNR.
  • WANG Xiao, DENG Yun, SHU Liu
    Computer Engineering. 2010, 36(23): 223-225. https://doi.org/10.3969/j.issn.1000-3428.2010.23.075
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Frame skipping is used to avoid the buffer overflow at low bit rates. But frame skipping without careless decision leads to incoherence or jump in sequence and influence the coding qualities. This paper proposes a frame skipping algorithm based on the picture importance. The algorithm allocates more bits to important P pictures according to their context complexity, and adaptively chooses some frames to skip based on the movement degree. To avoid the excess increment of target bit rate after frame skipping, one bit rate fresh algorithm is proposed to guard the stabilization of quality. Experimental results show that the proposed algorithm can reduce the number of the frame skipping with improved and steady PSNR at low bit rates.
  • FENG Fei-Long, CHEN Yao-Wu
    Computer Engineering. 2010, 36(23): 226-228,233. https://doi.org/10.3969/j.issn.1000-3428.2010.23.076
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at high definition video realtime encoding based on multicore system, an adaptive slice partition algorithm is proposed. Based on rate control and entropy encoding complexity model, the algorithm performs intraprediction for current frame to get the distribution of texture complexity, then predicts the distribution of computational complexity, and allocates resources evenly in multicore system through adaptive slice partition. Experimental results prove this algorithm significantly improves the parallel speedup compared to fixed macroblock slice partition.
  • QIU Wen-Wu, JIANG Jian-Zhong, TUN Qiong
    Computer Engineering. 2010, 36(23): 229-230,233. https://doi.org/10.3969/j.issn.1000-3428.2010.23.077
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the residual musical noise problem which is caused by the amplitude spectrum LOG_MMSE estimation algorithm at low SNR, this paper proposes a new speech enhancement algorithm based on energy entropy statistical model. The approximate solution is derivated. Weighting factors are dynamically adjusted according to the difference between entropy, to further improve the weak speech segment denoising effect. Experimental results show that the algorithm in the SegSNR improvement and the residual musical noise are better than the traditional amplitude spectrum LOG_MMSE algorithm.
  • GUO Qian, CHEN Yao-Wu
    Computer Engineering. 2010, 36(23): 231-233. https://doi.org/10.3969/j.issn.1000-3428.2010.23.078
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A parallel decoding strategy based on function modules of H.264 decoder is proposed to improve the choice of module in decoder parallelization, the bandwidth of modules and the reliance of data. The strategy organizes the function modules of H.264 decoder and divides them into three function groups. The strategy presents a threecore structure, realizes the three function groups on the threecore structure and lists the data reliance between those cores. The parallel decoding strategy improves in the complexity and data interaction between cores. Experimental results indicate the strategy improves in the parallelization, data interaction and the efficiency.
  • TAO Ai-Gong, SUN Meng-Zhe, TUN Jian
    Computer Engineering. 2010, 36(23): 234-236,239. https://doi.org/10.3969/j.issn.1000-3428.2010.23.079
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper describes the topdown design and implementation embedded microprocessor core HEUSoC1 of 16 bit Reduced Instruction Set Computer(RISC) architecture, it achieves twoport memory and zero latency access of instruction and data by using the large amount of onchip storage resources of Field Programmable Gate Array(FPGA). This characteristic guarantees that all of the instructions are executed in single machine cycle. HEUSoC1 is implemented at RTL level with Verilog Hardware Description Language(HDL). Fibonacci number calculation is programmed in assembly language to verify the validity of HEUSoC1. Resource utilization summary results show that the HEUSoC1 is resourceefficient, its highest processor frequency is approximate 22 MHz on the Xilinx Spartan2, and it is suitable for embedded application which demands low power consumption and high costperformance ratio.
  • CHEN Xiao-Hui, LIU Xiao-Sheng, SHU Qiao-Meng
    Computer Engineering. 2010, 36(23): 237-239. https://doi.org/10.3969/j.issn.1000-3428.2010.23.080
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    By researching Background Debug Mode(BDM) interface, this paper designs and realizes a debug system based on S12 serial Micro Controller Unit(MCU) which adopts USB2.0 interface to communicate PC with programmable debugger. It designs the functions of updating realtime value of registers, memory and variables, which help users to seek the location and find the mistakes in an efficient and intuitive way. It implements the breakpoint setting function, and offers efficient sentencebysentence debug and processbyprocess debug for programs with different sequence structures.
  • WANG Bao-Qing, MA Ti, TUN Wen-Jiang, QIN Cheng-Gang, DING Mo-Fu
    Computer Engineering. 2010, 36(23): 240-242,245. https://doi.org/10.3969/j.issn.1000-3428.2010.23.081
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem that RealTime Application Interface(RTAI) system can only schedule singletype task, this paper proposes a hybrid task scheduler. It supports Constant Bandwidth Server(CBS) schedule policy, associates soft realtime task with CBS server by using Linux Real Time(LXRT) mechanism, and schedules soft realtime task according to server schedule policy. Experimental results show that the scheduler ensures the normal operation of hard realtime tasks, and improves the service level of soft realtime tasks.
  • FENG Shen, LI Fu-Bing, CHOU Wu-Qing
    Computer Engineering. 2010, 36(23): 243-245. https://doi.org/10.3969/j.issn.1000-3428.2010.23.082
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A ground control station is designed and implemented to deal with the control complexity of unmanned miniature helicopter. The system can be used to control unmanned miniature helicopter remotely over the horizon system by joysticks, store and recurrence the tracks of the plane, and receive the aerial image. It can display flight attitude, location and operating status in real time by fusing the virtual model of miniature helicopter, the video images and sensor information. The developed system can meet the need of remote control of unmanned miniature helicopter, and it has intuitive feature.
  • XIN Qi, LI Shuang-Xun, NIAN Yong-Jian
    Computer Engineering. 2010, 36(23): 246-248. https://doi.org/10.3969/j.issn.1000-3428.2010.23.083
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper draws the threedimension mathematical model to estimate the position and pose parameters between spacecrafts by utilizing both circular projection and the method for circular projection detection. An approach for adjustment parameter measurement for spacecraft rendezvous based on circular projection detection is proposed. The adjustment parameter for the tracking spacecraft can be acquired directly, avoiding the arrangement for the special reference light point on the target spacecraft. It is more practical and feasible for spacecraft docking.
  • LIU Wei-Ning, CHEN Yao-Wu, ZHANG Lei
    Computer Engineering. 2010, 36(23): 249-251. https://doi.org/10.3969/j.issn.1000-3428.2010.23.084
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A software system, which can realtimely complete the 3D modeling of submarine sonar data and display is developed with VTK. The modeling process includes the realtime construction of the single frame and the realtime registration and mosaicing of a range of frames. The mosaicing module of a range of frames resolves the problem that as the number of frames increases, the mosaicing efficiency reduces. Test results show that this system can successfully complete the realtime visualization of sonar data and display it.
  • XUE Jian-Wei, ZHANG Jie, GUAN Yong
    Computer Engineering. 2010, 36(23): 252-254. https://doi.org/10.3969/j.issn.1000-3428.2010.23.085
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper provides two methods of Dynamic Partial Reconfiguration(DPR) based on EAPR flow and introduces the process of DPR through time/space share. By using the embedded CPU(Power PC405) on the board to control the other programmable logic resoures, a dynamic selfreconfigure is designed successfully. Both two methods are verified on the VirtexII Pro development system, which indicates that the DPR method can implement a much larger design using much smaller FPGA resources.
  • LIANG Kai, FANG Kang-Ling, HUANG Wei-Hua
    Computer Engineering. 2010, 36(23): 255-257. https://doi.org/10.3969/j.issn.1000-3428.2010.23.086
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the timevarying and nonlinear characteristic of batching control system, a fuzzy PI controller based on analytical structure is designed in the paper. With the definition of a fuzzy controller with difference space membership and sumproduct inference, the analytical structure of fuzzy controller is derived to adjust the parameters of PI controller according to the error and changeinerror of the flow rate. The analytical expression is used to program and realize the simulation of disk batching system. Simulation results show the fuzzy PI controller is efficient and practical.
  • YANG Miao, LIANG Wei, XU Wei-Jie
    Computer Engineering. 2010, 36(23): 258-261. https://doi.org/10.3969/j.issn.1000-3428.2010.23.087
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper expounds the industrial wireless network based on WIAPA and the overall design of the gateway. The architecture of the WIAPA gateway is given. It analyzes the software and hardware system of the gateway, divides the modules, and provides the design and process flow of the modules. It builds system to test gateway device, the test result indicates the design of gateway device is correct and reasonable.
  • YANG Zhou, ZHUO Lin, DIAO Peng-Peng, CUI Zhi-Meng
    Computer Engineering. 2010, 36(23): 262-265. https://doi.org/10.3969/j.issn.1000-3428.2010.23.088
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes an automatic extraction method for Product Data Record(PDR) of list page on Ecommerce website. According to the characteristics of the product records, it calculates value for each node in the DOM tree of page by the node type information of text, image, layout and so on, classifies these nodes according to their similarity of value, and gets the final node collection which contains data record, so that the data records of the whole page are extracted. Experimental results show that the method is effective and with high efficiency.
  • ZHONG Chu-Qin, MA Zhi, HU E-Jie
    Computer Engineering. 2010, 36(23): 266-267,270. https://doi.org/10.3969/j.issn.1000-3428.2010.23.089
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the relationship between quantum code corresponding to simple undirected graph and quantum stabilizer code, this paper gives the stabilizer of the constructed quantum stabilizer code by the matrix corresponding to the simple undirected graph, and proposes a construction method of quantum errorcorrecting code based on matrix method. It is proved that nonbinary quantum MDS codes [[9,5,3]]p and [[8,4,3]]p exist for all primes p>3 and [[9,3,4]]p exist for all primes p>7 by using matrix method.
  • LU Zhong-Yang, SUN Wei-Wei, MAO Ding-Ding, TUN Jing-Jing
    Computer Engineering. 2010, 36(23): 268-270. https://doi.org/10.3969/j.issn.1000-3428.2010.23.090
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Different service callers differ in considering preferences of QoS, especially in the environment of MANET. This paper presents a comprehensive QoS measurement model for MANET service. It considers multiple QoS metric attributions which influence QoS in MANET environment, and proposes a series of mathematic implements such as fuzzy mathematics, linear programming to compute QoS. Simulation experimental results prove practical and efficiency of the model in MANET.
  • LIN Jian, HUANG Die-Lun
    Computer Engineering. 2010, 36(23): 271-273. https://doi.org/10.3969/j.issn.1000-3428.2010.23.091
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To increase the printing speed of digital inkjet printer, this paper presents a highspeed data processing system based on MPC8548E and Xilinx Virtex5. In this system, the MPC8548E processor decodes the received encoded printing design paper data which receives from PC port by Gigabit net and transfers it to Virtex5 through RapidIO. Virtex5 has strong ability of realtime processing to transfer the processed data to print heads. Performance test results show that the data processing ability of the system is up to 320 Mb/s, and it is much higher than civil decorating machine under the same condition.
  • ZHOU Lin-Zhi, JI Jian-Dong, WANG Jian-Xin, SHU Li-Jun
    Computer Engineering. 2010, 36(23): 274-276,279. https://doi.org/10.3969/j.issn.1000-3428.2010.23.092
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Patent literature, as a special kind of document, including plenty of advanced technology, meanwhile it exists some problems such as management difficulties, isolation, low utilization. Reducing the isolation, achieving the interoperability between the patent and other journal is an effective way to improve the utilization of patent. A conceptual model for a category in classification is defined, mapping between International Patent Classification(IPC) and Chinese Library Classification(CLC) is established by calculating similarity. The method is based on semantic similarity of words which represent a category, and the effect from context is also took into account. Experiments show that the method can effectively improve the calculated accuracy.
  • ZHANG Xiao-Ning, SUN Yang-Yong
    Computer Engineering. 2010, 36(23): 277-279. https://doi.org/10.3969/j.issn.1000-3428.2010.23.093
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the basic idea of the box counting method, this paper uses Matlab mathematical platform, calculates the fractal dimension number of aggregate surface texture through surface profile curve corresponding to the graphics and graphical curve coordinate data. Koch curve is as a standard fractal dimension curve to go on calibration, it verifies the box count dimension of texture graphics feasibility calculations, and the greater of fractal dimension of the rock surface texture, the more complex of roughness.
  • DIAO Qiu-Lin, LIN Xiao-Feng
    Computer Engineering. 2010, 36(23): 280-282. https://doi.org/10.3969/j.issn.1000-3428.2010.23.094
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The task schedule strategy of the realtime operating system uC/OSII is improved according to the Open Systems and Corresponding Interfaces for Automotive Electronics(OSEK) OS specification. The determinant method of priority is modified to make a larger number represent a higher priority with number 0 as the lowest priority of task. And a mechanism of task management meeting the requirement of OSEK OS specification is put forward. The modified operating system supports multiple tasks within a same level of priority, which are scheduled in FIFO(First In First Out) order.
  • LIAO Cui-Ling, TU Zhao-Beng
    Computer Engineering. 2010, 36(23): 283-284,287. https://doi.org/10.3969/j.issn.1000-3428.2010.23.095
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper establishes a probabilistic model of A5/1 algorithm, analyzes Markov property, ergodic property and stationary of the internal state sequence, and computes the rate of coincidence between the output sequence and corresponding shift register output and clockcontrolled output sequences. Result shows that the clockcontrolled sequence is independence, and the output sequence of A5/1 algorithm is uniform and independent random variable sequences, it can resist relevant attack.
  • SUN Hui, YI Dui
    Computer Engineering. 2010, 36(23): 285-287. https://doi.org/10.3969/j.issn.1000-3428.2010.23.096
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the question that mutual interference exists between timehopping wideband signal based on pulse position modulation and other systems occupying the same band, several code construction methods that allow to place a notch or a zero in a expected frequency are introduced. The specific steps are given. Simulation results prove that spectrum can be controlled by timehopping sequence to some extent.
  • MA Wei, DENG Bing
    Computer Engineering. 2010, 36(23): 288-290. https://doi.org/10.3969/j.issn.1000-3428.2010.23.097
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Under the network environment for the application of virtual interaction, this paper presents a Virtual Interative Engine Model(VIEM) structural model, using multiAgent collaborative and mutual inductance 3D interactive interface standard for virtual reality system. The Agent database, interaction rule base, etc. and 4 core module structure database are provided. Through interactive database, virtual interactive subsystems are built, such as user input operation of perception, and a virtual interactive engine solution is given.

  • GANG Ning, HAN Guo-Dong, ZHANG Shen
    Computer Engineering. 2010, 36(23): 291-293. https://doi.org/10.3969/j.issn.1000-3428.2010.23.098
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The general mesh generation based on Network on Chip(NoC) does not consider the link power consumption, lead to the bigger warp in the total power consumption establish to the inner link structure system. Aiming at this problem, this paper proposes an improved mesh partition method, generates the corresponding NoC from the mapping process which is from the IP core to the route, and uses the existing system level plane planning graph to produce a symbolic mesh partition. Simulation result shows that the improved method not only gets lower link power consumption but also gets the lower total power consumption and smaller collision regions.