Table of Content

01 February 2009, Volume 29 Issue 2

Previous Issue    Next Issue

Network and communications

DrTrust: A trust model in unstructured P2P network

Yun-Chang ZHANG Jian-xin CHEN Shan-shan CHEN

2009, 29(2):  0. 

Asbtract ( )   PDF (592KB) ( )  

Related Articles | Metrics

The dynamics, autonomy and anonymity of the P2P network cause many security problems. The traditional trust model in structured P2P network can not satisfy the P2P environment commendably. In this paper, a trust model named DrTrust in unstructured P2P network was proposed, which was based on direct and recommended trust scheme. It takes advantage of the combination of the direct trust and recommended trust to calculate the trust accurately, using distributed way to store trust value and incentive and punishment mechanism to update trust value. The experimental results prove that DrTrust outperforms the current trust models in accurate trust computation and the inhibition to the malicious peers.

Information security

Improving WAPI protocol based on dual strategy

Yaling ZHANG

2009, 29(2):  347-349. 

Asbtract ( )   PDF (2KB) ( )  

Related Articles | Metrics

WAPI protocol serves as the infrastructure of wireless network authentication and privacy. Its secure authentication is the premise to ensure wireless network security. The theory of WAPI authentication protocol was discussed, and the security flaws existing in WAPI authentication, which made the protocol prone to be attacked by Middle Man was analyzed. Furthermore, an improving dual strategy based on identification and signature was proposed. A double queue receiving and sending certification model was introduced and its validity was proved under the cable network environment.

VPN identity certification technology based on fingerprint identification

Yu-jie Hao Yin-fu Feng Pan Lai

2009, 29(2):  350-352. 

Asbtract ( )   PDF (478KB) ( )  

Related Articles | Metrics

This paper analyzed and compared the advantages and disadvantages of the existing identity certification schemes for VPN connection, and pointed out the advantages of using fingerprint information for VPN identity certification. An identity certification scheme for VPN connection based on fingerprint identification was proposed. The paper also analyzed the security of the scheme, and introduced the application effect in the practical project. The scheme can prevent middle attack, tampering and falsifying information. It has forward-security, and is of better security than the existing schemes.

Cryptanalysis and improvement of a proxy signature scheme

2009, 29(2):  353-354. 

Asbtract ( )   PDF (465KB) ( )  

Related Articles | Metrics

The security of the Fu-Kou-Xiao’s proxy signature scheme with proxy signer’s privacy anonymity was analyzed, and it was shown that the scheme did not possess the property of strong unforgeability. A forgery attack was given. Using this attack, a dishonest original signer can forge a proxy signing key and produce valid proxy signatures. The reason why the attack can work was analyzed and an improved scheme was proposed to remove the attack.

An efficient self-certified public key signature from bilinear pairings

Xue-jun ZHANG

2009, 29(2):  355-356. 

Asbtract ( )   PDF (311KB) ( )  

Related Articles | Metrics

In self-certified public key signature scheme, the tasks of verifying the authenticity of public key and validating the signature were carried out simultaneously. The self-certified public key signature is more efficient than the existing certificate-based signature and identitybased signature in terms of communication overheads and computation efforts. There are only a few self-certified public key signatures of which the efficiency needs to be improved. In this paper, an efficient self-certified public key signature scheme was proposed by using bilinear pairings. The analysis shows the proposed scheme is secure. Furthermore, its efficiency is also better than that of the existing ones.

An improved scheme based on fragment marking scheme

2009, 29(2):  357-359. 

Asbtract ( )   PDF (557KB) ( )  

Related Articles | Metrics

Distributed denial-of-service(DDoS) attacks pose a grave threat to the security of Internet today. Since TCP/IP is a stateless protocol and it also has defect in design, it is quite difficult to determine the actual source of the attack. Based on the research of Fragment Marking Scheme, an improved scheme was presented, which extended the marking field. By adding a new group-ID field, a packet can be distinguished from different router groups. Fewer fragment combinations were required to verify if an edge was in the true attack graph; therefore, the convergence time reduces and the amount of false positive decreases.

Clustering algorithm of image emotional characteristics based on ant colony

Hai-Fang LI

2009, 29(2):  360-363. 

Asbtract ( )   PDF (688KB) ( )  

Related Articles | Metrics

With the development of image retrieval system, the effective organizing and managing of image database has been a key to users retrieving. This paper firstly made use of colony clustering algorithm in emotional clustering which based on image feature, and the original ant clustering algorithm was improved. This algorithm may identify which is the first ants by calculating the continental distance, simulate ants' actions of pickup or discarding, and according to the feature of domain color, image emotional cluster has been implemented. The result of experiment has indicated that the algorithm can get better clustering effect, and improve the retrieval efficiency.

An improved directed anonymous attestation scheme

Jie LI Zhen-Qiang Wu Lu YU Peng SUN Yao CHENG

2009, 29(2):  364-366. 

Asbtract ( )   PDF (630KB) ( )  

Related Articles | Metrics

The research and development of direct anonymous attestation (DAA) was introduced. In cognizance of the Rudolph attack caused by the leak of EK in the existing scheme, an improved direct anonymous attestation scheme was proposed. Compared with the original scheme, the improved one presented a new key exchange protocol, which implemented the twoway identity authentication between DAA Issuer and Prover. The authentication of the EK certificate and the process of issuing DAA certificate were separated from each other, so the potential attack mentioned above was avoided.The key exchange protocol in the improved scheme was analyzed by using the CK model, which showed that the protocol had reached the SK-security level. The improved scheme ensures the user controlled anonymity and the trusted third party will not be the bottle-neck of the scheme.

Identitybased fair multi-party exchange protocol

Meimei FAN Changgen PENG

2009, 29(2):  367-369. 

Asbtract ( )   PDF (484KB) ( )  

Related Articles | Metrics

Because of multiple parties, efficiency of multi-party exchange protocol is very important. An Identitybased verifiably encrypted signature scheme using bilinear pairings on ellipse curve was constructed, and a new fair multi-party exchange protocol was designed. The proposed protocol provides high efficiency, shorter length of signature, and meets the demands of fairness, timeliness, validity, optimality. It has important theoretical and application value.

Cloud method of multi-granularity network security situation analysis

2009, 29(2):  370-373. 

Asbtract ( )   PDF (723KB) ( )  

Related Articles | Metrics

This paper employs the uncertainty reasoning method in the Cloud Theory to solve the problem of network security perception. On the basis of the analysis of the existing models for security evaluation and their key technologies, the author proposed a situation awareness model using the knowledge base as well as the multi-granularity method. This model has three advantages over the conventional evaluation mechanisms: the dynamic updated knowledge base, multi-granularity method for security representation and visualization of the whole situation offers higher rate in accuracy and lower information redundancy. In addition, an extended cloud reasoning algorithm was designed and implemented to get both the qualitative and quantitative results of the monitored network and thus offers a more perceptible and scalable security situation. At last, experiments are done on the campus network of Wuhan University, and the results indicate that the feasibility and efficiency of our design.

