Table of Content

01 May 2009, Volume 29 Issue 05

Previous Issue    Next Issue

Network and communications

Automatic detection of shared fragments model

2009, 29(05):  1197-1200. 

Asbtract ( )   PDF (584KB) ( )  

Related Articles | Metrics

A model of automatic online detection of shared fragments was described including its architecture and implementation schemes. Besides, a scalable algorithm for detecting shared fragments was proposed. The online detection algorithm could run automatically in the model. The model took the Web pages that were more popular than others as detection objects, and could get a set of maximal shared fragments from a large collection of Web pages. Experimental results show that it not only provides veracity of detection but also improves the efficiency.

WMN QoS routing strategy based on interference model

2009, 29(05):  1201-1203. 

Asbtract ( )   PDF (645KB) ( )  

Related Articles | Metrics

To support multimedia applications in Wireless Mesh Networks (WMN)，the authors proposed an interference-based Quality-of-Service (QoS) routing strategy named WQRI. This strategy first stratified WMN and then proposed novel methods to estimate the available bandwidth and end-to-end delay. It achieved reliable admission control and resource reservation. Simulation results indicate that WQRI can provide QoS support for real-time applications at lower control packet overhead.

Fair scheduling algorithm in IEEE 802.16e system

2009, 29(05):  1204-1207. 

Asbtract ( )   PDF (596KB) ( )  

Related Articles | Metrics

IEEE 802.16e，standard of wireless metropolitan area networks, defines the structure of Quality of Service (QoS), and divides all services into five scheduling types. But it does not define detail-scheduling algorithm of QoS. An algorithm was proposed here to schedule resources in different service types, and divide all service flows into three states: leading, synchronal and lagging. It also used two-phase extra-bandwidth allocation policy and compensation strategy according to the service flows' type and state. Simulation results indicate that the resource utilization efficiency is improved, and the fairness is guaranteed well.

Maximized lifetime model and its solution of layer-based sensor networks

2009, 29(05):  1208-1210. 

Asbtract ( )   PDF (456KB) ( )  

Related Articles | Metrics

On the basis of rectangular deployment field, the authors proposed a layer-based model to maximize the lifetime of sensor networks which met the connectivity coverage constraints, and a non-uniform node deployment algorithm for sensor networks. The width of the layer was decided by node energy consumption. Also, the number of nodes in every layer was determined. Simulation results show that layer-based non-uniform node deployment algorithm can effectively extend the lifetime of the sensor networks.

Adaptive routing algorithm for multi-channel wireless mesh networks

2009, 29(05):  1211-1213. 

Asbtract ( )   PDF (524KB) ( )  

Related Articles | Metrics

Concerning the optimization problem of network capacity in wireless mesh networks, the author proposed an adaptive routing algorithm, based on mathematical model of network capacity optimizing, by formulating routing problem as linear program in the wireless mesh networks. The algorithm routed the communication traffic by changing routing stretch factor and load balancing ratio adaptively based on network topology structure and the characteristic of traffic requests to improve the total networks throughput. Simulation results show that the algorithm can significantly improve network capacity.

New model of OBS network traffic based on wavelet

2009, 29(05):  1214-1217. 

Asbtract ( )   PDF (634KB) ( )  

Related Articles | Metrics

Recently the studies have found that real network traffic has the fractal characteristic, and it has great impact on the performance of traffic. With the convergence traffic of OBS network edge node, the author proposed a new model based on the wavelet transform under the multi-fractal condition. Different from the common fractal model, the new model considered not only the optimal of the scale factor in wavelet transform but also real network environment (such as buffer size, utilization and so on). Experimental results prove that the performance of traffic does not just relate with correlation, but also with the network environment. Finally, scale depiction and performance evaluation of traffic verify the effectiveness of the model.

Feature interactions detection in SCML

2009, 29(05):  1218-1221. 

Asbtract ( )   PDF (596KB) ( )  

Related Articles | Metrics

An approach for detecting feature interactions in Service Creation Markup Language (SCML) scripts was presented. It used a logic representation of SCML scripts and its detection rules were based on logical deduction. The Service Creation Formal Specification Language (SCFSL) was introduced to express the intentions of SCML scripts in logic format. A method for translating SCML into SFSL was put forward. The rules addressed both interactions within a single script and interactions between two scripts. An automatic feature interaction detection tool based on SCFSL was implemented to facilitate the deployment of Next Generation Network (NGN) service.

Test and analysis of network prototype for micro communication-element

2009, 29(05):  1222-1224. 

Asbtract ( )   PDF (497KB) ( )  

Related Articles | Metrics

The Micro Communication-Element System (MCES) based on Service Unit Network Architecture （SUNA） embodies a new trend in network designing. It is worthy of study to test the efficiency of the network prototype of MCES in progress, and then to check the feasibility and validity of SUNA. The author discussed the approaches and processes in testing the network prototype of MCES and made necessary analysis of the results, which indicated that SUNA and MCES were reliable and feasible.

QoS guarantee of the information delivery in publish/subscribe paradigm

2009, 29(05):  1225-1229. 

Asbtract ( )   PDF (914KB) ( )  

Related Articles | Metrics

Reliable information delivery to subscriber in publish/subscribe paradigm is the key to Quality of Service (QoS) guarantee of the system. However current researchers have not resolved this problem adequately. The author took the non- determinism introduced by decoupling on time dimension as starting point. In temporal analysis method, the principles of QoS guarantee for the information delivery in the paradigm were surveyed. After defining the reliability of delivery information, the author concentrated on the effect of the active interval of subscription, and the delay of subscription, and the delay of publication diffusion on QoS of the information delivery. Then the author provided liveness property of distributed notification service for ensuring the QoS, and devised a publish/subscribe broker to ensure the QoS. The result of analysis shows that the computational property provided here is vital to guarantee QoS of the information delivery, and QoS of the information delivery can be ensured by reliable distributed notification service.

Research on new evolution model of scale-free network

2009, 29(05):  1230-1232. 

Asbtract ( )   PDF (428KB) ( )  

Related Articles | Metrics

A new evolution model of scale-free network for the recognition of interim node effect was proposed concerning the limitations of the usual B-A model and the phenomenon generally existing in the real scale-free network. Firstly, the description and definition of the interim node effect were given. Then the generation algorithm for the interim node effect model was presented, and the theoretical analysis of the nodes' degree distribution of the model was given and proved in simulation. Simulation results show that the new model still inherits the scale-free feature but matches the evolving process of scale-free networks much better than the usual B-A model in terms of the power-law exponent, the clustering coefficient and the average path length.

Survey of channel assignment for multi-radio multi-channel wireless networks

2009, 29(05):  1233-1237. 

Asbtract ( )   PDF (1046KB) ( )  

Related Articles | Metrics

