Loading...

Table of Content

    23 July 2015, Volume 0 Issue 7
    An Algorithm for Linking Spam Combat on Online Social Networks
    SHEN Hua1,2
    2015, 0(7):  1.  doi:10.3969/j.issn.1006-2475.2015.07.001
    Asbtract ( 224 )  
    References | Related Articles | Metrics
    Linking spam on social networks is a process of constructing links among unrelated users to gain the influence. With the extensive application of social networks, linking spam would seriously threaten the information security of social networks. To tackle this problem, this paper proposes four types of users’ features and estimates relationship strength with a graphical model. Further more, propagating algorithm based on both trust and distrust with relationship strength is proposed to combat linking spam on social networks. Experimental results show that the proposed scheme can demote spammers and penalize users that link to spammers effectively.
    A Nonparametric Fast Algorithm for Abrupt Changes Detection Based on AUC
    WU Xuelong, XU Weichao
    2015, 0(7):  5.  doi:10.3969/j.issn.1006-2475.2015.07.002
    Asbtract ( 261 )  
    References | Related Articles | Metrics
    Recently, the technologies for detecting abrupt changes have been prevalent in many fields. However, as the conventional strategy, parametric method has some inherent limitations when it is used in real production environment. In order to solve these problems, we propose a novel nonparametric method for abrupt changes detection, which solves the problem by AUC (Area under the Curve). We divided the process into two phases: during the preanalysis period, we set two continuous scanning windows and then calculate the AUC values of the samples in difficult scanning windows in order to obtain the means and variances; during the detection period, we detect the changes by hypothesis testing. In simulation experiments, the method we proposed outperforms CUSUM in terms of robustness and multiple changes detection.
    User Similarity Calculation Based on Location for Social Network Services
    WEI Jing
    2015, 0(7):  9.  doi:10.3969/j.issn.1006-2475.2015.07.003
    Asbtract ( 234 )  
    References | Related Articles | Metrics
    In order to further improve user similarity calculation based on social network service, this paper proposes a new effective method to calculate the user similarity using the semantics of the location. The method can obtain the users intentions and interests accurately, and calculates the user similarity according to different level position category. Experimental results verify that this method is superior to the traditional user similarity method.
    Course Timetabling Optimization Problem Based on Integer Programming Model
    XIE Zonglin1, LIU Yajun1, HUO Weijing2, WANG Jinhuan1
    2015, 0(7):  15.  doi:10.3969/j.issn.1006-2475.2015.07.004
    Asbtract ( 246 )  
    References | Related Articles | Metrics
    In this paper, by establishing the multipleobjective 01 integer programming model which keeps the original curriculum time constant, we propose a method for solving university course timetabling problem. This method aims to find the shortest path for class and keep the utilization of classroom resource balanced. In the model, we see the first target as a constraint condition, using the idea “when a class’s two courses are arranged in a row, then the two courses are arranged in the same classroom”, while we see the second target as the objective function. Eventually the constrained optimization problem is solved by the filter algorithm. The simulation results on small amount of data are also given to show the efficiency of the proposed method.
    A Food Recommendation Algorithm with Context
    ZHAO Xuemei1, GUO Linfeng2, BIAN Xuewen1
    2015, 0(7):  20.  doi:10.3969/j.issn.1006-2475.2015.07.005
    Asbtract ( 165 )  
    References | Related Articles | Metrics
    As the traditional collaborative filtering recommendation algorithm didn’t consider the situation that context information affected the users’ behavior seriously, a
    recommendation algorithm with context was put forward and the algorithm was applied to food recommendation. First of all, the context was added to the traditional useritem
    model expressed as an attributes vector, resulting in a UIC interest model. Then SubUsers were created according to different context from one user, thus obtaining a
    new useritem ratings matrix in a certain context. Because the data sparseness problem was easy to generate in this approach, WSlopeOne algorithm was designed to predict
    unknown ratings. Based on optimized similarity formula, more effective recommendation service would be provided that can more accurately find the current users neighbor,
    providing users with good service. Last, experiments were done to verify the contents this paper proposed and expectation for further research was brought forward.
    Collaborative Filtering Recommendation Algorithm #br# Based on Multifactor Expert Group Scoring
    LAI Jinhui
    2015, 0(7):  25.  doi:10.3969/j.issn.1006-2475.2015.07.006
    Asbtract ( 206 )  
    References | Related Articles | Metrics
    In view of the limitations of traditional collaborative filtering recommendation algorithm, this paper puts forward a new collaborative filtering recommendation
    algorithm. Firstly, the paper uses the global professional index and local active index to define the requirement of experts; secondly, selects appropriate proportions users to
    constitute experts group, and then assigns weights for each expert according to the expert’s judgment and dissimilarities between experts and target users, finally, defines the
    predictive scores. Meanwhile, members of the group are dynamic, experts have different weights, so the recommended results are closer to the target user. Because the information
    utilization is high, it can get a clear result. The experimental results on open dataset named GroupLens and Netflix show that, the algorithm in prediction success rates is
    superior to the traditional method.
    An Improvement of Sentence Similarity Calculation Based on Multifeatures
    WANG Quanmin, CAO Jianqi, WANG Li
    2015, 0(7):  31.  doi:10.3969/j.issn.1006-2475.2015.07.007
    Asbtract ( 183 )  
    References | Related Articles | Metrics
    Sentence similarity calculation is a key issue in the field of natural language processing. There are many methods to calculate sentence similarity. We research the
    problem of low calculation results of sentence similarity calculation model based on multifeatures. On the basis of word semantic similarity, the paper adds similar word
    calculation method, at the same time, adds the similarity calculation method of the sentence constituents’ relationship. The improved method not only avoids the operation of
    the additional synonyms dictionary, but also fully considers the words in the sentence, sentence length, word order, semantic, the relationship of sentence constituents. The
    method improves the sentence similarity calculation results. Experimental results show that the method can improve the results of sentence similarity calculation and the method
    is reasonable, simple and feasible.
    A Scalable Encryption Routing Protocol for Privacy Preserving on Sensor Networks
    LI Peiyu, ZHANG Zhixue
    2015, 0(7):  34.  doi:10.3969/j.issn.1006-2475.2015.07.008
    Asbtract ( 162 )  
    References | Related Articles | Metrics
    In order to solve the problem of low data delivery rate and poor network stability in traditional data privacy protection mechanisms which is against external and
    internal network attacks and data stealing on wireless sensor networks, this paper proposes a dynamic data aggregation and encryption routing protocol for privacy preserving on
    wireless sensor networks. The data privacy preserving is achieved by using the method of data aggregation and hierarchically encryption algorithm. The simulation results show
    that the proposed routing protocol has high data deliver rate, high network security, strong stability and extensibility in aspect of solving data privacy attacks. It enhanced
    the ability to against typical data privacy attack greatly.
    RST Invariant Color Image Watermarking Algorithm #br# Based on Quaternion Zernike Moments
    ZHONG Minjie
    2015, 0(7):  40.  doi:10.3969/j.issn.1006-2475.2015.07.009
    Asbtract ( 177 )  
    References | Related Articles | Metrics
    In this paper, we propose a RST(Rotation, Scaling, Translation) invariant color image watermarking based on Quaternion Zernike Moments(QZM). Since the normalized
    modulus of QZM has rotation, scale and translation invariance, this paper embeds watermarking information in the QZM’s modulus by using the method of dither modulation. This
    algorithm can diffuse the error caused by watermark embedding to three component images(red, green, blue). The experiments show that it has good imperceptibility and robust to
    geometric attacks, such as rotation, scale and translation.
    A Freeform Surface Stereo Matching Method Based on Improved Census Transform
    HUA Chunjian1,2, FANG Chengjun1,2, CHEN Ying3
    2015, 0(7):  44.  doi:10.3969/j.issn.1006-2475.2015.07.010
    Asbtract ( 162 )  
    References | Related Articles | Metrics
    The feature points obtained from freeform surface 3D reconstruction method which based on grid projection all distribute along the projected grid lines only, and
    there is none feature point on the surface among the projected grid lines, which lead to the low accuracy reconstruction. An improved Census transform stereo matching method
    based on adaptive window is presented to reconstruct the surface among the projected grid lines. The method incorporates featurebased method and regionbased method. The grid
    lines projected on the experimental subject surface are utilized to guide Census transform, the Hamming distance computed by dynamic disparity is used as the matching cost, and
    the higher accuracy matching points are obtained after filtering. The proposed method is applied on the binary vision 3D reconstruction to validate the improved reconstruction
    accuracy of surface among the projected grid lines.
    An Improved Algorithm for Moving Object Detection Based on ViBe
    WU Jianwu, WENG Lingyu, TONG Huai
    2015, 0(7):  50.  doi:10.3969/j.issn.1006-2475.2015.07.011
    Asbtract ( 201 )  
    References | Related Articles | Metrics
    To solve the problem that traditional ViBe algorithm can not effectively remove the influence of background noise and ghost, an improved algorithm based on ViBe and
    framedifference algorithm was proposed. Firstly, the framedifference algorithm was used to extract the contour of the moving object. Secondly, the contour was used to get
    the general area of the moving object. Lastly, the object could be perfectly segmented from region after updating background using ViBe algorithm on classification based on the
    general area. Experiments show that, this algorithm can suppress the influence of noises and ghost effectively, and its processing speed is better than the traditional ViBe
    algorithm.
    Fast Moving Object Detection Based on TMS320DM8168
    XIE Hongsong, DONG Yunfei, LUO Bing, TANG Jin
    2015, 0(7):  55.  doi:10.3969/j.issn.1006-2475.2015.07.012
    Asbtract ( 182 )  
    References | Related Articles | Metrics
    This paper investigates how to perform fast and robust moving object detection in high definition videos on the embedded platform. In this paper, we adopt the
    TMS320DM8168 as implementation platform, which is the latest TI Davinci architecture, and perform fast moving object detection on 1080P videos. Specifically, the ViBe algorithm,
    robustness to noises, is utilized to detect the moving objects in this work, and further transplanted into the MCFW framework. Moreover, several optimization procedures are
    developed to improve the performance and efficiency of our algorithm, including compiler options, memory, standard inline function, loop and DMA. Thus, we achieve realtime
    moving object detection in high definition videos on the embedded platform. The experiments on several videos demonstrate the effectiveness of the proposed algorithms.
    Calibration Method for Nonsingle Viewpoint Omnidirectional Cameras #br# Based on Planar Quadratic Curve
    HAN Xiao1, LIAO Yuefeng2
    2015, 0(7):  59.  doi:10.3969/j.issn.1006-2475.2015.07.013
    Asbtract ( 195 )  
    References | Related Articles | Metrics
    Calibration of the omnidirectional system is under the environment of single viewpoint calibration, but due to the constraint condition of single viewpoint is harsh,
    the system is difficult to be accurately calibrated, so the research on the omnidirectional camera calibration problem under the nonsingle viewpoint has great value. This
    paper presents a calibration method of reflector’s position and attitude for nonsingle viewpoint catadioptric omnidirectional camera based on planar quadratic curve. The
    calibration process doesn’t need nonlinear iteration, can directly obtain the analytical solution of the reflector’s position and attitude parameters. Finally the paper gives
    experiments with calibration, the panoramic perspective and cylindrical image to verify the calibration results, which show that the proposed calibration method is accurate and
    effective, and the calculation is simple, it’s easy to implement.
    Research and Realization on Polygon Triangulation and Triangle Subdivision
    WEI Hongchun
    2015, 0(7):  65.  doi:10.3969/j.issn.1006-2475.2015.07.014
    Asbtract ( 139 )  
    References | Related Articles | Metrics
    Polygons are basic elements for the surfaces of 3D model. Polygon triangulation and triangle subdivision are basic technology for rapid 3D modeling and texture mapping
    in computer. Based on polygon triangulation and triangle subdivision, this paper utilizes objectoriented technology and recursive programming methods, studies and implements
    the algorithm of polygon triangulation and triangle subdivision, analyzes the execution efficiency of this algorithm. Experiments show that the algorithm has high computational
    efficiency and practical value, and has a good reference to the practical application.
    Research and Application of Grid File Parsing in VC Environment
    ZHENG Chaoliang, YANG Yuwang
    2015, 0(7):  69.  doi:10.3969/j.issn.1006-2475.2015.07.015
    Asbtract ( 173 )  
    References | Related Articles | Metrics
    Software developers need to display the physical model of mesh files with OpenGL or other graphics processing software. To make this happen, it’s required to import
    the structure of the mesh files for analysis, so as for later processing. Based on the VC platform, we perform a code analysis of the mesh file, and finally display it with
    OpenGL, so as to develop the analog computer display program for mesh files.
    Image Classification Method Based on Distribution Structure Constrain Sparse Representation
    FAN Yindi
    2015, 0(7):  73.  doi:10.3969/j.issn.1006-2475.2015.07.016
    Asbtract ( 168 )  
    References | Related Articles | Metrics
    To solve the structure information loss issue on sparse representation for accurate image classification, a new method based on structure constrain sparse
    representation was proposed. The training samples after downsampling and extracting histogram of orientated gradient (Hog) were utilized to construct sparse linear coding model.
    The sparse coefficients were solved on the training samples by distribution structure information constrain and 1minimization, and image was classified by sparse coefficient
    mean.  Experimental results with COREL dataset demonstrated that the proposed method can obtain the good recognition performance. Comparing with nonstructure constrain sparse
    representation, the proposed method greatly improves the accuracy of image classification.
    Routing Algorithm for Quality of Service Based on Improved #br# Ant Colony Optimization Algorithm
    MA Shihuan, LI Wei
    2015, 0(7):  77.  doi:10.3969/j.issn.1006-2475.2015.07.017
    Asbtract ( 186 )  
    References | Related Articles | Metrics
    The traditional wireless network routing algorithms have high packet loss rate and serious node congestion problems, so this paper proposes a routing algorithm for
    quality of service based on improved ant colony optimization algorithm. Firstly, according to the wireless network characteristics, the bandwidth, endtoend delay, packet
    loss rate and the link cost are chosen as the QoS parameters, and a mathematical model for network routing optimization problem with multiconstraint quality of service is 
    established, and then the ant colony optimization algorithm which has positive feedback mechanism and the search ability is used to solve the mathematical model, and the
    standard ant colony optimization algorithm is improved to promote search performance according to the routing characteristics of wireless network, finally the performance of the
    routing algorithm is tested by simulation experiment. The experimental results show that, the improved ant colony optimization algorithm can satisfy the quality requirements for
    wireless network, not only reduces the average network delay and the network data packet loss rate, and performance is better than other routing algorithms.
    Localization for Wireless Sensor Network Based on Modified Particle #br# Swarm Optimization Algorithm
    PEI Xiang, LI Qiaojun
    2015, 0(7):  81.  doi:10.3969/j.issn.1006-2475.2015.07.018
    Asbtract ( 130 )  
    References | Related Articles | Metrics
    The third stage in classical DVHop location algorithm has big localization error, so this paper puts forward a localization method for wireless sensor network based
    on modified particle swarm optimization algorithm. Firstly, the defects of DVHop algorithm is analyzed, and the unknown nodes positioning problem is converted into the
    optimization problem, and then the modified particle swarm optimization algorithm is used to optimize the problem, and the shrinkage factor is introduced to accelerate the
    search speed and precision, and find out the global optimal position of unknown nodes, finally the simulation experiment is carried out on Matlab 2012 platform. The simulation
    results show that the proposed algorithm improves the positioning accuracy of sensor nodes, and greatly reduces the positioning error.
    #br# Research on WiFi Technology for Medicaluse InternetofThings
    WEN Haojie, DING Jingjie
    2015, 0(7):  85.  doi:10.3969/j.issn.1006-2475.2015.07.019
    Asbtract ( 164 )  
    References | Related Articles | Metrics
    Aiming at the application of WiFi technology in hospital in IOT, this article outlines the research background and the research status at home and abroad, after that
    it introduces the relevant knowledge and theory of the Internet of Things and WiFi technology. IOT sensing terminal was designed based on WiFi technology and WiFi technology
    into a small volume and lowcost embedded systems was introduced in the form of "ARM+WiFi SoC". The driver for WiFi chip on the physical layer and transplanted embedded TCP/IP
    protocol stack on the network layer and the transport layer was developed, after that the upper layer application was also developed which could send acquisited data by Socket.
    The system reaches the primary goal by testing.
    A Novel Clustering Routing Protocol Algorithm for Wireless Sensor #br# Network Based on Energy Balance
    ZHANG Yanan, MA Shihuan
    2015, 0(7):  90.  doi:10.3969/j.issn.1006-2475.2015.07.020
    Asbtract ( 130 )  
    References | Related Articles | Metrics
    In order to prolong life time of wireless sensor network, a novel routing protocol of wireless sensor network based on energy balance is proposed. Firstly, the
    synergic curve number of cluster heads will be found under the principle of the minimum potential energy, and then are divided into clusters by district, and the optimized
    cluster will be selected according to the node residual energy and the communication cost, and replace the cluster dynamically, finally, the simulation experiment is carried out
    to test the performance. The simulation shows that compared with LEACH protocol, the proposed protocol can reduce energy and improve the network node survival rate
    significantly.
    Design and Implementation of UAV Ground Station Software Based on Qt
    JIA Jie, LIU Zhiteng
    2015, 0(7):  94.  doi:10.3969/j.issn.1006-2475.2015.07.021
    Asbtract ( 276 )  
    References | Related Articles | Metrics
    This paper introduces the architecture and the main function of the control system for small UAV ground station, emphatically discusses the use of thirdparty serial
    communication classes, Qwt virtual instrument, Google offline maps, SQLite database based on Qt to realize the control software of UAV ground station communication link, flight
    data display, electronic maps, flight data storage, and other functions. The experimental results show that the system can achieve the basic functions.
    Design and Implementation of Patent Subsidy Service Platform System
    QIU Feng1,2, LIU Boping1,2, HU Min1,2
    2015, 0(7):  98.  doi:10.3969/j.issn.1006-2475.2015.07.022
    Asbtract ( 192 )  
    References | Related Articles | Metrics
    By analyzing the patent subsidy work, the paper designs and develops a service system which implements patent subsidy online. By adopting Loushang framework technology, the audit business flow can be defined and developed quickly, and the process of system development is simplified.
    A Dynamic Memory Management Method Based on μC/OS
    SHEN Feiyi, ZHANG Yanyuan, LIN Yi
    2015, 0(7):  103.  doi:10.3969/j.issn.1006-2475.2015.07.023
    Asbtract ( 213 )  
    References | Related Articles | Metrics
    Memory management is important in realtime system. This paper develops a new dynamic memory management algorithm based on Buddy system and TLSF algorithm on consideration of both realtime and fragmentation rate. The new algorithm deals with large and small pieces of memory in different ways. Buddy system is used to manage small pieces while large ones are organized by twolevel segregating indices. This paper performs experimental study on μCosIII OS by implementing the new method and which shows good performance in both timeconsuming and fragmentation rate. At present  the method has been applied to an actual project.
    Study on Knowledge Management Platform for Structural Design of Projectiles and Rockets
    GUO Yonghui1, TIAN Jiandong1, JI Baofeng1, ZHANG Xuefeng1, WAN Neng2
    2015, 0(7):  108.  doi:10.3969/j.issn.1006-2475.2015.07.024
    Asbtract ( 162 )  
    References | Related Articles | Metrics
    Knowledge management platform for structural design of projectiles and rockets was studied and developed aiming at present condition of structural design of China Academy of Launch Vehicle Technology (CALT). Three key technologies of platform were introduced, such as mining technology of explicit knowledge, mining technology of implicit knowledge, and retrieval technology of design knowledge. System architecture of platform was put forward. And functional model of platform was expatiated. The effect of platform in CALT is remarkable. It shows that the platform is feasible and reconfigurable.
    Design and Implementation of Urban Wisdom Drainage System
    SHI Yanlong1, XU Daqin2
    2015, 0(7):  112.  doi:10.3969/j.issn.1006-2475.2015.07.025
    Asbtract ( 217 )  
    References | Related Articles | Metrics
    The urban wisdom drainage system using dynamic simulation and analysis techniques based on realtime data monitoring, is aimed to achieve the safe operation of urban drainage pipe network and sewage intelligence coordination and scheduling. The paper puts forward the concept of urban wisdom drainage system, and designs the hierarchy structure, the overall frame and the control flow of the urban wisdom drainage system and so on. Experiments show that the system effectively utilizes the drainage capacity of the existing pipeline network, saves the cost and controls the energy consumption.
    A Disaster Event Information Extraction Method Based on Preposition’s Usages
    JIA Suimin, ZHANG Yu, ZHANG Tengfei
    2015, 0(7):  116.  doi:10.3969/j.issn.1006-2475.2015.07.026
    Asbtract ( 208 )  
    References | Related Articles | Metrics
    To improve the efficiency of the event information extraction, through the recognition of preposition’s usages in text, an approach based on preposition’s usages and Conditional Random Fields(CRFs) is proposed for event information extracting, and the paper completes the coding of extraction system, in order to achieve the better extraction result. “People’s Daily” is used as experiment corpus, the approach achieves a better performance, the precision rate reaches 90.33%, increases 9.14% than the method without preposition’s usage.
    Design and Realization of Irrigation and Fertilization Controlling System Based on PLC
    MENG Shasha
    2015, 0(7):  120.  doi:10.3969/j.issn.1006-2475.2015.07.027
    Asbtract ( 228 )  
    References | Related Articles | Metrics
    For the problem that wasting water and liquid fertilizer uneven in traditional farmland irrigation and fertilization, the paper proposes an irrigation and fertilization controlling system based on PLC using Omron SYSMAC C and monitoring software King View 6.55. At the same time, with the sensors to collect data it controls irrigation and fertilization on demand. The system realizes automatic irrigation and fertilization, and monitoring management, which can save human resources and have strong practicality.
    PID Controller of Permanent Magnet Synchronous Motor Based #br# on Improved Particle Swarm Optimization Algorithm
    LU Jian1, ZHANG Ke2
    2015, 0(7):  123.  doi:10.3969/j.issn.1006-2475.2015.07.028
    Asbtract ( 215 )  
    References | Related Articles | Metrics
    In order to improve the control precision of the permanent magnet synchronous motor system, this paper puts forward a permanent magnet synchronous motor PID controller based on improved particle swarm optimization algorithm. Firstly, the mathematical model of permanent magnet synchronous motor is established, and then the improved particle swarm optimization algorithm is used to optimize the parameters of PID controller and to realize the online identification of permanent magnet synchronous motor parameters, finally the simulation experiment is used to test its performance. The simulation results show that compared with the traditional PID controller, the proposed PID controller can improve the system response performance, and can obtain a good stability, robustness and dynamic performance for the permanent magnet synchronous motor.