Table of Content

18 August 2016, Volume 0 Issue 8

Previous Issue    Next Issue

Resource-constrained Multi-project Scheduling Problem Based on Improved Genetic Algorithm

BAI Li-biao1,2, LIU Jin-tao3, CHEN Zhi4

2016, 0(8):  1-6.  doi:10.3969/j.issn.1006-2475.2016.08.001

Asbtract ( 236 )  

References | Related Articles | Metrics

With the expansion of construction project enterprise's scale, multi-project management has become one of the important problems in the development of enterprises, which plays a very important role in achieving organization’s sustainable development. In this paper, the resource-constrained multi-project scheduling problem is analyzed on the basis of resource-constrained project scheduling problem firstly, then the framework and mathematical model for resource-constrained multi-project scheduling problem are proposed, and an improved genetic algorithm focusing on probability of crossover and mutation is designed, and the effectiveness and feasibility of the proposed genetic algorithm is validated by a case study, which provides a new way for the modern enterprise to make decisions for the resource-constrained multi-project scheduling problem.

Multiple Task Assignment for Cooperating Unmanned Aerial Vehicles Using Multi-objective Particle Swarm Optimization

YIN Gao-yang1, ZHOU Shao-lei1, MO Jun-chao2, CAO Ming-chuan3, KANG Yu-hang1

2016, 0(8):  7-11.  doi:10.3969/j.issn.1006-2475.2016.08.002

Asbtract ( 302 )  

References | Related Articles | Metrics

The problem of assigning multiple tasks on multiple targets for a group of cooperating unmanned aerial vehicles (UAVs) is discribed as a multi-objective optimization problem. An approach in which Pareto dominance is incorporated into discrete particle swarm optimization (DPSO) in order to allow this heuristic to handle the problem is proposed. The structure of particle’s position vector space in the algorithm enforces the required task precedence and coordination a new update strategy for the position and speed of particle is applied. Simulation results demonstrate the effectiveness and feasibility of the proposed model and approach.,

An Optimization Algorithm of Placement for Chinese Billiards

WANG Yong-xin1, WANG Qiu-fen2

2016, 0(8):  12-15+21.  doi:10.3969/j.issn.1006-2475.2016.08.003

Asbtract ( 219 )  

References | Related Articles | Metrics

It exists a lot of problems to place balls using artificial method in billiards sports, such as time-consuming, labor-intensive, placed unreasonable, increasing the cost of service and so on. The paper puts forward an optimization algorithm of placement for Chinese billiards. The algorithm defines inside triangle and outside triangle. The locations of the sub-balls are numbered. It constructs a mathematical model, gives a formal description, uses binary tree structure to organize all the possible layout schemes, and searches reasonable schemes by backtracking. All of these schemes meet any of the three or more non-adjacent panchromatic ball or fancy ball, they provide an effective way for the further design and development of automatic billiards machine.

Pre-seismic Anomalies Detection with Frequent Itemsets from Remote Sensing Satellite Data

LI Wen, XU Hui

2016, 0(8):  16-21.  doi:10.3969/j.issn.1006-2475.2016.08.004

Asbtract ( 197 )  

References | Related Articles | Metrics

Existing researches showed that seismic activity area remote sensing data was anomalous before an earthquake. In this paper, we proposed a method of data mining that could analyze the hyper-spectrum data from AIRS (atmospheric infrared detector) from January 2006 to December 2013. The main idea of this method was that we mined frequent itemsets of pre-seismic data and regarded them as pre-seismic anomalies, then we used the model to predict earthquakes. At the same time, we carried out reverse experiments using non-seismic data to verify this method. Main experimental results revealed that the AIRS data can be used to predict earthquakes. Among all experiments, the best prediction effect comes out when we set precursor time as 30 days and precursor region as square with center being epicenter and side length being 2°. The prediction accuracy is 81.8% and false positive is 5.6%.

Optimization of Slope One Algorithm Based on Clustering and Project Similarity

