Table of Content

01 June 2009, Volume 29 Issue 06

Previous Issue    Next Issue

Network and communications

New anti-collision algorithm for RFID system based on stack storage

2009, 29(06):  1483-1486. 

Asbtract ( )   PDF (623KB) ( )  

Related Articles | Metrics

Aim at taking both identifying times and the number of transmitting data into consideration that were not simultaneously concerned in some other binary-search schemes, a new anti-collision algorithm for RFID system based on stack storage was proposed in this paper. The main idea of this algorithm are modifying the process for reader to identify all tags and cut short the number of bits sent by reader. In order to reduce identifying times, this algorithm utilizes the memory function of stack to avoid starting identifying step from the root every time. In addition, it adopts suitable protocols to further cut down necessary command bits. Simulation results indicate that this algorithm can not only reduce the identifying times but reduce the number of command bits. Also, it obtains a better performance with regard to times-efficiency and data-efficiency. Consequently, this algorithm achieves an improvement in the aspects of operative duration and energy consumed.

Power allocation algorithm of multiple space-time transmit diversity in MIMO wireless systems

2009, 29(06):  1487-1493. 

Asbtract ( )   PDF (521KB) ( )  

Related Articles | Metrics

Concerning the symbol detection of multiple Space-Time Transmit Diversity (STTD) in Multiple-Input Multiple-Output (MIMO) wireless systems, an efficient power allocation algorithm was presented. Based on the QR-based successive detection, the proposed algorithm required only a few feedbacks Channel Status Information (CSI) from the receiver to decompose QR matrix. The statistical property of the R matrix was approved and the closed-form upper bound for the Bit Error Rate (BER) metric was obtained. By minimizing the upper bound, an optimal power allocation scheme was proposed. Detailed simulation results and comparisons with the existing algorithms prove that, not only the experimental results of the proposed algorithm coincide with the theoretical results completely but also it is of better BER.

Novel connected dominating set algorithm based on minimum spanning tree

2009, 29(06):  1490-1493. 

Asbtract ( )   PDF (612KB) ( )  

Related Articles | Metrics

Through in-depth analysis, an important property of Connected Dominating Set (CDS) in wireless network was obtained, in which the smallest CDS of a simple connected graph is the non-leaf nodes of a spanning tree with most leaf nodes. A new CDS algorithm was designed on the basis of the analysis. Simulation results show that the algorithm possess better performance than others.

Adaptive net access delay algorithm based on queue length

2009, 29(06):  1494-1508. 

Asbtract ( )   PDF (610KB) ( )  

Related Articles | Metrics

Several simulation models were built for analyzing the five Net Access Delay (NAD) algorithms, such as DAP-NAD, P-NAD, R-NAD, H-NAD and RE-NAD. Simulation experiments help to analyze the performance and usage of these NAD algorithms. A kind of new NAD algorithm Adaptive Queue Length Net Access Delay (AQL-NAD) was proposed. The simulation of AQL-NAD shows higher throughput, lower end-to-end Delay and less time slot used than the five NAD algorithms above.

Improved algorithm for DS-QPSK phase error detection and its digital implementation

2009, 29(06):  1497-1516. 

Asbtract ( )   PDF (441KB) ( )  

Related Articles | Metrics

According to the correlation orthogonality of Pseudorandom Noise (PN) code used in the direct sequence spread spectrum and QPSK modulation (DS-QPSK) system, a carrier phase error detection algorithm for DS-QPSK signal was proposed. One channel of the DS-QPSK signal could be simplified by the high correlation orthogonality of PN code, and then phase error detection was implemented through the reference of detecting phase error for BPSK signal with arc tangent function. This method was simulated and implemented in computer. Experimental results indicate that the phase error detection algorithm can decrease Signal Noise Ratio (SNR) of the receiver and improve the receive sensitivity of the system.

Blind source separation with unknown number of sources based on hierarchical genetic algorithm

2009, 29(06):  1499-1513. 

Asbtract ( )   PDF (602KB) ( )  

Related Articles | Metrics

In order to solve blind source separation without any information of the number of source signals,a new algorithm based on hierarchical genetic was proposed. Control layer and parameter layer represent the available number of rows and the concrete value of the available rows of separation matrix respectively. Non-Gaussian was used to measure the independence of the stochastic signals. The kurtosis was maximized/minimized by searching a linear combination of observation signals, and then the independent variables were separated. Computer simulation verifies the validity of the proposed algorithm.

Treatment strategy and its application for QoS preference in network computing environment

2009, 29(06):  1502-1505. 

Asbtract ( )   PDF (577KB) ( )  

Related Articles | Metrics

To ensure users' requirements for service on demand, the paper went deep into the treatment strategy of Quality of Service (QoS) preference information. Three ways were first put forward to describe QoS preference information based on the theory of multiple-attribute decision, which were orders vector, AHP matrix and language valuation collection, and the concrete methods of conversion and computation were given out. Afterward, the treatment strategy of QoS preference was applied to service selection, and a decision method of the optimal service was presented, which could reflect users' QoS preference and meet users' requirements for service on demand. The specific example with analysis indicates that the treatment strategy of QoS preference in the paper is feasible.

Grid resource scheduling optimization based on back-free-time

2009, 29(06):  1506-1508. 

Asbtract ( )   PDF (467KB) ( )  

Related Articles | Metrics

Scheduling optimization depends not only on resources selection but also on time sequence correlatively in grid. After the time sequence characteristics in resource reservation were analyzed, a dynamic time model was presented, in which the back-free-time was calculated for applying to the subsequence task. Thus, a Back-free-time Optimization Scheduling (BOS) algorithm was proposed. Finally the performance of BOS algorithm was compared with that of the cost optimization scheduling algorithm through simulations. Experimental results show that the back-free-time optimization scheduling algorithm can decrease runtime and cost within grid environments.

Improved two-level scheduling framework in open real-time system

2009, 29(06):  1509-1513. 

Asbtract ( )   PDF (801KB) ( )  

Related Articles | Metrics

An improved two-level scheduling framework based on different characteristics of hard and soft real-time applications was proposed through analyzing the two-level scheduling framework in the open system. This improved approach can expand the application range through adding the process of dealing with soft real-time applications. The simulation results show its validity.

Energy saving algorithm on wireless sensor network based on LEACH

2009, 29(06):  1514-1516. 