Design and realization of spam filtering model based on CART algorithm

Xu congfu

2009, 29(2):  374-376. 

Asbtract ( )   PDF (506KB) ( )  

Related Articles | Metrics

The Classification and Regression Tree (CART) algorithm was introduced, and the application of the CART algorithm in spam filtering was discussed. Firstly, text messages of email samples were pre-processed, regular email and spam training sets were trained to establish the single classifier with the CART algorithm. Then a boosting based model which was combined with multiple CART classifiers was established. The comparison test results show that the multiple CART classifiers based on boosting has achieved better results.

Intelligence perception

Research of recognition on handwritten Chinese character based on procedure neural networks

Jian-ping Wang Tie-Jiang Jin Wei Shao

2009, 29(2):  377-380. 

Asbtract ( )   PDF (597KB) ( )  

Related Articles | Metrics

The topological property among stroke segments was analyzed. Image of handwritten Chinese character is transformed to geometric graphics, and the graphics was composed of some styles of Chinese character strokes with fault tolerance in different positions. Procedure neural network was applied to extract complex strokes of handwritten Chinese character. The style, number and number of joint and crossover of complex strokes were accumulated, and a kind of characteristic knowledge database table of handwritten Chinese characters was constructed. Handwritten Chinese character in SCUT-IRAC-HCCLIB were tested, and this method can simplify the recognition process, as well as has a high recognition rate.

Classifier fusion for speech emotion recognition based on improved queuing voting algorithm

Li-Qin Fu Xia Mao Li-Jiang Chen

2009, 29(2):  381-385. 

Asbtract ( )   PDF (818KB) ( )  

Related Articles | Metrics

According to the continuous space model for emotion, an improved queuing voting algorithm was proposed to implement the fusion of multiple emotion classifiers for a good emotion recognition result. Based on hidden Markov model (HMM) and artificial neural network (ANN), three kinds of classifier were designed. Then, the improved queuing voting algorithm was used to fuse them. Experimental study had been carried out by using Mandarin emotional speech database recoded and emotional speech database respectively. The results prove that the improved queuing voting algorithm can attain better fusion effect than conventional fusion algorithm and excel any single classifier evidently. The provided algorithm is not only easy to implement, but also transplantable. It is suitable for the fusion of any emotion classifiers.

Intelligent supervisory system based on gait recognition

王科俊 WANG Ke-Jun

2009, 29(2):  386-388. 

Asbtract ( )   PDF (474KB) ( )  

Related Articles | Metrics

In view of the existing video frequency monitoring technology only relies on the human eye for the examination and lacks intelligence, this article carried out research into the supervisory system based on the gait recognition intelligence. A novel gait representation was proposed. Body silhouette extraction was achieved by background subtraction. A gait cycle was obtained by the correlated signal of the ratio of width and height of human body. Gait energy image was applied on the binary image sequence to construct the feature vector. Then PCA or (2D)2PCA was used to reduce into a low dimension space. The nearestneighbor classifier was adopted to distinguish. This gait recognition method can decrease the influence of the early preprocess effectively; moreover, it makes very good recognition progress under the three visual angles of our gait database in which the camera is put with certain angle of depression.

Using mixed window function and subband spectrum centroid in MFCC feature extraction process

Huan Zhao Lin Zhang

2009, 29(2):  389-391. 

Asbtract ( )   PDF (436KB) ( )  

Related Articles | Metrics

In order to improve the quality of speech in low SNR, two methods were proposed to improve the robustness of the system in this paper based on the traditional MFCC feature extraction. One is to use the side lobe suppression of mixed window function to improve the robustness of system; the other is to incorporate subband amplitude information with Mel-subband spectrum centroid(MSSC) because spectral peak position remains practically unaffected in the presence of background noise. Experimental results show that mixed window function and MSSC and their combination system could improve the robustness of system compared to the benchmark system based on traditional MFCC in the low SNR of stationary noises.

Study on audio classification based on 1-state HMM

Ji-Ming Zheng

2009, 29(2):  392-394. 

Asbtract ( )   PDF (498KB) ( )  

Related Articles | Metrics

Hidden markov model (HMM),based on statistical signal, plays an important role in content-based audio retrieval system. According to the characteristic that pays more attention to the type than to content of audio classification, 1-state HMM was used for audio classification, which overcame the shortcoming of assumption of multi-state HMM model's initial state probabilities and state transition probabilities in the course of model-initializing. The experiment shows the method for audio classification based on 1-state HMM could decrease the misrecognition effectively and increase the accuracy of audio classification.

Handwritten Chinese character recognition based on double elastic mesh

2009, 29(2):  395-397. 

Asbtract ( )   PDF (440KB) ( )  

Related Articles | Metrics

Abstract: Feature extraction is the key part of handwritten Chinese character recognition. It is found that the directional feature digged by elastic mesh is suitable for Chinese character recognition. In view of the usual vertical-horizontal elastic mesh’s shortage in left falling stroke and right falling stroke, we present a new elastic mesh structure method—diagonal elastic mesh, which is composed of diagonal beelines of and , and divides the Chinese character image into many diamonds. This paper takes the two kinds of mesh and their combinations into the handwritten recognition experiment. The experimental results have confirmed the diagonal elastic mesh’s validity and that the double elastic mesh has very high recognition rate.

Database Technology

Design and implementation of geometric knowledge base

Dong-Ming WANG Ying HUANG Xiao-Yu CHEN

2009, 29(2):  398-402. 

Asbtract ( )   PDF (967KB) ( )  

Related Articles | Metrics

The design of a geometric knowledge base that stores standardized and formalized geometric knowledge data was presented. Emphasis was placed on the design of the structure rather than the representation of the knowledge data. In order to manage the complexity, authors adopted a key strategy that aimed at encapsulating certain knowledge data into knowledge objects by analyzing the data requirements and then organizing the knowledge objects by modeling and abstracting the hierarchic structure of relations among them, and discussed the implementation of a preliminary version of the geometric knowledge base system that realized the proposed structure and the design of a webbased user interface.

New algorithm based on repeat sequence deletion

bo yin hua jiang

2009, 29(2):  403-405. 

Asbtract ( )   PDF (441KB) ( )  

Related Articles | Metrics

Aiming at the current de-duplication algorithms, two repeated sequences (RS)extracting algorithms were compared and analyzed. Since STC has favorable performance in considering time cost and the inverted index method is superior in terms of spatial complexity, STC was used to improve RS algorithm. Experiment results show that this method can find similar Web pages efficiently. This algorithm can reach a high precision in mono-language deletion of duplicated Web pages, and this algorithm can also reach a maximum precision when it is applied to deletion of duplicated web pages.

Clustering Arithmetic with Obstacle Constraints

Le WANG Xiao QingBao LIU ChangHui LU WenKai CHEN

2009, 29(2):  406-408. 

Asbtract ( )   PDF (661KB) ( )  

Related Articles | Metrics

