Table of Content

01 August 2008, Volume 28 Issue 8

Previous Issue    Next Issue

Articles

Parameter estimation of time-delay chaotic system and its application in secure communication

2008, 28(8):  1901-1903. 

Asbtract ( )   PDF (437KB) ( )  

Related Articles | Metrics

Systematic research was done on the unknown parameter estimation of the system. The sufficient condition of the existence of the parameter estimator was given. The plain text signal was modulated into the system parameter in the emitter. In the receiver, the proposed parameter estimation method was used for the demodulation. Then, the super chaos secure communication was realized. Finally numerical simulations were given to verify the effectiveness of the proposed approach.

Image spam filtering based on features of text region

2008, 28(8):  1904-1906. 

Asbtract ( )  

Related Articles | Metrics

Text region embedded in most of spam images usually contains some discriminative features. An effective method based on the features of text regions to identify spam image was proposed. Firstly, the algorithm extracted the features of text regions that included the number and acreage, saturation, the number of characters and colors contained in text regions. Secondly, the spam images was classified by a support vector machine classifier. The experiment on real world data shows that the proposed algorithm can identify 98.5% of spam images and the precision is more than 98%.

Research on cryptology mechanism of trusted computing platform module

2008, 28(8):  1907-0911. 

Asbtract ( )   PDF (1003KB) ( )  

Related Articles | Metrics

Trusted computing is a new tendency in the field of data security. The basic architecture of trusted computing platform module was introduced, and its cryptology mechanism was discussed. Through analyzing the cryptology mechanism of TCG, the advantages and disadvantages was pointed out. Aiming at the problem that the key management and authentication of TCG specifications were very complicated, a scheme of multiusing authentication data and a authentication protocol were proposed, which colligated OIAP and OSAP, and the security proof of this protocol was given.

Cryptanalysis for stream cipher based on evolutionary computation

2008, 28(8):  1912-1915. 

Asbtract ( )   PDF (702KB) ( )  

Related Articles | Metrics

It is well known that stream cipher is an important cipher and evolutionary computing is an important intelligent computing. A new analytical method for filter model stream cipher based on evolutionary computing was proposed. A particular analytical method was given for steam cipher in two cases with the initial state of shift register and the positions of drawing out points of shift register unknown. The results of practical experiments indicate that the computational complexity of the attack method is far lower than that of exhaustive attack.

Efficient key management scheme based on CPK for mobile Ad Hoc networks

2008, 28(8):  1916-1919. 

Asbtract ( )   PDF (627KB) ( )  

Related Articles | Metrics

Mobile Ad hoc networks (MANETs) face serious security problems due to their unique characteristics such as dynamic topology, vulnerability of weak-secure wireless link, limited physical protection of each node, and lack of central infrastructure. Robust key management services are central to ensuring security of mobile Ad hoc networks. In this paper, a novel robust key management scheme for MANETs is proposed based on elliptic curve combined public key (ECCPK) scheme and the threshold cryptosystem. The major innovative point of this scheme is the proposal of Three-Tier key management model to provide high security, low key management load. Based on Three-Tier key management model, the node’s key generation, secret share distributing, node’s key updating, secret share refreshing and key revocation approaches are proposed. Compared with the security and efficiency of the certificate-based and the identity-based key management schemes, the new scheme is more suitable for the mobile Ad hoc networks.

Analysis of risk evaluation techniques on information system security

2008, 28(8):  1920-1923. 

Asbtract ( )   PDF (653KB) ( )  

Related Articles | Metrics

The risk evaluation on information system security is the basis and precondition of the security mechanism of information system. This paper introduced the present evaluation techniques in detail and then summarized these techniques according to different characteristics. After that, we analyzed the problems existing in risk evaluation on information system security and future prospect.

Survey of network security visualization techniques

2008, 28(8):  1924-1927. 

Asbtract ( )   PDF (690KB) ( )  

Related Articles | Metrics

Network security visualization is a highlighted topic of network security research in recent years. The necessity of network security visualization was presented firstly, and then an overview of network security visualization including the concepts, steps, taxonomy, many current algorithms, and their advantages and disadvantages were presented . Finally, the existing problems and the future directions in this field were discussed.

Design and formal analysis of certified E-mail protocol

Gao Yue-Xiang

2008, 28(8):  1928-1930. 

Asbtract ( )   PDF (574KB) ( )  

Related Articles | Metrics

There are some goals of Certified E-mail Protocol: confidentiality, non-repudiation and fairness. This paper proposes a Certified E-mail Protocol based on the online third party to satisfy the secure properties. The protocol analyzed by extended Kailar logic can achieve the nonrepudiation, fairness as well as the other advantages that it can resist the attacks as distort, replay and the third party can’t read the E-mail.

Dynamic access control model for pervasive computing

Li-Chen ZHANG Xiao-Ming Wang

2008, 28(8):  1931-1935. 

Asbtract ( )   PDF (806KB) ( )  

Related Articles | Metrics

The state of subjects/objects and the current context have the decisive effect on the authorization result in pervasive computing environment. Focusing on the problem that current authorization models use simple states of subjects/objects and the context information leads to failure in pervasive computing environment, a novel dynamic access control model based on the state of subjects/objects and the current context was proposed. The main elements, the architecture and the authorization algorithm of the model were described. Compared to the existing authorization models, the unified scheme of the context information proposed to affect the authorization result enhances the expression ability of the model, and makes the model simple as well. The model is more suitable for pervasive computing environment.

Design and implementation of video encryption based on spatiotemporal chaotic sequences

Yu-Huan CHEN

2008, 28(8):  1936-1939. 

Asbtract ( )   PDF (687KB) ( )  

Related Articles | Metrics

Concerning the characteristics of big data flow, high realtime requirement, a generator on encrypted keys, which was analyzed in detail by maximal lyapunov exponent, was proposed, approximate entropy and L-Z complexity by means of controllable spatiotemporal chaotic sequences combined with the encrypted method of encryption flow based on XOR algorithm. The experimental results show that the encrypted system has high performance at two aspects: both statistics and strengthened sensibility.

Cryptanalysis and improvement of ID-based proxy blind signature scheme

2008, 28(8):  1940-1942. 

Asbtract ( )   PDF (501KB) ( )  

Related Articles | Metrics

The security of the LiZhang's IDbased proxy blind signature scheme from bilinear pairings was analyzed, and it was found that this scheme did not possess the unforgeability property. The original signer can forge a valid proxy blind signature for any message, and the proxy signer can misuse the signing capabilities. At the same time, the proxy signer can make a linkage between a signature and the corresponding message of signing protocol after signing, which is called linkability. An improved proxy blind signature scheme was proposed, which can resolve the security problems existing in the original scheme and satisfy other required properties of a proxy blind signature scheme. The calculative complexity is lower than that of the other schemes despite a little increase.

An Efficient Key Agreement Scheme for Dynamic Secure Multicast

CHEN Li-Qing

