Table of Content

25 September 2008, Volume 36 Issue 9

Previous Issue    Next Issue

Computer Science & Technology

Support Vector Machine for Classification Based on Cognitive Geometry

Wen Gui-hua Zhu Jin-feng Lu Ting-hui

2008, 36(9):  1-5. 

Asbtract ( 569 )   PDF (333KB) ( 827 )  

Related Articles | Metrics

School of Computer Science and Engineering, South China University of Technology, Guangzhou 510640, Guangdong, ChinaAbstract:Although a support vector machine （SVM） has excellent classification ability for small data sets, it is still inefficient for noisy or sparse data sets. As humans can effectively deal with noisy and sparse data, a geometric approach of modeling human＇s cognitive abilities is proposed in this paper. Moreover, a geometric model of the relative cognitive law is established via relative transformation and is then used to improve SVM. It is indicated from the simulation that the classification capability of the improved SVM for noisy and sparse data sets significantly increases.

An Improved Adaptive Particle Swarm Optimization Algorithm

Xu Gang Qu Jin-ping Yang Zhi-tao

2008, 36(9):  6-10. 

Asbtract ( 616 )   PDF (317KB) ( 1011 )  

Related Articles | Metrics

According to the search failure for large-scale problem via the particle swarm optimization algorithm, the convergence of particle swarm optimization algorithm is analyzed and the relationship between the particle velocity and the search failure is pointed out. Then, an adaptive parameter-adjusting particle swarm optimization algorithm according to the velocity information is put forward. Under the convergent conditions, the proposed algorithm can perform the search by adaptively adjusting the parameters according to the ideal velocity. Experimental results indicate that the proposed algorithm avoids the local optimization and divergence commonly occurred in the conventional particle swarm optimization algorithm in multi-dimension and multi-peak conditions.

Fast Generation Algorithm of Agent Coalition in Parallel Multi-Task Environment

Hao Zhi-feng Cai Rui-chu

2008, 36(9):  11-14,30. 

Asbtract ( 620 )   PDF (329KB) ( 1420 )  

Related Articles | Metrics

A multi-colony ant colony optimization （MCACO） is proposed for the coalition generation problem in the parallel multi-task environment. In this algorithm, the ants from the same colony cooperate to accomplish a task by reasonably allocating the resources, while those from different colonies scramble the resources and resolve the resource conflict among multiple parallel tasks. Moreover, a specially-designed pheromone update rule is applied to enhance the global search ability of MCACO and improve the generation quality of agent coalition by taking the tradeoff between the local optimization benefit and the global one. Simulation results indicate that the proposed rithm helps to generate more effective coalition in multiple benchmark environments.

A Method of On-Line Dynamic Inspection for Network Packet Contents

Xu Ke-fu Qi De-yu Qian Zheng-ping Xiang Jun Zheng Wei-ping

2008, 36(9):  15-19. 

Asbtract ( 518 )   PDF (359KB) ( 672 )  

Related Articles | Metrics

In the high-speed inspection of network contents, the multi-pattern matching algorithm is inefficient and the pattern set continuously changes. In order to solve these problems, an on-line dynamic inspection method with two loosely-coupled pipelines is proposed. This method consists of a fast pipeline and a slow one. In the fast pipeline, parallel Counting Bloom filter engines which can perform fast dynamic query are adopted to filter the network packet, while in the slow one, a high-performance dynamic pattern matching algorithm is adopted to distinguish the suspicious packet coming from the fast pipeline. Thus, the block to normal packets can be removed and the on-line inspection can be achieved. Moreover, according to the locality principle of programs, a length threshold is set to implement the scalability for long rules. Analytical and simulated results indicate that the proposed inspection method with high throughput meets the requirements of on-line dynamic inspection of network packet contents well with low hardware consumption and high scalability.

Active Queue Management Algorithm Based on Congestion Forecast Threshold

Lai Jun Ye Wu Feng Sui-li

2008, 36(9):  20-24. 

Asbtract ( 475 )   PDF (349KB) ( 691 )  

Related Articles | Metrics