JIANG Zong-li, DU Qian

2016, 0(8):  22-26.  doi:10.3969/j.issn.1006-2475.2016.08.005

Asbtract ( 157 )  

References | Related Articles | Metrics

With the growth of number of users, the user item matrix becomes more and more sparse. K-means algorithm based on minimum spanning tree of the project is used to cluster the items. The clustered results for the user rating matrix are used to predict filling. Taking into account the user interest change in Slope One algorithm, time weight added to the Slope One algorithm is used to predict rating. Experiments on the Movie Lens dataset show that the improved algorithm effectively solves the sparse and user interest change problem and the MAE value is reduced to less than 0.015.

Sentiment Analysis of Chinese Sentences Based on Word Embedding and Syntax Tree

XIANG Ruo-chen, SUN Mei-feng

2016, 0(8):  27-31.  doi:10.3969/j.issn.1006-2475.2016.08.006

Asbtract ( 248 )  

References | Related Articles | Metrics

With the rapid development of Internet, the network is filled with a lot of subjective texts. How to judge the emotional polarity of these subjective statements is the key of the text sentiment analysis. In this paper, a method of sentiment analysis of Chinese sentences based on the word embedding and syntax tree structure is proposed. In view of the large number of network words, word embeddings are used to compute the semantic similarity between words, and the emotional polarity of the target word is gained. Some sentiment rules are defined for the phenomenon of emotional polarity transfer. Then, we judge the sentiment of sentences according to the syntax tree structure of the sentences. Experiments show that this method can solve the problem of the network words. Simultaneously, the precision and recall rate of the method are improved, and it also can be used widely in different domains.

An Improved Stream Data Outlier Mining Algorithm Based on Reverse k Nearest Neighbors

HU Ni, WANG Yong

2016, 0(8):  32-35.  doi:10.3969/j.issn.1006-2475.2016.08.007

Asbtract ( 180 )  

References | Related Articles | Metrics

The existing stream data outliers mining algorithms based on the reverse k neighbors need to traverse each data object, so the computational complexity is higher and the stability is lower. In order to solve these problems, this paper puts forward an improved outliers detection algorithm based on reverse k nearest neighbors named OL-ORND. Using the idea of cell neighbors, adding the false k reverse neighbors object concept that does not belong to the reverse k neighborhood. So that it can improve the efficiency and accuracy of the algorithm. Through the experiment, we can see that the algorithm has good performance.

Environmental Sound Classification Based on MFCC-SVM and Cross Validation Method

LI Ling-li

2016, 0(8):  36-39.  doi:10.3969/j.issn.1006-2475.2016.08.008

Asbtract ( 221 )  

References | Related Articles | Metrics

In general, recognition methods applied for music and speech data are not appropriate for the environmental sounds. In this paper, we propose a MFCC (Mel frequency cepstrum coefficients)-SVM (support vector machine)-based approach that exploits feature representation and learner optimization to achieve the classification of 10 different environmental sounds signals in the office. Environmental sounds events are obtained by using the IEEE AASP (Audio and Acoustic Signal Processing) Challenge Dataset. The proposed approach considers efficient representation of MFCC features by changing the number of Mel coefficients in analyzing as well as optimizing the SVM parameters. Experiment shows that, when the results of the proposed methods are chosen for MFFC feature and SVM classifier, the tests conducted through using 5-fold cross validation, the average classification accuracy can be up to 88.05%. The classification effect is significantly better than the default MFCC-SVM algorithm.

Testing Technique for Shared Memory Concurrent Programs

LI Jing, WANG Jian-ping

2016, 0(8):  40-45.  doi:10.3969/j.issn.1006-2475.2016.08.009

Asbtract ( 208 )  

References | Related Articles | Metrics