The concepts and characteristics of multi-radio multi-channel networks were introduced, the relevant problems and design objectives for channel assignment were summarized. The fundamental mechanism of each current representative channel assignment algorithm was analyzed in detail, and the certain defects exiting among them were pointed out. Finally, the further research strategies and the development tendency on channel assignment were proposed.

Adaptive blind equalization for ultra wideband system

Xiao-Lin Shi

2009, 29(05):  1238-1240. 

Asbtract ( )   PDF (438KB) ( )  

Related Articles | Metrics

A new adaptive blind equalization technology was proposed for Direct Sequence-Ultra WideBand (DS-UWB) and Time-Hopping-Ultra WideBand (TH-UWB) wireless communication systems. This method can effectively track the variation of Ultra WideBand (UWB) channels by using the variable forgetting factor to the adaptive algorithm and thus can compensate the interference due to the properties of channels. When receiving the signals, it can adjust the coefficients of equalizers without using the training sequence and then obtain the estimation of the sent signals. Furthermore, this method has relatively rapid convergence rate and good stability. Simulation results show that the proposed method has better performance in tracking UWB fading channels and it also help obtain lower Bit Error Rate (BER).

ARQ protocol based on time delay in half-duplex HF data communication

2009, 29(05):  1241-1243. 

Asbtract ( )   PDF (413KB) ( )  

Related Articles | Metrics

After having analyzed the channel character of high frequency communication, an advanced ARQ protocol based on time delay was proposed. It reduced the time required for transmission, and improved the communication efficiency, therefore, achieved the time limitation of data communication in half-duplex mode. Finally, the emulation and the concrete method were presented.

Monitor technique with high flow of data packets in Linux

2009, 29(05):  1244-1250. 

Asbtract ( )   PDF (708KB) ( )  

Related Articles | Metrics

The principle of packet monitor to handle high volume packets using the underlying library Libpcap capture in Linux operation system was studied. Network Interface Card (NIC) was used to capture data in bypass monitor to carry out pre-processing. Semi-polling with New API (NAPI) was also used to speed up the processing of packets in input buffer. Finally the queuing theory was used to ensure the optimal bandwidth value and relevant parameters were set to achieve the best efficiency. Experimental results demonstrate that the scheme not only increases the rate of packet capture, but also improves the occupancy rate of system resources in many figures significantly.

Fault detection for network control system based on equally divided sampling period

2009, 29(05):  1248-1250. 

Asbtract ( )   PDF (393KB) ( )  

Related Articles | Metrics

Considering a class of network control system with time delays, the fault detection was carried out when the output delays were present. By increasing sampling frequency in controller and equally dividing the sampling period of the sensor, the time delays could be approximated to several times of the sampling period of the controller. On this basis, the error equation of the fault observer was constructed based on a discrete asynchronous dynamical system. And a linear matrix inequality decided the stability condition of this observer. When the system is normal and the given inequality condition is satisfied, the observer system is stable. When a fault is present, the observer residue can change rapidly and the occurrence of the fault can be detected. Finally, an illustrative example was given to demonstrate the effectiveness of the proposed method.

Artificial intelligence and advanced computing

Grammatical parsing algorithm based on expected categories

2009, 29(05):  1251-1253. 

Asbtract ( )   PDF (552KB) ( )  

Related Articles | Metrics

Chart algorithm is one of the most popular algorithms in grammatical parsing. Its computational efficiency, however, still needs to be improved. By analyzing two common used Chart algorithms, a new parsing algorithm was proposed based on the bottom-to-top Chart algorithm, combining with the predicating ability of the top-to-bottom Chart algorithm. The proposed algorithm executed exactly from left to right and bottom to top. At each word position in parsing, an expecting table was formed according to the active roles of existing active arcs and the grammatical rules, and was used to restrict the creating of arcs in the rest process of parsing. Experimental results show that the parsing speed improves about 24% compared with the standard Chart algorithm, meanwhile the number of the failed sentences reduces more than a half.

Evolutionary strategy algorithm based on bi-group

2009, 29(05):  1254-1260. 

Asbtract ( )   PDF (605KB) ( )  

Related Articles | Metrics

Aiming at the problems of premature convergence and slow convergence of traditional evolution strategy，a Modified Evolutionary Strategies (MES) algorithm based on bi-group was proposed. In the new algorithm，the group was divided into two sub-groups，general sub-group and elite sub-group. The size of general sub-group was larger than the size of elite sub-group，in which the best individuals were stored. Evolution of the two sub-groups was parallel performed with different mutation strategies respectively，and then the group could not only explore the solution space separately，but also searched the local part in detail. Performance of this algorithm was analyzed in theory. Experimental results demonstrate that the MES algorithm is more efficient to improve convergence speed and avoid premature convergence than classical evolution strategies.

Blind deconvolution based on improved genetic algorithm

2009, 29(05):  1257-1260. 

Asbtract ( )   PDF (641KB) ( )  

Related Articles | Metrics

Concerning the multi-variable solution, slow convergence and easily falling into a local optimum in time-domain blind deconvolution, a "monitoring strategy" was proposed in order to prevent from local convergence of genetic algorithm. At the same time，some of the key technologies of the general genetic algorithm，such as crossover probability and mutation probability，were designed correspondingly so that the algorithm could automatically jump out of the local optimum solution，and rapidly converge in the global optimum solution. Separation criteria based on minimum mutual information of time-domain blind deconvolution was obtained on the basis of probability density estimation. That separation criterion used as algorithm optimization standard of genetic algorithm，time-domain blind deconvolution was realized quickly. By using Matlab software to simulate, the effectiveness of time-domain algorithm proposed is confirmed.

Bilevel optimization based multi-model modeling method for nonlinear systems

2009, 29(05):  1261-1263. 

Asbtract ( )   PDF (452KB) ( )  

Related Articles | Metrics

With reference to the multi-species partition and the hierarchy evolutionary, a bilevel optimization based multiple-model modeling method was introduced to deal with the modeling problem of nonlinear systems. The multiple-model modeling problem was transformed to a bilevel optimization problem, with the optimal partition being realized by means of the multi-species at the upper levels, and the parameters of each local model in the species being optimized at the lower levels, which effectively avoided the local minimum problem caused by the simultaneous optimization of multiple parameters. Finally, the Particle Swarm Optimization (PSO) algorithm was employed to solve the problem, and a simulation example indicated the effectiveness of the proposed modeling method.

Hybrid algorithm based on cultural algorithm and modified differential evolution algorithm

2009, 29(05):  1264-1269. 

Asbtract ( )   PDF (567KB) ( )  

Related Articles | Metrics

