Table of Content

01 February 2008, Volume 28 Issue 2

Previous Issue    Next Issue

Articles

Genetic algorithm based on critical path for task scheduling

[中] 兰舟 [英] LAN Zhou

2008, 28(2):  272-274. 

Asbtract ( )   PDF (480KB) ( )  

Related Articles | Metrics

In this paper, a novel genetic algorithm, namely critical path based genetic scheduling algorithm (CPGS), was developed for multiprocessor scheduling. CPGS made full use of the knowledge about the critical path to construct the initial population and provided the iterative evolution process with an improved basis. To compare CPGS′ performance with the other GAs, the thirdparty dataset was selected as the simulation benchmark. Simulation results show that CPGS outperforms the previously existing algorithms.

Genetic algorithm based on schema comparison

Jing-Rong XU

2008, 28(2):  275-278. 

Asbtract ( )   PDF (642KB) ( )  

Related Articles | Metrics

After analyzing the relationships between schema order, schema defining length and population diversity, a new Genetic Algorithm based on the Schema Comparison (SCGA) was proposed. The key to this algorithm is to use mating operator to improve the offspring′s population diversity. Different from Simple Genetic Algorithm that adopts random mating strategy, mating operator mates chromosomes according to schema order and schema defining length. The experimental results show that this algorithm can effectively avoid the premature convergence caused by the low population diversity. Moreover, this algorithm improves the ability of searching an optimum solution and increases the convergent speed.

Application on SMB protocol in parallel FDTD computing in heterogeneous network environment

Yu Liu Hong-Chun Yuan Zheng Liang

2008, 28(2):  279-282. 

Asbtract ( )   PDF (681KB) ( )  

Related Articles | Metrics

In a multi-system heterogeneous LAN, the lack of interoperability for the MPI program in the different operating environments makes it difficult to make full use of the LAN computing resources in the parallel Finite Difference Time Domain(FDTD) algorithm. To resolve this problem, a new method of using Serverce Message Block（SMB） protocol to realize heterogeneous FDTD computing was presented, and by some means such as memoryfile access, memorymapped array and redundancy computing, the impact of SMB communication latency upon the parallel performance was released. Some computed examples were given to prove the feasibility and accuracy of this method. The numerical results show that performance indexes, such as speedup, parallel efficiency, etc. are close to the isomorphism FDTD computing using MPI.

Approach to allocate computational grid resources based on online reverse auction technology

Bin ZHAO Chao Fu Hui WANG

2008, 28(2):  283-285. 

Asbtract ( )   PDF (454KB) ( )  

Related Articles | Metrics

Using economic model to research grid resource management is a new hot topic in the field of grid computing. Based on current grid resources management methods, an online reverse auction technologybased approach to allocating computational grid resources was proposed concerning oversupply environment. The corresponding QoS function is defined to analyze the application range of this approach as well as its advantages. Finally, the results of simulation experiments indicate that this method is effective for computational grid resource allocation.

Improvement of quantum genetic algorithm and its application

2008, 28(2):  286-288. 

Asbtract ( )   PDF (406KB) ( )  

Related Articles | Metrics

New methods were joined into the quantum genetic algorithm to solve the defects of poor local search ability and more iterative times. The best search direction was decided by the new swarm which was built by the best individual of each chromosome. Evolutionary strategy with niche was used to initialize quanta swarm. The simulation result of nonlinear continuous optimal problem indicates that the algorithm has better performance than quantum genetic algorithm. Finally, the algorithm was applied to chemical progress optimization and satisfactory results were achieved.

New structure DM-multipath and dynamic load balancing

Chuang KAN WeiWei Qi

2008, 28(2):  289-291. 

Asbtract ( )   PDF (484KB) ( )  

Related Articles | Metrics

For storage devices，Linux mainly has two types of solution for multipath I/O: high-level approaches that live above the I/O scheduler, and low-level subsystem specific approaches. Each type has its advantage because of the position in the storage stack in which it has been implemented. Tthe new structure focuses on a solution that attempts to reap the benefits of each type of solution by moving the kernel′s current multipath layer dm-multipath, below the I/O scheduler and above the hardware-specific subsystem，and it can also support dynamic load balance.

Performance analysis of new stochastic colored Petri nets

2008, 28(2):  292-293,. 

Asbtract ( )   PDF (461KB) ( )  

Related Articles | Metrics

While analyzing the system performance, the state space of stochastic Petri Nets increases exponentially with the accretion of the system scale, which causes the complexity of obtaining stabilization probability. Concerning this problem, we put forward a kind of Stochastic Colored Petri Net (SCPN), analyzed the limitary and reachable, and proved that SCPN is same as a continuous time Markov chain. At the same time, this article also analyzed the methods for modeling and quantitive performance analysis that the Stochastic Petri Nets (SPN) used.

Artificial intelligence

New encoding method for GA-based solution to Job Shop scheduling optimization

2008, 28(2):  294-296,. 

Asbtract ( )   PDF (566KB) ( )  

Related Articles | Metrics

A new encoding method for a solution to genetic algorithm-based Job Shop scheduling problem was proposed. According to the characteristics of a specific problem, a job activities′ number-dependent coding of chromosomes was designed, with each number including the number of a job activity of working parts, the number of a machine associated with the job activity, and all information in connection with duration of job activities. As a result, codes by the new encoding method correspond to the job scheduling schemed one-to-one and were able to match multiple cross operators without a special design of operators. Results from a case study show that the genetic algorithm with the help of new encoding method presents a powerful ability and is able to effectively solve job shop scheduling problems. Through comparison, this algorithm has shown merits of simple operation and fast convergence.

Multiple model control algorithm based on immune system

2008, 28(2):  297-301. 

Asbtract ( )   PDF (760KB) ( )  

Related Articles | Metrics

For the nonlinear and uncertain complicated system, effective and rapid control is a very difficult problem. In this paper, a new algorithm based on Immune system for Multiple Model Control(IMMC) was proposed. Inspired by the discriminating ability to the uncertain antigen in the biological immune system, the IMMC simulates the interaction of the Antigen, Antibody, TCR and MHC in immune system to control nonlinear and uncertain complicated system. The result of the computer simulation shows that this algorithm has good performance, which can be rapidly adapted to the sudden changes in the control system. The algorithm was successfully applied to the settlement control during a DoubleO Tunnel(DOT) shield boring.

Permutation flow shop scheduling algorithm based on ant colony optimization

2008, 28(2):  302-304. 

Asbtract ( )   PDF (438KB) ( )  

Related Articles | Metrics

An ant colony optimization based algorithm for permutation flow shop scheduling was proposed. The key point of this algorithm is to integrate NEH heuristics with ant colony optimization. The proposed algorithm was tested on scheduling problem benchmarks. Theoretical analysis and experimental results show its effectiveness.

