Table of Content

01 November 2005, Volume 25 Issue 11

Previous Issue    Next Issue

Network and distributed techno

Resource search algorithm based on rumor spreading mechanism in P2P network

LI Qing-hua,ZHANG Yang,WANG Duo-qiang

2005, 25(11):  2465-2467. 

Asbtract ( )   PDF (745KB) ( )  

Related Articles | Metrics

Flooding-based broadcasting is the widely used mechanism in many current large-scale P2P networks,such as KaZaA and Gnutella model,which usually lead to serious communication cost problem.To solve these problems,an algorithm based on rumor propagation procedure of resource search was presented.Any source peer running this algorithm could achieve a relatively high probability of finding the resource while involving a relatively small fraction of the total number of peers.The simulation results show that this algorithm is excellent.

Distributed node localization algorithms of wireless sensor networks

WANG Jian-gang,WANG Fu-bao,DUAN Wei-jun,LI Jing

2005, 25(11):  2468-2471. 

Asbtract ( )   PDF (781KB) ( )  

Related Articles | Metrics

Four distributed localization algorithms in wireless sensor networks(WSN) were discussed.Their performances were compared.The energy of WSN was consumed during computation and communication.So the computational cost and communication cost of these algorithms were analysed.Finally,recommendations for future study and possible improvements were put forward.

IP multicast techniques based on MPLS domain

LI Xiao-yong,ZHANG Wei

2005, 25(11):  2472-2474. 

Asbtract ( )   PDF (858KB) ( )  

Related Articles | Metrics

Merging MPLS and multicast techniques can acquire two advantages: saving bandwidth of multicast and supporting high-speed,QoS,traffic engineering and VPN in MPLS.Multicast and MPLS are two complementary techniques.MPLS multicast is pre-requisite and urgent for multimedia real-time steaming traffic with QoS parameters(such as bandwidth,delay,etc).Basic principles and research results of implementing mechanism,multicasting tree foundation in MPLS multicast were summarized.The existed problems and future research prospects were discussed.

Overview of anonymous communication

ZHU Na-fei,CHEN Song-qiao,SUI Hong-fei,CHEN Jian-er

2005, 25(11):  2475-2479. 

Asbtract ( )   PDF (1126KB) ( )  

Related Articles | Metrics

The definition and relative theories of anonymous communication were summarized. The importance of the study on anonymous communication was illustrated.Current anonymous communication systems were analysed and the important attack forms in them were introduced.At last the direction for future study and the legal problem of anonymous communication were put forward.

Research and practice of grid application model based on Globus

LI Xu-yan,HAO Ke-gang,GE Wei

2005, 25(11):  2480-2482. 

Asbtract ( )   PDF (611KB) ( )  

Related Articles | Metrics

The client,the discovery and allocation of resource,and the description of resource in grid were researched.According to market mechanism and the present situation of resource utility in the grid,a market-oriented grid directory service and self-organizing resource discovery protocol were presented and implemented.

Improved AR-based model of host load prediction in computing grid

CHENG Hong-bing,YANG Geng

2005, 25(11):  2483-2485. 

Asbtract ( )   PDF (595KB) ( )  

Related Articles | Metrics

As the main part of resources prediction in the grid computing,host load is particularly important.An improved AR-based model of host load prediction was presented.The improved model not only has the advantages that AR model has,such as,low computing cost and high stability,and has the advantages that AR model has not.It can predict the dynamic interval host load that some job will encounter in the future,and process some characters of the host load variance,for example,self-similarity and long-range dependence.Experiment results show that the improved model has come to an anticipant result.

Self-adaption deployment of performance monitoring agent in distributed networks

CAO Xian-dong,XIA De-lin,YAN Pu-liu

2005, 25(11):  2486-2488. 

Asbtract ( )   PDF (770KB) ( )  

Related Articles | Metrics

One of the critical problems in distributed network performance monitoring is that how to place proper number of monitoring agents in proper locations in a managed network can improve monitoring efficiency,that is,decrease monitoring traffic and response time.Our algorithm was triggered when network topology changed,or nodes and links failures occurred.By adjusting some agents’ deployment,it could draw the whole monitoring system back to proximate optimization state.Simulation shows that this algorithm can add flexibility and scalability to the proposed monitoring system.

Algorithms of topology discovery for remote networks in different management domains

LIU Zhen-shan,LUO Jun-yong

2005, 25(11):  2489-2491. 

Asbtract ( )   PDF (659KB) ( )  

Related Articles | Metrics

The common technology of the network discovery can only fulfil the local management work and can not fulfil the remote topology discovery of networks.A class of rules of the network topology analysis was advanced.Based on it,an algorithm of remote network discovery covering different management domains was presented.This algorithm can resolve the problem of no longer connected graph in the discovery for different management domains and fulfil the demand of accuracy and integrity in the topology discovery.The test effect in CERNET in east China was given and analysed.

Location aided broadcast protocol for mobile Ad Hoc networks

SHEN Jun,CAO Yuan-da,ZHANG Shu-dong

2005, 25(11):  2492-2495. 

Asbtract ( )   PDF (849KB) ( )  

Related Articles | Metrics

A new broadcast protocol named as location aided broadcast protocol(LABP),which was aided by location information,was put forward.In this protocol,a relay node separated adjacent area into grids,found the broadcast relay gateways(BRGs) with aid of the grids,and broadcasted the message to all its neighbors,with the information of the BRGs.The simulation results show the excellent broadcast performance with LABP.

Implementation of PPPoE dialup roaming restriction based on RADIUS athentication

ZHANG Zong-yong,LIU Zhen

2005, 25(11):  2496-2498. 

Asbtract ( )   PDF (634KB) ( )  

Related Articles | Metrics

The solution of PPPoE dialup roaming restriction based on RADIUS authentication on the broadband network was brought forward.With the intelligent backend authentication and process of roaming restriction information,a user account could only be used in a specific area by using the attributes of BRAS-Port and BRAS-Identifier.The solution was implemented on a large metropolis area network which is a broadband network and acquires good perfomance and convenient management.

Analysis and Comparison of IEEE STPs

LI Yan-bing,MA Yue,WANG Bo,WAN Xiao-qiang

2005, 25(11):  2499-2501. 

Asbtract ( )   PDF (677KB) ( )  

Related Articles | Metrics