Modified differential evolution algorithm can not make effective use of knowledge about evolutionary information, and traditional cultural algorithm converge slowly because only mutation operation is adopted in population space. To solve these problems, a new hybrid optimization algorithm was proposed based on cultural algorithm and modified differential evolution algorithm. It was applied to constraint solving. Simulation tests were performed based on benchmark functions and the production scheduling problem of butene alkylation. The results indicate that the proposed algorithm is practicable and effective. Compared with other algorithms, it is superior in optimizing efficiency and results, and reduces the computational cost.

Ant colony algorithm based on mind evolution

2009, 29(05):  1267-1269. 

Asbtract ( )   PDF (480KB) ( )  

Related Articles | Metrics

The basic ant colony algorithm is easy to fall in local peak. In order to overcome this shortcoming resulting in the precocity and stagnation, a new kind of ant colony algorithm based on mind evolution was proposed. The detailed realization of the method was illustrated and some examples of the traveling salesman problem were computed. Simulation results prove that the new algorithm is effective and feasible.

Two series of similarity measures between Vague sets

2009, 29(05):  1270-1272. 

Asbtract ( )   PDF (414KB) ( )  

Related Articles | Metrics

An axiomatic definition of similarity measures between Vague sets was introduced. Using operation of min and max of fuzzy sets, considering in favor of and against and their weights about Vague value, applying the transformation of Vague values, the series of similarity measures between Vague sets based on three-dimensional representation were presented. Application examples show that these formulas are useful.

Multi-criteria decision-making based on intuitionistic fuzzy sets geometric operators

2009, 29(05):  1273-1352. 

Asbtract ( )   PDF (567KB) ( )  

Related Articles | Metrics

Some operation laws of triangular and interval-valued fuzzy sets were defined. Two amelioration operators were developed, such as the triangular intuitionistic fuzzy numbers weighted arithmetic average (FIFWAA) operator, and the f interval-valued intuitionistic fuzzy numbers weighted geometric average (FIFWGA) operator. On this basis, the problem that score function can not give decision-making was solved by accuracy function in order to ensure the security and rationality of score function. An approach for solving uncertain multiple attribute decision-making problem was given, in which the attribute weights were not completely certain and the attribute values were triangular and interval-valued fuzzy numbers. An illustrative example proves the effectiveness and correctness of multiple-criteria decision-making with intuitionistic fuzzy sets.

Task scheduling algorithm based on resources grey prediction feedback

2009, 29(05):  1276-1304. 

Asbtract ( )   PDF (548KB) ( )  

Related Articles | Metrics

In order to achieve load balance in task scheduling under the grid environment, in view of the resources' autonomy, isomerism and distribution under this circumstance, a model of resources real-time prediction was designed based on improved GM (1, 1) prediction method, which could get satisfied load balance with smaller expenditure. The task scheduling algorithm named RGP-FB based on resources prediction model integrated the dynamic forecast into the grid environment under the task scheduling strategy, then it could enhance the comprehensive efficiency of the scheduling system. Simulation results show that the algorithm is valid and effective.

Information security

Approach to intrusion detection model based on biological memory principles

2009, 29(05):  1279-1284. 

Asbtract ( )   PDF (950KB) ( )  

Related Articles | Metrics

The principles of memory storage, update and forget in biological memory were employed; a model of intrusion detection based on biological memory principles was established. In the model, the characteristics of fast attenuates and update and being sensitive to outside information of instantaneous memory were used to detect abnormal data promptly and prevent intrusion at an early time. The short-term and long-term memory can adjust memory intensity with anomalous accesses, and interconvert with each other that attempts to achieve maximum effect. The short-term memory capacity restricting and memory bank update automatic theory were used to save resources consumption of intrusion detection system so as to store important information by more space. An application shows that the model can track the latest development in real-time, selectively update or forget old data and make a prompt, efficient and precise judgment in virtue of the memory bank.

Fast DBNS scalar multiplication algorithm based on halving operation

2009, 29(05):  1285-1292. 

Asbtract ( )   PDF (673KB) ( )  

Related Articles | Metrics

To raise the efficiency of scalar multiplication on elliptic curve, a scalar multiplication algorithm based on double base number system over binary field was improved. Firstly a fast direct computing 3^kP algorithm in field was deduced, which only needed one inversion; the new double base number chain based on 1/2 and 3 could be integrated with high-speed direct computing 3^kP and halving algorithm. Scalar multiplication based on the new chain only employed point addition, halving algorithm, triplication and direct computing 3^kP. Thus the complexity was depressed and the efficiency was improved about 70% over Dimitrov algorithm and about 10% over Wong method on the elliptic curves recommended by NIST.

Context-aware semantic-based access control model for semantic Web

SHEN Hai-Bo

2009, 29(05):  1289-1292. 

Asbtract ( )   PDF (591KB) ( )  

Related Articles | Metrics

The access decision should take into account the semantic relationships among entities and contexts under this environment when accessing to resources on the semantic Web, but traditional access control models fail to do it. By combining Ontology-based semantic representation technology with SWRL rule-based reasoning mechanism, and reducing different semantic interrelations to the subsumption relation, a Context-aware Semantic-based Access Control (CSBAC) model for the semantic Web was presented, and its semantic authorization inference, authorization propagation and conflict resolution were discussed. In the end, a structure for implementing the CSBAC model was proposed.

Image scrambling effect evaluation method based on mutual information distance of difference image

2009, 29(05):  1293-1300. 

Asbtract ( )   PDF (808KB) ( )  

Related Articles | Metrics

The new image scrambling effect evaluation method based on mutual information distance of difference image was proposed. The new concept of mutual information distance based on mutual information was firstly proposed, and then the difference image of the original image and scrambled image was obtained by means of difference operation on two images. At last the mutual information of two difference images was computed and acted as the new criteria of image scrambling effect evaluation. Experimental results show that the proposed method is effective to describe the relation between the scrambling effect and the number of iterations in the scrambling techniques, which is largely consistent with human vision. For different images, when some transformation is used, this evaluation method can reflect to some extent the scrambling effects in each scrambling stage.

XML signature based on IBS without trusted third-party

2009, 29(05):  1297-1300. 

Asbtract ( )   PDF (626KB) ( )  

Related Articles | Metrics

Based on the Public-Key Infrastructure (PKI) system and asymmetric encryption algorithm, the traditional XML signature has many drawbacks such as complex management process and high computational cost. By the research of XML signature syntax and Identity Based Signature (IBS) scheme without a trusted third-party, the author realized a new XML signature based on the above IBS system and Weil pairing correspondingly，and designed the corresponding XML signature process and structure of XML signature according to the XML signature syntax. The new XML signature overcomes the drawbacks of traditional signature based on the PKI with good security and high efficiency.

Information-hiding scheme with high capacity based on double-random phase-encoding technique

2009, 29(05):  1301-1304. 

Asbtract ( )   PDF (631KB) ( )  

Related Articles | Metrics

