Table of Content

01 April 2008, Volume 28 Issue 4

Previous Issue    Next Issue

Network and communications

Data scheduling research overview in P2P media streaming

Ya-JIE LIU

2008, 28(4):  829-831. 

Asbtract ( )   PDF (901KB) ( )  

Related Articles | Metrics

Peer-to-peer streaming is costeffective and scalable because it can capitalize the resources of peer nodes to provide service to other receivers. Data scheduling is the key problem in P2P media streaming, as there exist some challenges such as strict QoS requirements of P2P media streaming, instable states and limited resources of peer nodes and so on. The principles and characteristics of three representative data scheduling polices based on single cast tree, multicast tree and random topology were mainly described. The research progress of identifying and searching techniques of peer nodes were also introduced. Finally the directions of research in this area were outlined.

Design and implementation of performance measure tool for stream media applications based on active measurement

2008, 28(4):  832-836. 

Asbtract ( )   PDF (1297KB) ( )  

Related Articles | Metrics

Streaming media application is a key impetus for Next Generation Network (NGN). During the developing of streaming media, streaming media performance monitoring is very important. Several indexes were proposed which can reflect the performance of streaming media application from the perspective of users. The method of measuring these indexes accurately was introduced. The stream media measurement tool based on active measurement was designed and implemented. Some pivotal problems in tool design were analyzed. The robustness and accuracy are validated by experiments.

A novel fast link establishment method for mobile IP communication networks based on mobile Agent

2008, 28(4):  837-840. 

Asbtract ( )   PDF (864KB) ( )  

Related Articles | Metrics

A new method for establishing communication links fast in mobile IP networks for handoff based on mobile Agent was proposed. Combined with Multiple Protocol Label Switching (MPLS) and mobile Agent in the signal processing, an automatic dynamic fast link establishment was achieved, which could reduce the delay dramatically. Simulation shows that transmission delay can be reduced to 27 to 41 percent in switching.

Grid division-based probabilistic localization algorithm for WSN

Jiang Wen-Tao Lian Li Li-Min Sun

2008, 28(4):  841-842. 

Asbtract ( )   PDF (550KB) ( )  

Related Articles | Metrics

The Received Signal Strength Indicator (RSSI)based nodes localization algorithms are extensively applied in wireless sensor networks. Due to the influence of wireless signal attenuation and the channel barrier shielding, the localization accuracy of these algorithms are not high. A grid divisionbased probabilistic localization algorithm was put forward. This new algorithm first divided the area where the unknown nodes may exist into a number of grids. Then, it calculated out the confidence of every grid under the assumption that the unknown node was just in that grid. Finally, it calculated out the coordinates of the unknown node based on several geometric centers of the grids of high confidence. The localization result of this algorithm is less influenced by the noise pollution and is of high position accuracy.

Communication mechanism designed for distributed intrusion detection system

Wen-Wen HUANG Fan Guo Jian Wen

2008, 28(4):  843-845. 

Asbtract ( )   PDF (635KB) ( )  

Related Articles | Metrics

According to the distributed intrusion detection model based on correlation and Agent, a kind of communication mechanism was proposed. With reference to the Intrusion Detection Message Exchange Format (IDMEF), a detailed message system was described for communication Agent, and in accordance with demand expanded XML description. Using the subscription communications model in order to reduce the overhead of communication, subscription logic framework was described. Based on SSL, a security communication mechanism can meet the demand of the distributed intrusion detection system.

Research of a framework of embedded network protocol stack and its application

2008, 28(4):  846-848. 

Asbtract ( )   PDF (662KB) ( )  

Related Articles | Metrics

A network stack framework based on embedded systems named as EPFramework was proposed. In order to improve the portability of the stack, the system abstraction layer was put forward. Connection layer was introduced to maintain the multiconnection management of the stack and the access control. Communication interface layer was introduced to enhance the transaction way between the stack and the application. In order to be compatible with the BSD socket API to make network applications applicable directly in the embedded protocol stack framework, the Socket Lib was designed and implemented. The practical application and the comparison of the variant embedded stacks show that the EPFramework can be more adaptable in different embedded systems.

Multi-node wireless broadcasting retransmission scheme based on network coding

2008, 28(4):  849-852. 

Asbtract ( )   PDF (796KB) ( )  

Related Articles | Metrics

Retransmission is an important technique to ensure the error correction of wireless broadcasting. The combination between network coding and wireless broadcasting scheme was extended to the multinode mode. The combination strategy of multinode based on network coding was studied. By combining several packets, the retransmission was accomplished. One retransmission with coding packets could achieve the goal for numerous original retransmissions. Simulation results indicate that compared with existing schemes, the proposed scheme can effectively reduce the average number of transmissions and is feasible and effective.

Parallel TCP congestion control based on strength control

Lin LIN

2008, 28(4):  853-855. 

Asbtract ( )   PDF (568KB) ( )  

Related Articles | Metrics

The applications based on parallel Transmission Control Protocol (TCP) are widely used with the increase of network bandwidth. When the nodes open seveval TCP connections for one application, it is unfair for the nodes that use single TCP connection. TCPC, a parallel TCP congestion control scheme based on the strength control, was proposed. In this scheme, the TCP connections share the congestion information and restrict the available connection number to control the aggressiveness of the parallel flows. The experimental results show that TCPC can ensure the fairness while effectively using the bandwidth.

Database Technology

Shortest path algorithm confined to conditions in grid data model

xiangyang SHE jingjian Shi

2008, 28(4):  856-859. 

Asbtract ( )   PDF (755KB) ( )  

Related Articles | Metrics

The shortest path question confined in conditions was generalized as the shortest path question confined to point set, the shortest path question confined to edge set, and the shortest path question confined to attribute set. The shortest path algorithm confined to conditions in grid data mode was put forward. In this algorithm, graphic or network was expressed by grid data model, based on greedy idea. In the end, the algorithm was validated by examples. It is shown that the shortest path algorithm confined to conditions in grid data model is completely feasible and effective.

Design and implementation of realtime ETL based on ESB

Bin Gao

2008, 28(4):  860-862. 

Asbtract ( )   PDF (603KB) ( )  

Related Articles | Metrics

Data warehouse technology and its applications develop promptly, accompanying which are the demands by enterprises for shorter data processing delay and realtime requirements. It is a regrettable fact that most existing systems actually fail to deliver such needed features. An Enterprise Service Bus (ESB) based realtime Extract, Transform, and Load (ETL) solution was proposed. The functionalities of ETL were realized as components running on the ESB platform. Realtime partition was created to load realtime records. Experimental results reveal that this design scheme successfully delivers the real time property and meanwhile maintains good versatility and extensibility.