In order to solve the problem of sharp decline in performance which exists in Drop Tail gateways and to find a novel algorithm that is easy to implement and can adapt parameters according to the variation of network, an active queue management （AQM） algorithm with explicit congestion notification （ECN） named bandwidth-delay product queue （BDPQ） is proposed. In this algorithm, the congestion in the buffer of the bottleneck gateway is monitored according to the current queue length, and the bandwidth-delay product is used as the threshold for congestion detection. If the queue length exceeds the threshold, the dequeuing packets will be marked according to the ECN policy to notify the congestion to the TCP source. Simulated results show that the proposed algorithm is of high link utilization, short mean queue, low loss rate and good fairness.

Outlier Detection Method Based on Improved Distance

Wei Jia Peng Hong Lin Yi-shen

2008, 36(9):  25-30. 

Asbtract ( 627 )   PDF (389KB) ( 1936 )  

Related Articles | Metrics

As an effective manifold-learning method, the local tangent space alignment （LTSA） algorithm is sensitive to outliers. In order to enhance the robustness of LTSA algorithm, an outlier detection method based on the improved distance is presented in this paper. In this method, the improved distance is used to measure the distance of the samples for the purpose of reducing the negative influence of the nonuniform distribution of the samples. Experimental results demonstrate that the proposed data preprocessing method can effectively improve the robustness of the LTSA algorithm and can discover the intrinsic characteristics of the dataset with better visualization effect.

An Extended Knowledge Discovery Framework for Outlier Data Set

Jin Yi-fu Zhu Qing-sheng

2008, 36(9):  31-36. 

Asbtract ( 643 )   PDF (452KB) ( 696 )  

Related Articles | Metrics

The existing researches on outlier data mainly focus on the outlier detection. In order to completely analyze the origin, classification, meaning, behavior characteristics and outlying trend of outlier data, some concepts such as the nearest outlying neighbor, the atomic outlier class and the outlying mutation class are defined and the approaches to outlier clustering and outlying trend analyses are proposed based on the existing outlier mining techniques as well as a series of concepts and their searching algorithms including the outlying reduction and the key attribute subspace. Furthermore, an integrated framework of characteristic description and extended knowledge discovery of outlier data set is constructed, whose validity in practical applications is finally verified by the outlier analysis of mobile communication operation data.

Topic-Based Document Retrieval Model

Jia Xi-ping Peng Hong Zheng Qi-lun Shi Shi-xu Jiang Zhuo-lin

2008, 36(9):  37-42. 

Asbtract ( 519 )   PDF (397KB) ( 662 )  

Related Articles | Metrics

As most existing document retrieval models are inefficient in semantic learning and are unable to learn the document similarity in topic level, a topic-based document retrieval model （TDRM） is p TDRM provides a common topic space for all documents, represents each document as a vector in the common space, defines the document similarity as the cosine of the angle between document vectors, and uses Latent Dirichlet Allocation to learn the topic distribution of each document. Experimental results show that, as compared with the document similarity model based on the TextTiling and the optimal matching of bipartite graph, TDRM is of higher average precision and recall in the retrieval of similar document, with its harmonic mean of average precision and recall being 44% greater than that of the reference model.

Improved Majority Ordering Algorithm of Multi-Document Summarization Sentence

Jiang Xiao-yu Fan Xiao-zhong Chen Kang

2008, 36(9):  43-47,70. 

Asbtract ( 583 )   PDF (406KB) ( 861 )  

Related Articles | Metrics

In order to overcome the shortcomings of the Chronological Ordering and the Majority Ordering methods for summarization sentences, a new ordering algorithm that combines the mutual cohesion among themes and the Majority Ordering method is proposed. Based on the statistical data about the relative position in each pair of themes, a directed graph of the themes is built and the corresponding mutual cohesion is computed. In the ordering process, when a vertex is output from the directed graph, the vertex possessing the greatest cohesion with the vertex is searched from the remaining vertexes. If the cohesion is bigger than the threshold value, the sentences from the two themes corresponding to the two above-mentioned vertexes are placed on adjacent locations in the summarization. Experimental results show that the summarization generated by the proposed ordering algorithm is more coherent and readable.

An Improved Rank Merging Algorithm for Meta Search

Li Hong-mei Ding Zhen-guo Zhou Shui-sheng Zhou Li-hua

2008, 36(9):  48-51. 

Asbtract ( 584 )   PDF (296KB) ( 690 )  

Related Articles | Metrics

