Table of Content

01 September 2010, Volume 30 Issue 9

Previous Issue    Next Issue

Artificial intelligence

Margin maximization feature weighting with better adaptability

2010, 30(9):  2275-2278. 

Asbtract ( )   PDF (651KB) ( )  

Related Articles | Metrics

Margin maximization feature weighting is an effective dimension reduction technique, and it is generally based on weighting techniques and similarity measure to construct their objective functions. One of the weaknesses is that the adaptability is not enough due to the complexity of different datasets. Therefore, the better adaptive margin metric (named separation) and the fuzzy weighting technique were introduced for developing the new optimal objective function. As demonstrated by the authors' experimental studies in synthetic datasets and benchmark datasets, the proposed algorithm is more adaptive.

MC supply chain distributed scheduling based on heterogeneous multiple ant colony algorithm

2010, 30(9):  2279-2282. 

Asbtract ( )   PDF (800KB) ( )  

Related Articles | Metrics

The deficiencies of the existing Mass Customization (MC) supply chain scheduling models were summarized. According to the characteristics of distributed scheduling and large scaled computing, a MC supply chain scheduling model was designed. Heterogeneous multiple ant colony algorithm was presented to achieve this scheduling model. This algorithm introduced more than one type of ant colony. All types of ant colonies with different pheromone updating mechanism and searching traits had mutual compensation of advantages as well as mutual competitive exclusion so that they can potentially cooperate smoothly. Collaborations among ant colonies distributed in different location of supply chain fully took the advantages of whole computing resources of supply chain, obtained fairly solving speed, and fulfilled scheduling requirements of multi-order including supplier selection and inter-enterprise scheduling. Finally practical manufacture case was used to prove the proposed algorithm model's validity, stability and order adaptability.

Hybrid extended ant colony algorithm merging differential evolution and reverse mutation

2010, 30(9):  2283-2285. 

Asbtract ( )   PDF (563KB) ( )  

Related Articles | Metrics

To overcome the premature convergence that frequently appears in the extended Ant Colony Optimization (ACO), a new hybrid method was presented, which mutated individuals by reverse mutation and differential evolution after every step in the evolution of extended ant colony algorithm. Evolutionary process of the extended ant colony algorithm would be affected by the calculation information of the reverse mutation and differential evolution algorithm. As a result, the diversity of population was maintained and the global optimization would be realized. The numerical results indicate that the proposed algorithm has high precision and strong robustness.

Pattern recognition and Software

Inertia weight adjustment strategy based on particle spacing and dynamic interval for PSO

2010, 30(9):  2286-2289. 

Asbtract ( )   PDF (534KB) ( )  

Related Articles | Metrics

The standard Particle Swarm Optimization (PSO) algorithm cannot adapt to the complex and nonlinear optimization process, because the same inertia weight is used to update the velocity of particles. In order to solve this problem, a strategy of inertia weight adjustment based on particle spacing and dynamic interval (PSSIW) was put forward. According to the particle spacing, the inertia weight was chosen, and the convergence rate of the algorithm were controlled by dynamic change of interval. Four different dynamic intervals were built in this paper. Sphere, Ackley and Rastrigrin functions were used to evaluate the intervals on the new PSO performance. Compared with the standard PSO algorithm, the new PSO algorithm has the ability to escape from the local minimum, so it is a global particle swarm optimization algorithm.

Artificial intelligence

AI-PPC: Projection pursuit model for dimension reduction based on artificial immune algorithm

2010, 30(9):  2290-2293. 

Asbtract ( )   PDF (598KB) ( )  

Related Articles | Metrics

To solve the dimension reduction with Projection Pursuit (PP) model, the theory of Artificial Immune (AI) system was introduced. The immune clone-selecting algorithm was used to optimize the projecting direction, with the purpose to project the data from high dimensional space to a low one. Therefore, the projection not only reduced the computation complexity during the process of data mining, but also made the data shrinking possible. Besides, the clustering results between the initial and the processed data with K-Means and other clustering algorithms were compared. And the experimental results verify the validity of the proposed algorithm.

Data association method of SLAM based on improved minimal connected dominating set

2010, 30(9):  2294-2296. 

Asbtract ( )   PDF (618KB) ( )  

Related Articles | Metrics

The Minimal Connected Dominating Set (MCDS) method can solve the problem that the scale of data association increases with the map grows in process of Simultaneous Localization and Mapping-building (SLAM). Therefore, two improvements were introduced. Firstly, MCDS was constructed lingeringly. Secondly, MCDS was searched adaptively. The MCDS of K times was set up delay at K+1 times. According to the number of environment characteristics, the map data within N time was searched. At the same time, the joint compatibility criterion and branch and bound algorithm was used in data association. The simulation results indicate that data association results of minimizing connected dominating set are reliable, and the capability of reducing computational complexity is outstanding.

Least square support vector machine based on unconstrained optimization

2010, 30(9):  2297-2300. 

Asbtract ( )   PDF (572KB) ( )  

Related Articles | Metrics

To solve the problem that the optimization of Least Square Support Vector Machine (LSSVM) consumes too much time, a new method called Newton-LSSVM, which used Newton optimization to solve the optimization problem of LSSVM, was proposed. The method first converted LSSVM to unconstrained optimization, and then used Newton optimization to solve the optimization problem iteratively. The experimental results show that Newton-LSSVM can reduce the training time greatly but do not decrease the generating ability of LSSVM.

Integrated optimization of railway dangerous goods station based on combined genetic algorithm

WANG Zhe

2010, 30(9):  2301-2304. 

Asbtract ( )   PDF (681KB) ( )  

Related Articles | Metrics

As one of the basic infrastructures of railway dangerous goods transportation, the location selection, construction scale and functional division reasonability of railway dangerous goods station are important to improve the railway dangerous goods transport efficiency, satisfy transportation requirements and control environmental risk. In order to solve the large-scale portfolio alternatives and the difficult calculation of multi-objective location-allocation model for railway dangerous goods station integrated optimization, a combined Genetic Algorithm (GA) was used to optimize this issue. The simulation results show that this method is of fast convergence rate and stable operation, and it can effectively solve the related problems.

Ball velocity estimation method based on RANSAC and Kalman filter for soccer robots

2010, 30(9):  2305-2309. 

Asbtract ( )   PDF (813KB) ( )  

Related Articles | Metrics

A new method was proposed to estimate the ball velocity in the Robot World Cup (RoboCup) Middle Size League (MSL) more effectively. The method was based on Kalman filter and RANSAC algorithm. Firstly several frames of the ball positions were stored and then Kalman filter was used to optimize the positions. Hundreds of models were built and RANSAC algorithm was employed to calculate the best model as the final ball velocity. The experimental results show that the proposed algorithm is effective. Furthermore, RANSAC algorithm can eliminate the outlier effectively, so when there are lots of noises in the ball information, the ball velocity can still be estimated with high accuracy by using the presented algorithm, and higher robustness can be achieved being compared with the other existing methods.

Regression method based on SVM classification and its application in production forecast

2010, 30(9):  2310-2313. 