Asbtract ( )   PDF (480KB) ( )  

Related Articles | Metrics

To prolong wireless sensor network's lifecycle as far as possible, an energy-saving algorithm on the basis of the obtained results was proposed. All sensors were divided by base station into several static clusters, in which each sensor became cluster-head by turn. Thus, transport control signals were as little as possible reduced in the network communication. The simulation results show that this algorithm excells the traditional energy-saving algorithm based on Low-Energy Adaptive Clustering Hierarchy (LEACH) in prolonging network's lifecycle.

Information query based on semantic association in grid environment

2009, 29(06):  1517-1526. 

Asbtract ( )   PDF (639KB) ( )  

Related Articles | Metrics

To meet the information query for the rapidly increasing resource information in grid, a arithmetic of resource information query matching based on metadata semantic association in the discover system of Metadata Directory Service (MDS) was proposed, after the disadvantage of the information service system MDS in grid environment was analyzed. Experimental results show that the arithmetic not only can implement information query in grid environment, but also can improve efficiency of resource information query compared the information query based on directory and semantic association.

Influence of heavy-tailed distribution on network traffic

2009, 29(06):  1520-1522. 

Asbtract ( )   PDF (402KB) ( )  

Related Articles | Metrics

Scale burst and local burst coexist in network traffic. Research shows the heavy-tailed distribution variable is strongly unsteady, which means long enough traffic series is needed in traffic modeling. Simulated results indicate that heavy-tailed network traffic can be appropriately modeled by multi-fractal model in small time scale.

Three-layer topology architecture and topology control algorithm for large-scale wireless sensor network

2009, 29(06):  1523-1526. 

Asbtract ( )   PDF (616KB) ( )  

Related Articles | Metrics

Aimed at the application characteristics of the large-scale Wireless Sensor Network (WSN) with more sink nodes, a new 3-layer topology architecture was proposed to solve the problem of the incompatibility of the traditional topology structure in large-scale WSN. The data communication strategy for each level was analyzed, and a topology control algorithm for top-level was proposed based on the bottleneck-nodes, which would provide higher reliability control for the key-level. The experimental results indicate that, the new topology control strategy helps to balance the communication load of the nodes, and the energy consumption in the key-level can be reduced remarkably.

Artificial intelligence

Ant colony algorithm for project scheduling problem under flexible work-hour constraints

2009, 29(06):  1527-1568. 

Asbtract ( )   PDF (394KB) ( )  

Related Articles | Metrics

A new mathematical model for software engineering project scheduling was proposed. The model took into consideration the over-time of software engineers, which was regarded as a flexible work-hour constraint. The project human resources were analyzed in detail. As a type of special renewable resource, the human resource was added as a new constraint to the traditional resource constrained project scheduling problem. An ant colony algorithm based on parallel schedule generation scheme was suggested to solve this new flexible work-hour constrained project scheduling problem, and an instance was used to verify and analyze the solution.

Water quality parameter forecast based on grey neural network modeling

2009, 29(06):  1529-1535. 

Asbtract ( )   PDF (659KB) ( )  

Related Articles | Metrics

Owing to the lack of enough monitoring data in water quality parameter prediction, combining information renewal GM(1,1) model and BP neural network model, the grey information renewal neural network model was proposed. Using the data of information renewal model sets as the training and testing samples, the problem that BP network needs a mass of samples to approach nonlinear function better was solved. Experimental results indicate that, compared to the grey information renewal model and BP model, this forecast model is superior in water quality parameter prediction.

Optimization algorithm for MAS construction based on reliability analysis

2009, 29(06):  1532-1535. 

Asbtract ( )   PDF (589KB) ( )  

Related Articles | Metrics

Using multi-Agent technology to construct system modeling, reliable and effective cooperation between Agents is the important condition for dealing discrete manufacturing tasks. After a parallel connection structure was introduced to improve the reliability of Multi-Agent System (MAS), a reliability evaluation method for parallel Agent system was proposed, and a mathematic model was constructed for maximizing the reliability of MAS with constraint conditions. The filled function method was utilized to achieve solution algorithm of the model. The example results indicate the validity of the parallel connection and the method.

Immune genetic algorithm based on antibody injection

2009, 29(06):  1536-1543. 

Asbtract ( )   PDF (614KB) ( )  

Related Articles | Metrics

Standard genetic algorithm has some disadvantages, such as slow astringency, precocity. A new immune genetic algorithm (AIGA) based on the theory of antibody injection immune was proposed. Immunity response, antibody injection and immunity selection of biological immune systems were introduced to combine with the search ability of standard genetic algorithm in AIGA. When the method of antibody distilling and injecting used in Travelling Salesman Problem (TSP) were presented, the convergence of AIGA was proven theoretically. A simulation test of 100-city TSP was done with AIGA, and its computational process was compared with that of standard genetic algorithms. The test results show that AIGA can overcome the disadvantage of precocity and improve the speed of astringency evidently.

Novel structure learning method for constructing gene regulatory network

2009, 29(06):  1539-1543. 

Asbtract ( )   PDF (737KB) ( )  

Related Articles | Metrics

Structure learning of Bayesian network is a NP hard problem. A structure learning method without an ordering requirement based on novel Particle Swarm Optimization (PSO) was proposed. In this method, the structures were represented by particles, and updated according to swarm intelligence of PSO. Then the net structures were modified with mutual information. Finally the K2 algorithm was applied with the global best particle as the ordering and updating the best particle for next generation. Experimental results demonstrate that the performance of this new strategy is better than that of K2 and BN-PSO, especially it has higher convergence rate and better Bayesian score without a previous ordering.

Shooting path planning for soccer robot based on dynamic ellipse curve

2009, 29(06):  1544-1546. 

Asbtract ( )   PDF (363KB) ( )  

Related Articles | Metrics

To improve the shooting precision of soccer robot, a shooting path planning algorithm based on dynamic ellipse curve was proposed. By calculating the robot's position, pose and desired shoot angle dynamically, the soccer robot was controlled to move to target at ellipse curve and shoot quickly. The results of simulation and experiment demonstrate the validity of the algorithm. The path is short and shooting is finished at a proper angle.

Research and application of outdoor sound field in virtual environment for mobile receiver

2009, 29(06):  1547-1550. 

Asbtract ( )   PDF (599KB) ( )  

Related Articles | Metrics