According to the characteristics of clustering with obstacle constraints, using the knowledge of graph theory, a multi-step Arithmetic was proposed. Firstly, it clustered the objects without obstacles by minimum spanning tree clustering method. Then it took obstacles to divide the generated clusters. Lastly it merged the clusters whose obstruct distance was little enough. The algorithm need only one parameter, it is of good performance and can find clusters with arbitrary shapes and varying densities. At last its effectiveness was demonstrated through experiment.

An improved model of Snort system based on data mining

Yaling ZHANG

2009, 29(2):  409-411. 

Asbtract ( )   PDF (506KB) ( )  

Related Articles | Metrics

An improved model of the Snort network intrusion detection system based on the theory of data mining was proposed, regarding the problem that Snort is powerless to new types of intrusion. In the new model, normal behavior patterns mining module, anomaly detection engine module and new rules generating module were added to the Snort system. By these improvements the system has double capacity of learning rules from new intrusions and learning normal behavior patterns from normal data. The test result shows that new types of intrusion can be detected effectively, the false negative of Snort can be reduced, and the detection efficiency of the system has been enhanced.

Research on multi-agent model based on track methodology of ontology building

CHEN Ming CHEN

2009, 29(2):  412-415. 

Asbtract ( )   PDF (603KB) ( )  

Related Articles | Metrics

Ontology engineering provides appropriate ontology developing methods which can instruct the ontology building. The Track Methodology Model of Ontology Building (TMMOB) can support the different means of ontology building according to the characteristic of ontology in different knowledge system, and can evaluate the process of ontology developing. In order to improve the efficiency of ontology building, a multi-agent model for the TMMOB was created by using autonomy, collaboration and distribution of multi-agent. In the model, different agents, collaboration and communication between agents were defined and formalized. At the same time, the algorithms about operation and collaboration in agents, and the platform of the multi-agent running were implemented.

Document classification algorithm based on KDA and SVM

2009, 29(2):  416-418. 

Asbtract ( )   PDF (446KB) ( )  

Related Articles | Metrics

To efficiently solve Web document classification problem, a novel document classification algorithm based on kernel discriminant analysis (KDA) and SVM was proposed. The proposed algorithm firstly reduced the high dimensional Web document space in the training sets to the lower dimensional space with KDA algorithm, then the classification and predication in the lower dimensional feature space were implemented with the multiplicative updatebased optimal SVM. The experimental evaluations were performed on the Reuters-21578 and 20-Newsgroup which are two well-known data sets in the field of document classification. Experimental results show that the proposed algorithm not only achieves higher classification accuracy, but also has lower running time.

Dissimilar attribute reductions based on hierarchical clustering method

TANG ZhouWen YE DongYi

2009, 29(2):  419-420. 

Asbtract ( )   PDF (467KB) ( )  

Related Articles | Metrics

Attribute reduction is an important concept in rough set data analysis. An algorithm for dissimilar reductions finding was presented. Method of bottomup agglomerative hierarchical clustering was used to get k partitions of conditional attributes set, and then these k attribute sets were dealt with by postprocessing and get k dissimilar attribute reductions. Result of experiments show that our method is effective.

Analysis and optimization for RAID small data random access

Li-Fang WANG Zhi-Qiang LIU

2009, 29(2):  421-423. 

Asbtract ( )   PDF (436KB) ( )  

Related Articles | Metrics

In order to make multiple disks accessible parallelly, the stripe layout is adopted by RAID for high-bandwidth. The approach is appropriate for big sequential data access, but is not that effective for small data random access. This paper analyzed the I/O performance based on RAID Stripe size, explored the IOPS（IOs per second）of multiple user small data access, and proposed a new stripe layout architecture—Thick Granularity Model. The simulation indicates: the I/O performance of Thick Granularity Model has been improved，especially in small data random access.

An improved algorithm of Levenshtein Distance and the application to data processing

2009, 29(2):  424-426. 

Asbtract ( )   PDF (461KB) ( )  

Related Articles | Metrics

Based on the requirement of data processing, after analyzing the existing algorithm of Levenshtein Distance, the number of edit operation was decreased by extending the transposition operation. Compared to the existing the algorithm that can only transpose adjacent symbols before the position of being computed, improving the algorithm by transposing isolated symbols before the position of being computed as well as at after the position of being computed, can gain better edit distance. By applying the improved algorithm to the processing of the hidden trouble data of coal mine, both the validity and efficiency of classifying and grading the hidden trouble data were improved.

Graphics and image processing

A weighted robust estimating algorithm with high accuracy

Yan Dan Yan

2009, 29(2):  427-428. 

Asbtract ( )   PDF (506KB) ( )  

Related Articles | Metrics

In this paper, a cost function related to residual errors was introduced, and a weighted robust algorithm was presented. Firstly, the geometric transform matrix from the original data was calculated. Weight could be gained from the gray information around the key points. In the process of fitting the model of matrix, the optimal registration relation of the two pictures was found. Experimental results are of better satisfaction, better robustness and stronger sense of reality. It is highly valuable in practice.

Single view modeling of symmetric curved surfaces and texture extraction

Ji-Guo Zeng

2009, 29(2):  429-432. 

Asbtract ( )   PDF (647KB) ( )  

Related Articles | Metrics

An entire demonstration on that the horizontally flipped image of a reflective symmetric object was equivalent to an image photographed from another position was given. The parallel structure was used on calibrating the camera first. Then the feature points were matched between the original image and the horizontally flipped image. Traditional structure from motion techniques can be used on recovering these points. With the constraints of these feature points, perspective projection, coplanarity and colinearity, the curved surfaces can be recovered by minimizing the linearly constrained quadric objective function. Finally, the pixels of the recovered texture were obtained as a barycentric combination of the colors of the near four pixels. The effectiveness of this method was verified by experiments.

Simple 3D reconstruction method from single 2D image of object

Lin-Li SUN

2009, 29(2):  433-435. 

Asbtract ( )   PDF (527KB) ( )  

Related Articles | Metrics

The single 2D image is taken as the research object and this paper applied the basic theory of SFS, firstly estimated the tilt and the slant of illumination, calculated every point of the surface gradient of the object in illumination coordinate,secondly rotated the coordinate system, getting the every point of the surface gradient of the object in observing coordinate, finally used three point Simpson formula, getting the height of the object. The entire process is simple and clear and the results of simulation showed the efficiency of the new approach.

A novel weak chirp typed blind watermarking detection algorithm based on wavelet and duffing oscillators

2009, 29(2):  436-439. 

Asbtract ( )   PDF (644KB) ( )  

Related Articles | Metrics

To enhance the robustness of the Chirp typed watermark, propose an algorithm based on Duffing Oscillators. First we change the Chirp signal which was embedded into the low frequency band of the host image in the wavelet domain into single frequency periodic signal, then we detect the periodic signal by the Duffing oscillators. The model of deterministic signal detection with unknown parameters is utilized to formulate the watermark detection. Experiments show that the detector perform effectively when the signaltonoise ratio is greater than -40dB.