Asbtract ( )   PDF (587KB) ( )  

Related Articles | Metrics

For non-linear problem, the forecasting technique of pre-classification and later regression was proposed, based on the classification approach of Support Vector Machine (SVM). According to the actual requirements and professional knowledge, the sample cluster was classified first to decide the types of the test samples. Next the values of the test samples were forecast with the regression algorithm. Compared with other forecasting techniques and their forecasting results, this algorithm outperforms others in grain output prediction. The findings of the experiment show that the fitted value obtained from the forecasting technique of pre-classification and later regression is much more accurate than that from regression.

Database and knowledge engineering

XML weak functional dependency and inference rule based on XML Schema

2010, 30(9):  2314-2316. 

Asbtract ( )   PDF (475KB) ( )  

Related Articles | Metrics

To solve the logical implication problem of Extensible Markup Language (XML) weak functional dependency under incomplete information circumstances, the weak functional dependency and inference rules for XML based on XML Schema were discussed. The concepts of XML Schema and incomplete XML document tree conforming to XML Schema were formalized. Based on the concepts of subtree information equivalence and subtree information consistency, the definition of XML weak functional dependency was given and its properties were studied. A set of inference rules for XML weak functional dependency was presented and its soundness and completeness were given. This work is foundation of normalizing XML Schema with XML weak functional dependency under incomplete information circumstances.

Research of XML regular path expression query based on automaton

2010, 30(9):  2317-2320. 

Asbtract ( )   PDF (612KB) ( )  

Related Articles | Metrics

Currently, the query technique that supports finite automaton Regular Path Expression (RPE) is valuable in the research area of eXtensible Markup Language (XML) query in semi-structured data mode. Lots of middle paths were produced by many research methods that rewrite complex RPE with "//" symbol and "*" wildcard. The authors designed an efficient XML RPE query disposing method—Cutting Schema Automaton Snippet (CSAS) using Object Exchange Model (OEM) as XML data model and finite automaton as query model, put forward rewriting technology that cut out snippet of XML Schema transforming into automaton to rewrite "//" and "*", the query optimization was realized by Pruning techniques and predication back strategy. The experimental results prove that CSAS is an effect query method of RPE.

Incremental feature selection algorithm for data stream classification

2010, 30(9):  2321-2323. 

Asbtract ( )   PDF (584KB) ( )  

Related Articles | Metrics

The complexity of feature selection for real-world data stream will increase because of high-dimensional data and concept drifting. Information gain is one of the most effective feature selections, but its computation is too huge. In order to deal with the problem, the authors proposed an incremental feature selection algorithm based on improved information gain, named IFS. Firstly, the algorithm selected candidate feature set by using independent evaluation function; secondly, feature set was selected with classifer role in candidate feature set. Finally, it selected feature set again while encountering concept drifting. The experiment was operated on moving hyperplane data set and UCI data set. The experimental results show that the proposed approach can adapt to the concept drifting with higher speed and works much better than non-feature selection algorithms.

ITBI: Labeling scheme for XML data update

2010, 30(9):  2324-2328. 

Asbtract ( )   PDF (766KB) ( )  

Related Articles | Metrics

Labeling scheme is the basis for Extensible Markup Language (XML) query processing. The traditional labeling schemes use numbers based on natural order, which is hard to support XML updating. A new labeling scheme, called ITBI (Inorder Traversal Based Integer), was proposed. ITBI created a mapping between integer and complete binary tree, and a new partial order based on inorder traversal of binary tree was defined, which just needed reordering the natural numbers to support dynamic XML. Meanwhile, based on the conceptions of previous ITBI, next ITBI, ITBI distance, the algorithm for assigning dynamic labels with the smallest size was presented, which controlled the increase in label size efficiently. The experimental results verify the validity of the proposed method.

Attribute reduction of rough sets based on differential evolutionary algorithm

2010, 30(9):  2329-2331. 

Asbtract ( )   PDF (483KB) ( )  

Related Articles | Metrics

The attribute reduction is one of the cores of Rough Set (RS) theory. To solve minimum attribute reduction by Differential Evolution (DE) algorithm is a new direction. In this paper, an improved differential evolution algorithm and a new definition form of fitness function were proposed. And on this basis, an attribute reduction algorithm based on the improved differential evolutionary algorithm was put forward. Finally, the simulation experiments and a comparative analysis with an existing algorithm were carried out for the algorithm with multiple sets of data. The experimental results show that the algorithm is effective and fast.

Algorithm for discovering frequent item sets based on optimized and regrouped item sets

2010, 30(9):  2332-2334. 

Asbtract ( )   PDF (480KB) ( )  

Related Articles | Metrics

Discovering frequent item sets is the main way of association rules mining, and it is also the focus of the study in algorithms for association rules mining. The classical Apriori algorithm and its improved algorithms of association rules mining can be generally classified as one based on SQL and the other based on memory. To improve the data-mining efficiency, the authors proposed an efficient algorithm for discovering frequent item sets. After analyzing the efficiency bottlenecks in some algorithms based on memory, the algorithm used a method that could generate and test candidate item sets efficiently to optimize the speed of item sets generation. The experimental results show that the proposed algorithm can assuredly improve the mining efficiency.

Multi-keyword search over P2P based on Bloom filter

2010, 30(9):  2335-2338. 

Asbtract ( )   PDF (769KB) ( )  

Related Articles | Metrics

In keyword search over Peer-to-Peer (P2P) based on standard Bloom Filter (BF), it is difficult to estimate the maximum number of the data sets because they are increasing continuously; hence, two problems show up: it is difficult to determine the upper value of the length of BF vector, and it cannot handle the multi-keyword search efficiently. To solve these problems, the authors proposed a new structure called Block Dynamic Bloom Filter (BDBF) which partitioned the keyword based on the frequency, and presented a new Top-k multi-keyword search model: the node sends the higher frequency DBF firstly, and then sends the secondary higher frequency DBF if need. The experimental results show that the proposed method can be applicable for the increasing data of index list, and it can also decrease the network's traffic and efficiently resolve the problem of Top-k query in multi-keyword search over P2P.

Research and implementation of key techniques of encryption and decryption system on heterogeneous database

2010, 30(9):  2339-2343. 

Asbtract ( )   PDF (800KB) ( )  

Related Articles | Metrics

Data encryption is an effective way to guarantee the confidentiality of information. Concerning the poor compatibility of heterogeneous database and single type query of encrypted data in the general encryption and decryption systems, the authors provided a new database encrypted mode on the basis of domain metadata: adopted the Object Relation Mapping (ORM) mechanism for heterogeneous databases, improved flexible and various cryptograph query by building ciphertext index, and designed and implemented the encryption and decryption system on the heterogeneous database. The theoretic analysis and the experimental results show that the system can support various types of heterogeneous databases, provides multi-mode cryptograph queries and increases the security of database encryption.

Web services composition method based on functional attribute semantics

2010, 30(9):  2344-2347. 

Asbtract ( )   PDF (818KB) ( )  

Related Articles | Metrics

