Table of Content

01 May 2007, Volume 27 Issue 5

Previous Issue    Next Issue

Articles

Efficient authenticated group key agreement protocol based on ECC

2007, 27(5):  1033-1034. 

Asbtract ( )   PDF (536KB) ( )  

Related Articles | Metrics

An efficient authenticated group key agreement protocol was proposed based on elliptic curve. This scheme is characterized by the following properties: (1) Participants only need tworound communications to get the group key; (2) Based on ElGamal encryption system, the computational overheads and the communication costs are lessened without key sharing technique; (3) The scheme is effective against adaptive chosenmessage attack.

Adaptive hiding method of large capacity information

2007, 27(5):  1035-1037. 

Asbtract ( )   PDF (967KB) ( )  

Related Articles | Metrics

A hiding information algorithm of adaptive multiple plane-bit based on space domain was proposed, which has low computing complexity and large hidden information capacity. Experimental results show the hidden information capacity of this algorithm is one time more than LSB algorithm, and much more than all kinds of transform domain algorithms, but computing complexity is much lower than transform domain. This algorithm may avoid leaking out secrets caused by bit plane filtering because hidden information is not embedded in fixed bit-plane of load's image.

An intrusion tolerant KDC scheme for multicast communication

2007, 27(5):  1038-1040. 

Asbtract ( )   PDF (806KB) ( )  

Related Articles | Metrics

Key Distributed Center (KDC) is an important component for generating symmetric key in multicast communication without using public key cryptography. It is important to keep KDC security and provide efficient symmetric key service. Different from the current partition to domain or replication solution, the proposed scheme uses bivariate polynomials to construct threshold distributed pseudo-random function, distribute the bivariate polynomials across the KDC servers, only the united authorized set of servers can compute the pseudo random for key. It ensure certain number of unauthorized server will not threaten the security of the whole network after being attacked. Therefore, enhance the security of distributed KDC servers was enhanced, and bottlenecks or single points of failure can be prevented.

Intrusion detection model based on weighted multi-random decision tree

Ye Zhen

2007, 27(5):  1041-1043. 

Asbtract ( )   PDF (604KB) ( )  

Related Articles | Metrics

The traditional decision tree category methods (such as:ID3,C4.5) are effective on small data sets. However, when these methods are applied to massive data of IDS, its effectivity will get influenced. In this paper, a random model based decision tree algorithm was applied, and an intrusion detection model based on it was provided. It is verified by experiment that this model is evidently powerful for IDS.

Research of defending buffer overflow exploits based on detecting and preventing shellcode

2007, 27(5):  1044-1046. 

Asbtract ( )   PDF (782KB) ( )  

Related Articles | Metrics

Buffer overflow exploits threat computer systems and the network security very seriously. The principles of buffer overflow exploit and shellcode were introduced first. Then the paper described the method of defending buffer overflow exploit based on detecting shellcode from several aspects including recognizing shellcode from the data types, rebasing modules to prevent shellcode from jumping to the shellcode, and disturbing the methods shellcode use to achieve malicious purposes. At last, advantages and disadvantages of these methods were analyzed and compared and the best of them was pointed out. Several measures were introduced to improve system security more comprehensively.

Study of ID-based key management scheme

2007, 27(5):  1047-1049. 

Asbtract ( )   PDF (579KB) ( )  

Related Articles | Metrics

An ID based key management scheme based on the bilinear property of Weil pairing defend on elliptic curve was proposed. The scheme used Key Generation Center (KGC) and Key Gene Combination Center (KGCC) to accomplish key management and generation. To avoid security problems caused by single independent key management, KGCC used seeded public key and private key mapping technology to mitigate the load of storage and improve the security of system. The analysis shows that this scheme is more efficient, lightweight, secure and stronger in anti-attack than traditional scheme.

A distributed intrusion detection system model based on correlation and agent

2007, 27(5):  1050-1053. 

Asbtract ( )   PDF (846KB) ( )  

Related Articles | Metrics

The article proposed a distributed IDS model, whose data collection unit was composed of classic IDS and backend components used to convert alert information to IDMEF format; data analysis units correlate and merge the alerts reported by all the IDS front-end using existent correlating and merging algorithm; both the units were implemented by autonomous agents; subscription-based model was used to propagate information among the nodes; it is economical and rapid to construct a high-performance distributed IDS under the model.

User authentication algorithm with keystroke features based on genetic algorithms and grey relational analysis

2007, 27(5):  1054-1057. 

Asbtract ( )   PDF (720KB) ( )  

Related Articles | Metrics

User authentication based on keystroke dynamics features is more secure than conventional user authentication approach only based on passwords. The neural network and data mining-based methods present high authentication accuracy, but have a high computational cost. The statistical and vector-based methods have shown low computational complexity, but are less accurate in user authentication. In order to improve authentication accuracy and reduce computational complexity synchronously, a new user authentication approach based on keystroke patterns was proposed. In the proposed approach, Genetic algorithm was employed to generate the common keystroke pattern of each user from the training set consisting of the user's normal keystroke samples. Then Grey Relational analysis method was applied to calculate the degree of grey slope incidence between common keystroke pattern and current keystroke pattern, the resultant value was compared with a threshold value determined by experiment to implement user authentication. Experimental results show this approach represents the same user authentication accuracy as neural network and data mining-based methods in terms of False Acceptance Rate (FAR) and False Rejection Rate (FRR), false acceptance rate and false rejection rate of this method are 1.5% and 0% respectively. It is also shows that the computational complexity of the proposed method is lower than that of some other methods.

ID-based designated-verifier threshold proxy signature

2007, 27(5):  1058-1061. 

Asbtract ( )   PDF (637KB) ( )  

Related Articles | Metrics

An ID-based designated-verifier threshold proxy signature using bilinear parings was introduced. Though fruitful achievements have been made in enhancing the computation of pairings, the computation of bilinear pairings is still a heavy burden on ID-based cryptography. The computation of bilinear pairings in the ID-based designated-verifier threshold proxy signature was reduced and its efficiency was improved. In addition, a relevant security was analyzed and proved.

Worm recovery of OLSR protocol in Ad Hoc

2007, 27(5):  1062-1063. 

Asbtract ( )   PDF (593KB) ( )  

Related Articles | Metrics

The current worm recovery system has limitation, and traditional security routing protocol cannot adapt to mobile Ad Hoc networks. This paper analyzed the wormhole problem in Optimized Link State Routing protocol (OLSR) in detail, and proposed a valid strategy to solve it on the basis of the current one. It ensures the reliability of data transfer from end to end, thus increases the security of routing protocol.

