Current Issue

• 2012, No. 6　Published:25 June 2012 Last issue    Next issue
  Columns in this issue: 论文

• 论文

  Research on the Structure and Connectivity of the Internet ASLevel Topology

  DENG Wenping,GUO Min,HU Xiaofeng,ZHU Peidong

  2012, 34(6): 1-6. doi:

  Abstract ( 251 )   PDF (623KB) ( 305 )   　　

  The interdomain routing system based on BGP is the key routing infrastructure of the Internet. Understanding the Internet AS topology structure and the connectivity properties gives important implications on enhancing the security, robustness and performance of the Internet. The AS business relationship, as the fundamental model of AS topology, gives rise to the difference between AS graphs and general directed/undirected graphs: the AS hierarchical structure and the valleyfree property of AS paths. This paper proposes an algorithm for the hierarchical characterization based on the fundamental model of AS commercial relationships. Additionally, we give a further study on the AS connectivity, and validate the Tier1 full mesh AS topology. Finally, we propose a method on how to measure the connectivity for individual ASes.

  A Mathematical Model of Convergence Time for Probabilistic Packet Marking

  WANG Xiaojing1,2,SHEN Xiaojun1,WANG Junbo1

  2012, 34(6): 7-11. doi:

  Abstract ( 212 )   PDF (481KB) ( 223 )   　　

  A mathematical model of convergence time for probabilistic packet marking is established. In the model, the attack path reconstruction process is described as a convergent stochastic process. Probability distribution of convergence time and the quantitative relationship among convergence time, path length and marking probability are inferred. The minimum condition of convergence time is obtained. On the basis of this model, two improved mathematical models of convergence time for two traditional probabilistic packet marking approaches are presented. The simulation results show that the improved models are more accurate than the given two traditional models.

  Research on the Stability of Trilateration Algorithms

  WANG Xiaoping1，LUO Jun1，SHEN Changxiang2

  2012, 34(6): 12-17. doi:

  Abstract ( 277 )   PDF (667KB) ( 310 )   　　

  Localization is one of the major supportive techniques for the application and services, making it a research focus in wireless sensor networks. Trilateration is the basis of localization techniques, which is a primary building block of many complicated localization systems. This paper studies the stability of the optimization of trilateration, which is very sensitive to the initial value. We propose a new algorithm, named GICC, to conquer such difficulties. Compared with the existing implementation schemes of trilateration, GICC allows the optimization process of trilateration to obtain the global minimum by a simple gradientbased descent method. We conduct extensive simulations to evaluate the effectiveness of the proposed method. The results show that GICC can effectively avoid local minima, and diminish the errors of the localization result significantly.

  Fractional Duffing System Using in Image Encryption

  ZHANG Haiying1,ZHANG Wei1,2,LIU Jinmei1,2,Nigmatullin R R2,3

  2012, 34(6): 18-22. doi:

  Abstract ( 201 )   PDF (1616KB) ( 206 )   　　

  In recent years,the chaosbased image encryption technique is developed as a new approach.But onedimensional,twod or threed integral chaos systems are usually used,few people apply a fractional order chaotic system. We compare the fractional Duffing system with the integral Duffing system in key spaces and pseudo random sequences. Theoretical analyses and computer simulations both confirm that the chaotic sequences of the fractional system is more random. The order number of the fractional system also can be applied as key. So, in theory, the key space of a fractional Duffing system is bigger than that of an integral Duffing system. In conclusion, the fractional Duffing system is more suitable for image encryption,and the encryption results is good.

  New Integral Attack on CRYPTON V1.0

  ZHOU Qing1,WEI Yuechuan2,LI Chao1,2,3,WU Yi1

  2012, 34(6): 23-27. doi:

  Abstract ( 229 )   PDF (624KB) ( 289 )   　　

  CRYPTON V1.0 is a block cipher with a 128bit block size and a 128bit key size. The linear layer of CRYPTON V1.0 is designed based on bits, therefore integral attacks in a traditional way are of no value. In this paper, CRYPTON V1.0 is analyzed. We trace the propagation of the plaintext structure at the bitlevel to obtain the property, present a 3round distinguisher and test it on the PC. In the distinguisher, 1024 chosen plaintexts are encrypted by a 3round cipher, and each bit of the cipher text is balanced. Based on this distinguisher, the reducedround CRYPTON V1.0 is attacked. The result shows a 4round attack needs  211 chosen plaintexts and 223 encryptions, a 5round attack needs 212.4 chosen plaintexts and 253 encryptions.

  A MeetintheMiddle Attack on ReducedRound SNAKE(2)

  WEI Yuechuan1,SUN Bing2,LI Chao1,2,3

  2012, 34(6): 28-31. doi:

  Abstract ( 227 )   PDF (395KB) ( 270 )   　　

  SNAKE is a Feistel cipher proposed by Lee and Cha at JWISC 1997. It has two versions, i.e. SNAKE(1) and SNAKE(2). The security of the reducedround SNAKE(2) against meetinthemiddle attacks is evaluated in this paper. Attacks on 7/8/9 rounds SNAKE(2) with a 64bit block are performed. The result shows that SNAKE(2) reduced to 9 rounds is not immune to meetinthemiddle attacks. The data complexity, time complexity and precomputation complexity are 211.2,222 and  232 respectively, which implies a real world attack.

  A Scalable Content Inspection Technology for Files with Formatted Contents

  GAO Ning1,PANG Lihui2

  2012, 34(6): 32-37. doi:

  Abstract ( 279 )   PDF (718KB) ( 254 )   　　

  Lots of business application systems operate to do remote data transmission using files with formatted contents, which are business data. After a detailed analysis of security threats suffered by such an application system, this paper introduces a content inspection technique for files with formatted contents, and designs and realizes FFCCIS（A Content Inspection System for Files with Formatted Contents）,which matches file contents with formatted templates in the form of regex expression to inspect tempered or invalid files. An automatic method for generating the content formatted templates is put forward to make the templates write more conveniently and efficaciously.

  An Iterative Method for a Different Constraint Least Square Solution of Liner Matrix Equations

  LIU Xiaomin,ZHANG Kaiyuan,LI Shulian

  2012, 34(6): 38-43. doi:

  Abstract ( 248 )   PDF (400KB) ( 324 )   　　

  The constrained solution to multivariable linear matrix equations has been widely used in parametre identification,structural design,vibration theory,automatic control theory and so on.Based on the iterative method for the same constrained least square solution of the linear matrix equation, an iterative method is constructed for different constrained least square solution of the linear matrix equation by constructing equivalent linear matrix equations. And the convergence of this method can be proved. By this method, a different constrained least square solution can be obtained within finite iterative steps in the absence of roundoff errors, and the different constrained least square solution with leastnorm can be obtained by choosing special initial matrices. In addition, the optimal approximation matrix to any given matrix can be obtained in the set of different constrained least square solutions. Examples show that the method is efficient.

  A Particle Swarm Optimization Task Scheduling Algorithm Based on Availability in Heterogeneous Systems

  LI Dapu1,CHEN Guangxi1,LI Kenli2

  2012, 34(6): 44-49. doi:

  Abstract ( 234 )   PDF (570KB) ( 216 )   　　

  Task scheduling techniques, playing an important role to system performance, are one of the key technology in parallel and distributed systems. In general, the task scheduling problem in largescale systems is a NP problem. The modern heuristic biological evolution algorithm is an effective method to find an approximate solution for NP problems. In this paper, a scheduling algorithm which applys particle swarm algorithms into availability grid dispatch systems is proposed. The performance of the algorithm is analysed in theory. The simulation results show that compared with the SSAC algorithm which is recently proposed, the proposed particle swarm optimization task scheduling algorithm can generate shorter makespan while conserving the same availability level.

  Research on a Hybrid ContextAware Sharing Mechanism Based on ASM

  JIANG Jingjing1,2,YE Jian1,ZHU Zhenmin1,2

  2012, 34(6): 50-58. doi:

  Abstract ( 230 )   PDF (1303KB) ( 222 )   　　

  It is the core objective of the contextaware systems that mobile users can easily acquire sensor data distributed over the ubiquitous computing environment to get those context information. Therefore, this paper proposes a hybrid contextaware sharing mechanism which combines distributed peertopeer with Publish/Subscribe. Based on the Abstract State Machine, the paper designs and specifies the mechanism with high robustness and extensibility, and applies the AsmL tools to generate a finite a state machine to verify the validity and rationality, At the end of this paper, this mechanism is proved to be able to satisfy the requirements of dynamic distributed contextaware systems.

  A Reverse Dominant Point Set Based Algorithm for Top- k  Queries in DSMS

  GAN Liang1,2,YU Lili3,LI Runheng1,JIA Yan1,JIN Xin4

  2012, 34(6): 59-64. doi:

  Abstract ( 253 )   PDF (878KB) ( 239 )   　　

  Grid index is often used in the query of top k and skyline in DSMS, but it is coarsegrained. In this paper, we propose a  Reverse Dominant Point Set   ( RDPS )  algorithm which is based on grid index, and prune a number of cells in grid index using the characteristics of RDPS to improve the precision of top k queries, thus accessing the  data set in queries is limited to  the kmax calculating region . So, it reduces the memory usage of grid index and the overhead of queries. Analytical and experimental evidences show the efficiency of the proposed approaches.

  Memory Optimization of the Adjoint Model of the GRAPES Regional Model

  LI Jincai,ZHAO Wentao,ZHAO Jun

  2012, 34(6): 65-69. doi:

  Abstract ( 231 )   PDF (705KB) ( 659 )   　　

  The adjoint model of the GRAPES regional model has been developed with a combination of automatic differentiation tool TAPENADE and handcoding. The model is made up of mode programs and a memory supporting library (PLP library). The TAPENADE employs a complete storage strategy to save the intermediate variables. This causes too much memory overhead during the operation of the adjoint mode and increases memory consumption with the time step going on. The growing of memory is addressed by modifying the POP functions in the PLP. The mode programs are optimized for integer variables, real variables and calling subroutines of the forward model so that the memory overhead is significantly decreased.

  Research on a Fault Dictionary Reasoning Algorithm of the DiagnoseDrive Test Mode

  ZHAO Xiuli1,NIU Shuangcheng2,WANG Ziling3,LIU Xiaodong4

  2012, 34(6): 70-73. doi:

  Abstract ( 238 )   PDF (392KB) ( 295 )   　　

  Diagnosisdriven test is an intelligent test mode, which shortens the testing time, and advances maintenance efficiency. Fault dictionary is a traditional, widely applied faultdiagnostic method. A new reasoning algorithm of fault dictionary is put forth in this paper, which meets the demand of diagnosisdriven test. How to select the test items are also described. The proposed algorithm is realized and verified in the automatic test equipment.

  Research on the Optimization Algorithms for Weapon Equipment Systems Based on the Surrogate Model

  DU Bo，JIN Guang，ZHOU Jinglun，ZHANG Liwei

  2012, 34(6): 74-78. doi:

  Abstract ( 220 )   PDF (870KB) ( 294 )   　　

  System optimization is one of the core issues in the research of the weapon equipment systems. However, to overcome the low efficiency and high cost of the optimization methods of equipment systems based on simulation, an optimization algorithm of weapon equipment systems based on the Kriging surrogate model and uniform design is presented, in which the surrogate model is updated by the EI（expected improvement） function, and the steepest descent method is used in the optimization algorithm. The optimization algorithm put forward in this paper has high precision and high speed of convergence, and also has a high theoretical and practical value in solving nonliner problems.

  A GenderBased Algorithm of Speaker Indexing

  YANG Jichen1,HE Jun2,LI Yanxiong2

  2012, 34(6): 79-82. doi:

  Abstract ( 208 )   PDF (357KB) ( 231 )   　　

  To improve the precision of speaker indexing, an algorithm of speaker indexing based on gender is proposed by modifying BIC which is often used in speaker change criterion and by using gender information. In the first step, penalty distance is proposed to judge whether a speaker changes, which settles the problem that it is needed  to tune the penalty factor of the Bayesian information criterion(BIC) repeatedly by the speaker change criterion. In the second step, a gender model is used to judge every speaker’s gender on the basis of speaker changes. In the third step, speaker model bootstrapping is used to identify a male speaker or a female speaker separately. The experimental results show that: it is unnecessary to tune the penalty factor compared to BIC and F1 is improved by 2% compared to DISTBIC by the  speaker change detection; the speaker indexing accuracy is improved by 20.93% and the accuracy on the number of speakers is improved by 3% by using the gender information in speaker identification.

  An Image Defogging Algorithm Based on the Fog Veil Theory

  XIE Bin，GUO Fan，CAI Zixing

  2012, 34(6): 83-87. doi:

  Abstract ( 220 )   PDF (788KB) ( 330 )   　　

  A new image defog algorithm based on fog veil subtraction is proposed to deal with the situation where the fog might not be uniformly distributed. The proposed algorithm first estimates the illumination component of the image by applying smoothing to the degraded image, and then obtains the uniform distributed fog veil through a mean calculation of the illumination component. Next, we multiply the uniform veil by the original image to obtain a depthlike map and extract its intensity component to produce a fog veil whose distribution is in accord with the real fog density of the scene. Once the fog veil is calculated, the reflectance map can be obtained by subtracting the veil from the degraded image. Finally, we apply an adaptive contrast stretching to the reflectance map to obtain an enhanced result. This algorithm can easily be extended to video domains and is verified by both realscene photographs and videos.

  Detection of Mark Defects on the Disk Surface Based on the Texture Feature

  HE Yantao1,XU Qi2,TANG Liang1,YOU Xiaoming3

  2012, 34(6): 88-92. doi:

  Abstract ( 214 )   PDF (600KB) ( 266 )   　　

  Surface inspection plays an important role in industrial production of product quality control, but the existing methods for the detection of magnetic material surface mark defects have their own limitations. The existing methods are too expensive and too slow to meet the needs of realtime detection in industrial production. In order to achieve the realtime and robust detection of surface mark defects, we propose a method in this paper based on the texture feature, which  makes the various defects have unity by enhancing the defective parts and inhibiting the background parts after image preprocessing. Then we detect surface mark defects by designing a suitable mask. The method proposed in this paper achieves the detection of surface mark defects. The experimental results show that it can be done in a realtime way and is useful for a variety of defects.

  A Kalman Filter with OnLine Parameter Adjustment Functionality and Its Application

  WU Fei

  2012, 34(6): 93-96. doi:

  Abstract ( 253 )   PDF (580KB) ( 292 )   　　

  A Kalman filter with online parameter adjustment functionality and its application in ship target tracking is proposed.In practical systems,noise statistics has dynamic features.Gennerally, in conventional Kalman filtering, the variances of state and measurement noise are assumed to be fixed and known beforehand. However, this assumption does not hold in practice generally.The Kalman filter without correct information on noise covariances could produce poor performance on filtering.In the worst case,it leads the filter to diverge.In order to overcome this problem, a method which adaptivly adjusts the noise mean and covariance to track the dynamic noise is proposed,so as to improve the precision of target tracking.Online realization can effectively use part of data to update iteration, which  reduces calculation and is easy for engineering realization .Finally, the results of the ship target simulation demonstrate the effectiveness of the porposed algorithm.

  The Virtual Reality Technology and Its Application in Special Equipment Education Based on Virtools

  FU Zhaoguo,WANG Tianwei,NI Xiaopeng,LIN Lizong

  2012, 34(6): 97-100. doi:

  Abstract ( 252 )   PDF (517KB) ( 264 )   　　

  Virtual elevators are studied, by the technology of virtual reality, we develop a virtual identification system for elevator parts and use it on the assessment of elevator drivers. The assessment method used nowadays has some problems, such as the complex process, difficult result statistics and so on. So we propose a reasonable solution to these problems, meeting the needs of practical use. The system is a new application of the virtual reality technology in special equipment education, and the virtual elevator looks like a real one, people can observe the details in several points of views, and it  is convenient for the education and assessment. Based on some software such as SolidWorks, 3Dmax and Virtools, the system possesses such advantages as low investment, short development cycle, good operation and interaction.

  A Relevance Feedback Method Based on Locality Preserving Projections（LPP）

  ZHANG Zhenhua,ZHU Xinzhong,ZHAO Jianmin,XU Huiying

  2012, 34(6): 101-105. doi:

  Abstract ( 221 )   PDF (706KB) ( 227 )   　　

  Recently, there are two possible ways to achieve efficiency of choosing an effective dimension algorithm and using an appropriate relevance feedback technique in image retrieval. Locality Preserving Projections （LPP）is an effective linear dimensionality reduction algorithm, and it preserves the image structure. In order to improve the efficiency of the retrieval accuracy, the article incorporates the users’ feedbacks. Using the algorithm of LPP, we map the data points to a subspace. In this subspace, a weighted graph G can be constructed by a candidate data set  to consist of k nearest neighbors of the query data points, and query data set. We then compute the geodesic distances between all pairs of vertices of the graph G , and sort them, obtain feedback results. The experimental results show that the algorithm can effectively improve retrieval accuracy, and an optimal retrieval results can be obtained.