Research and implementation of matching algorithm of grid service based on ontology

2008, 28(4):  863-865. 

Asbtract ( )   PDF (771KB) ( )  

Related Articles | Metrics

In view of the main shortcoming of the existing matching mechanism of grid service, QoSOn was introduced to extend OWLS, then a method of describing and matching the capability of grid service was proposed based on ontology, finally the advantages over the existing grid discovery mechanism in GT4 were analyzed.

Classification method for imbalanced data based on spherical boundary

Zhi-Jun LEI Su-Ling ZHANG Zhen-Xia XUE

2008, 28(4):  866-868. 

Asbtract ( )   PDF (569KB) ( )  

Related Articles | Metrics

Learning from data sets that contain very few instances of the positive class usually produces biased classifiers. They have a higher predictive accuracy over the negative class than that over the positive class (usually the more important class). A classification method for imbalance problem was proposed. The difference error penalties of two classes were introduced and the upper bounds of error rates could be controlled flexibly. The maximum separation ratio was obtained to separate two class instances with a single hypersphere, so the accuracies of classification and prediction over the positive class would be improved. Experiment results show that the method can effectively enhance the classification performance on imbalanced data sets.

A new structural join algorithm in Native XML database

ZHNAG Peng Jian-Hua FENG Zhi-Feng FANG

2008, 28(4):  869-871. 

Asbtract ( )   PDF (782KB) ( )  

Related Articles | Metrics

Structural join operation is the main solution to Native XML database query. Based on the survey of existing structural join algorithms, a new structural join algorithm, depth partition based structural join algorithm (DRIAM) was proposed. In DRIAM, input data sets AList and DList were not necessary to be ordered or indexed so that the additional cost was avoided. AList and DList were not necessary to be loaded in the memory. Besides, the timecomplexity of DRIAM was very low.

Attribute reduction method based on zero value principle

2008, 28(4):  872-873. 

Asbtract ( )   PDF (528KB) ( )  

Related Articles | Metrics

Based on matrix reduction algorithm for information system introduced by Guan, a new improved computational method of attribute reduction was presented. According to the characteristics of operation between matrixes, the computation was simplified by introducing only the concept of zero value. This method was proved to be equal to attribute reduction by discernable matrix. At last, the method was applied to complete decision table. Its correctness and effectiveness are shown in an example.

Research on scheduling algorithm of broadcast data in mobile database broadcasts

2008, 28(4):  874-876. 

Asbtract ( )   PDF (601KB) ( )  

Related Articles | Metrics

The model of mobile computing and the broadcast technology of mobile database were described. A classic multidisk broadcast scheduling algorithm in mobile broadcast domain was introduced. Based on the scheduling algorithm of multidisk, linear programming was applied to optimize the design of broadcast data. Furthermore, the schedule was optimized by scheduling algorithm.

Design and implementation of large data buffer based on multithreading using dynamic feedback

Jian-Su LIN Yong ZHONG Jie DING

2008, 28(4):  877-880. 

Asbtract ( )   PDF (736KB) ( )  

Related Articles | Metrics

The designing principle of large data driver buffer was studied. Ordinary data transfer strategies have their limitations either in time efficiency or performance stability. A multithreading positive waiting strategy based on dynamic feedback was proposed. Firstly, multithreading data transfer scheme was implemented in the form of main thread's positive wait. For high performance guarantees under unpredictable workloads condition, dynamic feedback was imported to balance the data and instruction transfer between server-to-driver and driver-to-client.

Research on Web service discovery technology based on semantic

Xiao-Guo ZHANG

2008, 28(4):  881-883. 

Asbtract ( )   PDF (607KB) ( )  

Related Articles | Metrics

Web service description and discovery technologies were researched. Then OWLS was extended and a Web service discovery algorithm was proposed because the presently available service discovery mechanism has weaker quality of service description, less service classification, narrower match scope and lower efficiency. Web services were described using tree structure, different weights to nodes were given according to certain strategy and services were stored by classification. Web services requests were pretreated and oriented services classifications were located firstly, then the Web services were matched by using certain semantic similarity calculation method based on WordNet or HowNet and using assistant technology. The experiments prove that this algorithm has higher precision and recall than others.

Information security

Research on multi-attributes quantization model of dynamic trust relationship

Xiao-yong LI

2008, 28(4):  884-887. 

Asbtract ( )   PDF (875KB) ( )  

Related Articles | Metrics

Focusing on the problem that current dynamic trust models using simple decision attributes compute trust degree between peers leads to failure outcome of trust decision, a novel dynamic trust quantization model was proposed. Multiple decision attributes were incorporated to reflect trust relationships complexity and uncertainty in various angles, which made the model have a better rationality and a higher practicability. Simulation results show that, compared to the existing trust models, this model has remarkable enhancements in the accuracy of trust decision and dynamic adaptability.

Toral automorphisms mapping and anti-toral transformation analysis

2008, 28(4):  888-891. 

Asbtract ( )   PDF (847KB) ( )  

Related Articles | Metrics

Toral automorphisms mapping is a transform technology widely applied in digital image scramble. On certain condition the result can be reverted by controlling the transformation time because of the periodicity of the toral automorphisms transformation. In methods to this transformation, its application and generalization are mostly confined to the scrambling of the period and the huge time cost of the reverting. Therefore, the antitoral transformation was studied. At first the transformation was proved to be bijective, and then the common expression of the antitoral transformation was given. In the end, the experiment testifies that antitransformation reverting is better than the periodicity reverting.

Dynamic programming-based strategy for automated trust negotiation

2008, 28(4):  892-895. 

Asbtract ( )   PDF (775KB) ( )  

Related Articles | Metrics

Dynamic programming, an approach to solve the optimal question, was introduced into automated trust negotiation. The disclose cost was introduced to solve the problem of treating all credentials with the same sensitivity and the same format. A negotiation strategy modeled on AND/OR graph was proposed under the idea of dynamic programming to achieve the global optimization. The strategy achieved the minimal cost disclose sequence by traversing the AND/OR graph upward. The strategy is proved to be adoptable and efficient to ensure the safety and efficiency of the negotiation.

Alert aggregation algorithm based on genetic clustering algorithm

Li-Qiong XIONG

2008, 28(4):  896-898. 

Asbtract ( )   PDF (822KB) ( )  

Related Articles | Metrics

An alert aggregation algorithm was proposed, in which alerts of Intrusion Detection System (IDS) based on genetic clustering algorithm were aggregated. To convert the dissimilarity between two alert attributes into the value range of [0.0, 1.0], the dissimilarity of two alerts was represented by using a dissimilarity matrix; the more excellent clustering centers were chosen by the genetic algorithm, and the similar alerts would be clustered according to the dissimilarity matrix. Hierarchical aggregation method was adopted for every kind of alerts to aggregate according to the results of clustering. The experimental results show that the repeat alerts can be decreased effectively by this method.