The basic principles of STP,RSTP and MSTP were introduced.Some analyses and comparisons of the three spanning tree protocols were given in the aspects of convergent time,topology change,available bandwidth and resources taken up.The appropriate environment of each spanning tree protocol was disscussed.It can be a reference to select spanning tree protocols in implementing a network project.

Study on algorithms of packet classification for IPv6

WANG Yan

2005, 25(11):  2502-2504. 

Asbtract ( )   PDF (851KB) ( )  

Related Articles | Metrics

TCAM can offer sustained throughput and simple system architecture.It is attractive for packet classification,especially for the ultimate IPv6-based networks.However,it also comes with several shortcomings,such as the limited number of entries,expansive cost and power consumption.An efficient algorithm was proposed to reduce the required TCAM by encoding the address portion of the searchable entries.The new scheme could encrypt the 128-bit prefixes of the real-world IPv6 routing tables into 11 bits and still keep the property of CIDR(Classless Inter-Domain Routing).

Comparison between WPKI and PKI

LU Gang,SHE Kun,ZHOU Ming-tian,LIU Jia-fen

2005, 25(11):  2505-2508. 

Asbtract ( )   PDF (856KB) ( )  

Related Articles | Metrics

Compared to wired networks,wireless data networks present a more constrained communication environment: less bandwidth,more latency,less connection stability,etc.At the same time,there are many problems in hand-held wireless devices application environment,such as less powerful CPUs,less memory,restricted power consumption,smaller displays and so on.The WAP PKI specification has defined by WAP Forum in order to extend the application of PKI to wireless environment.The goal of the WAP PKI is to reuse the existing PKI standards where available,and only develop new standards where necessary to support the requirements of WAP.The application environment,protocol frame,data and business flow,encryption algorithms,certificate form and protocol standards of WAP PKI and PKI were compared.

Action of one-way function in public-key authentication protocols

ZHAO Hua-wei,LI Da-xing

2005, 25(11):  2509-2511. 

Asbtract ( )   PDF (564KB) ( )  

Related Articles | Metrics

Based on the research of public-key authentication protocols,its error to design the kind of protocols using confidential serivce was pointed out.An extended BAN logic was proposed.Two improved public-key authentication protocols were analysed by the extended logic.It shows that one-way function offers the necessary secure services for public-key authentication protocols.

Scheme of supporting trust transfer in mobile environment

ZHOU Fan,SHE Kun,WU Yue

2005, 25(11):  2512-2514. 

Asbtract ( )   PDF (606KB) ( )  

Related Articles | Metrics

Based on SAML2.0 standard,a scheme of supporting trust transfer of mobile equipment was presented.The architecture and the flow of this system were described. Several problems and relative countermeasures about security and deployment were analyzed and proposed.

Security analysis of SSL 3.0 based on Spi calculus

ZHAO Yu,WANG Ya-di,HAN Ji-hong

2005, 25(11):  2515-2520. 

Asbtract ( )   PDF (1045KB) ( )  

Related Articles | Metrics

pi calculus is a process algebra-based formal method of analyzing security protocols.It can support all cryptographic primitives.The syntax and semantics of standard Spi calculus were extended appropriately.The extended Spi calculus was applied to the formal analysis of SSL V3.0,and achieved some identical conclusions with other formal methods.

Design of SSPM management module of security middlewar

ZENG Ling-hua,SHE Kun,OUYANG Kai-cui,ZHOU Ming-tian

2005, 25(11):  2521-2523. 

Asbtract ( )   PDF (785KB) ( )  

Related Articles | Metrics

The kernel module of security middleware is the Common Security Service Manager (CSSM).Its architecture and process of the security service were discussed.The management module of Security Services Provider Module(SSPM),part of CSSM,was designed and implemented.The data structure and the algorithm used in SSPM management module of CSSM,were also introduced.

Research of virus spreading on the complex Internet

WANG Min,ZHENG Ying-ping

2005, 25(11):  2524-2526. 

Asbtract ( )   PDF (579KB) ( )  

Related Articles | Metrics

It is found that real systems including Internet have the features of complex networks.A new holistic sight is given to the research of virus spreading on the complex Internet.Based on the previous work,a complex network model of Internet was constructed and the spread behavior on it was simulated.The similarity to the real spread data of Sasser shows that this model can reflect the features of the real Internet and the virus can be controlled through varying several parameters.

Study and implementation of workgroup-based IPsec security policy system

CHEN Tao,WANG Fu-bao,XIAO Lin

2005, 25(11):  2527-2529. 

Asbtract ( )   PDF (663KB) ( )  

Related Articles | Metrics

IETF workgroup’s security policy system architecture simplifies the task of managing security policies and makes sure of the proper deployment of security policies.Based on this standard security policy system architecture,the theory of a workgroup-based security policy system was proposed.Then overall architecture of the workgroup-based security policy system was given combined with an end-to-end security communication prototype system.The function modules of the workgroup-based security policy system and key techniques used in the system were discussed.

Improvement of a nonrepudiable threshold proxy signature scheme

FENG Chao-sheng,YUAN Ding

2005, 25(11):  2530-2532. 

Asbtract ( )   PDF (723KB) ( )  

Related Articles | Metrics

Based on security analysis on Hsu’ scheme,an improved threshold proxy signature scheme was proposed,which effectively overcomed the disadvantage of Hsu’ scheme which couldn’t stand the internal conspiracy attack and the forge attack.The improved scheme involved the secret information of both the actual signature group and the proxy signature group into the proxy signature in the proxy signature generation stage,and differed in the signature,so the signature based on it is identifiable and nonrepudiable.Cryptoanalysis on the new improved scheme shows that it is a safe and practicable one.

Research on secure framework for Web services

BAI Jian-kun

2005, 25(11):  2533-2535. 

Asbtract ( )   PDF (646KB) ( )  

Related Articles | Metrics

After analyzing the typical attack techniques and picking up secure demand on Web services,a secure framework for Web services based on PDRR(Protection,Detection,Response,Recovery) was proposed.This framework can implement integrated protect for Web services.

Digital watermarking algorithm based on phase and amplitude of DFT domain

CAO Rong,WANG Ying,LI Xiang-lin

2005, 25(11):  2536-2537. 

Asbtract ( )   PDF (840KB) ( )  

Related Articles | Metrics

