Journal of Computer Applications

Smart rail transportation and its system architecture

ZENG Hua-shen ZHU Huai-fang

2012, 32(05): 1191-1195.

Asbtract ( )

PDF (2998KB) ( )

References | Related Articles | Metrics

This paper advocated using the concept of Smart Rail Transportation (SRT) to describe future vision of "high-efficient, fast & convenient, safe, visual, predictable, ecological, and smart" rail transportation industry as a macro-system together with an organizational framework for SRT. This framework is composed of three parts: A) an Intelligent Ground Infrastructure for SRT(SRT-IGI) plus Smart Trains aiming at "in-depth sensing & perceiving"; B) the Internet of Things (IoT) for SRT acting as a common platform for information exchange and resource sharing and aiming at extensive interconnectivity and interoperability among human beings, computers, and physical objects; and C) the top layer a Human-Computer Amalgamated Intelligent Management, Decision-making, and Commanding (HCA-IMDC) system for SRT aiming at premier intelligent data processing. All these three components with their distributed intelligent processing power make the rail transportation "smart". Technical connotation of the three components was analyzed in details. In view of that no comprehensive work on smart rail transportation from view of Information Technology (IT) has been found so far, the authors wish that this framework could provide a basis for further discussion on this subject and contribute to the leap-forward development for rail transportation in our country.

Smart rail transportation-in-depth sensing and perceiving

CHEN Xiang-dong YANG Bin

2012, 32(05): 1196-1198.

Asbtract ( )

PDF (1748KB) ( )

References | Related Articles | Metrics

Smart Rail Transportation (SRT) is a new concept in rail transportation industry and poses technical challenges for the academic circle as well as the industry. It involves "in-depth sensibility and perceptibility", "extensive interconnectivity and interoperability among human beings, computers, and physical objects", and "premier intelligent data processing" to aim at SRT. Having analyzed the development trend pertinent to in-depth sensing and perceiving in SRT, this paper provided a comprehensive discussion on the requirements of relevant techniques, characterized by "sharpness", "swiftness", "reliability", "high-efficiency", "completeness", and "intelligence" in SRT.

Internet of Things for smart rail transportation: aiming for wider range of object-interconnection

DOU Jun ZENG Hua-shen TAN Xian-hai ZHANG Xin-you

2012, 32(05): 1199-1204.

Asbtract ( )

PDF (3607KB) ( )

References | Related Articles | Metrics

Taking rail transportation industry as the background, a framework of the "Internet of Things" for Smart Rail Transportation (SRT-IoT) was proposed and its key techniques were explored. With the perception of the next generation Internet, this framework was characterized by a Backbone Communication Network for SRT (SRT-BCN) interconnected by various Basic Access-Resource Networks (BARN) with clients and resource servers. Furthermore, rail-transportation specific BARNs were classified into two groups: Train-based Access-Resource Network (TARN) and Ground-based Access-Resource Network (GARN). Techniques feasible for different network were also analyzed in different details, and an emphasis had been given to TARN with a conclusion that TARN related network technologies should further develop as a research basis of SRT-IoT for wider interconnection.

Smart rail transportation-an implementation of deeper intelligence

YANG Yan ZHU Yan DAI Qi LI Tian-rui

2012, 32(05): 1205-1207.

Asbtract ( )

PDF (2286KB) ( )

References | Related Articles | Metrics

Traveling by rail has become one of the important transportation modes of current residents. The core of Smart Rail Transportation (SRT) is to change the existing modes of railway transportation by a more intelligent way through modern information technology. Its aim is to bring more efficient, safe, comfortable intelligent transportation systems for human activities. This paper discussed four steps of a deeper wisdom in SRT, including wisdom data collection, wisdom data fusion, wisdom data mining and wisdom decision-making. These four steps form a spiral ascendance of intelligent information processing, and ultimately achieve a deeper wisdom in SRT.

Link monitoring mathod based on satellite communication network

LIU Hai-yan WANG Min-min CAI Rui-yan

2012, 32(05): 1208-1210.

Asbtract ( )

PDF (2059KB) ( )

References | Related Articles | Metrics

Based on the statistical characteristics of satellite link error rate,this paper proposed a new link directly monitoring technology using variable length sequence. Using the analysis of bit error rate segmentation strategy and statistical principles of statistical confidence,the monitoring method determined the sequence of the link selection criteria through the training sequence length, the error simulation accuracy and reliability of monitoring and statistical analysis.Experimental results show that link directly monitoring technology using variable length sequence is effective to improve the range of link monitoring and reduce the computational complexity under a certain premise of the channel resources. It has certain advantages in the satellite to link monitoring.

Cross-layer resource allocation algorithm of MIMO-OFDM systems with partial channel state information

HUANG Yu-qing LI Cheng-xin LI Qiang

2012, 32(05): 1211-1216.

Asbtract ( )

PDF (2936KB) ( )

References | Related Articles | Metrics

Cross-layer design is an effective technique for future mobile communication systems. A cross-layer resource allocation algorithm with partial channel state information was explored to maximize the total system throughput for multi-user MIMO-OFDM （Multiple Input Multiple Output-Orthogonal Frequency Division Multiplexing） system. The objective function of the optimization problem was designed based on the power limitation constraint, transmission rate, average queue length and sub-carrier occupancy, Quality of Service (QoS) requirements of different services and queue state information of data link layer. Under the condition of finite-length user buffer in data link layer, the mean feedback model was utilized to describe the feedback process of channel state information, and then the corresponding cross-layer resource allocation criteria could be derived. The simulation results show that compared with the existing schemes, the proposed algorithms obtain reasonable throughput performance and reduce lost package rate while providing better QoS requirement for each user of different services.

Generation and transmission system of optical millimeter-wave carrying OFDM signal based on phase modulator

JING Qin-qin WEN Hong XU Liang PENG Sheng-qi

2012, 32(05): 1217-1220.

Asbtract ( )

PDF (1604KB) ( )

References | Related Articles | Metrics

OOFDM (Orthogonal Frequency Division Multiplexing) is a focus in research of broadband communications now. The combination of OFDM with ROF (Radio Over Fiber) system can overcome optical dispersion and improve the performance of ROF system。 A generation and transmission system of optical millimeter-wave carrying OFDM signal based on phase modulator was proposed. In the center station, Double SideBand with Suppressed Carrier (DSB-SC) optical millimeter wave signal was generated utilizing phase modulator along with optical filter, while OFDM signal was modulated only onto one of the two optical carriers and transported along optical fiber. The paper set a model about optical carrier OFDM generation and analyzed fiber dispersion influence on phase, and proved the feasibility of the system through the simulation test. The result show the system's eye chart is very clear over 95km optical fiber.

Energy-constrained spectrum sensing method for OFDM cognitive radio system

CHEN Guo-zhong TANG Jia-shan

2012, 32(05): 1221-1223.

Asbtract ( )

PDF (2015KB) ( )

References | Related Articles | Metrics

Considering that the traditional spectrum sensing method does not take into account the impact of the energy consumption, a joint optimization of spectrum sensing method under the energy constraints for OFDM system was proposed. Based on the traditional energy detection, the spectrum sensing problem was modeled into an optimization problem. Both the sensing time and the decision threshold parameters of each band were optimized, under the energy-constrained case, to maximize the total throughput of the system. The simulation results show that, compared with the traditional detection method, the system using the proposed method not only has higher throughput, but also saves more energy.

