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

20 November 2010, Volume 36 Issue 22
    

  • Select all
    |
    Networks and Communications
  • SHAO Bin, LEI Tun, GU Ning
    Computer Engineering. 2010, 36(22): 1-6. https://doi.org/10.3969/j.issn.1000-3428.2010.22.001
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Data replication is widely used to hide network latency, enhance response time and improve interaction experience in real-time collaboration. Users can operate on data replicas unconstrainedly, which results in consistency maintenance problems of these replicas. Aiming at the problem, this paper introduces the challenges of consistency maintenance according to the features and requirements of real-time collaboration applications. By analyzing representative key techniques of operation transformation, address space transformation and WOOT, it elaborates the challenging problems such as Undo and String transformation, and details how these key techniques are applied in the transparent adaptation from single-user applications to collaborative ones, Web 2.0 and mobile collaboration environments.

  • DENG Han-Lin, HUANG He-Qing, TUN Meng-Juan, LIU Hai-Chao
    Computer Engineering. 2010, 36(22): 7-9. https://doi.org/10.3969/j.issn.1000-3428.2010.22.002
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    The distance between the target and the sensor has significant impact on the sensor’s sensing capacity. Recent study chooses distance as an important parameter to build sensing model, but ignores that sensor needs time to sense the target and process data. Aiming at this problem, this paper proposes an improved sensing model with temporal parameter. Compared with existing models, the model can capture the behavior of sensors more realistically meanwhile measuring the capacity of sensing moving target.

  • JI Ye, CHEN Yan, JUE Chi-Chi, ZHANG Lin
    Computer Engineering. 2010, 36(22): 10-12. https://doi.org/10.3969/j.issn.1000-3428.2010.22.003
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Aiming at the properties of E-commerce marketing, a knowledge-based tree-like representation is introduced to present the three factors of commodity recommendation model. The model is developed with Prolog language. It can interact data with database and individually recommend to a user based on what this user reviews in current step. The model is relatively independent. It shares the data with E-commerce system through database as interface, and can be widely adapted to different E-commerce systems.

  • CHU Qin, GAO Hua-Dong, WU Sen, CHEN Min, CHEN Hua
    Computer Engineering. 2010, 36(22): 13-14. https://doi.org/10.3969/j.issn.1000-3428.2010.22.004
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    In the light of the sensitivity of the order of data input by CABOSFV clustering algorithm, this paper puts forward a high attribute dimensional sparse clustering algorithm of the integration of sorting. The method of how to determine the two sets calculates the difference between two high dimensional sparse data sets in the first clustering, the algorithm complexity is reduced. The method improves the quality and efficiency of clustering. Simulation results of one groups of sample are given to illustrate that it can improve the quality of CABOSFV clustering.

  • CHENG Cheng, XIAO Wen-Shi, YUE Ji-Guang
    Computer Engineering. 2010, 36(22): 15-16. https://doi.org/10.3969/j.issn.1000-3428.2010.22.005
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    On the hypothesis of linear system, it is a typical process of blind deconvolution for the estimation of seismic wavelet and reflectivity sequence with the observations. As sensitivity to noise for Banded Independent Component Analysis(BICA), a method called Noisy Banded Independent Component Analysis(NBICA) based on Gaussian moment is proposed, with its robustness to noise. The information between adjacent seismic traces is used for wavelet extraction. Experimental result shows that the efficiency of the method is better.

  • WANG Shao-Hui, WANG Gao-Li
    Computer Engineering. 2010, 36(22): 17-19. https://doi.org/10.3969/j.issn.1000-3428.2010.22.006
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Mutual authentication mechanisms can be used in Radio Frequency Identification(RFID) systems to preserve the confidentiality of the RFID tags. In this paper, a passive attack is presented on a mutual RFID authentication protocol——ULAP(Ultra Light-weight Authentication Protocol), which is designed to resist passive attack. The attack shows that after eavesdropping a few numbers of round communication(expected number is 10), all the secret of the tag can be deduced. Therefore, ULAP can not resist passive attack.

  • ZHONG Ling, ZHANG Yun
    Computer Engineering. 2010, 36(22): 20-21. https://doi.org/10.3969/j.issn.1000-3428.2010.22.007
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To remove impulsive noise from color images, a ultra-fast Vector Median Filtering(VMF) method is proposed. In order to lower the computation of traditional VMF, the output of VMF is replaced by the nearest vector from the mean point in filtering window. Simulation experimental result shows that the method has almost the same performance with other new filters while lowering computation requirement and reduce the process time.
  • ZHANG Jing-Le, YANG Yang, GAO Ang, WANG Yuan-Zhuo
    Computer Engineering. 2010, 36(22): 22-25. https://doi.org/10.3969/j.issn.1000-3428.2010.22.008
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents a stochastic Petri net support for exception handling flexible workflow modeling and performance analysis method. It gives a few basic exception handling models, takes E-business Logistics Management System(ELMS) as an example, models based on the stochastic Petri net by SPN, analyzes the flexible system’s availability, reliability and other performance parameters. Results show that the method is effective.
  • WANG Cheng, DIAO Jin-Wei, YAN Gui-Rong
    Computer Engineering. 2010, 36(22): 26-28. https://doi.org/10.3969/j.issn.1000-3428.2010.22.009
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Aiming at the shortages of beforehand estimation method, this paper proposes a comprehensive statistical method to analyze and optimize the efficiency of algorithms. Comprehensive statistical method uses multiple monitors to measure the running time of algorithms afterwards, uses Admahl law and speedup performance law to lead improvement directions. Compared with beforehand estimation method, comprehensive statistical method doesn’t need to model the hardware and software platform on which algorithms run on, and it is much more simple, efficient and accurate in practice. It can give much more detailed advices on how to optimize the algorithm, and predict the efficiency of algorithm if the optimization advices are taken.

  • WANG Tian-Shu, WANG Xin-Yuan, DIAO Jian-Feng
    Computer Engineering. 2010, 36(22): 29-31. https://doi.org/10.3969/j.issn.1000-3428.2010.22.010
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper proposes a block chaotic cryptosystem based on Coupled Map Lattice(CML). The encryption order of the plaintext blocks is updated dynamically by certain rule. The updating order of sub-regions and the complex feedback association of different sub-regions make the law between plaintext and ciphertext more secret. All the chaotic maps used in the scheme are simple one dimensional. Both experimental results and comparisons with similar chaotic cryptosystems prove that the proposed cryptosystem has obvious advantages of security and high efficiency of encryption and decryption.

  • BANG Qing-La, ZHOU Yi-Ming
    Computer Engineering. 2010, 36(22): 32-33. https://doi.org/10.3969/j.issn.1000-3428.2010.22.011
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Probe selection plays an essential role in the procedure of designing oligonucleotide array. Considering the cost of synthesizing probes, the size of probe set becomes the most important criterion to evaluate the probe set. A good probe selection algorithm should produce a small number of probes as possible. This paper makes an improvement for the greedy algorithm of Herwig’s which is based on Shannon entropy as a quality criterion. The new algorithm is similar to the forward stepwise regression search algorithm. While adding the probes with maximal marginal effect, those probes with little marginal effect are dropped from the optimization set. Experimental results making on the data sets of HLA alleles show that the probe set produced by the algorithm is superior to the probe set selected by greedy algorithm.

  • HU Qiang-Wu, ZHOU Xiang
    Computer Engineering. 2010, 36(22): 34-36. https://doi.org/10.3969/j.issn.1000-3428.2010.22.012
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    In order to construct a high efficiency path finding engine for the on-line map service, a shortest path search algorithm based on spatial block path cache and index is presented. A road network resample processing is proposed to obtain a road network density image and a block algorithm based on ISODATA clustering is presented to calculate the road network spatial block region. The path cache between road network block regions is calculated to reduce the path finding node number between block regions. An index algorithm to the path cache is designed. A bi-direction path search algorithm based on the path cache and path search in block region is presented. Experimental result of on-line path search shows higher efficiency comparing with the traditional path search algorithms which can reduce the on-line path calculation time less than 0.2 s for a city level road network. It can also obtain load balance of the map application server.

  • CHENG Hai-Yang, XIE Jiang, SHAO Hua-Gang
    Computer Engineering. 2010, 36(22): 37-39. https://doi.org/10.3969/j.issn.1000-3428.2010.22.013
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    On the basis of Metis package to decompose domain, this paper combines with row compressed storage mode of large sparse matrix, develops the parallel finite element program according to preconditioned conjugate gradient method for solving finite element equations. Through the calculational simulation to the 3D geological model established, the displacement field simulation result of Zhangdian-Renhe near-fault endangered field indicates that the procedure has a good parallel speedup.
  • QU Yi-Lin, WANG Wen-Hai
    Computer Engineering. 2010, 36(22): 40-42. https://doi.org/10.3969/j.issn.1000-3428.2010.22.014
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents a Swinging Door Trending(SDT) algorithm for the process data compression. By adjusting the key parameter in process data compression, compression error is controlled in the range of permission, so the accuracy is well ensured and the compression ratio is greatly improved. Compared to SDT, compression ratio can increase by 60% to 75% and the absolute difference between actual error and the expected error can limit on 10-3 orders of magnitude. The algorithm has important engineering significance, the validity of which is proved by testing and running on the UWnTek platform.
  • YUAN Zheng-Wu, CHENG Yu-Xiang, LIANG Jun-Jun, LI Lin
    Computer Engineering. 2010, 36(22): 43-45. https://doi.org/10.3969/j.issn.1000-3428.2010.22.015
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a new method based on the stream-cube architecture, which is used to deal with relational data stream model. In this algorithm, a dynamical process creates stream-cube to save recent data stream, which continuously arrives with time sequence. Based on the architecture with an analyst’s query, this algorithm can find all of frequent patterns in data stream fast among all dimensions. At last, the analysis and experiments show that this method has good performance.
  • QUAN Jia-Hui, ZHANG Huan-Huan
    Computer Engineering. 2010, 36(22): 46-48. https://doi.org/10.3969/j.issn.1000-3428.2010.22.016
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    FeaVer is used to perform a formal verification of source codes of MINIX 3 file system, and the error codes are found. In the procedure of verification, the concept of test harness is introduced, whose characteristics are efficient and reproducible. The original model based on the verification results is modified and a new model is built. It is verified that the new model conforms to the correctness property specified. The source files of MINIX 3 are upgraded according to the new model to make the operating system more reliable.
  • SHU Xiao-Juan
    Computer Engineering. 2010, 36(22): 49-51. https://doi.org/10.3969/j.issn.1000-3428.2010.22.017
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The efficiency of structural join directly influences the function of the XML query. The classical Anc-Des-B+algorithm’s ability of skipping the descendant codes(not child) is not effective when judging the parent/child relationships. Based on the idea of extended region coding, this paper puts forward a kind of improved method which codes every node into a group of 6 elements including the parent’s information. It also puts forward the ZParent algorithm which can skip all nodes that don’t participate in join and can carry out join calculation with only one time to scan the P list and C list. Experimental result shows that the method has better time function.
  • CENG Li-Jun, LI Ze-Jun, LIU Jia-Gang
    Computer Engineering. 2010, 36(22): 52-54. https://doi.org/10.3969/j.issn.1000-3428.2010.22.018
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    An algorithm of interborough fuzzy C-means clustering based on matrix-weighted association rule is presented. The method constructs the association rule about the matrix by supports and trusted degree, and conducts the interborough fuzzy C-means clustering based on association rule. It can adjust the affecting factors of interval data a, according to the size of swatch data, so that it can attain optimal cluster. It has much accuracy than the traditional algorithm with fewer text data(eg k-means), and efficiency is improved with multi dimensional data. Theoretic analysis and experimental demonstrations show that the algorithm outperforms existing algorithm in clustering quality and efficiency.
  • HU Xiao-Dong, LI Ke, SHU Shi-Rui
    Computer Engineering. 2010, 36(22): 55-57. https://doi.org/10.3969/j.issn.1000-3428.2010.22.019
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper researches the method of discovering Repeated Continuous Frequent Access(RCFA) paths from Web logs. For some problems of existing mining algorithms, matrix is applied to the process of mining in this paper, it proposes conception of CA matrix and discovers repeated continuous frequent access paths by the CA matrix, thereby it has no need to scan database repeatedly and avoids a great deal of intermediate items. To some extent, it simplifies the process of mining. Experiment indicates the accuracy and high efficiency of the algorithm.
  • LI Zhi-Jiang, SHAO Pei-Na, SHU Hui
    Computer Engineering. 2010, 36(22): 58-60. https://doi.org/10.3969/j.issn.1000-3428.2010.22.020
    Abstract ( )   Knowledge map   Save

    In order to generate test cases set that satisfies the requirements of test, a method about generating test cases from UML sequence diagrams is put forward. By analyzing the functions use cases of system to be tested, a sequence diagram is modeled. The process of test cases generation based on this sequence diagram comes. Some constraint is added to the diagram. A scenario tree can be created by parsing it. The input, respected output, constraint and scenario context are generated through a traversing of the scenario tree, and these four also constitute the test case. The paper analyzes and summarizes the problems that how to deal with complex sequence diagrams and satisfy the sufficiency of test cases, and also brings the corresponding effective solutions.

  • YUE Hai-Chao, LI Jie, XIAO Lin-Lin
    Computer Engineering. 2010, 36(22): 61-63. https://doi.org/10.3969/j.issn.1000-3428.2010.22.021
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    A new algorithm based on address index called NABOAI is put forward. By using IMFI matrix, it saves the order when the item next appears in the current item which belongs to current candidate item so as to achieve the spanning type search for frequent pattern. Experimental results show that, compared with Boolean matrix algorithm, the new algorithm reduces the access of transaction greatly.

  • LIN Li, HU Xia, SHU Dun-Pan
    Computer Engineering. 2010, 36(22): 64-65. https://doi.org/10.3969/j.issn.1000-3428.2010.22.022
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper proposes a multi-document summarization method based on spectral clustering. Based on clustering topic-relevant sentences in the documents together, this method creatively takes the importance of each class into consideration, along with sentence position, length and other factors to obtain the score of importance of the sentences. The sentences are sorted according to the score and extracted that meet the requirement of number of words as the summarization. Experimental results show that this method performs better than traditional methods and can improve the quality of summarization effectively.

  • SHU Wei-Guang, ZHONG Zi-Fa, MA Cha
    Computer Engineering. 2010, 36(22): 66-68. https://doi.org/10.3969/j.issn.1000-3428.2010.22.023
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper introduces the principle of the Apriori algorithm which is the classical algorithm of association rules mining, and proposes an improved Apriori algorithm――Equivalence class-Apriori(Ec-Apriori) algorithm which aims at the disadvantage of Apriori algorithm. It adopts a partition method and partitions the database into some independent databases according to the support of frequent 1-itemsets. It generates the candidate itemsets by adopting equivalence class in separate databases and optimizes the join operation, and simplifies the account of support by bit object, so it is more efficient. Experimental result shows that the Ec-Apriori algorithm outperforms Apriori algorithm, and gets a good practicality.
  • DOU Ceng-Jie, WANG Shen-Yu, TAO Wei-Beng, CHEN Nan, TU Xian
    Computer Engineering. 2010, 36(22): 69-71. https://doi.org/10.3969/j.issn.1000-3428.2010.22.024
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    The abstract memory model and the abstract run-time environment of executable code are described. The data flow analysis is given and the correctness and computability of data flow analysis are ensured based on abstract interpretation theory. Abstract interpretation is used to propagate the variable value range information through the generic monotone dataflow framework. New methods to automatically compute the maximal counts of iterations of the loops and to identify the infeasible paths are presented. The example of analyzing program’s data flow is given.

  • DAO Ye, CENG Zhi-Yong, TU Jian-Kun, FENG Chao
    Computer Engineering. 2010, 36(22): 72-74. https://doi.org/10.3969/j.issn.1000-3428.2010.22.025
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyzes classical k-means clustering algorithm, proves the way that generated complete global clustering information from the local clustering information in the case of minimizing the cost of communication between computing nodes. The clustering quality of the way is equivalent to the corresponding serial algorithm, and has higher efficiency in the implementation. On this basis, this paper gives a credible parallel k-means algorithm based on Message Passing Interface(MPI). Experimental result shows that the algorithm is efficient and feasible.
  • AI Wei, SUN Si-Meng, ZHANG Feng
    Computer Engineering. 2010, 36(22): 75-77. https://doi.org/10.3969/j.issn.1000-3428.2010.22.026
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the disadvantages that traditional Web text mining technologies lack capability of ontology understanding, this paper proposes and implements a Web text mining model based on ontology. It uses a concept vector space model based on ontology instead of traditional vector space model to represent the documents. Besides, an integration information retrieval design is proposed on the foundation of text mining.
  • SANG Yin-Bang, WANG Cheng-Liang
    Computer Engineering. 2010, 36(22): 78-80. https://doi.org/10.3969/j.issn.1000-3428.2010.22.027
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper introduces an XML data exchange technology based on DOM processing model, and analyzes the relationship between XML document nodes and structured data. It uses plane file in plan system to save XML data files, makes use of VBA and macro which Office itself has at the same time. It presents a way of data restore and data exchange that is suitable with for unprofessional software makers developers to complete the redevelopment of Office. The method achieves automatically filling limited items of table, modification and checking, and it is applied to the production of the requisition in the scientific research project.
  • ZHOU Hong, LIU Jin-Ling
    Computer Engineering. 2010, 36(22): 81-82. https://doi.org/10.3969/j.issn.1000-3428.2010.22.028
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    According to the characteristics of short message text, a clustering method of the Chinese message based on density is given. High-density region of the text data is divided into clusters and a seed queue is constructed, which is arranged in ascending order of the reachable similarity, to store the text of short message text to be expanded. The text message is disposed in a specific order. In order to make higher-density clusters to complete first, the object is selected according to a greater threshold similarity, namely that the dense space text object which can be rapidly located makes the high-density cluster complete first. Experimental result shows that this clustering method’s efficiency is increased 10 times of K-means method.

  • WANG Bin
    Computer Engineering. 2010, 36(22): 83-85. https://doi.org/10.3969/j.issn.1000-3428.2010.22.029
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents a secondary mining algorithm for entity recognition. It extends link mining techniques, using linked vertex as features of edges and definite edge similarity. A fast entity recognition algorithm can be designed. As IM user tends to communicate with fixed community, community is mined and contracted to vertex. The fast entity recognition algorithm is used to improve accuracy. Experimental results show it is effective and feasible.
  • ZHANG Ru-Qin, CHEN Dong
    Computer Engineering. 2010, 36(22): 86-87. https://doi.org/10.3969/j.issn.1000-3428.2010.22.030
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    A method called AFMI based on a transaction matrix is proposed to mine the maximum frequent itemsets. The frequent itemsets are obtained from all the transactions by means of condensing iteratively the transaction matrix, the transaction vector intersections are acquired to reduce the range of search. Logical operations and pruning methods are adopted to improve the efficiency of the mining. Based on AFMI, an algorithm called AFMI+ is proposed, which can mine maximum frequent itemsets from a sliding window over data streams. AFMI+ can get the maximum frequent itemsets in current sliding window over data streams just when users need to get them periodically. Experimental result shows that AFMI and AFMI+ algorithms have better performance.

  • HUANG Feng-Hui, WANG Juan, SHU Yan-Qin, JI Ji-Jin
    Computer Engineering. 2010, 36(22): 88-90. https://doi.org/10.3969/j.issn.1000-3428.2010.22.031
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Almost all existing schedule strategies only schedule data requests at request peers, and adopt simple response strategies such as First Come First Service(FCFS) or Early Deadline First Response(EDFR) at response peers. The drawback is that the high priority data requests may not be given priority to, when peers response to data requests. So that data schedule can not achieve the expected target. This paper takes the urgency and rarity of the request data blocks, as well as the bandwidth of request peers into consideration, and proposes a Data schedule Strategy Based on Response Control mechanism(DSBRC). Compared with the existed data schedule strategies, DSBRC can enhance the utilization of upload bandwidth of the system, at the same time, shorten the start-up delay and improve the playback quality of peers.
  • YANG Guang-Song, GENG Xu
    Computer Engineering. 2010, 36(22): 91-93. https://doi.org/10.3969/j.issn.1000-3428.2010.22.032
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes an energy-efficient route finding scheme based on the directional antenna in Wireless Sensor Network(WSN). This paper derives the relationship between the number of hops and the energy consumption within a certain source-destination distance by analyzing the major factor influencing the power consumption on wireless channels. Combined with the benefits from directional antennas, it proposes an energy-efficient routing scheme which selects the next hop according to the optimal route and geographic coordinates of sink and sensors. Simulation result shows the significant improvement by reducing the flooding cost, selecting an energy-efficient route and saving energy.
  • ZHANG Wei-Wei, DIAO Zhi-Jin, WANG Hai-Quan
    Computer Engineering. 2010, 36(22): 94-96. https://doi.org/10.3969/j.issn.1000-3428.2010.22.033
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Three basic types of spectrum handoff scheme in Cognitive Radio(CR) network are described by using channel reservation mechanism, which is proposed by draft standard of IEEE 802.22. This scheme decreases blocking probability of switching with the cost of new-call blocking probability. To reduce the cost, a method with buffering for the new call is proposed. Two-dimensional Markov model and queuing theory are used to obtain its state transition graph. Numerical results show that, with the performance of switching guaranteed, the proposed method can greatly reduce the blocking probability of new call and the value of Grade of Annoyance(GoA).
  • XU Ai-1, ZHANG Wei, ZHOU Yuan, JIAN Hai-Feng
    Computer Engineering. 2010, 36(22): 97-99. https://doi.org/10.3969/j.issn.1000-3428.2010.22.034
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problems in IP allocation in MANET, this paper brings up the buddy-chain system which takes the advantage of binary tree with a weighted approach to gracefully overcome the difficulties in IP recirculation and uneven IP allocation of MANET. It proves the evenness by analyzing the relationship between a single node and its neighbors while studying the robustness through a statistical model for the number of on-line nodes in unit time. It evaluates the communication cost and the outcome is O(21/n)~O(lb(n)?21/n).
  • TANG Yong, ZHOU Man-Yuan
    Computer Engineering. 2010, 36(22): 100-102. https://doi.org/10.3969/j.issn.1000-3428.2010.22.035
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In Ad hoc network, the unfairness between nodes affects the entire network performance. This paper presents a fairness algorithm——UTRVB. The algorithm is applied to the nodes join or out of the Ad hoc network, and can adjust the backoff time by the amount of nodes and the size of the reference value. Simulation result shows that the algorithm can greatly improve DCF protocol fairness without affecting the system throughput in a serious decline.
  • BO Yun-Xia, JI Chang-Feng
    Computer Engineering. 2010, 36(22): 103-105. https://doi.org/10.3969/j.issn.1000-3428.2010.22.036
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyzes the traditional AODV routing protocol and the present energy research program. Based on this, it presents a new energy strategy from the node’s residual energy to improve AODV. Simulation results in NS2 show that the improved AODV can reduce the routing overhead, increase the delivery ratio and network lifetime, and play a good balance of flow role.
  • LIU Li-Qin, WANG Bao-Yun, ZHANG Li
    Computer Engineering. 2010, 36(22): 106-107. https://doi.org/10.3969/j.issn.1000-3428.2010.22.037
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper researches the performance of MT-MFSK signals in correlated Nakagami fading channels which include the following items. The correlated random variables is transformed into the weighted sums of independent variables using the Cholesky decomposition of the covariance matrix of the channels. The approximate probability density function of SNR, the approximate conditional error probability and the average union bound on the probability of symbol error is derived. Results of Matlab experiment show that the proposed average probability of symbol error is efficiency, the performance of the MT-MFSK system is better than the conventional MFSK system in terms of power and bandwidth efficiency.
  • LI Tie-Bei, WANG Li-Meng, WANG Xue-Yu
    Computer Engineering. 2010, 36(22): 108-110. https://doi.org/10.3969/j.issn.1000-3428.2010.22.038
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Establishing bi-directional tunnel for data transmission leads to the transmission path is non-optimal in Proxy Mobile IPv6, and in the existing strategy route optimization lagged behind the procedure of binding update with the fault of large signaling load. Aiming at these problems, this paper presents a ROE-based light weight route optimization strategy, which is in parallel with the binding update. Experimental result using fluid-flow mobility model indicates that the packet overhead is small and route optimization efficiency is high, especially suitable for low-speed movement of Mobile Node(MN).
  • LI Yu-Ling, LIU Yu-Hua, HU Kai-Hua, BO Hua-Jiang
    Computer Engineering. 2010, 36(22): 111-112. https://doi.org/10.3969/j.issn.1000-3428.2010.22.039
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Aiming at “free-rider” phenomenon in P2P network, a new balance mechanism in which the control point is on the service providers nodes is proposed. This mechanism promises the existence of free-riders in certain degree and the inconsistency of topology is considered fully. Experimental results prove that this balance mechanism is able to use network resources effectively, and also can restraint the serious free-rider behavior.

  • LIU Wei, ZHANG Ge, ZHANG Wei, LI Wei
    Computer Engineering. 2010, 36(22): 113-115. https://doi.org/10.3969/j.issn.1000-3428.2010.22.040
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a new routing protocol named OLSFR to promote the mobile Ad hoc UAV network with high-speed moving nodes and frequently changing topology. The OLSFR protocol forecasts the link state between two mobile nodes. It uses a new constraint parameter in finding the Multi Point Relay(MPR) set to optimize routing choose and improves the integrated performance. Simulation results show that compared with other relative routing protocols such as OLSR and DSDV, OLSFR protocol can get much better integrated performance in the success ratio of data packet delivering and the end-to-end delay.
  • TANG Yun-Jian, DAN Wei-Ren, YI Jun, WANG Yan-Xia
    Computer Engineering. 2010, 36(22): 116-118. https://doi.org/10.3969/j.issn.1000-3428.2010.22.041
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    In application of data gathering in Wireless Sensor Network(WSN), the moving Sink will break the routing at last hop, and reconstruction of the routing is a heavy spending. This paper proposes a local routing maintenance mechanism for mobile Sink. It makes use of power control to reduce the routing break and conditional refresh of the entire routing to reduce the broadcast packet, delay and energy consumption. Sink's mobile performance is increased via power control.

  • HONG Xiang, ZHANG Chao, ZHANG Jun
    Computer Engineering. 2010, 36(22): 119-121. https://doi.org/10.3969/j.issn.1000-3428.2010.22.042
    Abstract ( )   Knowledge map   Save
    When the active TCP connections change dramatically, BLUE algorithm will suffer from a large range of queue size oscillations. In order to keep the queue length more stable and stabilize faster, this paper proposes an improved BLUE algorithm——FSBLUE(Fast Stabilized BLUE). FSBLUE algorithm uses the network parameters to adjust the amount by which the mark(or drop)probability is changed, moreover it estimates the mark(or drop) probability to make the response fast. Simulation results show that FSBLUE algorithm stabilizes the queue length better than BLUE algorithm.
  • LIU Yi-Ning, CAO Jian-Yu, XIE Dun, DING Yong
    Computer Engineering. 2010, 36(22): 122-124. https://doi.org/10.3969/j.issn.1000-3428.2010.22.043
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Based on Diffie-Hellman public key distribution system and a sealed lock, this paper proposes an improved conference key distribution scheme. Theory analysis proves that the scheme has good scalability, provides anonymity of the conference group members, and can prevent passive attacks, replay attacks and forgery attacks. With the scheme, the group members can verify if they are invited to attend the conference. Compared with the previous schemes, the scheme is less computational.
  • LIU Meng-Sheng, SUN Shu-Jing
    Computer Engineering. 2010, 36(22): 125-128. https://doi.org/10.3969/j.issn.1000-3428.2010.22.044
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents an information security risk assessment model based on Wavelet Neural Network(WNN) and Entropy-weighted Grey Association(EGA), in order to overcome subjectivity in man-made distributing weight for traditional information security risk assessment. Using WNN can get the value of risk events and the statistical risk profile of each entity, using EGA can gain the sort of risk profile of each entity and can calculate the average risk level of the overall system to achieve the purpose of evaluating effectively information system security risk.
  • GAO Wen-Jie, DIAO Feng-Yu
    Computer Engineering. 2010, 36(22): 129-131. https://doi.org/10.3969/j.issn.1000-3428.2010.22.045
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyzes attack scene, attack features of oversized cryptography and Simple Object Access Protocol(SOAP) message feature of oversized cryptography in Web service, and presents an oversized cryptography attack detection algorithm based on SOAP message. Encryption frequency is counted by detecting the number of attribute in the label of ReferenceList. Then, encryption frequency and the predetermined value are compared to determine oversized cryptography is included or not. The validity of detection algorithm is tested on Web service platform of Microsoft .net WSE.
  • HUANG Mei-Juan, HU Jiang-Gong, ZHANG Jian-Zhong
    Computer Engineering. 2010, 36(22): 132-133. https://doi.org/10.3969/j.issn.1000-3428.2010.22.046
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In the multi-secret sharing scheme, several secrets can be shared during one secret sharing process simultaneously. The previous multi-secret sharing schemes are based on the Lagrange interpolating polynomial. In this paper, using the “ ” operation in arithmetic, a simple multi-secret sharing scheme based on the difficulty of factoring the RSA modulus is proposed. The features of the scheme are that the computation is fast and the operation is simple. The participants can share many secrets one time and each one of them only holds one shadows which can be reused after the shared secrets have been recovered. The dealer and the participants’ cheating are resisted. The secret channel is not provided in this scheme.
  • LIANG Jian-Wu, LONG Xiao-Mei, LIU Jun-Jun
    Computer Engineering. 2010, 36(22): 134-136. https://doi.org/10.3969/j.issn.1000-3428.2010.22.047
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The firewall policy is a sequence of rules set, so it is very important to make the firewall work well and it must be without any conflicts. This paper introduces a description method based on LE-Trie data structure for firewall policy conflict detecting. Simulation result shows that using the LE-Trie storage rule table to describe the firewall policy can use less memory than the ordinary ones, and it can get a higher search speed as detecting conflicts.
  • LUO Zhao-Long, FEI Ting-Rui, SU Jie, GUO Yan-Xia
    Computer Engineering. 2010, 36(22): 137-139. https://doi.org/10.3969/j.issn.1000-3428.2010.22.048
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The security of Ad hoc network is a prominent problem. This is exactly the obstacle that the Ad hoc network develops to commerce field. This paper proposes a kind of safety strategy ISAODV on identity-based cryptosystem based on the AODV route algorithm. The identity-based cryptology does not need a certificate in system while the user’s identity such as name, IP address, E-mail address etc can be used as the public key and the public key certificate does not need to be stored. The simulation proves that the ISAODV can simplify the miscellaneous and trivial administration process of the secret key on certificate-based password system.
  • LI Yi
    Computer Engineering. 2010, 36(22): 140-142. https://doi.org/10.3969/j.issn.1000-3428.2010.22.049
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To improve security in wind turbine remote access, this paper proposes the security technology in wind turbine cross-domain access based on the commonly used Supervisory Control And Data Acquisition(SCADA) systems for wind turbine. This technology is based on MD-RBAC model, which implements various access control functions for validity constraint. It designs the security management mechanism in cross-domain access based on these functions, and implements the cross-domain remote access system based on B/S architecture with DevFx.
  • JIAO Xiao-Lin, ZHANG Jian-Zhong
    Computer Engineering. 2010, 36(22): 143-144. https://doi.org/10.3969/j.issn.1000-3428.2010.22.050
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Based on Shamir’s threshold scheme and the RSA cryptosystem, a dynamic threshold multi-group-secret sharing scheme is proposed. In the proposed scheme, the dealer can adjust the threshold value depending on the secure level of different sharing value, so m groups of secrets can be shared among n participants. The shadows of other participants do not need to be changed when a participant is added or deleted. Anybody is allowed to check whether a cooperative participant provides the true information or not in the recovery phase, and it doesn’t need to design special verification algorithm.
  • BO Pan-Feng
    Computer Engineering. 2010, 36(22): 145-146. https://doi.org/10.3969/j.issn.1000-3428.2010.22.051
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The security of digital signature scheme based on NTRU public key cryptosystem relies on the difficulty of searching nearest and shortest vector on NTRU metre. Aiming at this problem, this paper improves the signature process, and gives the attack method for forge signature under the same parameters. It can go on effect signature for arbitrary message with great probability, and prove this signature scheme is not secure.
  • ZHANG Meng-Xun, ZHANG Chan, JIANG Jia
    Computer Engineering. 2010, 36(22): 147-149. https://doi.org/10.3969/j.issn.1000-3428.2010.22.052
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper presents a semi-fragile digital watermark algorithm which embeds the level-line, a kind of character of image, into the Discrete Wavelet Transform(DWT) domain. By considering the masking characteristics of the Human Visual System(HVS), it solves the problem between transparency and robustness. To improve the safety, it makes an Arnold transformation to the watermark before embedding. It does not need the original image when extracting the watermark, and the original watermark is not necessary when detecting and locating tampered areas. Experimental results show that the algorithm has good invisibility and high robustness against non-malicious attacks, and it can locate the tampered areas roughly.

  • YANG Tian-Yang, HUANG Jian-Hua
    Computer Engineering. 2010, 36(22): 150-152. https://doi.org/10.3969/j.issn.1000-3428.2010.22.053
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    As an emerging security mechanism, intrusion tolerance systems desire an effective method for performance evaluation. In view of practical application, this paper provides a novel quantification method by embedding Continuous Time Markov Chain(CTMC). On the other hand, it splits the security to three attributes, so as to analyze the defence and the tolerance of intrusion tolerance systems more directly. Some simulation results are presented to verify this method.
  • LIU Yong-Lei, JIN Zhi-Gang
    Computer Engineering. 2010, 36(22): 153-154. https://doi.org/10.3969/j.issn.1000-3428.2010.22.054
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper introduces Wired Equivalent Privacy(WEP) protocol and RC4 used in WEP. Crrent researches in the method of attacking WEP protocol including chopchop, fragmentation attack, FMS attack and PTW attack are described. The attack principles are discussed respectively, and the root cause of attacking WEP successful and the necessity of switching to WPA/WPA2 are illustrated. These researches are analyzed and concluded.
  • DAO Wei-Cheng, LI Zhi-Yong, LI Hou-Fu
    Computer Engineering. 2010, 36(22): 155-157. https://doi.org/10.3969/j.issn.1000-3428.2010.22.055
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a reversible and blind database watermark method based on polar angle expansion. Using key as a pseudo-random number seed produces pseudo-random numbers to select the watermark embedding position. It maps these attributes to polar coordinates one by one, and embeds watermark into those points extending polar angle. It uses logistic chaotic sequence encrypt watermark to improve watermark security before watermark embedding. In order to achieve blind detection, using Least Significant Bit(LSB) method to extract the watermark. Experimental result indicates that this method has a high robustness for subset change, subset selection and subset adding attack, and also can recover the original data really.
  • LI Tian-Hua, JU Yan-Li, TANG Xian-Jian, CHEN Chao, OU Qi-Biao
    Computer Engineering. 2010, 36(22): 158-159. https://doi.org/10.3969/j.issn.1000-3428.2010.22.056
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper uses two kinds of infection mechanisms including the same infection probability of all nodes and different infection probability according to different edge weight of nodes adopted to BBV weighted network for immunization simulation. Study finds the nodes betweenness-first immunization effect is better than the intensity-first immune which is widely used at present, the edge betweenness-first immunization strategy is better than the other edge-immunization strategy. It adopts the different immunization strategy under the different infection mechanism, and gets the different effect. It is more effective to control the increase speed of virus at the first stage when adopts different infection probability according to different edge weight of nodes.
  • MENG Qiang-Duan, LV Dong-Wei, LIANG Jie-Hua
    Computer Engineering. 2010, 36(22): 160-162. https://doi.org/10.3969/j.issn.1000-3428.2010.22.057
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper proposes an improved Aho-Corasick_Boyer-Moore-Horspool(AC_BMH) algorithm, which utilizes double-character skip for both larger pattern strings mismatching possibility and further jumping distance, and combines Quick Search(QS) algorithm for even longer jumping distance when pattern strings matching fails. Compact storage mechanism is employed to decrease the amount of memory usage. Experimental results show that the matching speed of string is improved about 29%~52% with the improved algorithm, and the amount of memory used reduces about 90% when many pattern strings exist.

  • JIANG Yi-Ming, LIU Qing-Li
    Computer Engineering. 2010, 36(22): 163-164. https://doi.org/10.3969/j.issn.1000-3428.2010.22.058
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper analyzes Windows 7 secure boot technology. It researches the boot flow of BitLocker drive encryption based on trusted computing. Aiming at the BitLocker and Bootmgr secure vulnerabilities in the implementation process, BitLocker and Bootmgr circumvention schemes and Address Space Layout Randomization(ASLR) coping scheme are designed in order to prove that the secure boot measure of Windows 7 can still be broken through by malicious software such as Bootkit.

  • ZHENG Jian-Zhong, ZHOU Shi-Jie, WANG Juan
    Computer Engineering. 2010, 36(22): 165-167. https://doi.org/10.3969/j.issn.1000-3428.2010.22.059
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the recognition of abnormal data flows, this paper proposes an establishment method of K layers abnormal features model based on NetFlow, whose conception is described in detail, in addition to its realizable method. It updates the data of K layers features pattern and adjusts their multilayer PRI. Experimental result shows the method can quickly detect abnormal net-flows, obviously reduce the matching times and improve matching efficiency.
  • XU Jin-Song, HUANG Ru-Cheng, HUANG Wan-Meng
    Computer Engineering. 2010, 36(22): 168-169. https://doi.org/10.3969/j.issn.1000-3428.2010.22.060
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper proposes a novel Deterministic Packet Marking(DPM) scheme to trace the cross-regional source of Distributed Denial of Service(DDoS) attack. It adopts a packet marking algorithm inspired by CRT, and combines DPM-RD scheme to achieve better performance. Theoretical analysis and simulations reveal that the increasing number of attacks do not effect the false positive rate significantly, and compared with similar schemes, the scheme can reconstruct attack path in a comparatively short time with less packets.

  • BANG Jian, WANG Xiao-Ling
    Computer Engineering. 2010, 36(22): 170-172. https://doi.org/10.3969/j.issn.1000-3428.2010.22.061
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Through the method of association rules is analyzed, an improved algorithm in association rules of the intrusion detection record based on Cluster Matrixes(CM) is put forward. The algorithm can get the new frequent itemsets through searching the updated data once again, when the database and the minimum support degree are changed. Studies and analysis of the algorithm show that it can not only scan the database once, but also has the virtues in high-speed producing frequent k-itemsets, less time cost. And it improves the efficiency of the association mining, can fulfill the request of the real time system and apply to intrusion detection system.
  • TUN Ying-Bin, MENG Xian-Meng, CHEN Han-Ning
    Computer Engineering. 2010, 36(22): 173-174. https://doi.org/10.3969/j.issn.1000-3428.2010.22.062
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A symbiotic multi-swarm coevolutionary optimization algorithm named SMSO(Symbiotic Multi-Species Optimization) is presented for multi-objective economic power dispatch problems such as environment protection and power cost. The effectiveness of SMSO is demonstrated with the IEEE 30-bus system, and the results demonstrate the better Pareto front, the computation complexity reduction and the convergence efficiency improvement of the proposed algorithm.
  • CA Wei-Ling, CHEN Dong-Xia
    Computer Engineering. 2010, 36(22): 175-177. https://doi.org/10.3969/j.issn.1000-3428.2010.22.063
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper discusses the influence of three data normalization methods on the performance of K-Nearest Neighbor(KNN) classifier. The simulation results on the 12 real-life benchmark datasets and 1 artificial dataset show that on most datasets, the data normalization methods can enhance the recognition rate of KNN classifier. Motivated by these results, it explores why the data normalization methods work and presents a rule to indicate when the data normalization method is applied on the dataset according to the distribution characteristic of data.
  • OU Ji-Shun, SHU Yu-Quan, CHEN Geng, XU Hai-Beng
    Computer Engineering. 2010, 36(22): 178-180. https://doi.org/10.3969/j.issn.1000-3428.2010.22.064
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    An approach for dynamic weighting ensemble rough subspace called EROS-DW is proposed. The method first gets diverse attribute reducts based on rough set theory and trains base classifiers according to these reducts correspondingly. Next, it dynamically assigns an appropriate weight to each base classifier based on the characteristic of the input sample. Finally, the outputs of base classifiers are combined through weighted majority voting rule. The performance of EROS-DW is tested on UCI benchmark data sets. Experimental results show that EROS-DW can obtain higher classification accuracies compared with classical ensemble learning methods.
  • XU Lin-Dun, YANG Jian-Gang
    Computer Engineering. 2010, 36(22): 181-183. https://doi.org/10.3969/j.issn.1000-3428.2010.22.065
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Computer intelligent system is needed to crack crime activities using information technologies. This paper proposes a study aiming at constructing an effective anti money laundering system together with other respectable researches. A precise mode of BP network is constructed to evaluate the potential risk of money laundering of a certain bank account. Principle components analysis gives an inside view of data structure helping to find better input form for network. Levenberg-Marquardt algorithm accelerates the training process of BP impressively. And on the way generalization Bayesian regularization proves its value. Experimental result of the final system is satisfactory.
  • ZHANG Biao, LIU Gui-Quan
    Computer Engineering. 2010, 36(22): 184-186. https://doi.org/10.3969/j.issn.1000-3428.2010.22.066
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a method, which considers the relationship between two words in feature selection. The relationship between two words which have significant impact on classification is mined, and two-word-sets are found out. Some words in these sets may be discarded due to low scores achieved through the conventional feature selection methods. The algorithm is compared with other conventional feature selection approaches: Information Gain(IG), CHI, etc. Experimental results on Ruters21578 dataset and 20Newsgroup dataset prove that the proposed method is effective to others.
  • XIONG Xiao-Jun, MEI De-Hua
    Computer Engineering. 2010, 36(22): 187-189. https://doi.org/10.3969/j.issn.1000-3428.2010.22.067
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problems such as feasibility to analyze the software architecture before reliability prediction, a kind of software reliability model based on improved neural network is brought forward. By using self-organizing algorithm, hidden layer optimization, and training with test data, this model is achieved. Experimental results show that the model can predict accurately as the traditional ones without the analysis of internal structure of the software.
  • ZHANG Li-Beng, ZHANG Gong-Yang, TUN Bin
    Computer Engineering. 2010, 36(22): 190-191. https://doi.org/10.3969/j.issn.1000-3428.2010.22.068
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The method for scratch detection based on spatial feature is improved. The new method builds a new relation between Scratch Spatial Feature(SSF)’s threshold value and the adaptive parameter of scratches’ width, and adds the scratches’ length detection based on the continuation of the original algorithm’s effectiveness and stability. Experimental results show that the improved method can detect more scratches on video sequences than original method, and the new method has improved function.
  • WEI Juan, YANG Hui-Xian, XIE Hai-Xia
    Computer Engineering. 2010, 36(22): 192-194. https://doi.org/10.3969/j.issn.1000-3428.2010.22.069
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Neural network is applied to solving inverse kinematics of manipulator, whose weight is got through genetic algorithm or back propagated algorithm. These methods need to be further improved in solving accuracy and convergence rate. Through the generalization ability of artificial immune principle to RBF network data set training, the structure of hidden layer is adjusted and generated. When the structure is determined, recursive least squares method is used to determine weight value of network output, so as to adjust and learn the structure and weight value of the neural network self-adaptively. The simulation results verify that the trained neural network by the immune principle has better generalization ability and fast convergence. It can solve accuracy of manipulator inverse kinematics.
  • TAN Yan-Feng, GU Zhen-Gong, QIN Ti-Zhong, CHANG Chun, WANG Gao
    Computer Engineering. 2010, 36(22): 195-196. https://doi.org/10.3969/j.issn.1000-3428.2010.22.070
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the time series of mobile communications traffic, this paper adopts Support Vector Regression(SVR) model which choses its hyper-parameters based on Simulated Annealing(SA) algorithms. It compares the forecasting effects of ARIMA, ANN and SVR. The influence on traffic forecasting from three hyper-parameter selection methods such as grid, GA and SA is comparatively studied. Experimental results show that the forecasting of SA-SVR is accurate and less time-consuming, it is an effective method of forecasting mobile communication traffic.
  • LI Mu-Zi, YAN Jian-Hua, GUO Hai-Chao, LIU Jin-Xi
    Computer Engineering. 2010, 36(22): 197-199. https://doi.org/10.3969/j.issn.1000-3428.2010.22.071
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To solve the defects of slow convergence and prematurity that is common in the known algorithms for Minimum Weight Triangulation(MWT), the conception and algorithm of the maximum of allowable triangulation for point set is proposed, thereby ant colony algorithm can be applied to MWT successfully. Diagonal exchange rule is put forward to speed up convergence ability of algorithm. Experimental result shows that the algorithm’s the convergence velocity, the ability to resist prematurity to converge and run time is much better than the existing algorithms.
  • QIN Bei, MA Chi
    Computer Engineering. 2010, 36(22): 200-202. https://doi.org/10.3969/j.issn.1000-3428.2010.22.072
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Feature extraction of structure irregularity for skin lesion boundaries has a great significance in computer-aided diagnosis for melanomas. Based on previous work using local Fractal Dimension(local FD) for contour irregularity descriptions, this paper proposes the feature extraction method of boundary irregularity using multi-scaled curvature analysis. Feature differences from adjacent scales are used to enhance the discrimination power between malignant and benign shin tumors. Comparative experiments of both local FD and curvature analysis show that the features difference of adjacent scales has characteristics of larger inter-class Hausdorff distance with the scale increase, while local FD performs better than curvature analysis with larger Hausdorff distance value. Experimental results show that the two methods not only have strong classification capacity of structure irregularity, but also are helpful to weaken texture irregularity for the classification.

  • WANG Yan-Xia, DENG Wei
    Computer Engineering. 2010, 36(22): 203-205. https://doi.org/10.3969/j.issn.1000-3428.2010.22.073
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A text classification method combining Correlated Topic Model(CTM) and Support Vector Machine(SVM) is proposed. In order to reduce the corpus’s dimension, this method models the corpus, and classifies the simplified text date with SVM. With the aim of making the CTM model the corpus better, DBSCAN clustering method is used and chooses the cluster number as the model topic parameter of CTM. Experimental result shows that the method can accelerate the classification speed and improve the classification accuracy.
  • XIE Lin, CHEN Yue-Lin, LIN Jing-Liang
    Computer Engineering. 2010, 36(22): 206-207. https://doi.org/10.3969/j.issn.1000-3428.2010.22.074
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper integrates the Boosted Cascad algorithm with the Histograms of Oriented Gradients(HOG) features to achieve a fast and accurate pedestrain detection system. Through using the structure of the Boosted Cascad algorithm, the areas of information less are removed, the amount of computation are reduced. Experimental result shows that the pedestrian detection efficiency of the new method is high and has strong robustness.

  • LIANG Xi-Teng, WANG Jia-Hai
    Computer Engineering. 2010, 36(22): 208-210. https://doi.org/10.3969/j.issn.1000-3428.2010.22.075
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The traditional methods of image de-noising may bring distortion with many reasons. For the following reasons, this paper puts forward corresponding optimization program. The reason can be described as follows: in the process of de-noising, scattered the impact of the noise points into their neighborhood, it does not do judge some points whether they are noise points or not, it can not accurately judge whether a point is a noise point, the non-noise point might be wrongly judged as a noise point. This paper finds noise points and their neighborhood through the generation of noise points and noise measurement operator reliability. Simulation experimental result shows the method has stronger de-noising capability than the median filter method and can achieve the anti-distortion effect.
  • XI Ji, DIAO Xiao-Ling, ZHANG Yu-Dong
    Computer Engineering. 2010, 36(22): 211-213. https://doi.org/10.3969/j.issn.1000-3428.2010.22.076
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to interpolate images more efficiently, an improved weight-alterable all-phase Walsh filter is proposed. It is combined with the traditional Walsh transform and the all-phase digital filter. The weight factors of the filter are adjusted according to the distance between sub-filter and central point. Simulation shows that except for the facility in computer and the robust to noise, the interpolation effect of the proposed algorithm is better than the classic interpolation and the constant weight all-phase Walsh filter.
  • WANG Xiao-Fei, GUO Min, XU Qiu-Beng
    Computer Engineering. 2010, 36(22): 214-216. https://doi.org/10.3969/j.issn.1000-3428.2010.22.077
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper reconstructs energy function by introducing external energy term of C-V model based on Li model. A variation level set model combining region with edge information is described, and it combines with the graph cuts theory based Graph Cuts Based Active Contours(GCBAC) algorithm. It proposes a method of object extraction which combines graph cuts with improved variation level set. This method enables two models organically combined to achieve the effect of mutual complementarities. Experimental results show that the proposed method has advantages of rapid, robust, and strong anti-noise and so on.
  • HANG Tian, JIANG Xin-Zhi, DIAO Yu-Meng
    Computer Engineering. 2010, 36(22): 217-218. https://doi.org/10.3969/j.issn.1000-3428.2010.22.078
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a method for high-dynamic images composition based on the 3CCD multiple-channel achromatic image. The model extracts three different components of three channels in 3CCD achromatic image as the synthetic image sequences to make full use of the information of 3CCD image, and it can effectively remove parts of the high-light area and over-saturation region. It reduces the needs for synthetic image amount. Experimental results show that the method relative to the usual achromatic image has a better dynamic range and SNR.
  • CHEN Ji-Guo, CHEN Chao-Min
    Computer Engineering. 2010, 36(22): 219-221. https://doi.org/10.3969/j.issn.1000-3428.2010.22.079
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a novel model for shadow removal, especially for the soft shadows. This model preserves the original texture of the image. It changes the image space to a convenient one. The method formulates the problem of finding the boundary of penumbra region as an optimization problem, and then removes the shadows. Experimental results show the effectiveness of the algorithm.
  • HE Fei, YANG Jian, XI Hong-Sheng, FAN Ming-Na
    Computer Engineering. 2010, 36(22): 222-224. https://doi.org/10.3969/j.issn.1000-3428.2010.22.080
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    An Adaptive Media Playout(AMP) algorithm based on Proportion Integration Differentiation(PID) control(AMP-PID) is proposed to reduce the video playout jitter caused by buffer underflow. It combines the control theory of incremental digital PID algorithm and the adaptive media playout algorithm, and adjusts the duration of each frame according to the channel state and the data cache size. Also, it controls the play rate range and the play rate variation in reducing the probability of buffer underflow at the same time to achieve a smooth video playout. Simulation results show the algorithm has better performance than AMP-Mean algorithm in reducing the probability of buffer underflow, achieving a smooth video playout and reducing the playout latency.

  • LIU Zheng-Yan, LI Chu, CHEN Wen
    Computer Engineering. 2010, 36(22): 225-227. https://doi.org/10.3969/j.issn.1000-3428.2010.22.081
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A novel information hiding algorithm for H.264/AVC is proposed. This algorithm establishes a relationship between hidden messages and the carriers of middle frequency DCT coefficients by applying the classic magic matrix. At the same time, two concepts of the utilization rate of carrier and embedding cost are proposed in order to authenticate the validity of this relationship. Compared with the conventional one-dimensional mapping method, the proposed method based on two-dimensional mapping can obtain lower embedding cost when the utilization rate of carrier is the same. Meanwhile, the proposed method not only has minor ratio of modification, but also preserves the visual quality of the video.
  • LIU Yi-Ming, ZHOU Chang-Bei
    Computer Engineering. 2010, 36(22): 228-230. https://doi.org/10.3969/j.issn.1000-3428.2010.22.082
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper fuses the features of both color and edge in particle filter tracking framework, and proposes an improved tracking algorithm by introducing several optimization factors, such as describing the color feature of target using kernel density estimation under HSV color model, using more practical motion model in particle filtering, clustering the particles with mean shift algorithm, and reordering the steps of clustering and resampling. Additionally, it also improves the edge matching method by introducing mean shift. Such method adds a pretreatment of the edge information into the matching process that makes the distribution of particle weights more rational. Experimental results show this algorithm has better robustness and real-time ability.

  • ZHOU Wen-Ling, QUAN Gong-Yan, GUO Xi-Jiang
    Computer Engineering. 2010, 36(22): 231-232. https://doi.org/10.3969/j.issn.1000-3428.2010.22.083
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Slow speed and low accuracy of detection are the common drawbacks of traditional video moving target detection methods. In order to overcome these shortcomings, a new detection algorithm of moving targets is presented which integrates frame difference with variational level set method. The motion region is initialized through this improved frame difference method, and then it is used as initial level to evolve by the level set equation without re-initialization. In the evolution process, image intensity and optical flow information are used to control level set curve stop at the object boundary. Experimental results show that the proposed algorithm is an effective video rigid moving object detection method with high detection speed and high accuracy.

  • DU E-Juan
    Computer Engineering. 2010, 36(22): 233-235. https://doi.org/10.3969/j.issn.1000-3428.2010.22.084
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper builds a half-physical simulation test-bed, it can simulate spatial docking dynamics process. On the basis of the test-bed, it presents a control scheme. The system includes center control unit, test control unit, model calculation unit, driving device and six-directional sensor. It implements the control and management of the whole experimentation, on-line surveillance and the movement of driving device. The system design has real-time control and well user interface. Experiment verifies its stable and reliable.
  • CHEN Chen, CHEN Bin, CENG Xiao-Xiang
    Computer Engineering. 2010, 36(22): 236-238. https://doi.org/10.3969/j.issn.1000-3428.2010.22.085
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper proposes a novel architecture of convolver which is based on RAM. It is power and area efficient compared to the conventional FIR architecture which is based on registers. The reduction percentage of power and area increases with the order of the convolver. It implements two pairs of convolver with different orders. Each contains a RAM based one and a FIR one for comparison. Simulation results by DC and Prime Power show that for the first pair with order 63, area and power reduction percentages are 10.1% and 8.4% by employing RAM based architecture, while for the second pair the above reduction percentages are 14.9% and 15.2%. The chip test result when the first pair tape out successfully shows that the power reduction percentage is 7.9%.

  • DIAO Yong-Li, YANG Yin-Hua, WANG Gong
    Computer Engineering. 2010, 36(22): 239-241. https://doi.org/10.3969/j.issn.1000-3428.2010.22.086
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problems of low real time, single processing and computer must be equipped in traditional laser processing device, this paper develops a laser three-dimension carving control system based on USB bus. It has two kinds of work pattern parallel intelligence switching for USB-host and USB-device. At the pattern of USB-host, control system can read USB storage directly. At the pattern of USB-device, USB interface is adopted to realize the transformation of data between PC and the laser carving control system. More than one laser carving machines can be controlled by only one PC through USB, it can not only reduce the cost but also improve the efficiency.
  • ZHOU Sheng, BO Bin, DING Yong, YA Xiao-Feng, YAN Xiao-Lang
    Computer Engineering. 2010, 36(22): 242-244. https://doi.org/10.3969/j.issn.1000-3428.2010.22.087
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper presents a new NoC architecture. By adopting the virtual output queue technology, this architecture completely resolves head of line blocking and deadlock which exists in traditional ring topology architecture. By changing ring number, flit sending speed and Buff depth, it evaluates the performance of this architecture and compares with 2D Mesh in the experiment. When node number is 16, the performance of new bidirectional ring topology NoC architecture whose Buff depth is 2~4 flits is better.

  • NIE Yan-Feng, BANG Xiang-Jun, XU Xian-Chao
    Computer Engineering. 2010, 36(22): 245-247. https://doi.org/10.3969/j.issn.1000-3428.2010.22.088
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to improve the condition of file transfer inefficiency between the large-scale system, this paper designs a document processing engine in FTP server hub model. The engine realizes business register by intelligence guide mode, and establishes a back-drive module to realize file transmission effectively. MD5 algorithm is used to solve the document in the integrity of the migration process validation issues. Java thread pool is used to control technology to improve the multi-threaded concurrent processing capabilities. The engine design solves the problem of coordination and controlling between layered structures in FTP server hub. It also can parallel the transplant to many domains and has higher use value.
  • ZHANG Chi, CHEN Gang, WANG Hui-Min
    Computer Engineering. 2010, 36(22): 248-250. https://doi.org/10.3969/j.issn.1000-3428.2010.22.089
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Aiming at the common problems including difficulties in product content analysis, low density in customer scores and new customer recommendation, existing in recommendation technologies today, this paper designs a blending recommendation technology which employs demography analysis technology based on cooperating filtering technology, and implements a recommendation model instance in a Web resource system. Experimental results indicate that this technology can solve the problems mentioned before, and efficiently improve recommendation quality comparing to the traditional technologies.

  • JIANG Chang-Hua, LIN Qiang-Sheng
    Computer Engineering. 2010, 36(22): 251-253. https://doi.org/10.3969/j.issn.1000-3428.2010.22.090
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper researches the impact of topology on complex networks evolution under the influence of both network growth and external target. Extensive simulations of network evolution are performed by applying an evolutionary algorithm on the classical Boolean network to investigate the performance of two types of growing rules toward pre-established target function. The results show that the growing Scale-Free networks perform much better than the growing homogenous random graph, and the degree distribution imposes significant impact on the performance of network evolution.
  • MO Meng, ZHANG Feng-Ming, FAN Xiao-Guang-
    Computer Engineering. 2010, 36(22): 254-255. https://doi.org/10.3969/j.issn.1000-3428.2010.22.091
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    To improve the safety of real-time system at transient overload, a schedule algorithm based on mixed priority is proposed. The priority of the algorithm consists of relative deadline priority and relative slack priority. With relative slack, whether tasks will miss deadline can be predicted. Through the complete CPU preemption, frequent context switch can be avoided. Simulation results show that the presented algorithm improves the efficiency of task schedule and effectively decreases the Missed Deadline Percentage(MDP) at transient overload.

  • GAO Fei, HUANG Liang-Bin
    Computer Engineering. 2010, 36(22): 256-258. https://doi.org/10.3969/j.issn.1000-3428.2010.22.092
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem that traditional Positive Feedback Preference(PFP) model can not well simulate Internet dynamic evolvement, this paper presents an improved PFP model for Autonomous System(AS) level dynamic topology. Improved model considers both join and death of AS nodes, the disappear of internal links. It can simulate the Internet topology evolvement and describe the Internet topology features well. Result applied by topology data of Skitter project shows that improved algorithm can satisfy well the power-law and small-world characteristic, and it is suitable for Internet modeling.
  • LAI Jin-Ying, XU Yi-Cheng, YIN Jian-Wei, CHEN Huo
    Computer Engineering. 2010, 36(22): 259-261. https://doi.org/10.3969/j.issn.1000-3428.2010.22.093
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The traditional publish/subscribe systems do not have abilities to change an atomic subscription into a composite subscription automatically, thus reducing the systems’ usability and capability of matching. To address this issue, an automatic subscription decomposition model supporting semantic equivalence is designed, and a subscription decomposition algorithm based on XChangeEQ is proposed. The application case shows that the algorithm can provide matching results composed of composite events, thus increasing the system’s usability and capability of matching.
  • LIU Tan-Hua, LIU Jing, LAI Zong-Qing, JING Wei-Beng
    Computer Engineering. 2010, 36(22): 262-264. https://doi.org/10.3969/j.issn.1000-3428.2010.22.094
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    At the beginning of Network on Chip(NoC) design, cores of mapping are considered based on 2D Mesh topology such that the communication energy constraint is satisfied. A Genetic And Ant Colony(GAAC) mapping algorithm is presented to solve NoC design problem with an objective of minimizing the communication energy. To solve the problem that the ant colony algorithm often gets stock into premature stagnation in the iteration process, roulette wheel selection and crossover of chromosome are introduced to improve the result of energy-aware mapping function fast converged and optimized solution.
  • CHAN Mi-Yuan, SONG Ze-Yu, HUANG Jing
    Computer Engineering. 2010, 36(22): 265-267. https://doi.org/10.3969/j.issn.1000-3428.2010.22.095
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    According to the knowledge of product configuration, this paper proposes a model of mass customized product configuration , which is based on ontology and includes both configuration and constraint types. It defines every concept and its relation of the model, describes them formally in Web Ontology Language(OWL), expresses specific constraint rules in Semantic Web Rule Language(SWRL), and checks the efficiency of the model with Protégé.

  • XIE Li-Na, LIN Lan-Fen
    Computer Engineering. 2010, 36(22): 268-271. https://doi.org/10.3969/j.issn.1000-3428.2010.22.096
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problems of lack finances for the medium and small enterprises and imperfection for the enterprise informationization, this paper analyses the application of Computer Aided Process Planning(CAPP) service for the medium and small enterprises, combines with characteristics of multi-user, configurable and high efficiency for Software-as-a-Service(SaaS) architecture, and presents a design of CAPP service based on SaaS. It offers the more convenient way of accessing the CAPP knowledge, standardizes the CAPP flow, promotes cooperation in the enterprises and enterprises process of informationization.
  • XU He-Xiang, ZHANG Shi-Meng
    Computer Engineering. 2010, 36(22): 272-273. https://doi.org/10.3969/j.issn.1000-3428.2010.22.097
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper presents a query model based on semantic meta-model to search digital resources. By improving Top-N algorithm in traditional relational database, a novel similarity evaluation method is proposed based on the different kinds of data type and the semantic meta-model. Based on the method, an intelligent querying system is developed, which is used in Shanghai Educational Resources Center. Actual application shows that it can improve the query precision effectively.

  • LI Pu, SHI Ya-Xian, JIANG Yun-Cheng
    Computer Engineering. 2010, 36(22): 274-276. https://doi.org/10.3969/j.issn.1000-3428.2010.22.098
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the limitations of traditional ontology construction methods, this paper proposes a method about building some modular ontology for tourism domain based on ?-Connections theory and use the reasoner——Pellet to carry out reasoning on more than one ontology, which is based on improved Tableau algorithm. Experimental result proves that the method can reduce the complexity of constructing ontology effectively and it is conducive to the maintenance and updating of ontology. And it helps to improve the efficiency of module extraction when reusing an ontology.
  • TUN Huan-Ping, HUI Jin-Chao, DIAO Lin-Na, LUO Bing, TIAN Hua, LV Zhong-Liang, ZHENG Wei-Jiang
    Computer Engineering. 2010, 36(22): 277-279. https://doi.org/10.3969/j.issn.1000-3428.2010.22.099
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Based on GIS technology, this paper discusses the basic principle and main workflow of computer automatic generation for the road meteorological graphic and text products in Central Meteorological Office(CMO), and some key issues are discussed, such as meteorology and road data preprocessing, inversion method of road, and graphic and text generation, geo-processing modeling method. The operational running result shows the method can meet the operational requirements.
  • WANG Jian-Chao, YANG Xu-Bei
    Computer Engineering. 2010, 36(22): 280-282. https://doi.org/10.3969/j.issn.1000-3428.2010.22.100
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Current corner matching methods mainly focus on plane surfaces, where the chessboard patterns are only oblique. They will lose efficacy faced with warped surfaces. Aiming at this problem, this paper presents a novel method based on the Voronoi diagram. Experimental results show that compared with the other method, the new algorithm uses the distance between points to match the chessboard corners more quickly and get the final results better. This method makes the information of the points easier to save, and the computing cost is lower down.
  • LI Wen-Jun, HANG De-Quan, ZHANG Guan
    Computer Engineering. 2010, 36(22): 283-285. https://doi.org/10.3969/j.issn.1000-3428.2010.22.101
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a hardware task schedule algorithm named RDMS which can reduce data transmission. It takes data dependency among tasks, hardware task resource utilization and inter-task communication into account during the schedule process, and adopts a dynamic programming approach to reduce the communication between microprocessor and FPGA co-processor and the number of FPGA configurations to a minimum. Experimental results show that RDMS can improve the overall performance of hardware tasks assigned to FPGA devices by reducing both the communication overhead and configuration overhead.
  • HU Wen-Beng, HONG Ji-Wen
    Computer Engineering. 2010, 36(22): 286-288. https://doi.org/10.3969/j.issn.1000-3428.2010.22.102
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the principle of particle system, this paper uses texture mapping, color blending and display list technology to control motion curve of fireworks particle. Refered to three-leaf parametric equation, it makes fireworks particle appear three-leaf form. The size, color and location of three-leaf rose dynamic fireworks renews with time. The particles die, and three-leaf rose dynamic fireworks disappear until the color of fireworks particle is the same as night background. Simulation result shows that three-leaf rose dynamic fireworks can create vivid images and comes up to the real-time requirements.
  • DUAN Pu, LIU Chun-Jiang, WU Yue-Shan
    Computer Engineering. 2010, 36(22): 289-290. https://doi.org/10.3969/j.issn.1000-3428.2010.22.103
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Location methods based on Received Signal Strength Indicator(RSSI) are adapt to RFID systems because they are easy to realize and have low overhead. This paper presents implementation method and applications of RSSI in RFID reader of UHF band. By using appropriate measurement means and analyzing the radio propagation fading model and a large number of measured data, it proves that the RSSI of tags can work on real-time location for passive tags.

  • WANG De-An, ZHOU Zhi-Gang, LIANG Xu
    Computer Engineering. 2010, 36(22): 291-292. https://doi.org/10.3969/j.issn.1000-3428.2010.22.104
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper improves PageRank algorithm is based on analyzing the phenomenon of stressing on old pages, drifting theme, spliting page weight and neglecting user browsing interests. It considers the important factors of webpage modification data, webpage text information, website technoroti authority, user interestingness. Experimental result shows that improved algorithm can improve accuracy for webpage order and user satisfaction with search results.