Current Issue

• • 2016, Vol. 39 No. 5 Published date:28 October 2016 Last issue Next issue

  Papers

  • Multi-Scale Convolutional Neural Network Model with Multilayer Maxout Networks
  • LIAN Zi-feng, JING Xiao-jun, SUN Song-lin, HUANG Hai
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 1-5,32. DOI:10.13190/j.jbupt.2016.05.001
  • Abstract ( 370 )     HTML     　　
  • Convolution neural network models require the consistency of spatial scales between training images and testing images. In order to alleviate this restriction, a scale invariant convolution neural network model with multi-scale feature extractor was proposed, which can adapt to the in-plane scale change of input images. Meanwhile, multi-layer Maxout networks are nested into the model in order to improve the ability of feature extraction, so as to improve the accuracy of image recognition and classification. Experiments show that the new model improves the scale invariance and classification accuracy of traditional convolution neural networks.
  • References | Supplementary Material | Related Articles

  • A Tucker-2 Model Based Scheme for Joint Signal Detection and Channel Estimation in MIMO Systems
  • DU Jian-he, TIAN Pei, LIN He-yun
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 6-10. DOI:10.13190/j.jbupt.2016.05.002
  • Abstract ( 316 )     HTML     　　
  • A Tucker-2 model based scheme for joint signal detection and channel estimation in multiple-input multiple-output (MIMO) systems was presented. At the source node, the proposed scheme uses three-way coding for each information symbol. This coding approach can achieve space and time diversity, and it makes the transmitted signal built-in blind detection property. The received signal at the destination node is formulated as a Tucker-2 model, and then two receiver algorithms are proposed for joint signal detection and channel estimation. The theory analysis and computer simulation shows that the proposed scheme can jointly estimate the signal and the instantaneous channel state information. Compared with existing approach of pilot symbol-assisted channel estimation, the proposed scheme has higher estimation accuracy.
  • References | Supplementary Material | Related Articles

  • UDN Coordination Beamforming with Transceiver Radio Frequency Impairments
  • FANG Zheng, LI Hai-tao, ZHU Guang, LI Yan
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 11-15. DOI:10.13190/j.jbupt.2016.05.003
  • Abstract ( 549 )     HTML     　　
  • The coordination beamforming scheme with transceiver radio frequency impairments was proposed to improve the performance of ultra-dense wireless network (UDN). Firstly, the coordination beamforming model based on the residual radio frequency impairments is presented, and the convex optimization algorithm is utilized to achieve the optimal solution. Then, considering the limitations of the implementation of the optimal beamformer, the signal leakage noise ratio based the linear suboptimal beamformer is designed by beamforming steering vector and optimal power allocation. Simulations show that the proposed suboptimal beamformer with radio frequency impairments can effectively reduce interference and improve the sum rate of UDN.
  • References | Supplementary Material | Related Articles

  • CBIR Algorithm Based on Relevance Feedback and Robust Local Binary Patterns
  • SUN Ting, GENG Guo-hua
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 16-19. DOI:10.13190/j.jbupt.2016.05.004
  • Abstract ( 307 )     HTML     　　
  • A algorithm of content based image retrieval (CBIR) based on robust local binary patterns (RLBP) and relevance feedback (RF) was proposed. RLBP is a kind of feature extraction operator with good performance, which has strong robustness to the noise and illumination changes. The original data will not be changed with RLBP, and the accuracy of feature extraction can be improved. RF enables the system to learn the user's preferences and guide the search results. Experiments with several texture databases show that the accuracy and robustness of the proposed algorithm is better than that of the similar algorithms.
  • References | Supplementary Material | Related Articles

  • Leakage Resilient Identity-Based Aggregate Signcryption
  • WANG Zhi-wei, ZHANG Xian-yi
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 20-25. DOI:10.13190/j.jbupt.2016.05.005
  • Abstract ( 218 )     HTML     　　
  • In order to solve the problem of secret key leakage in aggregate signcryption, an identity-based hash proof system based on unrestricted identity-based aggregate signcryption scheme is constructed, and its correctness of decapsulation, valid/invalid ciphertext indistinguishability, smoothness and universality are also proved. Then, with the randomness extractor, a leakage resilient identity-based aggregate signcryption scheme is constructed, in which the leakage rate of identity-based secret key can be achieved to 1-o(1). Finally, the security proof of this leakage resilient scheme is also provided.
  • References | Supplementary Material | Related Articles

  • A Broadcasting Copy-Removed Data Delivery Scheme for Delay Tolerant Mobile Sensor Networks
  • YANG Kui-wu, CHEN Yue
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 26-32. DOI:10.13190/j.jbupt.2016.05.006
  • Abstract ( 315 )     HTML     　　
  • Proposed a broadcasting-based copy-removed data delivery scheme (CRD) for delay tolerant mobile sensor networks (DTMSN). Using broadcasting information of base station on the frequency of f₁, sensor nodes not only can remove the redundant messages, but also can compute their own motion states and delivery probabilities which provide the basis for messages forwarding between sensor nodes on the frequency of f₂. At the same time, CRD employs the message survival time and message forwarding domain M to manage the message queues. Simulation results show that CRD has a higher message delivery ratio and less data delivery delay than many other DTMSN data delivering approaches.
  • References | Supplementary Material | Related Articles

  • DoA Estimation Based on Sparse Signal Recovery Utilizing Weighted 1 Norm
  • ZHAO Ji-hong, MA Zhao-tian, QU Hua, WANG Wei-hua, LI Lei-lei
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 33-36,66. DOI:10.13190/j.jbupt.2016.05.007
  • Abstract ( 395 )     HTML     　　
  • When l₁-SVD algorithm is used for direction of arrival (DoA) estimation with few snapshots and low signal noise ratio (SNR), there appear pseudo peaks in spatial spectrum, which lead to inaccurately DoA estimation results. To deal with this problem, the article proposes a DoA estimation method based on sparse signal recovery utilizing weighted 1 norm. Based on the sparse recovery, the weight vector is chosen from the signal subspace and received signal matrix is multiplied. Then the product between weights and elements in the result is made to get weighted 1 norm is taken as target function for minimization. Simulations demonstrate that the proposed algorithm could effectively restrain the pseudo peak and accurately estimate the DoA under the different snapshots, regularization parameter and SNR.
  • References | Supplementary Material | Related Articles

  • Routing Forwarding and Cache Placement Strategy Based on Cache Value in Information-Centric Networking
  • SHI Rui-chang, RUI Lan-lan, HUANG Hao-qiu, PENG Hao
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 37-41. DOI:10.13190/j.jbupt.2016.05.008
  • Abstract ( 301 )     HTML     　　
  • Information-centric networks (ICN) is a novel network architecture centered on content data. But the current route cache strategies exist shortcomings. This paper proposes a routing forwarding and cache placement strategy based on cache value, and then in the cache value decision, considering the busy degree and path delay of the node, we use Shapley value to design the strategy which is in order to support the message and the routing forward; In the caching resolution strategy, we use the Scope field to control the number and the Scope of cached copies. Simulation results show that the proposed method has a high cache hit ratio, and it can effectively reduce the average number of hops.
  • References | Supplementary Material | Related Articles

  • Doppler Effect Removal of Acoustic Signal for High-Velocity Wheel-Bearings
  • CHEN Bin, FU Yu, GAO Bao-cheng
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 42-46. DOI:10.13190/j.jbupt.2016.05.009
  • Abstract ( 361 )     HTML     　　
  • For problems of frequency shift and bandwidth extension of high-speed movement in wayside wheel-bearing acoustic diagnosis, a Doppler effect removal method was proposed based on time difference of arrival and time-domain interpolation. Based on the defect of characteristic frequencies and moving characters of bearings, the placement rules of the trackside microphone array was designed. Through framing, windowing and cross-correlation, the time delay differences among microphones are calculated. The time difference of arrival technique was introduced to estimate the moving position and propagation delay of fault bearings in real time. Through the time domain interpolation, the acoustic signal is received without extension based on the time series of moving bearings. Simulation demonstrates that the algorithm can remove the Doppler effect of acoustic signal effectively in low signal to noise ratio. It is suitable for both constant and variable speed.
  • References | Supplementary Material | Related Articles

  • Target-Recognition Algorithm Based on Improved D-S Evidence Combination Rule
  • ZHOU Li, TANG Wen-jing, GUO Wei-zhen
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 47-50. DOI:10.13190/j.jbupt.2016.05.010
  • Abstract ( 359 )     HTML     　　
  • In order to better solve the fusion problem of high conflict evidence, an improved D-S algorithm fusing three pieces of evidence directly was proposed. Firstly, the calculation method of the support of each focal element under the identification framework is given according to the function of evidence supporting measurement of similarity. Secondly, a weighted assignment algorithm of conflicting information based on D-S evidence combination rule is put forward according to the properties of the conflicting factor generated in the direct fusion process of three-dimensional evidence and the support degree of each focal element. Finally, simulation is implemented under the background of multi-sensor multi-target recognition system. Analysis and simulation show that the improved D-S algorithm based on direct fusion of three-dimensional evidence has a strong anti-interference performance, and it can fuse various types of conflicting information effectively and improve the target recognition probability.
  • References | Supplementary Material | Related Articles

  • Multi-Object Segmentation for Abdominal CT Images Based on Gestalt Cognitive Framework
  • FENG Jun, LIU Fei-hong, LI Pan, BU Qi-rong, WANG Hong-yu
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 51-55. DOI:10.13190/j.jbupt.2016.05.011
  • Abstract ( 303 )     HTML     　　
  • In order to acquire better organ segmentation from abdominal computed tomography (CT) images, a multi-object segmentation algorithm based on cognitive framework is proposed. Inspired by the proximity and similarity idea in gestalt, super pixel concept of CT image processing has been produced. Specifically, by establishing the directed adjacency relationship of super-pixel, the spatial relationships of abdominal organs are modeled as prior knowledge to improve the classification accuracy. Experiments in public datasets illustrate that the proposed algorithm achieves better performance in either speed or accuracy than that of the state-of-art methods.
  • References | Supplementary Material | Related Articles

  • Performance Analysis of 3D MU-MIMO Systems over K Composite Fading Channels
  • LI Xing-wang, AI Xiao-yu, ZHANG Yan-qin, LI Li-hua, LU Guang-yan
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 56-60. DOI:10.13190/j.jbupt.2016.05.012
  • Abstract ( 262 )     HTML     　　
  • For the expression of the theoretical performance analysis of K composite fading channels involving special functions, the closed-form lower bounds on the sum rate of three dimensional multiple input multiple output (3D MIMO) systems over K composite fading channels maximal-ratio combining (MRC) and zero-forcing (ZF) receivers were derived, which include multipath fading, shadow fading, path loss, radiation loss of 3D antenna and user distribution. In addition, the asymptotic performance analysis of massive MIMO systems in view of the lower bound was performed. Correctness of the analysis is provided by the computer simulation, which demonstrates that the lower bounds of the sum rate can approximate the Monte-Carlo simulating values sufficiently.
  • References | Supplementary Material | Related Articles

  • Fast and Real-Time Internet Advertisement Traffic Recognition System Applied to Massive Network Dataset
  • FANG Cheng, ZHAO Xiao-xing, LIU Jun, LEI Zhen-ming
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 61-66. DOI:10.13190/j.jbupt.2016.05.013
  • Abstract ( 407 )     HTML     　　
  • A real-time internet advertisement traffic recognition system applied to massive network dataset was proposed. The model adopts the currently most popular Adblock filter rules as the basic filter rules, and combines the HashTable fast matching algorithm as well as the Aho-Corasick fast matching algorithm to recognize the advertisement traffic in a fast and real-time way. To meet the need of the massive streaming data, the algorithms are deployed on Spark Streaming, a parallel streaming framework for solving streaming data. The model is respectively experimented with both factual data from our lab and the real massive datasets from the network operators. Experiments show that the system can achieve high precision and high calculation performance.
  • References | Supplementary Material | Related Articles

  Reports

  • Dynamic Localization of Mobile Robot Based on Improved APIT
  • FENG Sheng, WU Cheng-dong, ZHANG Yun-zhou
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 67-71,88. DOI:10.13190/j.jbupt.2016.05.014
  • Abstract ( 278 )     HTML     　　
  • According to the communication instability and poor localization accuracy in indoor wireless sensor networks, a dynamic localization of mobile robot was proposed which dynamically chooses neighbor beacon nodes and establish grid space based on boundary of beacon node location in real time. This method applies the receive signal strength index for distance measurement. Furthermore, the range-based improved approximate point in triangle test (APIT) was used to realize the localization. Finally, the localization error-correct is implemented by the classical Kalman filter. The method is adaptable for the communication instability of indoor wireless sensor networks, the Kalman filter provides optimal data. Experiments show that the accuracy and adaptability of the dynamic localization of the mobile robot are better than Kalman filter grid-based improved maximum likelihood estimation algorithm.
  • References | Supplementary Material | Related Articles

  • Visual Tracking Using Bat-Inspired Algorithm
  • GAO Ming-liang, YIN Li-ju, JIANG Jun, SHEN Jin
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 72-77. DOI:10.13190/j.jbupt.2016.05.015
  • Abstract ( 284 )     HTML     　　
  • A new visual tracking method based on bat algorithm (BA) was presented, in which, the BA-based tracking architecture is proposed. Then, the impact of the iterative termination condition, population size, pulse frequency increasing coefficient and pulse amplitude attenuation coefficient on the tracking performance are studied and these parameters are determined. To demonstrate the tracking ability of the proposed tracker, comparative studies of tracking accuracy and speed of the BA-based tracker with three representative trackers, namely, particle filter, meanshift, particle swarm optimization are given. Comparative results show that the proposed algorithm outperforms the other three trackers.
  • References | Supplementary Material | Related Articles

  • An Analysis of the Impact of the Panel Gap on Quiet Zone Characteristics in the Large Compact Antenna Test Range
  • WANG Jun-bo, YAO Yuan, YU Jun-sheng, CHEN Xiao-dong
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 78-82. DOI:10.13190/j.jbupt.2016.05.016
  • Abstract ( 282 )     HTML     　　
  • In order to study the impact of the the panel gap on quiet zone characteristics in the large compact antenna test range (CATR) systems, spatial domain method is adopted firstly, and an appropriate means of joining together is chosen according to the spatial simulation results, in this way, time and angular domain results are simulated then. Time and angular domain simulation can separate interference wave from main wave, comparing the interference wave of different points in the time and angular domain the reasonable range of ideal quiet zone can be obtained. This kind of analysis is efficient for analyzing the impact of the panel gap on quiet zone characteristics in the large CATR.
  • References | Supplementary Material | Related Articles

  • Continous Nearest-Neighbor Query in Location Privacy Preserving
  • WANG Yong, DONG Yi-hong, QIAN Jiang-bo, CHEN Hua-hui
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 83-88. DOI:10.13190/j.jbupt.2016.05.017
  • Abstract ( 570 )     HTML     　　
  • Enjoying the location-based service (LBS), the mobile subscribers may threaten the disclosure of location privacy. To protect location privacy, an effective method for location privacy preserving was proposed to cloak the user's exact coordinates into a spatial region and turn the location-based query into region-based query. Existing continuous nearest-neighbor query algorithms with privacy-aware are based on snapshot, which incur higher central processing unit (CPU) cost. The location privacy-based continuous nearest-neighbor query was studied and an algorithm named reusing-based location privacy-preserving continuous nearest-neighbor query (RLPCNN) which is based on reusing technique query updating was proposed. The algorithm can reduce the cost of computation by using the similarity between the two adjacent time and make the answer set updated quickly, which can quicken the response time markedly. The experiments show that the algorithm is effective and efficient.
  • References | Supplementary Material | Related Articles

  • A Colored Petri Nets Model Based Cloud Test Generation Approach and Implementation System
  • LIU Jing, WU Hai-bo, WANG Shao-shuai, JIA Lei
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 89-93,115. DOI:10.13190/j.jbupt.2016.05.018
  • Abstract ( 488 )     HTML     　　
  • To improve efficiency and automation degree of large-scale test generation, a colored Petri nets (CPN) model based conformance test generation approach, named as PT-Cloud approach, is proposed and implemented to provide a cloud based conformance test case generation service. Utilizing MapReduce technology, PT-Cloud approach could perform test generation oriented model reconfiguration and labeling process, and then test cases with actual input data could be automatically generated. Validated through practical test generation and execution, the PT-Cloud approach could guarantee that all generated test cases are sufficiently feasible for practical test executions, and the efficiency and automatic degree of test generation are effectively promoted.
  • References | Supplementary Material | Related Articles

  • Interpolation and 0-1 Programming Based 3D Localization Algorithm in Wireless Sensor Networks
  • LI Bin, LU Xiao-jun, JIA Xin-chun, YANG Bo
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 94-98. DOI:10.13190/j.jbupt.2016.05.019
  • Abstract ( 333 )     HTML     　　
  • A new algorithm based on interpolation and 0-1 programming was presented for three-dimensional localization in wireless sensor networks. In this algorithm, the spatial interpolation surface of the nodes is established by the anchor nodes coordinates, and the distances of all the communication nodes are derived from the received signal strength indication (RSSI) and empirical radio propagation model. The 0-1 program is used to select the interpolation nodes with the same number of unknown nodes on the space surface. These selected interpolation nodes will meet the distance constraint so as to estimate the unknown node location. The algorithm is simple in design and the communication overhead is low. Simulation indicates that this algorithm has less error in the node localization. It also has good stability and extensibility.
  • References | Supplementary Material | Related Articles

  • Automatic Generation of Test Data in IMX System Based on GA-ACO
  • FENG Xia, HAO Hui-min
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 99-103. DOI:10.13190/j.jbupt.2016.05.020
  • Abstract ( 400 )     HTML     　　
  • In integrated management X-software (IMX) system, genetic algorithm and ant colony algorithm have been used to generate the test data automatically. However, for genetic algorithm, it cannot use the information that provided by the system, thus it will iterate many times to generate the test data. For ant colony algorithm, there is little information pheromone on the path early, so it will take a long time to make it. Accordinly, a method based on hybrid genetic algorithm was proposed. First, execute the genetic algorithm for a few times. Second, use the optimization solution to make distribution for information pheromone. Finally, use ant colony algorithm to give the precision of the solution. Experiments on IMX and triangle program show that the hybrid algorithm has the characteristics of high efficiency, high quality, also it take fewer iterations to find the test data correctly and efficiently.
  • References | Supplementary Material | Related Articles

  • Predicting Job Failure in Cloud Cluster: Based on SVM Classification
  • LIU Chun-hong, HAN Jin-jin, SHANG Yan-lei
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 104-109. DOI:10.13190/j.jbupt.2016.05.021
  • Abstract ( 375 )     HTML     　　
  • A job failure predicting method based on support vector machine (SVM) model was presented. Google cluster traces were studied. The relevant factors of jobs failure were analyzed and the combination of the static and dynamic characteristic was chosen as the feature vectors. The SVM algorithm was chosen to predict termination status of the jobs. Experiments were conducted to compare different kinds of feature vectors and classification models with Google traces dataset in terms of the accuracy rate, false negative rate and precision rate. It is shown that the combination of static and dynamic features are 0.94%, -0.01% and 1.35% higher than the static features, and 9.08%, -1.36% and 8.91% higher than the dynamic features. Experiments also demonstrate that the SVM model is superior to the traditional neural network extreme machine learning, naive Bayes and logistic regression model in these indexes.
  • References | Supplementary Material | Related Articles

  • Perceptual Video Signal Compression Method Based on Structure Analysis
  • YE Feng, LI Cheng-xin, XU Li, CHEN Jia-zhen, MEN Ai-dong
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 110-115. DOI:10.13190/j.jbupt.2016.05.022
  • Abstract ( 277 )     HTML     　　
  • In order to remove the visual perceptual redundancy, a new perceptual video signal processing model based on structure analysis combined with saliency just noticeable distortion (SSJ) was proposed. First, the order structure component, disorderly structure component and texture component can be estimated by some method, which are used to just noticeable distortion (JND) model. Then the disorderly structure uncertainty of disorderly structure component is available to adjust saliency regions of frames and contrast masking. Finally, The SSJ model is incorporated into HEVC software HM 16.0 via the adaptive perception signal process. Experiments show that 10.3% bitrate reduction is achieved in the proposed system compared with HM 16.0 without jeopardizing the perceptual quality.
  • References | Supplementary Material | Related Articles

  • Vertex Degree Distribution in Growth Models with Nonlinear Preferential Attachment Rule
  • LU You-jun, XU Dao-yun, ZHOU Jin-cheng
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 116-123. DOI:10.13190/j.jbupt.2016.05.023
  • Abstract ( 268 )     HTML     　　
  • Vertex degree distribution is an important parameter to evaluate the local property of vertices and connectivity between the vertex and other vertices in the network. An extended growth evolving model was proposed by adding new vertices or new edges using nonlinear preferential attachment rule at each time step. Moreover, the vertex degree distribution expression via the probability methods was calculated, and it was found that some existing network model is one of special cases of the model, the corresponding vertex degree distribution can also be obtained by the vertex degree distribution expression of the model. The expression to obtain the corresponding vertex degree distribution was also used and the numerical simulations for network models of two different vertex weighted functions was designed. Experiments indicate that the numerical simulations are coincide with our theoretical results well.
  • References | Supplementary Material | Related Articles

  • The General Theory of Security (17)——Network Security Ecology
  • YANG Yi-xian, NIU Xin-xin
  • Journal of Beijing University of Posts and Telecommunications. 2016, 39(5): 124-132. DOI:10.13190/j.jbupt.2016.05.024
  • Abstract ( 173 )     HTML     　　
  • This is the first quantitative study of the Network security ecology, for the complex networks space consists of users, hackers, and coexisting with the honkers. Highlights include:①the ecological balance between hackers and users, such as a "lion and sheep" like system, in which the hackers hunt users; ②the ecological balance between hackers and Honker, such as a "herdsmen and the lion" like system, in which the hackers competitive with the honkers; ③the ecological balance between users and honkers "sheep and herders" like system, in which they mutually benefit each other; ④the complex ecological balance problems among hackers, honkers and users "lion, herders and sheep" like three party system, in which, hunting, competition and mutual benefit coexistence, at the same time.
  • References | Supplementary Material | Related Articles