Improvement on centroid detection method for text document watermarking

2007, 27(5):  1064-1066. 

Asbtract ( )   PDF (397KB) ( )  

Related Articles | Metrics

An improvement on centroid detection method invented by Brassil et al was presented. The improved method constructs a centroid series which were convergent in probability to centroid of initial text line using both initial profile and reproduced profile of text line. Experimental result shows that the new approach may half down the probability of detection error in the case of short text lines in comparison with the Brassil' method. The conclusion suggests that line-shift coding would not be subject to text line length again, either long lines or short lines are all used to embed watermark, and the watermark capacity is increased.

New extraction method of image steganography based on FastICA

2007, 27(5):  1067-1069. 

Asbtract ( )   PDF (904KB) ( )  

Related Articles | Metrics

According to the features of steganography, a new extraction was proposed. Different from the traditional extraction based on the invert embedding, this new extraction used FastICA to separate the cover image and embedded image. The objects which have been treated with were wavelet coefficients of true color picture, so steganography, wavelet and Independent Component Analysis （ICA） were combined together. The effect of algorithm proves that ICA can not only be used as extraction but also extract the embedded image blindly.

Design and implementation of a trusted login authentication project based on the trusted platform module

2007, 27(5):  1070-1072. 

Asbtract ( )   PDF (772KB) ( )  

Related Articles | Metrics

Identity authentication for user login is very important to the Operation System. The authentication modes in the Operation System, such as password, Smart Card, USBKEY, moreover Fingerprint and Iris, have a series of secure problems. For example, the password is easily forgotten, guessed out or intercepted, moreover, the store for identity is insecure and the authentication is one directional. In this paper, according to the standards of the trusted computing group, based on the analysis for the traditional identity authentication, a new identity authentication, called the Trusted Login Authentication Based on TPM (TLABT), has been put forward, which can be realized by the Trusted Platform Module (TPM) which stores the users identities and the key, and guarantee the authenticity of the user identity. The TLABT can overcome the traditional deficiencies and support the bidirectional authentication technology for high assurance of system security, thus the basis for building the trusted computing environment has been provided.

Network and communications

A routing protocol with balancing energy and other network performance parameters for mobile Ad Hoc networks

2007, 27(5):  1073-1076. 

Asbtract ( )   PDF (740KB) ( )  

Related Articles | Metrics

This paper presented a Balance Evaluation Function (BEF) according to the communication information. BEF considers the history information of every node, including the packet numbers of data transmission, the dropped packet numbers, the control packet numbers, the selected route times and the hops of route. A new reactive Balance of Energy and Other network performance Parameters routing protocol (BEOP) for mobile Ad Hoc networks were presented. In this route scheme, the nodes of BEF value below a threshold were selected for route. The protocol can balance network performance. The simulation results show that BEOP can offer superior network performance compared with DSR and MBCR.

Connectivity analysis in self-organized network evolution

Xiao SUN Hui Wang Hao Wang

2007, 27(5):  1077-1079. 

Asbtract ( )   PDF (586KB) ( )  

Related Articles | Metrics

Connectivity of self-organized network plays a fundamental role in the guarantee of network communications. This paper analyzed the network connectivity focusing on self-organization evolving processes of fully distributed network. We discussed local-area characteristics and neighbor selection in actual self-organized network and their effect on connectivity in particular. The theoretical analysis and simulation show the network connectivity will be at high risk in Gossip-like self-organization mechanism.

Load balancing algorithm for P2P systems based on partial network information

2007, 27(5):  1080-1082. 

Asbtract ( )   PDF (557KB) ( )  

Related Articles | Metrics

A new load balance algorithm based on partial load distribution of the P2P networks was presented in this paper. The P2P networks reach equilibrium by transferring the load inside the partial network. Theoretical analysis and experimental results show that the new algorithm converges at equilibrium faster than that based on global information, and has less time complexity. Meanwhile, it generates less traffic because of a local transferring, so it works better in P2P networks with thousands of nodes.

A network division model for wireless sensor networks

Hai ZHAO

2007, 27(5):  1083-1085. 

Asbtract ( )   PDF (856KB) ( )  

Related Articles | Metrics

The paper firstly pointed out that the net division can affect network connectivity and then the communication efficiency. Secondly, the communication factors that cause net division in wireless sensor networks were discussed from the perspective of the physical layer and MAC protocol. To quantitatively depict network division, the net division ratio was defined, and the physical and geometric factors that affect the net division ratio were analyzed. Based on massive data collected by trials, a net division model for WSNs was established by doing a series of curve family fitting. The model determined that net division ratio, number of nodes and area ratio obey the given mathematical relationship.

Research of passive infrared sensor model for wireless sensor networks

2007, 27(5):  1086-1088. 

Asbtract ( )   PDF (873KB) ( )  

Related Articles | Metrics

For public security, wireless sensor networks have been widely applied in monitoring public area or target. After in-depth structure analysis, a passive infrared sensor (PIR) model was presented. This model provides some useful suggestion for the wireless sensor networks system design that is equipped with PIR sensor. The sensor test and real-time system experiment validate the reliability of this model.

Query processing in mobile P2P system based on active database

2007, 27(5):  1089-1091. 

Asbtract ( )   PDF (744KB) ( )  

Related Articles | Metrics

In this paper, a system model of mobile agent construction and management was presented. It uses ECA rules of Active Database to define the logic structure of the agent and uses the trigger mechanism of Active Database to manage and execute the agent. By this means not only the architecture of the P2P system supporting instant and contiguous query is significantly simplified, but also the security and efficiency of information are guaranteed through the security mechanism of the Active Database. The architecture of a mobile P2P system node was firstly presented, followed by the structure, management and life cycle of the mobile agent and lastly an application instance was given.

Adaptable mobile transaction model based on weight in mobile computing

2007, 27(5):  1092-1094. 

Asbtract ( )   PDF (608KB) ( )  

Related Articles | Metrics

Mobile transaction model is one of the key technologies. Based on the analysis of the present transaction models, this paper proposed an adaptable mobile transaction model based on weight, which can itself choose sub-transaction model according to the transaction's network and whether the transaction visits the hot data. The results of experiment show that new model has better performance at mobile transaction redo ratio and executing time than other models.

Dynamic power management model to improve node energy efficiency in Ad Hoc network based on probabilistic model checking

2007, 27(5):  1095-1098. 

Asbtract ( )   PDF (737KB) ( )  