2008, 28(8):  1943-1945. 

Asbtract ( )   PDF (587KB) ( )  

Related Articles | Metrics

IP Multicast provides an efficient mechanism for a sender to send messages to multiple receivers simultaneously. One of the main requirements for the realization of secure multicast is the design of efficient key management schemes. In this paper, we propose a new identity-based key agreement scheme for dynamic multicast groups using bilinear pairings. The procedures of secret communications between subgroups and the updating of group keys with the dynamic change of group members are analyzed in detail, when the newly proposed key agreement scheme is employed in multicast communication. The analysis shows our scheme is not only efficient in computation and communication and also satisfies all the security requirements of key agreement for multicast.

Network and communications

A Survey on Joint Power Control and Multi-rate MAC Protocols

Cong LIN Yong XIANG

2008, 28(8):  1946-1950. 

Asbtract ( )   PDF (824KB) ( )  

Related Articles | Metrics

This article contains a survey of the power control technique for energy-saving and the multi-rate feature in MANETs, with particular emphasis on typical MAC protocols with combined techniques of power-control and multi-rate capabilities. Their characteristics, performance and deficiency are compared adequately in terms of optimization goal selection, process method and information exchange. The difficulties in designing MAC protocols taking in account both power-control and multi-rate capabilities including the status of wireless nodes is hard to be fully explored by other nodes and the control metrics can't accurately achieve the optimization goal. Finally, future trends are predicted.

Network coding traffic design using column generation techniques

Yun-Ji SONG Sheng WANG Xiong WANG

2008, 28(8):  1951-1953. 

Asbtract ( )   PDF (467KB) ( )  

Related Articles | Metrics

Network coding can reduce the cost of key links and improve the load balance of the network. But heuristic routing algorithms cannot find the global optimal solution for the network. We used column generation to solve the Network Coding based traffic programming problem. First, we relaxed the constraints of the problem by using Lagrange Relaxation, then defined the physical meaning of each relaxation variable. At last, used relaxation variables updating the multicast graph in iteration. Compared with the heuristic routing algorithm, column generation can improve the network throughput, compared with Integer Linear Programming (ILP). It can compute less inventory routings and accelerate convergence.

Integrity estimation methods on ISP topology measurement

Zhen-Han WEI Ming CHEN

2008, 28(8):  1954-1958. 

Asbtract ( )   PDF (761KB) ( )  

Related Articles | Metrics

ISP topology is usually acquired by measurements. However, how to estimate the integrity of the measurement data is still lack of intensive research. The factors influencing the integrity of routerlevel topology were summarized. It was pointed out that there was accurate node integrity estimation method and no accurate link integrity estimation method. A link integrity estimation method based on geological information was proposed. The skitter data provided by CAIDA was analyzed as a measurement sample. For the China Telecom's backbone network Chinanet, the integrity ratio of the backbone links measured by skitter is no more than 40%.

Improved sleep mode mechanism based on IEEE 802.16e

2008, 28(8):  1959-1961. 

Asbtract ( )   PDF (478KB) ( )  

Related Articles | Metrics

In order to minimize the MS energy consumption and decrease the occupation of interface resources in BS, the sleep mode was introduced into the standard IEEE 802.16e.We characterized the standardized sleep mode in IEEE 802.16e, and then we gave an improved mechanism based on variable sleep interval energy and compared with the standard mechanism under four actual models. Through the simulation we could see the performance of the improved mechanism is better than the standard mechanism in energy saving. At last we studied the impact of key parameters on the improved mechanism performance.

Parameter tuning strategy for IEEE 802.11e EDCA mechanism

2008, 28(8):  1962-1964. 

Asbtract ( )   PDF (537KB) ( )  

Related Articles | Metrics

The principle and wireless channel utility model of IEEE 802.11e EDCA mechanism was studied, and the importance of parameter settings of EDCA was illustrated. Based on this point, a simple and effective parameter tuning strategy for IEEE 802.11e EDCA was presented. Simulation results show that the proposed strategy can ensure the requirement of the realtime traffic, increase the throughput of the besteffort flow and optimize the performance of IEEE 802.11e EDCA mechanism.

Cross-layer optimization for wireless real-time media streaming

ZHANG Peng BAI Guangwei BAI Yong JIN Hang SHEN

2008, 28(8):  1965-1968. 

Asbtract ( )   PDF (746KB) ( )  

Related Articles | Metrics

A strategy for performance optimization in wireless realtime media streaming was presented, i.e. EAFEC, in the hope that the media could be played on receivers with high quality. First of all, we used a Poisson process to analyze data loss process at the data link layer. And then, the maximum retransmission time of the data link layer was mapped to the calculation of the endtoend delay and data loss. On this basis, the strategy, using the crosslayer optimization design methodology, adjusted the sending rate of MPEG video frame adaptively and allocated the network bandwidth resource between the MPEG video source data and redundant data dynamically. Our mathematical analyses and simulation results demonstrate that the EAFEC mechanism achieves better quality of media streaming compared with original FEC, in terms of playable frame rate, reliability and realtime performance on the receiver side.

Low-overhead truthful energy-efficient routing protocol in selfish wireless Ad hoc networks

Xin-Hui YUAN Xin-Hua JIANG

2008, 28(8):  1969-1972. 

Asbtract ( )   PDF (626KB) ( )  

Related Articles | Metrics

A feasible way to stimulate cooperation in selfish Ad Hoc networks is to reimburse the forwarding service providers for their cost. We proposed a low overhead truthful energyefficient protocol called LOTER, which introduced the VCG mechanism into the selfish wireless Ad Hoc networks. In LOTER, the node collected its neighbors' information. The destination node selected several RREP paths. If it was on the RREP path, the node sent its collected information to the source node. Based on such information, the source node found the least cost path to the destination and calculated the VCG payment to the nodes on the chosen least cost path. LOTER can realize truthful and energyefficient routing in the selfish Ad Hoc networks. Furthermore, it is skillful at collecting topologic information with low overhead. Stimulation results show that LOTER provides better performance than other existing protocols.

Research of optimitical algorithm for martial information grid transmission route

Y

2008, 28(8):  1973-1975. 

Asbtract ( )   PDF (435KB) ( )  

Related Articles | Metrics

How to transmite information data is an important problem in the study of the Martial Information Grid.The Ant Colony Grid Route Algorithm is applied in the selection of Martial Information Grid transmission route. An antbased routing optimitical algorithm with delete gene was presented.A variable is joined in this algorithm,which is named Delete Operator.By this, the Grid is charactered by the survival of the fittest mechanism. The path of inferior quality will be eliminated forcibly.At the same time,the combination parameter will be selected and evoluted.Then the grid route will be selected effectively.The simulation show the algorithm improve transmission performance of information grid evidently.

Recursive CDMA multiuser detection method based on least p-norm state space criterion

Dai-Feng ZHA

2008, 28(8):  1976-1980. 

Asbtract ( )   PDF (624KB) ( )  