Equilibrium precoding scheme for network multiple-input multiple-output system

ZHANG Hong HAO Dong-lai

2012, 32(05): 1224-1227.

Asbtract ( )

PDF (1997KB) ( )

References | Related Articles | Metrics

Maximizing the user's signal interference noise ratio and minimizing interference leakage is a contradiction in preprocessing for network Multiple-Input Multiple-Output (MIMO) system. Therefore, an equilibrium precoding algorithm based on equilibrium strategy was proposed. Mathematic model for precoding algorithm was constructed and interference pricing function was also introduced to obtain the precoding vector by Lagrange equation. Implementation procedure of the proposed algorithm was also summarized. Finally the proposed algorithm was compared with conventional algorithms and convergence of utility function was discussed by simulation. The results show that the proposed algorithm performs better than 〖BP(〗other schemes.〖BP)〗those existing schemes in convergence and throughput.

Swarm hybrid algorithm for nodes optimal deployment in heterogeneous wireless sensor network

ZHANG Bin MAO Jian-lin LI Hai-ping CHEN Bo

2012, 32(05): 1228-1231.

Asbtract ( )

PDF (2598KB) ( )

References | Related Articles | Metrics

The coverage problem is a basic problem in the wireless sensor networks, which indicates the Quality of Service (QoS) of sensing by wireless sensor networks. A lot cover blind areas and cover redundancies will be produced, when the nodes are deployed initially in the networks. A hybrid algorithm was proposed to deploy the heterogeneous network nodes reasonably to improve the coverage ratio and reduce the cost of the nodes,which introduced the ε-target constraint method based on Particle Swarm Optimization (PSO) and Fish Swarm Algorithm (FSA). The swarm hybrid algorithm firstly set up the concept of individual center, to quickly search the best solution domain of the individuals' locations, introducing the idea of the cluster behavior and tracing cauda behavior into the PSO, and then used the PSO to find the optimized speed and optimized location of the individuals. The simulation results show that the swarm hybrid algorithm is better than the standard PSO and the standard FSA in pursuing the balance and optimization between the coverage ratio and the cost of the networks.

Distortion optimized routing algorithm in wireless video sensor network

CHEN Xu SHEN Jun LUO Hu FU Xin-hua

2012, 32(05): 1232-1235.

Asbtract ( )

PDF (1933KB) ( )

References | Related Articles | Metrics

According to the characteristics of wireless sensor network link with video transmission instability and poor reconstruction quality, this paper proposed an reliable transmission of routing algorithm (EDLOR) which is adaptive to Multiple Description Coding (MDC). Firstly, it took fully consideration about the video coding rate, delay-constrained, network packet loss and other factors. Secondly, it aimed at how to optimize multiple description of the Peak Signal-to-Noise Ratio(PSNR). As a result, the overall video distortion minimization was gained. Thirdly, these MDCs would be assigned to designed path for transmission according the computed results. It is shown from experimental results that EDLOR can improve the overall video quality through promoting the average PSNR and lowering packet loss rate.

Inter-domain handoff management based on fast handover for hierarchical MIPv6

Ya-ping DENG CHEN Zhong-yuan

2012, 32(05): 1236-1239.

Asbtract ( )

PDF (2092KB) ( )

References | Related Articles | Metrics

To improve the performance of inter-domain handoff in mobile IPv6, one kind of inter-domain handoff mobility management scheme based on edge access router was introduced in the FHMIPv6 mechanism．In this method, when Mobile Node (MN) moved to the edge access router, it did intra-domain handoff and duplicated address detection for on-link care of address both in previous Mobile Anchor Point (MAP) and new MAP．It would set the new regional care of address and had the two addresses banded in the new MAP after the handoff was finished．Finally, the NS-2 simulation and comparison results show that this scheme can effectively reduce the transmission latency and packet loss rate．

Dynamic local weighted network model of embedded TF mechanism

MA Jie-liang ZHAO Yue

2012, 32(05): 1240-1243.

Asbtract ( )

PDF (2610KB) ( )

References | Related Articles | Metrics

The author analyzed the research results obtained by the current weighted local world evolution model, based on which the research results needed comprehensive improvement. The dynamic local weighted network model with embedded TF mechanism was proposed. The BBV edged weight dynamic evolution mechanism and TF rule were introduced into the model in the course of evolution. Mean-field theory and computer analog simulation had verified the model with the characteristics of power law. Meanwhile, the strength distribution, the edged weight distribution and the degree distribution showed the power-law distribution of fat tail phenomenon. Triangular structure embedded made the model more stably adjust the size of the clustering coefficient. The simulation results show that, the TF-DLW evolution model inherits the power-law distribution characteristics many complex models have, and can control the size range of the cluster coefficient more rapidly.

Delay-constrained dynamic non-rearranged multicast routing optimization

LIU Wei-qun LI Yuan-chen

2012, 32(05): 1244-1246.

Asbtract ( )

PDF (2117KB) ( )

References | Related Articles | Metrics

After researching the delay-constrained multicast routing algorithm, a new dynamic non-rearranged multicast routing algorithm,Non-rearranged Dynamic Multicast Algorithm with Delay-Constraint (NDMADC) was proposed in this paper. Combining algorithm DGA (Dynamic Greedy Algorithm) and Floyd optimization of the shortest path, NDMADC ensured that under the premise of satisfying delay constraint, the node can dynamically select minimum cost path to multicast tree to join the multicast session. What's more, due to the adoption of greedy algorithm, NDMADC needs not to restructure multicast tree when a node joins it. The simulation results show that the algorithm can not only construct correctly multicast tree to meet delay constraint but also has low cost and complexity.

Design of embedded Ethernet-CAN communication card based on FPGA

WANG Fang-fang YI Ling-zhi CHEN Hai-yan LU Qi-xiang

2012, 32(05): 1247-1250.

Asbtract ( )

PDF (1973KB) ( )

References | Related Articles | Metrics

In order to realize the CAN bus communication with PC and remote monitoring, a design method of the embedded Ethernet-CAN communication transform card based on FPGA was proposed. The design chose the embedded soft processors Nios Ⅱ in FPGA as the main control chip, MCP2515 as the CAN bus controller and 88E1111 as the Ethernet PHY chip. A system hardware model was built with the SOPC (System-On-a-Programmable-Chip) technology, and the CAN controller, Ethernet initialization and the Ethernet-CAN conversion process were completed in the Nios Ⅱ IDE （Integrated Development Environment）.The experimental results show that the design completely meets the requirements of the Ethernet and CAN bus communication.

Network congestion status prediction with multidimensional statistical methods

WU Ping WU Bin LI Xin LI Jun HUANG Hong-wei

2012, 32(05): 1251-1254.

Asbtract ( )

PDF (1824KB) ( )

References | Related Articles | Metrics

For evaluating the two values of the average queue length and the queue waiting time, the core indicators of congestion control algorithms, more accurately in the network with priority scheduling service, a computational model, which includes the data arriving process, the data leaving process and the priority scheduling service, was designed by using the three statistical methods: the Pareto distribution, the Poisson random process and the weighted average method. And the computational function of curve shape parameter was deduced by using the matrix method. By comparing the simulation results produced from a test bed with the results of the computational model, it is found that the deviation is small, which proves that the new model can predict the status of network correctly.