Induction of fuzzy system based on cloud theory and neural network

2008, 28(2):  305-306,. 

Asbtract ( )   PDF (489KB) ( )  

Related Articles | Metrics

A fuzzy system based on the combination of cloud model theory and neural network was illustrated. Using the artificial intelligence with uncertainty could resolve the difficulties of the definition of the subjection function and knowledge regularity in the practical application of fuzzy system. It also made the mapping become nonlinear among variables by neural network. The system not only has the learning capability of the neural network but also has the ability of dealing with the uncertainty by cloud model, which makes the knowledge reasoning more convincing and improves the overall efficiency of the algorithm.

Research of novel artificial immune model applied to data analysis

Lei HUANG

2008, 28(2):  307-310. 

Asbtract ( )   PDF (604KB) ( )  

Related Articles | Metrics

This paper proposed a novel artificial immune network model. By introducing elaborate immune operators, such as clonal selection, mutual cooperation and mutual suppression, the network evolves from single antibody into clusters that can adapt to local distribution and local density of original antigen population. The general framework of learning algorithm was described. Several critical procedures were also analyzed. Experiments based on synthetic dataset were carried out to demonstrate the behavior of learning process and evaluate the performance of the proposed model.

Construction of intuitionistic fuzzy similarity relation

2008, 28(2):  311-314. 

Asbtract ( )   PDF (541KB) ( )  

Related Articles | Metrics

The conventional construction methods of fuzzy similarity relation can not be used to construct intuitionistic fuzzy similarity relation. Based on similarity and dissimilarity between intuitionistic fuzzy sets, the construction method of intuitionistic fuzzy similarity relation was studied. First, several existing similarity and dissimilarity measures between intuitionistic fuzzy sets were analyzed. Second, the dissimilarity between intuitionistic fuzzy sets was defined and a valid dissimilarity and similarity measure was given. Then, a practical construction method of intuitionistic fuzzy similarity relation was put forward. Finally, the correctness and validity of the developed methods were verified with a particular instance.

Research on path-planning of virtual characters in computer animation

2008, 28(2):  315-318,. 

Asbtract ( )   PDF (717KB) ( )  

Related Articles | Metrics

The path-planning of virtual player is different from that of a robots. Besides the need to find a non-collision path in its motion space, the former should also show the biologic characteristic of the virtual player. Artificial fish or Xiaoyuan′s fish was researched in this paper. The path-planning was conducted in the virtual ocean, in which the fish lives. And the artificial fish was abstracted as a Finite State Machine(FSM). The fuzzy judgements based on biological vision and olfaction were introducted to atificial potential field to match the biologic characteristic of fish. By computer simulation, satisfing result was achinved.

New evolutionary algorithm based on girdding for dynamic optimization problems

2008, 28(2):  319-321. 

Asbtract ( )   PDF (444KB) ( )  

Related Articles | Metrics

Dynamic Optimization Problems (DOP) has attracted more and more attention recently, and a number of methods have been introduced to solve them. This paper proposed a completely new approach, named Grid Evolutionary Algorithm (GEA), which was based on the concept of Girdding and quite different from those traditional Evolutionary Algorithms (EAs). It was designed to solve optimization problems in dynamic environment. Compared with the well-known SOS algorithms, the results show that this algorithm is far more effective to solve DOP than SOS algorithm.

Chaos particle swarm optimization algorithm

Jun-min Liu Yue-lin Gao

2008, 28(2):  322-325. 

Asbtract ( )   PDF (622KB) ( )  

Related Articles | Metrics

By introducing chaos state into the original Particle Swarm Optimization (PSO), this paper proposed a new algorithm-Chaos Particle Swarm Optimization (CPSO). The new algorithm makes good use of the ergodicity, stochastic property, and regularity of chaos. By judging the local convergence, when PSO gets into the local convergence, CPSO can start the chaos researching. The experimental results demonstrate that the new algorithm has the ability to avoid being trapped in local minima, and improves computational precision, convergence speed and the ability of global optimization.

Intelligence perception

Accurate and robust iterative pose estimation from line correspondences

2008, 28(2):  326-329,. 

Asbtract ( )   PDF (688KB) ( )  

Related Articles | Metrics

The methods for pose estimation problem from 2D to 3D feature correspondences are mainly based on point correspondences. However, it is advantageous to compute pose from line correspondences. From a novel point of view based on the Euclidean space, we presented an iterative algorithm for solving pose estimation problem by using line correspondences. The main idea is that, firstly the best rotation matrix is iteratively computed, and then the translation vector is obtained. For different groups of line correspondences, we presented different methods for getting an initial guess. Synthetic experimental data show the proposed algorithm is less sensitive to initialization, accurate and robust.

Paper sheet defects classification based on support vector machine method

2008, 28(2):  330-332,. 

Asbtract ( )   PDF (582KB) ( )  

Related Articles | Metrics

We proposed a paper sheet defects classification method based on SVM according to its good performance in small data sets and high dimension feature spaces. To classify three common defects of the paper sheet, we firstly preprocessed the defect images, then carefully selected the input features for training the SVM-based classifiers, and optimized the parameters and the classifiers by the cross-validation method. The results prove that SVM is practical in paper sheet defects classification and identification.

Estimation algorithm of identifying multi-tag in passive RFID system

Xinfeng Wang Guihai Xie Liang Ming Ziyuan Qi Lei Yang

2008, 28(2):  336-338,. 

Asbtract ( )   PDF (547KB) ( )  

Related Articles | Metrics

This paper investigated how to shorten identifying time of multiple objects and gain maximum throughput between reader and tags in passive RFID system. We presented a combination model of the communication mechanism between reader and tags, and used this model to deduce an algorithm to estimate tag number: Binomial Distributing Estimation(BDE) algorithm. With the help of BDE algorithm, we then selected optimal slot number in slotted ALOHA protocol. Simulation results are as the following: First, identifying time of BDE algorithm is satisfactorily shortened when identifying tag number is one, two and three. Identifying time increases linearly with tag number. Second, throughput is about 34%, which is close to academic maximum. Third, analysis of identifying time ingredients indicates that optimizing reader commands and speeding up reader data rate can further shorten identifying time.

New codebook design method based on hybrid immune algorithm for text-independent speaker identification

Xu Yun-Xi

2008, 28(2):  339-341,. 

Asbtract ( )   PDF (636KB) ( )  

Related Articles | Metrics