Related Articles | Metrics

Alpha stable distribution is better for modeling impulsive noises than Gaussian distribution in wireless communication system. This class of process has no close form of probability density function and finite second order moments. In general, Wiener filter theory is not meaningful in SαSG environments because the expectations may be unbounded. We proposed a new adaptive recursive least pnorm State space multiuser detection algorithm based on least pnorm of innovation process with infinite variances. The simulation experiments show that the proposed new algorithm is more robust than the conventional state space multiuser detection algorithm.

Database Technology

A recommendation algorithm based on users’ partial similarity

Fa-Qing WU Liang He Wei-Wei Xia Lei REN

2008, 28(8):  1981-1985. 

Asbtract ( )   PDF (856KB) ( )  

Related Articles | Metrics

Collaborative filtering is one of the most successful techniques for building recommender systems, and is extensively used in many personalized systems. However, existing collaborative filtering algorithms have been suffering from data sparsity and low recommendation accuracy problems. This paper focused the collaborative filtering problems on two crucial steps: (1) computing neighbor users for active users and (2) missing data prediction algorithm. Consequently, this paper proposed an improved collaborative filtering algorithm based on Users' Partial Similarity (CFUPS for short), which computed the similarity between users relying on partial items with their common interests, not on all common rated items. Besides, it combined items attributes similarity and their ratings similarity properly as a weight for computing missing ratings. Theoretically, our method is effective in improving the recommendation precision and withstanding data sparsity. In the meantime, the experimental results show that our proposed CFUPS algorithm outperforms other existing collaborative filtering approaches.

Calculating Max and Min with exemplary sketch algorithm in data stream management system

TIAN HaiSheng

2008, 28(8):  1986-1990. 

Asbtract ( )   PDF (646KB) ( )  

Related Articles | Metrics

Max and Min are two important aggregates in the Data Stream Management System (DSMS). A novel mechanism called the exemplary sketch was proposed to evaluate Max and Min over sliding windows with various sizes in the real time data stream environment. With this method we no longer need to buffer all the tuples to fall into current sliding windows, which means we can reduce the space cost remarkably. Because of this, the processing time can also be reduced dramatically. Experimental results show that the sketch scheme yields very good performance on both space and time cost.

Dynamic data storage scheme in CDN - UbDP

TANG Di-Bin Jin-Lin WANG Hong NI

2008, 28(8):  1991-1993. 

Asbtract ( )   PDF (634KB) ( )  

Related Articles | Metrics

Content Delivery Network (CDN) adopts data replication or data caching methods to accelerate dynamic Web applications. A userbased data partition method especially for Websites that provide personal information publishing was proposed, such as forum, Web log service providers: partitions data into many parts according to users it belongs to, distributes to database systems near users. This method achieves better scalability because the write database queries are assigned to different databases.

Service discovery of semantic Web based on improved semantic entropy maximum model

2008, 28(8):  1994-1996. 

Asbtract ( )   PDF (441KB) ( )  

Related Articles | Metrics

The service discovery is one of the core technologies of semantic Web. This paper brought forward a novel discovery approach of the semantic service based on the SEM (Semantic Entropy Maximum). This approach applied the entropy maximum algorithm to the matching and the recognizing of the semantic service, and meanwhile, it compared this algorithm with other related algorithms. The results of this experiment show that the SEM model has preferable performance. In a practical enterprise application of semantic Web, the SEM is proved to be useful in recognizing and matching the semantic of Chinese.

Intuitionistic fuzzy rough set based on inclusion degree

2008, 28(8):  1997-1999. 

Asbtract ( )   PDF (601KB) ( )  

Related Articles | Metrics

Intuitionistic fuzzy inclusion degree was introduced to modele the fusion of intuitionistic fuzzy set and rough set. Firstly, the definition of intuitionistic fuzzy set on a special lattice L was introduced. Secondly, a new definition and formulas of intuitionistic fuzzy inclusion degree with a value in a special lattice L were proposed. And then, the membership degree and nonmembership degree of Intuitionistic fuzzy inclusion degree were used to define the lower and upper approximation respectively. The model of intuitionistic fuzzy rough sets was constructed and the properties of proposed model were classified and examined respectively.

An improved algorithm for attribute reduction based on rough sets

LI Yong-Hua Yun Jiang

2008, 28(8):  2000-2002. 

Asbtract ( )   PDF (437KB) ( )  

Related Articles | Metrics

At present, basically all attribute reduction based on Rough Sets is to extract the attribute core through the discernbility matrix, then calculate attribute reduction, but the method is still complex. This paper proposed and analyzed an attribute reduction algorithm of weighted mean attribute significance. The algorithm not only can get a reduction, but also does not need core calculating. It can reduce the computing effort and improve the computing efficiency. The algorithm is verified with the instance.

Design and Implementation of Grid Job Management for China National Grid

Qiao Jian Zha Li

2008, 28(8):  2003-2005. 

Asbtract ( )   PDF (640KB) ( )  

Related Articles | Metrics

A VegaBatch grid job managing system was proposed and implemented, which was based on China National Grid (CNGrid) and its system software CNGrid GOS. VegaBatch implements a metascheduling policy based on queuinglength prediction, and maintains the consistency of global job records through its doublelayer synchronizing mechanism. It also ensures the security of private data via userswitching facility, and provides the "Rerun" feature to support the data postprocessing scenario. The ability of VegaBatch is discussed and compared with other popular grid job managing software. Having been deployed in CNGrid environment, VegaBatch provides richlyfeatured, secure and robust functions for managing grid jobs, and brings a reduction on the difficulty of using grid platform, as well as a promotion on the enduser experience.

An RNA Secondary Structure Prediction Algorithm Based on Fast Dynamic Weighted Matching

Jiawei LUO Zheng PENG

2008, 28(8):  2006-2009. 

Asbtract ( )   PDF (609KB) ( )  

Related Articles | Metrics

On the basis of dynamic weighted matching algorithm, this paper introduced an RNA secondary structure prediction algorithm based on fast dynamic weighted matching. In order to reduce time complicated degree and to improve the ability of pseudoknot prediction, we employed fast searching of max dynamic weight stem algorithm and expanded searching area of pseudoknot respectively. As a result, compared with dynamic weighted matching algorithm, the fast dynamic weighted matching algorithm not only has better time complicated degree which is O(n3), but also can predict more possibly existing pseudoknots.

Graphics and image processing

Non-symmetry and overlapping anti-packing representation with square sub-patterns

2008, 28(8):  2010-2012. 

Asbtract ( )   PDF (600KB) ( )  

Related Articles | Metrics