Related Articles | Metrics

In Ad Hoc network, mobile node is battery-operated and power-constrained. It is important to prolong the lifetime of battery and optimize energy efficiency. In this paper, dynamic power management model of mobile node was proposed based on energy-hungry components. A stochastic optimum control scheme was applied in this model to improve node energy efficiency. Discrete Time Markov Chains (DTMCs) of the model was presented by using probabilistic model checking technique. Compared with two familiar time out schemes belonging to predictive schemes by PRISM, the energy efficiency of this scheme is better as a whole.

Research of TDOA/AOA hybrid algorithm under the NLOS environment

2007, 27(5):  1099-1102. 

Asbtract ( )   PDF (597KB) ( )  

Related Articles | Metrics

The hybrid algorithm of TDOA/AOA has better location accuracy than Chan algorithm under the CDMA network, but with the fall of AOA's accuracy, the location accuracy will drop gradually, and may below the Chan's. The article adds the amendatory factor in the traditional hybrid algorithm, through iteration gradually to mitigate the affect of Non Line Of Sight (NLOS) to the Time Difference Of Arrival (TDOA) measurement value, so we can get higher location accuracy. The simulation shows that the method here put forward can improve the location accuracy apparently, and the additional operation is rather small.

Energy-Efficient clustering routing algorithm based on LEACH

Zhang Xihuang

2007, 27(5):  1103-1105. 

Asbtract ( )   PDF (592KB) ( )  

Related Articles | Metrics

The Energy-Efficient clustering routing algorithm based on LEACH (LEACH-EE) was presented to prolong the network lifetime and reduce energy consumption, which gathered data by cluster head firstly, and then an optimal multi-hops path was formed among cluster heads which lead to Base station. In this way, the problem of cluster heads consuming more energy has been solved. Experimental result indicates that the new algorithm is very energy-efficient, and it can prolong the lifetime of the sensor network.

A new sip retransmission mechanism based on IMS

2007, 27(5):  1106-1108. 

Asbtract ( )   PDF (532KB) ( )  

Related Articles | Metrics

At present, the session setup time based on the Session Initial Protocol (SIP) in IP Multimedia Subsystem (IMS)is affected by the constrained bandwidth of the wireless link, Frame Error Rate (FER). The number and size of the message exchanged affect the average session setup delay, which can result in retransmission of packets lost and can lengthen the session setup time. In this paper, both the session setup and wireless link were taken into account and a new adaptive retransmission mechanism that was adjustable to the size of signaling packets involved in the session establishment was proposed. The numerical results indicate that the proposed new mechanism can make the session setup shorter and is efficient for optimizing the time of session setup.

Research of the improved robust twinned SOM based on Voronoi distance

2007, 27(5):  1109-1112. 

Asbtract ( )   PDF (707KB) ( )  

Related Articles | Metrics

An improved twinned Self-Organizing Maps(SOM) based on Voronoi distance was presented in this paper. The traditional SOM is extended by using two related neuron networks simultaneously in order to enhance the robustness. Euclidean distance was replaced by the distance to the Vorinoi cell in the proposed SOM. We illustrated the prediction power of the proposed SOM on a real financial time series and artificial data sets. Results demonstrate the effectiveness and robustness of the proposed SOM.

Design and implementation of portable Mobile IPv6 protocol stack

2007, 27(5):  1113-1115. 

Asbtract ( )   PDF (681KB) ( )  

Related Articles | Metrics

Design and implementation of a portable Mobile IPv6 protocol stack (MultiPlat-MIPv6) is presented in detail. A simple transplanting method of Mobile IPv6 protocol stack was brought up, in witch Mobile IPv6 protocol stack includes the universal and the particular modules. Transplanting is simplified to change the particular modules. The security mechanism in this protocol stack is also given simply. It is helpful for the development of network protocol stacks and mobile network devices on different operating system platform.

Research and application of vertical search engine in networked manufacturing resource〖JP〗

2007, 27(5):  1116-1118. 

Asbtract ( )   PDF (539KB) ( )  

Related Articles | Metrics

This paper put emphasis on the technologies of the system, including the topic crawler and the Chinese word segmentation. To improve the efficiency of the crawler, a model of page evaluation was added into the crawler module; therefore the urls in a page with a high similarity of the topic will be first crawled. Besides, an improved word matching algorithm was proposed to enhance the speed and precision of word segmentation.

Graphics and image processing

An adjustable subdivision surface modeling based on quadrilateral meshes

2007, 27(5):  1119-1120. 

Asbtract ( )   PDF (767KB) ( )  

Related Articles | Metrics

This paper presented an adjustable subdivision surface scheme based on quadrilateral meshes. The scheme can deal with both open topological structures and close topological structures. The scheme can produce subdivision surface of C1 continuity of limit surface. Because an adjustable parameter was introduced to the scheme, the surface modeling was flexible. Given the condition of the initial data, we can adjust and control the limit surface shape through selecting appropriate parameters. The method is effective in generating smooth surfaces.

A multimodal background model based on binning kernel density estimation

2007, 27(5):  1121-1122. 

Asbtract ( )   PDF (465KB) ( )  

Related Articles | Metrics

A novel nonparametric multimodal background model was proposed to detect moving objects. The binned kernel density estimators were exploited to estimate the probability density function of background intensity in training sequence. Based on the gravity center of the data points, the binned kernel density estimators described the key information of the original whole sample set and avoided the repetition computation in the evaluation phase. Compared with algorithm based on the whole samples, the proposed approach is proved to be efficient in traffic surveillance systems, and it can be used in outdoor environment surveillance systems.

Shadow elimination by chrominance distortion and local kullback-leibler divergence

2007, 27(5):  1123-1125. 

Asbtract ( )   PDF (643KB) ( )  

Related Articles | Metrics

Extracting Moving objects accurately plays an important role in intelligent video-surveillance systems. Remnant shadows will bring many problems such as distortion of the object shapes and the unexpected adjacency between objects, and these problems can make the posterior work of object tracking and recognition very difficult. First, this paper analyse the optical characteristic of cast shadows, then propose a shadow elimination method based on chrominance distortion and local Kullback-Leibler divergence. At last, the experiment results are presented.

A novel trajectory pattern learning method based on vector quantization and depth first search

Tao Zhou

2007, 27(5):  1126-1128. 

Asbtract ( )   PDF (1081KB) ( )  

Related Articles | Metrics