In order to improve the precision of meta search engine, an improved merging algorithm of meta search results is proposed. In this algorithm, first, the text-based information obtained from search results is analyzed and both the query-match grade and the result relevancy are considered to give an approach on the text normalization for meta search. Next, the relevant scores of documents are normalized by incorporating text analysis with the ranks given by the search engines for the purpose of adjusting the local similarities. Then, based on the performance evaluation of underlying search engines, an improved shadow document method is presented to evaluate the scores of non-relevant documents. Finally, a merging method based on the group decision making is adopted to sort the search results. It is found from the tested results in an actual Web environment that the search results obtained by the proposed algorithm are of higher relativity than those by the existing merging algorithms.

Cryptanalysis of Secret-Sharing Multi-Signature Scheme Without Trusted Centre

Wang Tian-yin Wen Qiao-yan

2008, 36(9):  52-54. 

Asbtract ( 656 )   PDF (189KB) ( 675 )  

Related Articles | Metrics

In this paper, a new secret-sharing multi-signature scheme without trusted center is analyzed, and a forged attack is given. By using this attack, any attacker can easily forge a valid secret-sharing multi-signature, so that the scheme is not secure. In order to solve this problem, an improved scheme is given, in which all the signers participating in the signing jointly determine the needed signature parameters and only in the case of the signers with the threshold number working together can an effective secret-sharing multi-signature be generated. It is proved that the improved scheme is more secure and effective in resisting the above-mentioned forged attack.

Access Granting Protocol of DRM System Based on Proxy Signature Scheme

Deng Yu-qiao Du Ming-hui

2008, 36(9):  55-58. 

Asbtract ( 578 )   PDF (284KB) ( 872 )  

Related Articles | Metrics

In order to solve the bottleneck problem of the signing server due to the purchase of electronic products via DRM systems used by more and more users, a DRM system consisting of multiple signing servers is designed based on the principle of proxy signature, and an access granting protocol based on the system is presented. As there are multiple signing servers to share the burden, the burden on each server is lightened and the stability of the system can be guaranteed. Moreover, it is mathematically proved that the integrated security of the multi-signing server system is not less than that of the single-singing server one.

An Adaptive Synchronous Audio Watermarking Algorithm

Shi Hua-ji Tang Hui Zheng Hong-yuan Li Xing-yi Ding Qiu-lin

2008, 36(9):  59-63. 

Asbtract ( 530 )   PDF (338KB) ( 740 )  

Related Articles | Metrics

In order to overcome the shortcomings of Garcia＇s watermarking algorithm, an improved adaptive synchronous audio watermarking algorithm is proposed. In this algorithm, both the psychoacoustic model and the auditory masking threshold are used to determine the embedding positions of watermarking for the purpose of ensuring the imperceptibility of watermarking, the synchronization code is embedded in the audio signal in time domain to withstand synchronous attacks, and the audio signal is segmented and the watermarking is self-adaptively embedded in each segment. Moreover, a sequence number is embedded in the front of each segment to discriminate different segments. Experimental results show that the proposed algorithm is robust against synchronous attacks and effective in processing common audio signals, and that it obviously improves the imperceptibility of watermarking.

Optimization Models of ERP Implementation Project Based on Chance-Constrained Programming

Wang Shao-jun Wang Gang LU Min Gao Guo-an

2008, 36(9):  64-70. 

Asbtract ( 694 )   PDF (451KB) ( 898 )  

Related Articles | Metrics

In order to solve the uncertain optimization problems of time, cost and quality existing in the project implementation process of enterprise resource planning （ERP）, the program evaluation and review technique （PERT） is employed to establish the optimization models of the implementation schedule, the implementation schedule-cost tradeoff, the implementation quality and the implementation schedule-cost-quality tradeoff. Then, the risk probability of project implementation is estimated via the Monte Carlo simulation. Moreover, a PERT-embedded genetic algorithm based on the stochastic simulation technique is introduced to solve the proposed models. It is demonstrated by an example that the proposed models and algorithm are reasonable and effective, and are reliable for the programming of ERP project implementation.

A Deduction-Based Decision Method of Propositional Formulas

Qi De-yu Li Xiao-xin

2008, 36(9):  71-76. 

Asbtract ( 739 )   PDF (389KB) ( 818 )  

Related Articles | Metrics