Lane detection algorithm based on morphological structure-elements model

Tao Lei

2009, 29(2):  440-443. 

Asbtract ( )   PDF (646KB) ( )  

Related Articles | Metrics

This lane detection algorithm based on structure-elements model of morphological simplified the complex processes of lane detection and improved robustness in intelligent vehicle vision assisted. In the algorithm, original image was filtered by alter sequence filter and special objects were extracted by the structure elements, which had similar characteristics to that of lane model. After that, the outside line of left and right lane was removed by a given means of estimation outside line. Finally, the resulted image was amalgamated and the lane mask was detected by means of Hough transformation. The experiments show that this algorithm is simple, of better robustness, and at the same time, it can efficiently detect the lane mask accurately.

Audio watermarking scheme based on DWT and mean quantization

fei wang

2009, 29(2):  444-446. 

Asbtract ( )   PDF (427KB) ( )  

Related Articles | Metrics

This paper presented a blind digital audio watermarking scheme based on wavelet packet and mean quantization. The features of proposed scheme are as follows: 1) Audio signals were decomposed into many segments according to the size of the image watermarking. The image watermarking was preprocessed using Arnold transformation to have a strong robustness to some attack. 2) Discrete wavelet transform (DWT) was used to improve the transparency of digital watermarking. 3) The image watermarking was embedded into the mean of low frequency components by quantization. Experimental result shows that this scheme is inaudible and against some attack such as compression and low pass filter effectively.

Stereo matching algorithm based on LBP/C texture analysis

Liang Ge Qing-sheng Zhu Si-si Fu

2009, 29(2):  447-449. 

Asbtract ( )   PDF (507KB) ( )  

Related Articles | Metrics

Due to the difficulty of getting disparity of less textured pixels with traditional approach, block matching algorithm with texture analysis was put forward. First, the images were described by LBP/C texture analysis. Then the expansion detection based on region growing was performed, and the less textured blocks were acquired. Finally the dense disparity map of less textured area was obtained through block matching. The proposed algorithm was tested with the international standard image data and compared with some existing algorithms. The experimental results show that the proposed algorithm can improve the accuracy of disparity when handling less textured areas and can be used in practice.

Three dimensional surfaces reconstruction based on shape of the contours of the adjacent layers

An SU Shu-yang RAN Zhang Li Huang Liang

2009, 29(2):  450-452. 

Asbtract ( )   PDF (400KB) ( )  

Related Articles | Metrics

Conventional algorithm of three dimensional surfaces reconstruction is not very effective when the contours are complex. The paper proposed a new algorithm based on matching shape of adjacent contours: first, got the keypoints of shape contours, and then matched the key-points according to shape of the neighboring layers, connected the key-points, got several independent parts, at last, reconstructed the segments respectively. The experiment proves that the algorithm is effective despite the contours are convex changeable and very complex.

Trademark image retrieval based on curvature and entrop-matrix feature

2009, 29(2):  453-455. 

Asbtract ( )   PDF (429KB) ( )  

Related Articles | Metrics

An image retrieval method based on curvature feature and entropymatrix feature for binary trademark images was proposed. First, according to the definition of curvature in Differential Geometry, every curvature of the fringe point was computed, and curvaturehistogram was obtained as boundary feature. Second, the image was parted into several blocks, and then entropy for every block was counted. The entropymatrix consisted of these entropy of every block. Last, images were retrieved by the two features. Experimental result shows that using the feature of boundary and region is better than using the single one, and it has better anti-geometric distortion effect.

Hand-drawn shape recognition based on K-segment algorithm for principal curves

Helen Tu

2009, 29(2):  456-458. 

Asbtract ( )   PDF (470KB) ( )  

Related Articles | Metrics

A hand-drawn shape recognition algorithm based on improved K-segment principal curve was presented. The algorithm was to generate a curve passing through the "middle" of the distribution．Recognition was based on the average distance from the sample points to the projected points on the generated principal curve. Experimental results show that the algorithm is feasible for handdrawn shape recognition and exhibits good results.

Incremental delaunay algorithm based on signed volume

2009, 29(2):  459-461. 

Asbtract ( )   PDF (588KB) ( )  

Related Articles | Metrics

Traditional incremental algorithm for Delaunay needs to locate inserted point globally, or to calculate facet's normal vector; therefore, it is less efficient. This paper presented an incremental insertion algorithm for Delaunay Triangulation based on signed volume. It designed the data structure briefly, and determined the direction of new inserted point by the sign of signed volume of tetrahedral, then searched the center tetrahedral including the new inserted point in its interior, completing point location locally. Furthermore, it applied the sign of signed volume of tetrahedral to the visibility test of facets. For degenerative situation, the perturbation to point set's coordinates was executed to enhance the robustness. Experiment shows that the incremental algorithm for Delaunay Triangulation based on signed volume works more efficiently and needs less computation than traditional algorithm.

Laplace watershed segmentation based on minimum energy

Hui-Jun FENG ZHAO Xiang-Hui

2009, 29(2):  462-464. 

Asbtract ( )   PDF (462KB) ( )  

Related Articles | Metrics

Because laplace watershed segmentation on image edge is not very effective. Based on the energy regional concentration theory, the authors defined a function to measure area differences. When the difference between two regions is greater than any one of them, this is a border lie between the two regions; otherwise they belong to the same region, they should merge into one. Through the experiment under vs2008, the authors split butterfly specimens into four parts, marked different regions by using different colors. Experiment demonstrates the method has good effect, and also less time-consuming.

A new color difference formula in RGB color space

Yong WANG ZhenDong Yang ChengDao Wang

2009, 29(2):  465-467. 

Asbtract ( )   PDF (456KB) ( )  

Related Articles | Metrics

Based on the study of RGB (red-green-blue) color space and the comparison and analysis of several color difference formulas in RGB color space, this paper summarized three rules of color difference in RGB color space and proposed the conception of the importance of the color component. A new color difference formula in RGB color space was achieved by dynamically adjusting the vector distance and angular between a pair of RGB colors. The dynamic coefficient was weighted by the importance of color component. Color quantization experiment of highly complex color images demonstrates that this new color difference formula's performance is better than those widely used color difference formulas in RGB color space.

Scale extraction and pixel measurement in foot marker image

2009, 29(2):  468-469. 

Asbtract ( )   PDF (496KB) ( )  

Related Articles | Metrics

In order to measure the displacement of the foot joints under different press and further study their movement trait, the displacement of each marker in the foot marker images needs to be calculated. The black markers and rectangular region in the experiment images are the probes and scale. In this paper, scale extraction and the automatic pixel measurement of a foot marker image were realized. First, the authors extracted the border of scale according to the linear least squares method and computed the pixel distance between the two endpoints at the bottom of the scale, then calculated the actual length that each pixel represented and realized the automatic conversion between pixel distance and the length of the scale, which provided service for diagnosis and treatment of the foot diseases.

A real time method of rendering fake soft shadows based on shadow map