Web services composition method is one of the hot research issues. Most of previous work built a composite Web service by chaining the input and output of a Web service without considering the functional semantics of the Web service itself. Furthermore, with the rapid growth of Web services quantity, if every possible composition is considered, it will increase the complexity of the combination of services. The authors proposed a kind of graph model service composition method, established a description model of Web service semantic functional properties with the semantic association between the functional parameters. For those functional attributes related to the semantic Web services, a graph path search method was employed to finish the combination of services. It narrows the scope of participation in services composition and improves the efficiency and effectiveness.

Text classification algorithm based on hidden Markov model

2010, 30(9):  2348-2350. 

Asbtract ( )   PDF (675KB) ( )  

Related Articles | Metrics

A number of sophisticated automatic text classification algorithms have been proposed in recent years, but those algorithms are mainly based on the probability and statistical models and have not established a relationship with the syntax and semantic of text. In this paper, a new automatic text classification algorithm using Hidden Markov Model (HMM) was proposed. At first, a feature set was built to distinguish the document types. Then the different sequences of feature words were regarded as the different observations generated by HMM classifiers. The state transition sequence of a specific HMM classifier implied the process of document's formation and evolution in a specific document type. When a document was classified, the result was created by the HMM classifier which could get the greatest generation probability according to the document. To some extent, some syntactic and semantic features of different document were represented by the classification model. The model can be applied to automatic multi-category text classification, and it has high classification efficiency.

Software process technology

Mechanism of service virtualization adaptive to variability of business requirements

Wang-hu CHEN Jing LI

2010, 30(9):  2351-2353. 

Asbtract ( )   PDF (657KB) ( )  

Related Articles | Metrics

To enable users to access heterogeneous Web services transparently in problem solving environments based on virtual organization mechanisms, a service virtualization mechanism supporting the variability of business requirements was proposed. A virtual service model was proposed based on the description model of business requirements variability, which could support various requirements. Operations for virtualization and concretion were also defined base on the proposed approaches to service matching, transformation, etc. The analysis and experiments show the proposed mechanism can improve the efficiency for handling services.

Meta-model-based model organization and transformation of design pattern unit in MDA

2010, 30(9):  2354-2357. 

Asbtract ( )   PDF (689KB) ( )  

Related Articles | Metrics

Design patterns are various in kind and constantly change. To achieve the purpose of applying design patterns to Model Driven Architecture (MDA) from idea and application, one way is used to solve the problem of pattern disappearance which comes into being at the process of pattern instantiation, and guarantee the independence of patterns, at the same time apply this process to multiple design patterns. To solve these two problems, the authors took the modeling method of design pattern unit based on meta-model, divided basic operations into atoms in the meta-model tier and then combined the atoms to complete design pattern units meta-models without business logic. Then after one process of conversion, it realized the purpose of making up various pattern units meta-model as well as dividing business logic and pattern logic at the same time.

Reliability optimization of virtual machine monitor Xen

2010, 30(9):  2358-2361. 

Asbtract ( )   PDF (613KB) ( )  

Related Articles | Metrics

Optimization study was done on the Xen which was open and mainstream virtual monitor machine. Theories including Communicating Sequential Processes (CSP) and software architecture were utilized to formalize architecture for block device in Xen. Design rules were proposed to constrain concurrent interactions among components of architecture for block device. Therefore, deadlocks were prevented in theory and the reliability was improved. With the guide of the design rules, the related programs were overhauled and revised. Preliminary experiments indicate that I/O throughput aroused by the overhaul is reduced. However, reliability of the system is enhanced. The optimization is still valuable.

XML-based man-machine interaction engine for mobile devices

2010, 30(9):  2362-2364. 

Asbtract ( )   PDF (588KB) ( )  

Related Articles | Metrics

Based on the current situation of development and features in traditional areas of man-machine interaction, a development model for mobile application was designed. In order to enhance the development efficiency and quality of man-machine interface, with this model, an engine design was presented by using the ideology of Service-Oriented Architecture (SOA), which separated the User Interface (UI), logical code and resources. The Extensible Markup Language (XML) is of good expansibility, self-descriptive, cross-platform, tree storage structure and etc. This engine （called XmlSupervisor）can support the usage of XML to develop the user interface in mobile applications, which provides a reference for the design and develops the man-machine interface for mobile devices.

Approach to activity diagram model driven testing for Web applications

2010, 30(9):  2365-2369. 

Asbtract ( )   PDF (727KB) ( )  

Related Articles | Metrics

A testing method driven by Activity Diagram (AD) model for Web applications was proposed. This approach generated test sequences from activity diagrams that satisfied round-trip coverage criteria, generated test data that drive the execution of test sequences based on test input syntax, integrated test data to test sequences for test case generation, ran the test cases for Web application testing, and reported the test results. A prototype tool that supported the proposed approach was implemented. An experiment has been carried out to validate the feasibility and effectiveness of the presented approach.

Data integration method based on SOA software architecture

2010, 30(9):  2370-2373. 

Asbtract ( )   PDF (649KB) ( )  

Related Articles | Metrics

According to the autonomy, semantic complexity and diversity of cross-platform of data, as well as combining the applications and requirements of digital business platform, a data integration method based on Service Oriented Architecture (SOA) software architecture was proposed in this paper. The proposed method, which was on the basis of Java Business Integration (JBI), could solve the problems of semantic aspect, multiple messages, and autonomy issues by means of adding four service modules. Finally, the proposed method was implemented by combining the relative techniques and system architecture of SOA.

Multi-thread quicksort algorithm based on partitioning

2010, 30(9):  2374-2378. 

Asbtract ( )   PDF (761KB) ( )  

Related Articles | Metrics

Firstly, the improved method based on Java was introduced. A reasonable experimental threshold had been obtained, which improved the efficiency of quicksort when sorting a small dataset. Secondly, quicksort was optimized by using the multi-thread technology, and experiments were conducted to compare the performance of the single-thread and multi-thread algorithms. The results show that the multi-thread algorithm is several times faster than the single-thread one on multi-core computers. Finally, theoretical analysis was made on multi-thread quicksort algorithm, and the theoretical upper limit of the algorithm was obtained on multi-core computers.

Information security

Probability and credibility-based trust model for pervasive computing

2010, 30(9):  2379-2382. 

Asbtract ( )   PDF (635KB) ( )  

Related Articles | Metrics

According to the traits of trust in pervasive computing and the shortages of the existing trust model, a probability and credibility-based trust model was given. Considering the subjective and objective factors, the trust was acquired by subjective trust, directive trust and recommendatory trust. Based on the credibility-based matching degree algorithm, the entities falling short of recommendatory condition were excluded before calculation. And combining the update of recommendatory chain, the problem of vicious recommendation was solved. The trust was more credible.

User security management based on trust constraint

2010, 30(9):  2383-2385. 

Asbtract ( )   PDF (707KB) ( )  

Related Articles | Metrics