Vector Quantization(VQ) is one of the popular codebook design methods for text-independent speaker identification. The key problem of VQ is the design of codebook. Speech feature parameters have complex distribution with high dimensions. Therefore, we have great difficulty in designing codebook. The traditional LBG algorithm yields only local optimal codebook. In this paper, a new method of codebook design was proposed, named as hybrid immune algorithm. It utilized the niche technology and K-means algorithm in the immune algorithm train step. It adopted improved mutation operator for data clustering with high dimension, reduced the blindness of stochastic mutation, so as to improve the local and global searching capability and increase the convergent speed by vaccination. Experiment for text-independent speaker identification shows that this method can obtain more optimum VQ parameters and better results than the LBG and hybrid genetic algorithm.

Network and communications

Efficient algorithm for finding minimum connected dominating set in wireless sensor networks

Rong XIE De-yu QI [中]李拥军 [英]YongJun Li Zheng-ping QIAN

2008, 28(2):  342-344. 

Asbtract ( )   PDF (450KB) ( )  

Related Articles | Metrics

The Connected Dominating Set (CDS) has been widely used for efficient routing in wireless sensor networks. Although finding the Minimum Connected Dominating Set (MCDS) in an arbitrary graph is a NP-hard problem, many approximation algorithms have been proposed to construct a serviceable CDS. To address the weaknesses of these existing algorithms, we proposed a new distributed approximation algorithm, CDS-HG, to construct the CDS for wireless sensor networks. This algorithm models a wireless sensor network as a hierarchical graph, in which a competition-based greedy strategy is used to select nodes at a certain level to route messages to the next level. Formal analysis and simulation studies show that our proposed CDS-HG algorithm generates the smallest CDS while requiring the least message complexity.

Congestion control protocol for multi-hop wireless networks based on IEEE 802.11e

Jian-Bing MAO Yu-Ming MAO Su-Peng LENG

2008, 28(2):  345-349. 

Asbtract ( )   PDF (840KB) ( )  

Related Articles | Metrics

Congestion in multi-hop wireless networks would lead to degradation of network performance.While the 802.11e protocol has provided differentiated channel access priorities for different types of traffic, we proposed a new method to carry out congestion control for multi-hop wireless networks by dynamically adjusting the priority of best-effort traffic.The main idea was to promote the service priority of best-effort traffic when light congestion was detected,and degrade its service priority in upstream nodes when severe congestion happened. The simulation results show that the proposed scheme can effectively promote the network throughput when the network is heavily loaded.

Domain-based aggregation algorithm in sensor networks

2008, 28(2):  350-354. 

Asbtract ( )   PDF (830KB) ( )  

Related Articles | Metrics

Aggregation is one of the most important operations in query processing for sensor networks. In this paper, a new in-network aggregation called Power-efficient In-network Aggregation (PIA) was proposed. In PIA, taking account of the characteristics and location information of nodes in sensor networks, a modified directed transfer model of sensor networks and a new clustering algorithm based on domain were proposed. The core node and the gateway node construct the connection core and the query can transmit in the core. In PIA, the query will carry the current Max (Min) value in the sensor network when sending the query to the nodes. The sensor node will not send the sampling value to the Sink unless the sampling is more (less) than the current Max (Min) value in the query package. Theoretical analyses and simulation results show that, the above new methods can reduce the energy costs of nodes in data transferring efficiently for sensor networks. Therefore, it can prolong the lifetime of the whole networks to a greater degree.

Design and realization of layered parallel multi-swarm cooperative PSO framework under grid environment

2008, 28(2):  355-359. 

Asbtract ( )   PDF (695KB) ( )  

Related Articles | Metrics

Concerning how to utilize computational resources in large field to join the implementation of Particle Swarm Optimization(PSO), thereby the computational efficiency can be enhanced and the computational cost can be reduced, the Grid-based Layered Parallel Multi-swarm Cooperative PSO(G-LPMCPSO) Framework was presented in this paper, as well as a Parallel Multi-swarm Cooperative PSO(PMCPSO) algorithm adapted to grid environment of load imbalance and the heterogeneity of computational resources. And then, how to make use of standard Grid technologies and PMCPSO algorithm to design and realize G-LPMCPSO framework was discussed in detail. The framework has an extended GridRPC API to conceal the high complexity of the Grid environment, and a meta-scheduler for seamless resource discovery and selection. At last, the theoretical analysis and the result of experiment indicate that the proposed G-LPMCPSO using Grid can offer a credible framework for providing a significant speed-up to optimization in science and engineering.

Evaluation mechanism for preventing free-rider in super-node overlay

Jun Chen Jia-Qi Liu Zhi-Gang Chen

2008, 28(2):  360-362,. 

Asbtract ( )   PDF (598KB) ( )  

Related Articles | Metrics

Most selections of super node in P2P super-node overlay are based on physical performance without considering free-riders, which affects the efficiency in real network. An evaluation mechanism was presented, which fully considered physical distance, information exchange frequency and degree of querying similarity. The satisfaction degree was proposed to select super node and the object to send querying request, not only to improve the system efficiency but also reduce even eliminate free-rider nodes. The experiments show that the evaluation mechanism improves the querying success rate, and decreases average querying hops and delay in P2P super-node overlay.

Remote monitoring system of rectifier based on improved heartbeat mechanism

Zhikun Hu Duochang He Weihua Gui Chunhua Yang

2008, 28(2):  363-366. 

Asbtract ( )   PDF (676KB) ( )  

Related Articles | Metrics

A remote monitoring system of rectifier based on an improved heartbeat mechanism was developed according to quickness and stability of remote TCP/IP communication. Different heartbeat mechanism was designed at server and client, and server and client can judge the states of network connections through transmitting heartbeat packets between server and client. The mechanism can request to reconnect with remote clients or server when network is at the jam and inform users when network is at the disconnection. The mechanism was realized by using Socket with the model of single server and multi clients. The heartbeat model had been applied to a remote monitoring system of rectifier based on Client/Server model. The testing result of system and model shows that the heartbeat model has better performance and improves the availability and dependability of the system.

BitTorrent file-sharing model based on S-RTT strategy

2008, 28(2):  367-370. 

Asbtract ( )   PDF (650KB) ( )  

Related Articles | Metrics

In this paper, we analyzed the workflow of BitTorrent file-sharing system, and pointed out the shortcomings in ways of choosing and linking seed. The GNP technology was recommended, its workflow was analyzed in detail, and the superiority of it was shown in locating mainframe. This article described one kind of BitTorrent file-sharing model based on S-RTT strategy that led S-RTT strategy into BitTorrent system. It enables BitTorrent system to choose the good seeds flexibly and control network flow, and improves the network function of BitTorrent system effectively.

ProActive-based fault-tolerant task-scheduler

Zheng-You LIANG

2008, 28(2):  371-373. 

Asbtract ( )   PDF (460KB) ( )  

Related Articles | Metrics