2009, 29(2):  470-473. 

Asbtract ( )   PDF (649KB) ( )  

Related Articles | Metrics

As hard shadows grow unsuitable for reality shading, soft shadows have become popular. But soft shadows need more time to sample the density of the area light source. To save the cost and not influence the sense of reality, this article introduced a method to render fake soft shadow. First, it gave a new method to construct the smooth edges for the penumbra texture, and talked about how to create soft shadows with these smooth edges. The results prove the correctness and real-time of soft shadow.

The best image scrambling degree of binary image based on Arnold transform

Liang-Yong HUANG

2009, 29(2):  474-476. 

Asbtract ( )   PDF (645KB) ( )  

Related Articles | Metrics

In the context of digital watermark technology, this paper introduced binary image based Arnold transform and periodicity, and discussed the calculation methods of image scrambling degree in detail so that it elaborated the best formula of image scrambling degree with the combination of pixel value variance as well as pixels and 4 differ of the gray-level. The results show that the calculating method of the best image scrambling degree can well reveal the consistency of binary image scrambling degree and subjective visual effects.

Novel adaptive image impulse-noise filter based on svc and wavelet-transform

2009, 29(2):  477-479. 

Asbtract ( )   PDF (535KB) ( )  

Related Articles | Metrics

An improved method for impulse noise detection was proposed, which, in terms of the principle that wavelet transform can detect signal singular point, improved the SVC impulse noise detection method using the wavelet transform impulse noise detection method. The experimental results show that the improved SVC impulse noise filter’s filtering effects are significantly improved compared with the original SVC impulse noise filters.

Network and communications

Twice-weighted centroid localization algorithm based on distance geometry constraints

2009, 29(2):  480-483. 

Asbtract ( )   PDF (557KB) ( )  

Related Articles | Metrics

Taking Cayley-Menger determinant in the two-dimension real space as the distance geometry constraints, combined with the weighted centroid computing, a twice-weighted centroid localization algorithm based on distance geometry constraints (DGC-TWCL) was presented in this paper. C-M determinant was utilized to get the optimization results of distance measurements errors so that inaccurate distances among nodes were corrected to some extent. Twice-weighted centroid computation by weighted factors reflects that different anchor nodes have respective influence degrees in the process of determining the localization coordinates. The experimental results indicate that DGC-TWCL has better localization precision, algorithm scalability and robustness.

A distributed application layer multicast model based on central ring carousel

Jian-zhen XU Xu Qiang

2009, 29(2):  484-486. 

Asbtract ( )   PDF (467KB) ( )  

Related Articles | Metrics

A distributed application layer multicast model based on Central Ring Carousel algorithm was proposed. The model employed ring as the basic topology unit, constructed carousel on each central node, and built its upper rings topology according to each node's priority. The simulation results indicate that CRCL can improve the performance of streaming media application efficiently, especially in data transmission, convergence time and average path length.

Combining scheduling and congestion control for fair resource allocation in WLAN

YU Li Yan-Tai SHU

2009, 29(2):  487-490. 

Asbtract ( )   PDF (643KB) ( )  

Related Articles | Metrics

In this paper, focusing the attention mainly on the downlink traffic, the authors presented a scheduler based on queue length at base station and a congestion control scheme based on the wireless channel. The scheduler scheduled flows proportionally to their backlogged queue length, meanwhile made its best effort to flows with the QoS requirement. Flows that have a higher arrival rate were more probable to be chosen, which lead to a fair resource allocation of the total bandwidth. The authors used the link utilization as the congestion indicator and fed it back to the sender to adjust the sending rate, hence realized congestion control. The link utilization was computed by the channel busy time at a predefined time period. The simulation results verify our analysis that our scheduler and congestion control scheme allocate the resource at a considerable fairness degree.

Grid resource schedule optimizing based on buffer and preelection

Man-fu MA Fu-hai DUAN Zhi-yi HUANG Wei-guo ZHANG

2009, 29(2):  491-493. 

Asbtract ( )   PDF (499KB) ( )  

Related Articles | Metrics

Resource discovery is the key for scheduling efficiency in Grid. In this paper the authors presented a new Grid resource broker architecture which optimized the discovery process. By the architecture, the history scheduling records were stored and new resources information was preelected to local node as QoS Parameters and the local records had high priority in resource discovery. As the requirement, the authors proposed the Broker architecture, analyzed refresh periods and management of buffer and preelected records. At last, the optimization scheduling algorithm was described based on the local priority. Finally simulations were performed to compare the performance of optimization scheduling algorithm with that of the None Minimisation . The experiments show that the optimization scheduling algorithm is efficient on task completion time and throughput within Grid environments.

Research on node localization based on particle swarm optimization for WSNs

Xiao-Le Wang Jiapin Xu

2009, 29(2):  494-495. 

Asbtract ( )   PDF (439KB) ( )  

Related Articles | Metrics

In order to improve the localization accuracy, a new localization algorithm was proposed based on particle swarm optimization for wireless sensor networks. The new algorithm is easy to achieve and has a few parameters to adjust. Through multiple iterative optimization, it can improve the localization accuracy. The experimental results show that the localization accuracy and stability of the new algorithm are significantly superior to that of the maximum likelihood estimation algorithm.

Improved ZiCL algorithm based on ZigBee network

2009, 29(2):  496-499. 

Asbtract ( )   PDF (613KB) ( )  

Related Articles | Metrics

ZiCL algorithm may cause excess energy consumption of nodes and unbalanced energy consumption of the whole network in ZigBee network,therefore an improved algorithm was put forward. The improved algorithm adjusted routing-select strategy dynamically according to the energy state of cluster members. The simulation indicates that the improved algorithm can improve the transport reliability and save energy effectively.

An algorithm of packet classification based on binary search on levels

2009, 29(2):  500-502. 

Asbtract ( )   PDF (570KB) ( )  

Related Articles | Metrics

Binary Search On Levels (BSOL) is a fast algorithm for packet classification, which can be easily extended to multimention packet classification. For its core framework is hash Table which belongs to every layer of Trie Tree, the performance of BSOL will get lower when load factor of hash Table is big or hash collision is frequent. This paper presented a new algorithm using bloom filters. The new algorithm still performed well even the hash collision was frequent. Analyzing the experimental data from a virtual environment，the authors conclude that the new algorithm performs better when hit ratio of packets is lower than 90% while load factor is big.

A new multicast routing protocol with QoS constraints

Qian GAO

2009, 29(2):  507-510. 

Asbtract ( )   PDF (681KB) ( )  

Related Articles | Metrics

A QoS multicast routing algorithm for DiffServ networks called PQMRD(Per-class QoS Multicast Routing in DiffServ networks) was proposed. It used different routing strategy to select route in terms of different QoS requirement; in addition, admission control and resource reservation were performed while selecting route. It is proved by the simulation result that inter-class unfairness problem is alleviated.

Design of a novel modular Network-on-Chip router

2009, 29(2):  511-513. 

Asbtract ( )   PDF (548KB) ( )  