As programming concurrent programs becomes pervasive, testing concurrent programs is also becoming important. This paper focuses on the concurrent programs that are based on shared memory. A new concurrent program testing technique is researched, and a tool called CPTester is designed for concurrent programs. CPTester uses redundancy analysis approach to avoid repeated results. Different from previous work, CPTester can generate the context information for every concurrent bug automatically, which is useful for programmers to understand and fix the concurrent bug. CPTester is evaluated on a number of real concurrent programs. Results show that CPTester can effectively detect the concurrent bugs in concurrent programs. Also, the context information about the root cause of each concurrent bug can be described.

JavaScript Static Slicing Tool

TIAN Sheng

2016, 0(8):  46-51.  doi:10.3969/j.issn.1006-2475.2016.08.010

Asbtract ( 270 )  

References | Related Articles | Metrics

Program slicing is a traditional decomposition technique in program analysis. Program slicing is aimed to get relative codes for some target by removing unrelated codes. Program slicing is widely used in many software engineering activities such as code understanding, software testing, and program debugging. As the development of network technology, JavaScript has been widely used. However, there are few slicing tools for JavaScript. This paper proposes an algorithm for slicing JavaScript programs based on program dependence graphs, which focuses on specific features of JavaScript language. This paper also discusses the implementation of the proposed algorithm by using WALA program analysis framework. The experimental result shows the effectiveness of the proposed algorithm in the sense that the slicing tool can generate slicing codes with 70% size of original code, and also only 19% larger than the slicing generated by hand writing.

Image Edge Detection Algorithm Based on Local Expectation Threshold Segmentation

LIU Zhan

2016, 0(8):  52-55.  doi:10.3969/j.issn.1006-2475.2016.08.011

Asbtract ( 237 )  

References | Related Articles | Metrics

In classical image edge detection algorithms, gradient images are obtained by gradient operator convoluting, and contours are traced according to the gradient changing and gradient threshold. But the uneven changing of local gradient in image leads to not accurate edge information obtained through uniform threshold segmentation. To solve these problems, in this paper an adapted threshold method is introduced based on the expectation of local block in image. First, we get the image gradient matrix with the help of Sobel operator, then segment the matrix into a plurality of sub regions, and calculate the local expectations of each sub region as the threshold to each of them and filter out the edges of each sub regions finally. The experiment results show that the proposed method can enhance the recognition of primary object edge detection in image effectively, and the edge information obtained is accurate.

Target Location Based on Double-edge Detection

DU Mo1,2, WANG Qing-li2

2016, 0(8):  56-59.  doi:10.3969/j.issn.1006-2475.2016.08.012

Asbtract ( 181 )  

References | Related Articles | Metrics

In order to improve the accuracy of target location, based on the traditional difference of Gaussian edge detection and Sobel operator edge detection, this paper puts forward a double edge detection algorithm which combines the two. We use the difference of Gaussian to replace the Gaussian smoothing in image preprocessing, choose better results of difference of Gaussian parameters, use Sobel edge detection after the difference of Gaussian process, and find the target location. The experimental results show that combining difference of Gaussian with Sobel operator do not increase much running time overhead, and have better detection result than the Sobel test alone.

Surveillance Video Keyframe Extraction Based on Objects Change

ZHOU Ping

2016, 0(8):  60-64.  doi:10.3969/j.issn.1006-2475.2016.08.013

Asbtract ( 193 )  

References | Related Articles | Metrics

As an important research content of surveillance video analysis, video keyframe extraction can effectively solve a series of problems such as the efficient storage and rapid access of video data. This paper proposes a surveillance video keyframe extraction method based on objects change. We firstly analyze objects change between different video frames, and then use the local maximum optimization to decompose an original surveillance video into some video clips. Finally, each keyframe is chosen from each video clip corresponding to feature center. On the basis of the object attribute, some redundant keyframes will be deleted to ensure a more compact keyframe set. The experimental results show that our method extracted video keyframes with low redundancy; meantime the contained content is very representative. In addition, our method has low complexity, which is suitable for online surveillance video analysis.

Kernel Discriminant Analysis and Its Application in Image Set Matching

ZENG Qing-song