A meaningful watermark was embedded into phase and amplitude components of block DFT of image seperately,then their robustnesses were compared under the same distortion.Combined with phase and amplitude components,a novel DFT domain watermarking algorithm was proposed.The watermark could be detected without the primitive image.Experiment results show that the algorithm is easy to realize and the watermarking is invisible,moreover,the algorithm is robust to JPEG compression,resizing,rotation,median filtering and noise perturbation.

Multiple watermarking algorithm based on CDMA technique

LI Qiu-zhen,ZOU Fu-hao

2005, 25(11):  2538-2540. 

Asbtract ( )   PDF (615KB) ( )  

Related Articles | Metrics

Code division multiple access(CDMA) technique was conceptually introduced to watermarking system to realize multiple watermark resolution.Before the watermark embedded,each user used his private key as a seed to generate an address code subjected to pseudorandom noise distribution.Each watermark was modulated into a carrier signal with its corresponding address code.And then these carrier signals were added to host media.During watermark detection,using the same address code,each user extracted his watermark from the detected media via calculating the correlation coefficient between address code and watermarked vector of the detected media.The experiment results show that this scheme can embed and extract watermarks independently for each user and is capable of multiple watermarking.

Analysis and improvement of LSB image hiding algorithms based on bit planes

JIN Zhan-peng,SHEN Xu-bang

2005, 25(11):  2541-2543. 

Asbtract ( )   PDF (644KB) ( )  

Related Articles | Metrics

The theory of bit-plane in spatial-domain method of image information hiding technology was introduced.The traditional least significant bit(LSB) hiding algorithm and the improved parity identifier hiding algorithm were analysed.Then the index data chain hiding algorithm was put forward.Experiments show that the new hiding method has lower distortion and higher security.

Fine-grained XML inference control and its implementation

CHEN Xiao-lin,WU Yong-ying,LI Zhuan

2005, 25(11):  2544-2546. 

Asbtract ( )   PDF (832KB) ( )  

Related Articles | Metrics

A fine-grained inference control model was proposed and its implementation mechanism of XML document was given.It could solve the problem of sensitive information inference that couldn’t be solved by MAC(Mandatory Access Control).The algorithm was improved to obtain the best solution to sensitive information leakage quickly.The pruning methods were adopted to publish the secure information as much as possible.

Encoding scheme of efficient shorter 2-secure digital fingerprint

TANG Yao,FAN Yang-yu

2005, 25(11):  2547-2548. 

Asbtract ( )   PDF (625KB) ( )  

Related Articles | Metrics

A 2-secure fingerprint using concatenated codes was proposed.Its tracing algorithm was described.A new code constructed in reference[4] was used as inner code,and q-ary random integers were used as outer code.This code can trace at least one traitor when users increase but the length of codes doesn’t increase.

Design and implementation of ECC software and ECC card

DONG Jun-wu,ZOU Hou-wen,PEI Ding-yi

2005, 25(11):  2549-2553. 

Asbtract ( )   PDF (1026KB) ( )  

Related Articles | Metrics

The design and implementation of elliptic curve cryptography in software and low-level environment such as mono-chip were introduced,including the high-performance software of elliptic curve cryptography,the software of SEA algorithm generating secure elliptic curve,and the elliptic curve cryptographic card with USB interface.It is shown that the elliptic curve cryptography system can be implemented both in software and in the low-level environment such as smart card or mono-chips,and hence can be used in reality.

Dynamic password authentication based on smart card and fingerprint

ZHANG Jin-ying,ZHENG Yu,LU Xian-hui,HE Da-ke

2005, 25(11):  2554-2556. 

Asbtract ( )   PDF (520KB) ( )  

Related Articles | Metrics

A password-based remote user authentication scheme was proposed by Lin and Lai, but there were some vulnerabilities in time-stamp and user ID.So an improved scheme based on challenge-response was presented,adopting diplex authentication technologies,fingerprint and smart card.It could achieve mutual authentication and avoid replay attack and masquerade attack.The random factor was generated by the mutual parties to guarantee the authentication fairness.Moreover,user’s fingerprint needed not be transmitted in the authentication process to protect user’s privacy.

Intrusion detection method for mobile ad-hoc networks based on machine learning

YANG De-ming,PAN Jin,ZHAO Shuang

2005, 25(11):  2557-2558. 

Asbtract ( )   PDF (620KB) ( )  

Related Articles | Metrics

Mobile ad-hoc networks(MANETs) represent complex distributed communication systems comprised of wireless mobile nodes.Based on the discussion of intrusion detection problem in MANET,a novel anomaly intrusion detection method based on machine learning algorithm was proposed to detect attacks on MANET.The method captured the normal traffic’s inter-feature correlation pattern which could be used as normal profiles to detect anomalies caused by attacks.The method was implemented on Ad-hoc On-Demand Distance Vector(AODV) protocol and evaluated in QualNet,a leading network simulation software.

Anti-spam filtering mechanism based on artificial immune systems

U Ke,ZHANG Jia-shu

2005, 25(11):  2559-2561. 

Asbtract ( )   PDF (635KB) ( )  

Related Articles | Metrics

Based on artificial immune systems,an anti-span E-mail filtering system,called EIS,was developed.The mechanism and algorithms of this system were described.The simulation results show that it performs as well as Nave Bayes system,especially on recall,and is fit for information classification.

Anti-trash E-mail system based on artificial immunity model

ZHOU Nian-nian,RAN Shu-yang,ZENG Jian-yu,ZHONG Xiang

2005, 25(11):  2562-2565. 

Asbtract ( )   PDF (684KB) ( )  

Related Articles | Metrics

An artificial immune system studied the principle and some fine features of a biological immune system.The idea of immunology was adopted to build an anti-trash E-mail model.All kinds of illegal E-mail and trash E-mail would be considered as viruses invading the system in this model,and to be recognized and eliminated automatically according to the mechanism of eliminating viruses by organism.The design idea and the key techniques of the model were discussed intensively.Its practicability was proved by experiments.

Realization of IP data package analyzer for detecting distributed denial of service

LI De-chang,YAN Xi-ming,LI Zhuo

2005, 25(11):  2566-2567. 

Asbtract ( )   PDF (426KB) ( )  

Related Articles | Metrics

The theory and the process of distributed denial of service attacks were analysed.A distributed model to detect distributed denial of service was put forward.IP data package analyzer Packview was developed.Current protocols,such as IP/TCP,UDP,ICMP and IGMP were analysed with Packview,and properly applied to identify attacks.

Study on fast packet filter under network processor IXP2400

