Loading...
  • 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

Current Issue

    • 论文
      The DDoS Detection Method Based on  Attack Features and the ARMA Prediction Model
      CHENG Jie-Ren, YAN Jian-Ping, LIU Yun, LIU Xiang-Hui, CAI Zhi-Ping
      2010, 32(4): 1-4. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 848 )   PDF (964KB) ( 578 )     

      The distributed denial of service (DDoS) attack is one of the major threats to the current Internet. We propose a robust scheme to detect the distributed denial of service (DDoS) attack based on the essential DDoS attacks features, such as the abrupt traffic change, flow dissymmetry, distributed source IP addresses and concentrated target IP addresses. This paper proposes a IP Flow feature value (IFFV) algorithm that reflects the DDoS attack features, and uses a simple and efficient ARMA(2,1) IFFV prediction model for normal network flow based on linear prediction techniques. Then a DDoS attack detection scheme, DDDP (DDoS attacks detection based on IFFV Prediction), is designed for network flow. Furthermore, a mechanism evaluating the reliability of alert is developed to reduce the false alerts caused by prediction or flow noise. We have done experiments with the MIT Data Set in order to evaluate our method. The results show that DDDP is an efficient DDoS attacks detection scheme, which can quickly detect DDoS attacks accurately and reduce false alarm rate drastically.

      Research on the Representation and Evolvement of Trust in Distributed Network Interaction
      ZHANG Qiang-,Zhuo-Ying, GONG Zheng-Hu
      2010, 32(4): 5-9. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 550 )   PDF (846KB) ( 321 )     

      This paper presents the definition of trust about distributed network applications, and shows the formal expression of trust in network interaction. Assumption, analysis and proof on the decay of trust for the factor of time are also raised. A trust triangular tunnel downfallen(TTTD) model is presented, and each component of trust is detailedly explained in TTTD.

      A New Distributed Algorithm to Achieve Utility MaxMin Fairness
      YE Ying-Ze, ZHANG Ying
      2010, 32(4): 10-13. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 673 )   PDF (440KB) ( 517 )     

      A central issue in computer network is how to allocate bandwidth to the flows fairly, in a decentralized manner. In this paper, we propose a new approach to achieve utility maxmin fairness, which is based on a vector optimization and some extension to the famous KuhnTucker conditions for nonlinear optimization. This leads to a distributed source link algorithm which we show its performance by an example.

      A Multicast Protocol Based on Improved HyperCast
      LIU Tian ming,ZHANG Da fang,ZENG Bin,XIE Xi,LI Ming wei
      2010, 32(4): 14-17. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 501 )   PDF (511KB) ( 328 )     

      Reliable and scalable multicast is an active research field of multicast based on hypercube. Hypercastplus based on HyperCast and CubeFullDist is presented to solve the problem of multicast reliability. Because the nodes in multicast may leave or join at any moment, it is difficult to maintain. The mechanism is implemented by saving the information of the node’s neighborhoods and adding logic links when the physical links are missing. According to the theoretial analysis and simulations, the Hypercastplus protocol shows more efficient reliability.

      A Topology Discovery Method Based on the Improved DoubleTree Algorithm
      QIAO Hong,ZHANG Da fang,ZENG Bin,LI Ming wei,HAN Jian
      2010, 32(4): 18-21. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 513 )   PDF (1044KB) ( 340 )     
      The DoubleTree algorithm is one of the important IP level topology discovery methods. It can reduce probe redundancy dramatically; however, it also brings about a great deal of network traffic, promoting the network burden. In this paper, a DoubleTree++ algorithm based on DoubleTree, is designed and implemented via improving the storage structure of the global stop set.The experiment shows that DoubleTree++ can reduce 50% probe redundancy and decrease the network traffic among probe sources, while covering 95% network nodes and links.
      Research on the Trust Path Based on an Improved Evolutionary Algorithm
      FU Hong,XIONG Juan,FU Ming
      2010, 32(4): 22-24. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 622 )   PDF (619KB) ( 350 )     

      As for the shortcomings of genetic algorithms,such as slow convergence,and the earlyemerged local optimum, this article puts forth an evolutionary algorithm for searching the path of trust.The experiment indicates that compared to the genetic algorithms,this algorithm is applicable to largescale trust models in searching the path of trust,and also improves the efficiency of search.

      Formal Verification of the 802.11i Authentication Protocols by Model Checking
      HUANG Gu,MIAO Li, ZHANG Da fang
      2010, 32(4): 25-28. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 602 )   PDF (529KB) ( 389 )     
      It is important to guarantee the correctness of security protocols to ensure the securitysensitive businesses on the Internet. The formal method is useful to analyze and verify security protocols. It can uncover bugs which are difficult to find by testing. As a formalized method, model checking has many advantages. It is fully automatic, and also can provide faulty traces. An approach to abstracting and modeling the EAPTLS of 802.11i is presented by using model checker SPIN,and a formalized model of at a significant level of detail is extracted.The security properties of the protocol for verification are extracted using LTL to find if the security properties are true in the model. A way to model authentication protocols using PROMELA is presented.
      Research on the Security Management of Portable Devices Based on the Smart Card Technology
      YU Pengfei,WU Junjun,WANG Tongyang,ZHANG Xinfang
      2010, 32(4): 29-32. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 851 )   PDF (1289KB) ( 421 )     
      With the portable devices widely used, the security problems such as information leakage caused by them have been paid more and more attention. According to the deficiency of the current security management for portable devices based on username and password, this paper presents a security management scheme based on the smart card technology. In this scheme, the fingerprints are used to authenticate the identity of a device’s user, at the same time, the mutual authentication between portable devices and the accessed terminals can be achieved, which prevents the security incidents caused by portable devices at the root.
      Research on the Bit Transform and Count of the MDS Matrix
      ZHOU Xuan,ZHANG Xin,QU Chengqin
      2010, 32(4): 33-35. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 586 )   PDF (313KB) ( 304 )     
      In this paper, firstly, we study the bit transform characteristics of some MDS matrices, and get the result that the bit parity of output is equal to that of input, then we prove the result. Secondly, we give the formula of computing the number of the MDS matrix, and prove the formula simultaneously. The experimental results accord well with the theoretical inference results.
      A Dynamic Protocol Detection Techniquefor the Signature Based on Optimizing the MultiPattern Matching Algorithms
      DENG Hui,LIANG Bo,WANG Feng
      2010, 32(4): 36-38. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 949 )   PDF (409KB) ( 609 )     
      Many intrusion detection systems (IDS) rely on protocolspecific analyzers to extract the higherlevel semantic context from a traffic stream. In order to choose the right analyzer, the traditional systems rely on some wellknown ports.Thus, many illegal connections do not use the standard port or use the tunnel technology to evade the intrusion detection system’s testing. In this paper, we hope to achieve a complete reorganization of the data flow to achieve the context of dynamic application protocol analysis so as to detect the intrusion of using unconventional means.
      Research and Implementation ofAccess Control in PLM Systems
      LI Zhen,YUE Houguang,CHEN Caixian
      2010, 32(4): 39-41. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 523 )   PDF (444KB) ( 297 )     
      According to the special requirements of access control in Product Lifecycle Management (PLM) systems, a conditionbased access control model is put forward. This model is implemented by XACML and some related technologies. The delegation decision request schema of XACML is improved to meet the needs of policy administration and to resolve the problem of access control in PLM systems.
      Realistic Simulation of the Wetting Effect on Cloth Based on Physical Modeling
      ZOU Beiji,HUANG Luan,WANG Lei,LIANG Yixiong
      2010, 32(4): 42-44. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 583 )   PDF (532KB) ( 443 )     
      Based on an analysis of the relationship between the fluid and the cloth, a new simulation approach is presented for the water flowing through the cloth. We introduce a physical model based on the improved massspring model. Similar to the particle model, we use the porousparticles structure, and the pores are the fluid storage space. Due to the difference of the fluid storage between the neighboring particles, the generated capillary pressure drives the flowing among all particles. According to the Darcy’s law, our physical model can control the whole flowing process. According to the different saturation, we map different textures to demonstrate the variation of the wetting cloth materials. In this way, our model has high computational efficiency and strong extensibility.
      Analyzing and Improving the Tsai CameraCalibration Method in Machine Vision
      XU Jie
      2010, 32(4): 45-48. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 518 )   PDF (495KB) ( 514 )     
      To improve the accuracy of camera calibration, after analyzing the Tsai twostage method, the article gives a new camera calibration method based on the CCD area sensors array, and the new composite distortion model. It uses an iterative method without a radical distortion limit, and can be used in many kinds of camera lens distortion cases, and the improved method uses a coplanar set of points, monoview, and the experimental result shows that the algorithm is fast with high accuracy. This camera calibration method can be used in the machine vision research and the industry 3D measurement.
      A Hierarchical Parallel Image Denoising AlgorithmBased on the Anisotropic Diffusion Equation
      GUO Jing,TIAN Youxian
      2010, 32(4): 49-51. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 547 )   PDF (784KB) ( 371 )     
      According to the shortcomings of the anisotropic diffusion equation denoising model such as intensive calculations ,time consuming, affecting the realtimeness, etc, a full use of parallelism knowledge is made to put forward an effective solution.Based on the idea of the anisotropic diffusion equation denoising model, we design a cluster of workstations and divide the noise image into overlapping strips to realize the twolevelparallel strategies:the intranode cluster using shared memory structure, the internode cluster using the distributed memory structure,the optimal combination of the two is used to achieve the parallel structure.Finally an effective hierarchical parallel algorithm for denoising images is proposed.The test result shows that , based on the hybridmodel parallel environment, the operating efficiency of the algorithm can be greatly enhanced,and the running time can be greatly reduced, meanwhile the comparable denoising quality can still be obtained.
      A Class of Modifiable Cubic Polynomial Curve
      LI Juncheng
      2010, 32(4): 52-54. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 498 )   PDF (540KB) ( 299 )     

      For extending the representation of the Bézier curve, a class of cubic polynomial basis functions with two shape parameters is presented in this paper firstly, which is an extension of the quadratic Bernstein basis. Then, a modifiable cubic polynomial curve is presented based on the basis functions, and the relation between the curve and the classical Bézier curves is discussed. The curve is an extension of the quadratic Bézier curve, which inherits most properties of the quadratic Bézier curve, and its shape can be local or globally modified by changing the values of the two shape parameters when the control points are not changed. For designing free curves, the continuity condition of the twopiece curves is discussed. Finally, some application examples of the curve in the curve design are presented.

      A NonWatermarking AlgorithmBased on the MSB Structure Key
      NIU Wan hong,YANG Shao hua
      2010, 32(4): 55-58. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 518 )   PDF (1081KB) ( 360 )     
      This paper presents a nonwatermarking algorithm based on the most significant bits to construct the key. Firstly, the binary watermarking image is scrambled and extended to the size of the main image.Then the value of every pixel of the watermarking image is compared with that of the corresponding MSB (Most Significant Bit) of the main image. When the compared value is true,the location of the main image is marked by a zero matrix, and the marked zero matrix is a key that can be used to detect the watermarking image later. Good performance can be achieved due to the watermarking information which is relatively in the most high bitplane and is scattered to the whole of a main image. The experimental results show the validity of the method.
      Research of Collision DetectionAlgorithms Based on AABB
      WANG Xiaorong,WANG Meng,LI Chungui
      2010, 32(4): 59-61. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 672 )   PDF (490KB) ( 542 )     
      An improved collision detection algorithm based on AABB is presented. Collision is a local behavior, during the sorting procedure, each axis is cut into a series of segments containing the same number of projection intervals. This will avoid needless intersecting test of AABB.And Shell sorting is adopted. Then the storage of the AABB tree is compressed.This way can save a large amount of space and speed up the algorithm.
      Lossless Compression Techniques for MultiSpectral Images
      HUANG Yunxian,LI Xiang,AI Weihua
      2010, 32(4): 62-66. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 576 )   PDF (457KB) ( 432 )     
      Multispectral remote sensing images are those obtained from one object by the multispectral sensor in multiple narrow spectral ranges. Large amount of multispectral image data produced by high spatial and spectral resolution poses a great challenge to transmit and storage. As a result, it becomes imperative to develop an efficient compression technique. Since the loss of useful information will affect further processing and applications of the images, a lossless scheme is preferred. In this paper an analysis of the multispectral images space and spectral features is presented, and useful lossless compression techniques such as preprocessing, prediction and transformation are introduced, and also a comparative analysis of these techniques is discussed.
      MDASupporting Transformation from UML Class Diagram to RDB Model Approach
      ZENG Yi,WANG Jian,HONG Yuan,ZHOU Xin,CAI Senhu
      2010, 32(4): 67-70. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 622 )   PDF (839KB) ( 319 )     
      UML is used to describe a variety of models by MDA .UML is an actual standard for modeling languages. Because of the lack of constraints over the realization of relational database models in UML class diagram design, the outcome of the transformation from the UML class diagrams to the realization of relational database models is not exclusive. It can not sufficiently achieve the designer's intentions on the database and it is inconvenient in doubledirectional transformation from PIM to relational PSMs in MDA. To solve the problem mentioned above, an approach is proposed to enhance the relationship and the constraints of data in class diagrams which can extend UML by adding stereotypes and OCL constraints to build exclusive relational PSMs from PIM. Finally, a method based on QVT is provided for transferring the extended UML class diagrams to relational database models. In several examples the transformation rules are defined for association, inheritance, aggregation and combination of the UML class diagrams etc. It can get the exclusive outcome of the transformation from the UML class diagrams to the relational database models using this method.
      A Code Similarity Detection Tool and Its Case Study
      LI Zhuo,DENG Mingrong
      2010, 32(4): 71-74. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 542 )   PDF (650KB) ( 655 )     
      Similar code detection is a common entry point of software refactoring activities. The paper firstly introduces texts mappingbased similar code detection algorithms like the dynamic text mapping algorithm and the suffix tree algorithm. Based on the combination of these two algorithms, a tool for automated similar code detection is implemented. This tool provides not only a capability to detect similar code both between and within the source files, for an improved accuracy, but also an automatic approach to help developers secure similar code candidates, hence improves the efficiency of software refactoring. Finally, the paper analyzes the experimental outputs of practical programs in a financial information system. Its practicality is shown.