It is an important research issue to ensure the computation correctness for parallel application and enhance the using rate of dynamic computing resource in distributed computing system. Based on the previous ProActive-based parallel computing system, a ProActive-based Fault-tolerant Task-scheduler was developed, which combined the breathe mechanism, fault-discover mechanism and subtask reschedule mechanism. Experiments show that the Fault-tolerant Task-scheduler has good performance and ensures the computation correctness even if when some computing resources fail.

Optimized hand-over scheme based on SIP for stratospheric telecommunication platform

Yan JIANG

2008, 28(2):  374-377,. 

Asbtract ( )   PDF (768KB) ( )  

Related Articles | Metrics

In the Stratospheric Telecommunication Platform, when the user equipment (UE) mobiles to another Platform, his IP address will change. If the UE changes access technology he will automatically get a new IP-address. After this reassignment of the IP-address the UE has to re-register to the IMS and send new invites to all corresponding nodes before the sessions can continue. This will potentially introduce a long delay of ongoing sessions. In this paper, a solution was introduced to reduce the handover delay by sharing the registration information and call states of the UE. The full register and invite flows were not necessary in that case, since the servers in the IMS already had state information about the UE and sessions from the context transfer. The benefit with respect to reduced hand-over delay was theoretically analyzed in the quantity of signaling packets and the delayed of rebuilding the communication.An OPNET simulation was carried out to verify the solution.

Hybrid layout algorithm based on skeleton subgraph

Wei-Ming ZHANG Kai ZHANG

2008, 28(2):  378-381. 

Asbtract ( )   PDF (602KB) ( )  

Related Articles | Metrics

We presented a novel hybrid layout algorithm based on skeleton subgraph, which could handle the power-law graph. The key idea was to decompose the original graph into a skeleton subgraph and several stub trees, and to layout them with different graph drawing algorithms. The experiments and analysis indicate that our algorithm outperforms the traditional K-K algorithm when the size of the graph is smaller than a certain constant, and the result seems to be easier to lead the user to identify the skeleton subgraph and the stub trees, and to understand the original graph.

Node self-location for wireless sensor network

Zixing CAI

2008, 28(2):  382-384. 

Asbtract ( )   PDF (461KB) ( )  

Related Articles | Metrics

Localization is crucial to many applications in wireless sensor networks. This article presented a range-free anchor-based localization algorithm for wireless sensor networks that built upon the Monte Carlo Localization algorithm. We improved the localization accuracy and efficiency by making better use of the information a sensor node gathers and by drawing the necessary location samples faster. Simulation results show that localization accuracy of all nodes is one of fifth of communications radii.

Novel bit-rate control algorithm for H.264 based on motion detection

2008, 28(2):  385-388. 

Asbtract ( )   PDF (634KB) ( )  

Related Articles | Metrics

This paper aimed at the rate control problems of JVT-G012, the typical algorithm for H.264/AVC, and presented a new rate control algorithm. After motion detection, if the previous and current frame were in the same complex area, factual encode rate of the previous frame was used to adjust target rate of the current frame. As for the scene changes and high motion video based on motion detection, the minimum sum of squared difference between original and reconstructed pixels after the rate distortion option was used to estimate MAD, and then, MAD was used to compute quantization parameter based on the quadratic model in the process of encoding. The Lagrange parameter can be optimized. The experimental results show that the rate of this algorithm is higher than JVT-G012 and lower than Improvement of H.264AVC by JIANG but the scheme of this paper can effectively improve video quality at scene changes and high motions. Moreover, the scheme also enhances the average PSNR of the test sequences compared to JVT-G012 and JIANG's Improvement.

Scheduling for real/non-real time traffic in wireless packet networks

2008, 28(2):  389-393. 

Asbtract ( )   PDF (772KB) ( )  

Related Articles | Metrics

In this paper, a wireless scheduling scheme for a mixture of Real/Non-Real Time traffic, called TF-RNS, was proposed. The objective of TF-RNS is to provide temporal fairness among heterogeneous users while improving the quality of service (QoS) of each user. Considering that Real and Non-Real Time users had different QoS requirements, TF-RNS was designed as a hierarchical scheduling scheme. First, TF-RNS used M-LWDF and PF to make scheduling for Real and Non-Real Time users respectively. Then, TF-RNS used our designed scheme SFQ-CS to provide temporal fairness. Simulation results show that compared with M-LWDF and DS-PS, TF-RNS can provide excellent temporal fairness for Real/Non-Real Time users and then effectively guarantee the QoS of all the users in the system.

Scalable fault-tolerant mechanism of mobile Agent membership management

Juan Wang

2008, 28(2):  394-396. 

Asbtract ( )   PDF (514KB) ( )  

Related Articles | Metrics

The group communication technology plays an important role in building a reliable mobile Agent system. The fault-tolerant membership managment mechanism is a significant part of the group communication mechanism. After presenting a system framework of the group communication， based on this framework, a new mechanism of fault-tolerant membership management was brought forward, which can guarantee the flexibility and expansibility of the membership management. Whats more, it can meet the needs of the integrity and accuracy of the fault detection and low net load.

Study on full duplex communication in distributed measurement and control network based on Datasocket technology

PAN Hai-Bin 潘海彬

2008, 28(2):  397-398,. 

Asbtract ( )   PDF (477KB) ( )  

Related Articles | Metrics

Concerning the characteristic that real time, reliability and remoteness are required in complicated distributed measurement & control network communication, DataSocket technology that is widely used in field real time communication was studied. The requirement and method of real time communication based on DataSocket was studied with emphasis, at the same time the model of simplex communication based on DataSocket was presented, and the model of full duplex communication was designed accordingly. It proves that DataSocket technology can solve the problem of real time, reliability and remoteness in complicated distributed measurement & control network communication, and can integrate control with measurement in complicated distributed measurement & control network communication.

Residual energy based route protocol in MANET

2008, 28(2):  399-401. 

Asbtract ( )   PDF (418KB) ( )  

Related Articles | Metrics

In order to make use of network resources effectively and increase network capacity and lifetime, a residual energy and energy cost velocity-based routing protocol for Ad Hoc network was designed. On one hand, the protocol avoids taking network split as target, and protects lower energy nodes in the network; on the other hand, it considers the link bandwidth conditions, balances traffic of more energy nodes. Through plenty of simulation, it shows better performance on network lifetime, packet delivery fraction and average packets end-end delay than traditional Ad Hoc routing protocol.

Application of passive clustering in directed diffusion algorithm

2008, 28(2):  402-405. 

Asbtract ( )   PDF (702KB) ( )  

Related Articles | Metrics