SIFT mismatching correction based on partial least squares

YAN Wei-dong TIAN Zheng WEN Jin-huan PAN Lu-lu

2012, 32(05): 1255-1257.

Asbtract ( )

PDF (2166KB) ( )

References | Related Articles | Metrics

A method to correct Scale Invariant Feature Transform (SIFT) mismatching based on Partial Least Squares (PLS) was presented to solve the mismatching when the feature points locate in some similar structures of one image. At first, SIFT algorithm was used to extract the feature points, and get initial matching. Then, each matching point obtained by SIFT could be described again using PLS. Furthermore, the introduction of influence function helped to judge and remove the mismatching. The experimental results on optical and remote sensing images show that the proposed algorithm outperforms conventional approach in terms of mismatching correction.

Fast algorithm for 2D Otsu thresholding algorithm

XU Chang-xin PENG Guo-hua

2012, 32(05): 1258-1260.

Asbtract ( )

PDF (1479KB) ( )

References | Related Articles | Metrics

Otsu algorithm is widely used in classic image segmentation, while the application of the two-dimensional Otsu thresholding algorithm based on the Otsu algorithm has been restricted for the complex computation. Concerning this, this paper proposed an improved two-dimensional Otsu thresholding algorithm. The authors first divided the two-dimensional histogram into regions, and took each region as a point to form a new two-dimensional histogram, to which 2D Otsu thresholding algorithm and the fast recursive algorithm were applied, getting the region number of the threshold. Then the two algorithms were applied again on the region and finally the threshold for the original image was obtained. The experimental results show that the proposed algorithm greatly reduces the running time and the storage space, and gets basically the same results as the original algorithm.

Robust fragments-based tracking with hue detecting-based template updating

WANG Xiao-hua TENG Jong-hua ZHAO Chun-hui

2012, 32(05): 1261-1264.

Asbtract ( )

PDF (2305KB) ( )

References | Related Articles | Metrics

Robust fragments-based tracking cannot update template, so the paper proposed a template updating method based on hue detecting. First, hue histogram distance between template and current target was calculated, and then the distance was compared with the threshold. If the distance is more than the threshold, the template should be fixed in next frames, or the template should be updated every frame. The experimental results on challenging sequences demonstrate the method can track targets when illumination changes as well as improve tracking accuracy.

Tracking algorithm for moving objects based on gradient and color

LIU Hai-yan YANG Chang-yu LIU Chun-ling ZHANG Jin

2012, 32(05): 1265-1268.

Asbtract ( )

PDF (2239KB) ( )

References | Related Articles | Metrics

Since there are deficiencies in tracking moving object based on either color feature or gradient feature under complex background, a new algorithm CG_CamShift was proposed with the combination of the two features. This algorithm made full use of the color histogram description of the overall goal and the gradient orientation histogram description of the structural information, and predicted the position of the moving object in combination with the Kalman filtering. It resolved the problem of losing object caused by illumination and shading under complicated background. The experimental results show that the algorithm enhances the tracking accuracy while guaranteeing the real-time performance. In addition, it has stronger robustness.

MPEG video shot boundary detection based on motion vectors

WANG Cheng-ru WANG weiWei-wei

2012, 32(05): 1269-1271.

Asbtract ( )

PDF (1568KB) ( )

References | Related Articles | Metrics

First,DC map of I frame was extracted for rough detection of the shots.And then the forward motion compensation vector of P frame was extracted, and Extended Vector Median (EVM) filtering was used for the preprocessing of motion vector.Finally the characteristics of three sports features,exercise intensity value, exercise intensity difference and the direction of motion vector histogram, absolute difference were calculated. Fuzzy inference was introduced to synthesize these three characteristics and classified shots to abrupt-change,gradual-change and no-change ones.The MPEG video shot boundary detection method do not need to decompress the video fully,and extracts information directly from MPEG compressed bit stream,so it is of low computation complexity and high extration speed,which is verified by the experimental results.

Superpixel-based conditional random field for image classification

ZHANG Wei WANG Xi-li

2012, 32(05): 1272-1275.

Asbtract ( )

PDF (2908KB) ( )

References | Related Articles | Metrics

Concerning the high time complexity of inference and parameter estimation in graph model，the concept of superpixel was introduced into the Conditional Random Field (CRF)，and a superpixel-based CRF image classification method was proposed. This method first over segmented the image into small homogeneous regions which were called superpixels by using mean shift method. Then the graphical model was constructed with superpixels as nodes and the neighboring nodes as edges. The corresponding definition of CRF and the methods for parameter estimation and labeling inference were proposed and implemented. The experimental results show that better classification results are obtained by the superpixel-based CRF model. At the same time, running time is largely reduced.

Improved shape distribution retrieval algorithm of 3D models

ZHANG Ming LI Juan

2012, 32(05): 1276-1279.

Asbtract ( )

PDF (1929KB) ( )

References | Related Articles | Metrics

This paper proposed an improved method for traditional D1 shape distribution function with complex computation which obtains large amount of samples and can not fully describe the model content and also has low search rate. There are key points of this method as follows: first, it normalizes the model by using translation and zoom so that it can reduce the difference between the triangular patches and make the sampling points uniformly fall on the surface of the model; secondly, it uses the index number of the triangular patches to generate the random numbers, and uses the gravity of model and centric of triangular patch for effective computation, to reduce the processing time and improve the efficiency of three-dimensional model retrieval. In addition, this paper validated the practical value of improved D1 shape distribution method by using the idea of semi-automatic model classification. Using part models of three-dimensional model database in Princeton University, the results show that: both improved methods will not decrease the precision and recall of model retrieval, but effectively reduce the processing time.

Image retrieval method based on color and edge features

LIU Fu-min ZHANG Zhi-bin

2012, 32(05): 1280-1282.

Asbtract ( )

PDF (2112KB) ( )

References | Related Articles | Metrics

In order to improve the effectiveness and efficiency of the Content-Based Image Retrieval (CBIR), in this paper, a new method was proposed. Both color feature and edge feature were used in this method. At first, RGB image was departed into several sub-images. Then, color feature and edge feature were extracted from every sub-image, where edge feature was acquired by utilizing the Moment Preserving (MP) edge detection. Combining the above two features, an effective and efficient image retrieval method was obtained. The experimental results show that the proposed method has higher precision and faster speed than Cheng's two methods. Compared with Cheng's two methods, retrieval time of the method proposed in this paper is its 10% and 3%, and retrieval precision has been improved by 20%.

Multi-focus image fusion based on non-separable symmetric wavelets

LI Kai LIU Bin

2012, 32(05): 1283-1285.

Asbtract ( )

PDF (2291KB) ( )

References | Related Articles | Metrics

A new fusion method of multi-focus images based on the four-channel non-separable wavelet was proposed, which aimed to solve the problem which exists in the separable wavelet-based fusion methods. First, a 4×4 non-separable wavelet 4-channel filter bank with linear phase using the theory of non-separable wavelets was constructed. Then images involving the fusion were decomposed by using the filter bank, for low-frequency part, the average value was selected, for the three high-frequency parts of each level, the value of the area window whose energy was bigger was selected. Finally, the new fused image was reconstructed. The performance of the method was evaluated using entropy, average gradient, etc. The experimental results show that it has good effect on the fusion of multi-focus images. The performance is better than that of the separable wavelet fusion method by using the same fusion algorithm. According to this method, the fused images are clearer and the detailed edge information of low-frequency domain is better obtained.