This paper puts forward a novel depth first search method to learning the distribution of motion trajectory based on the vector quantization of the flow vectors. Then the sequential patterns graph is generated, which visually represents the trajectory pattern. The corresponding anomaly detection method is also given in this paper. The experiments on different sites demonstrate that our method can not only discover the flow vector's distribution but also can reflect their time orders effectively, which makes it suitable for anomaly detection in outdoor scenes.

Real-time volume rendering of large datasets on standard PC hardware

Kai Xie YueMing Zhu

2007, 27(5):  1129-1131. 

Asbtract ( )   PDF (622KB) ( )  

Related Articles | Metrics

A high quality volume rendering technique was presented to render a large volume dataset at interactive rates on standard PC hardware. We employed 3D texture mapping as a core rendering engine and took advantage of combinations of HW-supported visibility tests such as occlusion queries, stencil tests and programmable shaders to accelerate the whole rendering process. We have implemented the volume rendering algorithm for large volume data, and achieved real-time performance without any loss of image quality.

Discrete ridgelet transformation and its application in SAR image compressing

2007, 27(5):  1132-1134. 

Asbtract ( )   PDF (765KB) ( )  

Related Articles | Metrics

According to the characteristics of noise in SAR, the ridgelet theory, which has been hot research field for its superiority in line feature, was introduced to SAR image compressing. After analyzing the traditional method based on wavelet in detail, a new ridgelet-based compressing approach was proposed. Finally, experimental results demonstrate its good performance, especially for urban SAR image.

Face recognition based on dual-tree complex wavelet feature

2007, 27(5):  1135-1137. 

Asbtract ( )   PDF (710KB) ( )  

Related Articles | Metrics

Approximate shift invariance, good directional selectivity, computational efficiency properties of Dual-tree Complex Wavelet Transform (DTCWT) make it a good candidate for representing the face features. This paper proposed a new dual-tree complex wavelet feature representation for face recognition. We got the directional and spatial/frequency characteristics of the patterns and classify different face patterns in terms of these characteristics. Experimental results show that the proposed DTCWT based feature extraction, combined with the Fisherface recognition method, (DCF) can extract optimally discriminate face feature and achieve high recognition rate and generalization. In addition, our experiments verify that the proposed feature extraction based on DTCWT outperforms which based on Gabor wavelet.

3D pose estimation based on single face image

2007, 27(5):  1138-1140. 

Asbtract ( )   PDF (794KB) ( )  

Related Articles | Metrics

Aiming at 3D pose computation from single facial image, a method was proposed based on the theory of anthropometry in face and projective geometry: first, corners of eyes and mouth, and nosewing points were selected to establish facial model within facial plane; then, the orientation of face was determined based on the location of vanishing points in image, which were resulted from two perpendicular features lines in perspective project. This method can be implemented without any auxiliary equipments and prior knowledge, distinct feature points are easy to be located, and the practicability can be verified.

Design and rendering of individual 3D human facial model

2007, 27(5):  1141-1144. 

Asbtract ( )   PDF (988KB) ( )  

Related Articles | Metrics

A 3D human facial model structure was designed for supporting the individual distortion and the real-time demonstration, and a real-time continuous multiresolution rendering method with feature constraint was proposed. The structure took full account of the features and the adjacency of points, edges and triangles, and was convenient to the moving of featured regions in the distortion process. Based on it, the feature constraint multiresolution rendering method established a direct link between the view parameter and the model resolution, which can preserve the vision characters well and ensure the realization of continuous real-time rendering.

Improved particle system for cloth animation

2007, 27(5):  1145-1146. 

Asbtract ( )   PDF (607KB) ( )  

Related Articles | Metrics

It is one of the most difficult tasks in computer graphics community to obtain realistic cloth animation in real-time. Targeting on the super-elastic effect in cloth animation and considering the material characteristics of fabric, this paper presented an improved particle system, in which not only the linear stiffness but nonlinear factors were taken into account. This model fit the physical characteristics of fabric better. In the external forces calculation, the particles covering case under air forces was considered and the corresponding algorithm was put forward. As simulation shows that this model can reflect the mechanics characteristics of fabric better and the simulation results are more real.

A novel approach to dynamic ocean surfaces simulation for Realtime 3D

2007, 27(5):  1147-1149. 

Asbtract ( )   PDF (700KB) ( )  

Related Articles | Metrics

Dynamic ocean surfaces for realtime 3D plays a crucial role in navigation simulation and ocean numerical computing, but, creating water surfaces for simulating realistic oceans and lakes in real-time simulation is a difficult and time consuming task. In this paper, we proposed a novel approach for simulating realistic ocean surface, using a statistical model and FFT to provide a high performance native wave model. We also study the marine special effects. Compared with three existing systems, our proposed method can better achieve the performance required for interactive realtime3D simulation and training.

Mesh simplification algorithm based on control point error control

2007, 27(5):  1150-1152. 

Asbtract ( )   PDF (576KB) ( )  

Related Articles | Metrics

In this paper, a mesh simplification algorithm based on control point error control was introduced. The first control points are the center points of the initial mesh triangles. The second control points are the vertexes of the characteristic lines. The distance between the control point to the under control triangle is the error between the initial mesh and the simplified mesh. The triangles are collapsed in order according to the weights of the triangles. The triangle collapse operation should meet the requirement that the distances between the control points and the under control triangles are less than the threshold value. Finally the validity of this algorithm is verified by the experiment.

Video de-interlacing algorithm based on improved 3D recursive searching

2007, 27(5):  1153-1155. 

Asbtract ( )   PDF (907KB) ( )  

Related Articles | Metrics

To study a new de-interlacing algorithm, this paper has proposed an improved 3D Recursive Searching (3DRS) video de-interlacing algorithm. With the use of bi-directional motion estimation, it solves the error propagation problem in the primitive algorithm. With the use of a multi-resolution idea, it improves the precision of the motion estimation process according to the matching block size of the adaptive video context. The experimental results indicate, to most test sequences, this proposed algorithm has obtained the performance superior to primitive 3DRS algorithm on the experimental result.

3D mesh model watermarking algorithm based on wavelet transform

2007, 27(5):  1156-1159. 

Asbtract ( )   PDF (870KB) ( )  

Related Articles | Metrics

In this paper, we proposed a robust watermarking algorithm for 3D mesh. The algorithm was based on wavelet transform. A planar parameterization algorithm was first proposed to map 3D mesh models to 2D parametric meshes. Geometric signals were then transformed into 2D signals. Then a wavelet-based watermark casting scheme was proposed to embed the watermark into some wavelet coefficients. Experimental results show that the embedded watermark is robust against various geometry signal processing attacks.