Blind steganalysis algorithm based on correlation and SVD techniques

FENG Fan

2008, 28(4):  899-901. 

Asbtract ( )   PDF (660KB) ( )  

Related Articles | Metrics

Aiming at the steganographic model with the additive noise in the block-DCT (Discrete Cosine Transform) domain, a new blind steganalysis algorithm based on the Singular Value Decomposition (SVD) techniques was proposed. A new mathematical model was constructed, accounting for inter and intra-block correlations of the DCT coefficients. Using the SVD technology, the features of the images were extracted, and the eigenvector was built. The discrimination function was presented for detection the secret messages of the digital images without knowledge of original cover images. The experimental results show that the reliability rate of the detection is 90%, and its general performance is superior to that of the general detection algorithm.

A new image hiding scheme based on multi-secret sharing

Han-Jun GAO

2008, 28(4):  902-905. 

Asbtract ( )   PDF (956KB) ( )  

Related Articles | Metrics

Combining multi-secret sharing with Least Significant Bit (LSB) algorithm, a new image hiding scheme was proposed. This scheme reduced the size of each shadow image to become nearly 1/t of the secret image’s, consequently reduced the size of cover images. According to (t-1) polynomial modulus p which was arbitrary, this scheme spliced some pixels of the secret image into a data unit so that the drawback was overcome that the image should be permutated before it was shared. Besides, the amount of polynomials in this scheme is smaller than that of Thiens and Li Bai’s.

Image encryption scheme based on TD-ERCS

2008, 28(4):  906-909. 

Asbtract ( )   PDF (1355KB) ( )  

Related Articles | Metrics

A new image encryption scheme based on Tangent-Delay Ellipse Reflecting Cavitymap System (TD-ERCS) was proposed. In the proposed scheme, an external secret key of 64-bit and a TD-ERCS were employed. The initial condition for the TD-ERCS were derived using the external secret and then random numbers in [-1, 1] were generated. The range [-1, 1] was divided into 32 non-overlapping intervals and arranged into eight different groups. Further, eight different types of operations were used to encrypt the pixels of an image and one of them was used for a particular pixel decided by the outcome of the TD-ERCS. After encrypting each block of 24 pixels of the image, the secret key was modified. The simply designed encryption scheme can work on digital image at any size, while its high security to certain analysis and attack method is proved by statistical analysis and key sensitivity tests.

An intrusion tolerant protection scheme of CA private key

bai hao

2008, 28(4):  910-911. 

Asbtract ( )   PDF (577KB) ( )  

Related Articles | Metrics

Protecting the Certificate Authority (CA) private key is the key issue of the whole Public Key infrastructure (PKI). Based on RivestShamirAlleman (RSA) and (t, n) secret shared method, the two phrase signature scheme was used to ensure that the private key never be reconstructed at any time. At the same time, in the process of CA generation, delivery and usage, even if some part of the CA was broken, the CA private key was still safe, and CA still could work. At last, the system was realized by VC and Openssl.

A Novel Robust Algorithm for Digital Image Fingerprinting

Xiao-Ming YAO

2008, 28(4):  912-914. 

Asbtract ( )   PDF (525KB) ( )  

Related Articles | Metrics

Digital fingerprint is a very important tool for copyright protection and copying control of digital products. The permissible user copies, the authenticated serial number and the copyright mark code are used as the basic content of the fingerprint, and the typical attacking is modeled as a process of binary stochastic noisy channel communication in this paper. The anti-attacking ability of the fingerprint is strengthened by means of such technique processes as encryption/decryption, error-correction coding, chaotic mapping for scrambling the image sub-blocks, feature-value based sub-block pickup and DCT-based fingerprint embedding into its transforming coefficients. The fingerprint extracting process needs the initial value of the chaotic mapping as the secret key, and also the original image. StirMark Benchmark testing results have substantiated its strong robustness.

A new certificateless proxy signature

2008, 28(4):  915-917. 

Asbtract ( )   PDF (556KB) ( )  

Related Articles | Metrics

The existing proxy signature schemes are based on certificate public key cryptography and identitybased cryptography, which have the problems of certificate management or key escrow. Based on the merit of certificateless public key cryptography, a new certificateless proxy signature was proposed. The result shows that the new proxy signature scheme solves all the problems of certificate management and key escrow, and also satisfies all the required characteristics of proxy signature. It is more efficient than the existed IDbased proxy signatures.

A ID-based revocable group signature scheme

2008, 28(4):  918-920. 

Asbtract ( )   PDF (535KB) ( )  

Related Articles | Metrics

In the case that third parties can not be trusted, the traditional ID signature security system does not suit for the group signature. A secure IDbased group signature scheme was proposed. Even when the Key Generation Center (KGC) was implausible, its safety could be ensured, and the group members could be safely added or deleted without changing the keys of other effective group members and public group key. At the same time, the lengths of key and signature were unrelated to the number of group members.

Determination of digital watermarking optimal detection threshold based on asymptotically optimal detector

2008, 28(4):  921-923. 

Asbtract ( )   PDF (922KB) ( )  

Related Articles | Metrics

The magnitude of detection thresh will influence the effect of watermarking detector. The asymptotically optimal detector is a blind watermarking detection adopting Rao test, but its detection thresh is determined by experience. In order to make asymptotically optimal detection thresh more objective and accurate, the minimum error probability criterion was analyzed. The detection thresh based on asymptotically optimal detector was theoretically deduced to gain an expression of optimal detection thresh which made error rate of watermarking detection system lowest. Simulation results indicate that this method is adaptive and objective and can make error rate of watermarking detection system theoretically minimum.

Extended RBAC model supporting dynamic role switching

2008, 28(4):  924-926. 

Asbtract ( )   PDF (524KB) ( )  

Related Articles | Metrics

Dynamic role switching is a kind of automatic authorization mechanism that the information system partly or wholly changes the userrole assignments based on the changes of users attributes. The dynamic role switching was introduced into RBAC96 model. Different forms of the dynamic role switching, the relationships between the different switchings, and the realization of the extended model were presented. Based on the dynamic role switching, the information system can deal automatically with the situation of the userrole assignments triggered by the role switching condition. There is no need for the human being to participate in the role switching process. Therefor, dynamic role switching can lessen the work load of the system administrator and improve the efficiency and security of the authorization administration.

Artificial intelligence

Research on regulation of gene expression in E-Cell

Xin-Hua LU Ji-Gui Sun