Adaptive threshold denoising algorithm with neighboring window average energy based on Contourlet transform

HE Ya-li YANG Hui-xian LI Li LENG Ai-lian ZHU Gui

2012, 32(05): 1286-1288.

Asbtract ( )

PDF (2040KB) ( )

References | Related Articles | Metrics

Concerning the defects of multi-scale threshold on directional information using Contourlet transform,a new adaptive threshold denoising algorithm was proposed, which was based on average energy of neighboring window. According to the distribution of the coefficients energy, the Contourlet coefficients were divided up into three areas. The noise could be reduced obviously by adjusting the threshold of these areas with different variables. In contrast with the wavelet threshold, Contourlet threshold and multi-scale threshold using Contourlet transform, the experimental results demonstrate that the new algorithm has superiority in Peak Signal-to-Noise Ratio (PSNR) and visual effect, which can maintain effectively the edges of the image.

Block wavelet threshold image denoising on total variation

GAO Yuan-yuan DIAO Yong-feng BIAN Yun

2012, 32(05): 1289-1292.

Asbtract ( )

PDF (2920KB) ( )

References | Related Articles | Metrics

Traditional total variation algorithm of denoising could result in large residual noise in the smooth area and wavelet threshold algorithms could lead to some blurry edges. In view of these disadvantages, a new algorithm of block wavelet threshold image denosing on total variation was proposed. Firstly, this algorithm used total variation algorithm to denoise roughly, which eliminated noise in significant amplitude. Secondly, this algorithm used block wavelet threshold algorithm to eliminate the large residual noise in the smooth area. The experimental results show that the algorithm suppresses residual noise and protects edge effectively. Compared with traditional methods, both the peak signal-to-noise ratio and visual effects have been improved obviously.

Switching based fuzzy filter for salt-and-pepper noise

GUO Yuan-hua HOU Xiao-rong

2012, 32(05): 1293-1295.

Asbtract ( )

PDF (2046KB) ( )

References | Related Articles | Metrics

Adaptive median filter (AM) was less efficient in detail-preserving when noise ratio is high. On the basis of standard median filter (SM) and AM this paper introduced a switching based fuzzy filter (SF). Noise pixels were identified by Max-Min operator, then according to the number of normal pixels, mean method or T-S fuzzy method was adopted to eliminate noise pixels. Experimental results show that this filter outperforms adaptive median filter in detail-protection and image smoothing. SF keeps a tradeoff between noise attenuation and detail-protection.

New local orientation estimation method of images based on principal component analysis

LIAO Yu

2012, 32(05): 1296-1299.

Asbtract ( )

PDF (3223KB) ( )

References | Related Articles | Metrics

Most of the existing image orientation estimation algorithms are very sensitive to noise. Therefore, this paper presented a new local orientation estimation method of image, which was based on Principal Component Analysis (PCA) and multi-scale gradient pyramid decomposition. The PCA was applied to search for the Maximum Likelihood (ML) estimation of the local orientation of block in image. Through presenting the local orientation estimation both of simulated images and real images, the experimental results show that the proposed algorithm has excellent robustness against noise, its speed is very fast and the accuracy is very high.

Face hallucination based on position prior and sparse representation

MA Xiang

2012, 32(05): 1300-1302.

Asbtract ( )

PDF (2098KB) ( )

References | Related Articles | Metrics

A face hallucination method based on sparse representation and position prior was proposed, which can obtain the enlargement of a single low-resolution input. Some perspectives of compressed sensing were applied to the method. The high- and low-resolution over-complete atoms were classified according to different positions of face. The low-resolution face image inputs were approximated by the sparse linear combination of the over-complete atoms which were classified. The sparse coefficients were obtained to reconstruct the high-resolution data of certain position. According to their original positions, the generated patches were integrated into a global face. The experimental results illustrate that the proposed method can generate satisfying high-resolution face image using fewer atoms compared to other methods.

Incomplete fuzzy information system based on total order dominance relation and its attribute reduction

ZENG Xue-lan SUN Xing-xing

2012, 32(05): 1303-1306.

Asbtract ( )

PDF (2412KB) ( )

References | Related Articles | Metrics

Concerning the incomplete fuzzy decision information system with a dominance relation, according to the analyses on the advantages and disadvantages of two dominance relations, a new total order dominance relation was built by using the probability distribution principle of the attribute value. This relation was used to reasonably improve the extended dominance relation and overcome the shortcoming that the limited dominance relation cannot be used to compare all the objects in the domain. And further, based on the new relation, the expression of the lower and upper approximate, the definition of relative reduction and specific calculation method were given. Finally, an example verifies the effectiveness of the proposed method.

Fault-tolerant federated filtering algorithm based on improved B-style grey relationship degree and balance coefficient

FENG Wen HAO Shun-yi FENG Xing-chun FAN Zhen-yang

2012, 32(05): 1307-1310.

Asbtract ( )

PDF (2504KB) ( )

References | Related Articles | Metrics

To analyze the difficulties of detection under “soft” failures, an improved B-style grey relationship degree based on the moving state propagator for the federated filter (FF) was developed to solve above problems. The mode can obtain the highest fault tolerance quality without feedback, mutual pollution was avoided by using FF. Also, an adaptive balance coefficient and its algorithm was presented to balance the optimal information sharing approach and the fault tolerance one. According to the algorithm in this paper, the information sharing coefficients were adaptively adjusted by the failure grade, and the approximate highest fusion accuracy was ensured, the algorithm has the character of low calculation, simple configuration, high precision, and was suitable to practical application. This simulation results indicate that fusion accuracy under the largest range of failures was increased approximate 28.5%, which shows the fusion accuracy under failures was efficiently improved and the approximate highest fusion accuracy of whole process was realized.

Bi-level programming model of fast fashion product logistics network under pre-sale strategy

LIU Si-jing ZHANG Jin LI Guo-qi

2012, 32(05): 1311-1315.

Asbtract ( )

PDF (2462KB) ( )

References | Related Articles | Metrics

To solve the location-allocation problem of logistics network with respect to fast fashion products under a pre-sale strategy, a bi-level programming model capturing the behaviors of online retailers and customers was proposed to minimize a total cost arising in the service of the logistics network. Common interests of the online retailer and the customer were considered synthetically. According to the characteristics of proposed model, an interactive fuzzy algorithm was adopted to determine locations, allocations, service plans of warehouse and third-party logistics enterprises. A case study was conducted to validate the feasibility of the proposed model and algorithm. The results reveal that the central warehouse should be located in a place close to areas of dense demand and the online retailers should provide a small amount of third-party logistics enterprices for customer selection.

Multi-project and multi-task selection planning model and its intelligent decision

XIA Lin-li LEI Hong

2012, 32(05): 1316-1319.

Asbtract ( )

PDF (2634KB) ( )

References | Related Articles | Metrics

This paper investigated a hybrid programming model and its immune clonal selection algorithm for multi-project and multi-task selection planning and project flow-shop scheduling. Based on the factors such as projects weights, inheritance constraints, timing constraints of tasks, the three-layer structure composed of projects, tasks and resources were considered, combining multi-layer decision thoughts, and a hybrid programming model was proposed. According to the immune metaphors of the immune system such as clonal selection, cell clone, cell memory and affinity mutation, the immune clonal selection algorithm was established. The experimental results and comparison show the rationality of the model and the effectiveness of the proposed algorithm.