As most of the present decision methods of propositional formulas are based on semantics and cannot give an important reference in many reasoning applications, namely deduction procedure, a deduction-based decision method that can give the deduction procedure during the decision procedure is presented based on the propositional calculus system L. Two normal forms, namely the simplest normal form and the literal one, are defined to overcome the complexity of formula decision. Based on the two normal forms, the decidability theorem in L is then proved and a deduction-based decision algorithm P（F） is designed. The time complexity O（ n³） of P（F） is much less than the complexityO （ 2ⁿ ） of the true value table method and the complexity O（ n⁵ ） of HAL based on the tactic scheme.

Electronics, Communication & Automation Technology

A Compact Planar Ultra-Wideband Antenna with Notch Characteristics

Chu Qing-xin Yang Ying-ying

2008, 36(9):  77-80,93. 

Asbtract ( 585 )   PDF (341KB) ( 786 )  

Related Articles | Metrics

In order to minimize the potential interferences between the uhra-wideband system and the narrowband system, a compact coplanar waveguide fed planar antenna with band notch is presented for the uhra-wideband system. By taking the rectangular metal patch on a printed circuit board as the radiation element and by cutting a C-shaped slot in the rectangular patch, a frequency band notch is implemented. Simulated and measured results indicate that the proposed antenna yields an voltage-standing wave ratio （VSWR） of less than 2 in the impedance bandwidth range of 3.1 to 10.6 GHz, except the bandwidth of 5.0 - 6.0 GHz for band notch. Thus, the negative effect of WLAN on uhra-wideband system is eliminated and stable gain as well as good radiation patterns is obtained in the whole bandwidth range.

Multi-Scale Fractional Lévy Stable-Motion Model of Underwater Image

Li Xu-tao Jin Lian-wen Gao Xue Yin Ming

2008, 36(9):  81-85. 

Asbtract ( 616 )   PDF (311KB) ( 791 )  

Related Articles | Metrics

This paper analyzes the increment distribution and self-similarity of typical underwater images. In order to overcome the disadvantages of the traditional fractal Brownian motion （FBM） model, a muhi-seale fractional Lévy stable-motion （MFLSM） model is proposed based on the fractional Lévy stable-motion （FLSM） model, in which the self-similarity parameter of image surface is considered as a variable to vary with the measure scale. The model is then extended to a 2D space and is further employed to simulate underwater scattering images. The results show that the proposed MFLSM model represents the multi-scale self-similarity and the speckle of underwater optical images well.

Influence of Matrix Creation Way on Signal Processing Effect of Singular Value Decomposition

Zhao Xue-zhi Ye Bang-yan Chen Tong-jian

2008, 36(9):  86-93. 

Asbtract ( 674 )   PDF (496KB) ( 1577 )  

Related Articles | Metrics

Generally, two kinds of matrices can be created by a one-dimension signal. The first one is always created by the continuous interception of signal, while the second one is a reconstruction attractor matrix. It is proved that a signal can be decomposed into the linear superposition of a series of component signals by singular value decomposition （SVD） using these two kinds of matrices. However, the component signals obtained by the first kind of matrix are orthogonal with each other, while those obtained by the second one are correlative with each other. The structure of both kinds of matrices can be rationally determined by the variation trend of information quantity of component signals. The processing results of a milling force signal show that, by using the first kind of matrix, the complete fundamental waveform of main spindle of miller is isolated, two component signals with close frequency are distinguished, and the phenomenon of amplitude modulation hidden in signal is also extracted; while by using the second one, the faint shock to cutter due to the uneven granule and rift in workpiece material is revealed.

Scheduling Algorithm for Rate-Distortion Optimization of H. 264 FMO Stream

Zhou Wei Ye Wu Feng Sui-li Ai Yu-hua

2008, 36(9):  94-99,112. 

Asbtract ( 622 )   PDF (470KB) ( 744 )  

Related Articles | Metrics

As compared with Transmission Control Protocol （TCP）, User Datagram Protocol （UDP） works more timely, but the packet lose limits its application to real-time streaming media transmission. In order to solve this problem, the error resilience of H. 264 bit-stream adopting Flexible Macroblock Order （FMO） is analyzed by ex- periments, and an UDP channel model is established. Moreover, in order to solve the error resilience and the realtime transmission problems, a scheduling algorithm for rate-distortion optimization of H. 264 FMO stream is proposed. By the proposed algorithm, a minimum rate distortion can be achieved because transmission parameters can vary with the UDP channel situation. Simulated results indicate that the proposed algorithm outperforms other scheduling algorithms due to its high transmission performance in UDP channel situation and the friendship of UDP packet to TCP packet.

