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

Current Issue

    • 论文
      An Optimized RSU Scheduling Scheme for the Connectivity Problem in the HighlyPartitioned VANET
      ZOU Feng1,ZHONG Jiaofei2,WU Weili2,DU Dingzhu2,Lee Junghoon3
      2012, 34(1): 1-10. doi:
      Abstract ( 429 )   PDF (821KB) ( 473 )     

      Vehicle Adhoc Network (VANET) is a mobile adhoc network with the feature of highly dynamic topology. Recently, a special type of infrastructure called Roadside Unit (RSU) has been proposed to deal with the frequent network partitioning issue of VANET, which is deployed along the road to improve the VANET connectivity. In this paper, we mainly focus on how to save energy in the RSU scheduling problem. Our objective is to find the optimal scheduling to turn on or turn off the deployed RSUs within the system during a given time period, so that the overall energy consumption of these RSUs is minimized while the network connectivity is maintained. In order to solve this problem, we divide it into two subproblems, namely the snapshot scheduling problem and the snapshot selection problem. The former problem decides the minimum number of active RSUs required in a VANET snapshot at a given time point, while the latter problem decides the sequence of time points at which the snapshot must be updated. By solving these two subproblems, we present a complete solution to our RSU scheduling problem. Theoretical analysis and experimental results confirm the efficiency of our algorithms, which achieve significant improvement in energy saving while maintaining the VANET connectivity.

      Card User Awareness Based on Image Morphing
      ZHAO Qiangfu1,HSIEH Chenghsiung2
      2012, 34(1): 11-20. doi:
      Abstract ( 339 )   PDF (632KB) ( 411 )     

      Consciously or unconsciously, we are using many kinds of “cards” in our daily lives. Among them, credit card, cash card, driving license, etc., are as important as our wallets. To prevent the cards from being illegally used, card user authentication is indispensable. A common practice for user authentication is to ask the user to provide some personal information. The user is usually considered legal if the personal information matches the one prestored in the card. However, if the personal information is leaked, some third party may use the card illegally. The purpose of this paper is to propose an image morphing based method for card user authentication. The fundamental idea is to hide the face image of the true card holder into some cover data through morphing, distribute the key information for restoring the face image into several different places, and restore the face image through demorphing when the card is used. This method can provide good user awareness for authorized persons, and can protect the true card holder more effectively.

      The LBS (LocationBased Service) Mechanism Design for Heritage Exploring Systems
      HUANG Chungming,LU Shangqun
      2012, 34(1): 21-28. doi:
      Abstract ( 361 )   PDF (818KB) ( 303 )     

      This paper proposes the design of a LocationBased Service (LBS) mechanism to provide a theme tour in which people can deeply experience heritage using handheld devices. In order to fulfill the LBSbased heritage touring experience, a metadata element set has been defined to describe the heritage content. In this study, our proposed LBS mechanism design includes (1) a hierarchical content retrieving method for retrieving content efficiently and (2) a content cache and arrangement method for providing appropriate contents to users, and (3) a triggering of content presentation method for presenting the corresponding contents in the right time instant. To verify our DEH heritage exploring system, we also have an evaluation of retrieving content and a case usage and then have the questionnaire about the using experience.

      An Urban Environment Broadcast Algorithm for Vehicle AdHoc Networks
      LUO Juan,BAI Yudong
      2012, 34(1): 29-33. doi:
      Abstract ( 361 )   PDF (612KB) ( 360 )     

      As for the problems faced by message dissemination in vehicle ad hoc networks under the urban environment, a reliable broadcast algorithm is proposed. Firstly,the nodes are classified into certain classes based on the node position and movement direction. A distancebased scheme is applied to select an appropriate relay node, by which a multihop broadcast is realized. At the intersection, the nodes are further divided into two types. As to the problem of communication connection holes, we solve it by carrying and forwarding. The node needs to detect a hole, and then rebroadcasts when a node enters its communication range. The simulation results show that our algorithm has good performance in the delay, success percentage and average load generated by each broadcast packet.

      Detecting Community Structures in Complex Networks:A Bisection Spectral Clustering Approach
      FU Lidong
      2012, 34(1): 34-37. doi:
      Abstract ( 382 )   PDF (390KB) ( 398 )     

      In recent years, the problem of community structure detection has attracted more and more attention and many approaches have been proposed. To detect community structures in complex networks, the modularity density function (D value) is optimized, by optimizing process, the modularity density function can be expressed as a trace maximization form about the modularity density matrix. By spectral optimization of modularity density matrix, a bisection spectral clustering approach is proposed to detect communities in complex networks. The algorithm is validated in the LFR benchmark networks. Experimental results show the significance of the proposed approach.

      An Improved Remote Anonymous Attestation Scheme Based on Privacy CA
      CHI Yaping 1,QI Youjun2,WEI Zhanzhen1,FANG Yong1
      2012, 34(1): 38-42. doi:
      Abstract ( 423 )   PDF (491KB) ( 328 )     

      Remote attestation is one of the key technologies of trusted computing,which is used for attesting the identity and configuration of remote platforms, but there are some shortcomings in existing remote attestation schemes. On the basis of analyzing the existing remote anonymous schemes based on Anonymous Attribute Credential(AAC),an improved scheme is proposed. Aiming at the problem that the PCA which delivers the certification(AAC) is not verified in the process of applying, the improved scheme uses the session key to sign PCA to guarantee the authenticity of PCA. Meanwhile, aiming at the problem of the malicious user’s access to the network, a pseudonym mechanism is introduced in the improved scheme. It can ensure the anonymity of the user and can prevent the illegal access of the users with malicious historical marks.

      A Virtual Channel Based SDRAM Access Scheduler
      DENG Rangyu,XIE Lunguo,LIU Defeng,PAN Guoteng
      2012, 34(1): 43-48. doi:
      Abstract ( 316 )   PDF (694KB) ( 342 )     

      With the progress of semiconductor manufacturing techniques and the development of processor architectures, the gap between the processor and the DRAM speeds is becoming larger and larger, and memory bandwidth is now the primary bottleneck of improving the computer system performance. Modern DRAM provides several independent memory banks, according to this characteristics, we present a virtual channel based memory access scheduler, and a least wait time and readfirst scheduling approach. This approach significantly reduce the observed main memory access latency and improve the effective memory bandwidth utility.

      A HighSpeed LowPower Memory ReadandWrite Control Circuit
      SUN Yongjie,LI Peng,CHEN Haibo
      2012, 34(1): 49-52. doi:
      Abstract ( 341 )   PDF (499KB) ( 395 )     

      A highspeed lowpower memory readandwrite control circuit is analyzed. In the circuit a latchbased sense amplifier is used and the input of the amplifier is connected to the bit lines of the memory through isolation transistors. Tradeoff can be made between the read delay, power dissipation and read reliability of a memory by controlling the timing of the isolation transistor and the sense amplifier. The simulation results in this paper will be useful for memory designer.

      FT-SIMD :Design of  a HighPerformance Multiplier
      LI Guoqiang,CHEN Shuming,WAN Jianghua,YANG Hui
      2012, 34(1): 53-57. doi:
      Abstract ( 445 )   PDF (541KB) ( 371 )     

      In order to enhance the multimedia data processing abilities, high performance DSPs have generally introduced the SIMD technology. As an important component in DSPs, the multiplier has to support the SIMD function. After an indepth study on the SIMD multiplier's implementation, this work proposes a simple and highly effective 16 bit FTSIMD multiplier, which is composed of two 16×8 bits multipliers, with the help of signedexpansion and splicing operations on the operands and results, the 16bit SIMD multiply is effectively supported. What’s more, our multiplier can be easily expanded to  support the 32bit and 64bit SIMD multiply operations.

      Extending the Vector Instruction Set for HighPerformance DSP Matrixes Based on GCC
      XIN Naijun,CHEN Xucan,SUN Haiyan,YANG Liu,LUO Jie,DAN Xiaoqiang,WANG Ji
      2012, 34(1): 58-63. doi:
      Abstract ( 581 )   PDF (564KB) ( 374 )     

      Autovectorization is an optimal method for the compiler to improve the parallelism of programs.With the extensive use of a computing platform supporting the SIMD architecture processor, autovectorization becomes a hot research of compiler technology. The GCC compiler is a kind of open source, crossplatform compiler. Based on the internal autovectorization algorithm and the architecture and instruction set characteristics of the Matrix chip, this paper extends the Matrix vector instruction set at GCC’s backend and realizes the basic autovectorization support. The measured results indicate that the extended compiler can support the Matrix vector instruction set, the basic autovectorization and the development of the Matrixbased parallel programs by way of builtin functions.

      Design and Implementation of an Interrupter Processing System in Matrix DSPs
      SHU Shengliang,SUN Yongjie,WAN Jianghua
      2012, 34(1): 64-68. doi:
      Abstract ( 318 )   PDF (582KB) ( 386 )     

      This paper introducs the mechanism of an interrupt controller. During the design process, designers not only need to ensure correct functions, but also need to minimize the interrupt delay cost .There are no differences between the hardware interrupt mechanism and the software interrupt mechanism. Besides, the interrupt controller supports interrupt nesting and the interrupt nesting mechanism is very simple and flexible. The control logic is simplified and the interrupt latency overhead is reduced from 5 clock cycles to 4 clock cycles for this interrupt handing mechanism.

      Design and Implementation of a Fast SIMD FloatingPoint Fused MultiplyAdd Unit
      WU Tiebin,LIU Hengzhu,YANG Hui,ZHANG Jianfeng,HOU Shen
      2012, 34(1): 69-73. doi:
      Abstract ( 566 )   PDF (1136KB) ( 402 )     

      A new 5-stage pipelined architecture of floatingpoint fused multiplyadd (FMAC) unit is proposed and implemented. In this architecture, double precision or doublesingle precision floatingpoint multiply,multiplyadd and multiplysubtract operations are supported. The unit is implemented to RTL Code, and simulated and verified in Modelsim and NC Verilog. Further more, it is synthesized in the 65nm CMOS technology by Design Complier of Synopsys, and the frequency reaches 714.286MHz.In addition, compared with the  conventional lowdelay FMAC of paper [3] in the same environment, apart from 6.61 percent of area which could be acceptable is increased, 17.89 percent of delay and 25.08 percent of power is reduced.

      Design and Implementation of a MultiChannel Parallel Enhanced Direct Memory Access Controller
      CHEN Haibo,SUN Yongjie,YU Zaixiang
      2012, 34(1): 74-78. doi:
      Abstract ( 355 )   PDF (657KB) ( 378 )     

      With the continuous development of DSPs(Digital Signal Processor), the traditional DMA (Direct Memory Access) controller has been replaced by EDMA (Enhanced Direct Memory Access). A configurable arbitration mechanism for transfer requests and a two level parallel transmission control structure are designed to improve the lower parallelism of data transmission and lower efficiency in the current EDMA. Particularly, we propose a highperformance EDMA controller which has 64 channels. This EDMA supports doublewords access, burst and parallel transmission. The contribution of our paper is that we implement the parallelism of many transfer requests apart from the parallelism of read and write.

      A Program FlowSensitive SelfModifying Code Obfuscation Method
      HE Yanxiang,CHEN Yong,WU Wei,CHEN Nian,XU Chao,LIU Jianbo,SU Wen
      2012, 34(1): 79-85. doi:
      Abstract ( 525 )   PDF (1025KB) ( 595 )     

      Selfmodifying code obfuscation is an effective technique to hide the important information of programs. In this paper, we focus on reducing the cost of obfuscated codes and enhancing the degree of obfuscation to use a flowsensitive method to select the obfuscated codes that are important relatively such as control instruction and propose a twostep comparing obfuscation model that can locate the obfuscated instructions in binary codes precisely that can help change these codes to illegal codes to defense the disassembly. The model contains two parts. The first part uses the flowsensitive analyses to get the obfuscated instructions and generate two obfuscated codes and one obfuscated code mapping file. Then, the second part compares these two obfuscated codes to generate the final obfuscated codes containing the illegal instruction codes based on the obfuscated code mapping file. Through the experiments, the obfuscated instructions are about 3% of the whole codes and the disassemble codes are much different with the source codes and even some error instructions appear.

      Application of an Improved Particle Swarm Optimization Algorithm in Software Test Data Generation
      SHI Guiying
      2012, 34(1): 86-89. doi:
      Abstract ( 284 )   PDF (507KB) ( 404 )     

      Software testing is an important means of software quality assurance,the automatic generation of test cases has been widely studied. By analyzing the advantages and disadvantages of the genetic algorithm, the particle swarm optimization algorithm and the ant colony algorithm,the paper proposes a new improved particle swarm algorithm in the automatic generation of test cases. The pheromone mechanism of the ant colony algorithm is introduced into the particle swarm algorithm, which can increase the diversity of particles and overcome the defect that PSO is easy to premature and stagnation. Finally the simulation experiment proves the feasibility and efficiency of the algorithm in software testing.

      An Improved Fireworks Explosion Optimization Algorithm and Its Convergence Analysis
      CAO Ju,JI Yanfang
      2012, 34(1): 90-93. doi:
      Abstract ( 365 )   PDF (356KB) ( 389 )     

      This paper analyzes the advantages and disadvantages of the fireworks blast algorithm (FEO)based on the PSO algorithm, uses the idea of exchange operator for reference, and proposes an improved algorithm for FEO. The algorithm discusses in detail the construction of the exchange operator, gives of specific operational processes, and focuses on the improvement of the fireworks explosion proof algorithm with probability 1 convergence to the global optimal solution. Finally, three simulation standard test functions are performed and compared with other intelligent optimization algorithms. The result of comparison is that the improved FEO algorithm achieves very good results, and has obvious advantages.

      Online Shot Boundary Detection Based on Incremental Principal Component Analysis
      ZHU Qingsheng,MENG Guichao,GE Yao
      2012, 34(1): 94-97. doi:
      Abstract ( 311 )   PDF (601KB) ( 338 )     

      Shot boundary detection is the key point of contentbased video retrieval. In order to implement online detection, a method based on incremental principal component analysis (IPCA) is proposed to analyze video in a realtime way in this paper, and then to get the shot boundary. Its advantage is detecting shot boundary and extracting abstract video without acquiring the whole video in advance, in virtue of which it makes the online detection come true. But it needs large memory, which can be solved by the way proposed. The experiment proves it has good performance.

      A Method of Borehole Histogram Automatic Mapping Based on MapGIS
      LUO Xiaoxia,ZHANG Xinxia
      2012, 34(1): 98-102. doi:
      Abstract ( 396 )   PDF (480KB) ( 519 )     

      On the basis of analyzing and synthesizing the geological data of coalfield exploration,starting from the organization methods of borehole data,we analyse the design idea, the implementation technology, the filling method of lithology pattern, lithological geological column and buffer line drawing algorithms, etc. According to the problems that it is  difficult to deal with the coordinate relationship between the stratum and the lithology description with words,we propose a new buffer line drawing method  based on the atomatic  text layout idea ,and give a detailed description in this paper. Based on the MapGIS6.7 platform,the MFC secondary development method and other methods ,the automatic generation of bore historgrams is realizaed. It makes good adhesion of the geologic graphic and spatial data, makes interchecking between graphics and their attributes, gives play to the  full function of GIS, and decreases the development  difficulty. Finally,the method is verified by the practical borehole data of HUANGLONG,which can create beautiful and coordinative graphics,and satisfy the demands of practical work.

      A Text Similarity Matrix OperationBased Classification Algorithm for Largescale Unstructured Complaint Data
      LI Qing1,CHEN Yang2,XIE Haoran1,MENG Shengguang3
      2012, 34(1): 103-107. doi:
      Abstract ( 354 )   PDF (663KB) ( 474 )     

      With the fast development of the Internet and information technology nowadays, the growth of the volume of unstructured data is exponential. In particular, the prevalence of the Web 2.0 network community further enlarges the growth tendency. Therefore, how to manage and organize largescale unstructured data effectively, so as to facilitate enduser information access, becomes an urgent and important research topic. In this paper, based on the text of unstructured data modeling and text similarity, the existing largescale unstructured data classification algorithms are surveyed and discussed, and they are applied to a China Mobile user complaint data classification system. Upon the latter, the effectiveness of processing the complaint data is shown to have been much improved, and the usage of our proposed classification algorithm and system architecture is verified.

      New Fuzzy Entropy of Vague Sets
      XU Fengsheng
      2012, 34(1): 108-110. doi:
      Abstract ( 351 )   PDF (303KB) ( 339 )     

      The drawbacks of the existing definition on fuzzy entropy of vague sets are pointed out, and the causes of drawbacks are analysed. We give an axiomatizing definition on fuzzy entropy of vague sets, propose a new fuzzy entropy of vague sets,and prove its rationality and validity in this paper.