ZHONG Ting,LIU Yong,GENG Ji

2005, 25(11):  2568-2570. 

Asbtract ( )   PDF (617KB) ( )  

Related Articles | Metrics

The efficiency of packet filter is vital for firewalls.An efficient packet filter solution based on INTEL IXP2400 was talked about.This solution optimized packet filter through dynamic rule table,static rule tree and hardware hash unit.The firewall designed in this way can reach 1000M line speed.

Application of PMI technology in enterprise’s privilege managemen

ZHANG Li,XU Jin

2005, 25(11):  2571-2573. 

Asbtract ( )   PDF (619KB) ( )  

Related Articles | Metrics

The PMI has been recommended as a new information protection infrastructure,to provide privilege management service and to get an access control mechanism which is fit for most of actual transact patterns and free of the development and management of concrete applications.The advantages of using PMI technology instead of application-embedded privilege management as before were introduced in distributed Web applications.The possibility of its realization was discussed and the scheme of its realization was proposed.

Analysis of single-signon system based on SAML artifact technology

CHEN Ke,SHE Kun,HUANG Di-ming

2005, 25(11):  2574-2576. 

Asbtract ( )   PDF (620KB) ( )  

Related Articles | Metrics

Single-signon technology enables users to use multiple Web services without repetitious login which makes user identity management more convenient and secure.SAML is the criterion to implement a single-signon system.It provides a standard for Web services to exchange user identity authentication information.The implementation of SAML artifact technology in single-signon system was mainly discussed.The flow and security of this single-signon system was analyzed.

Survey of gait-based human identity recognition techniques

YE Bo,WEN Yu-mei

2005, 25(11):  2577-2580. 

Asbtract ( )   PDF (1084KB) ( )  

Related Articles | Metrics

A powerful clue to human identification was furnished by gait due to the comprehensive dissimilarities in body structure and walk behavior.Automatic recognition by gait was subject to increasing interest and had the unique capability to recognize human individual at a distance when other biometrics were obscured.A comprehensive survey of recent developments of gait-based human identity recognition were provided.The main methods in each aspect of gait-based recognition were described.Some detailed discussions on research challenges and future directions in gait analysis were put forward.

PCA-based location algorithm of human face features

WANG Zhuo-yu,HE Qian-hua

2005, 25(11):  2581-2583. 

Asbtract ( )   PDF (946KB) ( )  

Related Articles | Metrics

An PCA-based location algorithm of human face features was presented.Eigenmouth was generated by prinicipal component analysis(PCA) with labelled mouth region image set.For an input image,the mouth region was recognized according to least residual error energy(LREE) criteria after the face region was first located.Then a restricted window scan stategy and comparability mearsurement P were introduced into the LREE algorithm.Experiment results show that the proposed method can locate mouth region easily,accurately and robustly.

Face recognition based on feature weighted and performance comparison

ZHU Yu-lian

2005, 25(11):  2584-2585. 

Asbtract ( )   PDF (510KB) ( )  

Related Articles | Metrics

Current face recognition methods usually do not consider the effects of different facial features.After the roles of different facial features in the course of face recognition were researched,face images were preprocessed by three feature weighted methods respectively,then were recognized by popular face recognition methods of association memory,principal component analysis and Fisher linear discriminant analysis.The experiments on ORL face database show that feature weighted methods are effective and general to face recognition.

Face recognition combining the null space approach and the fractional LDA

WANG Zeng-feng,WANG Hui-yuan,LENG Yan

2005, 25(11):  2586-2588. 

Asbtract ( )   PDF (541KB) ( )  

Related Articles | Metrics

Linear discriminant analysis is one of the most popular linear projection techniques for feature extraction.The traditional LDA-based methods suffer from two main disadvantages: 1) the small sample size(SSS) problem;2) their optimization criteria are not directly related to the classification accuracy.A new LDA-based technique was proposed,which could overcome the above shortcomings.First, by redefining the within class scatter matrix and the between class scatter matrix,a new null space method was presented.Then,combined the new null space method with F-LDA(fractional LDA) algorithm,a completely new feature extraction algorithm for face recognition was given.The experimental results show that the new LDA-based feature extraction algorithm improves the performance of face recognition significantly.

Video surveillance method based on H.264 video coding standard

HUI Hui,LIU Han,WU Ya-li,LIANG Yan-ming

2005, 25(11):  2589-2591. 

Asbtract ( )   PDF (827KB) ( )  

Related Articles | Metrics

An automatic video surveillance system was presented and realized,which included a new motion-detection method based on H.264 video coding standard.Motion vectors and residual energy of the current image were both taken into account to determine the state of ongoing scenery in this method.The resulting system can efficiently reduce the influence of background clutter and improve the sensitivity and robustness of the system.

One rate control method of video for consistent picture quality

TANG Tian-ye,LIU Zhao

2005, 25(11):  2592-2594. 

Asbtract ( )   PDF (733KB) ( )  

Related Articles | Metrics

In video coding,the purpose of rate control is to improve picture quality while subject to the bandwidth constraint.The consistent visual quality is complied with HVS,thus it is a desired goal of rate control.A new rate control scheme using linear source model as content complexity measure was proposed.This method smoothed the quantized parameter intrinsically,which made the distribution of quantized parameters and mean-squared errors more concentrated among macro blocks,so more consistent visual quality could be got.Simulation results show that the proposed method can improve PSNR as well as subjective visual quality.

Self-adaptive fusion method for remote sensing images based on regional performance

LIU Yuan,YIN Dong,CHEN Xin,YAO Ting

2005, 25(11):  2595-2597. 

Asbtract ( )   PDF (846KB) ( )  

Related Articles | Metrics

In order to consider image fusion evaluation information when choose a fusion method,a self-adaptive fusion method for SAR and optical images based on regional performance was proposed.Firstly,a smooth filter template was used to suppress the speckle of SAR image.Then the wavelet transform was used to perform a multiscale decomposition of each image.To low-frequency images,by extracting a set of regional performance parameters respectively,a self-adaptive fusion was applied with the regulation of membership degree;the fusion of high-frequency images adopted high-frequency of the optical image directly.The result image was generated by reverse wavelet transform.Experiment results show that this method can obtain satisfactory effect.

Image threshold selection based on fractal dimension

LI Qing-feng,FU Zhong-liang,SU Wei

2005, 25(11):  2598-2599. 

Asbtract ( )   PDF (1032KB) ( )  

