Current Issue

• 2015, No. 03　Published:25 March 2015 Last issue    Next issue
  Columns in this issue: 论文

• 论文

  Research on uncertain CEP for CPS  

  CAO Kening1,2,LI Renfa1,ZHANG Xiaoming1,ZHANG Xinlong1

  2015, 37(03): 415-421. doi:

  Abstract ( 168 )   PDF (657KB) ( 246 )   　　

  The wide application of Cyber Physical System (CPS) requires solving a crucial issue regarding the information processing of CPS software.Complex Event Processing(CEP) is one of the core tasks for CPS information processing.The event streams of CPS applications have many features,such as heterogeneity,distribution,mass,uncertainty,and et al. In the practical applications of the CPS,due to reasons,such as noise,sensor error or wireless communication techniques,uncertain complex events processing becomes very important. In order to deal with largescale probabilistic streams,we propose an effective method called Uncertain Complex Event Stream Processing (UCESP),which can not only handle massive uncertain event streams in time but also calculate the probability of complex events.USCESP improves the existing RFID Complex Event Detection Algorithm (RECDA),and supports query processing of history probabilistic events.We also propose an event probability model for probability calculation,and improve the efficiency by using the association query table.Experiments show that, compared with traditional methods, the proposal has better performance in handling uncertain event streams.

  A parallel algorithm for mining high utility itemsets  

  SONG Wei，JI Honglei，LI Jinhong

  2015, 37(03): 422-428. doi:

  Abstract ( 112 )   PDF (750KB) ( 276 )   　　

  Mining high utility itemsets is becoming a hot research topic in data mining owing to its ability to reflect users’preferences and make up for the shortcoming of measuring itemsets only by support degree.To meet the needs of larger data size,a parallel algorithm,called Parallel High Utility Itemset Mine (PHUIMine ),for mining high utility itemsets is proposed.Firstly,a tree structure,called DHUItree, is introduced to capture the information of high utility itemsets. Meanwhile, the DHUItree construction method is described,and the dynamic pruning strategy of DHUItree is discussed.Then, the parallel algorithm is presented. Experimental results show that PHUIMine algorithm is efficient and has low storage cost.

  Survey of adiabatic quantum optimization algorithms  

  ZHANG Yingyu1，FU Zhanghua2

  2015, 37(03): 429-433. doi:

  Abstract ( 140 )   PDF (459KB) ( 643 )   　　

  Adiabatic quantum optimization was first proposed in 2001,which was attended to solve the NPC combinatorial optimization problems,and soon became one of the hot topics in  quantum computation.This survey reviews the progress in the field of adiabatic quantum optimization in the past decade,and summarizes the key methods and techniques used in the studies of adiabatic quantum optimization algorithms. Finally,this survey is concluded by predicting the future of the field.

  Study on frailty evaluation and delay
  service for elders based on cloud platform  

  WANG Jie1，YU Yanshuo1，LIN Chungchih2

  2015, 37(03): 434-439. doi:

  Abstract ( 99 )   PDF (864KB) ( 262 )   　　

  Frailty is becoming one of the greatest gerontological challenges faced by modern societies with aging populations.A novel systematic model for measuring and assessing body degeneration is proposed.Based on ontology and cloud computing,the assessment results and exercise prescription knowledge database are combined to make scientific and reasonable exercise plans.An experiment is designed to investigate the effectiveness of the automatic model by measuring and comparing degeneration.Experimental results show that the proposed cloud platform has a good performance for realtime application demands,and the subjects’degeneration indicator measurements are significantly improved.

  Strategy and algorithms for replica update in tree networks  

  WANG Xu,WU Jigang,HOU Rui

  2015, 37(03): 440-445. doi:

  Abstract ( 107 )   PDF (594KB) ( 215 )   　　

  The problem of replica placement and update in tree networks plays an important role in network communications. When the data access requirements change over time, the replica placement and update strategy should make sure the quality of service and reduce the cost of network operating and replica update. We propose two greedy update strategies named MAX_REUSE strategy and REQUEST_COVER strategy to solve the update problem.Time complexity analysis and simulation show that the complexity of the proposed algorithms is just O(nlog n) in worst case, while the optimal solution obtained by dynamic programming is O(n5).The cost of network operating and replica update in two algorithms is no more than 11% compared to the optimal solution. The proposed strategies  not only reduce the time complexity but also keep a low total cost.

  Combinational method for fault diagnosis
  in analog circuits based on Volterra series  

  WANG Xujing，CHEN Changxing，REN Xiaoyue

  2015, 37(03): 446-451. doi:

  Abstract ( 213 )   PDF (656KB) ( 231 )   　　

  In order to solve the problems of inherent complexity of analog circuits,long detecting time and low correct recognition rate in traditional fault diagnosis methods, we propose a combinational method for fault diagnosis in analog circuits, which combines improved Least Squares Support Vector Machine (LSSVM) by Hidden Markov Model（HMM）with Volterra series.Firstly,we use frequencydomain core of Volterra series to extract circuit fault features.Then we adopt improved LSSVM by HMM for modal classification,and the fault diagnosis is completed.Simulation results show that compared with traditional BP neural network and LSSVM method,the proposed method is more efficient in system fault identification and faster in fault diagnosis.

  Design of a TYPE-I M-LVDS receiver IC
  based on TIA/EIA-899 standard   

  LI Zhi1,2，CHEN Diping1，ZHAO Jianzhong2，Cao Chengcheng1,2

  2015, 37(03): 452-456. doi:

  Abstract ( 202 )   PDF (3790KB) ( 239 )   　　

  We propose an implementation scheme for a TYPE-I M-LVDS receiver based on TIA/EIA-899 standard.A novel common-mode voltage shift circuit is designed to realize an input common-mode range that is beyond the rail of the power voltage,which can simplify the post stage circuit,thus saving area and power consumption.The pre-amplifier in the receiver can provide a fixed magnification for input signals,and the hysteresis comparator brings hysteresis effect to the system.The chip is fabricated in GSMC 0.18 μm 1P6M CMOS technology,and the test results indicate that the receiver has an input commonmod range of -1.4 V~3.8 V,a signaling rate greater than 250 Mbps,and a typical hysteresis voltage is 28 mV.

  Survey on automatic network layouts based
  on force-directed model  

  SHUI Chao1,CHENG Tao1,LI Hui2,CHENG Guosheng3

  2015, 37(03): 457-465. doi:

  Abstract ( 372 )   PDF (977KB) ( 801 )   　　

  Automatically arranging the nodes and edges of a graph to make a pleasing picture is an important research area in visualization.The layout algorithm based on force-directed model,also known as spring embedders,have attracted many attentions and have become very popular in drawing undirected graphs.We divide the related work about the layout algorithm based on forcedirected model into five categories:basic model,multidimensional scaling layout,multi-level layout,non-Euclidean layout,and constrained graph layout.We introduce the classical method,the research progress and the branch area of each category,and discuss the future work and challenges.

  Automated search of iterative
  differential mode with feistel-SP structure  

  LI Yanjun1,FANG Bo1,2,MAO Ming1,2

  2015, 37(03): 466-470. doi:

  Abstract ( 139 )   PDF (1164KB) ( 244 )   　　

  Based on a new symbol differential representation,an automated search technique is presented,which can search out the optimal iterative differential mode of the block cipher with FeistelSP structure.Selection of an appropriate mode can help find out all of the best iterative differential paths.The proposed method can not only greatly reduce the computational complexity,but also construct several rounds of optimal differential paths and find other unknown results. Based on the lightweight block cipher MIBS with automated search tools,the third and fourth optimaliterative differential paths of MIBS are found out, and the probabilities are 2-20 and 2-26 respectively.In addition,all the optimal iterative differential paths that meet the conditions are searched out.Key words:  

  Research on the impact of OFDM symbol
  characteristics on DCF performance 

  FANG Fei1,2,MAO Yuming1

  2015, 37(03): 471-478. doi:

  Abstract ( 88 )   PDF (1160KB) ( 287 )   　　

  For cognitive wireless networks, due to the long time delay characteristics of channel frequency,both OFDM symbol time and slot time are big,which makes the SIFS increase in the CSMA/CA.In addition,with the improvement of the data rate on physical layer in wireless local area network,the number of data bits carried by each OFDM symbol increase.To assess the physical long extension performance of DCF under the environment of high speed model,we obtain the CSMA/CA system throughput expression based on the twodimensional Markov model. Mathematical analysis shows that the throughput is mainly determined by the node number of the network,packet length,the number bits carried by OFDM,the slot time and OFDM symbol time.Theoretical calculation and simulation results show that as the data bits of OFDM increase,the slot time and the OFDM symbols are longer. And the throughput performance of CSMA/CA is also degraded.

  Anti-jamming attack communication by adaptive
  rateless codes in wireless networks  

  L Shaohe1,LIAO Linbing1,LI Wen2,ZHANG Yiwei3,WANG Xiaodong1,ZHOU Xingming1

  2015, 37(03): 479-485. doi:

  Abstract ( 137 )   PDF (1612KB) ( 265 )   　　

  As jamming attack can interrupt signal decoding and severely reduce communication performance, an adaptive rateless communication mechanism is proposed to reduce the interference effect of jamming attack.With the help of rateless codes, a packet is split into multiple encoded micropackets and then transmitted independently,which can reduce the impact of interference and take advantage of the noncontiguous available channel. By adaptively adjusting the length of the micropacket,better robustness can be achieved by using a smaller length when the attacks occur frequently.Meanwhile, high efficiency can be obtained by increasing the micropacket length when attacks occur rarely.Experimental results show that, in comparison with direct transmission,rateless transmission can improve the throughput by 50% on average,and the stability by an order of magnitude.In summary, rateless communication can effectively resist jamming attacks and achieve high communication efficiency.

  Application research of monotonic index
  space in information system risk evaluation 

  WANG Na1,ZHANG Jian2,WANG Jindong1,ZHANG Hengwei1

  2015, 37(03): 486-491. doi:

  Abstract ( 104 )   PDF (1159KB) ( 201 )   　　

  Aiming at the lack of overall properties analysis, we propose a Monotonic Index Space Analysis Model (MISAM) and the sensitivity degree and correlation degree are analyzed based on this model. An index weight distribution method is proposed based on multistage sensitivity, a risk evaluation method is built, and the demand meeting degree is defined to measure the gap between the current system security state and assessor’s demand. The simulation results prove the effectiveness of the proposed model and methods.

  Mobile IP registration protocol
  based on tripartite key agreement  

  JIA Zongpu，TIAN Xiao，LI He

  2015, 37(03): 492-497. doi:

  Abstract ( 98 )   PDF (606KB) ( 165 )   　　

  Most mobile IP registration protocols use symmetric cipher systems and public key cryptosystems together to achieve mutual authentication between entities. But these protocols have certain safety defects because there are no authentication between mobile nodes and foreign agents.In order to improve the security of mobile IP registration agreement, in this paper a certificateless tripartite key agreement (CL-TKA) is introduced into mobile IP registration.A new mobile IP registration protocol is proposed based on CL-TKA to achieve mutual authentication between mobile nodes,hometown agents and foreign agents.The analysis of this protocol shows that the proposal provides higher security and efficiency.

  Trust-based management for dynamic
  spectrum access in cognitive wireless networks  

  CHEN Hongliang,LIU Liping,ZHAO Ming,CHEN Zhigang

  2015, 37(03): 498-502. doi:

  Abstract ( 138 )   PDF (684KB) ( 202 )   　　

  With the rapid development of wireless services and related equipment,special spectrum scarcity in cognitive wireless networks increasingly catches researchers’attention.In centralized cognitive networks,as the fusion center,Secondary User Base Station (SUBS) allocates spectrum resources by receiving the second users’sensing data.However,the secondary users’environmental fluidity to attacks that affects the data sensing of the secondary users, leads to allocation errors of the spectrum resources. We introduce a trust model to represent the secondary users’behaviors in the cognitive loop,and take the credibility as evaluation criteria at the spectrum allocation stage to encourage SUs to sense positively and operate according to specifications.At the sense stage,the more channels the SUs sense,the more correct sensing data there are,the higher reputation it has.At the running stage, the more the SUs’behaviors conform to the network standard, the higher the reputation is.Simulation results show that this model is a good way to decrease the number of bad decisions for SUBS and enhance its resistance to aggression, and it can allocate network resources well and encourage positive behaviors in the whole network .

  Arc tolerance of the maximum flow and its algorithm    

  LIU Yangyang,XIE Zheng,CHEN Zhi

  2015, 37(03): 503-507. doi:

  Abstract ( 127 )   PDF (566KB) ( 252 )   　　

  For the problem that whether the change of channel’s bandwidth will influence the maximum communication ability in the communication network,the arc tolerance problem of the maximum flow is proposed. First we study the arc tolerance of the maximum flow in combination with the nature of the maximum flow and minimum cut.Secondly we propose an arc tolerance polynomial time algorithm with consideration of arcs in and out of the minimum cut. Finally the proposed algorithm is analyzed and compared.Numerical example shows that the algorithm has low complexity and is easy to operate.

  Mobile phone user authentication scheme
  based on embedded accelerometer   

  MIAO Minmin,ZHOU Zhiping,WANG Jiefeng

  2015, 37(03): 508-513. doi:

  Abstract ( 123 )   PDF (692KB) ( 360 )   　　

  In order to guarantee the information security of mobile phones, a user authentication scheme based on a mobile phone with threeaxial embedded accelerometer is proposed. It utilizes an accelerometer to capture the acceleration signal of a person’s authenticating gesture.We propose a new algorithm called Difference BottomUp (DBU) to achieve the automatic detection of gesture endpoints. After denoising the acceleration data streams by wavelet packet decomposition, we adopt the Dynamic Time Warping (DTW) method to calculate the similarities between test gesture and reference gesture, and the results of authentication are obtained from these similarities.Compared with the existing methods, the proposed DBU algorithm is more precise in automatic gesture endpoint detection.The authentication experimental results demonstrate that the false rejection rate is below 5% while the false acceptance rate is 0%, which shows the effectiveness of the scheme.

  Cyclic codes from sequences with the period pm  

  ZHAN Haixia，YUE Qin

  2015, 37(03): 514-516. doi:

  Abstract ( 93 )   PDF (330KB) ( 155 )   　　

  In this paper, we first compute the minimal polynomials of the sequences with the period pm over the field  GF(q),where p is a prime and p|/q,and then take such minimal polynomials as the generate polynomials of cyclic codes over GF(q).Additionally,lower bounds on the minimum (Hamming) weight of such cyclic codes are developed.

  A dynamical access control model based on
  fluent calculus theory  

  YANG Aiqin,CHENG Xianyi

  2015, 37(03): 517-523. doi:

  Abstract ( 98 )   PDF (439KB) ( 184 )   　　

  Access control model provides a theory frame for information security of system, whose purpose is to protect system resources not to be embezzled by unauthorized users and prevent legal users from illegally using the protected information.However,most of the existing access control models belong to static authorization models,which cannot easily describe the dynamic changes of the authorization process in largescale,heterogeneous distributed network system. In order to solve the problems above,a dynamic access control model based on fluent calculus theory (FCDAC) is proposed after thoroughly studying the fluent calculus theory.FCDAC will regard all the granting process as the result of actions and implement the changes of states through actions in the dynamic world,which easily realizes the permission changes by describing the precondition axioms and state update axioms. Finally,an educational management example is applied to validate the proposed theory and the results prove its efficiency.

  Meet-in-the-middle attacks on E2   

  GUAN Xiang1，WEI Yuechuan1，YANG Xiaoyuan 1,2

  2015, 37(03): 524-528. doi:

  Abstract ( 149 )   PDF (528KB) ( 227 )   　　

  As a candidate of AES, E2 algorithm has attracted wide attention because of its unique two SP structures. We evaluate the security of E2 block cipher against meet-in-the-middle attacks. Based on the idea of meet-in-the-middle, by analyzing the feathers of E2 algorithm, a 4-round distinguisher is designed. Using the distinguisher, some meet-in-the-middle attacks are made on 5/6round E2128/256. It is shown that the E2-128 algorithm to 5-round and the E2-256 algorithm to 6-round are not immune to meet-in-the-middle attacks. This is the first time to use the meet-in-the-middle attacks to analyze the E2 algorithm. Compared with  the existing results, data complexity is reduced.

  A NHPP model for the open availability system
  based on Bayes estimation 

  CAO Weidong,NIE Xiaoying,BAI Liang

  2015, 37(03): 529-533. doi:

  Abstract ( 124 )   PDF (482KB) ( 222 )   　　

  From the fault monitoring logs of the Open Availability system,the relationship between the number of its faults and the time interval is analyzed, and a NHPP model is established based on Bayes estimation. Based on prior knowledge, Bayes estimation method deduces the life distribution function of the Open Availability system. When the sampling is not done repeatedly, Bayes estimation makes the prior distribution of F(t) as DP(α,P0),so the posterior distribution of F(t) is easily computed and thus the NHPP model which could accurately reflect the influence of the time interval on the number of faults of the Open Availability system, is improve. Real monitoring logs are used in the experiment to evaluate the model. Simulation results validate the correctness and effectiveness of this model.