It is very difficult to identify the malicious acts of users and to control the future acts of users for the existing static certificate-based user management in an open grid environment because of the dynamics and uncertainty of user behavior. To address the problem, a method for user security management based on trust constraints was proposed. In this method, according to the result of trust computation, the trust black-list and white-list were established by monitoring the change of trust level of users, and trust policies that stated the relationship between user trust and asset value were set. The testing results show that, as a dynamic trust constraint of access control mechanism, the trust black-list, white-list and trust policies strengthen the constraints on the system authorization, and effectively control the user behaviors by associating user's capacity accessing to resources with his or her history behaviors, which improves system security.

Intrusion tolerance model based on autonomic computing

2010, 30(9):  2386-2388. 

Asbtract ( )   PDF (645KB) ( )  

Related Articles | Metrics

Intrusion tolerance has been a key technology of system survivability. Concerning the absence of self-adaptability on existent intrusion tolerance systems, an intrusion tolerance model based on autonomic computing was proposed. The reliability of the network connection was analyzed in real-time to generate the initial reliability by an autonomic feedback law, and the classification between suspicious information and confident information was guaranteed for implementing the tolerance on suspicious connections through the dynamic reliability optimization. The simulation results show that the intrusion tolerance model with autonomic feedback law can strengthen the self-adaptive performance of system.

Attack and improvement of Zhang's multi-signature scheme

2010, 30(9):  2389-2392. 

Asbtract ( )   PDF (632KB) ( )  

Related Articles | Metrics

After analyzing the ID-based digital multi-signature scheme based on RSA (Rivest-Shamir-Adleman) proposed by Zhang et al. in 2008, a complete attack algorithm was proposed. Firstly, Zhang et al.'s scheme and the attack algorithm were introduced, and then two improved schemes against to the security problem of Zhang's scheme were proposed. The random operation of each signer was changed, and part of computation operation was transferred in both of the improved schemes. The results show that the improved schemes are secure without decreasing the efficiency of signing and verifying. Therefore, the improved schemes are more valuable in practical application.

Efficient variant of RSA cryptosystem

2010, 30(9):  2393-2397. 

Asbtract ( )   PDF (830KB) ( )  

Related Articles | Metrics

The performance of RSA decryption has direct relationship with the efficiency of modular exponentiation implementation. The authors proposed a variant of RSA cryptosystem by transferring some decryption computations to encryption and multi-prime principle to reduce modules and private exponents in modular exponentiation. The experimental results show that the decryption speed and security level of RSA have been substantially improved. The variant can be efficiently implemented in parallel and the parallel implementation of the variant on multi-core devices can further improve the overall performance of RSA system.

One-way hash algorithm based on chaotic coupled dynamic parameters

2010, 30(9):  2398-2400. 

Asbtract ( )   PDF (468KB) ( )  

Related Articles | Metrics

Combining the advantages of chaotic coupled system and conventional one-way hash algorithm, a new keyed one-way hash function was presented. In the proposed approach, chaotic coupled system was made by Tent map and Logistic chaotic map, which produced chaotic data as dynamic parameters that replaced the fixed parameters of conventional hash function. The experimental results show that this method has large key space, strong one-way property, and sensitivity to the initial conditions and keys.

Secure and efficient group key agreement protocol

2010, 30(9):  2401-2403. 

Asbtract ( )   PDF (610KB) ( )  

Related Articles | Metrics

Group Key Agreement (GKA) is one of the important methods to ensure the subsequent secure communication. A new group key agreement protocol was proposed in this paper. In this protocol, the participants could verify the honesty of other participants by a series of algorithms. The new protocol realized the secure session key agreement with lower computational cost. In addition, it has the fault-tolerance property and the long term key-reuse property. The performance analysis results show that this protocol can resist many common attacks.

Non-interactive key exchange based on cognitive radio in delay tolerant network

2010, 30(9):  2404-2407. 

Asbtract ( )   PDF (808KB) ( )  

Related Articles | Metrics

The communication is opportunistic in delay-tolerant network, and the nodes spend limited time in sending data. The network performance will become worse, if the current protocols on key exchange are applied to secure the channel. The reason is that there are multiple interactions for getting node identity and key material among nodes. To solve the problem, the authors put forward a new scheme — non-interactive key exchange scheme based on cognitive radio (CRNIKES). Nodes consulted the shared key with the technologies of identification based on spectrum and the bilinear pairing without interaction in networks. The efficiency of scheme is O(TC), and the TC is the time for spectrum cognitive. Since the TC is constant and the efficiency is independent of the size of network, this scheme is efficient and adapts to the delay-tolerant network.

Reversible data hiding based on prediction error difference expansion of ternary components

XIONG Zhi-yong WANG Jiang-qing

2010, 30(9):  2408-2412. 

Asbtract ( )   PDF (917KB) ( )  

Related Articles | Metrics

To avoid the drawback of Difference Expansion (DE) algorithm which must embed a location map and the quality decline of stego-images from excessive modulation to pixels, a reversible data hiding algorithm for color images was proposed. The algorithm made use of correlation of color components to decrease difference and use smaller expansion to change the pixels value of some components. The expansion direction was determined by the quantity of overflow and underflow pixels. The embedding scheme adopted the adjusting method of single direction pixels value to prevent overflow or underflow, and embedded a few adjusting value instead of location map, so the embedding capacity was increased; finally, improved the difference histogram shifting technique to control the capacity and distortion. According to the sequence of critical value, the adjusted pixels value could be restored. The experimental results show the embedding capacity and the quality of stego-image are significantly improved in comparison with other new or classical algorithms.

Synchronization and anti-synchronization of time-delay chaotic system and its application to secure communication

2010, 30(9):  2413-2416. 

Asbtract ( )   PDF (516KB) ( )  

Related Articles | Metrics

Based on Lyapunov stability theory and linear matrix inequality technique, the synchronization and anti-synchronization problem for a class of chaotic neural networks with delay was discussed, their own state feedback controller were presented, also the synchronization and anti-synchronization of this class of time-delay chaotic systems were realized in theory. Finally, this class of chaotic system was applied to secure communication, by system switching between the synchronization and anti-synchronization, a specific digital secure communication scheme was designed. The numerical simulation results verify the effectiveness of the method.

Computer simulation and graphics and image processing

Review and prospect of image dehazing techniques

2010, 30(9):  2417-2421. 

Asbtract ( )   PDF (910KB) ( )  

Related Articles | Metrics

Image dehazing is an important issue that interests both digital image processing and computer vision areas. This paper surveyed the recent techniques for image dehazing from the point view of physical model and digital image processing. Some fundamental principles of typical methods were summarized and the state-of-the-art progress was presented. For some typical, new haze removal algorithms, both the perceptual visual effect and objective evaluation data were presented to illustrate their haze removal performance. Finally, some future research topics on image dehazing were suggested.

Progressive 3D scenes replacement mechanism for P2P overlay

2010, 30(9):  2422-2426. 

Asbtract ( )   PDF (1015KB) ( )  

Related Articles | Metrics