Related Articles | Metrics

The common methods of threshold selection only use the gray information of images,not making good use of the space information.Fractal dimension is a good index of space information of images,widely used in digital image processing and analysis.A method of threshold selection based on fractal dimension was proposed.Experiments show that it is effective to the threshold selection.

Meaningful regions-based algorithm for color image retrieval

YANG Ze-xin,FENG Yu-cai,LIANG Jun-jie,CHENG Jun

2005, 25(11):  2600-2603. 

Asbtract ( )   PDF (1571KB) ( )  

Related Articles | Metrics

An meaningful regions-based algorithm was provided: the color cluster parameters of images were calculated first.Those images with high value were split into sub-regions by image segmentation,and others were just split into sub-blocks.Each block was regarded as a region,and was given a dynamic weight.The total similarity between two images was computed according to those regions’ color histograms.The experiments show that this approach can achieve increased power of discrimination than the classical color histogram method.

A fast color image matching algorithm

GAO Fu-qiang,ZHANG Fan

2005, 25(11):  2604-2605. 

Asbtract ( )   PDF (725KB) ( )  

Related Articles | Metrics

According to the characteristics of color imagine matching,sequential similarity detection algorithm(SSDA) was inproved based on color weight coefficient.Furthermore,the algorithm used hierarchy search which combined with rough matching and accurate matching,and updated template based on creditability during image matching.The experiment results show that the algorithm reduces the amount of calculation and increases the accuracy of imagine matching.Therefore,the algorithm has well real-time performance and robustness.

Image segmentation based on modified and piecewise fuzzy Gibbs random fields

LIN Ya-zhong,CHENG Yue-bin,CHEN Wu-fan

2005, 25(11):  2606-2608. 

Asbtract ( )   PDF (647KB) ( )  

Related Articles | Metrics

A simple,easy but efficient approach,based on modified and piecewise fuzzy Gibbs random fields was introduced.A fine initial classification was got by modified FCM(Fuzzy C-Means),then combined with the two classes fuzzy method,a complex segmentation was got efficiently and precisely.Experiments show that our approach is more reliable and effective than classical methods in multi-class image segmentation.

Efficient hybrid algorithm for mesh smoothing of surfaces

YANG Chang-chun,NI Tong-guang

2005, 25(11):  2609-2611. 

Asbtract ( )   PDF (542KB) ( )  

Related Articles | Metrics

With the development of 3D scanning technologies,there are no difficulties in surfaces sampling,but the meshes have too much noise.With the method of classifying the mesh vertices,a hybrid algorithm combined weighted median method and Laplacian method was presented.Experiment results show that the algorithm is efficient and the features of the original mesh can be preserved perfectly.

Auto-extraction methods of Web pagelet

ZHU Ming,LI Wei

2005, 25(11):  2612-2614. 

Asbtract ( )   PDF (607KB) ( )  

Related Articles | Metrics

Besides the needed data,there are lots of navigation information and advertisements in the Web pages.A DOM tree comparison algorithm was proposed.It compared several pages within a class,and recognized the main contents in pages.Experiment results show that it is feasible and effective.

A subspace clustering algorithm for high dimensional spatial data

WANG Sheng-sheng,LIU Da-you,CAO Bin,LIU Jie

2005, 25(11):  2615-2617. 

Asbtract ( )   PDF (697KB) ( )  

Related Articles | Metrics

Traditional grid clustering methods fail to consider the affect of neighbored grids,and may result in unsmoothed clustering,wrong judgement of clustering boundary,etc.A subspace clustering algorithm for high dimensional spatial data was proposed,which added the affect of neighbored grids when clustering.Experiment results show that this algorithm conquers the unsmoothed clustering and deals with clustering boundary well.

A GA-based divisive hierarchical clustering algorithm

REN Jiang-tao,WU Hai-jian,WU Xiang-jun,YIN Jian,ZHANG Yi

2005, 25(11):  2618-2620. 

Asbtract ( )   PDF (862KB) ( )  

Related Articles | Metrics

To solve the problems of adaptive determinition of the cluster number,flexible objective function definition and approximate optimal computation in clustering analysis,a GA-based divisive hierarchical clustering algorithm(GADHC) was proposed,which integrated some features of divisive hierarchical clustering algorithm and binary genetic clustering algorithm.The experiments show that the proposed algorithm works well.

Incremental rules extraction based on rough set theory

GUO Sen,WANG Zhi-yan,WU Zhi-cheng,YANG He-ping

2005, 25(11):  2621-2623. 

Asbtract ( )   PDF (471KB) ( )  

Related Articles | Metrics

The incremental rules extraction is a focus problem of KDD.A novel rules extraction algorithm which is called "RDBRST"(Rule Derivation Based on Rough set and Search Tree) was proposed.It was one kind of width first heuristic search algorithms.The incremental rules were extracted and the current rule set was updated based on this algorithm.An example was given to illustrate the characteristics of this new incremental algorithm.

Algorithm for neighbor searching of leaf-coding quadtree

WU Heng-shan,DUAN Xiong-wen,LI Chen-yang

2005, 25(11):  2624-2626. 

Asbtract ( )   PDF (648KB) ( )  

Related Articles | Metrics

A new leaf-coding algorithm in quadtree was designed.Based on the coding,the algorithm for neighbor searching in leaf-coding quadtree was implemented.The method enhanced the storage efficiency by the decrease of quantity of nodes,and it enhanced the query efficiency by doing the neighbor searching with bitwise operating available at the leaf node level.

Constraint association-rule mining algorithm based on transaction clip

CHEN Yi-ming,HE Yong

2005, 25(11):  2627-2629. 

Asbtract ( )   PDF (578KB) ( )  

Related Articles | Metrics

Aiming at a familiar and simple constraint that some items must or must not present in rules,a fast clipped-transaction-based constraint association-rule mining algorithm was put forward.This algorithm firstly scanned data base to clip transactions horizontally and vertically,then mined frequent item sets from clipped data set to form rules’ candidate head sets,body sets and rule item sets.Finally,it scanned original data base again to gain association rules according to minimum confidence constraint.Experiments show that,compared with common strategy of succinct constraint,this algorithm has better performance.

Decision table reduction based on information entropy

2005, 25(11):  2630-2631. 

Asbtract ( )   PDF (327KB) ( )  

Related Articles | Metrics

