Current Issue

• 2010, No. 1　Published:18 January 2010 Last issue    Next issue
  Columns in this issue: 论文

• 论文

  The Block Delay Control Based on Wireless Network Coding

  XU Kui, DAI Ban, HUANG Ben-Xiong, ZHANG Bei

  2010, 32(1): 1-4. doi:

  Abstract ( 900 )   PDF (650KB) ( 525 )   　　

  Network coding is designed for wireless networks to improve reliability and throughput. In practical wireless network coding schemes, information is always divided into blocks, and the processing of network coding is carried out within blocks. Size is always the crucial issue during the transmission time of blocks. In the current network coding schemes, the size of a block has to be decided before transmission. If the predecided size is too big, block delay may become intolerable. In this paper, the object function of a block size estimation algorithm is firstly introduced, and then, an adaptive algorithm of block size choice for delaysensitive applications is designed. And the tradeoff between block delay and throughput is discussed. By adjusting the sizes of blocks in wireless networks adaptively, this algorithm can satisfy the block delay requirements of the applications when the network coding scheme is running.

  A Least Interference Path Algorithm for MPLS Based on Source Trees

  LONG Feng-Fei, YI Jian-Bei

  2010, 32(1): 5-7. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 547 )   PDF (408KB) ( 350 )   　　

  Maintaining multicast information needs additional hardware overhead, and making the multicast architecture lacks scalability, thus limiting the development of multicast services. This paper applies a least interference path algorithm for MPLS in the multicast, adds multicast information table in the branch nodes MPLS, and implements the sourcetree multicast over MPLS, so  it is able to solve the difficulties of label distribution on data transmission in the MPLS multicast to achieve a good scalability. The simulation result demonstrates that the application of the least Interference path algorithm over MPLS saves bandwidth and improves multicast capability.

  An Ad Hoc CrossLayer Routing Method Base on Path Holding Probability

  ZHANG Jian-Wu, JU Jing-Yuan, DIAO Qi

  2010, 32(1): 8-9. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 599 )   PDF (415KB) ( 395 )   　　

  Based on routing stability, this paper presents an Ad Hoc crosslayer routing approach. According to the distance between the nodes, the transmit power is altered, and the node power can be efficiently decreased. The simulation results show that the stability of routing can be ensured and the power can be saved.

  A Data Synchronization Method Based on Physical Disconnection in Mobile Applications

  TAO Rui, TUN Jian, ZHOU Chun-Li

  2010, 32(1): 10-12. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 636 )   PDF (757KB) ( 556 )   　　

  The development of embedded technology and modern communications technology, together with the emergence of a new generation of communications standards, makes the use of smart mobile devices for mobile computing possible. This paper presents a data synchronization method in physical isolation environment for mobile applications，introduces the background of the application, designs the overall scheme of the synchronization system, explains the sync process and steps, and describes the conflict detection and elimination in detail. With an incremental approach, the volume of data exchange is reduced, and data security is ensured .

  Research and Implementation of an Enhanced Virtual Router Redundancy Protocol with Dynamic Load Balancing

  GUAN Rui-Dong, SUN Wen-Qing

  2010, 32(1): 13-17. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 799 )   PDF (818KB) ( 517 )   　　

  Virtual Router Redundancy Protocol (VRRP) is designed to eliminate the single point failures in the static default routing environment of LANs. The original VRRP protocol does not support dynamic load balancing, and the bandwidth use and optimization of resources are yet to be improved. This paper proposes EVRRP,which is called enhanced VRRP,based on the principle of VRRP. Each router periodically exchanges information to determine the status of the master and backups. The master router distributes the virtual MAC answers the ARP/ND requests on the basis of the load balancing algorithms, and achieves the dynamic loadsharing of traffic. EVRRP is designed and achieved, which is compatible with the current standard VRRP.

  Design and Research of an OTP Authentication Mechanism Based on the STK Card

  LIU Hui, CHENG Liang

  2010, 32(1): 18-20. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 481 )   PDF (871KB) ( 361 )   　　

  As for the weaknesses of onetime password schemes, a onetime password authentication scheme based the STK card is designed,and gives the related authentication model and authentication protocol. The OTA technique and the chaos array in the chaos theory are applied to the OTP generating progress,and the OTP is generated by the STK card for the user to use it for authentication. This scheme can overcome the weaknesses of other schemes.

  Research on an Innernet Access Control System Based on the ARP Protocol

  GUO You-Yan, DU Ye, WANG Yang, HAN Xiang-Fei, SUN Yi, CHEN Ji, JIANG Lin

  2010, 32(1): 21-24. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 633 )   PDF (944KB) ( 346 )   　　

  A distributed Innernet access control system using the ARP protocol is proposed in this paper for the purpose of solving the problems of the existing techniques. Firstly, the system framework is introduced. Then, the characteristics of entities, system working principles and flow charts are described in detail. In the end, the advantages of this system are summarized, such as the admittance control across different network segments, the distributed data collecting and processing, and the prevention of singlepoint failures.

  Research on the SelfOrganization Performance of  Wireless Sensor Networks Based on Graph Theory

  LI Chao, BANG Li, DIAO Long

  2010, 32(1): 25-28. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 762 )   PDF (906KB) ( 523 )   　　

  Wireless sensor network is paid increasing attention and lots of control methods are emerging. However, most evaluation of selforganization performance is still on the stage of qualitative analysis. Focusing on the connection and coverage of WSNs, this paper uses the Delaunay triangulation to describe node entities with their relationships and the information transmission and fusion between nodes. And the Voronoi diagram is applied to evaluate the coverage region of nodes. In addition, this paper uses selforganization degree to make an quantitative analysis on the whole selforganization process. Simulation shows that the proposed method can evaluate the performance of the WSN selforganization algorithms well.

  Research and Implementation of CA Security Authentication System(CASAS)

  SHANG Jian-Zhong, GU Hua-Jiang

  2010, 32(1): 29-31. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 665 )   PDF (858KB) ( 1069 )   　　

  This paper proposes a solution to constructing the CA security authentication system(CASAS) for the tobacco monopoly enterprises. This solution addresses the certificate centre, the catalogue service, the registration authority, and the secret key administration centre, and enhances the overall security of network systems. This solution has been used in practice, and is proved to be feasible.

  Research on the MegaBits Network Environment’s Open Model of IntrusionPrevention Systems Based on the Script

  LIANG Bei, DENG Hui, WANG Feng

  2010, 32(1): 32-34. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 550 )   PDF (628KB) ( 402 )   　　

  Based on the Common Intrusion Prevention Framework (CIDF) and the NetworkBased Intrusion Prevention System (NIPS) standards, we present an intrusion prevention system called Gigabits IPS (GIPS), which is used to improve the prevention speed and accuracy, and to ensure highspeed network monitoring. The GIPS consists of the data capture module, the event generation engine, the policy script interpreter and the intrusion prevention module. With the script description, we implement a megabits network environment's cluster open model of intrusion prevention systems.

  A SemanticCluster Query Algorithm forSelfOrganized P2P Networks

  SHU Gui-Meng, JIN Shi-Yao, HUANG Gong-Bing

  2010, 32(1): 39-43. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 791 )   PDF (751KB) ( 392 )   　　

  Recently, more and more peers join in peerto peer networks to share resources. The number of peers is so huge that it is very challenging to query all the resources' semantic distribution and get all the semantics of resource clusters. In order to solve this problem, this paper presents a selforganized P2P network oriented cluster semantics query algorithm SCQASPNSR (a Semantic Cluster Query Algorithm for Self organized P2P Network by Social Relationships). SCQASPNSR can efficiently compute all the cluster semantics of the whole P2P network and provides a strong support for studying resources distribution, data mining and knowledge discovery.

  Improved 1+ε Approximation Algorithms forthe Balls in High Dimensions via CoreSets

  FAN Ke-Lei, LUAN Jun-Feng

  2010, 32(1): 44-46. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 647 )   PDF (749KB) ( 471 )   　　

  The minimum enclosing ball problem means to construct a ball of the minimum radius enclosing a given set of balls in 〖WTBX〗S〖WTBZ〗.We propose the concept of the diameter of a set of balls and give an approximation algorithm solve the diameter. We developthe 1+ε approximation algorithm using coresets. The time complexity of this algorithm is O(nd/ε+d2/ε〖SX(〗32〖SX)〗(1/ε+d)log(1/ε)). We prove the existence of the coresets of size O(1/ε) are unrelated to n and d.

  A Hybrid Adaptive Mutation Particle Swarm Optimization Algorithm for JobShop Scheduling

  DENG Ci-Yun, CHEN Huan-Wen, LIU Ze-Wen, MO Jie

  2010, 32(1): 47-49. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 910 )   PDF (575KB) ( 423 )   　　

  A Hybrid Adaptive Mutation Particle Swarm Optimization algorithm is proposed for the Job Shop scheduling problem. In the process of running, the mutation probability for the current best particle is determined by two factors: the variance of the population's fitness and the current optimal solution. Through combining genetic algorithms and simulated annealing algorithms with the Adaptive Mutation PSO algorithm, numerical simulation demonstrates that within the framework of the newly designed hybrid algorithm, the NPhard classic job shop scheduling problem can be solved efficiently.

  Advances in Satisfiability Solving Techniques

  ZHANG Jian-Min, CHEN Qing-Yu, LI Sai-Hun

  2010, 32(1): 50-54. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 531 )   PDF (423KB) ( 708 )   　　

  Solving the satisfiability of formulae is theoretically important in the practical applications of various fields, such as formal verification, electronic design automation and artificial intelligence. This paper introduces the principles of the Boolean Satisfiability and Satisfiability Modulo Theories. The existing algorithms are introduced and compared according to their types. The qualities of these algorithms are also analyzed. Finally, we discuss the current challenges, and outline the future research trend.

  A Hierarchical Reinforcement Learning Algorithm Based on Fuzzy Clustering

  ZHANG Xin, DAI Shuai

  2010, 32(1): 55-56. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 671 )   PDF (464KB) ( 408 )   　　

  A new algorithm for the automatic generation of the Option Hierarchical Reinforcement Learning is presented. The algorithm takes the state space detected by the agent as input in the initial learning phase,and clusters the states by employing fuzzy clustering. Based on the clustered state sets, the intrastrategies are learned by an experience replay procedure. As a result, the options are generated. The validity of the algorithm is demonstrated by simulation experiments.

  A  AFSABased Coupling Regress Model of Neural Network Projection Pursuit

  SHU Yuan-Hai, MO Li, LIN Quan

  2010, 32(1): 57-59. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 678 )   PDF (354KB) ( 343 )   　　

  Artifical Fishswarm Algorithm is an optimization algorithm to achieve the global optimal result by imitates fishswarm's behavior such as prey, swarm and follow. The optimization problem exists in applying neural networks to coupling the regress of projection pursuit, and using AFSA to optimize it in the learning process so as to attain the optimal projection direction, threshold and the Hermite orthogonal polynomial coefficients.The paper describes the AFS algorithm for coupling the regress model of neural networks and projection pursuit. The simulation results indicate that this algorithm gives a satisfactory forecast effect.

  A Texture Image Recognition Method Based on the Contourlet Transform and Biomimetic Pattern Recognition

  JIANG Jia-Fu, JU Gong-Mei

  2010, 32(1): 60-63. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 632 )   PDF (917KB) ( 361 )   　　

  Texture image classification is a very hot research topic. A texture image classification method based on the Contourlet Transform (CF) and Biomimetic Pattern Recognition (BPR) is proposed while introducing some prevailing classification methods. In this method, the Contourlet Tranform that obtains the inner characteristics of images is applied to extract the energy feature, and then the texture images are recognized  using the BPR algorithm. The Vistex image database is used in the simulation experiment. The experimental results show that the combination of CF and BPR improves the texture image recognition rate effectively, and the best recognition rate attains 100%.

   

  A Method of Color Fruit Image Segmentation Based on the Color Model and the Texture Feature

  XIE Zhong-Gong, GUO Xiao-Qing, JI Chang-Yang

  2010, 32(1): 64-66. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 656 )   PDF (744KB) ( 834 )   　　

  Firstly, the RGB model and the HIS model are introduced in this paper. The color fruit image under the  nature scene is segmented based on HUE and RG by using the threshold value gained according to Otsu's approach, and the results of segmentation are discussed. Secondly, the texture feature parameters to distinguish the fruit and the background are found by studying the texture differences between the fruit and the background using a gray level cooccurrence matrix. The color apple image with the similar background is segmented successfully. The experimental results show that the texture features and the color information help each other. The segmentation results are very good when the two methods are used in a green apple image including a complex background.

  The Detection of Moving Objects by a MovingCamera Based on the SIFT Features Match and MHI

  WANG Liang-Fen, ZHOU Dong-Xiang, LIANG Hua, CA Xuan-Beng

  2010, 32(1): 67-70. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 709 )   PDF (1255KB) ( 764 )   　　

  The movement of a camera makes the moving objects detection more difficult under a complex background. In order to cope with the dynamically changed background, we propose an object detection method based on the SIFT features match and Motion History Image. Firstly, the feature points are detected by the SIFT algorithm to compute the parameters of the affine transform model, guided by RANSAC, to compensate the global motion between images. Secondly, we adopt the MHI method to detect moving objects. The robustness of the SIFT features match and the validity of picking out the outliers by the  RANSAC algorithm make the parameters of the affine transform model compute accurately, and MHI shows the moving objects and the moving direction of objects clearly. The experimental results demonstrate that our algorithm can detect the moving objects accurately, and show the moving direction of the foreground objects, compared  with the Ninad Thakoor's method.

  Simulation of Fire Using Particle Systems and Texture Rendering

  CHEN Zhi-Wei, MA Xiao-Hu

  2010, 32(1): 71-73. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 629 )   PDF (532KB) ( 607 )   　　

  The simulation of irregular objects is the one of the most difficult and attractive problems in computer graphics. The simulation of fire is of a great challenge because of the variability of the shape of fire in time and space. This paper discusses the variation of the attributes of fire particles and the choice of texture slices in detail.Particle system is the most effective method for fire simulation,which uses a texture map technique to enhance the rendering quality, decrease the number of particles and accelerate the rendering affectivity. Examples show that the method meets the requirements of realtimeness and reality.