2016, 0(8):  65-68+74.  doi:10.3969/j.issn.1006-2475.2016.08.014

Asbtract ( 173 )  

References | Related Articles | Metrics

Image set matching attracts increasing attention in the field of pattern recognition. A convenient way of dealing with image sets is to represent them as points on manifolds. We naturally formulate the problem of image set matching as matching points lying on the Riemannian manifold spanned by covariance matrices. We derive a kernel function that explicitly maps the covariance matrix from the Riemannian manifold to a Euclidean space. With the explicit mapping, a kernel version of linear discriminant analysis is applied to classify the image sets. The proposed method is evaluated on set-based object classification tasks. Extensive experimental results show that the proposed method outperforms other state of the art set-based matching methods in the public database.

Intelligent Breeding Industry Management and Monitoring Platform

LIU Bo-ping1,2, HU Min1,2, FU Kang1,2, MENG Sha-sha1,2, QIU Feng1,2

2016, 0(8):  69-74.  doi:10.3969/j.issn.1006-2475.2016.08.015

Asbtract ( 216 )  

References | Related Articles | Metrics

Aiming at the current status of the breeding industry, a system for production security control from the primary source is established, and an intelligent breeding industry management and monitoring platform is developed. By installing network cameras in the area of breeding farms, the platform can manage the information of production activities during the whole breeding process, make all the data from the breeding process be public to the society, and achieve the goal that the companies of breeding industry could discipline themselves and be supervised by the society.

Network System Based on Intelligent Parking Integrated Management Platform

LI Ying, SU Hong-feng

2016, 0(8):  75-78+85.  doi:10.3969/j.issn.1006-2475.2016.08.016

Asbtract ( 240 )  

References | Related Articles | Metrics

With the increase of urban car ownership, road congestion and parking difficulties have become increasingly prominent. Currently, the parking network resource utilization of urban parking management platform is low, it is difficult to commonly manage urban parking, and the parking information sharing capabilities are limited. This article sets up a network system of urban intelligent parking integrated management platform, which is connected to the intelligent transportation core network, in order to real-time transfer the each parking lot and the parked vehicles information to this platform as well as to commonly store and process the data transferred. It realizes the information interaction of different parking lots network on this platform, provides the networking services of cross-sectoral and cross-regional parking lots information, and solves the parking problem.

Algorithm of Failure Sensor Node Detection Based on Round Trip Time in Wireless Sensor Network

ZHANG Dai-chen, ZHOU Dan

2016, 0(8):  79-85.  doi:10.3969/j.issn.1006-2475.2016.08.017

Asbtract ( 150 )  

References | Related Articles | Metrics

One of important reasons for the decline of QoS in wireless sensor network is the failure of sensor nodes. We propose an algorithm to detect failure node based on round trip time. Discrete method is used to generate the round trip path and the failure sensor nodes are detected and located by measuring the round trip time of the path. By physical simulation and software simulation, we verify the applicability of the algorithm. Compared with the methods of linear round trip path, the discrete method could reduce the number of paths measured and shorten the time of detection.

An Improved Method for Route Maintenance of AODV Routing Protocol

CAO Wen-jun, XUE Shan-liang

2016, 0(8):  86-90+96.  doi:10.3969/j.issn.1006-2475.2016.08.018

Asbtract ( 164 )  

References | Related Articles | Metrics

During the route maintenance phase, the AODV routing protocol adopts a link repair mechanism. However, this mechanism can’t avoid the rising of packet loss rate and the increasing of transmission delay. To address the issues, this paper proposes an improved method for route maintenance of AODV routing protocol. This method uses the priority nodes judging mechanism in routing discovery phase to prevent the flooding caused by RREQ message, and uses the break link avoiding mechanism in routing maintenance phase to decrease the rate of the packet loss. The two mechanisms are both carried out by calculating link expiration time. The simulation results from the Network Simulator Version 2 (NS2) show that the improved AODV routing protocol performance well in the dense and fast motion VANET.