Ray-tracing is one of the most widely used ways of sound field simulation, but it usually depends on the specific location of the receiving point; therefore, it cannot be used in virtual environment with a mobile receiver directly. A method of step-length by defining the receiver dynamically based on ray-tracing was proposed, which solved the problem between sound effect and computational efficiency, especially for the outdoor sound field simulation in large-scale virtual environments. The improved algorithm was implemented in VS 2005 and Matlab, and it can achieve satisfactory sound effect and computational efficiency.

Algorithm of intelligent cleaning-robot charging return

2009, 29(06):  1551-1574. 

Asbtract ( )   PDF (593KB) ( )  

Related Articles | Metrics

A Dijkstra algorithm to find the shortest path for cleaning-robot returns to charge was presented. After a subarea map was established based on simplified grid world maps, a spanning tree was fabricated through using the breadth-first and depth-first traversals, finally the shortest path was obtained by Dijkstra arithmetic. Without increasing other sensors, the cleaning-robot can achieve return to charge automatically. This algorithm has a good effect in its practical application.

Quantum-behaved particle swarm optimization algorithm with random selection of optimal individual

2009, 29(06):  1554-1558. 

Asbtract ( )   PDF (609KB) ( )  

Related Articles | Metrics

The particles are easy to mass into a small search space in late stage and thus the diversity of swarms decline. Based on the analysis of quantum-behaved Particle Swarm Optimization (PSO) algorithm, a method of random selection of optimal individual was proposed to improve the diversity in searching progress. The improved QPSO was compared with the original PSO and the original QPSO using the testing function of the benchmark. Experimental results demonstrate that the improved QPSO is more suitable for resolving the multi-peak optimization problem.

New sparse least squares support vector machine algorithm

2009, 29(06):  1559-1581. 

Asbtract ( )   PDF (808KB) ( )  

Related Articles | Metrics

The recognition rate of Least Squares Support Vector Machine (LS-SVM) sparse algorithm rapidly decreases with the reduction of training samples in dealing with some pattern recognition issues, and the sparsification can not be achieved. To overcome such a shortage, a new sparse algorithm was proposed. The method was applied to radar range profile's recognition and the experimental results show its validity in recognition.

Novel data fusion method for candidate gene prioritization

2009, 29(06):  1563-1571. 

Asbtract ( )   PDF (575KB) ( )  

Related Articles | Metrics

Identifying key candidates in the thousands of genes in a genome is an important step in hunting genes playing roles in a disease phenotype or a complex biological process, and candidate gene prioritization integrating kinds of data sources is becoming a new challenge in this field. A new data fusion method based on one-class Support Vector Machine (SVM) was proposed for candidate gene prioritization. Experimental results indicate that the proposed method is valid in gene prioritization integrating kinds of heterogeneous data sources and its accuracy and robustness are better than that of the method with single data source.

Genetic algorithm with variable mutation intervals

2009, 29(06):  1566-1568. 

Asbtract ( )   PDF (416KB) ( )  

Related Articles | Metrics

Based on thorough analysis of the evolvement probability of Genetic Algorithm (GA), an improved genetic algorithm with variable mutation interval was presented, in which mutation intervals were adjusted adaptively with evolution process. Experimental results show that the proposed algorithm not only converges faster than the original algorithm, but also has a higher precision.

Dynamic fuzzy clustering method based on artificial fish swarm algorithm

2009, 29(06):  1569-1571. 

Asbtract ( )   PDF (408KB) ( )  

Related Articles | Metrics

In order to avoid the dependence of the validity of clustering on the space distribution of high dimensional samples of Fuzzy C-Means (FCM), a dynamic fuzzy clustering method based on artificial fish swarm algorithm was proposed. By introducing a fuzzy equivalence matrix to the similar degree among samples, the high dimensional samples were mapped to two dimensional planes. Then the Euclidean distance of the samples was approximated to the fuzzy equivalence matrix gradually by using artificial fish swarm algorithm to optimize the coordinate values. Finally, the fuzzy clustering was obtained. The proposed method, not only avoided the dependence of the validity of clustering on the space distribution of high dimensional samples, but also raised the clustering efficiency. Experiment results show that it is an efficient clustering algorithm with rapid speed and high precision.

Speech recognition based on improved MP sparse decomposition algorithm

2009, 29(06):  1572-1574. 

Asbtract ( )   PDF (458KB) ( )  

Related Articles | Metrics

Based on the limit of input glossaries and the characters of atoms structure in Matching Pursuit (MP) sparse decomposition, a new speech recognition algorithm was proposed through using the best obtained atoms' time-frequency parameters as matching parameters among test signals and swatch signals. In order to enhance the computing efficiency of MP sparse decomposition, the strategy based on dictionary partitioning and Genetic Algorithm (GA) was applied. In Matlab, the LGB algorithm was used to distinguish test signals. The simulation results show that the speech signal with length 6000 can efficiently be recognized through using ten atoms' time-frequency parameters, while the running speed of improved MP sparse decomposition algorithm is enhanced.

Retrieval strategy based on semantic expansion of keywords

2009, 29(06):  1575-1577. 

Asbtract ( )   PDF (490KB) ( )  

Related Articles | Metrics

Traditional retrieval strategy based on keyword-matching is facing unavoidable bottleneck because of mechanical characters matching and polysemy problems. A retrieval strategy based on domain ontology and semantic expansion of keywords was proposed. On the one hand, the domain ontology concept structure was used to expand the retrieval area; on the other hand, a method was presented to filter the irrelevant results. In this way, both the recall ratio and the precision ratio could be improved simultaneously. After that, an algorithm of sorting the retrieval results by the similarity between ontology and result was given.

Data mining

Transductive learning method applied to ensemble classification over data stream

2009, 29(06):  1578-1581. 

Asbtract ( )   PDF (546KB) ( )  

Related Articles | Metrics

The existing strategy of combining decisions for ensemble classification method requires common labeled training samples across these ensemble classifiers. To resolve combining classifiers decisions among ensemble classification over data streams without labeled examples, a transductive constraint-based learning strategy was proposed. It satisfied the constraints measured by each local classifier based on transductive learning theory while choosing decision on test samples; thereby guaranteed the feasibility of the constraints. It solved the problems of transductive extension of maximum entropy for aggregation in distributed classification. Experimental examples prove that the proposed method can achieve higher classifying accuracy over the existing transductive approach and can be applied to ensemble classification fusing for data streams.