2008, 28(4):  927-930. 

Asbtract ( )   PDF (1133KB) ( )  

Related Articles | Metrics

The regulation of gene expression determines the quantity, structure and functions of proteome that are translated by the genetic information of genome and affect the life activities of cells. Existing electronic cell (E-Cell) models seldom relate to simulation on the regulations of gene expressions. In this paper, the E-Cell model named Analog-Cell was proposed. It simulated the main regulation mechanisms of gene expression through defining regulation factors, enzymes and rational reaction rules. Thus Analog-Cell realistically represents the procedure of gene expression and obtains recommendable simulation results.

Migration differential evolution ensemble and its application in predicting RNA secondary structure

2008, 28(4):  931-934. 

Asbtract ( )   PDF (915KB) ( )  

Related Articles | Metrics

A comparative study of optimization and nomadic migration shows that there are similarities between the two processes. Migration strategy was proposed by the simulation of nomadic migration, and the capability of overcoming local extremum was improved. At the same time, the algorithm with ensemble technique sufficiently exerted the advantages of different differential evolution and carried out harmonious evolution, and the global search capability of the algorithm was enhanced. Finally, the new algorithm has been used to predict RNA secondary structure; the experiments show that the algorithm is effective.

An approach to multicriteria decision-making based on interval-valued intuitive fuzzy set with incomplete information

Tian-Hu LIU

2008, 28(4):  935-938. 

Asbtract ( )   PDF (697KB) ( )  

Related Articles | Metrics

A multicriteria ranking method was proposed in which the information on the criterias weights was incomplete and the criterias value was interval intuitive fuzzy set. The intervalvalued intuitive fuzzy set of each program was aggregated through logical algorithms. The Hamming distance of each program was computed and nonlinear programming model was established. By using particle swarm optimization algorithms, the optional criteria weights were gained. And ranking was performed through the comparison of the distances between intervalvalued intuitive fuzzy set and superior program & inferior program alternative. Eventually, a practical example was provided to illustrate the validity and feasibility of this method.

Novel genetic algorithm with multi-elitist preservation method

Can ZHU

2008, 28(4):  939-941. 

Asbtract ( )   PDF (589KB) ( )  

Related Articles | Metrics

A novel genetic algorithm with several elitists preserved was proposed. The population was divided into two parts according to the distances between individuals and the current individual. One was the optimal population of current generation, and the other aggregated hypoopt individuals. This method can enhance local searching performance by bounding constrained optimal population and can raise the population diversity by introducing selfadaptive mutation probability in hypoopt population. Some numerical tests have been made and the results show that the algorithm is effective.

HITS-based topic sensitive crawling method

Zongli JIANG Xueke XU Shuai LI

2008, 28(4):  942-944. 

Asbtract ( )   PDF (840KB) ( )  

Related Articles | Metrics

Topic crawler is a new and practical application in the field of information retrieval. The main idea is to selectively collect Web pages on a predefined topic and avoid downloading irrelative Web pages in order to find more accurate and useful information for the user. Several key issues of topic crawler were discussed and corresponding new approaches were proposed. Then a topic crawler system was designed and implemented, employing topic sensitive Hyperlink-Induced Topic Search (HITS) to predict the priority of fetched Web pages. The experiments show our system performs well.

Technology for Chinese text categorization based on reverse matching algorithm

2008, 28(4):  945-947. 

Asbtract ( )   PDF (577KB) ( )  

Related Articles | Metrics

Concerning Chinese text categorization, a reverse matching algorithm was proposed. The basic idea was to construct a weighted value of classification subject terms list firstly, then use keywords in the list to reverse match in documentations. After that, the sum of weights of these key words that had been matched successfully was calculated, in the end the maximum was taken as the result of the classification. The algorithm can avoid the difficulty of Chinese word segmentation and its influence on accuracy of result. Theoretical analysis and experimental results indicate that the accuracy and the time efficiency of the algorithm are higher, whose comprehensive performance reaches to the level of current major technology.

Finding near replicas of Web pages based on Fourier transform

Jin-Yan CHEN Ya-Ping ZHANG

2008, 28(4):  948-950. 

Asbtract ( )   PDF (495KB) ( )  

Related Articles | Metrics

Removing duplicated Web pages can improve the searching accuracy and reduce the data storage space. Current deduplication algorithms mainly focus on keywords deduplication or semantic fingerprint deduplication and may cause error when processing Web pages. In this paper each character was mapped into a semantic value by KarhunenLoeve (KL) transform of the relationship matrix, and then each document was transformed into a series of discrete values. By Fourier transform of the series each Web page was expressed as several Fourier coefficients, and then the similarity between two Web pages was calculated based on the Fourier coefficients. Experiment results show that this method can find similar Web pages efficiently.

Algorithm for solving K-shortest paths problem in complicated network

Liu Jia Shaofang Xia Yanan Lv Lichao Chen

2008, 28(4):  951-953. 

Asbtract ( )   PDF (897KB) ( )  

Related Articles | Metrics

Focusing on the optimization problems about complicated network, an algorithm named KSPA (K-Shortest Paths based on A*) was proposed to solve the K-shortest paths problem in complicated network. The time cost was taken as target function and the establishment of the target function model was given. Experimental results show the KSPA algorithm proposed can be used to solve the K-shortest paths problems quickly in multi-graph.

Solving TSP with improved multi-Agent genetic algorithm

2008, 28(4):  954-956. 

Asbtract ( )   PDF (535KB) ( )  

Related Articles | Metrics

Based on agents capability of perceiving and reacting on environment, MultiAgent Genetic Algorithm (MAGA) was proposed as a new method of function optimization. MAGA had a rapid convergence velocity especially when it optimized superhigh dimensional functions. This algorithm was improved properly based on its characteristics: elitist reservation strategy was adopted in neighborhood orthogonal crossover operator, and neighborhood orthogonal crossover operator was introduced into selflearning operator and small mutation probability was adopted to quicken the convergence speed. The results of solving Traveling Salesman Problem (TSP) show that the performance of improved MAGA is enhanced greatly.

Graphics and image processing

Improved algorithm for estimating disparity using non-uniform mesh

Shu-Kai Wu Si-Dan Du Hua LI

2008, 28(4):  957-959. 

Asbtract ( )   PDF (1065KB) ( )  

Related Articles | Metrics

The stereo video needs compression before transmission. Besides eliminating the temporal redundancy as in the mono-channel video, it can further reduce the data by eliminating spatial redundancy between different channels, so the disparity estimation is the key technique for the compression of the stereo video. A new algorithm was proposed for estimating disparity vector using non-uniform mesh. It combined parts of the merits of the standard mesh and the mesh attached to object boundary, selected the rows and the columns with the highest sum of the gradient values, and used their cross points as node points, then further eliminated the points in the area lack of textures, at last it used both of block iteration and mesh iteration to match these nodes. This algorithm eliminates the points that are hard to match precisely, and reduces the node points at the same time. The experimental result shows that this algorithm improves the matching quality, and reduces the computational complexity.