Recently, walkthrough system of large-scale virtual environments has been a new topic of WebGIS. In order to relieve the contradiction between limit storage of user terminal and massive 3D scenes via Internet, the authors proposed a new Progressive Scenes Replacement Mechanism (PSRM) which suited the Peer-to-Peer (P2P) overlay. New concepts of "reuse degree", "visual preservation", and "preservation for Area of Interest (AOI) neighbors" were introduced respectively. Thus, the old scenes which needed to be replaced could be identified, and these scenes were replaced from high resolution to low resolution progressively. The simulation results show the PSRM improves more in the downloading fill ratio, downloading fill ratio of base mesh compared with the current system, and the workload of server is reduced greatly by using PSRM in the walkthrough.

Approach to feature-based image mesh generation

2010, 30(9):  2427-2430. 

Asbtract ( )   PDF (674KB) ( )  

Related Articles | Metrics

Image resizing based on mesh deformation is becoming ever more important with the proliferation of display units with different aspect ratios. Appropriate mesh representation for the input image is a key aspect to the success of this kind of algorithms. An effective approach to feature-based image triangular mesh generation was proposed. The feature points extracted from the image edges and the uniformly located boundary points were used as the initial points set of the modified dart-throwing algorithm. The distance, each pixel to the closest edges, was computed by the distant-transformation of the edge image. It was used as the control parameter of dart-throwing algorithm. The Delaunay algorithm was then exploited to create a triangular mesh. The experimental results illustrate that the generated meshes well describe the edge-structure of the input images. Moreover, the post-processing algorithms will be more efficient due to the smaller number of the mesh nodes.

Mesh simplification algorithm based on keeping shape feature

2010, 30(9):  2431-2433. 

Asbtract ( )   PDF (481KB) ( )  

Related Articles | Metrics

Currently, in order to reduce the consumption time in simplifying model, lots of mesh simplification algorithms ignore the simulation quality of simplified model. A mesh simplification algorithm based on keeping profile feature was proposed. All the vertices in the model were stored in a priority queue, which sorted vertices ascending according to their collapse values. The top vertex in the queue was to be folded first and updated the vertices which were affected, then the queue was sorted again. Compared to other algorithms, the data structure of this algorithm was simple to store and the simplified model also maintained the visual characteristics of the original model better.

Real-time visualization algorithm of 2D unsteady flow field

2010, 30(9):  2434-2437. 

Asbtract ( )   PDF (794KB) ( )  

Related Articles | Metrics

In order to improve the rendering quality and speed of unsteady flow visualization results, the authors presented an improved unsteady flow visualization algorithm based on advection and texture blending. The temporal coherence in the flow animation was got by image advection and the spatial coherence constructed in each frame was got by particle advection, and the temporal-spatial coherence was unified by texture blending at last. In this way, the texture detail of flow animation is clear and the change in each frame is smooth. Furthermore, this algorithm can achieve a real-time frame rate. The high temporal-spatial coherence can exactly reflect unsteady flow dynamic variety.

Feature extraction of self-adaptive illumination varying based on fuzzy control

2010, 30(9):  2438-2440. 

Asbtract ( )   PDF (596KB) ( )  

Related Articles | Metrics

To improve identification ability of visual features when illumination varies, the feature extracting method of self-adaptive illumination based on fuzzy control was proposed. Unstable track problem caused by using unique kind of features could be settled by building feature set through dynamically selecting color features and edge features. Local illumination varying detection function was determined to detect illumination variation. Fisher criterion was used to evaluate feature identification ability and renew feature set online. By doing so, the problems of illumination variation and noise factor could be settled. Fuzzy control method was used to control renewing rate of feature set according to illumination variation. Stable tracking target can be realized when illumination varies. Compared with color feature-based visual tracking method, its accuracy is increased.

Implementation of multi-scale Retinex image enhancement algorithm based on CUDA

2010, 30(9):  2441-2443. 

Asbtract ( )   PDF (511KB) ( )  

Related Articles | Metrics

The Multi-Scale Retinex (MSR) image enhancement algorithm can produce best performance in most cases, but the computation load is very huge especially for large image. In this paper, an efficient approach was proposed to accelerate MSR image enhancement speed on Graphic Processing Unit (GPU) via Compute Unified Device Architecture (CUDA), and time consuming modules, such as multi-scale Gaussian filtering, log-differencing and dynamic compressing, were implemented in GPU. The experimental results show that the proposed method can reduce the time consumption significantly. As the image size increases, it can get a more than 100x speedup.

Rate control optimization algorithm based on Cauchy distribution for H.264/AVC

2010, 30(9):  2444-2448. 

Asbtract ( )   PDF (722KB) ( )  

Related Articles | Metrics

Due to the limited bandwidth of communication channel, it is necessary to control the bit rate output of video coding. First, by introducing Energy Mean Squared Error (EMSE) and analyzing the statistics of extensive video sequence, the authors developed a simple linear distortion-quantization model. Then, based on quantization coefficients' probability distribution characteristic of H.264 encoder, an improved Cauchy-distribution-based rate-quantization model was proposed. Finally, the Lagrangian method was adopted to derive a bit allocation solution to the optimization of rate distortion. The experimental results demonstrate that, compared with the rate control scheme JVT-G012 applied to H.264 reference software, the proposed rate control algorithm enhances the accuracy of rate control and the Peak Signal Noise Ratio (PSNR), and improves the subjective video quality as well.

Construction and generalization of Hu moment invariants

2010, 30(9):  2449-2452. 

Asbtract ( )   PDF (542KB) ( )  

Related Articles | Metrics

Hu moment invariants play a very critical role in image description. In order to construct moment invariants suitable for certain requirements briefly and verify their information redundancy effectively, a new construction method was presented by inducting the relation formula of real-complex moments. Also some concepts as moment invariants polynomial and moment invariants polynomial space were discussed so as to characterize its algebra structure. Lastly, the author listed overall practical moment invariants based on 3-order moments without informational redundancy. Compared with the typical construction approaches: algebraic theoretic construction method and triangle function construction method, this algorithm is more brief and effective, and also more suitable for discovering information redundancy. Moreover, these new moment invariants are robust and perform well in image description.

Image segmentation of maximum inter-class cross entropy based on 2D histogram oblique segmentation

2010, 30(9):  2453-2457. 

Asbtract ( )   PDF (756KB) ( )  

Related Articles | Metrics

With the approach based on 2D histogram oblique segmentation, a fast image thresholding method based on maximum inter-class entropy was presented in this paper. Firstly the thresholding method was formulated, based on maximum inter-class entropy and 2D histogram oblique segmentation, and then its fast recurring algorithm was deduced, finally the defined array operations and the algorithm were combined to search the optimal threshold vector. The experimental results show that the proposed method can not only get better generalization, but also has higher efficiency than the current thrsholding method based on 2D oblique segmentation.

New medical image segmentation algorithm based on subregion similarity

2010, 30(9):  2458-2460. 

Asbtract ( )   PDF (648KB) ( )  

Related Articles | Metrics

Introducing the traditional region growing method into a contour approximating method, a new segmentation algorithm based on subregion similarity was presented. Firstly, an initial polygon contour was brought in by human-computer interactive process. Then the region of interest was obtained by using a sub-region similarity which served as driving force of the contour evolution. The experimental results show that the algorithm is of more anti-noise ability than the region growing method, and can divide up the region of interest efficiently.