With the concept of the Non-symmetry and Antipacking pattern representation Model (NAM), a Non-symmetry and Overlapping Antipacking pattern representation with Square subpatterns(NOAS) was proposed. The NOAS divided the original pattern into square sub-patterns, which of overlapping were permitted. The encoding and decoding algorithms for binary images were presented. By comparing the proposed algorithm with the linear quadtree, the theoretical results show that the compression ratio of the former is much higher than that of the latter. The experimental results show that the number of sub-patterns of the NOAS is much smaller than the number of nodes of the linear quadtree, and that the compression ratio of the NOAS representation is evidently higher than that of the linear quadtree, runlength encoding, and LZW encoding.

Image tampering localization based on binary phase-only filter watermarking

Jun SANG Hai-bo HU Chunxiao YE Hong XIANG Li FU Bin CAI

2008, 28(8):  2013-2016. 

Asbtract ( )   PDF (641KB) ( )  

Related Articles | Metrics

The Binary PhaseOnly Filter (BPOF) digital image watermarking embeds the BPOF of the Discrete Fourier Transform (DFT) of an image into one of the bit planes of the corresponding magnitude for image authentication. In this paper, BPOF watermarking based image tampering localization was studied. To detect and localize the tampered regions in an image, the image was divided into non-overlapping blocks, while the watermarks were embedded and detected within the blocks individually. The discussion focused on the imperceptibility, the detection performance, the robustness to the JPEG compression of the embedded watermark and the image tampering localization ability, under different sizes of the image blocks and different magnitude bit planes for watermark embedding. The methods of selecting the sizes of the image blocks, the magnitude bit planes for watermark embedding, and the threshold values for watermark detection were obtained. The experimental results show that the BPOF watermarking can be used for image tampering localization.

Motion detection based on image block difference and mean shift algorithm

2008, 28(8):  2017-2020. 

Asbtract ( )   PDF (632KB) ( )  

Related Articles | Metrics

Motion detection is an important research area in computer vision. A conventional problem in existing algorithms is the influence of noises on the segmental results. A new motion detection algorithm based on joint information in spatiotemporal domain was presented. First, result by temporal difference of image block's barycenter was used to initialize an object contour. The image block difference algorithm can eliminate the influence of noise and reduce black holes in objects. Then, a mean shift algorithm was used to iterate the initial contour to make it close to the object step by step. Experiments show that this algorithm can detect moving objects in image sequence quickly and accurately.

Research of content-based video copy detection

2008, 28(8):  2021-2023. 

Asbtract ( )   PDF (492KB) ( )  

Related Articles | Metrics

A novel content-based video copy detection method was proposed. As video information application had a strong temporal redundancy, a keyframe selection algorithm was presented, and the ordinal measure of the AC coefficients of its Discrete Cosine Transform (DCT) was used as its feature, then the L1 norm distance was computed for the similarity measure of the video. Results show that our method obtains a significant performance against several kinds of geometric transforms.

A new method for restoration of motion blurred images

Bo CHEN

2008, 28(8):  2024-2026. 

Asbtract ( )   PDF (607KB) ( )  

Related Articles | Metrics

Through the analysis on reason why and when motion blurring produces, a new model for restoration of motion blurring image method was proposed. Hough transform and selfcorrelative function were first employed to estimate the direction and length of the motion blurring, and then total variation model which was timestep adaptive is applied to restore the image. Experimental results show that such a spatial domain based processing can not only avoid the ringbell effect incurred by traditional frequency domain processing and it is also insensitive to noise and the estimation error of motionblurred parameters.

Study on generation mechanism of colorimetric planar properties in colorimetric data of process printing

Cong-jun Cao ming-Quan Zhou Guo-Shun Wu

2008, 28(8):  2027-2029. 

Asbtract ( )   PDF (428KB) ( )  

Related Articles | Metrics

It is essential to find out relatively simple and highly effective methods of color space conversion in color management. As an optical phenomenon, the presence of dot colorimetric planes of four-color halftone printing provides a relatively novel thought to study color space conversion. The validity of the plane theory was verified by the mathematical statistic and the bivariate regression algorithm, and the generation mechanism of the plane theory was firstly analyzed by CIE1931Yxy chromaticity system.

New face recognition algorithm based on nonlinear dimensionality reduction

Teng-Tao TU siyanggu 顾嗣扬

2008, 28(8):  2030-2032. 

Asbtract ( )   PDF (645KB) ( )  

Related Articles | Metrics

A new supervised kernel subspace method for face recognition was proposed. It makes a better use of samples' label information by introducing supervision in the construction of local neighborhood so as to improve the recognition efficiency; and a positive regularization was added in the gaining of the optimal reconstruction weight matrix to make it insensitive to the noise. In experimental phase, the AT&T and Yale face databases were used to test this algorithm by using the Nearest Neighborhood (NN) algorithm to construct the classifiers. Experimental results show that the proposed method is effective, robust and is superior to nonsupervised KNPP and the traditional classic methods.

Image zero-watermarking algorithm based on Contourlet transform and singular value decomposition

Zeng Fan-Juan Zhou An-Ming

2008, 28(8):  2033-2035. 

Asbtract ( )   PDF (480KB) ( )  

Related Articles | Metrics

An image zero-watermarking algorithm was proposed based on contourlet transform and singular value decompositon. After the coutourlet transform, the original image was decomposed into series of multi scale, local and directional subimages. The singular value of low frequency component is decomposed. The watermark is embedded and extracted from the first singular value of the every block of image. Experimental results show that the digital image watermarking Algorithm has a good transparence of embedded watermark image and is robust against attacks such as added noise, JPEG compression and cropping. The reliability of watermark extraction was enhanced.

Intersection recognition of well logging curve based on discrete hopfield neural network

Diao Chuan

2008, 28(8):  2036-2039. 

Asbtract ( )   PDF (587KB) ( )  

Related Articles | Metrics

In the process of vector quantization of well logging curve, background grids and other forms of curve interference discontinue curve tracking and hardly to achieve automatic tracking, so manual direction judgment is needed. This article proposes a method for well log curves intersection recognition using Discrete Hopfield Neural Network (DHNN). This method presets 8 standard direction samples for network training. During curve tracking, entering recognition status if comes across intersection, the algorithm makes accurate prediction of curve direction through branch match of welltrained Hopfield network, in combination with width match. Theoretical analysis and experiment demonstrates that this method improves the precision of intersection recognition and has a good result of anti-interference.

An improved QEM simplification algorithm based on features preserved

Fang-min DONG Yong LIU Ren-bin XIAO

2008, 28(8):  2040-2042. 

Asbtract ( )   PDF (662KB) ( )  

Related Articles | Metrics

When the mechanical or architectural CAD models are simplified by using the QEM-based mesh simplification algorithm, the features of the simplification models can not be preserved very well. An improved algorithm based on features preserved was proposed. Firstly, the boundary curves were detected by using a hybrid approach to surface segmentation of the models. And the edges of the models were labeled as four types. Then different simplification strategies for each type of edges were used in the simplifying process on principle of avoiding the edges and vertex on the boundary curves to be collapsed during the simplification process. The experimental results show that the improved algorithm is effective.

Palmprint recognition based on two-directional two-dimensional Fisher's linear discriminant analysis