An improved FastICA algorithm and its application

Wu GU Run-sheng WANG

2008, 28(4):  960-962. 

Asbtract ( )   PDF (863KB) ( )  

Related Articles | Metrics

Independent Component Analysis (ICA) is a signal analysis method based on high order cumulants of signals and it can find out the latent independent components in data. Recently ICA has been widely used in many fields such as speech recognition, image processing, telecommunication system etc. The FastICA is the most popular algorithm for ICA at present, and it uses Newton rule to optimize the objective function. This algorithm can converge speedily but is not robust to initialization. In order to overcom the drawbacks, one dimension search was imposed on the direction of Newton iterative. The improved algorithm can ensure the convergence of the results and is robust to initialization. When the improved algorithm is used to detect the moving target, the experimental results show that it is a robust method.

A point model simplified method based on mean-shift clustering

Xiao-Ye CAO zhi-yan wang Ying-Hong Liang Xiao-Wei Xu

2008, 28(4):  963-965. 

Asbtract ( )   PDF (564KB) ( )  

Related Articles | Metrics

To efficiently simplify the densely sampled point model, a point sample data reduction method was proposed based on the mean-shift clustering algorithm. Local mode centroids were calculated by mean-shift iterative process. These mode centroids substituting for ambient data points were used to simplify the model. Experiment results show that the algorithm can effectively simplify the densely sampled point model, the reduction speed is fast, and the simplified model can preserve the original geometric shape.

Feature list object matching based on oriented SUSAN features

Zhi-Jun PEI

2008, 28(4):  966-968. 

Asbtract ( )   PDF (958KB) ( )  

Related Articles | Metrics

For the machine vision object matching, the feature list correlation algorithm can be adopted in the calculation of the matching similarity measurement. As a result, the processing time is able to be decreased considerably, and the objects can also be clearly recognized due to the high values of the coefficients and the high values of the Peak SignaltoNoise Ratio (PSNR). A feature list object matching method based on the oriented Smallest Univalue Segment Assimilating Nucleus (SUSAN) features was proposed. The feature pixels with oriented SUSAN features were added to the feature lists and the similarity was based on the normalized absolute error of feature pixel points. The supposed algorithm is verified by the experiments.

Improved order-invariant watershed algorithm for image segmentation

Shi-Tong WANG

2008, 28(4):  969-972. 

Asbtract ( )   PDF (876KB) ( )  

Related Articles | Metrics

Creative lake minimum was introduced to represent topographical information of a pixel, so as to reduce the number of RIDGE labels in orderinvariant watershed algorithm. Watershed fall was used to reduce the number of over-segmented regions. This algorithm was implemented in both immersion and toboggan ways. Experiment results show that the proposed algorithm is still order-invariant, and it can reduce the number of RIDGE labels by about 80% as well as segmented regions by 5%~20%.

Robust detection of moving objects from a moving platform: A sensor fusion approach

孙浩

2008, 28(4):  973-975. 

Asbtract ( )   PDF (1023KB) ( )  

Related Articles | Metrics

Robust detection of moving objects from a moving platform is required for lots of applications, but is not easily achievable with vision sensor alone. A multiple sensor fusion scheme was proposed to overcome the shortcomings of single sensor. With the aid of inertial sensor and range sensor, a coarsetofine strategy was adopted to locate the moving objects in the video sequence. The image measurement after registration was used to suppress the drift problem of the inertial sensor in the framework of extended Kalman filtering in order to make the system work well for long time. Experimental results demonstrate the effectiveness of the proposed algorithm.

Fast motion estimation algorithm based on redundant discrete wavelet transformation

2008, 28(4):  976-978. 

Asbtract ( )   PDF (573KB) ( )  

Related Articles | Metrics

Because the redundant discrete wavelet transformation is shift invariant, the motion estimation algorithms in the redundant wavelet domain have good effect, but very high computational complexity. Based on the analysis of the motion characteristics of video sequences and the existing motion estimation algorithms, a fast motion estimation algorithm based on redundant discrete wavelet transformation was proposed. The potential motion blocks were identified and divided into different degrees of motion. The motion estimation with different searching methods for motion blocks with different motion characteristics decreased the searching area efficiently in the redundant wavelet domain. The experimental results prove that this approach has a superior performance in terms of the computational complexity.

New method of video-based moving vehicle extraction based on seeded region growing

Dac-Binh HA

2008, 28(4):  979-981. 

Asbtract ( )   PDF (1062KB) ( )  

Related Articles | Metrics

It is an important and key part to extract moving vehicle in intelligence transportation system. A new, simple and fast method was proposed to extract moving vehicle from video based on seeded region growing. Gray approximation was estimated from difference image, and all pixels belonging to background and shadow were removed. Experiment results confirm that this proposed method is efficient and reliable, and its computation cost can also satisfy the vehicle recognition system.

Boundary extracting algorithm for image sequence using a novel Snake model

Ma-Jianlin

2008, 28(4):  982-985. 

Asbtract ( )   PDF (1576KB) ( )  

Related Articles | Metrics

Boundary extraction and segmentation for Region of Interest (ROI) of medical image is an important prerequisite for analyzing, understanding and handling the images. In traditional algorithms, Snake curve initialized manually was inaccurate and easily attracted by the complex background. In order to overcome these shortcomings, a boundary extracting model of image sequence was proposed based on Snake model for medical image sequence with irregular region and complex features. Approximate boundary of image sequence was extracted by using similarity principle, and then the boundary was divided into four sub-boundaries. The sample points in the subboundaries keep the points balanced between the sub-boundaries. Lastly, these points were taken as the input of the contour searching in the Snake model, and the inner and external energy functions based on traditional Snake model were improved and dispersed. The experimental results show that the new method could extract boundary of the complex and abnormal regions in medical images, and has great robustness and practicality.

An improved algorithm of face detection

2008, 28(4):  986-989. 

Asbtract ( )   PDF (1632KB) ( )  

Related Articles | Metrics

Based on the related technique proposed by ReinLien Hsu, Mohamed AbdelMottaleb and Anil K. Jain(denoted as Hsus method simply), an improved algorithm of face detection was proposed for color images. The original images were preprocessed by the related technique. In order to reduce the computational complexity of Hsu's method, the parametric ellipse mode was replaced by the Gaussian distribution model, which led to the fast face detection without affecting the detection accuracy. A method of selecting the skin threshold based on the combination of selfadaptive process and histogram was more accurate. In order to extract the face areas accurately, the eyes were detected in the previously extracted subimages. Experimental results demonstrate successful face detection under complex conditions. The proposed method is much faster than Hsu's method.