An algorithm based on mutual information for knowledge reduction was proposed in information system,in which knowledge reduction was defined from the view of information.An illustrative example showed the application potential of the algorithm.The experiment results show that this algorithm can find the minimal reduction for decision table.

Selectivity estimation for moving objects query in spatio-temporal databases

Lü Guo-hua,LIU Zhao-hong,YUAN Zheng-wu,GE Jun-wei,Hae-Young BAE

2005, 25(11):  2632-2634. 

Asbtract ( )   PDF (627KB) ( )  

Related Articles | Metrics

Presently,histogram is the most effective technique that is used to estimate the query selectivity.Histogram can also be used in spatio-temporal query optimization after some improvements.TPR-tree is more predominant than other indices in predictive spatio-temporal database indexing.With time-parameter R-tree, a novel spatio-temporal histogram was proposed to estimate the selectivity for spatio-temporal querying.

Applying grid to evolutionary computation

LIU Xu-tong,WANG Hui-jin,JIAN Chang-shu

2005, 25(11):  2635-2637. 

Asbtract ( )   PDF (619KB) ( )  

Related Articles | Metrics

A new computation model of the evolutionary algorithm applied with grid technology was proposed.It achieved the data classification by performing co-evolution of rules and rule sets.Taking advantages of grid computing,the new model enhances the power of the traditional complex data mining techniques and improves their performance.

Design and implementation of data consistency of remote data replicating system

LING Zong-hu,LI Xian-guo,HAN Zhi-yong

2005, 25(11):  2638-2640. 

Asbtract ( )   PDF (838KB) ( )  

Related Articles | Metrics

A method was presented to keep data consistency and data view consistency and to optimize system performance in a remote disaster-tolerate data replication system.It used log volume to record the user’s acquirement,and maintained data consistency by keeping block update order between primary and backup volumes,and adopted different transport methods according to different data types.The architecture,implementation method and key techniques of the method were discussed.

Real-time atomic commitment for mobile distributed real-time transactions

XIAO Ying-yuan,LIU Yun-sheng,WANG Hong-ya,LIU Xiao-feng,LIAO Guo-qiong

2005, 25(11):  2641-2644. 

Asbtract ( )   PDF (800KB) ( )  

Related Articles | Metrics

The formal definition of real-time atomic commitment of mobile distributed real-time transactions was introduced.On the basis of the above definition,one-phase real-time atomic commitment protocol(1PRACP) suitable for mobile distributed real-time transactions was presented.According to 1PRACP,the commitment procedure of a mobile distributed real-time transaction was completed in one-phase through a one-time message exchange between participant and coordinator.Combined with overtime recovery processing protocol,1PRACP can be free of the blocking which is caused by site failure or communication link failure.The results of performance comparison and evaluation show that 1PRACP can improve the performances of mobile distributed real-time database systems.

Ordering objects in ordered information table based on rough set theory

I Ming,ZHANG Bao-wei

2005, 25(11):  2645-2646. 

Asbtract ( )   PDF (483KB) ( )  

Related Articles | Metrics

Aiming at ordering objects in ordered information table,a framework based on rough set theory was proposed.An information system was firstly transformed into a binary one which would be simplified by rough set theory.According to the values of the weight function,the objects in the original information tables could be sorted.Experiments illustrate that the framework is feasible and effective.

Comparing features combination with features fusion in Chinese named entity recognition

ZHAO Jian,WANG Xiao-long,GUAN Yi

2005, 25(11):  2647-2649. 

Asbtract ( )   PDF (544KB) ( )  

Related Articles | Metrics

Maximum entropy model is usually used for named entity recognition,in which the features related to a random event are linearly combined.The problem of the weight bias in the features combination was pointed out,and a strategy of performing features fusion before linearly combining was proposed.The result of experiment on corpus containing 2000 human names shows that features fusion can improve the precision and recall of named entity recognition effectively.

Multi-layer feed-forward neural network approach to case-based reasoning

LI Jian-yang,NI Zhi-wei,LIU Hui-ting

2005, 25(11):  2650-2652. 

Asbtract ( )   PDF (566KB) ( )  

Related Articles | Metrics

 When the case-based reasoning system learns new cases,the size of the case base will increase,and lead to the problem of more retrieving time and low efficiency in case retrieval.Multi-layer feed-forward neural network is a constructive neural network,which can be easily constructed and understood with features of the training examples and has lower complexity of time or space.The covering algorithm of the multi-layer feed-forward neural network has high reorganization of the test set besides recognizing the whole training data,and has been used to classify many difficult problems effectively and rapidly.The case base is partitioned to several sub-case bases by a multi-layer forward neural networks as well as covering algorithm,and a new problem can be retrieved only in a special sub-case base.These can be used to deal with the problem of CBR system performance especially in large scale of case base,which can guarantee the two all,competence and efficiency.

A new SVM multiclass classification based on binary tree

MENG Yuan-yuan,LIU Xi-yu

2005, 25(11):  2653-2654. 

Asbtract ( )   PDF (540KB) ( )  

Related Articles | Metrics

The problems and defections of the existing methods of SVM multi-class classification were analyzed.A multi-class classification based on binary tree was put forward.A modified self-organization map(SOM),KSOM(kernel-based SOM),was introduced to convert the multi-class problem into binary tress,in which the binary decisions were made by SVMs.The results show that it has higher multiclass classification accuracy than the multi-class SVM approaches with "one-versus-one" and "one-versus-the rest".

Association function algorithm for decision tree

HAN Song-lai,ZHANG Hui,ZHOU Hua-ping

2005, 25(11):  2655-2657. 

Asbtract ( )   PDF (448KB) ( )  

Related Articles | Metrics

Variety bias is a prevalent problem existing in decision tree algorithms.For solving this problem,a new decision tree algorithm,AF algorithm,was proposed.The mechanism how it avoided this default was analysed.Experiments compared to ID3 algorithm show that AF algorithm can avoid the variety bias of ID3 algorithm, and has no worse performance in classifying instances then ID3 algorithm.

An automatic text classifier of class-based feature selection algorithm

JIANG Wei-zhen,TAO Hong-cai

2005, 25(11):  2658-2660. 

Asbtract ( )   PDF (754KB) ( )  

Related Articles | Metrics