Social Selfishness-based Routing Algorithm on Opportunistic Networks

LIU Xi-xun

2016, 0(8):  91-96.  doi:10.3969/j.issn.1006-2475.2016.08.019

Asbtract ( 190 )  

References | Related Articles | Metrics

In the existing selfishness-based routing algorithms of opportunistic networks, most of them assume that selfishness exists in just a part of the nodes. However, most people have different degrees of selfishness in the real world. Therefore, a social selfishness-based routing algorithm is proposed. In this algorithm, node’s selfishness is reflected in the pursuit of the maximum forwarding revenue, which is related to both the social relationship intensity between the pair nodes and the priorities of the messages. With a stronger social tie and a higher message priority, the forwarding willingness becomes stronger. Meanwhile, nodes firstly forward messages with the highest forwarding revenue, and select the relay node which has a stronger social tie with the destination node and a higher delivery ratio as well as a stronger forwarding willingness for the sender. Finally, the feasibility and efficiency of the proposed algorithm is proved by the simulation experiments.

Development of E-commercial Monitoring Technology in Age of Mobile Network

DENG Jia-ming

2016, 0(8):  97-99+122.  doi:10.3969/j.issn.1006-2475.2016.08.020

Asbtract ( 147 )  

References | Related Articles | Metrics

Starting with the change of business conditions from traditional e-commerce to mobile e-commerce, we analyzed the inevitable tendency of e-commercial monitoring technology in the age of mobile network, elaborated the development of monitoring mode, content and technology of mobile e-commerce, and further illuminated the fundamental design concept and implementation of mobile commercial monitoring technology based on Android system.

Web Application Vulnerabilities Mining Method Based on Improved Fuzzing

DA Xiao-wen, WANG Xiao-cheng, CHEN Zhi-hao

2016, 0(8):  100-104.  doi:10.3969/j.issn.1006-2475.2016.08.021

Asbtract ( 207 )  

References | Related Articles | Metrics

To solve the problems that slower speed and fewer number of vulnerabilities found of Web fuzzing for mining vulnerabilities, a method to improve the generation of vectors of Web fuzzing is proposed. On the basis of the structure of commonly-used fuzzing for Web application (Web fuzzing) and the analyses of the current methods of testing vectors generation, the genetic algorithm to improve testing vector generation of Web fuzzing is applied. Based on this method, a XSS fuzzing tool is implemented. The testing results of multiple Web applications with XSS fuzzing tool and that with current fuzzing tool are compared, which indicates that the efficiency of mining vulnerability is increased with the method.

Delegation Authorization Framework Based on OAuth 2.0

SHEN Hai-bo

2016, 0(8):  105-108+122.  doi:10.3969/j.issn.1006-2475.2016.08.022

Asbtract ( 203 )  

References | Related Articles | Metrics

Authentication and authorization are the important technologies to ensure the secure access to the Web resources, and the delegation can strengthen the dynamicity, flexibility and scalability of authorization mechanism. OAuth (open authorization) 2.0 specification defines an open delegation authorization framework and is used in a wide variety of applications, but it is not applicative to the scenarios that require stronger security properties. By extending the functionalities of the OAuth 2.0, a secure delegation authorization framework for the Web application environment is proposed. In the proposed framework, the scheme of client authentication to the resource server is proposed based on the proof-of-possession (PoP) security mechanism, and the method to bind PoP key to PoP token is described. Finally, the related issues in the framework such as the overall architecture, the abstract implementation flow and the revocation of delegation are discussed in detail.

Geological Reserve Calculation Based on Boundary Searching Algorithm

YIN Xiao-zhe1, GUO Jun-hui2, TIAN Feng1, TONG Xi-feng1, GAO Jun-tao1

2016, 0(8):  109-113.  doi:10.3969/j.issn.1006-2475.2016.08.023

Asbtract ( 160 )  

References | Related Articles | Metrics