Genetic algorithm-based multiscale segmentation of SAR image

Liu Bao-li

2008, 28(4):  990-992. 

Asbtract ( )   PDF (697KB) ( )  

Related Articles | Metrics

An effective unsupervised multiscale segmentation of Synthetic Aperture Radar(SAR) imagery based on Expectation Maximization (EM) and Genetic Algorithm(GA) was proposed. The statistical variations between pixels of scale-to-scale and same scale in SAR imagery were described due to radar speckle for the Mixture Multiscale AutoRegressive(MMAR) model, then the estimation of parameters in MMAR model was given by combining GA with EM algorithm. The number of components of the model was selected by using the Minimum Description Length (MDL) criterion and the segmentation of SAR imagery was implemented. This approach benefits from the properties of GA and the EM algorithm by combining of both into a single procedure. The local optimal solutions were avoided with less sensitivity to its initialization. The experiments on SAR images show that the GA-EM outperforms the EM method.

Color image inpainting based on total variation model

Fu-mei ZHANG

2008, 28(4):  993-994. 

Asbtract ( )   PDF (490KB) ( )  

Related Articles | Metrics

The goal of digital image inpainting is to restore damaged regions or remove objects in the image. Both Tural Variation (TV) method and a basic coupled method for color image were analyzed. According to a basic coupled method for color image, color images were processed based on the total variation method, which was used in inpainting gray images. Experimental results show that the improved channel coupled diffusion model is better in inpainting lost block information and removing odd objects, keeps better edges, and is effective for image denoising in color image.

Novel level set approach for medical image segmentation based on region competition model

Xiang-Wen Chen Wei-Dong Zhao

2008, 28(4):  995-998. 

Asbtract ( )   PDF (1068KB) ( )  

Related Articles | Metrics

Traditional level set method based on gradient model has the leaking problem during the curve evolution. A level set method based on region competition model was proposed to solve this problem. Firstly, the probabilities of the level set curve that belonged to the object region and background region were calculated respectively using probability distribution equation; Secondly, the difference of the foreground and background probabilities and weights were added to the level set function to minimize the energy function during the curve evolution; Finally, the images regional information could be used to identify the object boundary. Experimental results show that the proposed method can segment the medical image well.

Binarization algorithms of fingerprint images based on orientation and fuzzy theory

Hong-Yan YANG

2008, 28(4):  999-1000. 

Asbtract ( )   PDF (590KB) ( )  

Related Articles | Metrics

Based on the research on binarization algorithms of fingerprint images, a new binarization algorithm of fingerprint images based on the orientation and fuzzy theory was put forward. The method made full use of the orientation and the characteristics of grayscale change and demonstrated the excellent capability of noise resistance.

Method for binarizing and post-processing fingerprint image based on orientation information

2008, 28(4):  1001-1005. 

Asbtract ( )   PDF (1495KB) ( )  

Related Articles | Metrics

Fingerprint image binarization, as an important part of fingerprint image preprocessing, is the precondition of fingerprint identification. In order to utilize the texture feature of the fingerprint images effectively, the orientation information was introduced into fingerprint image binarization. After considering the fingerprint image orientation information and adaptive local threshold synthetically, a complete set of adaptive local threshold binarization and postprocessing algorithm was brought forward combined with the orientation information. The experimental results indicate that the presented algorithm can achieve better binarization effects than the adaptive binarization algorithm. Moreover, the algorithm has good capability of repairing the disconnected line, eliminating the holes and removing crossed lines in the fingerprint images to a certain extent, which has important significance for improving the precision of minutia extraction.

Fast intra prediction mode decision algorithm in H.264/AVC

Liang LUO Chun-sheng LIU Lu-ming ZHOU

2008, 28(4):  1006-1008. 

Asbtract ( )   PDF (639KB) ( )  

Related Articles | Metrics

A fast mode decision algorithm was presented for H.264/AVC intra prediction based on the feature of the block and neighboring block's mode information. The number of candidate mode was reduced, for 4×4 luminance block, from 9 to 1~4. Experimental results show that, compared with the H.264 encoder JM8.6, the proposed scheme reduces coding time by 50%~60% for Iframe while keeping PSNR and bit rate almost unchanged.

An adaptive joint control algorithm of frame-rate and coding-rate

2008, 28(4):  1009-1011. 

Asbtract ( )   PDF (658KB) ( )  

Related Articles | Metrics

It is difficult to transmit the video data in lowspeed narrowband wireless channel and guarantee the subjective quality of video image during video communication. Firstly, the Gilbert channel model was adopted to predict the effective network bandwidth at next moment. Then, the TMN8 rate control algorithm was improved. Finally, according to the classification of video movement and the estimated channel rate, selfadapting adjustments were conducted on video framerate and codingrate. The experiments show that the proposed algorithm has 2dB higher Peak Signal-to-Noise Ratio (PSNR) and has better subjective video quality than TMN8 algorithm.

Audio retrieval with frame coefficients of wavelet packet best base and pyramidal algorithm

LI Ying

2008, 28(4):  1012-1015. 

Asbtract ( )   PDF (972KB) ( )  

Related Articles | Metrics

To solve the problem of query-by-example in multimedia audio data, the characteristics of wavelet multiresolution, wavelet packet transform and its best base were analyzed. A method for audio retrieval was proposed using wavelet frame coefficients of packet best base and wavelet multiresolution pyramidal algorithm. First, audio data files were prepocessed by transforming them into frame coefficients of best base and wavelet coefficient files with audio data. And then elementary classification for these files was carried out using frame coefficients of best base, and after that these files were searched using the different hierarchy pyramidal algorithms. By comparing our method with the method using different level wavelet approximate coefficient algorithm, it is found that our method is highly efficient and reduces the searching time without influencing the retrieval precision.

Signal denoising based on enery distribution characteristic and wavelet division

2008, 28(4):  1016-1017. 

Asbtract ( )   PDF (576KB) ( )  

Related Articles | Metrics

Wavelet division method keeps image detail while it blurs detail. Wavelet coefficients own similarity of energy distribution in high frequency sub-images acquired by multilevel wavelet transformation. A new denoising algorithm was proposed based on energy distribution characteristic and division method. The experiments show that this algorithm can restrain noise and decompose image more effectively and has higher Signal-to-Noise Ratio (SNR) than division method.

Software process technology

Testing case generator based on formal specifications

2008, 28(4):  1018-1022. 