Related Articles | Metrics

As a complex system-on-chip solution， NetworkonChip has become a recent research focus. The performance of the interconnection network mostly depends on the fabric of network routers. A kind of modular wormhole-switched router architecture was presented in this paper considering latency, throughput and fault-tolerance and so on. Compared with the existing designs, the proposed architecture which employs pathsets and uses smaller crossbars reduces the output port contention probabilities deeply. And the architecture itself has a certain degree functionality of fault tolerance.

Chord routing algorithm based on limited multicasting

Duan Shi-hui Jin-lin Wang

2009, 29(2):  514-517. 

Asbtract ( )   PDF (625KB) ( )  

Related Articles | Metrics

Chord is a successful routing algorithm, but the inconsistence between logistic routing and physical routing leads to very big network delay if the node routing only rely on logistic distance and this will seriously effect the routing efficiency. A Chord routing algorithm based on limited network layer multicasting is proposed, which uses multicast technology to obtain physical neighbor nodes and improves on Chord original routing algorithm. It can shorten network search delay greatly, reduce routing hops effectively and improve the performance of routing.

Cross layer link adaptation scheme in wireless local area network

HUANG Jing-Lian

2009, 29(2):  518-520. 

Asbtract ( )   PDF (539KB) ( )  

Related Articles | Metrics

To overcome the defect that IEEE 802.11 Wireless Local Area Network (WLAN) does not provide link adaptation scheme, a joint Medium Access Control (MAC) layer and physical (PHY) layer cross layer link adaptation scheme (CLLA) is proposed. The proposed CLLA scheme, which takes channel interference into consideration and distinguishes collision lose and interference lose, provides mathematical description of PHY layer and MAC layer respectively. CLLA also deduces the relationship of two layers in term of throughput. CLLA selects rate adaptively to improve throughput. Simulation results and comparisons with existed schemes prove that the proposed CLLA scheme not only adapts interference and channel variation, but also improves system throughput obviously.

Multi-path routing optimization for wireless sensor networks based on genetic algorithm

Jiao-Liang ZHOU Cai-Xia LI Qi-Ying CAO

2009, 29(2):  521-524. 

Asbtract ( )   PDF (628KB) ( )  

Related Articles | Metrics

The radio transceiver typically consumes most energy, so the design of energy efficient routing protocols is of great importance. This paper firstly analyzed the topology of wireless sensor networks (WSNs) and constructed a routing model for WSNs, and then integrated the basic principle of genetic algorithm into the model, proposed an algorithm to solve the multipath routing optimization problem. The presented algorithm adopted variable-length chromosomes to encode the problem, applied selection, crossover and mutation, made full use of the information and function of the base station, and implemented the global optimization for the multi-path routing in WSNs. Simulation results show that the global optimization can effectively prolong network lifetime and improve the network performance for WSNs.

Artificial intelligence

ABC supporting QoS unicast routing scheme with particle swarm optimization

Xing-Wei WANG

2009, 29(2):  525-528. 

Asbtract ( )   PDF (705KB) ( )  

Related Articles | Metrics

A QoS unicast routing scheme with ABC supported was proposed. The interval was used to describe the uncertain users' QoS requirement and inaccurate edge (link) parameter. With the user satisfaction degree, edge evaluation and elitist solution set introduced, a QoS unicast path was searched by particle swarm optimization algorithm and gaming analysis, achieving or approaching Pareto optimal solution under Nash equilibrium on both the network provider utility and the user utility along the found path. Simulation results show that the proposed scheme is both feasible and effective.

Consistent varying-weight fuzzy Petri net attack model based on both-branch fuzzy set

Guang-qiu HUANG Jin-cheng WANG

2009, 29(2):  529-534. 

Asbtract ( )   PDF (898KB) ( )  

Related Articles | Metrics

Based on Petri net, a new consistent bothbranch varyingweight fuzzy Petri attack net (CBBVFPN) was defined using both-branch fuzzy set theory, and a formal reasoning algorithm for the CBBVFPN model was presented according to the characteristics of CBBVFPN model. The model makes up for some common limitations in previous attack models based on Petri net, and two basic structures about "AND" and "OR" of Petri net were expanded. In reasoning process, in order to avoid continuing to reason by taking a proposition with very low truth degree as a precondition, and then a post proposition with lower truth degree was got, a rule evolvement and varying-weight method was presented. The reasoning algorithm described positive and negative propositions in a unified way, and added the controlling conditions in the algorithm to ensure the consistency of reasoning processes and reasoning results. Finally, a Botnet attack was used to verify the reasoning algorithm.

Feedback scheduling of computing resources based on support vector machines

Kun XU

2009, 29(2):  535-538. 

Asbtract ( )   PDF (744KB) ( )  

Related Articles | Metrics

The computing resource is generally resources-limited in the real-time control systems (RTCS). Due to the uncertain running conditions and dynamic fluctuation of workload, the system always runs in an unexpected open environment. A feedback scheduling technique of computing resources based on support vector machines (SVM) was designed in order to ensure the system's stable running. The feedback scheduler of the system, which monitored the system's computing resources periodically, predicted a next sampling period for each control task by using SVM mechanism. Consequently, the computing resources of the system can be dynamically allocated online. The simulation of results highlights that the proposed scheduling technique is more effective in comparison with ideal case and traditional open-loop scheduling techniques.

Information system based on dominance relations and formal concept analysis

WANG Jun-Hong Ji-Ye LIANG Kai-She QU

2009, 29(2):  539-541. 

Asbtract ( )   PDF (412KB) ( )  

Related Articles | Metrics

The implication of formal concept analysis in the information system based on dominance relations was discussed. The object granular in the formal context extract formed the information system based on dominance relations and the dominance class, and the consistent set of object granular and the consistent set of dominance class were proved to be equivalent.

Attraction-repulsion mechanism-based particle swarm optimization algorithm

Peng-Jun ZHAO San-Yang LIU Chao LI

2009, 29(2):  542-544. 

Asbtract ( )   PDF (559KB) ( )  

Related Articles | Metrics

Standard Particle Swarm Optimization (PSO) algorithm falls into local optima easily and has low convergence accuracy when it is used to address the problem of complex functions optimization. In order to overcome the shortcomings, an improved PSO algorithm was proposed. The proposed algorithm integrated the attractionrepulsion mechanism in the field of biology into PSO algorithm and took full advantage of the mutual influence between particles to modify velocity updating formula, and thus maintained population diversity and enhanced the ability of particle to escape from the local optima. The experimental results demonstrate that the proposed algorithm outperforms two existing variants of the PSO algorithm in terms of convergence accuracy while improving the velocity of convergence in the later evolution phase and avoiding premature convergence problem effectively.

Query expansion model based on concept graph information retrieval

Rui Chen Lei Zhang

2009, 29(2):  545-548. 

Asbtract ( )   PDF (706KB) ( )  

Related Articles | Metrics