A double-random phase-encoding technique based information-hiding scheme was improved for high capacity information hiding. The hidden image was encoded with double-random phase-encoding technique and embedded into the enlarged host image to obtain the composed image. The superposition method to embed the encoded image was different from the original method, which could increase the information hiding capacity. In addition, compared with the original method, the quality of the composed image was improved, while the quality of the recovered hidden image was maintained. Also, the security of the method was enhanced markedly. Theoretical analysis and experimental results demonstrate the effectiveness of the improved scheme.

Method for trust computation based on behavior risk evaluation

2009, 29(05):  1305-1307. 

Asbtract ( )   PDF (509KB) ( )  

Related Articles | Metrics

Risk and trust are key factors impacting on the security decision-making in the distributed and dynamic environments. According to information risk evaluation theory, the author proposed a method for trust computation based on behavior risk evaluation. The proposed method described risk quantification method by identifying and quantifying the significance of assets and the criticality of threats from the behaviors of entities, and designed trust computation methods based on the quantified risk. Experimental results show that the proposed method can correctly identify the changing risk implied in the behaviors of entities, and compute trust based on the changing risk. It can provide objective reference for the system to correctly control the follow-up behaviors of entities.

Survey of trust management in mobile Ad Hoc networks

2009, 29(05):  1308-1311. 

Asbtract ( )   PDF (648KB) ( )  

Related Articles | Metrics

Mobile Ad Hoc networks, composed of mobile wireless nodes, are particularly vulnerable due to their features of open medium and dynamically changing topology. Trust management is the scheme for building trust between nodes in mobile Ad Hoc networks and it is the security base of mobile Ad Hoc network. The state of the art in trust management of mobile Ad Hoc networks was surveyed. Firstly, the characteristics of trust relationship in mobile Ad Hoc network and different types of trust management in mobile Ad Hoc network were analyzed. Secondly, some typical trust management schemes were reviewed. A comparison and discussion of their respective merits and faults was made at the same time. Finally, the challenges worthy of further research in this area were presented.

Semantic clustering-based attack detection model on CF-based recommender systems

2009, 29(05):  1312-1320. 

Asbtract ( )   PDF (765KB) ( )  

Related Articles | Metrics

Collaborative recommender systems have been widely used in E-commerce environment. Because this recommendation technology is very sensitive to user's profile, an attacker can affect the prediction by injecting a lot of biased users' profiles. Therefore, the author proposed a semantic clustering-based attack detection model on CF-based recommender systems, which mined the potential interest combination by analyzing the semantics of items in the transaction database. The proposed model judged the truth of a user's profile by detecting the randomness in a user's data. Extensive experiments demonstrate that the proposed model can effectively detect the "profile injection" attacks in CF-based recommender system, which can significantly improve the robustness and reliability of the whole system.

Improved route packet marking tracking scheme

2009, 29(05):  1316-1320. 

Asbtract ( )   PDF (726KB) ( )  

Related Articles | Metrics

A packet marking scheme to traceback the source of distributed denial of service based on Chinese remainder theorem was proposed. The algorithm labeled the IP block based on the uniqueness of the Chinese remainder. It is of relatively simple calculation and effective to avoid Hash collision. A victim does not need to maintain the network topology while it tracebacks attack paths with fewer packets and less time. The scheme tracebacks attack paths with less false combination and higher computing speed than others when the environment undergoes relative more attacks. The simulation results show that the scheme has good performance in the trackback of DDoS attacks.

Grid resource scheduling model based on risk evasion

2009, 29(05):  1321-1323. 

Asbtract ( )   PDF (493KB) ( )  

Related Articles | Metrics

Scheduling reliability not only depends on resources but also environment of correlation task and resource in grid. For the reliability problem, the author considered the influence of environment as risk, and proposed a risk model based on network congestion, virus alarm signal and system reliability and its risk infrastructure. The risk evasion scheduling algorithm of the model was put forward based on trust degree. Experiments show that the risk evasion scheduling algorithm is efficient in reducing risk and significantly improves the success rate of the scheduling.

Crop-resistant digital watermarking for image based on structured coding

2009, 29(05):  1324-1326. 

Asbtract ( )   PDF (447KB) ( )  

Related Articles | Metrics

A digital watermarking algorithm based on the accessorial information was proposed to resist cropping attack. The algorithm coded watermark with structured coding, and made the digital watermarking possess the identifying function. The embedding and extracting strategies were designed too. Experimental results show that the algorithm has good extracting effect and the fast speed, and can resist cropping attack and some routine attacks effectively.

Preimage attack on step reduced hash function HAVAL

2009, 29(05):  1327-1329. 

Asbtract ( )   PDF (411KB) ( )  

Related Articles | Metrics

According to the order of the message words in HAVAL algorithm and the property of the function in the first pass, a preimage attack of the compression function from step 3 to step 122 was proposed by using "meeting-in-the-middle attack" and the exhaustive search method. The preimage attack on the 120-step reduced compression function was extended to the preimage attack on the 120-step reduced HAVAL by using "meeting-in-the-middle method" and the tree method respectively.

Efficient certificateless signature scheme based on bilinear parings

2009, 29(05):  1330-1333. 

Asbtract ( )   PDF (614KB) ( )  

Related Articles | Metrics

Due to eliminating the inherent key escrow in identity-based cryptosystem, the certificateless public key cryptosystem came into being. A new efficient certificateless signature scheme based on bilinear pairing was put forward. The signing algorithm did not need any pairing computation but need one exponentiation computation, and the verification algorithm only needed one pairing and one exponentiation computation. The new scheme is more efficient than other exsiting schemes in terms of computation overhead. Furthermore, the security relies on the hardness of the q-Strong Diffie-Hellman （q-SDH） problem and Inverse-Compute Diffie-Hellman （Inv-CDH） problem. Under the random oracle model, the new scheme is proved to be secure against existential forgery on adaptively chosen message attack.

[a, b]-shrinking generator

2009, 29(05):  1334-1338. 

Asbtract ( )   PDF (426KB) ( )  

Related Articles | Metrics

A new construction of a new generator, called the ［a, b］-shrinking generator was investigated based on two Linear Feedback Shift Registers (LFSR). The period, linear complexity, weight complexity and the numbers of element of 1 and 0 of the output sequence of the ［a,b］-shrinking generator were proved. Both the theoretic and the experimental results of local randomness tests show that the ［a, b］-shrinking generator is suitable for stream cipher cryptosystems.

Improved fuzzy C-means clustering algorithm and its application to intrusion detection

2009, 29(05):  1336-1338. 

Asbtract ( )   PDF (418KB) ( )  

Related Articles | Metrics

Concerning the limits of the Fuzzy C-Means (FCM) clustering algorithm, a new kind of improved algorithm with two stages was put forward. The objective function in FCM clustering algorithm was improved by taking into account the modulus of dot density function and the weight of eigenvector; furthermore, the iterative reasoning formula and the description of algorithm were presented. This algorithm solved the problems of the sample's unequal distribution and the eigenvector of the sample contributing unevenly to the classes, which improved the clustering precision effectively. Experiments on data sets KDD CUP 99 show that the algorithm has good reliability and feasibility.