Wei-dong JIN

2008, 28(8):  2043-2045. 

Asbtract ( )   PDF (449KB) ( )  

Related Articles | Metrics

A new method named twodirectional twodimensional Fishers Linear Discriminant analysis was proposed for palmprint image representation and recognition. The method perform 2DFLD twice, one was in horizontal direction and the other was in vertical direction, so pertinency of rows and columns in palmprint image was avoided. The Fisher criterion was used to select the most discriminative features, and the discriminant information was compacted into the upleft corner of the image. Experiment results show that this method has higher recognition rate and is efficiency than the traditional LDA algorithms for palmprint extraction.

Algorithm for finding knearest neighbors based on octree segmentation in space

Miao HUANG Hai-Chao ZHANG 李超 LI Chao

2008, 28(8):  2046-2048. 

Asbtract ( )   PDF (669KB) ( )  

Related Articles | Metrics

An octree based on the rapid k nearest search was presented for scattered points from 3D scanner. Through the establishment of bounding box on point sets, octree was used to record segmentation process, so that the search of point neighbors was limited to the bounding box of sample points and its neighbor, and through pruning strategies to further narrow the scope of the search.The experiments on a great deal of real data show that the search speed can be well improved.

Canny edge detection algorithm based on anisotropic diffusion equations

Jie ZHANG

2008, 28(8):  2049-2051. 

Asbtract ( )   PDF (498KB) ( )  

Related Articles | Metrics

The Canny edge detection algorithm which used Gaussian filter for smoothing the image may lead to lower SNR and higher edge location error, which produced false edge and corner roundness. To solve these problems, an improved edge detection algorithm was proposed by replacing Gaussian filter with anisotropic diffusion equations, and the image enhancement was carried out after diffusion. Experimental results show that the accuracy of edge detection is improved evidently, and a much better edge detection effect is obtained.

Kalman filtering for tracking video objects based on motion estimation

Guo-qiang Xiao

2008, 28(8):  2052-2054. 

Asbtract ( )   PDF (480KB) ( )  

Related Articles | Metrics

A video tracking algorithm that used the prediction of object centroids based on Kalman filtering was preposed. Firstly, video objects were segmented and their centroids were calculated. Then, Kalman filtering was used to predict the object centroids in next frame with the information of centroids and motion vectors in successive two frames of a video sequence, so It was able to track multiple non-rigid moving objects fast, efficiently and automatically. Experimental results show that the proposed method is robust to deal with the problems in multitargets tracking such as new target entering, target leaving, scaling and deforming of non-rigid objects.

New algorithm of iris location based on coordinate

Weixing WANG Yan Zhao

2008, 28(8):  2055-2058. 

Asbtract ( )   PDF (510KB) ( )  

Related Articles | Metrics

A new and simple iris location method was proposed. The algorithm includes the location of inside and outside of the iris. Based on the rough process of the iris image, for the inside location the author takes the method of the projection to the coordinate, and for the outside the author looks for the point which the content of information is least on the scanning line. For the distribution of the yawp for example eyelash, the point which we choose is not only one. The author abandons the wrong point using the corresponding templates. It is proved that the algorithm is feasible through experiments.

Transfer function design based on principle of stripping surface layer

Mo ZHAO

2008, 28(8):  2059-2062. 

Asbtract ( )   PDF (664KB) ( )  

Related Articles | Metrics

In order to resolve several important problems existing in volume rendering applications, such as intensive computing cost, difficulty in utilizing users practical experience and demand for complex manual intervention, a new algorithm for transfer function design, the Stripping Surface Layer Algorithm (SSLA) was proposed．Through adopting detecting across over and detecting with high gradient proportion distribution, firstly, SSLA evidently reduced the errors caused by the fluctuation of the surface layer, and eliminated the requirement of complex intervention and adjustment of users. Secondly, it avoided some complex computations like the computation of high order partial derivatives and brought about a lower computing cost. Thirdly, it adopted a method for transfer function design, which brought the users' sensation into play while still enjoying a relatively high level of automation. Besides, a medical image analysis system based on SSLA show the advantages of this algorithm.

Research on techniques for browsing visualized information based on Zooming-Panning mode

2008, 28(8):  2066-2070. 

Asbtract ( )   PDF (818KB) ( )  

Related Articles | Metrics

The main ideas, the operating ways and the effects of some existing techniques were presented and analyzed in detail. According to it, some suitable background information was offered to the focus of views, and also a good form of visualized show was taken to meet the need of people who scoop information. However, the concrete realization techniques were insufficient. It could neither make the structure of the visualized show consistent nor display a good effect. Aiming at the statements above, a followingelement was created to make up for shortages of this technique in the paper. Its concept and implementing formula were given on the theory of geometric optics. We also extended two standards that were mentioned in this technique, and accordingly a new technique named ZoomingPanning navigation images based on Automaticcontrol route was given.

Artificial intelligence

Description Logic extension based on extenics theory

Jian-pei ZHANG

2008, 28(8):  2071-2073. 

Asbtract ( )   PDF (624KB) ( )  

Related Articles | Metrics

Traditional Description Logic (DL) does not fit to handle the problems with incomplete information, tracit knowledge or even contradiction premise. Therefore it is not sufficient to be the logical foundation of the Semantic Web. For this reason, the matter-element and divergence rules of Extenics were introduced to extend the traditional DL. Firstly, the semantic explanation of matterelement was given. Then the matter-element and divergence rules were used to extend the Tableau algorithm to be new Tableau-E algorithm and TableauE′algorithm, thus realizing the extension and consistency checking of Abox (assertion of individuals), and making up the deficiency of traditional DL.

Parameters optimization of ε-support vector regression machine based on differential evolution algorithm

Wang Jin-Lin Hui Zhao

2008, 28(8):  2074-2076. 

Asbtract ( )   PDF (421KB) ( )  

Related Articles | Metrics

Parameters optimization is an important issue in the research of εSVRM, and it nature is an optimization selection process. Motivated by the effectiveness of Differential Evolution algorithm on optimization problem, a new automatic searching methodology based on Differential Evolution (DE) algorithm was proposed. Experimental results assess the feasibility of the proposed approach for data sets with several noises and compared with SVRM model optimization method based on Genetic Algorithm(GA), Ant Colony Optimization(ACO) and Particle Swarm Optimization(POS) demonstrate improvement of generalization performance.

Covering framework and primary direction neural network

Wei-Dong YIN

2008, 28(8):  2077-2080. 

Asbtract ( )   PDF (700KB) ( )  

Related Articles | Metrics

Some widely used artificial neural networks such as BP, RBF and ARTMAP were discussed on the common points they shared when solving nonlinear regression problems. A framework, proposed accordingly, suggested that such problems should be implemented in two steps: sample covering and modelbased map regression. This idea stems from two aspects, i.e. simulation of human brain’s information processing and Biometric Pattern Recognition (BPR). As an instance, a new network named as Primary Direction Neural Network (PDNN) was proposed on the ground of the density of certain function set in continuous function space. It is used to solve two kinds of problems, function regression and stochastic time series prediction. Compared with BP and RBF neural network, PDNN has preferable approximation and robust performance.