Current feature selection algorithms are all based on term frequency,and ignore the class information in the training sample set.A new feature selection algorithm based on class information was put forward.The principle of the algorithm is as follows: according to the similarity difference caused by whether or not a word existed in a document,the discriminative power with that this word distinguished different documents could be determined.And then,the discriminative power was taken as the importance for selection.Based on this algorithm,an automatic English text classifier was designed,and the system test and result analysis were made.

New SDG fault diagnosis method based on fuzzy reasoning

LIU Yue,ZHANG Bei-ke,WU Chong-guang

2005, 25(11):  2661-2664. 

Asbtract ( )   PDF (731KB) ( )  

Related Articles | Metrics

The fault diagnosis method based on qualitative SDG deep knowledge model has better completeness,but lower resolution.Because it ignores the fact that the effect is different between different nodes in a SDG graph.To solve this problem, a new method which added the qualitative information of the effect between nodes into the qualitative SDG reasoning by fuzzy matrix was proposed,according to which the priority could be given to the multi-potential fault origin and the resolution could be improved.Different from other fuzzy SDG fault diagnosis methods,this method used the fuzzy matrix instead of membership function,because fuzzy matrix can be got easier than membership function and it can make the computer programming easier.

Similarity matching selection of genetic algorithm

XIE Zhi-wen,YIN Jun-xun,JIN Jing

2005, 25(11):  2665-2667. 

Asbtract ( )   PDF (618KB) ( )  

Related Articles | Metrics

A new matching selection called similarity-matching selection of genetic algorithm was presented and the probabilities of the selection were calculated.An experimental calculation based on the proposed matching selection for a maximum problem was performed.The results show that such a matching selection guarantees the centralization and continuity of the excellent genes and can help to maintain the good gene constructions from the point of real world’s view.Furthermore,from the point of calculation convergence view,the calculation using the new matching selection is not easy to diverge in the small area around the global maximum.Therefore,the speed of convergence can be accelerated.

Particle swarm optimization with dynamic-population for multi-peak searching

ZHANG Xiao-qing,ZHANG Jian-ke,FANG Min

2005, 25(11):  2668-2670. 

Asbtract ( )   PDF (582KB) ( )  

Related Articles | Metrics

A class of dynamic-population particle swarm optimization for searching peaks of some multi-peak functions was proposed.This algorithm transformed all peaks of multi-peak problems into those peaks equally high by functional transformation,in order to find all peaks with the same probability.During the searching the size of particle swarm could be tuned to get any initial size of swarm.So it could solve the problem of determining swarm size because the number of peaks of the given multi-peak function could not be obtained in standard particle swarm optimization.The experiments manifest that the algorithm can search peaks of function as much as possible.

Chaotic system identification based on adaptable T-S fuzzy model and algorithms of GA-annealing strategy

ZHANG Jing

2005, 25(11):  2671-2672. 

Asbtract ( )   PDF (520KB) ( )  

Related Articles | Metrics

The adaptable T-S fuzzy model with adaptable membership functions was proposed to identify chaotic system.The structure and parameters of this model were optimized by the algorithms of GA-Annealing strategy.The simulations to identify chaotic systems of Logistic system and Henon system show that the identified models can approach the original systems and have rapid convergence rate and good precision.

Description and organization of digital map route data in mobile navigation system

FANG Yu,HE Qi-hai

2005, 25(11):  2673-2675. 

Asbtract ( )   PDF (589KB) ( )  

Related Articles | Metrics

The description,organization and management of navigation digital map route data are the key techniques in navigation system design.Based on the analysis of mobile navigation system’s information requirement to route data,a hiberarchy of topologized(HOT) route network model was proposed.The detailed discussion on data objects description and hiberarchy structure definition were described,especially the resolution of network topology.The utilization of this data model in some city traffic information grid confirms its advantages of self-contained description,legible structure and practicability.

Mining fuzzy association rules for processing industry based on fuzzy clustering

YAN Wei,ZHANG Hao,LU Jian-feng

2005, 25(11):  2676-2678. 

Asbtract ( )   PDF (586KB) ( )  

Related Articles | Metrics

To optimize processing industry’s production,the large history data were analyzed by fuzzy association rules.Firstly,the RFCM algorithm and Apriori algorithm were expounded.The production parameters were fuzzed by fuzzy clustering algorithm.Depending on Fuzzy_ClustApriori algorithm,the fuzzy association rules were studied and implemented in processing industry.Then the valuable fuzzy rules were got.Based on the rules,the production of processing industry can be improved.

Mining formula-syndrome relationship in traditional Chinese medicine with gene expression programming

2005, 25(11):  2679-2680. 

Asbtract ( )   PDF (499KB) ( )  

Related Articles | Metrics

To solve the problem in mining formula-syndrome relationship of traditional Chinese medicine,a new approach based on gene expression programming was proposed. An effective and space-saving coding method was presented.The concepts of major homology(HMA) and minor homology(HMI) for formula and syndrome were defined,and a special fitness function based on penalty function method was designed,then the relationship mining algorithm based on improved gene expression programming(MRAGEP) in accordance with the formula-syndrome relationship of traditional Chinese medicine was implemented.It can get an amazing function of good precision.The experiments prove the effectiveness of MRAGEP,and its accuracy is 62.5%.

A logistics delivery model based on the least cost and its hybrid partheno-genetic algorithm

DAI Shu-gui,PAN Yin-rong,HU You-hua

2005, 25(11):  2681-2684. 

Asbtract ( )   PDF (750KB) ( )  

Related Articles | Metrics

Based on the least delivery cost,a logistics delivery model was created.An efficient hybrid partheno-genetic algorithm was proposed.For a practical transport network,the algorithm used the relations among the points to optimize the individuals.Thus the procedure of the evolution was accelerated.The experiment results show that the algorithm has a good performance.

Artificial neural net model analysis of desktop’s color and illuminance

WANG xiang,WANG Feng-hu,SUN Jian-ping

2005, 25(11):  2685-2687. 

Asbtract ( )   PDF (656KB) ( )  

Related Articles | Metrics

An artificial neural net(ANN) model was established for considering multi physical factors’ effects on reading environment.Typical back-propagation net(BP net) with three layers was selected with input parameters of illuminance and desktop’s brightness,outputing relative reading gross and reading accuracy.The ANN model could consider several factors’ effects on reading working at the same time,figuring out multi-parameters and strong coupling in reading environment.Using the ANN model,illuminance and brightness were analyzed,and relative reading gross and reading accuracy were calculated under different reading environments.

Typical applications

Workflow exception management based on intelligent agent