Color image restoration based on dynamic recurrent RBF neural network

Ge Hong-wei

2007, 27(5):  1160-1163. 

Asbtract ( )   PDF (1032KB) ( )  

Related Articles | Metrics

Because the dynamic recurrent Neural Network that performs nearest neighbor classification shows good performance, it was adopted for color image restoration in this paper. It combines a MLP and a Radial Basis Function (RBF) Neural Network, and allows for explicit representation of prototype patterns as network parameters, as well as adding or deleting prototype freely, so the structure of this system is characterized by self-adaptation. The dynamic classification implemented by the network eliminates all comparisons, which are the vital steps of the conventional Nearest Neighbor Classification (NNC), and to some degree it is also simple for computation. The results show this model restores the typically degenerated image with different noise ratios excellently.

Video object extraction based on the intersection between three edge of frame change

2007, 27(5):  1164-1166. 

Asbtract ( )   PDF (688KB) ( )  

Related Articles | Metrics

In order to eliminate the effect caused by noise, complex motion and uncovered background in the process of segmenting video objects, a new method for segmenting video objects was proposed. The method adopted two frames at a distance of k for frame change instead of two successive frames, and then got the intersection between three edge of frame change and repaired the part outline point of moving video objects. Finally, filling in outline to form the binary image and morphology processing was performed on the binary image to get the segmentation result. Experimental results show that the new algorithm can segment video objects accurately and automatically.

Frame layer rate control algorithm for H.264/AVC

2007, 27(5):  1167-1170. 

Asbtract ( )   PDF (749KB) ( )  

Related Articles | Metrics

The cause of great quality variation of H.264/AVC was analyzed. In this paper, we proposed a new frame layer rate control scheme based on feedback method (Rate Control Based on Feedback, RCBF). The new scheme allocates bits based on the scene content complexity if the buffer is not overflow and underflow, which lessens the quality variation caused by that the bits allocation to each frame is not in proportion to its scene content complexity. The paper also adopted the feedback method to adjust the bits allocated, making the frame layer rate control more reasonable and accurate. Simulation results show that RCBF scheme PSNR variation is smaller than that of JVT-G012 in JM10.2. Moreover both the average PSNR and control accuracy are improved.

Research Of OpenGL Implementations And Performance Based On PC Platforms

2007, 27(5):  1171-1173. 

Asbtract ( )   PDF (718KB) ( )  

Related Articles | Metrics

A feature of OpenGL is operating system and window system independent. The approach of OpenGL implementations based on PC, including the software implementation, Hardware-accelerated implementation, and the implementation across different platform was analyzed. Furthermore, the performance of OpenGL implementations was measured based on Windows operation systems and Linux distributions with SPECViewperf 9.0 benchmark. The results indicate that Hardware-accelerated OpenGL implementation can attain optimized performance. And for PC platform, the performance of OpenGL implementations is affected by operating system and window system. Benchmarking and Performance Evaluation helps us to select a platform for optimized performance of OpenGL.

Artificial intelligence

Parameters setting of PID controller based on adaptive immune evolutionary algorithms

2007, 27(5):  1174-1176. 

Asbtract ( )   PDF (817KB) ( )  

Related Articles | Metrics

A New Adaptive Immune Evolutionary Algorithm (NAIEA) was proposed in this paper according to regulatory mechanism of the immune network in biological immune system. NAIEA chose the stimulation level as the selection pressure for the antibodies. Moreover, the adaptive population control strategy and new elitist strategy were also devised to improve the performance of genetic algorithm. The simulation results of the setting of PID parameters show that NAIEA can effectively prevent the loss of the population adversity, and the performance of PID controller based on NAIEA is superior to that of PID controller based on genetic algorithm.

Intelligent forecast integrated with CBR and ART-KNN for CFW

2007, 27(5):  1177-1179. 

Asbtract ( )   PDF (718KB) ( )  

Related Articles | Metrics

Integrated with case-based reasoning (CBR) and Adaptive Resonance Theory-Kohonen Neural Network（ART-KNN）, a Cucumber Fusarium Wilt（CFW) intelligent forecast method was proposed in this paper. Different from the traditional similar case retrieval, this method performs case classification with trained ART-KNN and then figures out a similar case set using a proposed case similarity metric. The optimal similarity parameter ρ of ART-KNN was determined by its classification performance test, and the best mean classification accuracy rate was 94.4%. The optimal interval of case dissimilarity threshold R for CBR was determined by a CFW forecast test, and the best mean prediction error rate of the ill plant rate and the ill leaf rate were 7.4% and 9.3% respectively. Comprehensive analysis results show that the proposed method can provide reliable prediction data and assistant decision information for CFW prevention and treatment.

Multiple constrained QoS optimal routing selection of mobile IP

2007, 27(5):  1180-1182. 

Asbtract ( )   PDF (537KB) ( )  

Related Articles | Metrics

This paper proposed a new Genetic Algorithm (GA), called Extended Distributed Genetic Algorithms (EDGA), and link coding for multiple constrained Quality of Service routing selection of Mobile IP. EDGA combines the advantages of Distributed Genetic Algorithms and Cascade Model, based on the separating operation, dynamically allotting the size of sub-populations according to their performance, directing the migration, and therefore making the searching of routes converge to the global optimization faster and better. The result of the experiments shows that the method is more effective than others.

Job-shop scheduling problems based on immune ant colony optimization

2007, 27(5):  1183-1186. 

Asbtract ( )   PDF (676KB) ( )  

Related Articles | Metrics

Mathematic model of Job-shop scheduling problem was established and a kind of immune ant colony algorithm is introduced to dispose Job-shop scheduling problem. Through introducing the mechanism of immunity into the operations of genetic algorithm, the vaccines is obtained and updated in those operations. Then, the immune operation is used on the evolution of populations. And the problems on easy appeared precocity, low searching efficiency can be avoided when immune operation takes effect. The simulations show that the algorithm is feasible and efficient.

A quantum genetic algorithm with repair function and its application in knapsack question

2007, 27(5):  1187-1190. 

Asbtract ( )   PDF (636KB) ( )  

Related Articles | Metrics

A Quantum Genetic Algorithm (QGA) with repair function was proposed in this paper. This algorithm codes the chromosomes in the way of quantum bit probability, and makes the population evolve by the operation of quantum gate. When solving the knapsack question, repair function was used to repair unfeasible code. The implementation and procedure of this algorithm were introduced in detail in the paper. The test results of several typical knapsack questions show that this algorithm has better comprehensive performance than conventional genetic algorithm.