Adaptive BackPropagation algorithm with magnified error signals

2008, 28(8):  2081-2083. 

Asbtract ( )   PDF (383KB) ( )  

Related Articles | Metrics

An adaptive Back-Propagation (BP) algorithm based on magnified error signals was presented. It deals with the saturation areas that play a significant role in the slow convergence of standard BP algorithm. A modified derivative of the activation function was proposed to make the weight adjustment to avoid falling into the saturation areas and the convergence of the proposed algorithm was proved. Simulation results show that the improved algorithm accelerates the convergence rate and enhances the global convergence capability to some extent.

Hybrid genetic ant colony algorithm for traveling salesman problem

Jing-Rong XU Yun LI Hai-Tao LIU Pan LIU

2008, 28(8):  2084-2087. 

Asbtract ( )   PDF (704KB) ( )  

Related Articles | Metrics

A new Heuristic Genetic Information based Ant Colony Genetic Algorithm (HGI-ACGA) to solve Traveling Salesman Problems(TSP) was proposed. HGIACGA’s two sub-algorithms are Ant Colony Genetic Algorithm(ACGA) and Heuristic Genetic Information based Ant Colony Algorithm(HGI-ACA). ACGA enhances genetic algorithm’s population diversity and reduces the search domain, while HGIACA eliminates the creation of invalid tours and also avoids depending on pheromone excessively. A combination of genetic information and pheromone leads to a significant improvement in performance. The strategy of HGI-ACGA algorithm can improve convergence rate and capacity of searching optimal solution. Experimental results show that the proposed algorithm generally exhibits a better solution and a higher rate of convergence for TSP than ACGA and ACA.

Intrinsic dimension estimation of high-dimensional data based on adaptive maximum likelihood

2008, 28(8):  2088-2090. 

Asbtract ( )   PDF (382KB) ( )  

Related Articles | Metrics

How to estimate the dimension of a dataset is very important to dimension reduction. Maximum likelihood estimation based method is a novel dimension estimation method, which is simple and performs well when appropriate neighbors are selected. But it is very sensitive to the neighbor number by reason of ignoring the distribution difference of each point. An improved maximum likelihood estimation method named AMLE was proposed in this paper. Considering the distribution of a dataset, AMLE adjusts the contribution of each point to the estimator by designing a weight function. By applying it to a number of simulated and real datasets, experimental results show that it performes better than MLE and other methods.

Research on construction of base classifiers based on discretization method for ensemble learning

2008, 28(8):  2091-2093. 

Asbtract ( )   PDF (465KB) ( )  

Related Articles | Metrics

Construction method of base classifiers based on data discretizaion was proposed to produce individual classifiers with good diversity in ensemble learning. And then it was used in support vector machines ensemble. Using the rough sets and Boolean reasoning algorithm to process the training samples, this method can eliminate the irrelative and redundant attributes to improve the accuracy and diversity of base classifiers. Experimental results show that the presented method can achieve better performance than the traditional ensemble learning methods such as Bagging and Adaboost.

Research on imbalanced recognition algorithm for promoter sequence

2008, 28(8):  2094-2096. 

Asbtract ( )   PDF (607KB) ( )  

Related Articles | Metrics

By improving the Hessian matrix diagonal parameter, adjusting the hyperplane displacement,separating the few samples from two-class imbalanced samples, associated with the hidden markov random iterated algorithm, the experiment indicates that we can’t simply fix the diagonal parameter of Hessian matrix, and must add proper weight coefficient which can be adjusted to control the number of error-divided samples,recognize promoter sequence, the average recognition rate come to 92.8%.

Application of modified wavelet features and multi-class SVM to pathological vocal detection

Shi Wu

2008, 28(8):  2097-2100. 

Asbtract ( )   PDF (772KB) ( )  

Related Articles | Metrics

This paper researched the method of wavelet featurevectors and multi-class Support Vector Machines (SVM) applied to pathological vocal detection, which extracted features of the pathological vocal based on continuous wavelet transformation and then classifies pathological vocal by multi-class support vector machine. In order to reduce computation complexity caused by using the standard SVM for multi-class classification, a new multi-class classification algorithm based on one-class classification was proposed. It can form a decision function for every single class sample and accordingly obtain the aim of classification based on maximum of decision function. Experimental results have shown that the pathological vocal detection system is feasible and applicable by the combination of multi-class SVM and wavelet featurevectors.

Ascertaining nonmembership functions of intuitionistic fuzzy sets based on priority ordering method

2008, 28(8):  2101-2102. 

Asbtract ( )   PDF (452KB) ( )  

Related Articles | Metrics

Concerning the problem of ascertaining nonmembership functions of Intuitionistic Fuzzy Set (IFS), a technique for ascertaining non-membership functions based on priority ordering method was proposed, whose algorithm and steps were presented in detail with the demonstration of rightness in theory. Then, the time complicacy and application area were analyzed and discussed. Finally, the validity and practicability of the technique were checked by providing an example analysis in applications. Researches show that the proposed algorithm has solved the problems of technique for ascertaining nonmembership functions of IFS effectively, which have the trait of training priority and order according to different attributions.

Bi-group artificial fishschool algorithm based on simplex method

QU Liang-dong Dengxu he

2008, 28(8):  2103-2104. 

Asbtract ( )   PDF (456KB) ( )  

Related Articles | Metrics

After analyzing the disadvantages of artificial fish stochastic moving without a definite purpose or heavy getting together round the local optimum solution in original artificial fishschool algorithm, a novel Bi-group Artificial Fishschool Algorithm based on Simplex Method (SMBGAFSA) was proposed. In this algorithm, moving of two subgroups was parallelly performed. Information was exchanged when subgroups were reorganized. The group can explore the solution space and search the local part, and then use simplex method to search the local part. Several computer simulation results show that the proposed algorithm can greatly improve the ability of seeking the global excellent result, convergence property and accuracy.

Typical applications

Publish-subscribe system built with hypercube-based topology

Xiao-Ping Xue

2008, 28(8):  2105-2109. 

Asbtract ( )   PDF (615KB) ( )  

Related Articles | Metrics

Starting from the topology of network, this paper proposed a kind of publishsubscribe system based on hypercube with its related routing algorithm. The hypercube-based topology shares the merits of general structured peer-to-peer network, which can be applied dynamically in large scale. Moreover, due to its own characteristics, the needs of propagating a large number of events can be met. The result of simulation indicates that the system load can be well balanced and bandwidth can be saved, when hypercubebased network is introduced.

Software model checking based on hierarchical unit partition

Chen CHEN Yong-Sheng CHEN

2008, 28(8):  2109-2112. 

Asbtract ( )   PDF (559KB) ( )  