TAO Ming-liang,YIN Dong

2005, 25(11):  2688-2691. 

Asbtract ( )   PDF (914KB) ( )  

Related Articles | Metrics

Exceptions,especially business exceptions of workflow are always the problems which are ignored and hard to be solved.The shortage of exception management in different workflow products were analyzed.To overcome these shortages,agent technology was adopted to implement an automative,interactive,reflective,pre-active and intelligent workflow exception management.

Relation-based flow control model

SONG Zhi,LIU Jian,ZHANG Yan

2005, 25(11):  2692-2694. 

Asbtract ( )   PDF (766KB) ( )  

Related Articles | Metrics

The model of start node,the model of activation,the model of flow’s operation and the model of stop node in workflow technology were thoroughly discussed.Based on traditional relationship database system,a relationship-based flow control model was proposed.The application of this relation-based flow control model was explained.

Study of reusable pattern-based business modeling

YANG Zhao-jun,YANG Nai-ding,ZHANG Ya-li

2005, 25(11):  2695-2697. 

Asbtract ( )   PDF (576KB) ( )  

Related Articles | Metrics

Current modeling methodologies are lack of reusability in business modeling.The relations between patterns and question domains were analyzed,then a process of modeling business based on analysis pattern and business pattern was proposed.An example of business modeling of enterprise equipment management by measurement pattern and resource allocation pattern was given.

Research and application of wrapping information stream into service data in grid system

IAO Bin,HUANG Yong-zhong,YANG Kai

2005, 25(11):  2698-2700. 

Asbtract ( )   PDF (610KB) ( )  

Related Articles | Metrics

In the framework of OGSA,all resources are abstracted into grid service and the information of resources is described into service data.The mechanism of wrapping information stream into service data in grid system based on the idea of grid service was analysed.A concrete application of wrapping cluster host information into service data was given.

Availability management with message bus in supercomputer system

DONG Yan-shan,LEI Ming,GUO Yu-dong

2005, 25(11):  2701-2702. 

Asbtract ( )   PDF (395KB) ( )  

Related Articles | Metrics

The difficulties of availability management design in supercomputer system were discussed.An availability management mode based on message bus was put forward. The design and realization of message bus was described in detail and the capability test of message bus was offered.The availablity management on a kind of supercomputer with message bus architecture was designed and implemented.

Principle and implementation of service-oriented message middleware

TANG Jun,WU Yong-ying

2005, 25(11):  2703-2704. 

Asbtract ( )   PDF (594KB) ( )  

Related Articles | Metrics

The model of service-oriented middleware based on message,could easily realize the load balancing of system after introducing the work principle of Web Services;using the logic communication routeway of MOM.It could achieve high flexibility and support the classic C/S service pattern.

A method study of business rules integration in BPEL

LI De-sheng,WANG Hai-yang

2005, 25(11):  2705-2708. 

Asbtract ( )   PDF (795KB) ( )  

Related Articles | Metrics

Business rules is the provision or norm that defines and restricts enterprise business structure and business behavior,as well as an important resource to enterprise business operation and management decision.Nowadays,the service-oriented computing paradigm is becoming more and more popular.Web services have become a universal technology for integration of distributed and heterogeneous applications over the Internet.Services offered by different providers are composed to new services by using Web service composition language such as BPEL.Such process-based composition languages lack the ability to use business rules managed by different business rules engines in the composition process.An approach on how to use and integrate business rules in a service-oriented way into BPEL was proposed.

.NET-based container managed persistence

LI Fang-sheng,ZHU Min

2005, 25(11):  2709-2711. 

Asbtract ( )   PDF (679KB) ( )  

Related Articles | Metrics

Because of the advantage of EJB in mantenance and extensibility,J2EE architecture was widely used in developing large E-commerce application.But the elusiveness of EJB means more spending and hard to use.A simplified.NET-based container managed persistence was introduced.It provided an excellent persistence container.

Implementing a Linux-based Java graphic platform on smart phone

GAO Juan,FU Cheng,YOU Jin-yuan

2005, 25(11):  2712-2714. 

Asbtract ( )   PDF (566KB) ( )  

Related Articles | Metrics

The requirements to hardware and software of smart phones are comparatively high.In the software aspect,it needs a GUI platform that can support Java programs at least.QT/Embedded is a very good embedded GUI that supports Java programs for smart phones.The implementation of the Java graphic platform on smart phone was introduced.

Development of a large number of timers in communcaition system

ZOU Shi-xiang

2005, 25(11):  2715-2716. 

Asbtract ( )   PDF (600KB) ( )  

Related Articles | Metrics

A method to realize a large number of timers quickly by software was proposed,and the software was called Timer Management Module(TMM).TMM set m timing precisions and n time-out values for each precision.The timers with same precision and time-out value were linked together,TMM set m circular pointers,named Pos[1..m],which recorded the sequence number of the links,in which the timers had latest expired.When creating a timer,TMM first chose an appropriate timing precision according to the time-out value,and calculated the position,then insertd the timer node into the corresponding link.The circular pointers Pos,driven by system clock,moved around with their own frequency. When a circular pointer moved to a certain position,all timers in the corresponding link had already expired.By no sorting and reducing the comparison times, the algorithm cuts down the overhead of management timers greatly.

Research and implementation of PCI interface based on FPGA in high-speed communication

WU De-ming,LU Da

2005, 25(11):  2717-2719. 

Asbtract ( )   PDF (607KB) ( )  

Related Articles | Metrics

Some common methods for implementing PCI interface were introduced and their advantages and disadvantages were analysed.An implementing method of PCI interface in high-speed communication of multiprocessor by using Xilinx PCI softcore was proposed.The PCI interface integrated PCI core,two asynchronous First-In First-Out(FIFO) data buffers and one transceiver,which was implemented in one FPGA.The PCI interface works reliably and easily and can be applied to multiprocessor high-speed communication.

Solving life and death problems in Go

LIAO Li

2005, 25(11):  2720-2722. 

Asbtract ( )   PDF (591KB) ( )  

Related Articles | Metrics

An approach to solve life and death problems in Go,which was based on search algorithm,was presented.With this approach,the program SharpSense was implemented.Experiments show that SharpSense outperforms other programs solving life and death problems in Go.And in solving enclosed problems,SharpSense has the capability of professional Go player.SharpSense detects two errors in All about Life and Death Problems in Go,which is the classic in this domain.