Graphics and image processing

Learning-based nonlinear algorithm of face image super-resolution

2009, 29(05):  1339-1341. 

Asbtract ( )   PDF (532KB) ( )  

Related Articles | Metrics

A super resolution algorithm for single face image based on learned image examples was proposed. The algorithm used patch-based Markov network to express the mechanism of super-resolution processing. After dividing the high-resolution images and the corresponding low-resolution ones into patches, the training dataset was set up. Considering the requirements of Markov network computing and the difference among the images in training dataset, a patch position constraint operation for searching the matched patch and a nonlinear searching algorithm were used. These techniques decreased the complexity of the searching operation and increased the effect of matching. After collecting the matched high-resolution patches, the proposed method directly used them to integrate an output image. Experimental results demonstrate that the approach has better performance and higher efficiency.

Fast and simple vehicle logo location method

2009, 29(05):  1344-1348. 

Asbtract ( )   PDF (795KB) ( )  

Related Articles | Metrics

Simple appearance of the vehicle cannot be used for vehicle type recognition because of the different view angles, but vehicle logo can be used. The authors proposed a fast and simple method for vehicle logo location. Firstly, the vehicle license in front of the vehicle body could be roughly located by the texture of it, and then the position of the vehicle logo could be roughly found by taking account of the symmetrical prior knowledge. After that, the vehicle logo could be exactly detected by edge feature and morphology operation. Taking into account all kinds of noise, as well as the impact of morphology, template matching was used for precision positioning and rough identification. Experimental results prove the effectiveness of the proposed method.

Improved LSB steganography based on scanning correlative degree

2009, 29(05):  1349-1352. 

Asbtract ( )   PDF (583KB) ( )  

Related Articles | Metrics

The adjacent pixels sequence of natural images has the correlation. Based on the statistical character, the concept of scanning correlative degree was proposed. Secret information embedded asymmetrically made the correlative degree of adjacent pixels sequence of carrier image reduced, especially the correlative degree of some local image may saltate. This phenomenon enhanced the risk of secret information being detected. Then an improved method of Least Significant Bit (LSB) was presented. Secret information could be embedded into carrier images symmetrically, and some areas of image which saltated were smoothed through expectation of adjacent pixels. Experiment results show that the new algorithm significantly reduces the saltation of correlative degree.

Image restoration parallel algorithm using anisotropic diffusion equation based on pixels pre-judgment

2009, 29(05):  1353-1358. 

Asbtract ( )   PDF (477KB) ( )  

Related Articles | Metrics

Based on the idea of anisotropic diffusion equation，a new efficient parallel algorithm model, which used the concept of pixels pre-judgment to restore images, was proposed. This model made full use of the pre-judgment knowledge in the image, and designed a workstation of COW cluster to achieve the parallel algorithms. Experimental results show that the algorithm can improve the operation efficiency of P-M algorithm and obtain comparable restoration quality.

Temporal error concealment algorithm designed for H.264

2009, 29(05):  1355-1358. 

Asbtract ( )   PDF (671KB) ( )  

Related Articles | Metrics

To overcome the degradation of video quality caused by transmission errors, a new temporal error concealment algorithm based on motion vector adaptive recovery was proposed, which efficiently exploited the characteristic of H.264. Firstly the Motion Vector Relative Strength (MVRS) was estimated by calculating a ratio involving the motion vectors of adjacent macro blocks. Then either minimum variance of boundary motion vectors method or polynomial interpolation method was employed to recover the lost motion vectors according to the magnitude of MVRS. The simulation results show that the proposed algorithm can highly improve the quality of reconstructed video and obtain a gain of about 0.2~2.5dB in PSNR, compared with conventional temporal error concealment algorithms in the condition of equal packet loss rate.

Real-time line segments detection based on graphic processor

2009, 29(05):  1359-1361. 

Asbtract ( )   PDF (509KB) ( )  

Related Articles | Metrics

An iterative line segment detection procedure by graphic hardware was presented, which implemented edge detection, Hough transform, end points detection with GPU. The GPU based parallel Hough transform was designed for both θ parameter space segmentation and image space segmentation, and threads for the computation of the same θ parameter space were properly synchronized by shared memory in thread block. Experimental results prove the accuracy of the method for its iterative property, and good real-time capability because of full utilization of GPU's powerful computation effort.

Fast motion estimation algorithm for H.264 with multi-references

2009, 29(05):  1362-1368. 

Asbtract ( )   PDF (588KB) ( )  

Related Articles | Metrics

In H.264 standard, the codec allows seven block types to search the best motion vector in several reference frames to achieve lower bit rate and higher quality. Since the reference code uses the full search scheme to obtain the best performance, it will increase the computational complexity significantly. Synthesis motion vectors were adopted to predict the optimal matching location according to correlation and continuity of motion vectors among adjacent frames. Meanwhile, adaptive criteria related to selected MB's mode were used to determine whether it is necessary to search more reference frames. The simulation results show that the speed of the proposed algorithm is over six times faster than that of the original scheme adopted in JVT reference software with similar video quality and low bit rate.

Hierarchical ellipse detection algorithm based on local PCA Hough transform with parameter restraint

2009, 29(05):  1365-1368. 

Asbtract ( )   PDF (605KB) ( )  

Related Articles | Metrics

Concerning the invalid sampling, invalid accumulations and long run time yielded by random sampling when Randomized Hough Transform (RHT) was introduced to detect circles and ellipses in complex images processing, a new method of hierarchical Hough ellipse detection with parameter restraint based on local PCA aiming at line segments of interest was proposed. Firstly through Canny method the edge image was obtained and the cross points were deleted. Then some useful segments were retained through PCA which were labeled and the coarse parameters could be computed by curve fit to restrain the search scope of Hough transform. Lastly the ellipse exact parameters were searched from small Hough parameter space, which updated the image space till all the ellipses were detected. Comparative simulation results show that the algorithm proposed in this paper is efficient in performance of speed.

BPNN algorithm towards shot boundary detection

2009, 29(05):  1369-1372. 

Asbtract ( )   PDF (579KB) ( )  

Related Articles | Metrics

The authors presented a neural networks based approach of shot boundary detection by using multi-video features. Two approaches, based on feature differences between two adjacent frames and shifting window respectively, were employed to detect abrupt transition, and motion information was used to reduce the influence of strong movement of objects. The fusion and voting techniques were exploited in the final decision stage. In gradual change detection, three patterns of the variance curve of intensity during the dissolving period were distinguished using three neural networks respectively. Then the interference was eliminated according to the characteristics of linear increasing or decreasing of the mean value of intensity during dissolving interval. Experimental results on TRECVID database indicate that the proposed approach works well in detecting shot boundary measured by both recall and precision, and it is also robust to motion and flash light.