Motivated by the passive clustering algorithm, a novel approach was proposed to combine the passive clustering and the direct diffusion routing. The clustering information was appended to the interest packet. And the cluster head was elected according to the three color algorithm. Once the clustered structure was built, only the cluster head and gateway would flood the interest. By this way, the average required energy can be significantly reduced.

An implementation of embedded IPv4/IPv6 dual-protocols stack

Xiao Lin

2008, 28(2):  406-408. 

Asbtract ( )   PDF (417KB) ( )  

Related Articles | Metrics

An implementation of embedded IPv4/IPv6 dual-protocols stack, which was independent of any platform, was proposed. According to the embedded application, the buffer management of the stack was designed. Some functions of ICMPv6 and neighbor discovery protocol were eliminated. And the process-state and glide window mechanism of TCP protocol were optimized and some functions of network interface layer and transport layer were extended.

Information security

Intrusion detection based on unsupervised clustering and hybrid genetic algorithm

Wen-Jun Cai

2008, 28(2):  409-411. 

Asbtract ( )   PDF (457KB) ( )  

Related Articles | Metrics

Among the methods of intrusion detection with clustering, how to make clustering effectively is a critical problem. A new unsupervised clustering method was proposed in this paper.The method can overcome the shortcoming of sensitivity to the order of input dates and necessity to know the cluster number before it works, and it also can reduce the number of parameters. By the two stage of creating initial clusters and optimation of the first stage with hybrid genetic clustering method, it can overcome the influence of initial clusters on results and improve the clustering quality, and then this method was used to detect intrusion. Experimental results demonstrate that this method has better detection rate and false positive rate.

Security quantitative evaluation method and system design for WLAN

2008, 28(2):  412-414,. 

Asbtract ( )   PDF (598KB) ( )  

Related Articles | Metrics

The rapid development of the Wireless Network makes the quantitative evaluation of its security become more and more important. From unauthorized access angle, this paper set up the 802.11b WLAN experiment environment and security evaluation model, and thoroughly analyzed the WLAN security quantitative evaluation. In this paper, WLAN security quantitative evaluation was divided into two parts: network intrusion extent evaluation after unauthorized access and based on its security evaluation of all computers in the network. This paper gave methods and process of quantitative evaluation，and introduced the flow of system implementation. Finally, the example of security quantitative evaluation was analyzed to validate the given method.

Design of survivability quantum analysis database and quantum algorithm based on CVE database

2008, 28(2):  415-417,. 

Asbtract ( )   PDF (612KB) ( )  

Related Articles | Metrics

This paper described the survivability analysis technology development，described the application of CVE database on the system of leak scanning,and analyzed the design of the model of the survivability analysis database and the quantum algorithm. The capability of algorithm was verified through experiments.

Identify based privacy preservation scheme

2008, 28(2):  418-421. 

Asbtract ( )   PDF (635KB) ( )  

Related Articles | Metrics

Privacy preservation is a vital problem to interoperation among multi-domains. The existing schemes can not resolve those troubles in privacy preservation very well, such as confidentiality, or leaking additional privacy information. The target of security about privacy preservation was analyzed, and then an identify based privacy preservation scheme was proposed. The scheme not only satisfies the security target, but also need only once communication. Finally, the scheme was proved to be of IND-CCA2 semantic security.

New Kerberos protocol based on Weil pairing

2008, 28(2):  422-423. 

Asbtract ( )   PDF (348KB) ( )  

Related Articles | Metrics

Kerberos is a widely applicable protocol, but it also has some security problems, such as guessing password and no client authentication, etc. A new protocol based Weil pairing was presented. It mended kerbeross security limitation. The improved protocol is of better security and application.

Application of various kernel function based SVM in spam filtering

Jian-She Dong Qiu-yu ZHANG

2008, 28(2):  424-427. 

Asbtract ( )   PDF (608KB) ( )  

Related Articles | Metrics

The Support Vector Machine(SVM) based spam filter was summarized briefly. The mail vector was constructed on TF-IDF model and Bernoulli model. The effect to mail classification of CHI method to descend dimension was tested in detail. Kernel based SVM was introduced into spam filtering. The classification accuracy and training time of SVM based on linear kernel, polynomial kernel and radius basis function kernel were compared and analyzed. It was proposed and analyzed that the imbalance of training samples has great affect on the classification accuracy and the false positive ratio.

Universal framework of secure mobile payment system in mobile computing environments

2008, 28(2):  428-431. 

Asbtract ( )   PDF (659KB) ( )  

Related Articles | Metrics

It is believed that Mobile Agents play an important role in future mobile e-commerce system, offering great flexibility and improved performance. However, it is largely hampered by the new security issues. Based on mobile Agents and the model of SEMOPS, this paper combined the existing mobile payment protocol and presented a universal framework of security mobile payment system in Mobile Computing Environments with abstracting several common operation modules of payment system.

Identity based broadcast encryption without pairings

Zhang Xinfang qiuliang xu

2008, 28(2):  432-433,. 

Asbtract ( )   PDF (459KB) ( )  

Related Articles | Metrics

Identity Based Encryption(IBE) schemes and Identity Based Broadcast Encryption(IBBE) schemes are often constructed by using bilinear maps (a.k.a. parings) on elliptic curves. In this paper, an Identity Based Broadcast Encryption scheme without pairings was given. It is secure in Random Oracle according to the Quadratic Residuosity assumption.

New chaotic image encryption algorithm based on hybrid feedback

2008, 28(2):  434-436. 

Asbtract ( )   PDF (523KB) ( )  

Related Articles | Metrics

Aiming at the defects of diffusion function with lower diffusing speed and needing multiple round iteration to resist differential attack in the image encryption algorithm based on chaotic block cipher, a new chaotic image encryption algorithm based on outputcryptograph mixed feedback was proposed. It can improve the degradation of digital chaotic and diffusing speed of diffusion function through perturbating initial value of chaotic system with ciphertext. Experimental results show that the iterative algorithm only requires a positive iteration and an inverse iteration to achieve higher levels of security and faster encryption speed.

Code protection scheme based on obfuscating transformations in distributed systems

Bai Xue-Mei 白雪梅

2008, 28(2):  437-439,. 

Asbtract ( )   PDF (637KB) ( )  

Related Articles | Metrics

After analyzing the software obfuscation technology, a code obfuscation scheme under distributed environments was proposed. The local states of concurrent processes were used to construct the distributed opaque predicates, and the communication patterns between concurrent processes were exploited to update the local states so as to increase the obfuscation strength. The proposed scheme improves the existing algorithms of code obfuscation in distributed systems.

Improved forward-secure digital signature scheme

Alim Aysa

2008, 28(2):  440-442. 

Asbtract ( )   PDF (479KB) ( )  

Related Articles | Metrics