Novel negative selection algorithm for multi-class pattern classification problems

2009, 29(06):  1582-1589. 

Asbtract ( )   PDF (591KB) ( )  

Related Articles | Metrics

A negative selection algorithm for multi-class pattern classification problems named CS-NSA was proposed. The algorithm used clonal selection mechanism to implement self-adaptive learning of detectors and adopted detector trimming mechanism to tackle the over-fitting problem in multi-class classification. This mechanism enhanced the generalization capability of the detectors. The results of comparative experiments show that the proposed algorithm exhibits higher classifying accuracy than that of AIRS, a famous artificial immune classifier.

Research on recommendation system based on implicit rating

2009, 29(06):  1585-1589. 

Asbtract ( )   PDF (792KB) ( )  

Related Articles | Metrics

Recommendation system based on implicit rating was proposed to improve the precision and solve the problems of "scarcity" and "cold-start". Firstly, this research set up the items' profiles, and adopted the BP neural network to analyze the guiding model and behavior model of the users, gave the forecast rating for the hit items and set up subjective evaluation model and the profiles of preference for the users. Then it forecasted the rating of the non-hit items and formedthe intense rating matrix of user forcast item. After that, it produced the effective recommendation through the adoption of collaborative filtering recommendation algorithm. Finally, the model of negotiation and strategy based on item's characteristics were brought out for recommendation result, which can explain the result and support the bargaining of both sides.

Effective hybrid collaborative filtering algorithm for alleviating data sparsity

2009, 29(06):  1590-1593. 

Asbtract ( )   PDF (619KB) ( )  

Related Articles | Metrics

Collaborative filtering has been successfully applied to various recommendation systems. Unfortunately, with the tremendous growth in the amount of items and users, the lack of original rating poses some key challenges for recommendation quality. To address this problem, the paper explored a new hybrid CF approach which improved the traditional similarity coefficient computation combining the portal website natural structure, then the missing preference values were predicted with new similarity based on the item-based CF. The improvements made an increasing intercross of the rating matrix for alleviating sparsity. The experimental results show the proposed algorithm outperforms the traditional CF, and it can recommend potential preference pages for visitors.

Fast hybrid evolutionary substructure discovery algorithm

2009, 29(06):  1594-1614. 

Asbtract ( )   PDF (774KB) ( )  

Related Articles | Metrics

To avoid local-optima and enhance the qualities of solutions, a hybrid evolutionary algorithms system was developed to perform data mining on databases represented as graphs. To increase the efficiency of the algorithm, a new substructure extension method based on single-label substructure extension was proposed, which could greatly reduce the times for performing graph isomorphism during the evolution. Experimental results on some typical data sets and theoretical proof indicate its high efficiency and correctness.

Application of fractal in case base maintenance

2009, 29(06):  1598-1604. 

Asbtract ( )   PDF (638KB) ( )  

Related Articles | Metrics

The feasibility of fractal approach used in Case Base Maintenance (CBM) was elaborated, and then a model of case base maintenance based on fractal was proposed. The maintenance model utilized box dimension algorithm to maintain the case base. Experimental results show that this model can obviously reduce the size of case base, strengthen the uniformity of case base, and thus improve the speed of the case base retrieval process.

Design of distributed search engine system for apparel based on semantic Web services

2009, 29(06):  1601-1604. 

Asbtract ( )   PDF (635KB) ( )  

Related Articles | Metrics

According to the needs of supply-chain management in the environment of E-business, the authors analyzed the problems existing in the present search engine for apparel-goods and proposed a new distributed search engine for apparel goods based on semantic Web Services (WS), and then discussed its architecture. After introducing the apparel Ontology design model and the representation method based on Ontology Web Language (OWL), the basic functions of apparel search engine and WS synthesized in distributed environment were presented. Theoretical analysis and the designed prototype show that this search engine, based on apparel semantic tree, is much more efficient than full-text search engine when searching with multi-keywords.

New materialized view selection algorithm

2009, 29(06):  1605-1611. 

Asbtract ( )   PDF (592KB) ( )  

Related Articles | Metrics

To address the problem that the current materialized view selection methods couldn't solve random OLAP query efficiently, this paper proposed a 2-Phases Materialized View Selection (2-PMVS) algorithm which combined static materialized view selection algorithm with dynamic materialized view selection algorithm. It could dynamically bridge the gap between random queries and default queries. The experiments validate the effectiveness of the algorithm.

Attribute reduction algorithm based on dynamic quotient granularity

2009, 29(06):  1608-1611. 

Asbtract ( )   PDF (638KB) ( )  

Related Articles | Metrics

Rough Set (RS) theory is an effective approach of imprecision, vagueness and incompleteness in classification analysis and knowledge discovery. Rough set based on boundary region was dynamically analyzed from the coarser degree of granularity. Dynamic quotient granularity was defined by the principle of attribute connection, and a new attribute reduction algorithm based on the coarser degree of granularity principle was proposed. The optimal reduction set can be selected from all reduction set with algorithm for dynamic quotient granularity. It abandons the tradition to ask the core first, and then chooses the optimal reduction set. The validity of proposed granularity computing algorithm is proved by the application of practical database. Moreover, it can be used for granularity computation of knowledge.

Comparison between two solving methods for smooth support vector machine

2009, 29(06):  1612-1614. 

Asbtract ( )   PDF (418KB) ( )  

Related Articles | Metrics

The BFGS-Armijo method and Newton-Armijo method are two popular methods to solve the smooth models. The authors respectively listed the procedures of these two methods to solve Smooth Support Vector Machine (SSVM), and made a comparative study between the two methods to solve SSVM. The numerical results show that the classification performance of BFGS-Armijo method is almost the same as the Newton-Armijo method, but the classification efficiency of Newton-Armijo method is 26.2% higher than that of BFGS-Armijo method.

Information security

Analysis and implementation of security object sharing policy in Java card

2009, 29(06):  1615-1621. 

Asbtract ( )   PDF (470KB) ( )  

Related Articles | Metrics

A formal method was used to analyze the application isolation and objects sharing mechanism in Java smart card. A trust model was used to clarify the relationship of the inter-applet shareable objects. According to the constraint of trust transfer, it was inferred that, in addition to the applet level access controls, a global security policy of card was necessary to prevent the unauthorized information flow. Finally a simple implementation of the global security mechanism was designed.