Asbtract ( )   PDF (974KB) ( )  

Related Articles | Metrics

According to the requirements of validating higher secure systems, an approach to generate testing cases based on Z formal descriptions was proposed. With this approach, a testing case generator was implemented, which could produce testing cases with MC/DC (modified condition/decision coverage) criterion to balance the quantity and quality of the produced testing cases. Compared with related work, this approach can reduce the manual interferences and the requirements in designing the formal specification, and improve the accuracy and efficiency of testing-case generation.

A testing method balancing structural testing and functional testing

Pu Yun-Ming

2008, 28(4):  1023-1025. 

Asbtract ( )   PDF (592KB) ( )  

Related Articles | Metrics

After advantages and disadvantages of the structural testing and functional testing were analyzed, a model balancing the structural testing and functional testing was proposed. It was definitionusage testing method that defined a testing coverage criterion between full path and full edge. This method provided a system method to check software defaults. The simulation results show that the definitionusage method can improve the software testing efficiency.

An optimized test ports selecting method under power constraint in NoC

2008, 28(4):  1026-1028. 

Asbtract ( )  

Related Articles | Metrics

An optimized test ports selecting method was proposed, in which the number and location of input/output pairs under power constraint could be determined. To make the length of all the core test paths shortest, the optimized location of the Network on Chip (NoC) test ports were selected. With the constraint of the max permitted power in the test, the number of the test ports pairs was chosen as large as possible. Thus the test of the cores could be accomplished with high performance, and the apparatus damage in the test could be avoided effectively. Experimental results show that the efficiency of the test is improved and the overall cost in the NoC test is decreased.

Dynamic loading technique for software of wireless sensor network

2008, 28(4):  1029-1031. 

Asbtract ( )   PDF (670KB) ( )  

Related Articles | Metrics

Based on the design of Arena operating system, an overall framework for dynamically loading software of a wireless sensor network was proposed. The techniques for designing interface to the dynamic object loader were described in detail. This design reduced the runtime mirror of the core, and allowed dynamic loading and unloading of function modules of the system, and guaranteed longtime reliable system service and high configurability. Experiment results show the feasibility of the framework, and the ease of post updating and maintenance of system software.

Path-oriented automatic random testing method based on double constraint propagation

Yuan-Dong HUANG Rui-lian ZHAO

2008, 28(4):  1032-1034. 

Asbtract ( )  

Related Articles | Metrics

Random testing is a widely used method of automatic software testing. It selects test data from the input domain at random, so it is easy to actualize automatically. However, the likelihood of finding adequate test data randomly to meet a certain testing criterion is extremely low. Therefore, a pathoriented automatic random testing method based on double constraint propagation (DCPART) was proposed. For a given path, its domain could be gained by splitting a input variables domain and executing doubly constraint propagation algorithm. Moreover, a corresponding test data generator was developed and the empirical work was conducted on a number of programs. Experimental results show that the method can compute path domain more accurately than PRT method, and random testing efficiency can thus be remarkably enhanced.

Web Services transaction model and protocol research

2008, 28(4):  1035-1038. 

Asbtract ( )   PDF (868KB) ( )  

Related Articles | Metrics

A transaction handle model was proposed, in which transaction logic was separated from the client's business logic. It simplified the implementation of the client and enhanced software modularity and reusability remarkably. The coordination algorithm and state transition were researched, furthermore active consciousness was introduced into participant, and coordination protocols were extracted, to make the handle model closer to the real business situation. By using configuration information, the handle model will know how to do the transaction in expected scope when exception occurs, and it can enhance the support of the business activities in Web Services environment.

Platform independent embedded multi-format parsers and pivotal problems

Qin-cheng LI Lei ZHANG

2008, 28(4):  1039-1041. 

Asbtract ( )   PDF (630KB) ( )  

Related Articles | Metrics

With the development of the Epaper technology, mobilereader becomes a necessity, and the most important thing of it is format-parser. There are so many kinds of format, that have respective characteristics and many versions, so that designing a system contained multiformat parsers is the pivotal technology. A system scheme containing multiformat parsers was proposed. It could solve the pivotal problems: how to make multi-parsers compatible, realize the expansibility and the platform independence, read big pages on small screens, and improve the speed of display. This system that has been validated on the platform of a company was proved feasible.

Research and implementation of information sharing system based on LDAP

2008, 28(4):  1042-1044. 

Asbtract ( )   PDF (634KB) ( )  

Related Articles | Metrics

The computer application systems constructed in different time use different technologies and run on the different platforms. The focal point is the information sharing. The Lightweight Directory Access Protocol (LDAP) server organization was used to share metadata of the information resource. Resource supervisor, data extractor and news main line were realized by object buffer pool, multithreading and news main line. The complex structure of rockbottom shielded by system engine and the XML technology was unified to solve problems of multi-template demonstration and sharing information alternately. The information share in Internet environment between the different application systems has been realized effectively.

Research and implementation of networking framework based on Symbian platform

Da-Ping ZHANG Hong ZHONG

2008, 28(4):  1045-1048. 

Asbtract ( )   PDF (1077KB) ( )  

Related Articles | Metrics

The problems in network programming and mobile platform development were analyzed, and the weaknesses of ACE and J2ME in mobile development were figured out, finally the framework technology was put forward to reuse software components for Symbian platform. Symbian Networking Framework (SNF) was presented to solve the problems such as diversity of network connection, message framing, log service and so on. Compared with ACE and the effect achieved in a real life project, SNF can provide maturity and validity and is suitable for mobile development platform.

Analysis of data queue in multiprocessor system-on-chip at transaction level

2008, 28(4):  1049-1051. 

Asbtract ( )   PDF (887KB) ( )  

Related Articles | Metrics

Data queue is a kind of prevalent mechanism in hardware interconnection. The principles and applications of data queue in constructing communication model of MultiProcessor SoC (MPSoC) were described. Based on the truth that data package from physical layer conforms to Poisson distribution, and starting from the idea of transaction, the transaction processes of the communication model were analyzed deeply by integrating queuing theory. UML, SystemC and Matlab were used to model and simulate the data flow of the processes. The comparison of theoretical computing result of system delay with that of simulation proves the feasibility of the proposed method.

Standalone development platform design for Freescale i.MX31

Zhong-Chang Yang Xin-Ming Zhang

2008, 28(4):  1052-1054. 

Asbtract ( )   PDF (556KB) ( )  

Related Articles | Metrics

In order to improve Windows Media Audio (WMA) decoder performance and obtain its exact performance, a new Standalone development platform was proposed. The critical step of Standalone platform is to configure i.MX31 Memory Management Unit (MMU). The segment translation mechanism was used to implement MMU. Via analysis of WMA decoder experiment results on this platform, WMA decoder exact performance was achieved, and its performance was enhanced by twenty-nine percent.