The existing forward-secure digital signature schemes can not provide backward security for digital signatures. Improvement was made to the Abdalla-Reyzins forward-secure signature scheme with backword-secure detection by embedding the one-way hash chain into the digital signature of the scheme. The improved scheme provides not only forward security but also backward security for digital signature.

Graphics and image processing

Research on Point-symmetric Boundary Extension in Wavelet Transform

Lei SUN

2008, 28(2):  443-445,. 

Asbtract ( )   PDF (574KB) ( )  

Related Articles | Metrics

This paper compared several boundary extensions based on wavelet transform. In particular, we analyzed the smoothness on boundary after point-symmetric extension, proposed a point-symmetric extension based on odd-length symmetric filter and proved that it preserved the perfect reconstruction while keeping the signal length unchanged. We used both symmetric extension and point-symmetric extension to analyze and reconstruct finite signals. The result shows that the point-symmetric extensions reconstruction precision is higher than the symmetric extension's.

Parallel algorithm of region growing based on multi-level queue

2008, 28(2):  446-447,. 

Asbtract ( )   PDF (483KB) ( )  

Related Articles | Metrics

Region growing is one of classical image segmentation methods. In order to satisfy the real-time request of image segmentation, a parallel algorithm of region growing based on multi-level queue was proposed. The algorithm adopted multi-level queue to deposit seed pixels for growing. Boundary seed pixels were grown preferentially, so as the seed pixels beyond boundary were generated early. Therefore, waiting time of neighbors was reduced. Experiments show that compared with general algorithm based on single queue, speed-up ratio of the algorithm can be promoted significantly and its scalability is better.

New hue preserving algorithm for color image enhancement

Quan-You ZHAO Bao-chang PAN Sheng-lin ZHENG Yin-wei ZHAN

2008, 28(2):  448-451. 

Asbtract ( )   PDF (675KB) ( )  

Related Articles | Metrics

After analyzing Retinex theory and its typical algorithm for color image enhancement, a new hue preserving algorithm for color image enhancement was presented. Firstly, it utilized a nonlinear sigmoid transfer function to intensify the image brightness component at multi-scale, and then brightness gain curved surface was acquired by reinforcing the image local contrast, finally the original color image RGB three components were enhanced at the same proportion by brightness gain curved surface, which ensured the hue was constant and undistorted. Experimental results of the proposed algorithm and other algorithms were compared and analyzed to illustrate the effectiveness of the proposed method.

Method of wavelet domain denoising based on directional rectangle window

Yan LIU

2008, 28(2):  452-454,. 

Asbtract ( )   PDF (644KB) ( )  

Related Articles | Metrics

According to the features of the wavelet transform, a new method of choosing the local neighborhood was proposed. For the three subbands of the same scale, we chose rectangle windows of different directions, and the size of the rectangle windows for different scales is also different. For the multidirectional images, Dual-Tree Complex Wavelet Transform(DTCWT) was employed instead of the traditional Discrete Wavelet Transform(DWT). The experimental results indicate that the method of choosing directional rectangle windows is simple and effective, and high PSNR and good visual quality can be obtained from this method.

A new reversible data hiding algorithm using difference expansion embedding

2008, 28(2):  455-459. 

Asbtract ( )   PDF (767KB) ( )  

Related Articles | Metrics

Based on integer Haar wavelet transform, we proposed a new reversible data hiding algorithm using the horizontal and vertical difference images for difference expansion. The major disadvantage of traditional difference expansion techniques is that, before performing the second-level embedding, the image quality has been degraded due to the use of large difference values in the first-level embedding. To solve this problem, our algorithm dynamically divided the payload into two parts for the two difference images obtained in orthogonal transformation directions, so that it can utilize small difference values in two difference images. For a payload, our algorithm aims at using the differences in two difference images under the same selection threshold. Compared with other new or classical algorithms, the proposed algorithm yields better image quality under the same embedding rate.

Ontology matching approach based on RDF graph

Ying WANG Hui-qiang WANG Ji-bao LAI

2008, 28(2):  460-462. 

Asbtract ( )   PDF (425KB) ( )  

Related Articles | Metrics

Ontology matching is the operation that builds the mapping of two ontologies, and an efficient and rigorous similarity measure is a pre-requisite of an ontology matching process. An ontology matching approach was put forward. It used Resource Description Framework(RDF) graph to express ontology and converted the ontology matching to the problem of building RDF graph matching tree. Moreover, the proposed approach presented a similarity measure based on the entities of nodes from the matching tree to obtain the mapping of the two ontologies. Implementation and experimental results were given to demonstrate the effectiveness of the matching approach.

Broadcast mobile TV system based on AVS

Li-Zhi Yang Dong-Hua Liu

2008, 28(2):  463-465. 

Asbtract ( )   PDF (473KB) ( )  

Related Articles | Metrics

A broadcast mobile television system based on Audio and Video coding Standard（AVS） was introduced. The design includes the real time encoder of video and audio, the multiplexer of AVS system, the T-DMB transmit system, decoder and playback on the mobile phone and PC. The experimental results show that the broadcast mobile television system based on AVS is feasible.

An improved thinning method to fingerprint image

2008, 28(2):  466-468. 

Asbtract ( )   PDF (468KB) ( )  

Related Articles | Metrics

Thinning is a very important process in Automatic Fingerprint Identification System(AFIS). But the existing thinning algorithms have many problems such as thinning not to one pixel, ridge swallowing, thinning skeleton not in ridge center and so on.Through researching and analyzing the algorithm of image post processing, an improved image template thinning algorithm was proposed based on a group of modified templates. The experimental result prove that the algorithm is completed, and the refined fingerprint skeleton is in the middle line of grain line and burr-free.Compared with the traditional refinement algorithm,the refinement result is closer to the fingerprint grain line center,so it is convenient for characteristic extracting and it reduces the matching complexity.

Fast algorithm for surface reconstruction from cloud data based RBF neural network

Miao HUANG

2008, 28(2):  469-472. 

Asbtract ( )  

Related Articles | Metrics

On the basis of the analysis of the existing reconstruction methods limitations, a fast neural network based algorithm for 3D surface reconstruction from cloud data was presented. Firstly, a unitary processing for the cloud data was made. And then the contour lines were extracted and the surface based contour lines were segmented. The method can directly from the neural network value matrix get the right curve control points or surface control mesh, and through neural network values restriction achieve the right curve or patch of smooth connection. Experimental results show that this method can quickly obtain good shape Mesh.

Algorithm of irregular 3D fragment partial matching

Jin-Mei WANG Hai-Chao ZHANG Jie-Xin PU

2008, 28(2):  473-476. 

Asbtract ( )   PDF (625KB) ( )  

Related Articles | Metrics