New JPEG image authentication algorithm applied to multi-region tampering

2009, 29(06):  1617-1621. 

Asbtract ( )   PDF (829KB) ( )  

Related Articles | Metrics

A new method of distilling m bits abstract from the binary information sequence with the length of 2m-1 was proposed based on the coset decomposing theory of correct error coding. An important conclusion was proved that distortion of image block mean caused by JPEG lossy compression has a maximal value; a new image pre-processing method based on the conclusion was introduced and analyzed. Based on those, a new image authentication algorithm based on digital signature was proposed. It can distinguish between JPEG lossy compression and malicious tampering when the JPEG quality factor is greater than or equal to 25. When more than one region was tampered, it not only can effectively detect and localize the tampered area, but also has high probability of tampering detection and lower probability of false alarm. The results of theoretical analysis and emulation show that this algorithm is correct and effective.

Key pre-distribution scheme based on block design for wireless sensor networks

2009, 29(06):  1622-1624. 

Asbtract ( )   PDF (623KB) ( )  

Related Articles | Metrics

Key management is paramount for wireless sensor networks. A key distributing protocol based on block design and Blom's scheme was proposed. With the advantage of the block design, this scheme can substantially improve the network's connectivity. In contrast to other key pre-distribution schemes, this one has higher resilience to node compromise

Authentication and key agreement of 3G mobile communication system based on public key

2009, 29(06):  1625-1661. 

Asbtract ( )   PDF (657KB) ( )  

Related Articles | Metrics

The shortcomings to 3G Authentication and Key Agreement (AKA) protocol were described through analyzing its procedure and security. An improved scheme of 3G authentication and key agreement protocol was proposed, which achieve authentication of Mobile Equipment (ME) to Visitor Location Register (VLR) and secure transfer of message between VLR to Home Location Register (HLR). The session key established by the protocol was fair for both side of communication without the third party involved. Finally, the formal analysis results of the improved scheme showed its good practicability.

Method of detecting the sybil attack based on ranging in wireless sensor network

2009, 29(06):  1628-1631. 

Asbtract ( )   PDF (731KB) ( )  

Related Articles | Metrics

Method of detecting the sybil attack based on ranging was proposed in wireless sensor network. After be located the suspect nodes by checking the neighboring nodes' range, the sybil node was found out through the information exchange in the neighboring nodes. Experimental results show that the method without high accurate range possess less costs and extremely precise, moreover it does not fail to calculate when there was special nodes' inefficiency and no overall information. The method is particularly suitable for the distributed wireless sensor network with the low-cost, lacking resources and adverse circumstance.

Application of adaptive thresholding wavelet filter restoration in steganalysis

2009, 29(06):  1632-1639. 

Asbtract ( )   PDF (697KB) ( )  

Related Articles | Metrics

When the steganography in spatial domain was modeled as an image degradation process caused by additive noise, the image restoration could be introduced for secret messages detecting. A new method of LSB matching steganalysis was proposed through using adaptive thresholding wavelet filter restoration in steganalysis and combine with the difference characters between the original image and the filtered one. Experimental results show that, the method is better than Ker's calibrating method, especially in detecting uncompressed high resolution raw image due to its simple realization without estimating the embedding rate beforehand.

Research on access control oriented trust evaluation and tracing methods

2009, 29(06):  1636-1639. 

Asbtract ( )   PDF (618KB) ( )  

Related Articles | Metrics

Quantificational trust expression and trust relation discovery are difficulties that are not well tackled in trust based on access control. A trust evaluation model based on fuzzy set theory was introduced. By defining a decay function, the effect of time on trust was considered in the model. Then an algorithm of distributed trust discovery was proposed and discussed with some examples. The algorithm can improve the efficiency of trust relation discovery in access control.

Strong multiple grade proxy signature scheme

2009, 29(06):  1640-1642. 

Asbtract ( )   PDF (461KB) ( )  

Related Articles | Metrics

To solve the problems of poor security and difficult confirmation in the entrusting process, a new strong multilevel proxy signature scheme is proposed based on the signature scheme of Schnorr. The new scheme prevents from entrusting right abuse by authority certificate, and the transfer process of signed right can be confirmed directly through the formula of verification, without the involvement of the third party.

Certificateless universal designated multi-verifiers sequential multi-signature scheme

2009, 29(06):  1643-1645. 

Asbtract ( )   PDF (403KB) ( )  

Related Articles | Metrics

Sequential multi-signature schemes were based on discrete logarithm problem or identity, and existed certificate management and key escrow problems. Universal designated multi-verifiers signature scheme allowed a signature holder to designate a set of signature verifiers, in such a way that only designated verifiers could verify the efficiency of the signature. Combining certificateless signature with universal designated multi-verifiers signature, certificateless universal designated multi-verifiers sequential multi-signature scheme and its safety requirement were proposed. Security proofs based on the random oracle model indicate that this scheme can resist the adaptively select of message attack, and its security relies on the BDH assumption.

Cryptanalysis of proxy blind multi-signature scheme

2009, 29(06):  1646-1658. 

Asbtract ( )   PDF (444KB) ( )  

Related Articles | Metrics

Through the security analysis of LCZ proxy blind multi-signature scheme, it was found that this scheme cannot meet the requirement of strong unforgeability. Any original signer could forge valid proxy blind multi-signatures by impersonating the proxy signer. An improved version was proposed based on LCZ and HQL scheme, which can solve the security problem that exist in LCZ scheme and meet all the requirements of proxy blind multi-signature.

Blind watermarking algorithm for 2D engineering graphics based on fractional Fourier transform

2009, 29(06):  1648-1676. 

Asbtract ( )   PDF (582KB) ( )  

Related Articles | Metrics

A new method of digital watermarking for two-dimensional engineering graphics was proposed, In this method, the relative coordinate vectors of the lines were extracted from 2D engineering graphics for constructing a 1D complex signal. Watermark was embedded into the module of fractional Fourier transform coefficients of the complex signal based on the relationship between the values of watermark and transform coefficients. It is a blind watermarking algorithm due to the fact that watermark can be extracted without original engineering graphic. Experimental results show that the proposed algorithm is robust against the attacks such as moving, rotation, scaling, and is also safe towards illegal information extraction.

Reversible binary image data hiding by histogram modification

2009, 29(06):  1651-1653. 

Asbtract ( )   PDF (478KB) ( )  