Combination of MRF model and particle swarm optimization algorithm for texture segmentation of remote sensing images

2010, 30(9):  2461-2463. 

Asbtract ( )   PDF (665KB) ( )  

Related Articles | Metrics

Markov Random Field (MRF) model is a classical image texture analysis method, which has been widely used in image texture simulation and segmentation. However, when the classical simulated annealing algorithm is used to compute a global optimal solution, it cannot satisfy the performance requirements of texture analysis and processing due to less efficiency. A fitness function which could determine texture class was designed, and the use of Particle Swarm Optimization (PSO) was proposed to calculate the optimal solution of it. Based on the proposed method, texture segmentation of remote sensing images was carried out. Compared with the simulated annealing algorithm, the experimental results show that PSO algorithm can reduce the computational complexity and it is a more effectively optimal method of image segmentation.

Color printing character image segmentation based on K-L transform and fuzzy set theory

2010, 30(9):  2464-2466. 

Asbtract ( )   PDF (453KB) ( )  

Related Articles | Metrics

According to the features of color printing character images, a* channel of Lab* color space was selected for the further process. Using fuzzy logic method and threshold segmentation, the image could be divided into three regions: target region, background region, and fuzzy region. Combined with neighborhood membership information and gray information by K-L transaction, the gray level field was changed into fuzzy field in fuzzy region. Segmentation could be done based on fuzzy field. The proposed algorithm can get better segmentation for the color printing images in the industrial environment, the time complexity of the presented algorithm is not higher than the traditional threshold segmentation algorithm, and the segmentation accuracy is superior to the traditional algorithm.

Pattern encoding method of visual 2D barcode

2010, 30(9):  2467-2469. 

Asbtract ( )   PDF (458KB) ( )  

Related Articles | Metrics

The authors proposed a new pattern encoding method of the visual 2D barcode based on halftone technology and texture features in halftone images. Combining the similarity of halftone texture with the distribution of encoded information in code-image, the authors also defined code-patterns to denote 0 and 1 and carried on pattern replacement to encode with the principle of consistency of local gray level. The experimental results show that the proposed method improves the encoding capacity and visual effect of coded images.

Mathematical modeling of closed processing paths on free-form surface described by point cloud

2010, 30(9):  2470-2472. 

Asbtract ( )   PDF (669KB) ( )  

Related Articles | Metrics

A problem about identifying the closed processing paths on the free-form surface needs to be solved. First, a large number of point cloud data obtained through the scanner was reduced by the method of establishing three-dimensional grid. And then, contour grid was extracted. One feature point with the three-dimensional coordinate and the normal vector was calculated in each contour grid. These feature points were ordered, and then processing paths were described by the Bezier curves cluster calculated by feature points. At last, the closed processing paths were indicated by a seal smooth curve that had solved the problem of identifying the close processing paths.

Computer system simulation for gourd pyrography painting

2010, 30(9):  2473-2476. 

Asbtract ( )   PDF (688KB) ( )  

Related Articles | Metrics

To obtain the computer simulation effects of gourd pyrography images, Efros et al.'s block-based texture synthesis and transfer algorithm was improved, and the resulted image was effectively fused. In this method, the pyrography image was obtained through matching the brightness histogram in YCbCr color space, and then it was deformed by 16 control points according to the principle of Levin's least squares to achieve the image fusion in lαβ color space. The comparison of the proposed method with the Poission image editing algorithm shows that the simulation image effect of the proposed algorithm is closer to the real gourd pyrography image effect.

Network and communications

Multi-bounded QoS routing protocol and performance analysis for mobile Ad Hoc network

Qian GAO

2010, 30(9):  2477-2480. 

Asbtract ( )   PDF (655KB) ( )  

Related Articles | Metrics

Providing Quality of Service (QoS) guarantee for mobile Ad Hoc network is very important due to the rapid growth of multimedia applications. The Multi-bounded QoS-aware Ad Hoc Routing (MQAR) protocol based on AODV was proposed, which allowed intermediate node to return Route Reply (RREP) packet and reserve resources by extending QoS routing table, and adopted local route recovery as well. The simulation results show that MQAR protocol can effectively reduce route establishing time, route recovery time and routing overload as well, and the packet delivery ratio remains high.

Free resource selection approach based on fuzzy filter in grid

2010, 30(9):  2481-2484. 

Asbtract ( )   PDF (502KB) ( )  

Related Articles | Metrics

The Quality of Service (QoS) provided by the different resources with the same type is various, so it is difficult for the users to select the appropriate resource from this kind resources. The authors proposed a resources selection approach based on fuzzy selection. According to the history information, this method divided the resources fuzzily, built the evaluation matrix and selected the resources fuzzily. The simulation results show that the algorithm resolves the matching problem between the users' requests and the resources, and increases the users' satisfaction.

TCP Vegas-W: Enhanced TCP Vegas congestion avoidance mechanism

2010, 30(9):  2485-2487. 

Asbtract ( )   PDF (569KB) ( )  

Related Articles | Metrics

The TCP Vegas' performance is better than the traditional TCP protocol in many ways. However, studies have shown that TCP Vegas has some defects in its congestion avoidance mechanism. They include that TCP Vegas has a poor performance when it competes with TCP New Reno, and it is not fair to the previous connections. To solve these problems, the authors proposed an improved congestion avoidance algorithm, called TCP Vegas-W. The algorithm did not depend on the buffer management scheme implemented at the routers and hence could be implemented solely at the end host. The experimental results show that the improved algorithm can get better performance in the wired network and it is a good solution to the problems of Vegas.

Load balancing mechanism of service control server cluster in IMS-based IPTV

2010, 30(9):  2488-2493. 

Asbtract ( )   PDF (1042KB) ( )  

Related Articles | Metrics

IMS-based IPTV not only requires higher performance of Service Control Function (SCF) server, but also brings many restrictions to the traditional load balancing technologies due to a Session Initiation Protocol (SIP) with double integrity requirements of transaction and dialog. Combining service trigger mechanism in IP Multimedia Subsystem (IMS) and the session statistical characteristic of the IPTV services, a multi-level load balancing mechanism with the features of service differentiation among clusters and server-load awareness within every cluster was discussed to solve the performance bottleneck in IPTV SCF, and a method differentiating SIP transaction priorities and a lightly random scheduling algorithm based on a dynamic weight were proposed. Finally, the technological feasibility was verified in IPTV prototype, and the detailed solution was depicted.

Routing protocol based on energy consumption in Ad Hoc networks

2010, 30(9):  2494-2496. 

Asbtract ( )   PDF (519KB) ( )  

Related Articles | Metrics

To save the energy consumption of routing paths and prolong the lifetime of network nodes, the authors proposed a new Dynamic Source Routing Protocol of Ad Hoc network based on Energy Consumption (ECDSR). In ECDSR, it imported three energy evaluation parameters (residual energy, consumption prediction, energy delay) to evaluate the energy status of routing paths. Residual energy reflects the current state of node's residual energy, Consumption prediction reflects the changes of node's energy, and energy delay can protect the low energy nodes, and avoid the routing paths with poor energy state. The simulation results show that compared with DSR, ECDSR, the proposed protocol works better in prolonging the network lifetime and improving the network performance without significantly increasing the network overhead and delay.