Software process technology and data mining

Hierarchical layout algorithm based on order of succession and degree of association

2009, 29(05):  1373-1375. 

Asbtract ( )   PDF (463KB) ( )  

Related Articles | Metrics

On the issue of crossing minimization, either time complexity or result of the conventional heuristic algorithm is unsatisfactory. The authors proposed a kind of cross-reduction algorithm based on Sugiyama algorithm, and introduced the implementation mainly in layout and routing. Experimental results of two-layer hierarchical graph show that the algorithm has better performance, to a certain extent, and overcomes the contradiction between time complexity and effect.

Static detection of array bounds errors and null pointer dereference in Java

2009, 29(05):  1376-1379. 

Asbtract ( )   PDF (635KB) ( )  

Related Articles | Metrics

Background knowledge of static analysis in Java was introduced, and the general scenarios of array index out of bounds and null pointer dereference in Java program were classified. Experimental evaluation of the presented static analysis tools show that these tools are not efficient for analyzing the inter-procedural errors and the authors give brief discussions on how to solve this problem.

Clustering algorithm based on Delaunay triangulation density metric

2009, 29(05):  1380-1384. 

Asbtract ( )   PDF (486KB) ( )  

Related Articles | Metrics

To solve the problem that K-means clustering algorithm fails to correctly distinguish non-convex shape clusters, a clustering algorithm based on Delaunay triangulation density metric was presented. In the algorithm, Delaunay triangulation graph which has the advantages of nearest neighbor and adjacency was introduced to reflect the characteristics of data themselves and compute density. Meanwhile, chaos optimization dedicated to global optimization was applied to optimize clustering objective function for the sake of obtaining global minimum solution. Experimental results indicate that the clustering algorithm based on Delaunay triangulation density metric can find arbitrary non-convex shape clusters.

Test path generation approach for GUI based on event weight

2009, 29(05):  1382-1384. 

Asbtract ( )   PDF (430KB) ( )  

Related Articles | Metrics

Focusing on the problem of infinite paths created by the events for GUI, the author presented a test path generation approach for GUI based on event weight in an event-flow graph (EFG). The event-flow graph model was analyzed, and Analytic Hierarchy Process (AHP) method was adopted to compute event weight. Test paths were generated by traversing event-flow graph on the basis of event weight. This approach simplifies the test paths to a certain extent, makes the test paths become more effective, and improves the GUI testing efficiency.

A Method of Test Scenario Generation Based on UML Dynamic View

2009, 29(05):  1385-1392. 

Asbtract ( )   PDF (738KB) ( )  

Related Articles | Metrics

This paper presents a method of creating test scenario based on UML dynamic view. Firstly, it combines with a sequence diagram and a state diagram as the test model, defining the criteria of testing coverage. Then it transforms the test model into a directed graph of orthogonal list structure. Aimed at the different types of messages of combination, it deals with them one by one and presents to search test scenario by a depth first algorithm. During the process of transforming the UML diagram into the test model, used this method can improve the integrity of the scenes path and reduce the generation of redundant scenes.

Process mining based on parallel recombination simulated annealing algorithm

2009, 29(05):  1389-1392. 

Asbtract ( )   PDF (703KB) ( )  

Related Articles | Metrics

First, the author described formal description of process mining problem, then proposed a new approach of process mining based on parallel recombination simulated annealing algorithm. This approach adopted causal matrix as the code of process model. In comparison with other similar approaches, it improved on fitness measure function, crossover and mutation genetic operators. Experimental results show that this approach can effectively deal with noise and shorten the mining time.

Location of MFC messages processing functions in converse analysis

2009, 29(05):  1393-1400. 

Asbtract ( )   PDF (780KB) ( )  

Related Articles | Metrics

It is important to locate all kinds of key-functions in the program in software reverse analysis. Instructed by the idea that using different converse analysis technique for different encapsulated technology, the theory and implementation of message process mechanism of MFC programs were analyzed, and speedy search and location for all kinds of message-processing functions of MFC were realized. From the result in actual tests, this method can speedily search and locate the functions, and raise the efficiency of reverse analysis.

Incremental construction algorithm of constrained concept lattice based on pruning

2009, 29(05):  1397-1400. 

Asbtract ( )   PDF (684KB) ( )  

Related Articles | Metrics

An incremental construction algorithm named PCCL of the constrained concept lattice was presented by using pruning technology that eliminated the redundant information in the construction process. By making use of the rigorous monotone relation between father concept's intent and child concept's intent, all nodes of the constrained concept lattice were scanned from top to down, and the comparative operations between the intents were decreased, thus the efficiency of constructing the constrained concept lattice was improved. Experimental results verify the correctness and validity of PCCL by taking the celestial spectrum data as the formal context.

Evaluation of access patterns from log Ontology with DL-safe rules

2009, 29(05):  1401-1404. 

Asbtract ( )   PDF (675KB) ( )  

Related Articles | Metrics

In order to get the useful patterns from Web usage records, the author combined log Ontology and application access rules into a decidable hybrid log knowledge base with the restriction of DL-safe rules, and presented an approach for evaluating useful patterns from the candidate user-access pattern set. This method adopted inductive logic programming for coverage test about observations, and computed the support of user-access patterns to discover the frequent ones. The semantic generality measure could improve the results of patterns evaluation, and refining the random patterns by events taxonomy in log Ontology could improve the efficiency of patterns evaluation. Experimental results show that this method is feasible and effective to solve practical problems.

Method based on rough set for mining multi-dimensional association rules

2009, 29(05):  1405-1408. 

Asbtract ( )   PDF (636KB) ( )  

Related Articles | Metrics

It is very time-consuming to discover association rules from the mass of data, and not all the rules are attractive to the user, so a lot of irrelevant information to the user's requirements may be generated when traditional mining methods are applied. In addition, most of the existing algorithms are for discovering one-dimensional association rules. Therefore, the authors defined a mining language which allowed users to specify items of interest to the association rules, as well as the parameters (for example, support, confidence, etc.). A method based on rough set theory for multi-dimensional association rules mining was also proposed, which dynamically generated frequent item sets and multi-dimensional association rules, and reduced the search space to generate frequent item sets. Finally, an example verifies the feasibility and effectiveness of the method.

Distributed algorithm for constructing concept lattice based on index

2009, 29(05):  1409-1411. 

Asbtract ( )   PDF (435KB) ( )  

Related Articles | Metrics

The presented concept lattice parallel/distributed algorithm needs to search plenty of non-related concepts when dealing with a large scale data, which reduces the performance of the algorithm. A distributed concept lattice construction algorithm based on index named LCBI was put forward. When inserting a new concept, it quickly found all the greatest correlative concepts of the new concept using index, then found out cross-sub-concepts of child nodes of all greatest correlative concepts using parallel and top-down search, which decreased the search area. Theoretical analysis and experimental results show that LCBI outperforms the other distributed algorithms when dealing with dense context.

