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

Current Issue

    • 论文
      Emergence of Complex Systems and the MultiAgent Analysis Based on Holism
      JIN Shi-Yao, LIN Chuan-Dun, HUANG Gong-Bing
      2010, 32(3): 1-6. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 555 )   PDF (1608KB) ( 718 )     

      Research on the holism of complex systems,especialy the emergence of holism is an importment and hard subject in moder scientific research.The attemp to use multiagents,even adaptive multiagents to analyse system holism is not proper in system methodology.The paper starts from the basic concepts of holism and emergence of complex systems,points out the analysis method for holism,and gives the overall multiagent framework based on holism.By discussing the diffierences and relations of holism and emergence,we declare that mathematics,logic and experimentation (simulation) can be used in holism analysis.Finally,we give the multiagent reference architecture based on holism for analysing the holism and emergence of complex systems.

      Spectrum Sensing for Cognitive Sensor  Networks under the Fading Channel
      HU Fu-Beng, WANG Shu, LIU Wei, LI An
      2010, 32(3): 7-10. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 717 )   PDF (739KB) ( 465 )     

      With the increasing lack of allocable spectrum and crowding of ISM (Industrial, Scientific and Medical) bands, the research and application of wireless sensor networks (WSN) will face a major difficulty that acquire usable spectrum. Moreover,purchasing spectrum rights with lots of money is unreasonable under an emphasis on low cost to WSN. Thus an alternate method based on the concept of Cognitive Radio is explored to capturing spectrum for WSN. Two cooperative detection techniques based on energy detection are introduced, with the consideration of channel shadowing or fading. The simulation results show that the proposed energybased cooperative spectrum sensing methods lead to a favorable performance in detection probability, which makes a foundation for exploring usable spectrum for WSN.

      Research on LargeScale Network  Topology Generation
      LI Jin, HUANG Min-Huan, KUANG Xiao-Hui, HU Fei, TANG Hong
      2010, 32(3): 11-13. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 693 )   PDF (686KB) ( 2772 )     

      Network test environment is of great importance to the development of protocols and applications. Largescale network topology generation is one of the key technologies to construct a test environment. In this paper, we present a new generation framework VLTGF which divides the network topology into three hierarchies and contains the bandwidth assignment mechanism. The topologies generated by VLTGF are more complete and accurate.

      Research and Realization of a Gateway  Load Balancing Strategy in the IPv6 Environment
      SUN Wen-Qing, LI Xiao-Lei
      2010, 32(3): 14-16. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 548 )   PDF (1210KB) ( 374 )     

      On an IPv6 LAN, the advantage gained from using VRRP is a higher availability default path without requiring the configuration of dynamic routing or router discovery protocols on every endhost, and ensures the stability of the IPv6 network. VRRP does not have the ability of load balancing, the utilization of bandwidth and the optimization of resources should be improved. This article introduces the networking configuration of VRRP with load balancing. Based on the VRRP standard packet, we extend the packet field and propose the concept of virtual forwarder. With the scientific software development and testing process, we have obtained the correct data and realized the load balancing strategy.

      An I/O Acceleration Method for Network  Computing:iSCSI Transparent Reliable Multicast
      KONG Dong-Yang, TAN Fu-Liang
      2010, 32(3): 17-20. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 503 )   PDF (1246KB) ( 343 )     

      An I/O acceleration method for network computing, which is an iSCSI transparent reliable multicast (iTRM) protocol is presented. The network data loading performace of the iSCSI network computing system is improved by introducing a dual I/O path: the multicast path transmitting shared data and the iSCSI path transmitting iSCSI PDU. And in the iSCSI initiator side of the multicast,data packet loss detection and retransmission requests are performed from the iSCSI session retransmission of the lost data packets to ensure the I / O data reliability.The iSCSI protocol is extended to support the multicast session announcement. A transparent agent to monitor the loading of storage servers and decide when to launch the multicast session is designed based on data apperceiving. The test results show that the iTRM protocol boosts the performance of parallel I/O operations for multiple hosts.

      Research on the Application of  MultiLink and LevelBased Traffic  Scheduling Based on Differentiated Services
      GUO Xiao-Xue
      2010, 32(3): 21-24. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 533 )   PDF (868KB) ( 355 )     

      Traditional IP network is designed for data business, but rather to provide data transmission services, it does not have the ability to regulate the use of network resources. In order to distribute the business flow in the existing network topology reasonably, to optimize the the use of network resources and resolve the problem of imbalance in the use of network resources, the model and target of traffic engineering based on differentiated services are presented firstly,and single level traffic scheduling is deduced,and the shared structure and traffic shaping policy of multilink and levelbased scheduling are designed.The simulation results show that this method can improve the performance of traffic congestion control, is more responsive, more stable and fair, and can adapt to network heterogeneity better.

      Research and Design of a P2P Information  Resource Search System Based on DHH
      LI Yi
      2010, 32(3): 25-27. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 521 )   PDF (619KB) ( 333 )     

      Two fundamental problems that confront the P2P applications are to efficiently locate the node that stores a particular data item and organize nodes by themselves. In this paper, a distributed hash table scheme for resource search based on hybrid P2P networks (DHH) is proposed, which combines the system selforganization scheme and the distributed search chord protocol. The goals of load balancing, efficiency, reliability, scalable, and user anonymity can well be achieved.

      On the Degree Constrained Minimal Bandwidth Multicast Routing Problem in Overlay Networks
      ZIAO Juan, BO Yun
      2010, 32(3): 28-30. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 569 )   PDF (571KB) ( 924 )     

      In this paper, we investigate the degreeconstrained minimal bandwidth multicast routing problem in overlay networks, build a corresponding optimization model, and design a heuristic algorithm and a genetic algorithm for the problem. The complexity analysis and numerical experiments according to these two algorithms are also presented. Both the results of theoretical analysis and that of simulations suggest our proposed model and algorithms are practical and effective.

      Research on the Scenario of the Active Scanning of Web Vulnerability
      TU Jie, LI Zhou-Jun, ZHANG Chong-Bin, LI Jiang
      2010, 32(3): 31-34. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 794 )   PDF (434KB) ( 442 )     

      Recently, Web vulnerability scanning has an important role in network security. However, the most popular open source web vulnerability scanners, such as Nikto, Nessus, etc., have been criticized for their high false alarms, inaccurate evaluation and low sanning efficiency. In this paper, the process of vulnerability scanning is modeled accurately and a new scenariobased scanning strategy is presented. Vulnerability scenario is described by a scenario tree. The algorithms of how to construct and maintain scenario trees in vulnerability databases are also proposed. Finally, we analyze the vulnerability database of Nikto and demonstrate how to construct a scenario tree using its vulnerability records. We prove and validate that the scenariobased scanning strategy can improve the efficiency and veracity of vulnerability sanning.

      A New GSM Authentication Algorithm  Based on AuthVector Comparability
      ZHOU Junlong,ZhANG Xinfang,WU Junjun
      2010, 32(3): 35-37. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 415 )   PDF (461KB) ( 329 )     

      COMP1281 is the most widelyused algorithm in the GSM telecom system,but the leak in it has been found by a R&D team of Berkeley University at 1998. This paper analyzes the attacks to the leak and presents a new security method which detects the comparability among those authentication random vectors. The method can distinguish effectively almost all the attacks to protect KI.

      Anomaly Detection Based on Aggregated  Network Behavior Metrics
      SU Pan-Jun, CHEN Gang, LIU Cuan
      2010, 32(3): 38-41. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 587 )   PDF (972KB) ( 1087 )     

      Anomaly detection is a very active area of IDS. As a network measurement tool, anomaly detection plays an important role for a header statistical information in many network management tasks. Assembling the information of network packets can effectively constitute the network traffic measurement metrics. Extracting a specific subset from the metrics can be used to describe the flow of network attack characteristics. If these metrics show a relatively stable performance when there is no attack and a relatively sensitive manner when the attack occurs, they can be used to judge the attacks.And the redundant features are deleted by the use of principal component analysis and information gain.It can reduce spending and increase realtimeness. The classifier based on machine learning is an effective judgment method of the anomaly caused by network attacks.According to the selected metrics,we design three classifiers.

      A USB Storage Device Monitor and Control  System Based on the WDF Filter Driver
      Zuo Jing-Han, Cai Xuan-Dong
      2010, 32(3): 42-44. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 631 )   PDF (756KB) ( 424 )     

      WDF is the next generation of driver development model launched by Microsoft.Its KMDF framework supports an objectoriented,eventdriven framework for the kernel model driver development. The article analyzes the primary principle of the WDF driver model and the filter driver technology,and design and implement a USB storage monitoring system. Test shows that the system can control the use of the USB storage device effectively in a multiple operating system Intranet environment.

      A Nonlinear Method for Simulating the Face Aging Process
      JU Bei-Ji, GUO Wei, LIANG Yi-Xiong
      2010, 32(3): 45-48. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 604 )   PDF (848KB) ( 762 )     

      In this paper we present a face aging model as an nonlinear process based on the relationship of the local features and the multiresolution structure so as to show prominent personality features,to map the aging process of most similar local features to the target image by parameter compensation, and finally it correspond to the ordinary rules and exhibits personality that is the fusion of global and local aging results. The experimental results show that the nonlinear simulating face aging process based on similarity is flexible and effective.

      A Wavelet TransformBased Edge Detection  Algorithm Based on Edge Direction
      YUAN Xiu-Gui, GONG Zheng, MENG Zheng-Zhong
      2010, 32(3): 49-51. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 691 )   PDF (760KB) ( 1096 )     

      The existing image edge detection method based on wavelet transform may lose some details of edge and have the drift of the edge position across different scales,under this situation,we present an improved method for edge detection based on wavelet transform.This method smoothes the image first and then detects the image edge.Traditional image smoothing methods avoid the direction of edge and can not retain the image edge efficiently.This paper presents a new image smoothing algorithm based on edge direction.The smoothing algorithm smoothes the image on the direction of edge,and then detects the image edge with this algorithm and wavelet transform.Finally,the experimental results show that the proposed algorithm is very reliable and efficient.

      Designing the MultiMedia Treadmill Fusion  With Multiple Characters and Structured Scenes
      HU Wei-Hua, QIAN Ke-Chong
      2010, 32(3): 52-54. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 486 )   PDF (733KB) ( 481 )     

      Building and implementing a multimedia bodybuilding platform based on a traditional treadmill with virtual reality, sensor technology, motor control technology and the virtual human technique. This paper introduces the method of generating largescale 3Dscenes, the technique of rendering 3Dscenes by OSG(Open Scene Graph), and emphases on designing and implementing the virtual human motion algorithm.Finally,it reaches the dynamic interaction among the users ,the virtual scene and the virtual humans, and makes the users immerse in the scene.

      Research on a Representation Method of Gray  Iages Based on NAM with Triangles and Squares
      YI Wen-Ming, XIAO Ren-Bin, ZHENG Yun-Ping
      2010, 32(3): 55-58. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 504 )   PDF (457KB) ( 366 )     

      The Nonsymmetry and Antipacking Model (NAM) is suitable for the representation of image patterns, audio patterns, video patterns, and text patterns, and it is a general pattern representation model. Image representation is an important issue in computer graphics, computer vision, robotics, image processing and pattern recognition. A representation method of gray images based on NAM with Triangles and Squares, which is called NAMTS representation method, is proposed in this paper. Also, a concrete algorithm of the NAMTS for gray images is presented and the storage structure and total data amount of the proposed algorithm are analyzed in detail. By comparing the algorithm of the NAMTS with that of the classic linear quadtrees, the theoretical and experimental results show that the former is obviously superior to the latter with respect to the numbers of subpatterns or nodes and the data storagespace, and therefore it is a better method to represent gray images.

      SurfaceOriented FreeForm Deformation Based on 3D Facial Expression Control
      LI Jian,LI Pengkun,SHI Yonggang
      2010, 32(3): 59-61. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 572 )   PDF (694KB) ( 515 )     

      3D facial expression control is very important in biometrics. This paper gives a method of 3D facial expression control based on FAP & FAT from the MPEG4 standard.First,we find the key points and divide the face into several segments, and then generate 3D facial expressions based on Surface Oriented FreeForm Deformation. An expression proportion synthetic method is used for generating the specific face expressions.Finally, the experimental results show that the method presented in this paper can synthesize face expressions efficiently.

      A ZeroWatermarking Algorithm  Based on LPM and Wavelet Lifting
      BI Xiuli,He Chunxiang,CHENG Cheng
      2010, 32(3): 62-65. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 536 )   PDF (975KB) ( 347 )     

      In the most existing methods of digital watermarking, authors modify more or less the original image data for embedding watermarks,which limits the robustness and security. The transparency of watermarks can be improved by zerowatermarking since it need not modify the original image information. In this paper, a zerowatermarking algorithm based on integer wavelet and LPM is proposed. We get the secret image through the scrambled watermarks and low frequency sub images after LPM and lifting wavelet transformation. The watermarked image can be extracted from the secret image. This algorithm improves the transparency and security.

      Quadratic Trigonometric Bézier Curves Based on ThreePoints Shape Parameters
      TANG Yun-Mei, TUN Xiao-Qi, HAN Xu-Li
      2010, 32(3): 66-68. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 627 )   PDF (555KB) ( 352 )     

      Quadratic trigonometric polynomial Bézier curves with a shape parameter are presented in this paper. The trigonometric polynomial curves retain the main superiority of the quadratic Bézier curves. With the shape parameters, the trigonometric polynomial curves can approach more to the quadratic Bézier curves or to the given control polygon than the quadratic Bézier curves. Shape parameters have the property of geometry, the larger is the parameter,the more the curves approach to the control polygon. The curves represent ellipse and circle precisely. The G2 and C3continuity condition of twopiece trigonometric polynomial Bézier curves are also discussed.

      Modifiable Quasi Cubic Bézier Trigonometric Curves
      LI Jun-Cheng, CHEN Guo-Hua, YANG Du-Qiang
      2010, 32(3): 69-71. doi: 10.3969/j.issn.1007130X.2010.
      Abstract ( 624 )   PDF (478KB) ( 321 )     
      A modifiable quasi cubic curve based on functions 1, sinu, cosu, sin2u is presented in this paper. The curve is controlled by four points, and it has a lot of similar characteristics to the cubic Bézie curve, and its shape can be adjusted by a parameter, which makes the curve have more powerful expression ability. For designing free curves, the continuity condition of twopiece curves is discussed. As a result, the continuity of the curve is better than the cubic Bézier curve, twopiece curves can be C3 continuous when choosing a proper shape parameter, and the continuity condition of the curve is simpler than the cubic Bézier curve. In addition, the curve can represent elliptic curves, parabola and other conical curves without using a rational form, which is helpful for practical applications.