Related Articles | Metrics

This paper reviewed some prevalent trends in this domain in recent years, then proposed a software model checking scenario, which was based on hierarchical unit partition and heuristic search. It has three phases, which are preprocess, unit partition and state space search. There is on-the-fly method in this scenario to improve the performance of model checking. Experiments prove that this model checking scenario works well on solving state explosion problem.

High performance and secure device virtualization model on X86 platform

Xin-Mei HUANG Hang LEI

2008, 28(8):  2113-2116. 

Asbtract ( )   PDF (641KB) ( )  

Related Articles | Metrics

Mainstream device emulation models suffer from low performance and non-security. A novel high performance device virtualization of directly assigning model with hardware IOMMU support was presented, and was implemented as the display device solution on Xen. This model is more secure than paravirtual device model based IOVM architecture. Viewperf benchmark test result indicates this implementation's performance is close to nonvirutal system, much better than traditional device emulation model.

Development of distributed device driver in radio monitoring system based on .NET remoting

Bo-shan XIAO Gong Xiao-feng Wang Xu

2008, 28(8):  2117-2120. 

Asbtract ( )   PDF (647KB) ( )  

Related Articles | Metrics

Radio monitoring is the main method in radio spectrum resource management. Monitoring device driver plays an important role in radio monitoring system software. This paper discussed the features of radio monitoring system and the requirements of device driver system. Also it introduced the architecture and the principle of .NET Remoting technology briefly and described in detail of constructing distributed monitoring device driver system based on .NET Remoting in detail. How to transmit monitoring result data from the server of .NET remoting system to the related client in the driver system was analyzed with emphasis.

Extended Region Code based on Feature of GML Documents: ER-Code

ZHANG Hai-Tao 张海涛 Guo-Qing Du Guo-Nian LV Shu-Liang Zhang

2008, 28(8):  2121-2124. 

Asbtract ( )   PDF (552KB) ( )  

Related Articles | Metrics

Demanding on simultaneously carrying out the relations judgment of features′ elements containment as well as features′ geometry topotaxy in processing of GML path query, Tap the traditional XML path encode techniques analyzing, the paper designed an extended region code: ER-Code which takes the feature element as the unit of GML documents. Experimental results show that ERCode has good performances on initial construct and holistic query based on ER-Code. In addition, integrating ER-Code and the feature spatial geometry characteristic to an overall space can improve the efficiency that GML data path query greatly. This coding method has certain theory and practical value to the research of GML relevance technologies such as spatial data querying and storing.

Ontology-based knowledge modeling in network manufacturing

Quan ZHANG Yuan YAO Qingxi HU Fei You

2008, 28(8):  2125-2127. 

Asbtract ( )   PDF (638KB) ( )  

Related Articles | Metrics

The lacking of semantic expression is a bottleneck of current Web service based manufacturing solution. It is not easy to dynamically discover appropriate services from different service providers. A method of ontologybased knowledge modeling was put forward. It combines Web service with network manufacturing service and the servicedriven manufacturing ontology model is constructed by applying the method. The evaluation method of approximate service matchmaking was also developed, and a case was given to demonstrate the above mentioned. The study solves three problems during the manufacturing service process, which are communication between different roles，data exchange and reuse of knowledge resource. The share and the configuration optimization of distributed manufacturing resources were realized in the networked manufacturing environment. It lays the foundation for the construction of the semantic Webbased collaborative manufacturing service platform.

Time delay analysis of interconnection network in Unmanned Undersea Vehicles

Yi－Qun LIN Wei－Dong LIN

2008, 28(8):  2128-2130. 

Asbtract ( )   PDF (411KB) ( )  

Related Articles | Metrics

With reference to the structure of the network control system in the UUV, the paper analyzed time delay of the network in detail. A math method for message transmission simulation was put forward. Then the simulation of message wait-time delay which is indeterminism was implemented. By the simulation figure, the states of the transmission message can be observed distinctly. Meanwhile the data of the time delay was recorded, which provided the theoretical basis for the design of general performance based on CAN.

Simulation and analysis of MC-CDMA based on Simulink

Kuirs CHEN

2008, 28(8):  2131-2133. 

Asbtract ( )   PDF (595KB) ( )  

Related Articles | Metrics

The MC-CDMA is a new multi-carrier modulating technology for broadband mobile wireless communication，which combined the advantages of OFDM and CDMA. According to the mathematical model of MC-CDMA, a Simulink module was put forward to simulate and study the performance of the basic MC-CDMA and its improvement under multi-path Rayleigh channel, and to simulate its frequency-domain diversity performance.

Design and realization of embedded locale intelligent display system

Dan-Dan XIANG Wei ZHANG

2008, 28(8):  2134-2136. 

Asbtract ( )   PDF (477KB) ( )  

Related Articles | Metrics

After thorough research of the domestic and foreign industrial control field ,the configuration software and the embedded technology, according to the problems in industrial control field that the lowcapacity of information processing and poor adaptability at present, an intelligent display system based on embedded software and hardware platform was put forward, and the development process of intelligent display software was described by using the thoughts of configuration based on ARM9 hardware platform and embedded Linux operation system. The mainly modular design and module architecture were described in detail. This scheme implemented rapid reconstruction function facing different information output environments.

Approach of variability modeling for software product line with UML

DaiZhong LUO WenYun ZHAO Xin PENG

2008, 28(8):  2137-2140. 

Asbtract ( )   PDF (624KB) ( )  

Related Articles | Metrics

This paper introduced UML to software product line. With analyzing variability of product line, we propose an approach of variability modeling for software product line with UML. It not only provides specification of variability type such as option and alternative, but also provides constrains modeling of software product line variability. Finally a case study of variability modeling in mobile software product line was presented to demonstrate our method.

Improved anti-collision algorithm in RFID system

Po Zhang

2008, 28(8):  2141-2143. 

Asbtract ( )   PDF (494KB) ( )  

Related Articles | Metrics

Based on Aloha and binary tree algorithm, this paper proposed an improved anti-collision algorithm in RFID system .When lots of tags need to be identified at the same time, it first estimated the number of unread tags according to the last collision, then divided the tags into different subsets or adjusted the frame size to reduce the collision probability. As a result, the identification efficiency is improved with the proposed method.

Study on audit data acquisition methods oriented to large databases

2008, 28(8):  2144-2146. 

Asbtract ( )   PDF (580KB) ( )  

Related Articles | Metrics

Computer Assisted Audit (CAA) is an active research domain in audit field. Audit data acquisition is a key step of data-oriented computer assisted audit. Common audit data acquisition methods were analyzed, and the benefits and drawbacks of these methods were analyzed. Then, according to the conditions of computer assisted audit used in China and the characteristics of audit data acquisition methods oriented to large databases, audit data acquisition method that fitted large databases was presented. Besides, taking Oracle database as an example, how to use this method was analyzed.

An improved block-matching immune algorithm in fast motion estimation