A modified niching particle swarm optimization algorithm for multimodal function

2007, 27(5):  1191-1193. 

Asbtract ( )   PDF (725KB) ( )  

Related Articles | Metrics

A modified niching Particle Swarm Optimization (PSO) algorithm was constructed which allowed unimodal function optimization methods to efficiently locate all optima of multimodal problems that the Niche PSO cannot reach. In the new algorithm, the sequential niche technique was introduced. Firstly, a stretching technique was adopted in main swarm. Secondly, the dismissal mechanism was used in sub-swarms namely when a local extreme point of value was found in sub-swarms, the sub-swarms would be dismissed and regressed to the main swarm. At last, the radius of created sub-swarms was confined in order to avoid the excessive of radius. The new Stretching-Niche PSO （SNPSO） algorithm could resolve the disadvantage of standard Niche PSO that the local best of value depends on the number of sub-swarms and easily has the problem of iteration and pretermission. Testing of the algorithm by using three benchmark functions indicate that the modified niching PSO has better performance than standard Niche PSO in terms of the stability, convergence and coverage in searching a better value.

Hybrid optimization algorithm for solving maximum independent set problems

Ge Hong-wei

2007, 27(5):  1194-1196. 

Asbtract ( )   PDF (644KB) ( )  

Related Articles | Metrics

Ant Colony Optimization (ACO) behaves well in finding local optimum, whereas its global search depends on selection of the evaporation coefficient. An unsuitable evaporation coefficient may result in local optimum of final solution. Tabu Search (TS) behaves well in finding global optimum of combined optimization problems. To compensate for the limitations of the single algorithms, the authors integrated the two algorithms together and put forward Tabu Search and Ant Colony Optimization based Hybrid Optimization Algorithm HTSACO to solve maximum independent set. As compared with the standard ant colony optimization, the proposed algorithm demonstrates quite high global optimization capability and computing efficiency.

Lane-changing model with fuzzy control based on cellular automata

2007, 27(5):  1197-1200. 

Asbtract ( )   PDF (702KB) ( )  

Related Articles | Metrics

According to the theory of Cellular Automata, we built an improved traffic-flow model, and gave the evolving rules of every vehicle. We set up lane-changing rule based on traffic-flow model and vehicle's action in reality, and set up lane-changing model by using fuzzy inference to simulate people's subjective judgment. Simulation shows that the model can simulate vehicle action favourably.

Algorithm of case attribute optimization based on heuristic reduction

2007, 27(5):  1201-1203. 

Asbtract ( )   PDF (509KB) ( )  

Related Articles | Metrics

Through studying the attribute reduction algorithm based on discernibility matrix in rough set theory, an algorithm of attribute heuristic reduction was put forward, which can be used to optimize the case fault attributes. Three key elements were considered in the algorithm, and the effectiveness of the algorithm was proved through the optimization of the fault cases attributes of communication equipment.

Whole-priority algorithm for traveling salesman problem

2007, 27(5):  1204-1207. 

Asbtract ( )   PDF (714KB) ( )  

Related Articles | Metrics

To solve Euclid Traveling Salesman Problem（TSP）, a new algorithm named whole-priority algorithm was proposed. The basic idea is "adjusting while constructing". During adjustment process, a creative method named reverse adjustment was adopted, to prevent the algorithm from being got in local optimization trap. Theoretical analysis and lots of experimental results indicate that the time complexity and space complexity of the algorithm are low, and its search-optimization ability is quite strong, whose comprehensive performance exceeds that of present major algorithms.

A multiple dimension set partitioning load balancing resource optimization allocation algorithm

Zhen-Dong WU

2007, 27(5):  1208-1209. 

Asbtract ( )   PDF (543KB) ( )  

Related Articles | Metrics

As to the reasonable matching between the resources needed by multi-task and M-dimensional resources offered by multiprocessing nodes, the author offered multiple dimension set partitioning optimization models, defined the function of resource balancing degree and proposed a Multiple Dimension Set Partitioning Load Balancing Resource Optimization Allocation Algorithm(MDSPLBROAA), which can optimize to solve the NP problems. The experimental results presented show that the algorithm has better practicability and feasibility. Furthermore, it has higher efficiency than the traditional heuristic algorithm.

Research of calculating sentential similarity in translation memory

2007, 27(5):  1210-1213. 

Asbtract ( )   PDF (801KB) ( )  

Related Articles | Metrics

Several commonly-used calculating methods of the sentential similarity, one of the key technologies of Translation Memory, were analyzed. According to the requirements of English-Chinese translation memory system, a new method based on sentential form and semantics was proposed. The method stored the sentences on the basis of sentential forms, and obtained the sentential similarity with combining the semantic similarity and the weight of the component of the sentences. It can display the degree of semantic and structure between two English sentences commendably.

Adaptive training and pruning algorithm for Stock index prediction

2007, 27(5):  1214-1216. 

Asbtract ( )   PDF (752KB) ( )  

Related Articles | Metrics

A tapped delay neural network based on adaptive learning and pruning algorithm was proposed to predict the nonlinear time serial stock indexes. Firstly adaptive learning algorithm based on recursive least square was employed to train the tapped delay neural network. Because this algorithm's learning step can be auto-conditioning and the number of its tunable parameters is small, the convergence rate is fast. Secondly the architecture of neural network which has been trained was optimized by utilizing pruning algorithm to reduce the computational complexity and enhance network's generalization. And then the optimized network was retrained so that it had the optimum parameters. At last the test samples were predicted by the ultimate network. The simulation and comparison show that this optimized neuron network can not only reduce the calculating complexity greatly, but also improve the prediction precision. The computational complexity was reduced to 0.0556 and mean square error of test samples reached 8.7961e-5。

MFCC feature extraction of speech based on pitch period

2007, 27(5):  1217-1219. 

Asbtract ( )   PDF (562KB) ( )  

Related Articles | Metrics

This paper proposed a MFCC feature extraction method based on pitch period to improve the performance of speaker recognition. The original speech signals were decomposed into two parts: the speech within the length of multiple pitch periods and that out of the pitch period. The former part was reserved to minimize the spectral distortion. The improved MFCC feature extraction method was also used in the verification experiment of the text-independent speaker recognition. The result shows the recognition rate is improved.

Study on tangent distance with SVD method for characters recognition fine classification

2007, 27(5):  1220-1221. 

Asbtract ( )   PDF (548KB) ( )  

Related Articles | Metrics