One query expansion method, which was based on concept graph, was proposed to solve the low recall and precision rates in the traditional information retrieval methods based on matching keywords. On one hand, words and phrases, which are retrieved by users, can be expanded based on HowNet .Meanwhile, user queries and documents will be transformed into concept graphs. On the other hand, partial matching and semantic similarity based on concept graphs is adopted to acquire similarity between concept graphs, which will optimize the whole retrieval process. This method is proved to be more effective by experiment.

New chaotic Elman neural network and its application

Ling YANG Jun SONG Qiang JIN

2009, 29(2):  549-553. 

Asbtract ( )   PDF (690KB) ( )  

Related Articles | Metrics

An improved Elman neural network, the HF Elman network was presented for the modeling of unknown delay and highorder nonlinear system. The stability of the improved Elman network was proved in light of Lyapunov stability theory, and chaos searching was imported to train it, the defect of local extreme of Elman network was eliminated and the learning performance of the new network was improved effectively using global moving characteristic of chaotic mechanism. Simulation results show that the new network and the strategy can improve the network's training speed and the forecast accuracy of ethylene quality index effectively.

A genetic algorithm based on double linear-linked-list encoding

2009, 29(2):  554-557. 

Asbtract ( )   PDF (525KB) ( )  

Related Articles | Metrics

Regarding the fault of the Genetic Algorithm based on classical encoding, which is to resolve the large-scale parallel machines batchscheduling problem, this text proposed a method DLGA, including a Double Linear-linked-list encoding and the relevant genetic operators. This method was testified by simulating to resolve the scheduling problem of vulcanizing missions in certain tyre factory. The simulation result indicates that the indexes of scheduling performance and the feasibility of application are improved by this algorithm.

Text clustering based on genetic fuzzy C-means algorithm

2009, 29(2):  558-560. 

Asbtract ( )   PDF (601KB) ( )  

Related Articles | Metrics

A text clustering method based on genetic fuzzy c-means algorithm was proposed. At first, latent semantic index was used to reduce the dimension of text feature and then the number of text class was obtained through analyzing the validity of clustering. At last, genetic FCM algorithm was used to cluster the text. The proposed method overcomes the flaw of FCM algorithm which may converge to local optimum, and it resolves the problem of FCM algorithm which is sensitive to the initialized value of cluster center. The experimental results show that the proposed method has better clustering effect.

Space self-adaptive immune clonal selection optimization algorithm

Zheng Tang Min Hu

2009, 29(2):  561-564. 

Asbtract ( )   PDF (562KB) ( )  

Related Articles | Metrics

To improve the convergence speed in standard immune clonal selection algorithm (AIS), a new space self-adaptive immune clonal selection optimization algorithm (SAIS) is presented by introducing the thoughts of space contraction & expansion. The algorithm uses distribute characters of solution in non-complete evolution process to contract searching space, so as to accelerate convergence speed; meanwhile it jumps away from the local optimum by expanding searching space. Four high dimension Benchmark optimization-testing functions were used to study performance of the new optimization algorithm. By Comparison of standard AIS and SAIS, the new algorithm can enhance convergence speed and improve optimization quantity effectively.

Pattern recognition and Software

Research on one-to-many negotiation model with two phases type based on Agent

2009, 29(2):  565-567. 

Asbtract ( )   PDF (632KB) ( )  

Related Articles | Metrics

This paper proposed a one-to-many negotiation model with two-phase type. In contrast to the multiple concurrent bi-lateral negotiation, one-to-many negotiation model with twophase type can improve the performance of onetomany negotiation so that adopting two phases will promote the competition among sellers and strengthen the dominant status of buyer, which not only makes the buyer get more chances to attain a better price but also avoid that the sellers lose their opportunities because of the strategies with lower competitive power. The model put forward the concept of temporary acceptable price which was equal to the lowest price of the last round in the first phase or the each round in the second phase of the negotiation. And the sellers-price in the next round would be calculated based on the temporary acceptable price, then the price of next round would be brought down by using the last round price and the strong competition among sellers would be brought out at last.

Typical applications

Research of tissue deformation in virtual surgery simulation

Xiu-fen YE Bing QIAO Qing-chang GUO

2009, 29(2):  568-573. 

Asbtract ( )   PDF (931KB) ( )  

Related Articles | Metrics

This paper studied the tissue deformation of Virtual Surgery Simulation, using OpenGL to establish the virtual tissue deformation system based on mass-spring model. Discussion was around the fidelity and real-time of tissue deformation in Virtual Surgery Simulation. By comparing quadrilateral topologies, regular hexagon topology based on mass-spring model was proposed, the dynamic model was discussed as well as its numerical integration method and force feedback calculation model of tissue deformation. Concerning the lack of nearest neighbor mass calculating algorithm in virtual surgical instrument contacting the tissue surface, a new method was proposed. The results show that the modified algorithms have better stability and real-time in tissue deformation simulation.

Fault diagnosis method based on Ontology

qiang xie

2009, 29(2):  574-576. 

Asbtract ( )   PDF (576KB) ( )  

Related Articles | Metrics

The fault diagnosis is one of the main contents of quality service, so the fault diagnosis method always has been the domain research hot spot in quality service. After anglicizing the questions of traditional fault diagnosis method, fault diagnosis method based on the Ontology was proposed. Fault diagnosis process based on the Ontology was elaborated, and then the fault knowledge expression and the fault diagnosis algorithm based on the Ontology were put forward. Through analyzing the algorithm effect, the validity of fault diagnosis method based on the Ontology is precipitated.

Device driver development of high speed data capture based on PCI bus

Zhi-Zhong FU Hai-Ying XIAN You-Lin CHEN

2009, 29(2):  577-579. 

Asbtract ( )   PDF (416KB) ( )  

Related Articles | Metrics

The device driver must have quick response and flexible data structure for the device driver development of high speed data capture based on PCI bus. A multi-slot and multi-frame data structure was presented in this paper after the bottleneck of high speed data capture was analyzed, and a guideline to the design of the device driver was also presented. The data capture speed can be 85MB per second and it is independent of the computers' configuration.

B2C e-commerce logistic distribution routing model and algorithm

Duan Feng-hua 段凤华

2009, 29(2):  580-582. 

Asbtract ( )   PDF (630KB) ( )  

Related Articles | Metrics

A taboo search algorithm was proposed for the basic logistic distribution route model in B2C e-commerce. The results of test and comparison show that the proposed taboo search algorithm is better than the memorial genetic simulated annealing algorithm in both computing time and optimization results, and can meet the requirement of the high-speed, low-cost distribution in e-commerce.

Context-aware approach for temperature monitoring and fire alarming

Yin LU Kejian MIAO Wei HE

2009, 29(2):  583-585. 

Asbtract ( )   PDF (530KB) ( )  

Related Articles | Metrics

In this paper, a temperature monitoring and fire alarming system that made use of semantic network technologies was presented. The system was implemented with a context-aware computing framework that built upon an OSGi gateway. Environment temperature info was collected from 1-wire sensor networks and was stored and processed as a part of smart-home context. Customer rule based context reasoning can be done by the framework, and alarming services would be scheduled when it detected dangerous high temperature.