Improved constrained multi-objective particle swarm optimization algorithm

LING Hai-feng JIANG Xun-lin

2012, 32(05): 1320-1324.

Asbtract ( )

PDF (2507KB) ( )

References | Related Articles | Metrics

An improved Multiple Objective Particle Swarm Optimization(MOPSO) algorithm for solving constrained multi-objective optimization problems (CMOPSO) was proposed based on the analysis of the characteristics of the multi-objective search space. A processing method taking dynamic ε unfeasible degree allowable constraint dominance relation as the main constraint was brought forward in this paper, which aimed to improve the algorithm's ability of edge searching and crossing unconnected feasible regions. A simple density measuring method was put forward for external archive maintenance, which intended to improve the efficiency of the algorithm. A new global guide selection strategy was put forward, which brought better convergence and diversity to the algorithm. The computer simulation results show that the CMOPSO algorithm can find a sufficient number of Pareto optimal solutions that have better distribution, uniformity, and approachability.

SLAM algorithm based on sparse extended information filter and particle filter

ZHU Dai-xian WANG Xiao-hua

2012, 32(05): 1325-1328.

Asbtract ( )

PDF (1956KB) ( )

References | Related Articles | Metrics

In the traditional particle filter algorithm, there is a problem that historical information can not be fully utilized because of small weight particle removed in resample and single iteration. A Simultaneous Localization And Mapping (SLAM) algorithm based on sparse extended information filter combing particle filter was brought forward. Information matrix maintained historical information, particles containing historical information obtained by Gibbs sampling, particles set described the posterior distribution well, and the accuracy of state estimation SLAM algorithm was improved. Plentiful Monte-Carlo simulations were carried out to show the positioning accuracy of this method is about 80% more than FastSLAM2.0 algorithm's.

Improved computation method for semantic similarity between gene ontology terms

XU An-long

2012, 32(05): 1329-1331.

Asbtract ( )

PDF (1955KB) ( )

References | Related Articles | Metrics

The current hybrid semantic similarity computation methods do not take full consideration of related factors. Concerning this problem, this paper proposed an integrated method based on multiple factors that affect the calculation of the semantic similarity of Gene Ontology （GO） terms. This method integrated the semantic level, semantic distance and local semantic density, and utilized the semantic information of ontology to fully compute the semantic similarity of gene terms. The experimental results show that the method has higher correlation coefficient with manual scoring than other methods.

Chinese word sense induction based on improved k-means algorithm

ZHANG Yi-hao JIN Peng SUN Rui

2012, 32(05): 1332-1334.

Asbtract ( )

PDF (1541KB) ( )

References | Related Articles | Metrics

Polysemy is an important and pervasive semantic phenomenon in Chinese; the task of word sense induction is to classify words with the same semantics in different contexts, which is a clustering problem essentially. Currently, unsupervised clustering algorithm has been widely used in its research. In this paper, an improved method of k-means was proposed, which mainly improved the selection of initial cluster centers and the calculation of cluster centroid and overcame the “noise” and the sensitivity of isolated point in data to some extent. Another idea was to use the classification coding of word in Tongyici Cilin to reduce the feature dimension. The experimental results show that the performance has great improvement with the improved k-means, of which the F-Score reached 75.8%.

Text classification model framework based on social annotation quality

LI Jin ZHANG Hua WU Hao-xiong XIANG Jun GU Xi-wu

2012, 32(05): 1335-1339.

Asbtract ( )

PDF (2726KB) ( )

References | Related Articles | Metrics

Social annotation is a form of folksonomy, which allows Web users to categorize Web resource with text tags freely. It usually implicates fundamental and valuable semantic information of Web resources. Consequently, social annotation is helpful to improve the quality of information retrieval when applied to information retrieval system. This paper investigated and proposed an improved text classification algorithm based on social annotation. Because social annotation is a kind of folksonomy and social tags are usually generated arbitrarily without any control or expertise knowledge, there has been significant variance in the quality of social tags. Under this consideration, the paper firstly proposed a quantitative approach to measure the quality of social tags by utilizing the semantic similarity between Web pages and social tags. After that, the social tags with relatively low quality were filtered out based on the quality measurement and the remained social tags with high quality were applied to extend traditional vector space model. In the extended vector space model, a Web page was represented by a vector in which the components were the words in the Web page and tags tagged to the Web page. At last, the support vector machine algorithm was employed to perform the classification task. The experimental results show that the classification result can be improved after filtering out the social tags with low quality and embedding those high quality social tags into the traditional vector space model. Compared with other classification approaches, the classification result of F1 measurement has increased by 6.2% on average when using the proposed algorithm.

Analysis on Effect Range of Context in Chinese Word Segmentation based Word -position Tagging

WANG Xi-jie

2012, 32(05): 1340-1342.

Asbtract ( )

PDF (2119KB) ( )

References | Related Articles | Metrics