The tangent distance with SVD method was applied to large-set offline hand-written Chinese characters' fine classification since the traditional Euclidean distance is sensitive to the hand-written characters' shape transformation. Experiment indicates that this method has better recognition accuracy and proves the efficiency of the tangent distance classifier.

Handwritten Chinese Character Recognition Based on Local Gabor Filter Bank

2007, 27(5):  1222-1224. 

Asbtract ( )   PDF (617KB) ( )  

Related Articles | Metrics

This paper proposes a new local Gabor filter bank with multiple scales to overcome the disadvantage of the traditional Gabor filter bank with a single scale, which is sensitive to the width variation of handwritten Chinese characters. In order to evaluate the performance of our method, a handwritten Chinese character recognition system based on Gabor feature is presented. Experimental results show that the method is effective for both dimension reduction and recognition performance. The novelty of the method is to select partial Gabor filter bank with part of m scales and n orientations to extract Gabor feature. The best average recognition rate of 92.32% was achieved, which indicated this method was suit for handwritten Chinese character recognition.

Articles

Collaborative filtering recommendation based on user clustering in personalization service

2007, 27(5):  1225-1227. 

Asbtract ( )   PDF (585KB) ( )  

Related Articles | Metrics

Collaborative filtering is the most successful technology for building recommendation systems. Unfortunately, the efficiency of this method declines linearly with the number of users and items. A collaborative filtering recommendation algorithm based on user clustering was employed to solve this problem. Users were clustered based on users' ratings on items, then the nearest neighbors of target user can be found in the user clusters most similar to the target user. Based on the algorithm, this paper proposed that the collaborative filtering algorithm should be divided into two stages: to compute the similar coefficient and to produce recommendation. The first stage was done in the off-line phase and thus the computation in the on-line recommendation phase was reduced and the speed of on-line recommendation system was increased. And this paper also improved the initial center point's selection of K-Means clustering algorithm.

Weak functional dependencies and inference rules for XML

2007, 27(5):  1228-1231. 

Asbtract ( )   PDF (701KB) ( )  

Related Articles | Metrics

The problem of functional dependencies for Extensible Markup Language (XML) is the foundation of further research for XML database. In this paper, first, based on the definitions of Document Type Definition (DTD) and XML tree given by M.Arenas et al., concepts of null value, incomplete tree tuple, data value partial order and minimal extended tree were proposed. Second, the definition of weak functional dependency and its satisfaction were given. Then the problem of logical implication for weak functional dependencies was studied, and a set of inference rules for XML were presented. Finally, the correctness and completeness of the set were proved.

Similarity search over time series data using DCT

2007, 27(5):  1232-1234. 

Asbtract ( )   PDF (677KB) ( )  

Related Articles | Metrics

High dimensionality is the main difficulty of similarity search over time-series data. The most promising solution involves performing dimensionality reduction on the data, then indexing the reduced data with a spatial method. Recently, two methods of dimensionality reductions have been proposed, DFT and DWT. In this paper we proposed a new method, dimensionality reduction with DCT, and further provided the method of similarity search about range query and nearest neighbor query. Compared with those methods based on DFT and DWT, it is more efficient in theory and experiment.

Classification text with incomplete data based on Bernoulli mixture mode

CAI Chong-Chao CAI WANG Shi-Tong WANG

2007, 27(5):  1235-1237. 

Asbtract ( )   PDF (715KB) ( )  

Related Articles | Metrics

It is an important issue to construct the text classification with incomplete data. An improved method that based on Bernoulli Mixture Model and Expectation Maximization(EM) algorithm was introduced. Based on Bernoulli Mixture Model and EM algorithm, by learning the labeled data, the initial value of likelihood function parameter was obtained first. Then the parameter estimate of prior probability model on the classifier with EM algorithm including weight was presented. Finally we got the improved classifier. The results show that our new method is better than the nave bayes text classification in the recall and precision.

Behavior-based software testing process model and its application

2007, 27(5):  1238-1240. 

Asbtract ( )   PDF (630KB) ( )  

Related Articles | Metrics

On the basis of a thorough analysis of the software integration testing technique, compared with the common software testing model, a new behavior-based software testing process model was proposed. It covered the whole testing process including test design, test plan, test case generation, test execution, test results analysis and retesting. These activities were merged into the lifecycle process of software development. The behavior-based testing model was applied to a software testing project of large application software called American On-Line Media Player (AMP) project and the result that the behavior-based software testing model has some advantages in digging the early bugs and efficiency of regression testing was obtained.

Application of compiler optimizing technology on out-of-core computations

2007, 27(5):  1241-1244. 

Asbtract ( )   PDF (665KB) ( )  

Related Articles | Metrics

A transformation technique which is suitable for out-of-core program was described. Joint use of loop and data transformations help enhance the locality. This solution can not only optimize a single loop nest, but also handle a sequence of loop nests. The experimental results show that the method significantly improves the efficiency of out-of-core computation.

The testing research based on an extended Petri net of EEPC

Feng Yin

2007, 27(5):  1245-1247. 

Asbtract ( )   PDF (625KB) ( )  

Related Articles | Metrics

In the Grid testing, the integration testing was one of the most important. For cutting down the testing cost, the extended Petri net and Extended Event-Process Chain （EEPC） model were taken as the researching base during the integration testing of components. After fusing adequately the excellences of Petri and EEPC in structure expression, qualitative and quantitative analysis, etc., the PRI of components would be sorted through quantitatively analyzing some parameter, such as the using frequency of components. In the end, the testing emphasis would be put on the components that had the more upper PRI, in order to reduce the testing cost in an across-the-board status.

An estimation method of iteration periods in XP project

2007, 27(5):  1248-1250. 

Asbtract ( )   PDF (540KB) ( )  

Related Articles | Metrics

The development period of a Extreme Programming (XP) project depends on the productivity of development team. The productivity can be described by probability of which all user stories are achieved successfully in each iteration phase. In this paper, we presented a simple, but realistic mathematic method to estimate the productivity and iteration periods of XP project. The approach can be useful in estimation of development cost and effort. The approach was verified valid with a set of simulation data.

An optimizing data decomposition method based on linear inequalities

2007, 27(5):  1251-1253. 

Asbtract ( )   PDF (713KB) ( )  

Related Articles | Metrics

Maximize parallelism and minimizing communication by increasing the locality of data references are important issues for achieving high performance on large-scale parallel machines. This paper presented an optimizing method for data calculation and computation decomposition. The authors have improved the method by Anderson and Lam. Use linear inequality system to describe data and computation decomposition and reconstruct linear inequality system after adding read-only array with boundary replication. Communication load can be reduced effectively.