Related Articles | Metrics

A novel reversible binary image data hiding scheme using Run-Length (RL) histogram modification was presented. Select the sequence of RL couples in which the length of couple is not shorter than threshold T1: First eliminate the white RL of isolated white pixels, and then embed data in the black RL whose length equals T. The proposed scheme worked for text, graphics, their mixture, and both halftone and non-halftone binary images. Experimental results have shown its superiority to other methods.

Automated verification tool for time-dependent cryptographic protocols

2009, 29(06):  1654-1658. 

Asbtract ( )   PDF (690KB) ( )  

Related Articles | Metrics

An automated verification tool for analyzing time-dependent cryptographic protocol was proposed and implemented. Based on Time-dependent Cryptographic Protocol Logic (TCPL), the tool completed verifying the goals of cryptographic protocols automatically by the method of layered logic tree and using XML as its specification language. Experimental result shows that the tool can simplify the proving process, and improve the efficiency of security protocols verification.

Research on Kerberos identity authentication protocol based on hybrid system

2009, 29(06):  1659-1661. 

Asbtract ( )   PDF (503KB) ( )  

Related Articles | Metrics

Kerberos identity authentication protocol was analyzed in detail. According to its limitations, a new protocol about Kerberos based on hybrid system was proposed to improve the security and actual implementation performance of the system. Moreover, the problem that Kerberos authentication protocol maybe eavesdrop two-side communication conversations was solved in the system, thus inner attacks could be avoided.

Research of encrypted network traffic type identification

2009, 29(06):  1662-1664. 

Asbtract ( )   PDF (464KB) ( )  

Related Articles | Metrics

Concerning the problem that the encrypted network traffic type cannot be identified using traditional inspection way, this paper studied its identification methods. Since the network traffic remains intact after being encrypted, the network traffic type could be identified correctly by calculating data packet size, timing and direction, etc. Finally, the identification model of the encrypted network traffic type and the corresponding real-time identification project were also designed. The result of the verification of the project shows that using the project can achieve good effect.

Graphics and image processing

Parallel implementation of aerosol optical depth retrieval algorithm

2009, 29(06):  1665-1668. 

Asbtract ( )   PDF (634KB) ( )  

Related Articles | Metrics

To speed up the computation of the retrieval of Aerosol Optical Depth (AOD), a cyclic partition and collective communication strategy based on serial computation algorithm of Synergy of TERRA/MODIS and AQUA/MODIS (SYNTAM) was proposed to archive parallel computation of AOD retrieval from the both Moderate Resolution Imaging Spectroradiometer (MODIS) satellite (TERRA, AQUA) data by message passing on the IBM cluster 1600 high performance compute of Chinese Meteorological Administration. Experimental results demonstrate that the parallel SYNTAM can decrease computation time greatly. Compared with measurements from ground-based sun-photometers, the relative error of experiment results from the parallel SYNTAM is less than 22% in call cases, indicating that it can meet the needs of high accuracy such as air quality monitoring.

Pedestrian detection and tracking based on SACON background model

2009, 29(06):  1669-1672. 

Asbtract ( )   PDF (597KB) ( )  

Related Articles | Metrics

A new background modeling method based on Sample Consensus (SACON) was proposed for detecting foreground objects. The method, which has higher accuracy than other five popular methods in the experiment when seven typical video sequences were adopted, is suit for detecting and tracking the moving target under complex circumstances. On pedestrian detection and tracking, considering the target to be non-rigid, a new target appearance model containing spatial domain and color information was built based on SACON. The experimental results show that the method can describe pedestrian feature exactly and can detect or track targets with barriers and similar color and small targets with high accuracy.

Multi-object tracking by isMHI combining with CamShift

2009, 29(06):  1673-1676. 

Asbtract ( )   PDF (635KB) ( )  

Related Articles | Metrics

To realize the real-time tracking of multiple objects in video scene, a tracking method based on increased-step Motion History Image (isMHI)and Continuously Adaptive Mean Shift (CAMSHIFT) is proposed. The moving objects entering the video scene could be tracked based on the isMHI, and they could be locked and monitored based on CAMSHIFT instead once they turn to stay, moreover the joint algorithm between the moving state and resting state was also defined. Experimental results show that this method combines with their advantages and overcomes the faults from isMHI based and CAMSHIFT, respectively. So not only the continual, stable and real-time tracking of moving objects can be realized, but also resting objects in video scene with the error rate remains low. Thus, it can be applied to monitoring the interesting objects in the security or the traffic.

Point matching estimation for moving object tracking based on Kalman filter

2009, 29(06):  1677-1682. 

Asbtract ( )   PDF (609KB) ( )  

Related Articles | Metrics

The classic corner tracking algorithm does not meet the real-time requirement, and may lose the object mostly due to occlusions or/and some similar objects to the object. To solve the problems, a new algorithm based on Kalman Filter (KF) point matching estimation was proposed. Combined with predicting the target's location based on KF and dividing the image into blocks, the extracted multi-scale corner points which are geometrically invariant were given different weights for the responsible function, and the location was tracked by its average vector. The experimental results show that the proposed method can perform well in on-line and robust tracking systems.

Algorithm of target tracking based on Mean-Shift with adaptive bandwidth of kernel function

2009, 29(06):  1680-1682. 

Asbtract ( )   PDF (416KB) ( )  

Related Articles | Metrics

To achieve adaptive bandwidth of kernel function in Mean-Shift tracking algorithm, a new method based on comparing Bhattacharyya coefficients was proposed, in which, the Bhattacharyya coefficient was firstly computed out by using of center weighted and edge weighted histograms of template image, and then, a new Bhattacharyya coefficient during tracking was computed out according to the edge weighted histogram of candidate image and center weighted histogram of template image, finally 10% of the bandwidth of kernel function was expanded or shrunk by comparing two coefficients. The experiment results show that the method can avoid the problem of nonstop shrinking bandwidth effectively, and adapt tracking window to the change of the target size successfully.

Study of bandwidth adaptive Mean-Shift tracking

2009, 29(06):  1683-1686. 

Asbtract ( )   PDF (690KB) ( )  

Related Articles | Metrics