The calculation of well-controlled area is the foundation of geological and remaining reserve evaluation in the oilfield development and adjustment. As in the case of discrete points with variable well spaces, a new kind of edge pivoting boundary searching algorithm with angle identification and variable searching step is promoted. The neighborhood of the current boundary point is firstly determined based on a proper searching step. The corresponding angles of those points in the neighborhood are calculated and sorted, and the next proper boundary point is determined. Based on the identified boundary wells, the general boundary enlarging method is presented. And finally the well-controlled area calculation method is given. The algorithm has the advantages of easy-to-use and high efficiency. It could be effectively used to identify the convex and concave characteristic in a discrete point set with variable point spaces. The method has been applied in the geological reserve recalculation and remaining reserve evaluation in SZ oilfield, which improves the working efficiency more than 5 times, obtains an accuracy of 2.7% in the recalculation of geological reserve and shows a good result of application.

An Efficient Audio Streaming Server Method

YU Qiong1, PENG Hao1, JIANG Xian-yang2, CAO Da-ping1

2016, 0(8):  114-117.  doi:10.3969/j.issn.1006-2475.2016.08.024

Asbtract ( 194 )  

References | Related Articles | Metrics

In embedded audio streaming media system, the audio streaming server as a core part plays a crucial role. Taking features that high real-time requirement and limited cache resources in a LAN of audio streaming media system into account, the server presents dynamic transmission rate control algorithm. It firstly ensures the average transmission speed is same as the ideal sending speed in as soon as possible cycle, and then uses negative feedback factor to adjust partial speed in this cycle. Data synchronization is not good enough when using multicast broadcasting the same programs in point-to-multipoint structure. In order to improve the quality of service, the server selects peer workgroup model and unicast polling transmission mode. Experimental results show that the real-time and smoothly broadcasting and synchronization for terminals can been ensured.

Influence of High Order Radial Distortion on Accuracy of Zhang Zhengyou's Plane Calibration Algorithm

YOU Di, YANG Shi-hong, ZHAO Ru-jin, HONG Yu-zhen, YAN Kun

2016, 0(8):  118-122.  doi:10.3969/j.issn.1006-2475.2016.08.025

Asbtract ( 255 )  

References | Related Articles | Metrics

Machine calibration is a very important step in the work of visual measurement. The camera calibration method proposed by professor Zhang Zhengyou is one of the most widely used methods at present. But Zhang's method only considers the radial distortion of the first two steps, so this paper studies the influence of the high order radial distortion on the accuracy of the calibration method. We take the board grid as the simulation template, carry on the simulation calibration experiment based on Matlab, obtain the error of the calibration result under different radial distortion conditions, and analyze the relationship between them. In this paper, the relationship between the three order radial distortion and the calibration error and the curve of the relationship between the four order radial distortion and the calibration error are drawn. The influence of three order radial distortion and four order radial distortion on the calibration error is very similar. The curve of the high order radial distortion and the calibration error curve are basically in line with the parabola. At the same time, the influence of the higher order radial distortion on the calibration accuracy of the two order radial coefficient is much larger than that of the calibration precision of the first order radial coefficient.

Applied Adaptor with Aircraft Cooperative Design Based on JSON Data Format

QIAN Shao, CHEN Dan

2016, 0(8):  123-126.  doi:10.3969/j.issn.1006-2475.2016.08.026

Asbtract ( 161 )  

References | Related Articles | Metrics

In the cooperative design of aircraft, the original applied adapter based on XML always cannot avoid the unnecessary loss during the operation owing to its complexity of encapsulation and resolution, especially in terms of XML data format. So, the thesis is based on JSON data exchange format, which aims to improve the access quality of whole system by means of making JSON replace XML. The experimental data of encapsulation, resolution, storage and compression show that there is an average increase of 15.68% towards the access quality of whole system and an advance in compression ratio under the circumstance of aircraft cooperative design when we compare JSON with XML. And thereby we can make it a feasible solution to optimize systemic function in a complicated background.