Pattern recognition

Precise recognition algorithm for handwritten digit characters based on low-dimensional features

2009, 29(05):  1412-1415. 

Asbtract ( )   PDF (604KB) ( )  

Related Articles | Metrics

The contour skeleton feature of digital character was proposed. A method based on this feature and the big gridding feature for the recognition of off-line handwritten digits was also developed. The feature vectors extracted were to be recognized and eliminated gradually by making use of the improved two-stage AdaBoost neural network. First stage, the categorizer based on big gridding feature conducted general assortment to eliminate most of negative samples and let almost all the positive samples pass. Second stage, the categorizer based on contour skeleton feature conducted further sorting for the positive samples from the 1st stage. Simulation result indicates that the proposed method has improvement in recognition speed and accuracy rate.

New supervised locality-preserving projections algorithm for face recognition

2009, 29(05):  1416-1422. 

Asbtract ( )   PDF (586KB) ( )  

Related Articles | Metrics

In order to make full use of the classification information of samples to get optimal features, a new Supervised Locality Preserving Projections (NSLPP) algorithm for face recognition was proposed. Between-class scatter matrix was embedded in the objective function of original locality preserving projections, and the transformation matrix could be obtained based on the modified objective function. Subsequently, according to the idea of linear discriminant, the optimal base vectors of the transformation matrix were selected to form the final transformation matrix. As a result, the features of training samples and testing samples were got by projecting them on the subspace spanned by optimal base vectors. Finally, Nearest Neighborhood (NN) algorithm was used to construct classifiers. Experiments on ORL and FERET face database show that the recognition performance of NSLPP is effective.

Audio classification based on one-class SVM

2009, 29(05):  1419-1422. 

Asbtract ( )   PDF (561KB) ( )  

Related Articles | Metrics

The author studied an audio classification method based on One-Class Support Vector Machine (OCSVM), which could form a decision function for every single class sample and accordingly obtain the aim of classification based on maximum of decision function. By employing wavelet packed transformation to extract features of audio and integrating multiple features, five audio classes were made: pure speech, music, environmental sound, speech over background and silence. Experimental results show that OCSVM has better classification accuracy, and performs better than the other classification systems using the Bayes, Hidden Markov Model (HMM) and Neural Network (NN).

Applying dual-structure particle swarm optimization and KNN to identify affective states ground on physiological signals

2009, 29(05):  1423-1429. 

Asbtract ( )   PDF (587KB) ( )  

Related Articles | Metrics

Dual-Structure Particle Swarm Optimization (DSPSO) was applied to select emotion features of physiological signals, which improved the effect of feature selection and the correct rate of affective classification. Incremental K algorithm was proposed to avoid indivisibility for multi-classification, which also advanced multi-identification effect. Compared with the results of traditional SFFS and BPSO algorithms, the proposed method obtained better effect in recognizing four affective states (joy, anger, sadness, pleasure) from four physiological signals (EMG, SC, ECG, RSP). Simulation results show, based on physiological signals, DSPSO can select feature well.

Sensor fault detection model based on self-organizing immune network

2009, 29(05):  1426-1429. 

Asbtract ( )   PDF (612KB) ( )  

Related Articles | Metrics

A self-organizing immune network for sensor fault detection in aircraft engine was presented. The self-organizing map was used in the modeling of sensor immune network. The weights of immune network were determined based on learning vector quantization. The structure and the features of the immune network, for sensor fault detection, were presented, and the algorithms of sensor failure detection were given. Simulation results show that this method can effectively detect the sensor failures. Moreover, this method is sensitive to fault and robust to noise interference. This method is contributive for sensors fault detection in aircraft engine and it can be easily extended to other relative industrial application areas.

Ontology-cored image emotional semantic search model

2009, 29(05):  1430-1436. 

Asbtract ( )   PDF (548KB) ( )  

Related Articles | Metrics

In order to solve the problem that it is difficult to implement emotional semantic search in the course of image searching, an Ontology-cored emotional semantic search model was proposed and constructed. A method combining Mpeg-7, theory of concept lattices and Ontology construction together to construct the kernel Ontology library was put forward. The difficulty of this method lies in integrating the Mpeg-7 standard descriptor with image emotional Ontology properties, as well as auto-generating new concept results, which help the image emotional domain Ontology framework to build semi-automatically. This model was implemented and some related experiments were carried out. Experimental results validate the feasibility and superiority of the model.

Pitch detection based on autocorrelation square function and wavelet transform

2009, 29(05):  1433-1436. 

Asbtract ( )   PDF (540KB) ( )  

Related Articles | Metrics

A robust pitch detection algorithm based on autocorrelation square function and wavelet transform was proposed for speech signals severely corrupted by noise. Noisy speech signal was first preprocessed by wavelet transform. The autocorrelation square function had been applied to emphasize the peak of the true pitch period. This algorithm can get the exact pitch of the speech signals in strong noisy environment. Experimental results indicate that, compared with classical pure autocorrelation method, the proposed algorithm has better robustness and higher accuracy with lower computational complexity, which is good for speech synthesizing and coding in real-time.

Typical applications

Study and application of emergency case Ontology model

2009, 29(05):  1437-1445. 

Asbtract ( )   PDF (731KB) ( )  

Related Articles | Metrics

Emergency case is always considered as the important support in emergency response system. The massive emergency case information from network is exploded in exponential trend. However, because of the heterogeneous quality of opening Web, it is difficult in understanding and using these cases. An Emergency Case Ontology Model （ECOM） was proposed as the knowledge representation of emergency case, which was divided into upper Ontology and application Ontology. The upper Ontology named eABC was expanded based on the ABC Ontology, and the application Ontology, which was represented as a 5-array of concepts, relations, functions, axioms and instances, was composed of emergency case subject, emergency case object, and emergency event developmental process and so on. In ECOM, Web resource location was considered to assess the reliability of the cases information. Finally, the validity of ECOM was testified by an example of Wenchuan earthquake description.

Application of generalized Jensen-Schur measure in medical image registration

2009, 29(05):  1441-1445. 

Asbtract ( )   PDF (713KB) ( )  

Related Articles | Metrics

For the influences of noise, interpolation and image modality, the medical image registration method based on mutual information or normalized mutual information would cause local extrema, small convergence area, and even inaccurate registration. A new generalized Jensen-Schur measure was defined, which used "nonlinear increasing" of butterworth function to eliminate false extrema. Four new generalized Jensen-Schur measures, mutual information and normalized mutual information were analyzed and compared by applying them to rigid registration. The results of tests show that the new constructed JS22 and JS23 measures outperform other measures in noise immunity and convergence, and eliminating false extrema caused by PV interpolation.

