Loading...

Table of Content

    30 September 2017, Volume 35 Issue 5
    Selected Papers Presented at 2016 Congress of Computer Applications, China
    Detection of Smoothing Region Tampering Based on Feature Enhancement
    ZHANG Wei-wei, YANG Zheng-hong, HAN Hong-li, WANG Jun-bin, NIU Shao-zhang
    2017, 35(5):  537-544.  doi:10.3969/j.issn.0255-8297.2017.05.001
    Asbtract ( 849 )   PDF (7697KB) ( 308 )  
    References | Related Articles | Metrics

    An algorithm for forgery detection based on outline feature enhancement is proposed to remove tampered areas in an image. The image to be detected is frst divided into blocks of sliding-windows. Binary outline features are extracted from every block. The extracted outline sequences are ranked in an alphabetic order. By matching the outline sequences, tampered regions are identifed. Experiment results show that the proposed algorithm can effectively detect tampering traces in smooth image regions, even from images after JPEG compression with low quality factors.

    Belief Rule Base Inference for Texture Image Classifcation
    FANG Zhi-jian, FU Yang-geng, CHEN Jian-hua
    2017, 35(5):  545-558.  doi:10.3969/j.issn.0255-8297.2017.05.002
    Asbtract ( 1052 )   PDF (2677KB) ( 310 )  
    References | Related Articles | Metrics

    To improve precision of traditional texture image classify algorithm, a new texture image classifcation method based on belief rule-base inference methodology using evidential reasoning approach(RIMER) is proposed. Researches on texture image classifcation generally consider improving texture feature extraction, and the design of classifer that is crucial to classifcation precision is largely ignored. In this paper, a rule-base inference method using an evidential reasoning approach is proposed. The classifer is redesigned based on the current methods of texture feature extraction. Algorithms of angular-radialtransform and gray-level con-occurrence matrix are used to extract texture image feature. Principle component analysis is carried out to solve the problem that the size of a belief rule base(BRB) classifer is controlled within a feasible range. The approach of rule-base inference method with evidential reasoning transforms the texture features into classifed belief degree information. Practicability and effectiveness of the proposed approach is validated in a case study.

    Data Stream Classifcation with Data Uncertainty and Concept Drift
    LÜ Yan-xia, WANG Cui-rong, WANG Cong, YUAN Ying
    2017, 35(5):  559-569.  doi:10.3969/j.issn.0255-8297.2017.05.003
    Asbtract ( 671 )   PDF (5175KB) ( 602 )  
    References | Related Articles | Metrics

    Data in the Web have much uncertainty because of privacy protection, data loss, network errors, etc. In a data stream system, data arrive continuously and therefore one cannot obtain all data in any time. In addition, the concept drift often occurs in the data stream. This paper constructs an incremental classifcation model to deal with data stream classifcation with data uncertainty and concept drift. In this model, a fast decision tree algorithm is used. It can analyze uncertain information quickly and effectively both in the learning stage and the classifcation stage. In the learning stage, it uses the Hoeffding bound theory to quickly construct a decision tree model for the data stream with data uncertainty. In the classifcation stage, it uses a weighted Bayes classifer in the tree leaves to improve precision of the classifcation. The use of a sliding window to replace the tree ensures that the algorithm can deal with concept drift. Experimental results show that the algorithm has good classifcation accuracy and execution efciency both on artifcial and real data.

    QoS Dynamic Web Services Composition Method Based on Improved Simulated Annealing Algorithm
    ZHANG Kang, GAO Hong-hao, ZHU Yong-hua, XU Hua-hu
    2017, 35(5):  570-584.  doi:10.3969/j.issn.0255-8297.2017.05.004
    Asbtract ( 1073 )   PDF (4208KB) ( 321 )  
    References | Related Articles | Metrics

    This paper proposes a QoS dynamic services composition based on an improved simulated annealing algorithm. First, classifcation services builds a set of candidate services from the service repository according to user's functional requirements. Optimal composite services are computed using an improved simulated annealing (ISA) algorithm, and then recommended to the user. When the quality of composite service is close to a critical value of QoS, a local greedy algorithm and global ISA algorithm are used to re-implement service composition. Feasibility and effectiveness of the proposed method is shown by a case study.

    Trustworthiness Recommendation for O2O Service Providers Based on Their Reputation
    ZHU Wen-qiang, ZHONG Yuan-sheng
    2017, 35(5):  585-601.  doi:10.3969/j.issn.0255-8297.2017.05.005
    Asbtract ( 844 )   PDF (6084KB) ( 294 )  
    References | Related Articles | Metrics

    As online to ofine (O2O) e-commerce develops quickly in recent years, many problems have occurred. Some service providers are poor, while some providers are dishonest. It is difcult for users to choose an honest O2O service provider who can provide suitable service. To solve the problem, we propose a method for trustworthiness recommendation of suitable O2O service providers to users based on the providers' reputation and users' similarity. A user-service rating matrix is used to compute the users' comprehensive ratings on O2O service providers, and a comprehensive user-service provider rating matrix generated. The recommendation method combines the matrix with reputations of the O2O service providers to compute similarities of different users. Suitable O2O service providers are then recommended to users. Simulation and experimental results demonstrate that the proposed method has better recommendation accuracy as compared to other traditional methods, as well as some state-of-the-art methods. It performs well in resisting malicious attacks.

    Community Tracking Algorithm Based on Active Points
    YANG Shao-wen, YAN Guang-hui, LI Lei, ZHANG Hai-tao
    2017, 35(5):  602-611.  doi:10.3969/j.issn.0255-8297.2017.05.006
    Asbtract ( 1038 )   PDF (3176KB) ( 394 )  
    References | Related Articles | Metrics

    The research of complex networks is mainly aimed at the complex systems, and it is a general method for dealing with various problems in complex systems. In general, complex network community tracking neglects evolutionary time domain factors and differences in the evolution of network members. This paper proposes a community tracking method that includes time domain information in the similarity function, and extracts active nodes in the network by taking into account smoothness of network evolution and differences between nodes. Experiments show that the proposed algorithm fnds the community evolution process better than those based on DBLP data sets. It can also discover community similarity effectively.

    Effects of Community Opening on Road Trafc Based on Matter-Element Model
    XIAO Tong, WANG Zhuo, WANG Meng, YAN Shao-hong
    2017, 35(5):  612-625.  doi:10.3969/j.issn.0255-8297.2017.05.007
    Asbtract ( 1055 )   PDF (18433KB) ( 209 )  
    References | Related Articles | Metrics

    Influence of community opening on road passage is concerned in a modern society. A vehicle capacity model was founded based on the matter-element theory in this paper. Two typical cells, R&F City and Haisheng Mingyuan, were chosen as representatives. For different cells, three programs for opening them were designed in a progressive form. Level variables of R&F City and Haisheng Mingyuan were 2.2 and 1.3. Combined with the matter-element model, it can be seen that the influence of community opening on surrounding roads is positive. The closed interval was extended to a real axis through the correlation function in the model. This model can be applied to the felds of environmental quality, industry, agriculture, etc.

    Low Overhead Broadcast Encryption with Personalized Message Based on Multilinear Maps
    LÜ Li-qun, YANG Xiao-yuan, WANG Jing-jing, CHENG Lu
    2017, 35(5):  626-633.  doi:10.3969/j.issn.0255-8297.2017.05.008
    Asbtract ( 732 )   PDF (915KB) ( 431 )  
    References | Related Articles | Metrics

    Current schemes of broadcast encryption with personalized message (BEPM) require exceedingly large parameters. To deal with the problem, a low-overhead BEPM scheme is constructed by comprehensively using broadcast encryption, key encapsulation, and characteristics of multilinear maps. The ciphertext and private key size of each user are constant, and the public key size is only in the order of O(lb N). The proposed scheme is also fully collusion resistant and can achieve chosen plaintext completely in the standard model. The scheme is safe and effective, and widely applicable in many felds such as pay TV.

    Analysis of News Topic Evolution Based on DTS-ILDA Model and Association Filtering
    GUO Xiao-li, ZHOU Zi-lan, LIU Yao-wei, DU Jian-hong, HUANG Yan
    2017, 35(5):  634-646.  doi:10.3969/j.issn.0255-8297.2017.05.009
    Asbtract ( 687 )   PDF (4914KB) ( 474 )  
    References | Related Articles | Metrics

    In topic evolution and tracking, as the size of time slices and the K value of the topic model are fxed, it is hard to locate important time turning points, which is prone to error topic correlation in the evolutionary analysis. To solve the problem, we propose an improved dynamic temporal segmentation-infnite latent Dirichlet allocation (DTS-ILDA) model and an associated fltering mechanism. The model combines an improved dynamic time segmentation algorithm with an infnite latent Dirichlet allocation (ILDA) model to extract topics. Dynamic time segmentation algorithm traverses the data set according to the time sequence, and then uses a contingency table to analysis the distribution of topics to measure the segmentation results and an ILDA model to extract K topics. In addition, an association fltering mechanism is proposed for error prone association in the evolutionary analysis. It removes weak association relationship. Finally, fve evolutionary relationships of right subtopic association are established according to the time sequence relationship. Experiments show that the presented method can effectively fnd important time points when the main content of the topic changes, preventing generation of meaningless topics. It can also reduce error-topic related interference, extracting exact deep relationship between the topics.

    Signal and Information Processing
    Estimation of Provincial Economic Development Levels Based on DMSP/OLS Nighttime Light Images
    MA Dan, CHENG Hui, MAO Yan-ling, XING Shi-he
    2017, 35(5):  647-657.  doi:10.3969/j.issn.0255-8297.2017.05.010
    Asbtract ( 1001 )   PDF (13156KB) ( 756 )  
    References | Related Articles | Metrics

    This paper produces nighttime light intensity maps across 31 provinces and municipalities in mainland China using the DMSP/OLS nighttime lights data in 2001, 2004 and 2007. Brightness ratio and area ratio are introduced to construct a nighttime light index and a statistics index with ratio analysis and principal component analysis. The indices in 2001 and 2004 are used as training samples and the ones in 2007 as test data to establish a linear regression model at the provincial level. The coefcient of determination is 0.872. Spatio-temporal distribution of provincial socioeconomic development levels in China is analyzed based on the nighttime light index. The results indicate that, by introducing brightness and area ratios, using nighttime light indices to estimate regional socioeconomic development levels is feasible and effective.

    Synthesis of Requirements in Applications of Multi-spectral Remote Sensing
    WU Zhao-cong, LIU Pei, WU Yuan
    2017, 35(5):  658-666.  doi:10.3969/j.issn.0255-8297.2017.05.011
    Asbtract ( 897 )   PDF (7405KB) ( 423 )  
    References | Related Articles | Metrics

    Great differences in requirement descriptions exist in remote sensing applications, and various requirements may be correlated. This causes inconvenience for the subsequent sensor design, We propose a method to solve the problem for multi-spectral remote sensing application requirements. We frst express the original requirements of the associated departments in a structural manner based on the domain ontology modeling, and establish a database to ensure data sharing. We then establish a spatial resolution- temporal resolution decision tree to classify and eliminate correlation, and evaluate the results. We show that good synthesized requirements can be obtained, and used for subsequent sensor design for earth-oriented observation remote sensing, and it can be evaluated directly.

    Control and System
    PID Parameter Optimization Based on Improved Particle Swarm Optimization Algorithm
    JIANG Chang-hong, ZHANG Yong-heng, WANG Sheng-hui
    2017, 35(5):  667-674.  doi:10.3969/j.issn.0255-8297.2017.05.012
    Asbtract ( 884 )   PDF (5309KB) ( 562 )  
    References | Related Articles | Metrics

    PID parameter optimization is a hot topic in control engineering. An improved particle swarm optimization (PSO) algorithm is proposed to optimize PID parameters. PID parameters are selected and the system performance is improved. The factors of evolution speed and aggregation degree of the swarm are introduced to the algorithm to improve the weight to improve the velocity update formula. A flying time factor is then introduced to improve the location update formula. Advantage of the algorithm is shown by three typical functions, indicating improvement of convergence speed and search efciency. A typical second order controlled model is selected as an object for research, and results of the algorithm are compared with other PSO algorithms. Experiments show that the optimized PID parameters obtained by using the improved PSO algorithm can achieve good control performance.