Current Issue

• 2013, No. 1　Published:25 January 2013 Last issue    Next issue
  Columns in this issue: 论文

• 论文

  New directions in integer factorization

  YAN Songyuan

  2013, 35(1): 1-14. doi:

  Abstract ( 227 )   PDF (752KB) ( 399 )   　　

  It is wellknown that the security of the most famous and widely used publickey cryptosystem RSA relies on the computational intractability of the integer factorization problem. In this paper, we shall discuss some new directions and new developments in integer factorization, and their implications in the cryptanalysis of RSA and other factoringbased cryptosystems.

  Federation parallel computing in JASMIN and its application in multiphysics simulation

  ZHANG Aiqing,MO Zeyao,CAO Xiaolin,AN Hengbin,GUO Hong

  2013, 35(1): 15-23. doi:

  Abstract ( 167 )   PDF (1050KB) ( 279 )   　　

  Multiphysics simulation is a type of complex applications. When computing in parallel, one has to consider not only the implementation of different physical processes, but also the construction of data dependencies and exchange of physical quantities in different physical processes. This is challenging in both design and implementation of parallel algorithms. JASMIN provides federation parallel computing, which encapsulates and implements multiphysics parallel computing on single level structured grids. We apply this feature in real word scenarios such as ICF and earth system simulations and develop several applications. These applications can then run numerical simulations with thousands of CPU cores.

  Conformance checking method for Web service interaction behaviors based on Petri nets

  ZHU Jun1,GUO Changguo1,2,WU Quanyuan1

  2013, 35(1): 24-29. doi:

  Abstract ( 109 )   PDF (1404KB) ( 242 )   　　

  It is difficult to guarantee the conformance between the actual interaction behavior of Web service composition and its well defined specification in such a complicated and unpredicted Internet environment. In order to solve this problem, this paper proposes a runtime conformance checking method for Web services interaction behaviors based on Petri nets. First, it provides a runtime monitoring framework for Web service interaction behaviors. Then, the conformance checking mechanism for services interaction behaviors is also fully introduced. At last, we evaluate the overhead and performance of runtime monitor.

  Design and implementation of dynamic management
  framework for service oriented middleware on cloud platform

  HUANG He,LIU Xudong,SUN Hailong

  2013, 35(1): 30-35. doi:

  Abstract ( 150 )   PDF (663KB) ( 231 )   　　

  The development of the serviceoriented software may involve different kinds and layers of service middleware, which brings extra burden to developers in configuration, management, and maintenance so as to affect the development efficiency. Under the support of cloud computing technology, this paper designs and implements a dynamical service middleware management framework. Based on the demand of developers, it transparently and dynamically configures the environment of service middleware, manages and maintains the service middleware environment well, ensures the stabilization and reliability of middleware.

  Design and implementation of  coveragedriven chip function verification

  LUO Li,HE Hongjun,DOU Qiang,XU Weixia

  2013, 35(1): 36-40. doi:

  Abstract ( 133 )   PDF (535KB) ( 229 )   　　

  With the development of integrated circuit technology, chip performance is increasing, time to market is becoming shorter, chip verification is a key component of the chip design and is used in the entire design process, so the efficiency and quality of verification directly determines the success or failure of the chip. The design and implementation process of coveragedriven function verification is presented, it is more efficient to use PSL languages designed as assertion monitors to describe system behavior, the simulator tests these assertion monitors, and generate warnings or errors if an assertion fails, monitors will quickly identify when the protocols or sequences of signals are incorrect. This approach is used in a network interface chip design. It reduces the complexity, and improves the speed and quality of verification. Coverage dates are used to estimate the verification process, integrality and correctness of test bench, this method increases the design efficiency.

  Application of PCI Express in embeded MPSoC

  YIN Yaming1,LIU Qiuli2,CHEN Shuming1

  2013, 35(1): 41-46. doi:

  Abstract ( 129 )   PDF (717KB) ( 252 )   　　

  With the increase of application requirement and the development of semiconductor technology, MPSoC (MultiProcessor SystemonChip) becomes a key research area. As the third generation high performance I/O interconnection technology, PCI Express has many technical advantages, such as highspeed, highperformance, pointtopoint, dual simplex, packet based protocol, differential signaling link for interconnecting devices. PCI Express has been more applied in general purpose high performance computers. In this paper, we applied PCI Express to an interchip interconnection module of QDSP, which is an embedded MPSoC. We took into account both design requirement and characteristics of PCI Express, adopted IP based design method, so the design period is shortened and the results are favorable. The total area of the interchip module is 0.65mm2 in 0.13μm technology, and the protocol conversion module has an area of 0.12mm2. The valid bandwidth of data transmission is 1.63Gb/s.

  A lowoverhead heterogeneous variable way L2

  CacheYAN Peixiang,YANG Xianju,ZHANG Minxuan

  2013, 35(1): 47-51. doi:

  Abstract ( 115 )   PDF (1195KB) ( 157 )   　　

  Exploiting nonuniform distribution of cache accesses among sets, VWay cache allows varying ways in sets according to the runtime demands and outperforms conventional setassociative cache in resource utilization. However, the tag array in VWay cache is expanded, inducing large area and power overhead. Considering that the tag array is underutilized in VWay cache, we propose a lowoverhead heterogeneous variable way cache, named HVWay cache. The HVWay cache adopts a heterogeneous tag array and cut down the capacity of tag ways by sets sharing in the same way. Maintaining tag replacement information in perset granularity, The HVWay cache selects the least recently used tag entries for eviction. Experiment results of Cacti and Simics simulators show that the HVWay cache brings down the latency, area and power overhead greatly at the expense of small performance loss.

  An adaptive rolebased congestion control for DTN

  TAO Yong1，2,GONG Zhenghu2

  2013, 35(1): 52-56. doi:

  Abstract ( 110 )   PDF (544KB) ( 291 )   　　

  Homogeneous nodes in DTN are different in the role and contribution in the communication, as the deployment of location and other reasons. As a result of the custody transfer mode of communication, the hotspot node buffer is prematurely exhausted, leading to congestion. In this paper, we present an Adaptive RoleBased Routing (ARBR) algorithm. With it, each node adjusts the priority parameters itself according to the network load condition and only receives the data from those nodes with equal or larger priority, so the local connectivity is effectively used and the traffic near the key nodes can be suppressed. Simulation results show that, the ARBR can effectively alleviate the bottleneck node congestion, make full use of the random connection communication opportunities and improve the network throughput.

  A calculation method of link stability in VANET

  ZHU Junyu,HUANG Chuanhe,XU Liya,WANG Xiaomao,CHEN Xi

  2013, 35(1): 57-60. doi:

  Abstract ( 129 )   PDF (452KB) ( 419 )   　　

  In VANET, the found link is easy to break due to the high mobility of node and the impact of road. Routing is the key factor of implementing VANET. Link stability is an important factor that evaluates the performance of routing algorithm. This paper proposes a calculation method of link stability based on the connectivity probability to measure the robustness and reliability of the link. Experimental results show that the method is applicable to the VANET.

  An improved AODV routing protocol in urban vehicular ad hoc networks

  CAI Jing,ZHU Yubing

  2013, 35(1): 61-66. doi:

  Abstract ( 120 )   PDF (740KB) ( 328 )   　　

  Considering the characteristics of VANET in urban traffic environment and the shortage of broadcast routing detection of the AODV protocol, proposes an improved AODV routing protocol, where the routing detection combines the greedy forwarding unicast routing detection with the broadcast routing detection of classical AODV protocol. Furthermore, selecting the next hop forwarding node in the unicast routing detection takes into account both the greedy forwarding and the link stability to reduce the broadcast frames and improve the routing stability. The simulation results show that the improved AODV protocol is more suitable for Urban Vehicular Ad Hoc Networks.

  An interference avoidance multipath routing protocol based on virtual grid

  ZHU Lin,ZHANG Ke,DONG Hailan

  2013, 35(1): 67-71. doi:

  Abstract ( 148 )   PDF (518KB) ( 164 )   　　

  Parallel multipath interference is caused by the broadcast characteristic of wireless channel. It becomes the main problem of using multipath routing protocol in wireless multimedia sensor network. Against this problem, an interference avoidance multipath routing protocol baseon virtual grid is proposed. The protocol divides the monitoring region into several virtual grids. Through beforehand geographical separating, the protocol preferentially chooses the cluster node in the virtual grid of mutual noninterference in geography. The distance among routes which interfere by each other is as much as possible. It ensures that there is no interference or little. Simulation results show that IAMVG reduces the parallel multipath interference and improves the parallel transmission ratio and endtoend delay.

  An access control method for PDM system based on permission bits  

  LIU Zhi,WU Gang

  2013, 35(1): 72-76. doi:

  Abstract ( 151 )   PDF (696KB) ( 233 )   　　

  Access control is an important security technology to protect the information system. In this paper, we review the existing access control models and propose the PDMRBAC model .This model is designed to solve the problems such as inefficiency and difficult management, which exist in the PDM system and are caused by huge amount of data, finegrained control of data and too many user levels. We use user group hierarchy instead of role hierarchy to decrease permission configuration data and introduce permission hierarchy to manage data permission. Under the application in an enterprise PDM system, we also propose an access control algorithm based on permission bits to solve the conflict caused by negative permissions.

  Method to enhance the spatial resolution of gas propagation situation map based on wireless sensor networks 

  XU Zhengyi1,WEI Jianming2,WANG Xiang3,MA Xiaoyuan2,LIU Daoming2,KONG Zhishe

  2013, 35(1): 77-81. doi:

  Abstract ( 110 )   PDF (912KB) ( 176 )   　　

  In emergency rescue, the situation map (plume) of gas propagation is normally gained by modeling method. With the development of WSN (wireless sensor network), it provides a new strategy to plot accuracy situation map due to its strengths in fast deployment and distributed sensing. However, in practice, the nodes may be deployed limitedly and erroneously, which could cause blind area and low spatial resolution. To solve this problem, a method that can improve the resolution of the situation map is proposed. The method use potential energy map yielded by Gaussian mask to generate the sensor subnode position. Then the concentration value of subnode is evaluated by Bayesian classifier. Also the vector field of environment is concerned to simplify the course of parameter learning. The simulation result shows that the method can improve the spatial resolution of the situation map by 1~3 times, and decrease the blind area by 10%~30%. Furthermore, the algorithm can be used for real time applications.

  Research of directed searching and monitoring based on cloud computing   

  QU Zhenxin，ZHU Wenchang

  2013, 35(1): 82-87. doi:

  Abstract ( 112 )   PDF (746KB) ( 270 )   　　

  Traditional search engines cannot replaces users to support realtime monitoring. To solve this problem, this paper proposes the initiative directed searching and monitoring technology. Users can customize their own tasks, including search websites and search theme. The system monitors at the userdefined period, and the results are returned to the user immediately. The Google App Engine (GAE) is used as the development platform, its several cloud computing services are used to solve the problems such as the planned task management, multitasking and high concurrency. We rewrite the web crawler and propose the directed web crawler. Combining the directed crawler and the cloud server, the crawling time is shorten and the monitoring efficiency is increased. It is a successful experiment on Platform as a Service (PaaS) that combining the cloud platform and the searching and monitoring technology.

   

  Research on social semantic network analysis

  CAI Guoyong,LIN Hang

  2013, 35(1): 88-93. doi:

  Abstract ( 136 )   PDF (760KB) ( 243 )   　　

  To meet the demands of the semantic analysis for online social network, a social semantic network analysis framework is proposed. The framework includes two parts. The first part is the semantic representation of online social networks. In this part, the social network is described by RDF graph model and existing ontology so that these networks are endowed with rich semantic information. The second part is semantic analysis for online social networks. In this part, SPARQL is used for querying and filtering the semantic graph of the online social network to acquire the data which meets the semantic requirement. Moreover, the grain size of the analysis is controlled by using properties’ hierarchical structure and the analysis for the entire network is implemented by retrieving the property path. The effectiveness of the proposed framework is demonstrated by a real application case.

  Coordinative relationship model for groups organization based on the description logic of tasks

  ZHANG Wei，ZENG Liang，LI Sikun

  2013, 35(1): 94-99. doi:

  Abstract ( 137 )   PDF (668KB) ( 210 )   　　

  Modeling group organizations is the foundation for further research on group coordinative behavior. Most of existing organization models consider Agent organization or individual lowlevel instruction interaction, but concern little about the description of highlevel dynamic task interactions. In the paper, we propose a novel group organizational coordinative relationship model named GRNA (GroupRoleNormAbility) to describe the organizational coordinative relationship of agent groups. The GRNA model is based on the description logic of the task and it contains two submodels: cognition submodel and interaction submodel. The cognition submodel which provides accurate definitions of terms is built on domain ontology, while the interaction submodel based on the description logic of tasks reflects the collaboration between the tasks. Through the case study, we show that the GRNA model can describe norms and abilities of groups, provide powerful services of decidable deduction for the achievability of organization tasks, and express highlevel task interaction semantics of groups.

  Research on formalism of architecture description language based on B method    

  DING Xiangling1,WANG Zhigang2

  2013, 35(1): 100-106. doi:

  Abstract ( 109 )   PDF (479KB) ( 237 )   　　

  By analyzing the features of B method and software architecture description language ABC/ADL, this paper proposes a formal software method combining B method and ABC/ADL. The method utilizes the extended event mechanism of B method, defines components, connectors, behavior specification, behavior constraints and constraints instances of the Architecture description language ABC/ADL, and then makes the B method based ABC/ADL be able to formally describe the structure and behavior of the software architecture.

  Moving target detection based on DM642

  LIU Jun,LIANG Jiuzhen,CHAI Zhilei

  2013, 35(1): 107-112. doi:

  Abstract ( 134 )   PDF (703KB) ( 238 )   　　

  Proposes an efficient moving target detection algorithm, which combines the GMM with the YUV color space. The GMM has strong robustness to the change of the light in the background, and it also has a good inhibitory action to the periodic changes of the background. The detected target has good connectivity. However, the GMM is sensitive to global noise, global brightness change, and easy to mistakenly judge the background points as the foreground points. In order to eliminate the GMM’s false alarms, uses the UV components, which are not sensitive to the changes of the global brightness, for the motion detection, and then the result will do ‘AND operation’ with the Y components motion detection result. Finally, uses the algorithm based on vertical projection shadow elimination to remove the shadow of the motion target. The algorithm is implemented on the DM642 development board. Experimental results show that the algorithm can accurately detects the moving target in realtime, and it is not sensitive to the global illumination changes.

  Extensions of cubic Hermite parametric curve and surface

  LI Juncheng,XIE Chun,YANG Lian

  2013, 35(1): 113-118. doi:

  Abstract ( 162 )   PDF (711KB) ( 214 )   　　

  The shapes of the standard cubic parametric Hermite curve and surface are hard to be adjusted when the interpolation conditions are given. For solving this problem, a class of quartic Hermite basis functions is presented through increasing the degree of basis functions. And then, the corresponding quartic Hermite parametric curve and surface with shape parameters are presented. The proposed curve and surface are extensions of the corresponding standard cubic Hermite parametric curve and surface. They not only inherit the interpolation properties of the standard cubic Hermite parametric curve and surface, but also can be local or global adjusted by using the shape parameters when the interpolation conditions are fixed, which offers a new method for constructing interpolation curve and surface.

  Adaptive accelerated particle swarm algorithm for image registration based on normalized edge mutual information

  FENG Xuefang,WU Xisheng

  2013, 35(1): 119-123. doi:

  Abstract ( 129 )   PDF (811KB) ( 237 )   　　

  The traditional normalized mutual information neglects the spatial information, so the registration result will be incorrect when the image mixes with noises. Edge is the basic character of image, in order to solve the drawback of the normalized mutual information method, improve precision and speed up the convergence, we combines the image edge information with the gray information adaptively to form the normalized edge mutual information measure (NCMI) and propose an adaptive accelerate particle swarm optimization algorithm (AAPSO) based on the accelerated factor. The AAPSO is used for image registration based on the NCMI. By sorting the solutions, a specified number of worst solutions will be forced to accelerate in order to determine the direction of global solution, and we also improve the adaptive inertia weight formula, thereby it improves convergence, prevents premature convergence and increases the diversity of the optimal solution. Meanwhile, the AAPSO algorithm adds the accelerated factor to improve convergence speed. Result shows that the method has a high registration precision, fast registration speed, and it has strong applicability.