Dynamically reconfigurable cache scheme with lower-power

2009, 29(05):  1446-1451. 

Asbtract ( )   PDF (633KB) ( )  

Related Articles | Metrics

In many embedded computing systems, energy consumption of processor is a major concern. Several studies have shown that cache memories account for about 30 to 60 percent of the total energy in modern microprocessors. A lower-power dynamically reconfigurable scheme named Tournament cache was presented. By adding three additional counters and a register on the basis of conventional cache structure, the Tournament cache could be configured to be direct-mapped, two-way or four-way set associative according to the statistics results of the counter in the runtime of program to adapt to the needs of different phase of program, thereby resulting in the energy reduction of system. Experimental results show that the cache design can save the energy consumption of over 40 percent, and the performance decline is negligible.

SDRAM controller designed for real-time display system of large-array CCD image

2009, 29(05):  1449-1451. 

Asbtract ( )   PDF (479KB) ( )  

Related Articles | Metrics

After analyzing the principle of SDRAM, a Synchronous Dynamic Random Access Memory (SDRAM) controller used in large-array CCD image real-time display system was designed with parameterization design concept. It was implemented by VHDL hardware description language and had a simple interface. Then the SDRAM controller was successfully used in real-time display system of large-array CCD image and worked very well.

Research of high sensitive GPS software receiver developing platform

2009, 29(05):  1452-1460. 

Asbtract ( )   PDF (764KB) ( )  

Related Articles | Metrics

First, hardware and software architectures of the software GPS receiver developing platform were introduced, especially the frequency domain acquisition algorithm and time domain tracking algorithm were described in details. Furthermore, the demodulation and synchronization of navigation data, capture of the satellite ephemeris, position solution of the user and simulation of the GPS signal were presented. All of these modules had been validated through field test data. Test results show that the PDOP is 2.3534, which is as good as traditional hardware GPS receiver. The platform can also generate simulating signals of the GPS system including different satellite C/A code, different intermediate frequency, and different Doppler frequency shift, which can be used for validating acquisition algorithm and tracking algorithm of a software GPS receiver. All the satellite signals can be acquired when SNR is -37dB in this platform, which means that the sensitivity has been improved remarkably over traditional hardware GPS receiver.

Knowledge acquisition framework based on experience feedback model for die and mold enterprise

2009, 29(05):  1456-1460. 

Asbtract ( )   PDF (863KB) ( )  

Related Articles | Metrics

Concerning the difficulties of experience knowledge acquisition during knowledge integration process of die and mold enterprises，a knowledge acquisition framework based on experience feedback model was proposed．First，the knowledge acquisition method based on mold product lifecycle was studied and the Ontology-based knowledge extraction and representation were realized，conceptual graph was adopted to construct visual modeling and Web Ontology Language（OWL）was used to describe and store knowledge in a uniform way．Then，the structure and the runtime principle were stated．Finally，the knowledge acquisition services of mold enterprise integration platform based on service-oriented architecture were implemented．As the proposed framework satisfies the experience characteristics and adopts streamlining knowledge acquisition process and visualization representation methods，the difficulties and the costs are reduced．

Applying AB classification method in one-dimensional cutting stock problem

2009, 29(05):  1461-1466. 

Asbtract ( )   PDF (545KB) ( )  

Related Articles | Metrics

In order to solve large-scale one-dimensional cutting stock problem of calculating difficulties, according to the characteristics of one-dimensional cutting stock problem, the author used random search technology to improve the greedy algorithm and put forward a kind of simple and practical classification method named AB. Experiments show that the algorithm for larger problems can quickly obtain the optimal solution or approximate optimal solution with high accuracy.

Safety visiting strategy in network measurement and control laboratory

2009, 29(05):  1467-1469. 

Asbtract ( )   PDF (481KB) ( )  

Related Articles | Metrics

Currently, the network measurement and control laboratory is generally built based on Browser/Server model. It is easy to use but brings safety problems, especially when the hardware instruments controlled by multi-users, this structure will lead to deadlock or work incorrectly at the same time. The simulation queue model was built utilizing queue theory, and the running parameters of model were given. The realization method based on Active Server Page and database technology was described, which ensures one instrument can only be controlled by one user, while waiting users can browse the instrument running and using status.

Electronic elections based on secure E-mail protocol

2009, 29(05):  1470-1476. 

Asbtract ( )   PDF (674KB) ( )  

Related Articles | Metrics

By introducing the Certificate Authority (CA) into secure E-mail protocol Pretty Good Privacy (PGP), the author designed a vote scheme for large-scale electronic elections. It fulfills the security demands of electronic elections, but does not require constituencies to the settled polling booth. Moreover, the proposed scheme resolves the problems, which result from exceeding authority of authoritative organization and absolute anonymity, in electronic elections to a certain extent. And it can provide public verifiability without disclosing the vote messages.

Interconnected delay robust decentralized H∞ control for large-scale systems

2009, 29(05):  1473-1476. 

Asbtract ( )   PDF (514KB) ( )  

Related Articles | Metrics

Delay-dependent decentralized robust H∞ controller for a class of interconnected large-scale systems was researched. The time-delays were assumed as time-varying. First, the decentralized state feedback H∞controllers were designed. A method called Integral Inequality Method (IIM) was introduced. Combining the Lyapunov-Krasovskii functional approach, the integral inequality of matrices and the modified Cone Complementary Linearization (CCL) algorithm, the delay-dependent sufficient conditions for the existence of robust decentralized H∞ control were presented in terms of nonlinear matrix inequalities and linear matrix inequalities. Second, the results were extended to the case of decentralized output feedback. At last, the numerical simulation shows the validity of the main results.

Application of data mining in CRM of children training institute

2009, 29(05):  1477-1479. 

Asbtract ( )   PDF (405KB) ( )  

Related Articles | Metrics

Concerning the bottleneck of classical Apriori algorithm which need scan the transaction database multiple times and might produce large candidate item sets, a new Apriori algorithm was proposed. The new algorithm could produce the item sets without producing candidate item sets, thus greatly decreased the dealing times with data and improved the efficiency of data mining. The new algorithm was applied to analyze the chosen training items in the children training institute, expounding the important meaning for increasing the competition of the improved Apriori algorithm in CRM of children training institutes.

Real-time path replanning algorithm for unmanned aerial vehicles in threatening environment

2009, 29(05):  1480-1482. 

Asbtract ( )   PDF (458KB) ( )  

Related Articles | Metrics

Using the modified potential field theory, the author presented a real-time path planning algorithm for Unmanned Aerial Vehicles (UAV). The path was divided into subsections by some nodes in the course of flying, and then a new repulsive function was constructed by new flight environment. Simulation results indicate that this algorithm can satisfy the route plan well.