On the basis of contour extraction of 3D fragments, an algorithm for rapid fragment matching in the 3D fragement reassembly was presented. In the algorithm, the type of feature point was calculated according to its neighbor surface type, and then higher similarity contour segments belonging to different contours were found, thus the normal vector was utilized to verify the matching probability of similar space curves. The similarity between feature segments of different contours was measured according to feature point type, feature point curvature and the hausdorff distance of feature segments. This algorithm is suitable for point-based surface.

Edge detection method based on mathematical morphology and canny algorithm

2008, 28(2):  477-478,. 

Asbtract ( )   PDF (482KB) ( )  

Related Articles | Metrics

A new edge detection method was put forward based on mathematical morphology and Canny algorithm. The background of the image was estimated by morphological opening and then calculated together with the original image by geometric operations. Finally, the Canny edge detection algorithm was applied to the processed image. The experimental results show that the proposed approach is obviously superior to the traditional Canny edge detection method with median filter, and provides good foundation for feature extraction and object recognition.

Effective graph indexing model for graph containment search

Huang Chong-ben

2008, 28(2):  479-483. 

Asbtract ( )   PDF (811KB) ( )  

Related Articles | Metrics

Due to the wide use of graph models, fast containment search of graph data finds many applications in various domains. Given a set of model graphs D and a query graph q, in comparison to traditional graph search that retrieves all the graphs containing q (q  g), containment search has its own indexing characteristics that have not yet been examined. In this paper,we performed a systematic study on these characteristics and proposed a contrast subgraph-based indexing model, called csgIndex. Using a redundancy-aware feature selection process, csgIndex can sort out a set of significant and distinctive contrast subgraphs and maximize its indexing capability. Experimental results on real test data show that csgIndex achieves near-optimal pruning power on various containment search workloads, and demonstrates its obvious advantage over indices built for traditional graph search in this new scenario.

Typical applications

Dynamic scheduling method on warehouse layout in distribution centers

2008, 28(2):  484-487. 

Asbtract ( )   PDF (669KB) ( )  

Related Articles | Metrics

Locating the goods into the warehouse in distribution centers is a NP-Hard problem. In this paper, the warehouse was divided into some unit spaces. Integrating the properties of space and time, a dynamic algorithm for the warehouse scheduling in distribution centers was proposed. Within a period of schedule planning horizon, the whole scheduling problem was divided into three parts. The first part generated the initial set of goods with respect to every time slice by considering spatial constraints, arriving time and departure time of the goods; The second part realized the warehouse layout of the initial set of goods obtained in the first part via GA. Because the global searching property of GA， application of elite strategy and leaving minus strategy have been designed to realize the genetic operations, the preferable layout scheme can be found within a unit space. In the third part, the mutual adjustments were used to overcome the scrap in the unit space because of the small amount of goods. Finally, two simulation examples were performed to demonstrate the validity of the proposed optimization approach.

Application of a non-linear dimension reduction algorithm on document clustering

Yue-Heng SUN Yue-Xian HOU Pi-Lian HE

2008, 28(2):  488-490. 

Asbtract ( )   PDF (510KB) ( )  

Related Articles | Metrics

This paper presented a non-linear dimension reduction algorithm-Self-organizing Isometric Embedding (SIE) to compress high-dimensional document data. The algorithm was then validated in document clustering by being compared with the typical linear dimension reduction algorithm-Latent Semantic Indexing (LSI). Experimental results show that while significantly lowering the complexity, the performance of SIE is better than that of LSI and the benchmark.

Design and implementation of real-time voice activity detection based on DSP

2008, 28(2):  491-493,. 

Asbtract ( )   PDF (640KB) ( )  

Related Articles | Metrics

In this paper, a method of Real-time Voice Activity Detection (VAD) based on DSP was proposed．After configuring Interrupt Service Routine（ISR），the audio data was saved through parallel processing of DSP and DMA based on the method of Short-term energy state-switch process．A control board was designed to implement program control function．Experimental result shows that the data of storage account for 94.98% of the marked in the DSP system, so as to realize the real time processing of voice.

Application of radial basis function network invariable blank holding force identification

Li-fen HAN Wei-Ping WANG Xu-Qi HUANG

2008, 28(2):  494-498. 

Asbtract ( )   PDF (805KB) ( )  

Related Articles | Metrics

The strategy of variable blank holding force is an effective measure for the springback control in sheet metal forming processes. The Radial Basis Function（RBF） network and three-dimensional springback simulating technology were employed for variable blank holding force from the forming effects. Meanwhile, the research on the dynamic structure design of RBF network was done and the dynamic structure design method,Dynamic Structure Design of Radial Basis Function network(DYNSDRBF), based on generalization performance was developed and programmed. The application results of DYNSDRBF in the variable blank holding force identification indicate that the structure design method can show better calculation accuracy. The research results on variable blank holding force identification show that the solving method is helpful for improving the sheet forming effects.

Research on Data Sharing between Microscopic Traffic Simulation and GIS

Hong LIANG Jian-Ping WU Tao Feng Man CHENG

2008, 28(2):  499-502. 

Asbtract ( )   PDF (667KB) ( )  

Related Articles | Metrics

According to the analysis of the problems existing in data sharing between microscopic traffic simulation system and GIS, a standard data model and a new markup language for microscopic traffic simulation (MTML) based on Geography Markup Language(GML) were presented. Then a data sharing platform based on MTML was proposed, and the architecture and implement of data sharing platform were given. It is concluded that the data sharing platform is an efficient solution for data sharing between microscopic traffic simulation system and GIS, which has advantages of openness, being platform-independent and expandability.

Design of centralized securities trading system

Yuwei Du Haihang Wang

2008, 28(2):  503-506. 

Asbtract ( )   PDF (672KB) ( )  

Related Articles | Metrics

This article talked about the designing method of security trading systems architecture. At the same time, it indicated a distributed solution for security trading system, and explained the designed method and principle about infrastructure, business, functionality, performance, reliability, extensibility and maintenance in securities trading system. In addition, an example case was offered.

Configuration of stock-market’s information system

Maohua Ding Haihang Wang

2008, 28(2):  507-510. 

Asbtract ( )   PDF (647KB) ( )  

Related Articles | Metrics

This paper described the configuration of information system of Chinese stockmarket. The whole information system can be decomposed to four sub information systems, including broker information system, trade match system, settlement system and market system.

Research and application of telecom charge fraudulent model based on Bayesian network

2008, 28(2):  511-512. 

Asbtract ( )   PDF (324KB) ( )  

Related Articles | Metrics