Big vehicle classification features and their extraction method for multi-lanes roads

Shao_Qing MO Zheng_Gaung LIU

2009, 29(2):  586-589. 

Asbtract ( )   PDF (628KB) ( )  

Related Articles | Metrics

Concerning the multi-lanes road with heavy traffic flow, six features related to vehicle's structural region and color were proposed, which can distinguish truck from bus efficiently, and the features extracting process was introduced. First the boundary of regions was detected by using an insensitive noise edge detection method based on the fusion of Sobel operator and color, then the region color was recognized according to a color classification approach combining RGB and HSI color spaces, and the delineation of features was rendered. Field experimental results indicate these features have a high recognition rate and the extracting process is fast, which can fulfill realtime demand. The vehicle classification system based on these features has been applied in fieldwork with good recognition.

A metamodel approach on multiview consistency checking based on BCCS

2009, 29(2):  590-594. 

Asbtract ( )   PDF (684KB) ( )  

Related Articles | Metrics

MDA is an approach that uses modeling languages such as UML or BON to establish requirement models for the complementary of software specification, as well as for further implementation. However, models of complex information systems always require multiple views, such as static views and dynamic views to describe different perspectives of the system, thus may cause inconsistency in them. A metamodel in which a unifying framework was provided to ensure and check for model consistency was proposed. The authors used B, a full spectrum formal software development method, integrated with CCS, as the foundation to specify the approach.

Improving kernel fisher discriminant analysis for fault diagnosis in chemical process

2009, 29(2):  595-597. 

Asbtract ( )   PDF (577KB) ( )  

Related Articles | Metrics

The sample data in chemical process have strong nonlinearity and involve noise. To solve the problem of condition monitoring for chemical process, an improved KFDA method for fault diagnosis was proposed. It first performed the wavelet transform to remove noise, and the de-noised data were constructed KFDA model. Then a geometry-based feature vector selection (FVS) scheme was adopted to reduce the computational complexity of KFDA. Tennessee Eastman process (TEP) simulations were carried out to show that the given method is effective, and it enhances the accuracy of KFDA for fault diagnosis and reduces memory space and run time.

Object’s warning and forecast method based on voronoi k-order neighboring relations

Hai-Tang SI

2009, 29(2):  598-601. 

Asbtract ( )   PDF (595KB) ( )  

Related Articles | Metrics

It is very crucial that aviation meteorological department provides timely and accurate early warning and forecast information of dangerous weather to ensure the safety, regularity and efficiency of flights. This paper used Voronoi diagram to realize the weather service area division, proposing an object's warning and forecast method based on Voronoi korder neighboring relations, which is to construct k-order neighboring area centered by a certain goal and monitor these areas' weather. When there is dangerous weather, it needs to immediately issue warning, and report dangerous weather's influence weight, danger rating, and the landing time to the central object. This paper gave out specific algorithm, as well as time and space performance analysis. The experimental results verify the feasibility and applicability of the method.

Multi-unit continuous double auction for resource allocation on computational grid

xu zhao Cheng-jian WEI

2009, 29(2):  602-605. 

Asbtract ( )   PDF (717KB) ( )  

Related Articles | Metrics

This paper proposed a decentralized mechanism to solve resource allocation for computational grid where sellers have finite production capacities and a cost structure composed of a fixed overhead cost and a constant marginal cost. The RB2-MCDA mechanism is that agents use risk-based2 bidding strategy for transactions in MCDA. Such mechanism is required when a system consists of multiple self-interested stakeholders of which each possesses private information that is relevant to solving a system-wide problem. The experimental results show that the RB2-MCDA mechanism achieves high efficiency.

Bayesian networks analysis for sequence flight delay and propagation

Wei-Dong CAO Guo-Guang HE

2009, 29(2):  606-610. 

Asbtract ( )   PDF (790KB) ( )  

Related Articles | Metrics

Concerning the increasingly serious flight delay of air transport system, this paper attempted to apply the Bayesian Method in the analysis of flight data. It paid much attention to the situation of the same plane in sequential flight. The Bayesian networks for this purpose were constructed using the Netica software package. The analysis of sequence flight delay and propagation was made by the Bayesian Network inference and tested by the real flight data. The result shows that the model based on probability statistics could reflect the delay reason distribution, the difference of turn around time distribution and delay propagation in different periods of sequential flights clearly.

Some key technologies of deploying High Availability Redundant Cluster System and Dependability Analysis

HAO li_Rui XUE Hong -Ye CHEN Yan

2009, 29(2):  611-613. 

Asbtract ( )   PDF (599KB) ( )  

Related Articles | Metrics

Some key technologies for deploying high availability cluster system were discussed in this paper. An adaptive fault-tolerance method based on task table was presented. The designing idea of the adaptive fault-tolerance algorithm and the implementation of the algorithm were described in detail. Finally, the dependability model with Petri-net was also presented. According to the dependability analysis of the high availability cluster, it shows that the cluster system in this paper has high availability to be used in critical application field.

Self-recovering controller based on TMR-token

2009, 29(2):  614-617. 

Asbtract ( )   PDF (541KB) ( )  

Related Articles | Metrics

As the feature sizes decrease to nm, the ever increasing soft error rate continues its stronger and stronger challenge to ICs such as controllers face. A more dependable self-recovering controller structure was presented based on finite state machine splitting and token hardened. The experimental results of fault injection, simulation and synthesis on some typical benchmarks show that the presented structure achieves a perfect soft error tolerant effect at a very low cost of hardware.

3-dimensional vector radix FFT algorithm

Yun-Feng WU Ni-ni XU Zhi-Tao XIAO Zheng-Xin HOU

2009, 29(2):  618-621. 

Asbtract ( )   PDF (506KB) ( )  

Related Articles | Metrics

This paper presented the 3-dimensional vector radix FFT algorithm. Through the method of decimation-in-time to the 3-dimensional signal, the paper deduced the general form of butterfly computation. The comparison result of various 3-dimensional DFT calculation shows that, the 3-dimensional vector radix FFT algorithm is in low-calculation and more efficient even compared to the 3-dimensional row-column decomposition FFT algorithm.

Research and porting of JDK6 HotSpot virtual machine on Loongsonbased platform

WU Shao-Gang LI Pan-Pan

2009, 29(2):  622-624. 

Asbtract ( )   PDF (506KB) ( )  

Related Articles | Metrics

The Java Virtual Machine (JVM) was studied. The architecture and running mechanism of the JDK6 HotSpot VM were mainly analysed, and the key techniques of porting JDK6 HotSpotVM to given Loongsonbased and operating system for Loongson-based application were studied, then the porting scheme was provided. Through the initial porting on Loongsonbased platform, the Loongson-based platform could support Java running environment on console by ported JDK6 HotSpot VM. Finally, the performance bottleneck of HotSpot VM was analysed, and the optimization solution was given.