The software reliability analysis based on test cases

2007, 27(5):  1254-1256. 

Asbtract ( )   PDF (757KB) ( )  

Related Articles | Metrics

Software reliability is one of the important difficult problems in software test. Because of the complexity of the programming languages and the variety of applications, there is not a good module to evaluate the software reliability. Therefore, a new module was presented based on black box test, which incorporated equivalent class and boundary value to analyze software complexity, fault severity and information insufficiency by matrix and mathematical statistic knowledge, and proved confidence lower limit of this model by EM algorithm. Finally, the result of experiment shows this model has a better performance.

Typical applications

Research and realization of an embedded WLAN security detection project

2007, 27(5):  1257-1259. 

Asbtract ( )   PDF (729KB) ( )  

Related Articles | Metrics

Wireless packets capturing and the technology of decoding frame and security detection method were analyzed. The technique of wireless net card monitoring mode was adopted to supervise the wireless frame. From the analysis of data frame, detecting methods of performance testing and 802.1x authentication were brought forward, and the network status was displayed in the intuitionistic way. On this basis, a WLAN security detection plan was presented and the design of WLAN security detection system was described in detail.

A parallel algorithm for structural comparison of executable objects

2007, 27(5):  1260-1263. 

Asbtract ( )   PDF (747KB) ( )  

Related Articles | Metrics

In order to improve the efficiency of structural comparison of executable objects, a parallel algorithm based on Global-Address Space Programme Model was presented. The process of structural comparison was consisted of two parts: concurrent information gaining and parallel structural comparison. Owning to the affinity in UPC terms, the algorithm made remote accesses invalid, which reduced the overhead of remote memory accesses. This algorithm was realized in cluster systems with good load balancing. The experimental result shows that the parallel algorithm is highly efficient and well scalable.

Research and realization of ERP system based on SOA and BPM

2007, 27(5):  1264-1267. 

Asbtract ( )   PDF (747KB) ( )  

Related Articles | Metrics

This paper analyzed the deficiency of traditional Enterprise Resource Planning(ERP) solution at first and put forward the solution of realizing ERP system based on Service-Oriented Architecture(SOA) and Business Process Management(BPM). Then, after analyzing the principle of the service-oriented architecture and the idea of business process management, a service and business process management oriented enterprise application frame was proposed. This paper expatiated the methods and steps of integration based on SOA and BPM in detail and has fully proved the feasibility and superiority developed in ERP system integration based on SOA and BPM.

Quality management system for the mass seismic information collection

CHEN Ming CHEN

2007, 27(5):  1268-1270. 

Asbtract ( )   PDF (590KB) ( )  

Related Articles | Metrics

In this paper a new system that integrates the whole process of seismic information collection was presented. A model for data evaluation was designed and the system frame and the method dealing with mass information were presented. The experimental results show that the new developed system is able to efficiently control the quality of information collection.

Design and realization of information exchange platform based on embedded terminal

2007, 27(5):  1271-1273. 

Asbtract ( )   PDF (663KB) ( )  

Related Articles | Metrics

In view of embedded device's features, and with the practical research into the information exchange for building numeric campus, a new design of information exchange platform based on embedded terminal was proposed. Through constructing model of the platform and analyzing architecture of its primary embedded terminal, the realization of message exchange and data upload with mobile phone was described, which took Linux as the operating system and Intel XScale PXA270 as the core of hardware, as well as employed an expanded module for mobile communication. Finally one of its examples was given to illustrate the detailed process which was used for information exchange within different subareas of a campus.

Fine-grained access control for Web pages based on GAA-API

2007, 27(5):  1274-1276. 

Asbtract ( )   PDF (549KB) ( )  

Related Articles | Metrics

Based on the Generic Authorization and Access control Application Program Interface (GAA-API), the paper presented a method of fine-grained access control for Web pages. It provides fine-grained and flexible access control for static resource elements and dynamic resource elements in Web pages. Finally the method was tested and the result was analyzed.

Auto-test for agricultural expert system

2007, 27(5):  1277-1279. 

Asbtract ( )   PDF (892KB) ( )  

Related Articles | Metrics

To deal with the problems existing in the research of the Agricultural Expert System, on the basis of digesting and absorbing the advanced research results home and abroad, we made some research and exploration at auto-test technology of software and developed an auto-test tool of Agricultural Expert System with reference to the present research work. This software test tool provides database test, knowledge base test, auto production of cases and maintenance and robustness test. It may do auto-test for a series of function modules (mainly include .EXE and .DLL files) developed by Object Oriented Programming and Soft Component Technology used extensively.

Game design of self automation based on artificial neural nets and genetic algorithms

2007, 27(5):  1283-1282. 

Asbtract ( )   PDF (611KB) ( )  

Related Articles | Metrics

The self-automation of no-player-control role has been trends of video games. To improve self- automation of No-Player-Control (NPC) role, methodology of Artificial Neural Nets (ANN) was integrated with Genetic Algorithms, and self-learning models of NPC were created to control behaviors of NPC. The experimental results have shown that self-learning system of NPC provides artificial behaviors with more automation and intelligence.

The simulink simulation of time access services in SOIS

2007, 27(5):  1286-1288. 

Asbtract ( )   PDF (531KB) ( )  

Related Articles | Metrics

Spacecraft Onboard Interface Services (SOIS) is a standard of onboard protocol and software services, the outmost layer of which defines the uniform services interface for user. Time access service is one of the basic services. A new method of Simulink/Stateflow modeling was proposed to simulate the Time Access Services.

Spatial decision support system for controlling the outbreak and spread of animal epidemics

2007, 27(5):  1289-1292. 

Asbtract ( )   PDF (921KB) ( )  

Related Articles | Metrics

To meet the demands of Multi-Radius Buffer Analysis and Road Intersection & Position, which are key issues in Spatial Decision Support System for Controlling the Outbreak and Spread of Animal Epidemics(SDSSCOSAE), two solution were suggested respectively: Using HashMap structure to store the results after multi-buffering processed, a set-difference operation among these results helped to obtain different area datasets we needed. In a view of visualization, a method of using cyclic regular polygon to simulate circle was adopted to separate different multi-radius buffering areas. Specially, an algorithm of Road Intersection and position was discussed. Both solutions were independent of special WebGIS platform. The practical application shows that such solutions mentioned above can be commonly used. Also the design and implementation of SDSSCOSAE were briefly introduced in this paper.