Aiming at the target scale and rotation motions in the tracking image, a bandwidth adaptive Mean-Shift algorithm combined with the Lindeberg scale theory was proposed. Based on the Mean-Shift mode, the proposed algorithm tracker regarded the target's scale and rotation as the equal variables with displacements, and the parameters of the target motions were obtained to locate target precisely in the image by computing the kernel bandwidth. Moreover, the simple location of target firstly through introducing Sum of Absolute Differences (SAD) into the Mean-Shift tracker can solve the problem that the tracker does not handle large erratic displacements effectively and can also reduce the Mean-Shift iterative times. Simulation Experiment results show that the proposed tracking algorithm is robust and effective to target affine motions, non-rigid shape changes and large erratic displacement.

Local deformation of mesh model based on restriction of multiple fixed points

2009, 29(06):  1687-1689. 

Asbtract ( )   PDF (443KB) ( )  

Related Articles | Metrics

The traditional free-form deformation methods by using control lattices are not suit for precise control of deformation. In order to solve this problem, a local deformation of mesh model based on restriction of multiple fixed points method was proposed, in which many complex restriction conditions were managed by using appropriate settings of fixed points and exact partial deformation model was obtained. Experimental results show that this algorithm can achieve exact deformation with low calculation cost.

Human ear recognition based on SIFT feature

2009, 29(06):  1690-1693. 

Asbtract ( )   PDF (607KB) ( )  

Related Articles | Metrics

The variety of ear angle and occlusion are the difficulties of ear recognition. The Scale Invariant Feature Transform (SIFT) is invariant to image scaling, translation and rotation. So the human ear recognition algorithm based on SIFT features was proposed. The SIFT features were computed from the ear image, and then image was divided into several overlapping grid regions, in which the local features of SIFT on each region are also computed. The matching similarity was computed between training image and test image, which was treated as global feature. The local feature and global feature were fused finally. The experiment results on ear database show that the algorithm works better than traditional global method, and is robust for the variety of ear angle and occlusion, and it is suitable for the recognition using the only one training sample.

Near-duplicate keyframes detection in broadcast domain based on Bayesian information criterion

2009, 29(06):  1694-1701. 

Asbtract ( )   PDF (473KB) ( )  

Related Articles | Metrics

Near-duplicate keyframes detection was an important part in content-based broadcast video search. After the definition of the acoustic change detection in audio segmentation was introduced, a new method based on Bayesian Information Criterion (BIC) algorithm was proposed for detecting near-duplicate keyframes, which result from the feature of salient parts extracted from a frame. Experimental results show that this method without threshold and learning has good performance in recall and precision.

Handwriting-based writer identification with complex wavelet transform

2009, 29(06):  1696-1698. 

Asbtract ( )   PDF (555KB) ( )  

Related Articles | Metrics

A challenging problem of off-line text-independent writer identification is that plenty of dynamic writing information with the handwriting images can not be extracted as writing features, this results in high error rate in off-line writer identification. In order to enhance the performance of off-line writer identification, a complex wavelet-based Generalized Gaussian Distribution (GGD) method was proposed. Compared with the traditional wavelet-based GGD method, the novel method is more efficient on texture extraction due to its time-invariant features and good directional analysis. Experimental results show that the proposed method achieves a better performance of writer identification.

Space dependent quality assessment for color inverse halftoning images

2009, 29(06):  1699-1701. 

Asbtract ( )   PDF (456KB) ( )  

Related Articles | Metrics

A quality assessment method was proposed for color inverse halftoning based on space information. Firstly, the study transformed the inverse halftoning image and the original image into S-CIELab color space, by defining perception color difference and perception gradient, a quantitative index is constructed for apraising the color inverse halftoning image. Experiments show that the index reflects is consistent with the result of the subject assessment. It helps to design more efficient color inverse halftoning algorithms based on image content.

CPU-GPU parallel computed fire simulation

2009, 29(06):  1702-1710. 

Asbtract ( )   PDF (947KB) ( )  

Related Articles | Metrics

The Smoothed Particle Hydrodynamics (SPH) method based on the particle interpolation was used to simulate the fire fluid. The Graphic Processing Unit (GPU) was utilized to accelerate the simulation, and the CPU was utilized to parallel search the neighbourhoods of each particle and control the particles' birth rate. Moreover, the vorticity field was added to the SPH model efficiently, which improved the details of particles' movement. In the final rendering period, the color field, directional point splatting and color refining technologies were applied to obtain a smoothed image of fire from discrete locations of particles. As the method belongs to Lagrangian method for simulating fluid, the fire is almost real in physical. And as the architecture is the GPU computation with auxiliary CPU, the simulation can be implemented in real-time.

Pattern recognition and Software

Leaf shape recognition system with multi-scale shape analysis

2009, 29(06):  1707-1710. 

Asbtract ( )   PDF (608KB) ( )  

Related Articles | Metrics

The leaf shape recognition system could detect a leaf's boundary through using an improved boundary tracing algorithm, and efficiently extract curvature features of normalized teeth length and curvature scale space image maxima set from the boundary by a technique of multi-scale shape analysis. The system retrieved and classified the leaf by shape matching with the samples in a leaves database by eccentricity, circularity and the curvature features. Experimental results indicate that the method can improve the precision and the recall of leaf shape recognition greatly.

Typical applications

Random load oriented pricing strategy for resource reservation in computational grid

2009, 29(06):  1711-1727. 

Asbtract ( )   PDF (748KB) ( )  

Related Articles | Metrics

Traditional reservation mechanisms often have the negative influences on the QoS of local tasks. To solve this problem, a resource reservation mechanism based on the reservation income and loss balance was proposed. First, according to the local task correlation statistical property, using the theory of probability method, the sum of the local task execution time probability distribution function in a period was given and proved. Then, when computing resources providers' utility, the loss brought by the local task was considered and the lowest resources price was resolved. The experimental results indicate that the proposed mechanism can safeguard local tasks effectively and effectively raise resource utilization and reduce task rejection rate.

Reliability modeling research of component software architecture based on unascertained set and Bayesian net

2009, 29(06):  1715-1721. 

Asbtract ( )   PDF (775KB) ( )  

Related Articles | Metrics

Unascertained set theory and Bayesian net were applied to the study of military information system software reliability modeling. They were used to describe component failure characteristics and get component reliability parameters. Finally, a reliability model of military information system software based on unascertained set theory and Bayesian Net was proposed. The reliability was tracked and monitored during the entire process of component software system by this model. Simulation experiments prove the practicability and validity of this model.

Parsed tree model of XML document based on relation table