A Novel Adaptive Rate Control Algorithm for H. 264 Frame Layer

Lan Tian Gu Xue-mai Guo Qing Wang Zhen-yong

2008, 36(9):  100-106. 

Asbtract ( 605 )   PDF (504KB) ( 695 )  

Related Articles | Metrics

As the existing rate control algorithms for H. 264 frame layer do not consider the relationship between the encoding complexity of video sequence and the available channel bandwidth, a novel rate control algorithm is proposed. In this algorithm, each video sequence is divided into several scenes, and the channel bandwidth sufficiency is introduced to describe the relationship between the encoding complexity of each scene and the available channel bandwidth. Moreover, the target bit and the quantization parameter are adjusted according to the channel bandwidth sufficiency and the relative encoding complexity measurement based on block histogram. Simulated results show that, as compared with JVT-G012, the proposed algorithm can achieve better trade-off among compressed video quality, available channel bandwidth and encoder buffer fullness under different channel bandwidth sufficiencies.

Relevance Feedback of Image Retrieval Based on Multi-Class Fuzzy Support Vector Machines

Luo Bin Zheng Ai-hua Tang Jin

2008, 36(9):  107-112. 

Asbtract ( 633 )   PDF (373KB) ( 983 )  

Related Articles | Metrics

In order to overcome the inherent asymmetry and the small sample size of relevance feedback （ RF）, a RF algorithm of image retrieval is proposed based on the modified multi-class fuzzy support vector machines （ FSVMs）. In this algorithm, the RF is considered as a multi-class classification problem between one relevance class and several irrelevance classes, and the original membership function of FSVMs is modified to avoid negative values. Moreover, the conventional constrained random selection method is extended to a multi-class case, and a memory marking method is used to lighten the burden of multi-class marking and to decrease the classification error. Experimental results demonstrate that the proposed algorithm helps to obtain satisfying retrieval results with less feedback times.

Image Edge Detection Algorithm Based on Mathematical Morphology

Liu Qing Lin Tu-sheng

2008, 36(9):  113-116,121. 

Asbtract ( 722 )   PDF (294KB) ( 2171 )  

Related Articles | Metrics

It is known that the traditional edge detection methods are effective but are sensitive to noise, and that most mathematical morphology-based edge detection algorithms are insufficient for complex edge feature due to their single structure element. In order to solve these problems, a novel muhi-structure element multi-scale edge detection algorithm based on mathematical morphology is proposed. In this algorithm, the noise is filtered by an alternative-order morphological open-close filter with a multi-scale element, the edge information in different directions is obtained using multi-structure elements and is further fused to generate the final edge. Experimental results show that the proposed algorithm is insensitive to noise and is efficient in complex edge detection.

Feature Fusion Method Based on KCCA and Multi-Modality Recognition Fusing Ear and Face Profile Information

Xu Xiao-na Mu Zhi-chun Pan Xiu-qin Zhao Yue

2008, 36(9):  117-121. 

Asbtract ( 570 )   PDF (330KB) ( 1444 )  

Related Articles | Metrics

In order to implement the non-intrusive recognition, a multi-modality recognition method of biometric feature is proposed based on the fusion of ear and face profile information. As there is a special physiological location relationship between ear and eye, only the profile-view face images need to be captured for recognition. By introducing the kernel trick to the canonical correlation analysis （CCA） , a feature fusion method based on kernel CCA （KCCA） is established and is then used to capture the associated feature of ear and eye for classification and recognition. Simulated results indicate that the proposed feature fusion method based on KCCA is effective, and that the multi-modality recognition based on ear and face biometrics is of higher performance than the unimodal bio- metric recognition based on ear or face profile. Thus, there comes an effective approach to the non-intrusive biometric recognition.

3D Visualization System for 3D Conformal Radiotherapy Treatment Planning

Li Bin Tian Lian-fang Wang Li-fei Mao Zong-yuan

2008, 36(9):  122-127. 

Asbtract ( 673 )   PDF (425KB) ( 974 )  

Related Articles | Metrics