Small world routing algorithm of wireless sensor network

2010, 30(9):  2497-2500. 

Asbtract ( )   PDF (630KB) ( )  

Related Articles | Metrics

Concerning the small-world topology characteristics, Small World Routing Algorithm (SWRA) of wireless sensor network was proposed in this paper. The algorithm introduced super-node ring which was considered as an undirected graph. The improved Floyd algorithm was used to calculate the shortest transmission path and shorten the route setup time in order to increase transmission efficiency and reduce energy consumption in wireless sensor networks. The simulation results show that the proposed algorithm is more effective and available than the others in the routing setup time, energy dissipation and network throughput.

RSSI-based gradient clustering for wireless sensor networks

2010, 30(9):  2501-2504. 

Asbtract ( )   PDF (616KB) ( )  

Related Articles | Metrics

Cluster-based structure is generally used for Wireless Sensor Network (WSN) in order to reduce the overhead of transmissions and energy consumption. Concerning the problem of load unbalance of nodes in consideration for the mode of data collection in WSN, a RSSI-based Gradient Clustering (RGC) algorithm was proposed. RGC built the gradient information based on nodes' RSSI values, and then the hierarchical structure of the networks was formed. Taking cluster heads with same gradients or not into consideration, the load-balancing RGC was designed, which reduced the complexity of clustering algorithms and energy consumption efficiently, and the networks lifetime was also lengthened. The simulation results verify the correctness and efficiency of RGC.

Joint Hybrid Channel Allocation and Multi-path Routing Protocol over Wireless Mesh Network

2010, 30(9):  2505-2508. 

Asbtract ( )   PDF (664KB) ( )  

Related Articles | Metrics

In order to optimize the multi-interface and multi-channel resource in wireless mesh network, this paper studied the single-interface multi-path routing protocol and the policy of channel allocation in single-path networks, proposed the multi-path routing protocol-AODV-MP by combining the hybrid channel allocation method, which can not only realize the parallel transmission of multi-path in the network, but also increase the entire throughput rate of the network. Through analyzing the characteristics of multi-path routing protocol and considering the interference factors Signal-to-Noise Ratio (SNR) related to neighboring nodes, the routing metric judgment WCETTSNR was put forward, and the routing metric worked as the ratio standard for traffic distribution. The AODV-MP multi-path routing protocol had been tested on the NS2 network simulation platform and the results indicate that the proposed protocol can increase the network throughput by approximately 45% and largely decrease the network delay in the situation of heavy traffics.

Data aggregation algorithm based on order coding for wireless sensor network

2010, 30(9):  2509-2511. 

Asbtract ( )   PDF (609KB) ( )  

Related Articles | Metrics

Data packet compression provides a simple and effective solution for the data aggregation of Wireless Sensor Network (WSN). Research was conducted on a data packet compression technology which was based on order coding. Two limitations were analyzed, which were too concentrated and too complex, and a new distributed coding by ordering algorithm (DCOA) was put forward. The new algorithm established a new implementation flow, designed a new mapping table data structure, reduced the complexity of implementation and balanced the energy load of the nodes through the distributed dynamic processing, and significantly increased the efficiency of data aggregation. The superiority of the algorithm is verified through simulation experiments.

Optimum up-link power control in CDMA satellite communication system

2010, 30(9):  2512-2514. 

Asbtract ( )   PDF (548KB) ( )  

Related Articles | Metrics

Concering the characteristic that the throughput of satellite communication system is constrained by the Saturation Flux Density (SFD) of satellite transponder, the power control problem was formalized as a nonlinear optimization problem. A Distributed Power Control (DPC) algorithm was proposed to maximize the system utility under the limits of SFD using primal-dual method with limited information exchange among earth stations. The simulation results show that the proposed algorithm converges fast and the power flux density at the receiving antenna is appropriate to the SFD. Furthermore, the throughput of the system is dramatically enhanced.

SCTP-based concurrent multipath transfer in wireless network

2010, 30(9):  2515-2518. 

Asbtract ( )   PDF (613KB) ( )  

Related Articles | Metrics

With the increasing diversity in network access technology and the lower cost of access device, more and more mobile terminals have multi-homing property. But current TCP/IP protocol stack can only use single interface for transmission, and it cannot make full advantage of multi-homing. On the basis of Stream Control Transmission Protocol (SCTP), this paper designed path selection module and fast path handover module and implemented a solution for wireless Concurrent Multipath Transfer (CMT), which made using multiple interfaces to transmit at the same time available. The effects of bandwidth aggregation and fast path handover of Wireless CMT were tested in a real wireless network environment. The test results reveal that the Wireless CMT obviously improves the efficiency and reliability of wireless transmission.

Cooperative spectrum sensing based on reputation in cognitive radio network

2010, 30(9):  2519-2521. 

Asbtract ( )   PDF (458KB) ( )  

Related Articles | Metrics

The sensing performance improves as the number of secondary users for cooperative sensing increases in cognitive radios. However, too many cooperative users will make the whole sensing time unbearably long and consume huge system resource. To solve this problem, a new cooperative spectrum sensing method based on reputation was proposed. Only a few cognitive users with the highest reputation were selected to cooperate while guaranteeing a target error bound. The numerical and simulation results show that the proposed algorithm has higher robustness and it achieves better sensing performance when there exist attackers or malfunctioning cognitive users, compared with the conventional method.

Application of dynamic voltage scaling based on hybrid-task model in wireless sensor network

2010, 30(9):  2522-2525. 

Asbtract ( )   PDF (581KB) ( )  

Related Articles | Metrics

In order to prolong the lifetime of Wireless Sensor Network (WSN) by making economical use of energy, the authors put forward a more common algorithm which was known as the hybrid-task-model-based dynamic voltage scaling (H-DVS). Without restrictions of the relative duration, H-DVS algorithm was combined with Earliest Deadline First (EDF) algorithm and supported the hybrid-task model where the periodic tasks and sporadic tasks existed at the same time. According to the CPU's working load, H-DVS algorithm used the Frequency Modulation (FM) factor to regulate the real-time voltage and the frequency, and thereby it could support the real-time requirements while reducing energy consumption. The theoretical analysis and simulation results show that the method is feasible and effective.

Typical applications

RMI-based grid re-development model for high-performance computing

2010, 30(9):  2526-2529. 

Asbtract ( )   PDF (669KB) ( )  

Related Articles | Metrics

According to the characteristics of high-performance computation and computational grid, a Grid Re-development Model (GRM) was proposed. Regarding the combination of Remote Method Invocation (RMI), and SSL/TLS technology, GRM firstly provided a consistent interface to access to grid middleware; secondly, screened the complex and trivial problems for accessing grid through network; thirdly, solved the data security issues for sensitive data transferred in insecure wide-area network. Based on the grid middleware used by scientific computing grid, the GRM was implemented. The case studies and experimental results of developing user interfaces based on GRM and experimental results show that, the GRM not only provides an easy, useful and full featured development model, but also has good performance and portable features.