In Chinese word segmentation with Conditional Random Field (CRF）, the size of feature window plays a crucial role in corpus training. To find the proper size of feature window, a group of feature templates were selected for the comparative tests performed on Bakeoff2005 with toolkit CRF++0.53 considering the effective range of context. The results are: (1) contribution of below-context is greater than above-context;(2) size of feature window influencing the segment performance is no larger than 5, the proper size is four or five.

Dynamic topic model amending method based on feedback stories

ZHENG Yan LU Ran ZHAO Ai-hua

2012, 32(05): 1343-1346.

Asbtract ( )

PDF (2144KB) ( )

References | Related Articles | Metrics

In topic tracking, the initial topic related stories are few and topic evolves dynamically, which leads to the topic model could not express topic accurately. Concerning this problem, it was proposed to build amended topic model by feedback stories collected by dynamic threshold, to amend topic model dynamically. And in combination of the feature that the named entity could differentiate different topics more effectively, it was suggested to increase the weight of named entity when amending topic model, to express a topic better. The experimental results indicate that, this method can solve the topic shifting problem effectively, and the miss tracking rate and fault tracking rate decrease a lot in topic tracking.

New semantic web service discovery approach based on QoS andfuzzy particle swarm optimization

LI Shu-yu

2012, 32(05): 1347-1350.

Asbtract ( )

PDF (2021KB) ( )

References | Related Articles | Metrics

Lacking effective Quality of Service (QoS) support in Web services discovery, a new semantic Web service discovery approach supporting QoS based on fuzzy Particle Swarm Optimization (PSO) was proposed. Firstly, in order to meet users' fuzzy QoS request, fuzzy theory was applied in describing QoS. Then, to improve the PSO, a new theory was proposed that one particle was affected by multi-particles and increment inertia factor was designed. At last, the experimental results have shown the effectiveness of the proposed method.

Web services discovery approach based on history users' QoS-awareness

YANG Yue-ming CHEN Li-chao PAN Li-hu XIE Bin-hong

2012, 32(05): 1351-1354.

Asbtract ( )

PDF (2041KB) ( )

References | Related Articles | Metrics

The existing Web services discovery method has limitations in time cost and accuracy because it does not make full use of the user context. Firstly, the clustering of similar user context was implemented to greatly reduce retrieval range of Web services. Secondly, based on this, making use of the current users' preference information and the history users' QoS-aware data, a method of Web services discovery based on history users' QoS-awareness was proposed. Finally, the comparison to other Web services methods indicates that this method is better than several other methods both in time cost and accuracy of Web services discovery.

Weight computing method for text feature terms by integrating word sense

LI Ming-tao LUO Jun-yong YIN Mei-juan LU Lin

2012, 32(05): 1355-1358.

Asbtract ( )

PDF (2482KB) ( )

References | Related Articles | Metrics

Most of the existing methods to compute text similarity based on Vector Space Model (VSM) use TF-IDF scores as the weights of feature terms in text, which ignores the word sense relationships among feature terms and lead to inaccurate text similarity. To improve the accuracy of text similarities calculated by methods based on VSM, a new term weight computing method by integrating word sense was proposed in this paper. Firstly, word sense similarities among feature terms were computed based on the Chinese WordNet. And then, the TF-IDF weights were revised according to the word sense similarities for the purpose of reflecting both the frequency and the word sense of feature terms in text. The experimental results on the HIT IR-lab Multi-Document Summarization Corpus show that to use the weights calculated by the proposed method can efficiently improve the differentiation among document clusters.

Active learning for multi-label classification based on sphere structured SVM

JIANG Hua QI Yu-shun

2012, 32(05): 1359-1361.

Asbtract ( )

PDF (1493KB) ( )

References | Related Articles | Metrics

In order to implement the multi-label classification of data and reduce the overload of multi-label training samples, an algorithm combined with sphere structured Support Vector Machine （SVM） and active learning method was proposed. The labels of the samples in overlapping regions were determined according to distance difference value. The classification features of multi-label were analyzed. Then classifier was updated by closed neighbor method. The experimental results show that the method can achieve more efficient results using less training samples.

Smoothness and principal components based non-negative matrix factorization

MA Peng YANG Dan FANG Wei-tao GE Yong-xin ZHANG Xiao-hong

2012, 32(05): 1362-1365.

Asbtract ( )

PDF (2135KB) ( )

References | Related Articles | Metrics

Non-negative Matrix Factorization (NMF) has the disadvantage of slow convergence, which is mainly due to that the base image (base matrix) contains lots of noise points. Besides, the coefficient matrix is significantly dependent, which is not conducive to distinguish between different images. In view of the above shortcomings, a new algorithm called Smoothness and Principal Components Based Non-Negative Matrix Factorization (SPNMF) was proposed in this paper. SPNMF had two novelties. On one hand, a constant matrix was added to the base matrix to enhance the smoothness and stabilize the noise points, which caused good convergence; on the other hand, to improve the discrimination, the variance between the different columns of the coefficient matrix as a penalty term was added to the loss function of NMF. The experimental results on the PIE face database and FERET face database show that the proposed method not only has higher recognition performance compared with the traditional algorithms, but also is two to four times faster than NMF, making the face recognition system based on NMF more practical.

Second-level contacts recommendation of social network service based on subjects of users' preference

YU Hai-qun LIU Wan-jun QIU Yun-fei

2012, 32(05): 1366-1270.

Asbtract ( )

PDF (2506KB) ( )

References | Related Articles | Metrics

The interpersonal contacts of the Social Network Service (SNS) customers are often researched based on the information of the graph theory. The preference of the customers themselves is often ignored, when discussing the nodes and the edges of the relationship graph of SNS. Thus, a second-level interpersonal contacts method based on the subjects of users' preference was proposed in this paper. Utilizing text mining technology and the Least Mean Square (LMS) algorithm, the authors transformed the subjects of users' preference into feature vectors reasonably. In order to ensure the set of the customers similar to the subjects of users' preference and complete the second-level recommendation of the customers, the similarity of the customers was computed with the similarity measurement. The experimental results show that the recommendation accuracy for good friend of this algorithm is very high. The acceptance rate of the recommended good friends is 70%.

Research on trust model of universally composable security computation

ZHANG Yu YIN Jian-qiang HU Jie

2012, 32(05): 1371-1374.

Asbtract ( )

PDF (2239KB) ( )

References | Related Articles | Metrics

A trust model capturing some set-up assumptions is necessary to guarantee the existence of Universally Composable (UC) security computation. Little domestic research on the trust model of UC security computation has been made. In this paper, the essential requirement of UC security and its limitation on UC security computation were researched to find out why these set-up assumptions were used. And then overseas representative trust models were analyzed and their merits and demerits were compared respectively. Finally, the research trend in future was pointed out.

Research on security policy about state control

LIN Zhi LIU De-xiang LI Yun-shan KE Mei-yan

2012, 32(05): 1375-1378.

Asbtract ( )

PDF (2607KB) ( )

References | Related Articles | Metrics

By discussing the shortages of access control policy, and analyzing the complementarity and completeness between access control and state control, the necessity of state control was proposed. A formal description about state control policy was defined, and the policy's description rules based on XML were regulated. At the same time, according to different control goal and control object, some application patterns for state control policy were provided. In addition, the complexity of state control policy was discussed, and some solutions were provided.

Security analysis of two multi-oriented traitor tracing schemes

XU Li

2012, 32(05): 1379-1380.

Asbtract ( )

PDF (1511KB) ( )

References | Related Articles | Metrics

ZHANG Xue-jun et al. presented two multi-oriented traitor tracing schemes with full collusion resistance. They asserted that it was computationally infeasible for any number of users to get a different key by collusion. Here, these two schemes were cryptographically analyzed and a concrete collusion attack method was proposed based on simple linear combination which three or more traitors can build more than one valid decryption key. Further, these traitors cannot be identified by using black box tracing method. The result show that neither of the two traitor tracing schemes accomplish the full collusion resistance because of their intrinsic flaws.

Robust and efficient remote authentication with key agreement protocol

TANG Hong-bin LIU Xin-song

2012, 32(05): 1381-1384.

Asbtract ( )

PDF (2096KB) ( )

References | Related Articles | Metrics

Password-based authentication and key exchange protocol have been widely used in various network services due to easy memory of password. Unfortunately, password-based authentication scheme also suffers from attacks because of the low entropy of password. In the year 2011, Islam et al.（ISLAM SK H, BISWAS G P. Improved remote login scheme based on ECC. IEEE-International Conference on Recent Trends in Information Technology. Washington, DC: IEEE Computer Society, 2011： 1221-1226）proposed an improved remote login scheme based on Elliptic Curve Cryptography (ECC).Whereas, the scheme was vulnerable to stolen-verifier and impersonation attacks and failed to provide mutual authentication. Therefore, the authors proposed a password-based Remote Authentication with Key Agreement (RAKA) protocol using ECC to tackle the problems in Islam et al.'s scheme. RAKA was based on Elliptic Curve Discrete Logarithm Problem (ECDLP) and needed to compute six elliptic curve scale multiplications and seven hash function operations during a protocol run. The efficiency improves by about 15%〖BP(〗 percent〖BP)〗. It is more secure and efficient than Islam et al.'s scheme.

Identity-based threshold ring signature scheme with constant signature size

SUN Hua GUO Lei ZHENG Xue-feng WANG Ai-min

2012, 32(05): 1385-1387.

Asbtract ( )

PDF (2018KB) ( )

References | Related Articles | Metrics

The (t,n) threshold ring signature could be generated by any t entities of n entities group on behalf of the whole group, while the actual signers remain anonymous. In order to design the threshold ring signature scheme with constant size, this paper presented an identity-based threshold ring signature scheme without random oracle by using bilinear pairing technique. In the end, the authors prove this scheme satisfy the unconditional signer ambiguity and existential unforgeability against selective identity, selective chosen message attack in terms of the hardness of Diffie-Hellman Inversion （DHI） problem.

Secure and efficient ID-based partially blind signature scheme

HE Jun-jie WANG Juan QI Chuan-da

2012, 32(05): 1388-1391.

Asbtract ( )

PDF (1994KB) ( )

References | Related Articles | Metrics

Partially blind signature allows signer to add some public information negotiated by signer and user to signature, and better solves the conflict between anonymity and controllability of blind signature. Utilizing the Shim's （SHIM K A. An ID-based aggregate signature scheme with constant pairing computations. The Journal of Systems and Software, 2010, 83(10): 1873-1880 ）ID-based signature scheme, a new provable secure ID-based partially blind signature scheme was proposed. The scheme was proved to be existentially unforgeable against adaptive chosen message and identity attacks in random oracle model, and the security was reduced to computational Diffie-Hellman assumption. Compared with other ID-based partially blind signature schemes in random oracle model, the proposed scheme has better computational efficiency and less communication.

Key management scheme based on composite design and identity encryption for clustered wireless sensor networks

ZHANG Min-qing FU Wen-hua WU Xu-guang

2012, 32(05): 1392-1396.

Asbtract ( )

PDF (2772KB) ( )

References | Related Articles | Metrics

The existing clustered key management scheme for Wireless Sensor Networks (WSN) has poor robustness, resilience of cluster head nodes and extensibility. This scheme took the composite design to construct the key subset of cluster in order to make all the nodes in the same cluster share a common key. The nodes in the same cluster took the Elliptic Curve Cryptography (ECC) to establish the pairwise key between the nodes, and the cluster head nodes of more energy took the identity-based encryption to establish the pairwise key between the cluster head nodes. In this scheme, the nodes could join and leave networks dynamically. The performance analysis shows that this scheme has good robustness, resilience of cluster head nodes and extensibility with lower communication overhead and storage cost.

Algorithm of abnormal flow identification based on dynamic Ｋ-layer features model

ZHENG Jian-zhong ZHENG Jian-rong

2012, 32(05): 1397-1399.

Asbtract ( )

PDF (1923KB) ( )

References | Related Articles | Metrics

This paper mainly addressed how to identify a mass of dada in NetFlow environment. It proposed an algorithm of abnormal flow identification based on dynamic K-layer feature model. With priority strategies, index table was opened reading the abnormal behavior and matching with eigenvalues one by one. When a match was done successfully, it was marked and the type of abnormal behavior was determined. The experimental result shows that it can identify the abnormal flow quickly and efficiently. It improves the efficiency of identification, and solves network security problems and achieves design goals.

Model of preventing URL attacks based on artificial immunity

QIN Guo-rong HE Tao CHEN Jian-gang

2012, 32(05): 1400-1403.

Asbtract ( )

PDF (2165KB) ( )

References | Related Articles | Metrics

For preventing URL （Universal Resource Locator） attacks, this paper proposed a model based on artificial immunity. Applying the self-protection mechanism of biological immune system to network security, through deploying resource safely, avoiding guessing primary key, requesting valid check and business exception check, this model prevented URL attack in different levels while responding to valid request normally and made the applications acquire the secondary immunity. This paper also proposed and analyzed the key technology of implementing the model: the algorithm of avoiding guessing primary key and an enhanced static password algorithm based on random number. This model has been applied to two practical applications. The test results and the practical applications confirm the effectiveness of the model.

Face recognition based on symmetrical kernel principal component analysis

LIU Song LUO Min ZHANG Guo-ping

2012, 32(05): 1404-1406.

Asbtract ( )

PDF (1997KB) ( )

References | Related Articles | Metrics

In order to improve the practicability of face recognition technology, a new face recognition method was proposed by adopting the facial mirror symmetry and Kernel Principle Component Analysis (KPCA). Firstly, the original images were decomposed by wavelet transform, and the low frequency components could be obtained. Then, the odd symmetry samples and the even symmetry samples were obtained by mirror transforming. Odd/even eigen vector were separately extracted through KPCA and fused to composite features by an odd-even weighted factor. A nearest neighbor classifier was used to classify the images. The proposed method was tested on the ORL face image database. The experimental results show the method can increase the sample capacity, overcome the effect of illumination and posture, and raise the recognition rate. Besides, in the comprehensive performance, it is better than contrast method.

GPU-based parallel implementation of FDK algorithm for cone-beam CT

HAN Yu YAN Bin YU Chao-qun LI Lei LI Jian-xin

2012, 32(05): 1407-1410.

Asbtract ( )

PDF (2157KB) ( )

References | Related Articles | Metrics

To improve the reconstruction speed of the FDK algorithm, this paper presented a fast algorithm based on the graphics processing unit (GPU). The method acquired higher computational efficiency through more careful optimization techniques, including reasonable mode of thread assigning, collecting and pre-computing the variables which were irrelevant with the voxel and the decreasing of number of global memory accesses. The simulation results show that while the fully optimized algorithm makes no precision reduction, the reconstruction time for 2563 is only 0.5 seconds and for 5123 is only 2.5 seconds, which is a big advance in comparison with the latest research findings.

Storage performance analysis and optimization of NENO system on TH-1A computer

ZHU Xiao-qian SUN Chao MENG Xiang-fei ZHANG Bao FENG Jing-hua

2012, 32(05): 1411-1414.

Asbtract ( )

PDF (2049KB) ( )

References | Related Articles | Metrics

A concurrent processes grouping output method was proposed to address the problem that storage performance decreases when testing Nucleus for European Modeling of the Ocean (NEMO) system with massive processes on TH-1A supercomputer. This method designed a reasonable control strategy based on TH-1A architecture and split processes into groups to alleviate the process competition of concurrency I/O. Testing result shows that the storage performance of the GYRE012 global sample can be improved more than 33% using the optimization method of concurrent processes grouping output, and in the mean time the total performance can be improved about 28%.

Atmospheric monitoring network system based on cloud computing

CHEN Lin QI Wen-xin QI Yu

2012, 32(05): 1415-1417.

Asbtract ( )

PDF (1722KB) ( )

References | Related Articles | Metrics

In order to solve the problems of high hardware cost and information isolated island in the constructing and operating of atmospheric monitoring network system, this paper proposed an atmospheric monitoring network system based on Microsoft's Windows Azure cloud computing platform. This system provided access for automatic weather stations by General Packet Radio Service (GPRS) network technology, adopted Microsoft's Blob, Table storage and SQL Azure database to store massive data, developed and established Web portal on Windows Azure platform with ASP.NET and Flash technology, realized a unified access platform for users. The results demonstrate that this system can effectively solve the problem and create constructive value for establishing atmospheric monitoring network system in various ranges.

Task allocation based on ant colony optimization in cloud computing

ZHANG Chun-yan LIU Qing-lin MENG Ke

2012, 32(05): 1418-1420.

Asbtract ( )

PDF (1547KB) ( )

References | Related Articles | Metrics

Concerning the defects of the Ant Colony Optimization (ACO) for the task allocation, a grouping and polymorphic ACO was proposed to improve the service quality. The algorithm, which divided the ants into three groups: searching ants, scouting ants and working ants, with the update of forecast completion time to gradually get the minimum of the average completion time and to decrease the possibility of generation to local optimum, was emulated and achieved with Cloudsim tookit at last. Results of the experiment show that the time of handling requests and tasks of this approach has been reduced and the efficiency of handling tasks gets improved.

Communication control strategy of distributed and heterogeneous data synchronization based on SOA

2012, 32(05): 1421-1424.

Asbtract ( )

PDF (2128KB) ( )

References | Related Articles | Metrics

Analyzing the synchronization characteristics of distributed heterogeneous data, a synchronization model WLDSS (Web-level Data Synchronization System) of distributed heterogeneous data based on Service-Oriented Architecture (SOA) was designed. The stability control strategy of heterogeneous data synchronous communication based on availability calculation is drew out and the system performance was also analyzed. Experimental data show that the strategy adopted by the model can take the initiative to adapt to various system performance characteristics and can effectively improve the synchronization efficiency of distributed heterogeneous data.

Construction technology of cluster message-oriented middleware

CHEN Bing-xin QIU Bao-zhi

2012, 32(05): 1425-1428.

Asbtract ( )

PDF (2099KB) ( )

References | Related Articles | Metrics

In order to enhance the communication efficiency of distributed heterogeneous system, a clustering-based message-oriented middleware construction technology was proposed, which described the protocols by exploiting the EPr/TN net formally. Accordingly, clustering method was used to deal with the protocols, which obtained the greatest similarity cluster. And then, the protocol clusters were used to construct message-oriented middleware. Compared to the traditional message-oriented middleware, the new technology can not only effectively transform heterogeneous communication protocols, but also reduce the search times of protocol mapping, as well as enhancing the communication efficiency of distributed heterogeneous system.

Application of memory-mapped file to extract modal data from results of finite element analysis

SHAN Guang LING Ling HU Yu-jin

2012, 32(05): 1429-1431.

Asbtract ( )

PDF (2128KB) ( )

References | Related Articles | Metrics

Concerning the problems of low running speed and no response that are very likely to occur when using the common file manipulation function to dispose the large-scale result file exported from Finite Element Analysis (FEA) software, a method of data reading and writing based on memory-mapped file was proposed. By establishing the relation between disk file and process address, the file could be accessed directly to extract the data information. When the data information was very large in size, a method of piecewise map was applied to dispose the disk file, and two different forms of piecewise map were compared. Compared with the traditional method, the result shows that the proposed method can improve the speed greatly and be applied to huge text file effectively.

QoS computing method for Web services composition based on topological sequence reduction

LI Xing-fang YUAN Ying-chun WANG Ke-jian

2012, 32(05): 1432-1435.

Asbtract ( )

PDF (2213KB) ( )

References | Related Articles | Metrics

In this paper, considering the Web service composition model described by DAG (Directed Acrylic Graph), a new Quality of Service (QoS) computing method for the composition service based on topological sequence reduction (QCMTSR) was proposed. Based on the basic structures and their QoS computing formulas of iterative reduction method two kinds of basic structures (i.e. serial reduction structure and parallel reduction structure) were defined in graph DAG, and their QoS calculation formulas were also given. During accessing each node step by step in the topology sequence for DAG. Repeating this process until the last node in this queue, then the QoS measure results of the last node were the computing results of the composition service. It has been proved that the algorithm can be applied to all the composition services described by DAG, and the experimental results show that the algorithm QCMTSR is more accurate in the measurement of reliability and availability.

Software reliability prediction based on learning vector quantization neutral network

QIAO Hui ZHOU Yan-zhou SHAO Nan

2012, 32(05): 1436-1438.

Asbtract ( )

PDF (2240KB) ( )

References | Related Articles | Metrics

The application of traditional software prediction model has poor generalized performance. This paper put forward a software reliability prediction model based on Learning Vector Quantization (LVQ) neural network. First, this paper analyzed the structure characteristics of LVQ neural network and its relation with software reliability prediction. Then the network was used to predict the software reliability. In the end, the authors confirmed the algorithm through multiple simulation experiments under the Matlab environment and the data from Metrics Data Program (MDP) database of National Aeronautics and Space Administration （NASA） of USA. The experimental results indicate that the method is feasible and has a higher prediction precision than the traditional software prediction method.

Customer classification of E-commerce based on improved RFM model

XU Xiang-bin WANG Jia-qiang TU Huan MU Ming

2012, 32(05): 1439-1442.

Asbtract ( )

PDF (2045KB) ( )

References | Related Articles | Metrics

It is essential to classify E-commerce customers accurately and take suitable marketing strategy for the development of E-commerce. Based on the RFM (Recency,Frequency,Monetary) model used in customer classification of traditional retail, the total profit attributes were introduced to set RFP model and K-Means clustering method was used to analyze customers of a firm in E-commerce and compared with the RFM model. The relevance of model attributes impact on clustering results was analyzed. Finally, the paper gets six conclusions about the comparison between the both models and puts forward four strategies for E-Commerce and other sales industries.

Transient faults recovery and control on wireless tunnel construction monitoring systems

ZUO Ze-hua HUANG Xiong-feng QIN Yuan-qing ZHOU Chun-jie

2012, 32(05): 1443-1445.

Asbtract ( )

PDF (1742KB) ( )

References | Related Articles | Metrics

Using the wireless monitoring technology in tunnel construction can reduce the network cabling and increase the system flexibility. But the complexity and variability of the tunnel construction environment and the instability of the sensor nodes' software and hardware often lead to the transient faults, even cause security accidents. Against the transient faults, in order to ensure the system functions, a multi-level transient fault recovery and control strategy was proposed, which dealt with the transient faults in four layers: the spot data monitoring layer, the data transport layer, the security protection layer and the emergency response layer. The simulation results indicate that the proposed strategy can improve the accuracy of hazard detection and the execution efficiency of commands execution, beneficial to ensure the safety of constructors.

Common virtual wind speed sensors for wind farm based on finite impulse response neural network

SU Yong-xin LUO Pei-yu DUAN Bin

2012, 32(05): 1446-1449.

Asbtract ( )

PDF (2171KB) ( )

References | Related Articles | Metrics

Wind speed sensors of wind turbines has high fault rate, those faults may lead wind turbines into safety risks and energy production loss. However, many current methods of improving reliability of wind speed information face the challenges of high cost or high error. A virtual wind speed sensor based on spatial correlation was presented in this paper. Its key character is generating a downwind turbine's logic wind speed based on a special upwind turbine's real wind speed. The calculation mode of logic wind speed just need the outputs of the existed wind speed and direction sensors. A FIR (Finite Impulse Response) neural network computing model was proposed for deal with the complexity of logic wind speed calculating. Moreover，key technologies were discussed for building the virtual wind speed sensor system. The logic wind speed generated by virtual sensor can be used for providing reliable wind speed information input to a turbine controller. The approach presented in this paper is applicable to wind turbines of any type in wind farms.

Design and implementation of fall detection system using tri-axis accelerometer

2012, 32(05): 1450-1452.

Asbtract ( )

PDF (2140KB) ( )

Table of Content