In a 3D conformal radiotherapy treatment （3D CRT） planning, the 3D visualization technology is necessary to the acquiring of 3D visual information and to the target determination. This paper develops a 3D visualization system of the 3D CRT planning. In the system consisting of the function modules such as image segmentation, muhi-modality image registration and fusion, 3D reconstruction, 3D recognition and target contour delineation, the fusion of muhi-modality image is realized by means of the wavelet transform-based fusion method and the fusion rule through the combination of the local standard deviation and the local energy, and the volume rendering of 3D images is rapidly implemented via the improved Shear-Warp method. Experimental results demonstrate that the proposed system helps to well implement the visualization in 3D CRT planning.

Design of CMOS Voltage Reference for Low Voltage and Low Power Consumption

Cai Min Shu Jun

2008, 36(9):  128-131. 

Asbtract ( 620 )   PDF (257KB) ( 888 )  

Related Articles | Metrics

In order to effectively decrease the power consumption of analog integrated circuits and improve the technology compatibility, a design method of low-voltage low-power consumption voltage reference with fully CMOS configuration is presented based on the MOS transistors in sub-threshold region. In this method, the negative feedback system constructed by the PTAT current source and the micropower operation amplifier is employed to improve the power-supply rejection ratio （PSRR）. Simulated results demonstrate that, with a power supply voltage of 1.0 V, the circuit exhibits an output voltage of 609mV, a temperature coefficient of 46 × 10^-6/K and a total power supply current of 1.23 μA, that when the supply voltage ranges from 1.0~ to 5.0V, the power supply is of a voltage sensitivity of 130 μV/V and a low-frequency PSRR of 74. 0 dB, and that the proposed circuit has good compatibility for CMOS technology due to the adopted full CMOS construction without parasitic bipolar junction transistors.

Cause Analysis of Formation of Achromic Power Fluctuation in Lithopone Rotary Kiln

Du Qi-liang Mo Hong-qiang Mao Zong-yuan

2008, 36(9):  132-135,144. 

Asbtract ( 613 )   PDF (330KB) ( 655 )  

Related Articles | Metrics

As a key performance index of lithopone calcination, the achromic power in a rotary kiln process is fluetuant. In order to ascertain the reasons for the fluctuation, a data series of the achromic power is analyzed. In the investigation, first, strong harmonics in the power signal are revealed via Fourier transform （FT） , which means that there is a certain periodicity of the achromic power fluctuation. Next, in order to find out the details of the fluc- tuation and deal with the non-stationarity, Hilbert-Huang transform （HHT） is used to analyze the marginal spectrum and spatial time-frequency distribution of the signal. Then, by the analysis of Hilbert spectrum, the time and duration of the fluctuation are obtained. Finally, on the basis of practical data, the reasons for the fluctuation are pointed out from the viewpoints of management and technique, thus helping to trace the quality accidents.

Design Proposal for Robot Servo System Based on MatlabRTW

Jiang Liang-zhong Yang Jin Yang Zhi Zhang Zong-bao

2008, 36(9):  136-139. 

Asbtract ( 585 )   PDF (272KB) ( 774 )  

Related Articles | Metrics

As the servo system of robot is a multi-variable nonlinear control system, there exist many complex problems in the system development, thus resulting in the difficulty in the development of the robot control system. In order to solve this problem, a design proposal for robot servo system based on MatlabRTW is presented. Then, by taking an explosive disposal robot with 5 degrees of freedom as the object, the framework of the servo system is designed in MatlabRTW environment, and is compiled into a real-time system running on X86 computer through xPC target system. Moreover, with the employment of a set of PID complex controllers, the system becomes expert. Application results demonstrate that, by adopting the proposed scheme, the robot stably runs in a large loading range with good robustness and real-time ability, and that the rapid prototyping of robot servo system is easy to implement.

LMI Solution to Invariant Set in a Class of Hybrid System

Li Jian-qiang Pei Hai-long Yuan Ling

2008, 36(9):  140-144. 

Asbtract ( 590 )   PDF (328KB) ( 698 )  

Related Articles | Metrics

In order to solve the problem of existence of the invariant sets in hybrid systems, a class of hybrid system with perturbed disturbance is investigated. By proposing a common Lyapunov function, the existence of invariant set is proved. Moreover, by constructing a Lyapunov function, the existence is calculated based on the linear matrix inequality （LMI） method, the switch laws and sub-system domains of the hybrid system are obtained, and the do- main of the invariant set is further computed. A numerical example is finally presented to confirm the feasibility and effectiveness of the proposed method.