Design of RFID middleware architecture

2008, 28(4):  1055-1057. 

Asbtract ( )   PDF (989KB) ( )  

Related Articles | Metrics

Radio Frequency IDentification (RFID) middleware is the key software between tag readers and database and enterprise applications. It is the center of RFID application deployment operation. A ServiceOriented Architecture (SOA) realtime RFID middleware infrastructure was designed according to the requirement of related enterprises, and the corresponding UML class diagrams for the device management and integration components were given. The roles of RFID middleware components were described. The test of catering system shows that this middleware can improve the portability, maintainability and reliability of the system.

Context sensitivebased refinement of components

2008, 28(4):  1058-1060. 

Asbtract ( )   PDF (604KB) ( )  

Related Articles | Metrics

To reuse components effectively, the grammar of context sensitive refinement was presented. The context and context sensitive concepts were redefined to support it. Then, the context sensitive grammar was introduced into the components refinement, and analyzed from the aspects of structures, actions and attributes. A model of refinement of context sensitive components was established. The course of components refinement was expatiated. Finally, the method was further demonstrated by an instance.

Typical applications

Design and implementation of monitoring system for multi-application system

2008, 28(4):  1061-1064. 

Asbtract ( )   PDF (839KB) ( )  

Related Articles | Metrics

It is an important issue to monitor application systems concentratively in the network with multi-computer and multi-application system. A monitoring system for multi-application system was designed and implemented. This system included general monitoring items and specific monitoring items for application systems, programs and computers. The system had generality by configuring monitoring objects and monitoring items dynamically and could be used for many situations. It has been run in some computer room and the monitor and management efficiencies are improved.

Three-dimension fountain effect of implementation based on Direct3D and particle system

Tong-De TAN Zhi-Wei CHANG Hong-Ling ZHAO

2008, 28(4):  1070-1073. 

Asbtract ( )   PDF (845KB) ( )  

Related Articles | Metrics

Particle system is an efficient way to implement fountain effect. Making use of the pointsprite of Direct3D by way of particle primitive to render fountain particle system possesses definite agility. First of all, 3D graphics function library Direct3D was introduced and the basic principles of particle system were described. Secondly the fountain movement in the true life was analyzed by physics dynamics, then fountain particle system model was constructed and 3D effect of fountain was implemented. The way of fake particle viscosity was proposed, so lots of particles could be agglutinated to form different big or small water beads. This way enhances reality effect of fountain.

Study on parking-restricted urban network carrying capacity based on genetic algorithm

2008, 28(4):  1074-1077. 

Asbtract ( )   PDF (742KB) ( )  

Related Articles | Metrics

According to the imbalance between the dynamic and static traffic, the urban road network carrying capacity restricted by the parking capacity was analyzed. An optimization model of the road network carrying capacity and the OriginDestination (OD) distribution was established which could optimize the road network carrying capacity and the OD distribution simultaneously. The parkingrestricted network carrying capacity could be obtained, then genetic algorithm was applied and a numerical test was used to verify the effectiveness of the model. The test draws some conclusions that can be helpful for the urban traffic planning and management.

Storm tracking algorithm development based on the three-dimensional radar image data

2008, 28(4):  1078-1080. 

Asbtract ( )   PDF (931KB) ( )  

Related Articles | Metrics

TITAN algorithm, one of the main ways for shortterm weather forecast, uses controid method to identify, track and forecast strong convective storms.But in the original algorithm, the speed constraint is fixed and the prediction method is only applicable to the storms whose structure is stable. They exert negative influence on the algorithmic performance. To surmount these disadvantages, dynamic speed constraint and optical flow method were introduced. The experimental results show that these improvements can result in better forecasting and higher success rate of tracking the more complicated strong convective storm.

Application of improved algorithm of association rules in surface mounter data mining

Guang-Wei Wang

2008, 28(4):  1081-1083. 

Asbtract ( )   PDF (806KB) ( )  

Related Articles | Metrics

In data mining on the surface mounter data, association rules generate too many rules to digest. The method of specifying single decision attribute as consequent was investigated. Concerning the condition constraint, an improved algorithm of association rules based on decision attribute was given. The results show that rules got by this method are concise and valuable. Furthermore, the generation of frequent item sets is improved remarkably, thus rapid data mining is achieved.

Spam message online filtering system based on hash function and naive Bayes

2008, 28(4):  1084-1086. 

Asbtract ( )   PDF (609KB) ( )  

Related Articles | Metrics

A spam message online filtering system was proposed, integrating the blackwhite list filtering module and synthesis value function module. A two-layer hash method and a probability computing method based on naive Bayes were used to analyze the suspect spam message in depth in terms of content, length, frequency and others. Excellent realtime and features in filtering the great many of short messages were achieved, and the problems of traditional spam message filtering system was resolved efficiently.

Research and application of reinforced assembly of jig & fixture

GAO Xiao-Bing Hua TAO Xiao-Feng GU

2008, 28(4):  1087-1090. 

Asbtract ( )   PDF (1395KB) ( )  

Related Articles | Metrics

To cut down the operational procedures and improve the accuracy and efficiency of assembly, the reinforced assembly algorithm based on assembly features was proposed according to assembly function of CAD software. It achieves the goal of reinforced assembly with utilization of features recognition and assembly relationship between the features, and moves on to the assembly automation. With the characteristic of features expansion，it improves the efficiency of assembly function of CAD software.

Knowledge expression, conflict detection and implementation of telecom tariff discount policies

yuzhou hu duoquan li gu xuedao cunyi shi

2008, 28(4):  1091-1094. 

Asbtract ( )   PDF (829KB) ( )  

Related Articles | Metrics

Presently, applying the nature language to explain Telecom Tariff Discount Policies (TTDP) by telecom operators not only makes different people understand differently, but also makes computers not be used to implement automatic conflict detection of reduplicated TTDP. Therefore, aiming at the phenomena of overloading and inefficient Business Sporting Systems (BSS) due to increasing reduplicated TTDP, the algorithm of conflict detection for reduplicated TTDP was proposed and automatic conflict detection was implemented with combination of expert platform. Each discount policy was expressed into the conditional part and conclusive part with traditional knowledge expression method and applying idea of the representative algorithms of conflict detections such as Rete and improved Rete algorithms. The practical results show the efficiency and rationality of the knowledge expression and the conflict detection algorithm for TTDP, better effects with scientific and rational set up of TTDP, decrease in customer complaints, compression of the number of TTDP, improved system efficiency and increased economic and social benefits.