Task scheduling model based on resource prediction for grid computing

CHENG HongBing

2010, 30(9):  2530-2534. 

Asbtract ( )   PDF (880KB) ( )  

Related Articles | Metrics

Resources in grid computation environments are heterogeneous and dynamic, and tasks in grid computation environments are executed by computers from different domains or clusters of virtual organization synergistically; the static task scheduling is not fit for tasks execution in grid computing environments. In the paper, a task scheduling model based on the results of resources prediction was proposed. Firstly, a method of weighted least square estimation was given to construct Autoregressive Moving Average (ARMA) model, which would be applied in CPU load prediction of grid computer. After modeling a kind of data parallel grid tasks, the task scheduling model based on the results of resources prediction was presented. Finally the simulations on the proposed model and some other models were designed and accomplished. The simulation results demonstrate that the presented model can run both significantly faster and more stable than other models.

Hardware design and signal integrity simulation of embedded 3G wireless video surveillance system

2010, 30(9):  2535-2537. 

Asbtract ( )   PDF (657KB) ( )  

Related Articles | Metrics

A solution of embedded 3G wireless video surveillance system based on DaVinci platform was proposed, which took full advantage of the high-bandwidth of WCDMA network and could realize two-way video surveillance in parallel. The hardware design was discussed in depth and various functional modules were designed. The simulation analysis of hardware PCB design was made by use of Hyperlynx software and IBIS models. The Signal Integrity (SI) problems, which usually appeared in DDR2 interface circuit such as reflection and crosstalk, were resolved effectively. And the quality and speed during high-speed circuit PCB design were fully guaranteed. Compared to the traditional wired video surveillance, this solution is more flexible and can be used more widely.

Design of embedded mobile GIS for customizable data wireless transmission

2010, 30(9):  2538-2540. 

Asbtract ( )   PDF (505KB) ( )  

Related Articles | Metrics

The embedded Geographics Information System (GIS) system for customizable wireless data transmission consists of hardware component, data center server, and software system. Taking NXP ARM microprocessor as the core and combining the General Packet Radio Service (GPRS) communication network characteristics, the authors focused on the design process of embedded GIS system for customizable data wireless transmission, proposed the implementation scheme in detail, analyzed the hardware component design process, the firmware program development process and customizable data based on Extensible Markup Language (XML) implementation process. Finally, a confirming platform based on automobile remote faulty diagnosis and maintenance system was constructed. The experimental results show this system realizes the function of embedded GIS for customizable data wireless transmission system, and it has good flexibility, extendibility and maintainability.

Design of embedded wireless smart home gateway based on ARM9

2010, 30(9):  2541-2544. 

Asbtract ( )   PDF (602KB) ( )  

Related Articles | Metrics

To release the connection problem between different kinds of wireless communication technologies in conventional smart home system, a new direct-connected intelligent home gateway between two different wireless communication technologies was designed. This gateway was based on ARM920T embedded processor S3C2440A, ARM Linux operation system and new communication technology combining Zigbee and Wireless-Fidelity (Wi-Fi), was considered to achieve the personalized objective of remote monitoring, home security, home appliances control and so on. An embedded Web server was built in ARM9 processor, the Wi-Fi module and Zigbee module were expanded to achieve the construction of wireless network and the connection to Internet, and the hardware structure and software process were shown too. The experimental results show that, the packet loss rate and response time of this new gateway are less than the other gateways like wire line network and Wi-Fi bluetooth wireless network, and it can be applied to the smart home system.

Recognition algorithm of online handwritten mathematical formula structure

2010, 30(9):  2545-2548. 

Asbtract ( )   PDF (746KB) ( )  

Related Articles | Metrics

As a natural, fast mathematical formula input method, the online handwritten mathematical formula input method has many application prospects. The author described the algorithm of recognizing the common online handwritten mathematical formula structure, defined the fractal, the dominant relationships of the mathematical formulas structure and expanded the hard rules. Then a new method of calculating weight for the Minimum Spanning Tree (MST) was proposed according to the characteristics of handwritten formulas. On the basis of them, MST algorithm was applied to formula structure analysis. Compared with other classical algorithms, the proposed algorithm can recognize more structures and improve the recognition rate.

Implementation of intelligent infrared control node in wireless sensor networks

2010, 30(9):  2549-2552. 

Asbtract ( )   PDF (637KB) ( )  

Related Articles | Metrics

Wireless Sensor Network (WSN) is a new technology about acquiring and processing information. More and more researchers and people from industry are engaged in developing it due to the great promise and potential with various applications. Meanwhile, the infrared control technology is widely used in life for its simple, low-cost advantages. In this paper, combining wireless sensor network with infrared control technology, an intelligent infrared control node was designed, which learned the Infrared (IR) signal and stored it to EEPROM with the infrared functional module. And then, this node sent the IR signal to control the infrared terminal with stored infrared codes in EEPROM depending on the requirements. Besides, the server can control the nodes remotely with Simple Network Management Protocol (SNMP). At last, the new sensor node was tested, and the experimental results validate the practicability of the scheme.

Access control system based on dual-core digital signal processor and face recognition

2010, 30(9):  2553-2555. 

Asbtract ( )   PDF (593KB) ( )  

Related Articles | Metrics

To overcome the shortages of traditional access control system of face recognition, which is of poor stability and low speed, the design scheme of access control system of face recognition based on dual-core Digital Signal Processor (DSP) was presented. The system structure and software realization technology were discussed. The speed of face recognition was improved through dual-core and code optimization techniques. The experimental results show that the system is of good stability, high recognition rate and high speed, and it is practical.

Application of multi-resolution data fusion algorithm

2010, 30(9):  2556-2558. 

Asbtract ( )   PDF (458KB) ( )  

Related Articles | Metrics

After analyzing the Multi-Resolution Integration (MRI) algorithm based on mobile Agent, an application case determining the probability of a disaster was proposed. In this case, the mobile Agent-based MRI algorithm had been improved. The experimental results show that, compared to the traditional Client/Server (C/S) approach, the multi-resolution data fusion method based on mobile Agent has many advantages, such as short delay, small energy consumption, strong scalability and so on. The prediction result of this application is successful, feasible and of high flexibility.

Unsupervised spike extraction and classification based on locality preserving projection

2010, 30(9):  2559-2562. 

Asbtract ( )   PDF (662KB) ( )  

Related Articles | Metrics

The spike sorting, including neuronal spike waveform acquisition and classification, is one of the important procedures in neuronal information processing, and its feature extraction and recognition are the basis of the above issues. Based on Locality Preserving Projection (LPP) algorithm, an unsupervised feature extraction and classification algorithm was proposed. The neighbor parameter was selected automatically, the distribution dispersion standard was obtained according to the original data set, and the features of extraction results in spikes were separated effectively. The application in simulation and real experimental data show that, the proposed method based on the LPP can more effectively extract and separate features of spikes in comparison of the traditional Principle Component Analysis (PCA) algorithm.