Hao ZENG Xiujuan GAO Xiaoping ZENG

2008, 28(8):  2147-2149. 

Asbtract ( )   PDF (492KB) ( )  

Related Articles | Metrics

Because of the randomicity of Block match Immune Algorithm (BIA), the number of mismatch block and computation load increase considerably. In the new algorithm, those blocks of being unable to match will be picked out and abolished quickly, so it does not need match error calculating. That means the computation load decreases greatly. At the same time, the selected blocks have more match possibility and results in the more high Peak Signal-to-Noise Ratio (PSNR) and better rebuilt image. At last, the computer simulations verified the advantages mentioned above.

New algorithm on spatial overlaying based on label and its application in embedded GIS

2008, 28(8):  2150-2152. 

Asbtract ( )   PDF (570KB) ( )  

Related Articles | Metrics

To solve the problem of spatial overlaying of Geographic Information System (GIS) data in embedded system, a new spatial operator algorithm based on label was presented. According to the approach, the topological graph was constructed, the labels of the edges were computed, the edges were selected by the rules, and the new geometry was built. The results show the algorithm is applicable not only for the geometries of the same dimension but also for that of different dimension. And it is practicable for embedded GIS system of land survey, and can accomplish alternation at field survey spot and has universal validity.

On methods of cubic spline for modelling of mannequin

XIA Ping

2008, 28(8):  2153-2155. 

Asbtract ( )   PDF (470KB) ( )  

Related Articles | Metrics

According to the characteristics of the closed curve on every section of mannequin， the rectangular coordinates function was converted to the polar coordinates function，cubic spline interpolation conducted，and x, y, z value were converted later again．This method is simple，with less calculation．But fitting model of the shoulder and neck deformated greatly．After analyzing of the reason of large deformation，the parametric cubic spline interpolation method was used for x, y, z respectively on Warps and wefts with accumulative bowstring length as parameter to fit the surface of mannequin． Simulation with OpenGL shows that parametric cubic spline interpolation method can solve the problem of eshoulder and neck deformation， make the mannequin more realistic，and the method is suitable for mannequin model simulation．

WSMF model: Elements decomposed and expressed in code

Ying-Hui HUANG Guan-Yu LI

2008, 28(8):  2156-2159. 

Asbtract ( )   PDF (683KB) ( )  

Related Articles | Metrics

Based on correctly understanding the essence of Web Services Modeling Framework (WSMF), the practical application of WSMF should be summarized to decomposing and coding the WSMF elements. The WSMF is essentially an entity containing four toplevel elements called the Web services, goal, mediator, Ontology, and their interactive relations. The elements and their relations of WSMF are derived from the viewpoints of reusability, decoupling, and semantic mediation service, and are refined and expanded into a hierarchical system of bottomlevel elements according as Web Services Modeling Ontology (WSMO). The WSMF bottomlevel elements are formalized in description by using Web Services Modeling Language (WSML), and then transformed into XML code. An actual Web service is given to illustrate the methods and the process of decomposing and coding the WSMF toplevel elements.

Fast modeling approach of grounding grids for corrosion diagnosis

zhong-kang zhang Jian LIU WANG Shu-Qi

2008, 28(8):  2160-2162. 

Asbtract ( )   PDF (523KB) ( )  

Related Articles | Metrics

In order to achieve a convenient manmachine interface for grounding grids corrosion diagnosis software, a grounding grids topology input edition approach was proposed. An edge edition table with four columns and a node edition table with three columns were introduced to record the processes of input. The operations of adding, eliminating and changing the types of nodes were detailed. The approaches of eliminating redundancy records, compression the sequence numbers of nodes and edges and establishing the relevancy matrix of nodes to branches were described. A grounding grids was used as an example to show the proposed methodologies, the results of which show the feasibility of the proposed approaches.

DBX mail file parsing based on COM technology

2008, 28(8):  2163-2165. 

Asbtract ( )   PDF (439KB) ( )  

Related Articles | Metrics

The E-mail data files kept by Outlook Express (OE) contain the rich personal information. So mining and analyzing the useful clues inside has become a significant means and research area for the computer investigation and forensics. The foremost is to parse the encoded data files, and then restore all the mail information. Aiming at the problem, a solution that we adopt the COM component interfaces of OE to parse these mail data files was presented, avoiding the troubles of research on their encoding format and complex internal logical structure.

A particle swarm optimization algorithm of JSP based on petri net

xiao-bo Yue

2008, 28(8):  2166-2169. 

Asbtract ( )   PDF (495KB) ( )  

Related Articles | Metrics

An improved coding particle swarm optimization algorithm for the job shop scheduling problem was presented, and an effective modeling based on Petri nets was put forward. Analysis and comparison were done on the existing job shop scheduling problem algorithm based on the artificial intelligence algorithm. And the simulation study results show the algorithm is feasible and effective.

Research on QoS-aware Web services composition based on position matrix

Xiao-Yong GONG

2008, 28(8):  2170-2172. 

Asbtract ( )   PDF (612KB) ( )  

Related Articles | Metrics

A method of QoS-aware Web services composition based on Position Matrix was presented. The method using genetic algorithm includes a position matrix coding scheme that can express simultaneously all of the composite paths and replanning information. Only one time running of the proposed genetic algorithm can construct the optimal executive plan and implement the dynamic replanning from a great deal of services compositions with different QoS. The experimental results indicate the feasibility and efficiency of this method.

Trust model in E-commerce based on ESS equilibrium

2008, 28(8):  2173-2176. 

Asbtract ( )   PDF (578KB) ( )  

Related Articles | Metrics

A new model for trust mechanism in E-commerce by introducing concept of ESS equilibrium, which includes a gametheory study of trust in Ecommerce was provided, including a process of trust diffusion and its algorithm. The model finds that an incomplete credit system leads to prevalent distrust behaviors in Ecommerce deals and some factors, like the number of traders choosing trust strategy, convenience of information exchange between traders and payoff difference between honest traders and dishonest traders, determine diffusion of trust in this business. The simulation experiment shows the model improves credibility and fidelity of the trust analysis for Ecommerce trade through overcoming the existing shortcomings of static study. Finally, we suggested some policies including reinforcing trust incentives, increasing comparative advantage in payoff received by honest traders and investing more in information exchange technology, etc.

Modeling of real-time scheduling for distributed embedded systems

Hai-Tao ZHANG

2008, 28(8):  2177-2180. 

Asbtract ( )   PDF (535KB) ( )  

Related Articles | Metrics

Aiming at the deficiencies of RBTPN in modeling real-time scheduling of distributed embedded system, we put forward a new extended time Petri Net model on its base. The model introduces transition rate factor on transitions that need processor resources, and gets working rate function of transitions that have the same priority, so that the model combine preemptive scheduling based on fixed priority and round-robin scheduling on single processor in the scheduling modeling of distributed embedded system Then we gave construction method of the models reachable graph so as to get the characteristics of scheduling sequences.