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

20 July 2011, Volume 37 Issue 14
    

  • Select all
    |
    Networks and Communications
  • WANG Min, LI Shi-Ning, LI Zhi-Gang
    Computer Engineering. 2011, 37(14): 1-4. https://doi.org/10.3969/j.issn.1000-3428.2011.14.001
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Due to the characteristic of energy constrained, it is vital to balance the energy of nodes in Wireless Sensor Network(WSN). Multipath Routing with Load Balancing(MRLB) based on Ant Colony Algorithm(ACA) is proposed. The algorithm utilizes self-adaptability and dynamic optimization capabilities of the ant colony to establish multiple paths from the source node to the destination node. It takes residual energy of the node into heuristic factor, balancing energy consumption of the nodes. A load balancing scheme is proposed to distribute the traffic over the multiple paths discovered. The scheme applies Analytical Hierarchy Process(AHP), which gives each path a certain percentage of load distribution. It makes transmission on multiple paths equilibrium, which extends lifetime of the entire network. Simulation results show the algorithm balances energy consumption of nodes and extends network lifetime effectively.

  • LIANG Shuai, LUO Jiang-Yi, BI Cheng, HUANG Tian-Hong
    Computer Engineering. 2011, 37(14): 5-8. https://doi.org/10.3969/j.issn.1000-3428.2011.14.002
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    As for large-scale ontology modular partition problem, this paper analyzes the similarity between complex networks and ontology structure, converts ontology to the corresponding concept networks according to its semantic and structural characteristics. It proposes a set of quantitative criteria for measuring the local central of nodes and semantic connection strength of edges, uses these quantitative criteria to identify core concept nodes and assign weight to edges, obtains undirected weighted hierarchical networks, which explicit express ontology semantic and structural characteristics, transforms the networks to circuit voltage networks, and partitions it by the maximum potential difference method. Experimental results show that this method can acquire high-quality ontology modules in linear time and fit for the further use of ontology matching application.

  • XIE Chao, LI Zhi-Hua, HUANG Die-Lun
    Computer Engineering. 2011, 37(14): 9-11,17. https://doi.org/10.3969/j.issn.1000-3428.2011.14.003
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Aiming at real-time decode H.264 video on IP network with packet losses, an effective error concealment algorithm is proposed depending on the analysis of high definition video streams. By use of the edge macro-blocks information of the lost slice, the motion vector of corrupted macro-block is predicted, and the error concealment is completed. Experimental results show that, compared with the error concealment of Joint Model(JM), the proposed algorithm improves the objective quality and subjective quality of reconstructed images. The algorithm does not increase the complexity of the decoding, but achieves better recovery results. It is ideal for real-time decoding for high definition video.

  • JIN Hua, ZHANG Zhi-Xiang, LIU Shan-Cheng, JU Shi-Guang
    Computer Engineering. 2011, 37(14): 12-17. https://doi.org/10.3969/j.issn.1000-3428.2011.14.004
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    (α, k)-anonymity model can not thwart the homogeneity attack well because of the model ignoring the sensitive difference between sensitive attribute. It is achieved traditionally via generalization techniques. It also has some defects on efficiency and data distortion. So this paper proposes an improved (αi, k)-anonymity model. It considers the sensitive difference between sensitive attribute, and designs a (αi, k)-anonymity clustering algorithm based on greedy strategy recur to the idea of lossy join. Experimental results show that the proposed model can resist homogeneity attack and is an effective approach.

  • ZHANG Sai-Yi, WANG Shi-Tong
    Computer Engineering. 2011, 37(14): 18-20,26. https://doi.org/10.3969/j.issn.1000-3428.2011.14.005
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper proposes a new idea using the idea of the fuzzy decision. And it is based on the kernelized spatial depth and the idea of the smallest sphere, intending for the problems that kernelized spatial depth function can not have good performance on some datasets and the parameters have the influence on the effectiveness. In this way, the algorithm improves the effectiveness and robustness in outlier detection by using the advantages of the algorithm and weakening the disadvantages. This paper does some experiments on the two artificial datasets and three different UCI datasets. Results show the effectiveness of the proposed idea.

  • GAO Lei, DONG Yun-Wei, ZHANG Fan, WANG An-Ren
    Computer Engineering. 2011, 37(14): 21-26. https://doi.org/10.3969/j.issn.1000-3428.2011.14.006
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Based on the old component dependencies, this paper presents an Architecture Analysis and Design Language(AADL) system reliability model transformation method. It expands the dependencies to semantic connection, parameter connection and subcomponent calls and realizes the transformation to General Stochastic Petri Nets(GSPN). Therefore, it makes the model transformation rules from AADL reliability model to GSPN model more maturity and realizes exact and entire evaluation to reliability of embedded system.

  • ZHANG Qing, CHAI Jiao-Lin
    Computer Engineering. 2011, 37(14): 27-30. https://doi.org/10.3969/j.issn.1000-3428.2011.14.007
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    In multi-hop Wireless Sensor Network(WSN) using clustered routing algorithm, the nearer to the sink node, the more load is put on the headers. As a result, headers near the sink node will quickly lose their energy and become unavailable which leads to network-partitioning and lower data transmission quality. In order to solve this problem, based on the analysis of existing researches, a new routing algorithm is proposed, which is based on both Unequal scaled Clusters and Redundancy of Headers(UCRH) algorithm. According to simulation results, UCRH algorithm overwhelms in prolonging network’s lifetime, reducing energy cost and supporting reliable data delivery.

  • TUN Jing-Jing, MAO Ding-Ding, SHU Liang, ZHANG Pu, SUN Wei-Wei
    Computer Engineering. 2011, 37(14): 31-33. https://doi.org/10.3969/j.issn.1000-3428.2011.14.008
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    An eXtensive Makeup Language(XML) document is the broadcast unit in XML data broadcast environment. Data broadcast is an efficient way for information dissemination in wireless mobile environments. The efficiency of broadcast is reduced by the redundant information between XML documents. In order to solve the problem, this paper proposes an efficient schedule algorithm. An affinity of XML documents is derived by analyzing the effect of merging documents. Redundant information is reduced by recursively merging the documents with the largest affinity. Experimental result shows that this algorithm can enhance the effective of broadcast and save the limited bandwidth.
  • WANG Wei-Beng, WANG Jin-Hui
    Computer Engineering. 2011, 37(14): 34-35. https://doi.org/10.3969/j.issn.1000-3428.2011.14.009
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Aiming at the problem of sparse user ratings facing tradition recommendation system, this paper proposes a hybrid recommendation method based on Tag and collaborative filtering(TAG-CF) to provide a solution to this problem. The neighbors set for the target item can be gained based on tagging information. It uses item-based collaborative filtering to generate the predictive ratings. By filing these predictive ratings into the sparse user-item rating matrix, it constructs a full pseudo ratings matrix. It computes the predictions based on the pseudo ratings matrix by using user-based collaborative filtering. Experimental results show that the proposed method performs significantly better than the traditional CF method.

  • WANG Wei, XU Zhang-Yan, WANG Shuai, YANG Bing-Ru
    Computer Engineering. 2011, 37(14): 36-38. https://doi.org/10.3969/j.issn.1000-3428.2011.14.010
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    By analyzing attribute reduction based on tolerance matrix in incomplete information system, a new binary tolerance matrix under single condition attribute is defined. At the same time, absorption of operation rule between two of them is also defined. The binary tolerance matrix under the whole condition attributes is gained by that rule. If the binary tolerance matrix based on some of condition attributes is equal to the binary tolerance matrix under the whole condition attributes, those condition attributes make up of an attribute reduction. It is proved that the attribute reduction acquired from this new method is equivalent to it based on positive region in incomplete information system, and an algorithm for attribute reduction is presented. An example is used to illustrate the rationality of this new algorithm.
  • HUA Chao, LI Gong-Gong, LI Lai-Xiang
    Computer Engineering. 2011, 37(14): 39-40. https://doi.org/10.3969/j.issn.1000-3428.2011.14.011
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Graphical User Interface(GUI) is created with rapid prototyping, has characteristics that differ it from traditional software, so test techniques for traditional software can’t directly apply to GUI. This paper analyses interaction between GUI events, researches on why some events can lead to defects and gives a cost-effective Event Interaction Graph(EIG) based GUI automated regression test framework and corresponding regression test process, which is used to provide the best combination of defect detection rate and cost.
  • SHU Wen-Jiang, FU Yu-Chen
    Computer Engineering. 2011, 37(14): 41-43. https://doi.org/10.3969/j.issn.1000-3428.2011.14.012
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper proposes a new detection algorithm based on rough set. It uses information centrality as a measure of correlation between nodes. While dealing with the boundary nodes between communities, it uses upper and lower approximations subsets so as to better simulate the real world, then it clusters nodes to certain community and identify the network to k communities, identifies the ideally community structure according to modularity, besides the k value need not to be prior given. The algorithm is tested on two network dataset named Zachary Karate Club and College Football. and experimental result shows it has high accuracy rate.

  • ZHONG Jiang, SONG Juan
    Computer Engineering. 2011, 37(14): 44-46. https://doi.org/10.3969/j.issn.1000-3428.2011.14.013
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    According to the data request model of power parameter estimate system, and semantic conflict type existing in the process of data integration, a heterogeneous data integration frame based on ontology is proposed to solve semantic heterogeneity problem. It improves traditional data integration structure by adding ontology semantic describing structure into data integration mediator. Based on describing the concept of domain by ontology, this structure solves the semantic heterogeneity problem existing in heterogeneous data integration, by finding semantic conflict initiative and constructing semantic mapping relations. Experimental result shows the feasibility and effectively of integration framework based on ontology proposed in this paper.

  • ZHOU Chun-Yan, LI Xu-Rong, ZHOU Liang
    Computer Engineering. 2011, 37(14): 47-49. https://doi.org/10.3969/j.issn.1000-3428.2011.14.014
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The correctness of the activity graph decides that the correctness of execution of business flow, so this paper proposes an method for diagnosis of correctness of UML activity graph model. It verificates the model. Model diagnosis of sub-models which are wrong and receiving the diagnosis results. The application of example of quality management process, demonstrates this approach can reduce the space of model, decrease diagnosis frequency, lock error accurately, diagnose the model correctness effectively.
  • JU Xiao-Gong, LI Jia, GUO Jing-Feng, CHAI Ran
    Computer Engineering. 2011, 37(14): 50-52. https://doi.org/10.3969/j.issn.1000-3428.2011.14.015
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyzes the generation process of the graph similarity search candidates, and the relationship between feature-graph that not be token into account in current filtering algorithm, and presents graph similarity query filtering algorithm based on feature index. It builds a feature-graph index structure, analyzes the selectivity of each feature and builds a sorted feature, and generates the candidate graphs by using the feature-graph matrix to efficiently filter the graph database. Experimental results show that this algorithm can accurately generate candidate and improve the efficiency of the graph query.
  • ZHANG Zhao, SHU Dong-Hua, LI Meng
    Computer Engineering. 2011, 37(14): 53-55. https://doi.org/10.3969/j.issn.1000-3428.2011.14.016
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem of controlling knowledge maintenance process, a framework of knowledge maintenance process and a novel knowledge maintenance algorithm based on control flow mining are proposed according to the characteristics of process mining. The process of knowledge maintenance is optimized by the algorithm, which ensures the quality of knowledge in the knowledge repository and improves the effects of knowledge reusing and sharing. Test result can reflect the actual situation of the knowledge maintenance well.
  • JU Zhi-Wen, BI Hong-Zhe, LI Gen
    Computer Engineering. 2011, 37(14): 56-58. https://doi.org/10.3969/j.issn.1000-3428.2011.14.017
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Due to the problem about clustering of multi-scale index structure for the existing space object is not high, this paper represents a cluster-based multi-scale spatial data indexing structure based on R-tree index, which uses hierarchical tree to reflect the multi-scale features of spatial data, and uses k-means algorithm to cluster groups on the same level of spatial objects, reducing coverage and overlapping regions of space. Experiments result shows that compared with other ways, the algorithm has a distinct superiority in the speed of multi-scale display of spatial data.
  • LI Hai-Feng
    Computer Engineering. 2011, 37(14): 59-61. https://doi.org/mydlhf@126.com
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper considers a problem that to the best of the knowledge has not been addressed, namely, how to use Graphic Processing Unit(GPU) for mining closed frequent itemsets. The method employs a single-instruction-multiple-data architecture to accelerate the mining speed using a bitmap data representation of frequent itemsets, a further memory-based index tree is used to make search faster. Experimental results show that the algorithm can store all the information of frequent itemsets using less space, and achieve better performance in running time.
  • ZHANG Hai-Qing, LIU Yin-Tian
    Computer Engineering. 2011, 37(14): 62-64. https://doi.org/10.3969/j.issn.1000-3428.2011.14.019
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    To solve the problem of traditional maximal frequent pattern mining that it can not find frequent pattern remaining more items than traditional maximal frequent pattern with the same support threshold, this paper proposes the conception of Maximal Sub-Frequent Pattern(MSFP) and relative mining algorithm MSFP-mining. The main contributions include: the conception of MSFP and analysis of MSFP character, the MSFP-mining algorithms of MSFP, such as AFP-tree, CMP-tree, SFP-tree, SFP-growth, and MSFP-tree, the superset check method of candidate MSFP and the pruning strategy of MSFP-tree, the efficiency of MSFP-tree based mining algorithms by extensive experiments. Experimental result shows that MSFP can effectively expand the scale of maximal frequent pattern.

  • XU Li-Xin, CHEN Zhong-Yo, GAO Yi
    Computer Engineering. 2011, 37(14): 65-67. https://doi.org/10.3969/j.issn.1000-3428.2011.14.020
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Message Sequence Charts(MSC) is a graphic and text language for describing and specifying interactions among system components. Because the factors of instance and message itself lack description structure, extention for description function has much limit. The purpose of formalization is to enhance the accuracy of its description. In this paper, using mathematical methods, a semantic structure of MSC based on message mechanism is given. And the function of describing MSC with time concept is extended, with the result of enhanced capabilities of its description.
  • LOU Jian-Bei, LIU Jiu-Fu, LI Jin-Kui, WANG Wei
    Computer Engineering. 2011, 37(14): 68-69. https://doi.org/10.3969/j.issn.1000-3428.2011.14.021
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Traditional C/C++ code relying on preprocessing can be quite complex to analyze. Symbolic execution can be used to infer these expressions using the free variables, but its time complexity is exponential. In order to reduce the time complexity, this paper puts forward a method of fast symbolic execution. By using lexical analyzer, preprocessing variables and path conditions from source code are gotten. Next is building node for each preprocessing variable and converting path conditions into conditional expressions, they are merged into conditional values(c-values) through the algorithm of symbolic execution. The result is to display each preprocessing variable’s c-value after pretreatment. Experimental results show that the path feasibility analysis of traditional symbolic evaluation can be omitted. So it can reduce the time complexity by using symbolic execution algorithm.
  • ZHANG Cheng, QU Meng-Cheng, NI Ning, CHOU Guang, BO Jia-Dun
    Computer Engineering. 2011, 37(14): 70-72. https://doi.org/10.3969/j.issn.1000-3428.2011.14.022
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A novel answer selection method based on topic modeling techniques is proposed to mitigate the issue of question asker’s burden of selecting the best answer stemming from too many candidate answers in question answering communities. Aiming at the problem, this paper presents an automatic answer selection based on Probabilistic Latent Semantic Analysis(PLSA) in question answering communities, and accordingly rank candidate answers based on similarity of interest between answers and questions. Experimental results show that the method can effectively excavation user interest and improve the accuracy of answer selection.
  • ZHANG Li-Yuan, HE Tie-Jiang
    Computer Engineering. 2011, 37(14): 73-75. https://doi.org/10.3969/j.issn.1000-3428.2011.14.023
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For the sleep mode operation of type I-power saving mechanism in IEEE 802.16e, considering down-link traffic only and describing the arrival process as Markovian arrival process, a discrete-time DMAP/G/1 queue model with multiple vacations is built. Employing factorization principle method and Little’s law, the queue model built in this paper is analyzed, and the performance measures of the energy saving rate and the mean delay time of packets for sleep mode in IEEE 802.16e are derived. Numerical results are given to demonstrate the dependency relationships between the system performance measures and system parameters.
  • JU Jie, LI Shan-Jun, CHEN Xiao-Meng
    Computer Engineering. 2011, 37(14): 76-78. https://doi.org/10.3969/j.issn.1000-3428.2011.14.024
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to improve indoor wireless localization, and reduce complexcity, this paper presents an improved indoor wireless localization algorithm. It includes two algorithms. It divides the complex indoor wireless environment into small degree of Non-light Of Sight(NLOS) pollution and serious NLOS pollution environment, which takes the number of lines of sight as standard. An improved Fang-Taylor cascaded algorithm is proposed to achieve localization in the indoor wireless environment which contains less NLOS pollution. On the other hand, it uses a new iterative localization algorithm. Simulation results indicate that this integrated indoor wireless localization algorithm can achieve the location accuracy of the similar algorithms and even better than them. Moreover, it can adapt to the ever-changing indoor wireless environment, and improves the robustness of the algorithm.
  • OU Hai-Bin, YIN Yan, XIONG Jian-Xin
    Computer Engineering. 2011, 37(14): 79-81. https://doi.org/10.3969/j.issn.1000-3428.2011.14.025
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problems of load imbalancing and lower throughout, this paper proposes an optimal routing strategy based on load balancing in airborne Ad Hoc network. The communication link available time is forecasted based on location information. Then the designed routing protocol need satisfy the following multi-constraints: link availability, delay and bandwidth. It considers the node load equilibrium as the optimal object in order that all the communication links assign proper packets to transmit. Simulation results show that the nodes have proper transmission loads that promote the whole network throughputs.
  • CHENG Wei, LONG Zhao-Hua, JIANG Gui-Quan
    Computer Engineering. 2011, 37(14): 82-84. https://doi.org/10.3969/j.issn.1000-3428.2011.14.026
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper presents and realizes an IP voice system, which combines the S3C2410 processor’s low-cost, high performance features with embedded Linux software system’s high reliability advantages. It uses a unique way called four-threaded double-buffered voice data processing and delay-control playback technology to make real-time voice playback smoother, and time delay is controlled within an acceptable range. Performance analysis shows that the modular system design makes the system easier to access 3G networks by only replacing the communication module.

  • ZHANG Yi, ZHOU Si-Wang
    Computer Engineering. 2011, 37(14): 85-87. https://doi.org/10.3969/j.issn.1000-3428.2011.14.027
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    When most of the opportunity networks routing protocols seek end to end communication links, they often do not grasp the node’s feature of sociality properly. A routing protocol based on Historical Intervals of Contacts(HICR) is proposed, which can take advantage of the characteristics of sociality, determine the acquaintance according to the intervals of contacts between nodes, and forward messages to nodes closer to the destination node. So message will be sent towards the direction of destination node. Simulation results show that, compared with Epidemic and Prophet, HICR can achieve higher message delivery rate under the condition where network resources are limited.
  • MA Cha, ZHONG Zi-Fa, SHI Yang-Chun
    Computer Engineering. 2011, 37(14): 88-90. https://doi.org/10.3969/j.issn.1000-3428.2011.14.028
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    A new technique for the problem of incomplete data in abnormal signal detection system is proposed. Getting inspiration from the geometry, the new method compares the incomplete date with normal data, it presents a computation method of abnormal probability. With the abnormal probability, some abnormal signals can be detected directly, and the other incomplete data can be arranged. The algorithm decreases the workload and makes good use of calculation resources. Experimental result shows that when some parameters are lost, the method can get the reasonable abnormal probability of the incomplete data.

  • GU Ku-Wen, GAO Zhong-Ge, DIAO Jin-Long
    Computer Engineering. 2011, 37(14): 91-93. https://doi.org/10.3969/j.issn.1000-3428.2011.14.029
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To solve the asymmetric problem in network bandwidth measurement, this paper puts forward an approach based on a tetrad composed of TCP and ICMP packets to measure the bi-directional bandwidth of each link in an IP network. It calculates the bi-directional bandwidth by analyzing the composition of RTT latency of each packet in an IP network and using the linear relationship between the size difference of packets and that of RTT latencies. Both theoretical analysis and simulation experiment are employed to validate the new approach.
  • WANG Wei-Hang, LIN Yong-Mao, YUE Zhao-Juan, LI Dun
    Computer Engineering. 2011, 37(14): 94-96. https://doi.org/10.3969/j.issn.1000-3428.2011.14.030
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper intensively analyzes the influence factors from the aspects of transport protocol and network node, and emphatically describes all kinds of optimization mechanisms such as congestion avoidance in media node, reducing terminal load and enhancing transfer protocols, etc. Meanwhile, it demonstrates the effectiveness of all these techniques in emulations and real networks and points out their advantages and disadvantages. All these optimization technologies are concluded and a novel research direction designing terminal performance transport protocol is given.
  • LIU Bao-Guo, YUAN Jie
    Computer Engineering. 2011, 37(14): 97-99. https://doi.org/10.3969/j.issn.1000-3428.2011.14.031
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The precision of the localization is affected due to the various reasons such as environment and hardware itself. The paper presents the Received Signal Strength Indicator(RSSI) ranging and Gauss Mixed(RGM) algorithm localization algorithm, which is based on RSSI range measurement and Gauss model. The algorithm is easy to implement and does not need to hardware extension. Simulation result shows that the proposed method obtains a more accurate localization result than the RSSI localization algorithm and has a shorter responding time.
  • TONG Xiao-Wei
    Computer Engineering. 2011, 37(14): 100-102. https://doi.org/10.3969/j.issn.1000-3428.2011.14.032
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    An improved method of Ethernet physical network topology discovery of the network management scope is provided. It only uses the public Simple Network Management Protocol(SNMP) information for analyzing, and solves the main limitation of the popular physical network discovery, that the physical link of the route and the route port of the three layer switch in a network can not be discovery, and the entire network topology can not be discovery. Using this method, the link between route, multi-layer switch, switch, network bridge and hub can be discovered. With the program based on this method, a typical network is under discovered, and the result is correct, which proves the correction of this method.
  • MAO Qi, BI Xiao-Ru, SHE Xiang-Yang
    Computer Engineering. 2011, 37(14): 103-105. https://doi.org/10.3969/j.issn.1000-3428.2011.14.033
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at problem that independent and redundant attributes of high dimensional network data cause classification algorithms’ slow detection speed and low detection rate in network intrusion detection, a feature selection approach for network intrusion based on Genetic Quantum Particle Swarm Optimization(GQPSO) algorithm is proposed. The approach organically combines selection and variation of genetic algorithm with QPSO to form GQPSO algorithm, and normalizes mutual information between attributes of network data is defined as the algorithm’s fitness function, which guides its reduction of network data attributes to realize optimal selection of network intrusion feature sub-set. Simulation experiment is done in KDDCUP1999. Result shows that compared with QPSO and PSO algorithms, the approach is more effective for feature selection of network data and improvement of network intrusion detection speed and detection rate of classification algorithms.
  • BANG Cheng, QIN Zheng, LIU Feng, LIU Jian-Rong
    Computer Engineering. 2011, 37(14): 106-108. https://doi.org/10.3969/j.issn.1000-3428.2011.14.034
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents an image steganographic method based on SM and Least Significant Bit(LSB). According to human visual characteristic, it divides an image into smooth area, transition area, and edged area by the difference value of neighboring pixels. It uses different bits LSB substitution in three areas above. Experimental results show that the proposed method provides larger embedding capacity and maintains a high visual quality of stego-image.
  • WANG Wei, ZHOU Shun-Xian
    Computer Engineering. 2011, 37(14): 109-111. https://doi.org/10.3969/j.issn.1000-3428.2011.14.035
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a special threshold secret sharing scheme among weighted participants which is based on the security of Rivest Shamir Adleman(RSA) cryptosystem, Shamir threshold secret sharing scheme and hash function. Each participant’s secret shadow is selected and saved by the participant himself, and he can share many secrets with other participants by holding only one secret shadow. In the process of information exchange, it is not necessary to pass any confidential information and the scheme does not need a secure channel between each participant and the dealer. Theoretical analysis shows that the scheme is secure, effective and easy to implement.
  • ZHANG Jian-Zhong, BANG Li-Hui, XUE Rong-Gong
    Computer Engineering. 2011, 37(14): 112-113. https://doi.org/10.3969/j.issn.1000-3428.2011.14.036
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Combined with certificateless public key cryptography with proxy blind signature, a certificateless proxy blind signature scheme is proposed. The scheme enjoys the blindness properties and untraceability, and solves the escrow problem and retains the merits of blind signature without certificate. The new scheme is proved to be secure against existential forgery on adaptively chosen message attack and chosen identity attack.

  • DIAO Bo-Fu, YAN Xiao-Chuan, TUN Chuan-Zhi
    Computer Engineering. 2011, 37(14): 114-117. https://doi.org/10.3969/j.issn.1000-3428.2011.14.037
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper analyzes the attack effect of target network and the ability of attackers, basing on Grey theory, it evaluates the ability of attackers in the process of network attacks. It gives the evaluation index system, and calculates the evaluation criterions. Experimental results in the actual network show that the method can quantitatively evaluates the ability of attacker in the process of network attacks.
  • LIU Yi, HAO Pan-Jun, LONG Liao-Jun
    Computer Engineering. 2011, 37(14): 118-119. https://doi.org/10.3969/j.issn.1000-3428.2011.14.038
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Based on RSA cryptosystem, this paper proposes a new (v, t, n) fairness secret sharing scheme. In the scheme, each participant’s secret shadow is selected by the participant himself and others do not know anything about his secret shadow. Even if v(v

  • SUN Li-Jie, DIAO Jing-Xiu, ZHENG Mei-Zhu, GAO Zhong
    Computer Engineering. 2011, 37(14): 120-122. https://doi.org/10.3969/j.issn.1000-3428.2011.14.039
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a digital image watermark algorithm based on spread spectrum mechanism. It selects the pseudo random sequence modulation for the periodic sequence of continuation, and then encrypts. Taking into account the characteristics of human visual system, the positions and strengths of embedding into the original image which uses the same chip rate coefficients of the stationary wavelet transform domain are obtained. Selecting spread spectrum sequence determines the maximum coefficients of the wavelet transform domain and the key period sequence of watermark. Experimental results show that the algorithm has strong robustness.
  • XIE Chun-Xiao, WEI Fa-Wen
    Computer Engineering. 2011, 37(14): 123-124. https://doi.org/10.3969/j.issn.1000-3428.2011.14.040
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    In the high security fields, XML documents may include information at different levels of sensitivity. It should be protected by Mandatory Access Control(MAC) policy. In order to maintain the integrality of data at high levels of sensitivity, the security labels of subjects and objects are improved. An extended MAC model called EBLP is proposed on the basis of BLP model. Security label assignment are discussed. The architecture and the access control arithmetic used to implement the fine-grained EBLP model are discussed.

  • LI Jun, BO Feng, LI Xiu-An
    Computer Engineering. 2011, 37(14): 125-127. https://doi.org/10.3969/j.issn.1000-3428.2011.14.041
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The traditional steganography methods with Pixel Value Differencing(PVD) usually only deal with the PVD in the horizontal direction but ignore the vertical one. In this paper, the cover image is divided into 2×2 nonoverlapping blocks, then the modulus function method is used in horizontal direction and the simple PVD method is used in vertical direction for steganography. The falling-off-boundary problem is solved. Experimental results show that the proposed approach provides higher stego-image quality, larger embedding capacity, and can against common attacks.
  • CHEN An-Fu, CA Guo-Yong, LIN Hang, WANG Rui-Li, LIU Guo-Bin
    Computer Engineering. 2011, 37(14): 128-130. https://doi.org/10.3969/j.issn.1000-3428.2011.14.042
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper proposes a trust model based on Dirichlet distribution in Multi-Agent System(MAS). It uses the Dirichlet distribution to solve the limitations of a binary evaluation, the trust model can rate with graded levels. A level filtering algorithm is proposed to effectively filter a variety of malicious Agent in the referrals. Experimental results show that the proposed trust model is effective in inhibiting unfair recommendations and strategies deception.

  • ZHANG Jia-Jia, ZHANG E-Beng, SUN Ji-Zhou
    Computer Engineering. 2011, 37(14): 131-133. https://doi.org/10.3969/j.issn.1000-3428.2011.14.043
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For the current Intrusion Detection System(IDS) has high false negative rate, this paper presents an intrusion detection technology based on Monkey Algorithm(MA). It uses the MA to derive a set of classification rules from network data, KDD99 data set, and the support-confidence framework is utilized as fitness function to judge the quality of each rule. The generated rules are used to detect or classify network intrusions in a real-time environment. Experimental results show that the MA-based technology can improve the quality of generating rules, so that it can improve the performance of IDS.
  • CHEN Wang, SHI Pan-Jun, TENG Hong-Fei
    Computer Engineering. 2011, 37(14): 134-136. https://doi.org/10.3969/j.issn.1000-3428.2011.14.044
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper presents Cooperative Coevolutionary Estimation of Distribution Algorithm(CCEDA) to solve Resource-constrained Project Scheduling Problem(RCPSP). It integrates the cooperative co-evolutionary framework and Estimation of Distribution Algorithm(EDA), decomposes RCPSP into several sub-problems, and then applies improved EDA to cooperatively solve these sub-problems. In order to enhance the local search ability of EDA, it gives a local search method for solutions. CCEDA is compared with GAPS, GA-DBH, GA-hybrid and GA-FBI, and experimental results on PSPLIB prove that CCEDA has better performance.

  • GAO Hong-Yuan, XU Xue-Mei, DIAO Zhong-Kai
    Computer Engineering. 2011, 37(14): 137-139. https://doi.org/10.3969/j.issn.1000-3428.2011.14.045
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the nonlinear optimization problem of Time Difference of Arrival(TDOA) location, this paper proposes the Cultural Fish Swarm(CFS) algorithm of real coding which introduces cultural operator to artificial fish swarm algorithm. By adding the solution of Chan algorithm into initial population of CFS algorithm, the CFS method can search the optimal coordinates of TDOA location fast. Simulation results show that the technology has stable performance, if the population size is small, the technology is robust and can find the coordinates of optimization, and it has higher search speed and search precision.
  • LI Yu, GUO Lei-Yong, TAN Hong-Zhou
    Computer Engineering. 2011, 37(14): 140-142. https://doi.org/10.3969/j.issn.1000-3428.2011.14.046
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at high computational complexity in Voice Activity Detection(VAD) which uses low variance spectral estimation, this paper proposes a method using noise cepstrum thresholding spectral estimation to compute noise Power Spectral Density(PSD). In speech absent period, a threshold is set for smoothing the noise cepstrum, then noise PSD is estimated by using Fast Fourier Transform(FFT), and detecting threshold in VAD system is updated. Computational complexity analysis and simulation results indicate that compared with Welch method, the computation of the method is reduced by 18%, and total time complexity of VAD is decreased.
  • KONG Lian-Fu, LIAN Xiu-Mei, DIAO Li-Jiang
    Computer Engineering. 2011, 37(14): 143-145. https://doi.org/10.3969/j.issn.1000-3428.2011.14.047
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Scale Invariant Features Transform(SIFT) algorithm is stable to rotating, scale changes and visual angle changes of the target, so this paper proposes an object identification method for a new visual monitoring platform——the baseline based on circle track adjustable binocular active vision platform. By establishing the off-line database of multifaceted SIFT features, it converts three-dimensional object into two-dimensional characterization, and uses it to realize object recognition three-dimensional space, so that the matching and recognition efficiency is improved. Experimental results show that the method can identify objects real time and accurately.
  • XIONG Yang, XIAO Fu-Tie, WANG Wei
    Computer Engineering. 2011, 37(14): 146-148. https://doi.org/10.3969/j.issn.1000-3428.2011.14.048
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    By analyzing the impacts of Least Square Support Vector Machine(LS-SVM) model hyperparameter selection on the classifier, this paper proposes a method using estimation of distribution algorithms with diversity preservation named EDA-DP to optimally select model parameters of LS-SVM. Experiments are operated to recognize the benchmarks and radar High Range Resolution Profile(HRRP) datasets by using LS-SVM classifier. Compared to the grid-based method, the average recognition rate of LS-SVM classifier based on EDA-DP are increased by 4.2% and 1.76%. Experimental results demonstrate that the classifier model with EDA-DP achieves better classification ability and generalization capacity.

  • YANG Chao, WANG Zhi-Wei
    Computer Engineering. 2011, 37(14): 149-151. https://doi.org/10.3969/j.issn.1000-3428.2011.14.049
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Considering the characteristics of complexity, randomness and nonlinear in urban traffic volume, Wavelet Neural Network(WNN) is optimized by Genetic Algorithm(GA) to overcome the problems of slow network convergence rate and falling into local minimum which exist in traditional Neural Network(NN), and prediction model of urban traffic volume based on GA-WNN is established. Simulation predictions for Nanjing West Road in Nanchang City are conducted with GA-WNN, GA-BP and WNN models, whose results show that GA-WNN model has better prediction effect, higher prediction accuracy and faster convergence speed than GA-BP and WNN models.
  • LIU Yan-Min, NIU Ben, DIAO Qiang-Zhen
    Computer Engineering. 2011, 37(14): 152-154. https://doi.org/10.3969/j.issn.1000-3428.2011.14.050
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to solve multi-objective problems efficiently, this paper proposes a clustering multi-objective Particle Swarm Optimization (PSO) algorithm based on uniform design named UCMOPSO. Crossover operation based on uniform design is adjusted to get uniformly distributed solutions in objective space to help swarm to escape from local optima, and a new clustering operator is introduced to select the representative non-dominated solutions, which decreases the computation complexity and limits the size of the external archive. Experimental results based on benchmark functions indicate that UCMOPSO has superiority in convergence and distribution compared with other algorithms.
  • LIANG Cuo-Meng, XIAO Xiao-Fang
    Computer Engineering. 2011, 37(14): 155-157. https://doi.org/10.3969/j.issn.1000-3428.2011.14.051
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper researches the regression of the first spherical model and its mugget structure of theoretic variogram, and takes advantages of the Particle Swarm Optimization(PSO) algorithm which has outstanding advantages in solving nonlinear optimization problems for the rapid convergence and the effectiveness of global optimization. Its combination of the parameters in the spherical model are considered as a vector, during the interation of PSO algorithm, and mixed Cauchy-Gaussian mutation is carried out on part of the particles. The automtic regression of the spherical model is achieved. Simulation results show that this method is simple and has high reliability.
  • YANG Fan, ZHENG Chun-Gong, YANG Gang
    Computer Engineering. 2011, 37(14): 158-160. https://doi.org/10.3969/j.issn.1000-3428.2011.14.052
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The traditional fixed bandwidth Mean-Shift tracking algorithm can not have an effective tracking for any changes in targets. An novel method is proposed that is multi-scale space theory combined with Unscented Kalman Filter(UKF). UKF filter is introduced to predict the information in the tracking window which is calculated by the multi-scale space theory. The proportion of the target image area is got by the modified information. It is implemented by the combination of the Mean-Shift tracking algorithm and UKF to track targets. Experimental result confirms the effectiveness of the improved algorithm.
  • HUANG Bao-Ling
    Computer Engineering. 2011, 37(14): 161-163. https://doi.org/10.3969/j.issn.1000-3428.2011.14.053
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to overcome the slow convergence rate, too much number of iterations and the fixed heredity probability is extremely easy in the heredity operation to destroy questions and so on high compatible individual. According to the differences of the parameters of the generating papers, this paper uses incomplete random searching strategy. For the low adaptability of individual, it uses crossover, mutation operators for rapid elimination. As the meanwhile, it uses an iterative process to increase the best individual saving mechanisms and to decrease the cost of the high computing efficiency of the generating paper. Experimental result indicates that compared with traditional algorithm, the adaptive genetic algorithm has the characteristics such as fast convergence rate, high speed of running times and more accuracy of generating papers.
  • LI Dun-Wei, ZHOU Li-Jian, CUI Hua-Mei
    Computer Engineering. 2011, 37(14): 164-166. https://doi.org/10.3969/j.issn.1000-3428.2011.14.054
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Because the fiducial point location is inaccuracy and time-consuming in fingerprint match, a new match algorithm based on improved fiducial point location is proposed. The algorithm constructs a local structure with the help of the core point, and figures out a fiducial point in this structure by using the principle of congruent triangles. All the minutiae features are expressed in polar coordinates, and the final decision can be made with a changeable boundary box method. Experimental results prove that the fiducial point location is more accuracy and the time is saved, thereby the recognition rate and efficiency are enhanced.
  • HUANG Yong
    Computer Engineering. 2011, 37(14): 167-168. https://doi.org/10.3969/j.issn.1000-3428.2011.14.055
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A facial expression recognition method based on Sparse Preserving Discriminant Analysis(SPDA) is proposed. The graph in SPDA is constructed by sparse representation, and thus the local structure information is automatically modeled, and with the natural discriminative power of sparse representation, SPDA can get better performance only resorting to very few extra unlabeled samples. Experimental result on CED-WYU and JAFFE show that SPDA is an effective method for improving the recognition accuracy.
  • SONG Kun, LI Li-Juan, DIAO Yang-Kai
    Computer Engineering. 2011, 37(14): 169-171. https://doi.org/10.3969/j.issn.1000-3428.2011.14.056
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The single model of the object with multiple working positions usually suffer from bad accuracy. To solve the problem, a Least Squares-Support Vector Machine(LS-SVM) multi-model modeling method based on affinity propagation clustering is presented. In this method, affinity propagation clustering is used to cluster training samples. The sub-models are trained by LS-SVM. The predicted values of the test samples are estimated by the sub-models after it is classified by similarity measurement. The proposed method is applied for soft-sensing modeling to predict the propylene concentration. Experimental results indicate that the proposed method has a superior regression accuracy and good generalization ability.
  • CHEN Li, XU Dong-Beng
    Computer Engineering. 2011, 37(14): 172-174. https://doi.org/10.3969/j.issn.1000-3428.2011.14.057
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper sets up a new Support Vector Machine-Gussian Mixture Model(SVM-GMM) to improve speaker recognition rate based on open-set. The basic idea of the new model is that the classification results of the SVM are confirmed with GMM. Due to the good classification performance of SVM and the good description of the internal similarity of some category of GMM, the good recognition effect can be obtained by combining the two models. Experimental results show that using SVM-GMM model can improve the open-set speaker recognition rate effectively.
  • SUN Yan, WANG Chao-Li, YANG E-Min
    Computer Engineering. 2011, 37(14): 175-177. https://doi.org/10.3969/j.issn.1000-3428.2011.14.058
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper investigates the visual servoing tracking problem of nonholonomic mobile robots. The fuzzy logic control approach is exploited to design a tracking controller for nonholonomic mobile robots with uncalibrated visual parameters. Its fuzzy logic control part is built by using Mamdani inference system including if-then rules and the centroid of area method as its deffuzification strategy. The outputs of the system are linear velocities and angular velocities. The effectiveness of the method is illustrated in the simulation study.
  • QIN Jiao-Long, WANG Wei
    Computer Engineering. 2011, 37(14): 178-179. https://doi.org/10.3969/j.issn.1000-3428.2011.14.059
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    CombineBagging is designed as a new classification method based on bagging combination for imbalanced data. The main points are as follows: using three different base classifiers learning algorithms, such as C-SVM, Radial Basis Function(RBF) neural network and random forests, to carry out bagging ensemble learning respectively, integrating the three different learning results above into one as the final result by applying voting rule. Experimental results show that CombineBagging method can enhance the minority data’s classification accuracy rate on the five different regions imbalanced data. It is proved that the method can deal with the problem of imbalanced data.
  • LIU Wen-Yuan, TIAN Liu-Fang, WANG Chang-Wu, WANG Bao-Wen
    Computer Engineering. 2011, 37(14): 180-182. https://doi.org/10.3969/j.issn.1000-3428.2011.14.060
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Based on the idea of Gibbs sampling, this paper initializes the first population by selecting the candidate motifs corresponding to the peaks, and proposes an improved motif identification algorithm. The definition of the fitness function adds a parameter, the number of occurrences of a motif, more in line with the characteristics of biological data. In order to maintain the diversity of population, the algorithm uses the IUPAC degenerate code for mutation. Test result of real data in the DBTSS database shows that this algorithm has higher identification precision and quick search speed.
  • TIAN Zhao, SHE Wei, XIE Yang-Dong
    Computer Engineering. 2011, 37(14): 183-185. https://doi.org/10.3969/j.issn.1000-3428.2011.14.061
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper defines a kind of Fuzzy Time Petri Nets(FTPN) to simulate the behavior of real-time system limited by time. It studies the conflict with time attribute and space-time collision in real-time system and utilizes time constraints property and the collision probability to resolve the conflict through knowledge reasoning of fuzzy time interval. Compared with existing methods of conflict analysis and resolution, it takes into account the uncertainty of the time with the system of conflict and contact behavior, to better simulate and analyze real-time system in reality.
  • CHEN Sen, JIANG Jiang, CHEN Yang-Wu, CHEN Yong-Beng
    Computer Engineering. 2011, 37(14): 186-188. https://doi.org/10.3969/j.issn.1000-3428.2011.14.062
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a class of Non-deterministic Vehicle Routing Problem(N-DVRP) with stochastic demand and variable network structure. By analyzing the impact derived from uncertainty of stochastic demand and variable network structure, a N-DVRP model is constructed, and a Dynamical Accelerating Adaptive Genetic Algorithm(DA-AGA) is designed to solve the problem. Simulation results show the rationality and feasibility of the model and algorithm proposed.
  • LI Hong
    Computer Engineering. 2011, 37(14): 189-191. https://doi.org/10.3969/j.issn.1000-3428.2011.14.063
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    In order to solve the problem of conversion from the finer level of granularity to the coarser level of granularity, this paper proposes a formal method for granular synthesis based on category theory. It takes the granular structure as the granular object, the granular structure mapping as the granular morphism, then the granular object and the granular morphism composes the granular structure category. It uses the granular pushout to achieve the granular merging, and gets the granular synthesis algorithm GrSA. It illustrates the method with the concrete examples, which solves the granular synthesis issue. This method can realize the conversions between the levels of granularity.

  • KUANG Jian-Hui, SUN Ji-Feng
    Computer Engineering. 2011, 37(14): 192-194. https://doi.org/10.3969/j.issn.1000-3428.2011.14.064
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A method for target recognition in cluttered images is presented. The Canny operator and polygon are used to calculate and approximate the contour curve, the k Adjacent Segments(kAS) feature is calculated, and the kAS codebook is obtained by using ISODATA clustering algorithm. Block-weighted kAS histogram is used in feature extraction, Support Vectorl Machine(SVM) is applied to the training process and the classification process. Experimental results show that this method can get higher recognition rate, with the property of translation and scaling invariance.
  • LIU Jin-Wei, TANG Dun
    Computer Engineering. 2011, 37(14): 195-196. https://doi.org/10.3969/j.issn.1000-3428.2011.14.065
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    By analyzing the reasons for the low detection rate of the existing real-value negative selection algorithms, an improved negative selection algorithm is proposed with the identification of boundary samples to improve the coverage of holes. Detailed realization and advantages of the algorithm are given. The experiments of synthetic 2DSyntheticData and real biomedical data sets are done to test the algorithm. Experimental results show that the algorithm has higher detection rate and needs less detector numbers. It has optimum overall performance.
  • ZHANG Zhi-Hao, HU Wen-Long
    Computer Engineering. 2011, 37(14): 197-199. https://doi.org/10.3969/j.issn.1000-3428.2011.14.066
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To solve the problem of vehicle light interference on nighttime object detection, a method of eliminating the light interference based on Support Vector Machine(SVM) is proposed in this paper. Foreground region is extracted from the input video by means of background subtraction. Features of gray distribution and texture are extracted from the blocks, which foreground region is divided into. An optimal subset of features is selected as input vector of SVM for training and recognition. Block recognized as light is eliminated. Experimental results demonstrate that SVM based method is more accurate and faster than other classifiers when used to eliminate the light interference.
  • SHANG Zhe, LIU Mo-Chen, ZHENG Guan
    Computer Engineering. 2011, 37(14): 200-201. https://doi.org/10.3969/j.issn.1000-3428.2011.14.067
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Existing battery State of Charge(SOC) estimation methods are time consuming for the training and learning process, and it restricts the application in electrical vehicles. In order to resolve the problem, this paper uses Cerebellar Model Articulation Controller(CMAC) neural network to estimate SOC. The CMAC neural network has simpler learning algorithms and it has the ability of approximating arbitrary nonlinear functions. Experiment using the data of nickel hydride batteries demonstrate the better learning speed and convergence of CMAC method compared with Back Propagation(BP) neural network, it can meet the real time requirement in SOC, and the estimation error of the CMAC is acceptable.

  • FU Zhuo-Jun, HUANG Huang, LI Xiang
    Computer Engineering. 2011, 37(14): 202-204. https://doi.org/10.3969/j.issn.1000-3428.2011.14.068
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem of determining all parameters of fuzzy production rules in building a Fuzzy Petri Net(FPN), by introducing a new FPN reasoning mechanism, this paper uses virtual places and virtual transitions to construct layered FPN model. Its realization does not depend on experiential data, and the requirements for primary input are not critical. Simulation experimental result shows that for the input data that do not include training samples, the reasoning mechanism possesses strong generalizing capability and self-adjustion.
  • CENG Jia-Dun, LIU Zhi-Gang, HUANG Yuan-Liang, LIU Xin-Dong
    Computer Engineering. 2011, 37(14): 205-207. https://doi.org/10.3969/j.issn.1000-3428.2011.14.069
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at problem that Particle Swarm Optimization(PSO) algorithm falls into local optimum easily, this paper presents a PSO algorithm based on sub-region. It makes the search space some sub-region, uses the PSO algorithm to optimize in each region, compares these sub- region global optimums and finds out the search space global optimums. Results compared with standard PSO algorithm and adaptive mutation PSO algorithm show that this algorithm can reduce the probability of optimizing which falls into local optimum, and it has strong optimization ability.
  • ZHENG Ze-Ping, WANG Mo-Liang, ZHENG Jian-Wei
    Computer Engineering. 2011, 37(14): 208-210. https://doi.org/10.3969/j.issn.1000-3428.2011.14.070
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Taking account of the complex structure of the speech features, which is affected by the change of volume, emotion, health and other factors, a new method for Speaker Recognition(SR) based on Relevance Vector Machine(RVM) using locality preserving kernel is proposed. RVM using locality preserving kernel introduces intra-class similarity into Gaussian kernel function to keep the data set’s neighborhood structure, and is applied into SR. For the purpose of avoiding the inverse matrix operation and applying to a larger sample, the new method uses a fast algorithm for training. Experimental results show that the new classifier model speeds up the test speed and improves the classification accuracy.
  • BANG Hu, ZHANG Hai, DENG Chang-Shou
    Computer Engineering. 2011, 37(14): 211-213. https://doi.org/10.3969/j.issn.1000-3428.2011.14.071
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Particle Swarm Optimization(PSO) algorithm has existed premature convergence for multimodal search problems. In order to enhance the global search ability and increase the speed of convergence, this paper proposes a Dynamic Neighborhood Hybrid Particle Swarm Optimization(DNH_PSO) algorithm using local particle swarm model, the random topology and the von Neumann topology are combined to form dynamic neighborhood topology, improving the algorithm’s global search ability, meanwhile in order to enhance the local search ability and convergence speed, the use of particles neighborhood comprehensive learning strategy, and introduction of quasi-Newton method. Experimental comparative analysis with other variant PSO shows that the algorithm for the multimodal search problems has better global convergence.
  • LIU Dao-Wei, GUAN Cuan
    Computer Engineering. 2011, 37(14): 214-216. https://doi.org/10.3969/j.issn.1000-3428.2011.14.072
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The special circumstances of complex forest roads and the partial convergency of phenomenon which is easily to happen in ant colony algorithm, so this paper adopts to dynamic calculation method of the value of heuristic information and dynamic updating the pheromone to improve the basic ant colony algorithm. Results show that the improved algorithm can not only find to meet practical requirements of the optimal path in a relatively short time but also improve the ability of global search. It provides a new idea and method for solving the problem of optimal forest fires fighting path.
  • HE Jin-Feng, SUN Feng, LIU Li-Jiang
    Computer Engineering. 2011, 37(14): 217-219. https://doi.org/10.3969/j.issn.1000-3428.2011.14.073
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    It is difficult to apply graph cut to texture segmentation because it can not reflect the regional characteristics of the texture pixel. Aiming at the problem, a color texture image segmentation approach based on filter bank and graph cut is presented. Texture features of image which are extracted by the filter bank is connected with H, S and I components of the image to compose texture color feature vector. The color texture is modeled with texton histograms to statistic texture color feature vector, and the pairwise texture similarity is computed by comparing windowed texton histograms. Normalized cut criterion of graph cut method is applied to solve the optimal segmentation problem with the texton histograms. Efficiency and accuracy of the method are demonstrated by the experimental results.
  • WANG Cheng-Liang, XIE Ke-Jia, LIU Cuan
    Computer Engineering. 2011, 37(14): 220-222. https://doi.org/10.3969/j.issn.1000-3428.2011.14.074
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    In multi-core computing environment, the image processing parallel algorithms can greatly improve the processing speed. However,the existing parallel designs are focused on the specific algorithms such as edge detection and image projection, which can not form a universal design scheme. Thus, it is difficult to extend this application. Based on the in-depth study of the image algorithms parallel processing mechanism and the features of the multi-core architecture, this paper proposes an image processing parallel design scheme in multi-core computing environment, which has five steps, including analysis, modeling, mapping, debugging & performance evaluation and testing & release. The paper takes the algorithm design of parallel image Fourier transforms as an example to testify the effectiveness of this scheme in single-core, double-core, quad-core and eight-core computing environment. Experimental result shows that the proposed multi-core parallel design scheme has good scalability, and this scheme can extend the space of application for image processing.

  • LIU Bai-Lu, FAN Chong, JU Zheng-Rong
    Computer Engineering. 2011, 37(14): 223-225. https://doi.org/10.3969/j.issn.1000-3428.2011.14.075
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the lack that traditional registration only considers geometric factors, in order to overcome out its disadvantage, this paper puts forward a new improvement approach based on a combined affine model of geometry and photometry. This change not only avoids the error that is brought by the keren algorithm’s tailor series expansion of angle and improves the precise of image registration greatly, but also makes the illumination maintained. The average translation error is reached to 0.165 pixels compared with the traditional affine model. Iterative Back Projection(IBP) algorithm is used for super resolution reconstruction of the image sequence. Experimental result shows that super resolution reconstruction result’s signal-to-noise ratio and the mean structural similarity index of improved algorithm have great enhancement.
  • LV Feng, ZHANG Jian-Qiu
    Computer Engineering. 2011, 37(14): 226-227. https://doi.org/10.3969/j.issn.1000-3428.2011.14.076
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper proposes an Edge-weighted Structural Similarity Index(EWSSIM), which can match well with Human Vision System(HVS). Structural Similarity Image quality assessment(SSIM) does not evaluate highly blurred and Gaussian white noise distorted images well. EWSSIM assigns different weights to contour correlation and local texture correlation of the original image and distorted image, which can represent structural similarity better than SSIM. Experimental results of LIVE image database indicate that the proposed index outperforms SSIM in blurred and Gaussian white noise distorted images and also gives a better coherent evaluation for all kinds of distortions in LIVE database.

  • WANG Meng, HUANG Hai-Feng, HE Feng, ZUO Wen-Yan
    Computer Engineering. 2011, 37(14): 228-230. https://doi.org/10.3969/j.issn.1000-3428.2011.14.077
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The image threshold segmentation algorithm based on the Particle Swarm Optimization(PSO) combined with the rough entropy based on boundary region is presented. The algorithm adopts the rough entropy based on boundary region as the valuation standard of image segmentation and converses image segmentation problem into an optimization problem and fully utilizes PSO function in the optimization field. Experimental results show that the proposed method can not only obtain the perfect performance of segmentation but also greatly improve the speed of computation, it avoids a great deal of entropy calculation for the use of PSO and the sensibility of the algorithm to the partition-size image sub-piece is low, it is a practical and effective method of image segmentation.
  • JIA Yun, LIANG Dong, BAO Wen-Xia, XU Hui, YA Pu
    Computer Engineering. 2011, 37(14): 231-232. https://doi.org/10.3969/j.issn.1000-3428.2011.14.078
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The medical image registration algorithm based on Laplacian spectrum algorithm is proposed. The idea of using graph theory as medical image point registration is proposed. By eigenvector, the higher registration precision and the strong ability have been achieved. The Laplacian spectrum of the anatomy feature point sets of the two images is constructed to match. The strategy uses the homogeneous matrix, coordinate transfer and the image interpolation to register. Experimental results show that it has more efficiency and higher registration precision than maximization of mutual information whenever in the single sensor or multi-sensor.
  • LI Feng, CA Qiong
    Computer Engineering. 2011, 37(14): 233-235. https://doi.org/10.3969/j.issn.1000-3428.2011.14.079
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper describes an effective method to detect copy-move forgery in digital images. This method works by extracting Scale Invariant Feature Transform(SIFT) descriptors of an image and by seeking for approximate nearest neighbor based on Product Quantization(PQ). The method of approximate nearest neighbor search is to decompose the space into a cartesian product of low dimensional subspaces and to quantize each subspace separately. Asymmetric Distance Computation(ADC) computes the euclidean distance between two vectors. Experimental results show that the approach can correctly detect the copy-move forgery which is preprocessed by different methods and decrease the memory usage and the complexity of learning the quantizer, at the same time, reduce the search time.
  • ZHANG Jian, YANG Chun-Hua, CAO Yu
    Computer Engineering. 2011, 37(14): 236-238. https://doi.org/10.3969/j.issn.1000-3428.2011.14.080
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In the view of the present situation that the communication systems in the underground mine are closed and incompatible each other, a scheme design of Digital Mine(DM) communication network system based on WiFi is proposed, and a wireless base station using to construct the communication network system is developed. The wireless base station employs advanced System On Programmable Chip(SOPC) technology, which implements the functions of WiFi voice communication, WiFi video monitoring, personnel positioning and so on, and accordingly provides the technical support for visualization, management and control in the mine resources exploitation process. Test results show that the performances of the wireless based station are good, which meet the actual application requirements.
  • ZHANG Chuan-Biao, NI Jian-Jun, MIAO Gong-Xia, HAN Guang-Ji
    Computer Engineering. 2011, 37(14): 239-241. https://doi.org/10.3969/j.issn.1000-3428.2011.14.081
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to overcome the shortcomings of conventional Kernel Principal Component Analysis(KPCA) method in modeling and analyzing of large sample data(e.g., high computational complexity, long time modeling and large storage space etc.), a fast KPCA method based on Similarity Function(SF-KPCA) is proposed. The similarity function matrix of a large data samples is established to analyze the similarity between data samples, and the redundant data is eliminated. The KPCA model using the optimized data samples is built. The data samples are analyzed. The method is applied to the fault diagnosis of high voltage circuit breaker. Simulation results show the proposed method’s rapidity and effectivity.
  • LI Feng, KONG Fan-Rang, HE Qing-Bei
    Computer Engineering. 2011, 37(14): 242-244. https://doi.org/10.3969/j.issn.1000-3428.2011.14.082
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Based on the self-similarity in vibration time series of gearboxes, local scaling analysis is developed to extract the weak information in vibration signals. Combining local scaling exponents and Principal Component Analysis(PCA), low dimensional principal components of local scaling exponents statistics are used to monitor the conditions of gearboxes. Experimental results indicate the proposed method has high efficiency and correct rate on gearbox condition monitoring.

  • WANG Jian-Song, LUO Jia-Rong, CHENG Feng, LIU Zhi-Min, HU Chun-Dong, XIAO Long-Jiang
    Computer Engineering. 2011, 37(14): 245-247. https://doi.org/10.3969/j.issn.1000-3428.2011.14.083
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper designs a central timing system for Neutral Beam Injector(NBI) test bench, which is responsible for coordinating subsystems under control clock. Friendly interactive interfaces, developed with VC++6.0, are used for configuration and monitoring states of NBI. QNX RTOS is adopted on the lower-PC configured with AdLink CPCI Industrial Personal Computer(IPC) and CPCI-7249R digital I/O card. The IPC is responsible for timing pulse generation and output. As a result of the experiments, the timing system can obtain a high accuracy of 100 μs with stable and reliable capabilities, and well meets the experimental requirements of NBI test bench.
  • ZHOU Hai-Xiang, GE Ning, XU Li-Xin, LI Yu-Gong
    Computer Engineering. 2011, 37(14): 248-250. https://doi.org/10.3969/j.issn.1000-3428.2011.14.084
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    In order to raise the level of design abstraction and simulation speed of Scalable Processor Architecture(SPARC) processor, a SPARC V8 processor Transaction Level Model(TLM) is designed in this paper. This model is based on TLM2.0 standard and interpretive instruction set simulation technology. Results of the test show that the model can execute and trace SPARC V8 programs exactly and the simulation speed of it is improved two orders of magnitude than Register Transfer Level(RTL) design.

  • HU Chi, QIN Bin, LI Dong, HU Dong-Ning
    Computer Engineering. 2011, 37(14): 251-253. https://doi.org/10.3969/j.issn.1000-3428.2011.14.085
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Aiming at the actual operation requirements of CYCHU-10 cyclotron, based on Finite State Machine(FSM) theory, this paper proposes a hierarchic design method for cyclotron control system, models and simulates the system with Stateflow under Simulink environment. Simulation result indicates that it is easy to reflect the dynamic logic of a complex system with the method, and it has strong usability and reliability.

  • LIU Feng, ZHANG Yun, YOU Zhi-Jiang, KUANG Ji-Shun, BANG Cheng
    Computer Engineering. 2011, 37(14): 254-255. https://doi.org/10.3969/j.issn.1000-3428.2011.14.086
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For the test application time can be reduced effectively, this paper proposes an approach based on scan chain disabling technique, in view of incompatible test vector compression method. The incompatible sub-scan chain between two test vectors is explored, which the latter test vector can be obtained from certain bits by its scan input and front certain bits of its former test vector. Experimental results show that this method reduces test application time effectively.
  • WANG Jun, LUO Jia-Xiang, HU Ti-Meng
    Computer Engineering. 2011, 37(14): 256-258. https://doi.org/10.3969/j.issn.1000-3428.2011.14.087
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to promote the production efficiency of chip mounter, the component mounting sequence is optimized. An improved Ant Colony Algorithm(ACA) is proposed to solve the problem. In this algorithm, the reference solution set in scatter search is introduced into cunning ant colony optimization algorithm to take part in the ants’ route selection, aiming to improve the global search ability of the algorithm. Experimental results are compared with those of the traditional cunning ant colony system.
  • ZHANG Fu-Chen, YANG Hong-Liang
    Computer Engineering. 2011, 37(14): 259-261. https://doi.org/10.3969/j.issn.1000-3428.2011.14.088
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To solve the the chaos synchronization problems of Information decryption in secrecy communication, linear feedback control approach is proposed. It proofs that chaos system applied in the communication has boundedness, then the boundedness is used to design the linear controller. It proposes linear control to make two identical new chaotic systems globally asymptotically synchronization. Experimental results demonstrate the effectiveness of the proposed approach.
  • NIE Dun-Lan, DIAO Jing-Ping, WANG Yan-Fen
    Computer Engineering. 2011, 37(14): 262-264. https://doi.org/10.3969/j.issn.1000-3428.2011.14.089
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In the process of progressively-variant texture synthesis, because of the change of texture scale and direction, it needs constant resampling. In order to avoid resampling and accelerate the speed of texture synthesis, this paper adopts linear function as the transition function of texture scale, first of all, progressively-variant texture is synthesized in two-dimensional space, then uses this new texture sample and the control of vector to synthesize a progressively-variant texture on a 3D mesh. In order to prevent texture elements break apart, it adopts gray-scale image to assist synthesizing. Experimental results show that the method can produce smooth texture in most nature texture synthesis and obtain satisfactory results in synthesis efficiency.
  • DIAO Guang-Na, TUN Cheng-Rong
    Computer Engineering. 2011, 37(14): 265-267. https://doi.org/10.3969/j.issn.1000-3428.2011.14.090
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Considering the strong computing ability and a high degree of parallel architecture of Graphic Processing Unit(GPU), the paper chooses one of multiple string match algorithms based on bit-parallelism, called M-BNDM algorithm, which is to be implemented on GPU and optimized. The process for string matching is simplified to bit operation that is more suitable for data computing of Compute Unified Device Architecture (CUDA) through data preprocessing. Experimental result shows the solution is about 10 times faster than equivalent CPU algorithm. Furthermore, some factors that will infect string matching performance are analyzed.

  • CHEN Jing-Jing
    Computer Engineering. 2011, 37(14): 268-270. https://doi.org/10.3969/j.issn.1000-3428.2011.14.091
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Aiming at the test papers generating problems in examination system, a recursion random division algorithm is presented. The algorithm need input parameters for generating test papers. It uses probability density function and matrix equation to calculate parameters. It confirms the number of draw-out questions in different types and different difficulty. It uses the algorithm to generate test papers. The efficiency and adaptivity of the algorithm are demonstrated by analyzing the algorithm and evaluating the generated test papers, and the algorithm meets the requirements of examination system well.

  • CHEN Yan-Hui, CHU Xiao-Dong, WANG Wei
    Computer Engineering. 2011, 37(14): 271-273. https://doi.org/10.3969/j.issn.1000-3428.2011.14.092
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Two enhanced algorithms are proposed to solve the problem that the lookup table based priority bit map algorithm occupies a large storage space. One of the optimized algorithms reduces the size of the table by remove the redundant data from table. The other optimized algorithm gets the highest priority task which is in the ready state by a new method. It completely rejects the way of Lookup-table. Analysis result shows the enhanced algorithm can save a large storage space.
  • SUN Ban, CHEN Peng, FENG Jia-Qin, SHU Li
    Computer Engineering. 2011, 37(14): 274-276. https://doi.org/10.3969/j.issn.1000-3428.2011.14.093
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to reduce the cost of power and the time of transmission in the public transport vehicle wireless data transmission, this paper proposes a schedule strategy based on Wireless Fidelity(WIFI). The strategy models a solution by applying genetic algorithm to obtain a public transport vehicle sequence which satisfies the schedule process. Simulation results demonstrate that compared with the traditional First Come First Served(FCFS) policy, the proposed schedule strategy performs much better by saving 16.8% power cost and reducing 38% high priority data transmission time.
  • QING Lin-Bei, CHEN Wei-Gong, HE Xiao-Hai
    Computer Engineering. 2011, 37(14): 277-279. https://doi.org/10.3969/j.issn.1000-3428.2011.14.094
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to improve the quality of Side Information(SI), without significantly increase the complexity at the same time, a new SI generation algorithm jointly using full-pixel and half-pixel Motion Compensation Interpolation(MCI) is proposed. A quality decision factor namely SI confidence is proposed to indicate the quality of SI. According to the SI confidence whether overtakes the threshold, the algorithm adaptively switches between full-pixel MCI and half-pixel MCI. Experimental results indicate that the proposed algorithm can significantly reduce the decode complexity without causing efficiency loses when compared with traditional SI reconstruction based on sub-pixel method.
  • WANG Min, WANG Lian-Guo, LIU Cheng-Zhong
    Computer Engineering. 2011, 37(14): 280-281. https://doi.org/10.3969/j.issn.1000-3428.2011.14.095
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In this paper, a power amplifiers behavioral model based on QR-RLS algorithm is introduced. In this model, the Gives circumgyration, which can efficiently enhances the calculation efficiency of QR-RLS algorithms, is used to improve the update speed of Digital Predistortion(DPD) model coefficients, and in turn, fasten the convergence speed of the DPD model. It measures a 44 dBm two-carrier WIMAX Power Amplifier(PA) and builds the dynamic DPD model based on input and output data obtained form the test. Performance analysis of dynamic model shows the model can not only describe and correct the nonlinear characteristic of wide-band power amplifier efficiently, but also obtain the value of model coefficients in faster speed and more dynamic method.
  • ZHANG Tian-You, WANG Xiao-Ling
    Computer Engineering. 2011, 37(14): 282-284. https://doi.org/10.3969/j.issn.1000-3428.2011.14.096
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the characteristics of spatial data sets, this paper proposes an outlier detection algorithm based on the Space Local Deviation Factor(SLDF). The algorithm uses SLDF to measure the deviate degree of space points object. It calculates all the points’ SLDF, sorts by their values, and uses the top M as the space outlier. Experimental result shows that the algorithm can well detect space outlier and be more applicable to the high dimensional and large data sets, its validity and accuracy of the algorithm are superior to that of SLZ algorithm.
  • YANG Han-Yue, CHEN Xiao-Rong, ZHENG Gao-Shan
    Computer Engineering. 2011, 37(14): 285-287. https://doi.org/10.3969/j.issn.1000-3428.2011.14.097
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to work out the problems that the method coding Shui nationality characters is difficult, a coding method based on stroke shape for Shui nationality characters is proposed. The shape of 467 Shui nationality words of the Common Shui Script Dictionary is analyzed, and seven kinds of basic strokes consists mainly of Shui characters. Through the statistical comparison, 21 kinds of stroke shape are subdivided. Shui nationality word is code by an orderly sequence composed by three strokes on its corners according to the coding rules.
  • LI Jian-Xun, FAN Xiao-Guang, ZHANG Zhe, MO Meng
    Computer Engineering. 2011, 37(14): 288-290. https://doi.org/10.3969/j.issn.1000-3428.2011.14.098
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A description of the current dynamic slot allocation algorithms is provided from the perspective of difference in time frame construction. It analyzes the performance of algorithms based on each characteristic. Based on algorithm of bintree average allocation in the block, an improved dynamic slot allocation algorithm is proposed, which aims at allocating slot for users according to the urgency or priority of their requirements in real time and sustains the requirement of transmitting longer message in time-slot block. Simulation results show that the algorithm can reduce the message delay, and thus is applicable to the situation where the users have urgent requirements.
  • DIAO Qiu-Jun, WANG Yi-Gang, HUANG An-Zhong, TUN Yu-Hui
    Computer Engineering. 2011, 37(14): 291-292. https://doi.org/10.3969/j.issn.1000-3428.2011.14.099
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the design requirement of the Theme Pavilion of the World Expo 2010, this paper proposes and implements a low-cost multi-touch real-time interactive tabletop system. The design and implementation of multi-touch screen based on Frustrated Total Internal Reflection(FTIR) is introduced. Improved Minimum Distance First(MDF) algorithm and string similar degree algorithm are adopted to recognize the interaction gesture. In order to form a large screen, it adopts software-based seamlessly merging solution, which includes geometry calibration and edge blending. Application results indicate that this system has characteristics such as real-time, interactivity and entertainment.