Establishing a fraudulent behavior model of the malice owe customer according to the analysis of these customers history communication behavior is an important protection means for each telecommunication company. By combining the operators experience and the sample data, this paper presented how to build the model of customer fraudulent with Bayesian network based on the data mining. It is proved that the model based on the On-Line Analytical Processing(OLAP) analysis and the Bayesian network is an effective tool to analyze the customer fraudulency and can get high accuracy.

Improved approach to CHI in feature extraction

2008, 28(2):  513-514,. 

Asbtract ( )   PDF (461KB) ( )  

Related Articles | Metrics

Feature extraction technology is an essential part of text categorization, which directly affects the categorization precision. This paper comprehensively took frequency, distribution and concentration into account and proposed an improved Chisquare Statistic(CHI) approach. In order to verify the improved CHI approach, a contrastive experiment was carried out. The experimental results show that improved CHI approach is superior to traditional CHI approach in feature selection, which verifies the efficiency and probability of the improved CHI approach.

Research of Web-OLAP system based on distributed data cache technology

Li-Juan CAO

2008, 28(2):  515-518. 

Asbtract ( )   PDF (624KB) ( )  

Related Articles | Metrics

To resolve the problem of the heavy Online Analytical Processing（OLAP） server burden resulted from the sharply increasing number of the concurrent inquiry to Web-OLAP system in the distributed environment，a Web-OLAP system based on the distributed data cache technique was brought forward. The overall framework of the system and the expression of the distributed data cache were given out, and the management algorithm of the distributed data cache was designed. Finally, an application case was given. The application result shows that the method can improve the inquiry efficiency of the Web-OLAP system in distributed environment, and greatly shorten the response time.

IAP online upgrade and teleupgrade resolvent based on ARM

2008, 28(2):  519-521. 

Asbtract ( )   PDF (429KB) ( )  

Related Articles | Metrics

After introducing IAP technology, the on-line upgrade and teleupgrade resolvent of ARM microprocessors were given based on LPC2138. Accidental interruption and transmission error during upgrade were settled in this paper. The upgrade technique in the paper is more convenient and fast, and has practical application value in the ARM products.

Design and implementation of NC code compiler based on ANTLR

2008, 28(2):  522-524,. 

Asbtract ( )   PDF (655KB) ( )  

Related Articles | Metrics

A design model of NC code complier based on ANother Tool for Language Recognition（ANTLR） was presented, which adopted the Extended Backus Naur Form (EBNF) to define the NC program syntax rule. The model was implemented with Java language, which can make it independent of operating system.The design and implementation of compiler were described from different aspects: lexical analysis, syntax and semantic analysis, information draws and so on. The practical results show that the model can construct the compiler prototype efficiently, compile the NC code faster and more correctly, and can be expanded easily.

A New Algorithm for Attribute Reduction in Inconsistent Decision Tables

2008, 28(2):  525-527. 

Asbtract ( )   PDF (481KB) ( )  

Related Articles | Metrics

In order to correct some problems of computing the core of a decision table, an improved binary discernable matrix definition based on distribution function for computing the core was put forward in this paper. The improved binary discernable matrix is not only small in scale but also suitable for any decision tables for computing the core. A new algorithm for attribute reduction in inconsistent decision tables was also presented based on getting the core. Only increasing appropriate rows in the improved binary discernable matrix for computing the core, attribution reduction will be obtained by utilizing logic operation. And the absorptive law was used in attribution reduction, which raised the efficiency of attribute reduction greatly.

Research of visualized data mapping technology in ESB environment

2008, 28(2):  528-530. 

Asbtract ( )   PDF (461KB) ( )  

Related Articles | Metrics

As a core component of Service-Oriented Architecture(SOA), Enterprise Service Bus(ESB) systems need to resolve the problem of the transparent data exchange between enterprises. Based on the research of eXtensible Stylesheet Language Transformations(XSLT) and related standards, the paper proposed the visual XSLT data exchange model and analyzed the key algorithm from the graphical expression into XSLT expression of this model in detail. At last, the paper proposed a design of the data visualization tool based on ESB.

Multi-Agent system based on the message communication

SHI LE

2008, 28(2):  531-534. 

Asbtract ( )   PDF (604KB) ( )  

Related Articles | Metrics

To implement the cooperation and communication among Agents in the distributed real-time simulation system based on the multi-Agent is a great challenge. In this paper, an effective communication mechanism of Multi-Agent System(MAS) based on trigger message communication is provided and a MAS model has been constructed by analyzing problems of airport ground traffic and put it into practice in the airport ground traffic stimulation.

Improved fuzz testing for compound document

Ｃhun－Ｙu Ｒen

2008, 28(2):  535-537. 

Asbtract ( )   PDF (478KB) ( )  

Related Articles | Metrics

Fuzz testing is a kind of black box testing, which is used to discover the bugs in the applications and protocols. When being used in testing the application with network service and software with simple file format, fuzz testing performs efficiently, but it is ineffective in testing the software with complex file format because of the force and stochastic fuzzing data.The paper gave an effective fuzz testing strategy in testing the software with complex file format based on the structural storage characteristics of compound document formats.

Implementation of heterogeneous system integration based on ESB

CAI Zhao-Quan

2008, 28(2):  538-540. 

Asbtract ( )   PDF (430KB) ( )  

Related Articles | Metrics

Being the communication barrier in business, divergences of commercial software are hard to mutual integration. This article, to solve this problem, suggested that different systems can be integrated by Enterprise Service Bus（ESB） main line to achieve the goal of smooth communication. And it also enables the system integration to be more convenient and expandable while protecting the existing investment maximally.

Multi-source log audit system based on cluster

Bi-Xiong Liu Ze-ming YANG Huan WU Rong-sheng XU

2008, 28(2):  541-544. 

Asbtract ( )   PDF (655KB) ( )  

Related Articles | Metrics

With the expanding of network size, the transacting capability of the single log server in log audit system is limited, which has already become the bottleneck of that system. To address this problem, a log server cluster equipped with the features of high availability and load balancing, was introduced and a log audit system based on cluster was presented. The system architecture, the structure model of the system and the main modules were described, and a dynamic load balancing algorithm with synthetic loading statistic was provided. Finally, the performance of the log server cluster system was analyzed with the queue theory.

Study on asynchronous communication-oriented page classification

Yu-Lian FEI Bo JIANG Yuan LI

2008, 28(2):  545-548. 

Asbtract ( )   PDF (439KB) ( )  

Related Articles | Metrics

This paper presented a Web page classification model based on Support Vector Machine (SVM) concerning the widely used asynchronous communication technology today. According to the characteristics that the Web page reflected through asynchronous communication technology, the model decided the eigenvectors. Then combining the SVM classification algorithm, the model constructed the page classification algorithm based on SVM. And experiment shows that it not only improves training efficiency, but also has high precision.