Current Issue

• 2010, No. 9　Published:02 September 2010 Last issue    Next issue
  Columns in this issue: 论文

• 论文

  A Routing Learning Algorithm on WSNs Based on the Autonomous Decentralized Systems Approach

  ZHONG Sheng1,2，ZHANG Baihai1

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

  Abstract ( 507 )   PDF (709KB) ( 403 )   　　

  This paper investigates the routing protocols for randomly distributed wireless sensor networks (WSNs). A learning algorithm is proposed for computing the path on routing,and only few information of the  adjacent nodes is necessary. By using the depth first search strategy,and remembering the historical experience of path on routing,we can find the next node,which illustrates the advantage of combining the  autonomous decentralized systems approach and the  distributed estimation learning algorithm. The simulation results show the usefulness and advantages of the developed algorithm.

  Research of the Network Model Based on User Correlation in P2P Content Distribution Networks

  ZHOU Yi1，2，XING Chuanjun2，ZHAN Xiaojuan2

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

  Abstract ( 458 )   PDF (564KB) ( 525 )   　　

  The interest of peer in CDNonP2P shows the requirement of resources. This paper analyses the structure of CDNonP2P based on interest subnet grouping,and studies the  basic type of content delivery algorithms for subnet grouping. An algorithm that selects a user peer as the CDN peer according to its status is proposed. Interestweight is used to show the correlation of the user peer resources. In this algorithm,a user peer is selected as the  CDN peer based on setting conditions.The experimental results show that the algorithm decreases the mount of CDN peers,improves the reliability of CDN,and reduces the network traffic.

  Comparing the Reliability of Networks  Using the Number of Edge Cutsets of Graphs

  LI Feng1，XU Zongben1，ZHAO Haixing2

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

  Abstract ( 384 )   PDF (305KB) ( 258 )   　　

  The number of the cutsets of a graph is a very important index in the analysis and synthesis of reliable networks. In this paper,we compute the number of the  edge cutsets of some specific graphs. Then by using the number of edge cutsets of graphs,we compare the reliability of two networks.

  Rational Distributed Computation of the RSA Private Key over the  Shared Euler Totient Function

  LI Tieniu,LI Hongda

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

  Abstract ( 496 )   PDF (350KB) ( 471 )   　　

  Along with the distributed computation becoming more and more popular,security mechanisms of the  distributed RSA key computation to enhance the strength of distributed authentication and data privacy have been developed quite a lot. However,most of them are the solutions for parties with traditional types like being semihonest or malicious. We propose a rational approach to dealing with the distributed computation of the RSA private key based on the secret sharing of the Euler totient function over polynomials,in which each player evolved is selfish and motivated to gain interest as mush as possible. The achievement is that it is a Nash equilibrium that each player follows the execution of the prescribed protocol. And the strategy survives the  iterated deletion of weakly dominated strategies

  A New Blind Signature Scheme  Based on the Quadratic Residue

  WANG Zhiwei，ZHANG Wei

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

  Abstract ( 391 )   PDF (299KB) ( 327 )   　　

  Blind signature plays an important role in cryptography. Many cryptographic researchers have made considerable achievement in this field,and have designed many schemes. However,to our knowledge,most of the existing blind signature schemes are based on the discrete logarithm problem,blinear pairings,or the RSA cryptosystem. In this paper,we propose a new blind signature scheme based on the quadratic residue. This blind signature scheme can meet the two important basic security requirements of blind signature,and because of relatively highly computational efficiency,it is suitable for mobile communications and other computationalpowerconstrained environments.

  Research of a Dynamic Trust Measurement and Prediction Method

  ZHAO Xi，WANG Xinsheng

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

  Abstract ( 437 )   PDF (664KB) ( 393 )   　　

  In an open system,trust is one of the most complex concepts in social relationships,involving many decision factors,such as assumptions,expectations and behaviors,etc. So,it is very difficult to quantify and forecast accurately. Combined with rough set and information entropy,a new dynamic trust forecasting model is proposed.Experiments show  that the new method of weight determined by conditional information entrophy can solve the problems of the bad selfadaptation and the poor data scale expansion ability  brought by the original weight determination.

  Research on the Intrusion Detection Systems Based on the Improved Apriori Algorithm

  YU Yan，WANG Jianhua,FU Wei

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

  Abstract ( 417 )   PDF (399KB) ( 279 )   　　

  In this paper,for the dynamic theory of the P2DR security model,an association rule mining algorithm is applied to the intrusion detection technology,and  the Apriori algorithm improved.The improved algorithm greatly compresses the number of association rules,and effectively reduces the result set number of rules.The experimental results show that the number of association rules can be effectively compressed,and the efficiency for network data mining is improved .This algorithm effectively decreases the misinformation rate and the rate of fail to report an invasion behavior in intrusion detection systems.

  A MarkovBased Intrution Detection Scheme for Wireless Sensor Networks

  HAN Zhijie1,ZHANG Weiwei2,CHEN Zhiguo1

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

  Abstract ( 522 )   PDF (484KB) ( 345 )   　　

  In this paper,the authors propose a lightweight denial of service (DoS) attacks detection scheme based on  a simple and efficient Markov traffic prediction model,MPDD (Markov Prediction based DoS attack Detection). In MPDD,each node detects independently Through predicting the traffic of Wireless Sensor Network,which neither special hardware nor node’s cooperation .An algorithm evaluating the reliability of alert is proposed to reduce the false alerts caused by prediction or channel errors. Simulation results has shown that the Markov model can predict sensor network traffic precisely; MPDD is an efficient DoS attacks detection scheme which can quickly detect various DoS attacks with less resource overhead.

  An EIWDSR Route Algorithm Based on the  Energy Integrated  Weight in Ad Hoc Networks

  LI Ming,WANG Ruchuan,FAN Gaojuan,HUANG Haiping

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

  Abstract ( 427 )   PDF (595KB) ( 324 )   　　

  The DSR route algorithm always has the “hot spot” problem for failing to consider energy consumption in the Ad Hoc networks. In this paper,we propose a novel routing algorithm EIWDSR(Energy Integrated Weighted DSR). It  integrates the node energy consumption,residual energy and energy variance,and the node hub of the path. Furthermore,EIWDSR has some characteristics such as low energy consumption,load balanced,and high reliability and so on. Simulation results showed that,the EIWDSR has made an improvement at the saving energy,load balance,and eliminating “hot spot”. Moreover,the networks’ life prolonged extensively comparing with DSR and WBDSR route algorithm.

  Research and Implementation of the Parallel Algorithms of PixelLevel Image Fusion for RemoteSensing

  ZHANG Canfeng，ZHOU Haifang

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

  Abstract ( 538 )   PDF (1002KB) ( 396 )   　　

  In this paper,corresponding to the image fusion algorithms of IHS,HPF,DWT and other typical  remote sensing image fusion algorithms,the data parallel algorithms such as PIHS,PHPF,PDWT are proposed. Based on the algorithm complexity analysis of spacetime,the communication and I/O optimization are carried out. The IKONOS satellite images tested on a cluster system  show that our proposed parallel algorithm can obtain good parallel speedup and high parallel efficiency. These three algoriths are suitable for realtime remote sensing applications.

  A Noisy Image Edge Detection Method Based on Zero Crossing

  ZHANG Chunxue1,2,CHEN Xiuhong1

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

  Abstract ( 543 )   PDF (833KB) ( 473 )   　　

  Detecting edges has become more difficult in image processing since images may contain areas with different degrees of noise.Many traditional methods for edge detection are sensitive to noise,so that the image edge can not be detected clearly. This article presents a noisy image edge detection method  based on zero crossing. This method first smoothes the image and calculates gradient on the basis of edge detection operator in reference［1］,then calculates the second derivative of the gradient image by the new recursive operator,and finds out the zero crossing points by rows and columns respectively,and finally merges all the zero crossing points and gets the image edge.The experimental results show that this method not only gives good edge detection effect,but also spends less computation and time by the recursive implementation of filtering operators.

  An Optimized Data Compression Method for FreeFormed NURBS Curves and Surfaces

  GAO Yijia，LI Taoshen

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

  Abstract ( 409 )   PDF (607KB) ( 276 )   　　

  An optimized data compression method of freeformed NURBS surfaces based on the differential data of  coordinates of the control points is improved from the model of freeformed curves and surfaces described by the NURBS method. Discrete cosine transform (DCT) is applied to the differential data matrix of coordinates of the control points associated with weights and then quantization compression is carried out in the optimized data compression method. Accumulated errors of the recovered data generated from data compression are transferred together with the compressed data in addition to the high efficiency of data compression. Finally,it is proved the data compression method is effective and useful by comparing the  recovered picture with the original one in an example.

  A New Steganalysis Method for Color Images

  QIN Jiaohua，XIANG Xuyu，SONG Yingqing

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

  Abstract ( 508 )   PDF (463KB) ( 391 )   　　

  By analyzing the impact of LSB replacing to the sum of RGB components of color image statistical properties,a new steganalytic approach for 24bit color images is proposed,which is based on the  frequencyrelated  sum of the RGB color components in a pixel. A classifier is constructed to identify the stegoimage from the normal images,which is based on the characteristics that the frequencyrelated  three color components’ sum of adjacent pixels is closer.The experimental results show that the proposed method outperforms the RQP steganalysis method in detection performance and in computation complexity.

  A Bidirectional 2DLPP Method and Its Application  in Face Recognition

  JIN Lili1,2,CHEN Xiuhong1

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

  Abstract ( 433 )   PDF (412KB) ( 346 )   　　

  To improve the robustness for  the face recognition method of illumination,and pose external factors,this paper modifies the twodimensional locality preserving projections (2DLPP) and gives a bidirectional 2DLPP (Bidirectional 2DLPP) algorithm. The difference with 2DLPP is that the bidirectional feature matrix is obtained by seeking the projection matrix in the column direction after the projection matrix in the row direction,thus the purpose of the dimensionality reduction is achieved. The experimental results show that this method has some robustness and higher recognition rate for the variation of illumination and pose.

  Research on the Clustering Algorithm of the ClassIncremental Learning Model for Underwater Vehicle Noise Source Recognition

  GAO Zhihua1,BEN Kerong1,ZHANG Linke2

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

  Abstract ( 379 )   PDF (615KB) ( 371 )   　　

  The  underwater vehicle machinery noise source recognition features that  the training samples is limited and have abrupt noise samples. Based on these characteristics,this paper proposes a densitybased algorithm which is parameter adjustable. And this novel algorithm is an  important component of the underwater vehicle machinery noise source recognition system with incremental learning ability. The experimental results show the new algorithm can avoid the parameter sensitivity of DBSCAN. Labeled samples by this algorithm can directly be used as the classifier training samples,saving lots of time and system resources.

  A MultiObjective PSO for VLSI Floorplanning

  CHEN Jinzhu，GUO Wenzhong，CHEN Guolong

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

  Abstract ( 431 )   PDF (590KB) ( 346 )   　　

  Floorplanning plays an important role in the physical design of very large scale integrated circuits(VLSI). It is a multiobjective combinatorial optimization and has been proved to be a NPhard problem. To solve this problem,a multiobjective particle swarm optimization (PSO) is proposed. The algorithm adopts sequence pair (SP) representation,thus the particle update formula is modified  by the principle of crossover operator in GA. The concept of ParetoOptimal Solution and elitism preserving strategy are imported. Moreover,a fitness function with phenotype sharing is designed to obtain a more uniformly distributed Pareto front. Experiments on the MCNC benchmarks show the proposed algorithm is feasible and effective.

  An Algorithm Based on Attributed Relational Graphs for Name Disambiguation

  HAO Dandan,GUO Jingfeng,ZHENG Chao

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

  Abstract ( 388 )   PDF (486KB) ( 398 )   　　

  The problem of name sharing is widespread in largescale databases or digital libraries,and it causes many research troubles. We propose a graph module named Attributed Relational Graph to describe the figures and links between entities,then we apply an algorithm named ARGResolution based on Attributed Relational Graph to distinct the entities having the same name. The algorithm analyzes the entities and clusters them according to the similarity measure,and eventually gets a set of clusters that correspond to the real entity respectively. The experiment over real datasets shows that mining the links can improve the quality of name disambiguation and resolve the problem successfully.

  The Algorithm of Fuzzy Reasoning Based on Medium Logic

  ZHANG Lizhen，PAN Zhenghua

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

  Abstract ( 395 )   PDF (429KB) ( 337 )   　　

  Medium logic completely reflects both the contrary relation and the contradictory relation. This paper firstly improves the infinitevalue semantic model for medium logic and then puts forth  a semantic interpretation. After that it expands the CRI algorithm put forth by Zadeh,and obtains another concrete algorithm based on the notion of medium logic. A special example validates the rationality of the extended algorithm at last.

  Normalization of Software Process Models Based on EPMM

  XIE Zhongwen，LI Tong，DAI Fei，LU Ping，QIN Jianglong，LIU Jinzhuo

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

  Abstract ( 503 )   PDF (506KB) ( 326 )   　　

  In order to develop highquality software process models,it is necessary to research on the normalization of software process models. Considering the properties of traditional software processes and software evolution processes,this paper puts forward the concepts of 1PNF,2PNF,3PNF and 4PNF,which are based on the formal definition of processes from EPMM. This paper suggests that all traditional software process models should be designed to meet 2PNF,and software evolution process models should be modeled to satisfy 3PNF. This paper is a guide to modeling software process models.

  Research on the Graph Label Based Test Information Description Technique

  LIU Haiyan,ZHANG Zhanjun,YANG Jiankang

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

  Abstract ( 358 )   PDF (345KB) ( 315 )   　　

  This paper analyzes the methods commonly used to describe the  testing information in graphical automatic test systems,introduces briefly the architecture of the graphlabel based automatic test platform. Then,it defines several languages by the XML schema to describe the testing design,including hardware environment design,flowchart of the testing program,as well as the input/output data of a test. It defines a graph marked language for describing the  interface information of the test,and testing the marked language for describing parameters,programs and  data. In this way the design of a  test and the testing program are loosely related. It can exchange data with other systems and can be generalized and updated easily.