2009, 29(06):  1719-1721. 

Asbtract ( )   PDF (424KB) ( )  

Related Articles | Metrics

Although the tree could reflect the hierarchical structure of XML document during its data paring and query operations, the efficiency of its data query is low. Based on the fact that the relation-table is a suitable data structure with a large amount of data storage, good query efficiency and operating function, a data model including the relationship table and the tree for storing XML documents is proposed. During its analytical process, the analysis time and the storage space could be reduced by event-based callback sub-analytic method. Thus, the new data model not only can remain the structure of XML document, but also enhance the query efficiency and operation convenience. The results of the XML document parsing and operation experiments with large amount of data show that the data model is especially suit for dealing with large XML documents.

Application of modified differential evolution in test data generation

2009, 29(06):  1722-1754. 

Asbtract ( )   PDF (649KB) ( )  

Related Articles | Metrics

A kind of software test data automated generation method based on Differential Evolution (DE) algorithm was proposed to solve the problems of the existing method, such as too complex test data generation and the difficultly setting parameters in the algorithms, etc. This method ameliorated the operators of DE algorithm to avoid the discrete test data generation based on DE algorithm. The feasibility and validity of this method was validated through specific experiments.

Coercion-resistant electronic voting scheme

2009, 29(06):  1725-1727. 

Asbtract ( )   PDF (473KB) ( )  

Related Articles | Metrics

Based on some security techniques of secret sharing, mix-net, deniable authentication etc, a coercion-resistant electronic voting scheme was proposed, in which the problem on forcing voter to vote and buying vote could be solved due to meeting the essential requirements of e-voting scheme. It was infeasible for the coercer to determine if a coerced voter complied with the demands in the scheme, so it improved coercion-resistance of electronic voting.

Describe a new type of mean filter and its application in pressure distribution

2009, 29(06):  1728-1747. 

Asbtract ( )   PDF (629KB) ( )  

Related Articles | Metrics

A new center-weighted median and mean filter algorithm with self-adaptive time-space filter window was proposed. The algorithm combined weighted center median filter with weighted mean filter for denoising Gaussian noise and salt-pepper noise. The experimental results show that this algorithm can effectively remove the mixed noise in the pressure distribution data, while its computing time is less than that of other linear algorithms of wavelet, Wiener filter and so on.

Application of D-S evidence theory in dynamic measurement of vehicle geometry parameters

2009, 29(06):  1731-1737. 

Asbtract ( )   PDF (739KB) ( )  

Related Articles | Metrics

Sensor array with multi-ultrasonic sensors was used to scan the traveling vehicles' geometric parameter, and multi-sensor data fusion algorithm based on D-S evidence theory was proposed to process the information collected from sensor array. The fusion results from DSP were uploaded to the PC which analyzed traveling vehicles' length, width, height and speed, and the primary data and technical support were provided for traffic control. Experimental results show that the proposed method to measure vehicle's geometric parameters can achieve an accurate measurement.

Design and implementation of OPC proxy server in remote monitoring system

2009, 29(06):  1735-1737. 

Asbtract ( )   PDF (493KB) ( )  

Related Articles | Metrics

To unify some devices' interfaces in remote monitoring system, based on VC++ platform, an OPC proxy was designed and exploited by employing object-oriented technology and Standard Template Library (STL). The proxy was mainly composed of four modules: The standard OPC interface module, the device driver module, the configuration module, and the data buffer. This OPC proxy could be accessed flexibly by different devices. The tests show that it has good stability and portability, and it meets the requirements well.

Design and implementation of audio data collection prototype system in TinyOS

2009, 29(06):  1738-1744. 

Asbtract ( )   PDF (735KB) ( )  

Related Articles | Metrics

Audio data collection in Wireless Sensor Network (WSN) has the characteristics of fast sample rate and large amount of data, thus posing new challenges to data storage, compression and transmission in WSN. Based on the above-said characteristics, an audio data collection protocol with storage, compression and reliable transmission was proposed. A prototype system based on the protocol was implemented on MicaZ nodes. Experimental results show that the prototype system can provide reliable transmission and reduce the number of packets.

Application of Linux parallel computing based on multithreading in HT-7 poloidal field control system

2009, 29(06):  1742-1744. 

Asbtract ( )   PDF (435KB) ( )  

Related Articles | Metrics

In order to realize real-time and precise controlling plasma during the experiment of HT-7 tokomak, this paper made use of the parallel system of multi-processors, and designed the attribute and CPU affinity of the two threads in one process. It actualized the feedback control of poloidal field control system, which achieved the goal of real-time control in 1ms at HT-7 tokomak, at the same time obtained the position of plasma by parallel computing.

Solution for GeoTIFF display base on NASA World Wind

2009, 29(06):  1745-1747. 

Asbtract ( )   PDF (443KB) ( )  

Related Articles | Metrics

In view of the demand of geographic information in the study, solution for GeoTIFF display base on NASA World Wind was proposed. On the basis of detailedly studying, the World Wind's layers display, the perspective of the earth's surface have been obtained by adding GeoTIFF-layer into World Wind's layers and modifying the diaphaneity of GeoTIFF image with alpha value. Experimental results show that the solution can display GeoTIFF quickly and achieve the earth's surface conveniently.

Improvement for lower store structure of Hypertable system

2009, 29(06):  1748-1750. 

Asbtract ( )   PDF (510KB) ( )  

Related Articles | Metrics

After analyzing the CellStoreV0 structure storing data of Hypertable system, the author summarized the defects. To reduce the redundant data, an improved CellStoreV1 structure was designed. The new structure used order-transpose structure to organize data and index structure to store data. The results of theoretic analysis and experimental tests show that the new structure takes up smaller space of disk than CellStoreV0.

Design and implementation of non-video and non-audio digital rights management system for educational resource

2009, 29(06):  1751-1754. 

Asbtract ( )   PDF (597KB) ( )  

Related Articles | Metrics

A non-video and non-audio digital rights management system was presented in order to overcome the lack of non-audio and video media processing in digital rights management system solutions. This system adopted the J2EE framework, based on the technologies such as HTTP remote access, Eclipse RCP and so on. Using PKI platform and encryption algorithm, it realized the encryption package for resources, the authority for users, the license management and so on. Users can read, play and print the encrypted digital content. Application results show that this system achieve an effective, safe and reliable non-video and non-audio digital rights supporting environment.