Table of Content

25 January 2007, Volume 35 Issue 1

Previous Issue    Next Issue

Electronics, Communication & Automation Technology

Sensing Approach for Automobile Braking PerformanceUsing Tire-Mounted Accelerometer

Lin Tu-sheng Pan Meng-yao Du Ming-hui

2007, 35(1):  1-6. 

Asbtract ( 284 )   PDF (374KB) ( 672 )  

Related Articles | Metrics

As the malfunction of automobile braking system is life threatening , a monitoring scheme of dynamic automobilebraking performance using MEMS (Micro-Electro-Mechanical System) capacitive accelerometer is proposed.In this scheme , the accelerometer set is fixed in the tire to collect the radial acceleration , and the signals ofradial acceleration in the braking period are sent to the outer receiving system by wireless communication. The signalsare then used as a basis for the later transformation from radial acceleration to tire acceleration and for the evaluationof braking performance. Moreover , the components of the radial acceleration are theoretically derived , andthe processing methods such as the signal sampling , the dynamic marking and storing , the noise removing , theslope comparison and the onset detection of braking operation are described. The results of hardware experimentsverify the feasibility of the tire-mounted accelerometer approach.

Bounded Adaptive Stabilization for a Class ofLarge-Scale Stochastic System

Wu Sai Deng Fei-qi

2007, 35(1):  7-12. 

Asbtract ( 261 )   PDF (321KB) ( 537 )  

Related Articles | Metrics

The stabilization problem of a class of large-scale stochastic nonlinear system with bounded uncertaintiesin strict-feedback form is investigated. By fully considering the effects of interconnections among all subsystems , astate observer for such a kind of combined system is designed. Then , a decentralized adaptive output feedback controlleris designed by means of the backstepping approach and by constructing quartic stochastic control Lyapunovfunctions. So , the closed-loop , interconnected and large-scale stochastic nonlinear system is boundedly stable inprobability. Simulated results verify the effectiveness of the proposed control algorithm.

Elevator Group-Control Policy with Destination Registrationßased on Fuzzy Neural Network

Xu Yu-ge Luo Fei Cao Jian-zhong

2007, 35(1):  13-18. 

Asbtract ( 321 )   PDF (448KB) ( 972 )  

Related Articles | Metrics

This paper analyzes and sums up the characteristic attributes of elevator group-control system with destinationregistration according to the new flow distribution modes of the elevator system , and proposes a new elevatorgroup-control policy based on multi-objective fuzzy neural network. The proposed policy regards the characteristicattributes of the elevator system as the inputs to establish a multi-objective fuzzy neural network , which is thentrained and used as the elevator group-control calculator. This novel elevator group-control calculator can be used todispatch elevators. Simulated results show that the proposed policy is of excellent performance. Moreover , as comparedwith the traditional elevator group-control policy and some other elevator group-control policies with destinationregistration , the proposed policy behaves better in average waiting and riding time , long-waiting ratio , long-ridingratio and power consumption , especially in down peak traffic pattem.

Chaotic Genetic AIgorithm with Feedbackand Its Applications to Constrained Optimzation

Sun You-fa Gao Jing-guang Zhαng Cheng-ke Deng Fei-qi

2007, 35(1):  19-23. 

Asbtract ( 313 )   PDF (344KB) ( 660 )  

Related Articles | Metrics

The existing genetic algorithms are generally lost in a dilemma between prematurity and slow-convergence.In order to solve this problem , a new chaotic genetic algorithm with feedback is proposed by introducing thechaotic mapping and the posterior reinforcement leaming in the standard genetic algorithm. In this algorithm , theevolution population maintains a good diversity via the chaotic mapping , and the stochastic evolution is overcome bythe posterior reinforcement leaming based on Baldwin effect. Numerical experiments are finally carried out aimingat the complex constrained optimization problems , namely the benchmark problems. The results show that the proposedalgorithm is effective and robust.

Fault Diagnosis of Complex System Based on CRPN Model

Guo Ya-zhong Zuo Hong-fu Wang Hua-wei

2007, 35(1):  24-27,33. 

Asbtract ( 303 )   PDF (359KB) ( 635 )  

Related Articles | Metrics

The traditional fault-diagnosing method cannot locate the fault due to the complexity in structure and operationenvironment of a complex system. In order to overcome this difficulty , the method of case-based reasoningand the Petri net theory are introduced in the fault diagnosis , and a CRPN (Case-based Reasoning Petri Nets) modelis established based on the two above-mentioned methods. The key problems of the CRPN model , such as thetranslation rules and the case characteristics , are then investigated. By using a two-layer CRPN model , the difficultyin modeling and the fuzzy in reasoning process during the fault diagnosis of a complex system can be effectivelyovercome. Finally , as an example , the proposed method is applied to a system of aircraft to reveal the process offault diagnosis based on the CRPN model. The results show that the proposed method is effective.

Enhanced Algorithm for Simulation of PowerSpatial-Temporal Distribution in Cellular Environments

Luo Fei Du Ming-hui

2007, 35(1):  28-33. 

Asbtract ( 276 )   PDF (397KB) ( 863 )  

Related Articles | Metrics

In order to make a better simulation of the power spatial-temporal distribution in cellular environments ,two concepts with definite physical meanings , namely "effective scatterer" and "reflecting probability" , are introducedto propose an enhanced simulation algorithm based on the Geometrically Based Single Bounce Elliptical Model(GBSBEM). The enhanced algorithm can characterize the power spatial-temporal distribution in cellular environmentsmore accurately and flexibly. the comparison between the simulated and the measured results shows that ,in the prediction of power delay spectra , the enhanced algorithm and the GBSBEM are of the same precision , whilein the prediction of power azimuth spectra , the former is of a smaller mean-square relative error than the latter.

Image Content Authentication Technique Based on Laplacian Pyramid

Wo Yan Han Guo-qiang

2007, 35(1):  34-37,69. 

Asbtract ( 318 )   PDF (435KB) ( 300 )  

Related Articles | Metrics

This paper proposes a technique of image content authentication based on the Laplacian pyramid to verifythe authenticity of image content. First , the image is decomposed into Laplacian pyramid before the transformation.Next , the smooth and detailed properties of the original image are analyzed according to the Laplacian pyramid , andthe properties are classified and encoded to get the corresponding characteristic values. Then , the signature derivedfrom the encrypted characteristic values is embedded in the original image as a watermark. After the reception , thecharacteristic values of the received image are compared with the watermark drawn out from the image , and the algorithmautomatically identifies whether the content is tampered by means of morphologic filtration. The informationof tampered location is presented at the same time. Experimental results show that the proposed authentication algorithmcan effectively detect the event and location when the original image content is tampered , and can toleratesome distortions produced by compression , filtration and noise degradation.

Gradient-Based Motion Measurement viaMulti-Image Wavelet Transform

LU Qing-hua ZHANG Xian-min

2007, 35(1):  39-43. 

Asbtract ( 295 )   PDF (333KB) ( 760 )  

Related Articles | Metrics

This paper presents an algorithm used for the gradient-based motion measurement via the multi -imagewavelet transform according to the characteristics of wavelet transform. In this algorithm , the measurement accuracyis greatly improved because the motion between two images is measured via the data of many images. Moreover , incombination with the reliability measure , a multi-level simultaneous time differential is performed for the reliablelight-stream constraints of the images via the rapid wavelet transform. As compared with the conventional motion estimationmethods , the proposed algorithm based on the multi-level simultaneous wavelet transform avoids the propagationof errors between the decomposed levels , thus improving the measurement accuracy. The simulated results byexperiments show that the proposed algorithm is not only accurate but also easy to implement.

Principal Component Analysis Combined withWavelet Low-Frequency Band

He Jia-zhong Du Ming-hui

2007, 35(1):  44-48. 

Asbtract ( 294 )   PDF (374KB) ( 610 )  

Related Articles | Metrics

This paper proposes a principal component analysis method combined with wavelet low-frequency band todeal with the face recognition with single training sample. To enhance the classification information of a single sampleimage , the method combines the original training image with its reconstructed image based on wavelet low-frequencyband , and performs the principal component analysis on the joined version of the training image. Experimentalresults on the ORL database show that , when each person has only one training sample , the proposed methodachieves 3. 6% higher recognition accuracy and uses 14. 8% fewer eigenfaces than the standard eigenface algorithm.

Baseline Spliting of Traditional Chinese Medicine FingerprintBased on the Second-Generation Wavelet Transform

Yang Yun Zhu Xue-feng

2007, 35(1):  49-52. 

Asbtract ( 260 )   PDF (271KB) ( 638 )  

Related Articles | Metrics

In order to overcome the disadvantages of the conventional data pre-processing technology for the fingerprintsignals of traditional Chinese medicine , such as complexity and low speed of the algorithm , the features of fingerprintsignals are analyzed , on the basis of which a new method is then proposed. In this method , the secondgenerationwavelet transform technology , the local reconstruction technology and the Daubechies wavelet-liftingmethod are adopted to split the baseline of traditional Chinese medicine fingerprint. The experimental results ofTianjihuang fingerprint according with the AIA standard show that the proposed method can effectively split thebaseline from the signal peak with great precision and is easy to be implemented by software.

Iterative Blending Algorithm Based onError Correction of Sub Image

2007, 35(1):  53-57. 

Asbtract ( 289 )   PDF (363KB) ( 529 )  

Related Articles | Metrics

In order to improve the robustness of a watermark system , theoretical analyses and experiments are carriedout to investigate the limitation and robustness in blending number of the existing iterative blending algorithm ,demonstrating that the main reason for weak robustness is the multiplying of the image error many times. Furthermore, an iterative blending algorithm based on the error correction of sub image is proposed. In this algorithm , thesub images of the watermarked host image are modified by the sub images of the original host image , and several watermark images are embedded by the control of secret keys. The proposed algorithm is of strong robustness in resistingattacks with strong relativity. Especially , to cropping attacks , the error of the extracted watermark is appro-ximately zero , thus concluding that the proposed iterative blending algorithm is more robust than the original one.

Fingertip Detection Approach for Finger-Writing ChineseCharacter Recognition System

Yang Duan-duan Jin Lian-wen Yin Jun-xun

2007, 35(1):  58-63. 

Asbtract ( 325 )   PDF (400KB) ( 928 )  

Related Articles | Metrics

In order to meet the requirements of finger-computer interaction system , a fast rohust fingertip detection method is proposed. In this method , first , the foreground is segmented to ohtain the contour of the hand. Next , a candidate area is identified as the rough position of the fingertip hy means of the grid sampling. Then , the accurate position of the fingertip is determined hy means of the circle feature matching , reaching an accuracy of 98.5%. Fi-nally, the proposed fingertip detection method is applied to a finger-writing Chinese character recognition system , in which the computer can directly recognize the characters written hy the fingers of a user.

Fast Human Face-Detecting Algorithm Based on AdaBoost and Genetic Algorithm

Tang Xu-sheng Ou Zong-ying Su Tie-ming Hua Shun-gang

2007, 35(1):  64-69. 

Asbtract ( 245 )   PDF (400KB) ( 1017 )  

Related Articles | Metrics

A novel fast human face-detecting algorithm is proposed to overcome the redundancy in the construction of human face detector by AdaBoost algorithm. In the investigation , AdaBoost algorithm is first used as a feature se-lectorto select the Haar-like wavelet features , namely AdaHaar features. Then , the selected low-dimension Ada-Haarfeatures are further selected to optimally remove the redundancy and to obtain the corresponding weights. Fi-nally, a human face detector is linearly aggregated by the selected features and the weights. Experimental results show that the proposed human face detector can accurately and fast locate face with low memory cost.

Dynamic Programming-Based Online Handwritten Chinese Character Segmentation Approach

Gao Xue

2007, 35(1):  70-73,79. 

Asbtract ( 286 )   PDF (336KB) ( 1347 )  

Related Articles | Metrics

In order to solve the problem of automatic segmentation of handwritten Chinese text , a dynamic program-ming-based online handwritten Chinese character segmentation method is proposed. In this method , the geometrical features of handwritten strokes , the stroke sequence information and the class probability given by the neural net-work classifier are used to construct a segmentation cost function , and are then applied to the pre-segmentation and recognition-based segmentation stages of handwritten sentences , respectively. After that , the dynamic programming algorithm is adopted to find the optimal segmentation path. The pre-segmentation can effectively reduce the amount of segmentation hypothesis with a reasonable incorrect segmentation rate , thus speeding up the segmentation. Ex-perimental results show that the pre-segmentation stage achieves an incorrect segmentation rate of O. 579% and an over-segmentation rate of 11. 1 % , and that the final correct segmentation rate is 88. 2 % without using any language model.

Computer Science & Technology

Hybrid Routing Algorithm for MANET Based on Position and Topology Information

Cao Ying-lie Xie Sheng-li Qiu Hong-yan

2007, 35(1):  74-79. 

Asbtract ( 348 )   PDF (402KB) ( 639 )  

Related Articles | Metrics

The routing maintenance is often invoked in mobile Ad Hoc network because the constructed routings using topology-based routing protocols often break. Moreover , the position-based routing algorithms need neither the construction nor the maintenance of routings , but they need location service to get the position information of the destination. To solve these problems , this paper proposes a hybrid routing algorithm based on topology and position information , which can obtain the position information of some nodes in the process of routing construction without special location service. When the constructed routing fails , the source can send data packets directly through the position-based forwarding strategy if it possesses the position information of the destination. Simulated experiments show that the proposed algorithm reduces the time of routing maintenance , decreases the overhead and improves the performance of routing.

Enhanced TCP Vegas Protocol for Asymmetric Networks

Liu Jing Chen Fang-jiong Wei Gang

2007, 35(1):  80-83,88. 

Asbtract ( 331 )   PDF (330KB) ( 827 )  

Related Articles | Metrics

It has been proved that the TCP Vegas protocol underutilizes the available bandwidth in asymmetric net-worksalthough it possesses better performance than the traditional TCP protocol. In order to solve this problem , an enhanced TCP Vegas algorithm is proposed. In this algorithm , the ecn_to_echo_bits in the acknowledge packets are firsL used to estimate the congestion probability in the backward path , proving that the change of Round -Trip-Time (RTT) is directly proportional to the change of congestion probability. Then , when backward congestion occurs ,the change of RTT is estimated by monitoring the change of congestion probability. Thus , the actual RTT before the congestion is obtained , which is used to implement the TCP Vegas protocol. The simulations based on NS-2 show that the proposed algorithm is more applicable than the existing Vegas algorithm when the congestion occurs both in forward and backward paths.

Securely Alternative Route Protocol ßased on Mobile Agents

Liu Yi Zhang Ling

2007, 35(1):  84-88. 

Asbtract ( 297 )   PDF (333KB) ( 539 )  

Related Articles | Metrics

In order to effectively and securely protect the route of mobile Agents , a securely altemative route proto-colbased on mobile agents is first presented by means of the atomic encryption and signature. Then , the security and computational complexity of the protocol are analyzed. The results show that the proposed protocol not only sa-tisfiesall general security properties for altemative route based on mobile Agents but also reduces the computational complexity from O (n²) to O(n) in both Agent owners and hosts , as compared with the only method based on the nested encηption,and that the new protocol is of good expansibility.

Models and AIgorithms of Tree-ßased Grid Environment

Lin Wei-wei Qi De-yu

2007, 35(1):  89-93,98. 

Asbtract ( 456 )   PDF (405KB) ( 851 )  

Related Articles | Metrics

In order to solve the problems existing in current grid environments , such as the difficulty of application development and the complexity of management , a new tree-based grid environment named TGrid is proposed.TGrid supports the high-performance computing , the subject-oriented resource sharing and the requirement mode-ling in the next generation. After analyzing the characteristics of TGrid and the key problems in TGrid implementa-tion, some key algorithms for the tree building , the dynamic reconfiguration of tree and the task distributing are presented. Moreover , the dynamic load-balancing algorithm for large-scale applications in TGrid is specially de-scribed in detail. Simulated results show that the proposed algorithm is effective.

Authentication and Key Exchange Scheme Based on SRP-6 Protocol

Li Dong Guo He-qing Han Tao

2007, 35(1):  94-98. 

Asbtract ( 392 )   PDF (273KB) ( 4412 )  

Related Articles | Metrics

In order to solve the problem of authentication in Web services , the key exchange mechanism of Secure Rernote Password-6 (SRP- 6) is analyzed , and a new authentication and key exchange scheme named SRP-over-SOAP is proposed. The proposed scheme , which is based on the Simple Object Access Protocol (SOAP) and the SRP-6 , branches out SOAP message and assigns the label of < SRPAuth > to SOAP header. Thus , the SRP au thentication in the transportation of SOAP message can be implemented. Moreover , by applying the proposed scheme to Web services , a bi-directional authentication between the server and the client server can also be imple-mented.

Electronics, Communication & Automation Technology

Secret Sharing-Multisignature Scheme Without a Trusted Center

Lu Ming-xin Fu Xiαo-tong Zhαng Ning Xiao Guo-zhen

2007, 35(1):  99-101,105. 

Asbtract ( 209 )   PDF (251KB) ( 421 )  

Related Articles | Metrics

In order to meet the requirements of digital signature for messages with different importance , a secret sharing-multisignature scheme without a trusted center is proposed based on the techniques of joint random secret sharing and multisignature. In this scheme , there is no trusted center , and each participant randomly selects his own secret key and publishes Lhe corresponding public key as a part of the group public key. For messages with dif-ferent importance , participants of prescriptive amount can cooperate to produce valid multisignatures without chan-ging their private and public keys. As compared with the existing schemes , the proposed scheme lowers the cost of key distribution and improves the system performance.

Computer Science & Technology

Verifiable (t , n) Threshold Secret-Sharing Scheme and Its Security

Pαng Liαo-jun Li Hui-xian wang Yu-min

2007, 35(1):  102-105. 

Asbtract ( 282 )   PDF (245KB) ( 628 )  

Related Articles | Metrics

In order to share a secret among a group of participants without a trusted center and to prevent the parti-cipants from cheating each other , a dynamic and verifiable (t , n) threshold secret-sharing scheme is proposed. In this scheme , the secret shadow of each participant is negotiated by all participants , and the secret dealer does not have to distribute any secret shadow. 50 , in the process of secret distribution , the dealer is only asked to compute some public values without sending any information to each participant. Furthermore , in the process of secret reco-very, each participant of a cooperative only submits a pseudo-shadow computed via the secret shadow to the secret computer , and anyone is allowed to check the validity of the pseudo-shadow. The security of the proposed scheme can be effectively guaranteed due to the difficulty in solving the discrete logarithm problem.

Dynamic Composite Web Services Based on QoS Context

Xu Xin-wei Ding Qiu-lin

2007, 35(1):  106-111. 

Asbtract ( 240 )   PDF (395KB) ( 532 )  

Related Articles | Metrics

As the context of Quality of Service (QoS) is of different functions in service composing procedure , the models of QoS context are used to dynamically compose the services. According to the QoS feedback criteria and the QoS requirements of the user , the candidate services are dynamically selected , composed and implemented under the effect of various environment QoS by using genetic algorithm as the controller of the QoS feedback criteria to en-sure the determination of QoS targets. Experimental and simulated results show that , by the service composition based on QoS context , the Web services are of dynamic and self-adaptive features to meet the needs of the customer.

Query Processing ßased on Formal Domain Ontology in Distribute Environment

Gao Ying Guo He-qing Zou Zhi-min

2007, 35(1):  112-117. 

Asbtract ( 320 )   PDF (384KB) ( 540 )  

Related Articles | Metrics

In order to increase the completeness and correctness in the query of semantic Web , this paper presents a query processing method based on the formal domain ontology. In the investigation , first , the description logic is used to express the syntax and semantic of domain ontology and to implement the formal translation of domain onto-logy.Next , the Monoid Comprehension Calculus is used as the target language of query transformation based on the formal domain ontology. Then , the translation rules from user query to Monoid Homomorphism query are defined ,
followed by the optimized semantic process and query rewritten rules. Finally , experiments are carried out to verify the query performance of the proposed method.

Clustering Algorithm Based on Dynamic Division of Connected Graph

Deng Jian-shuang Zheng Qi-lun Peng Hong Deng Wei-wei

2007, 35(1):  118-122. 

Asbtract ( 252 )   PDF (330KB) ( 1419 )  

Related Articles | Metrics

Most clustering algorithms have a difficulty in dealing with the cluster with arbitrarγshape and size , out-lier points and noises , as well as highly variable density. In order to overcome this difficulty , a clustering algorithm based on dynamic division of connected graph is proposed. In this algorithm , a l-connected graph of data set is firsi constructed , which is then divided with the strategy of dynamic division. Therefore , the data set is divided into se-veral disconnected subsets of connected graph , each of which forms a clustering. Experimental results show that the proposed algorithm is of great applicability because it can effectively solve the clustering problem of the cluster with arbitrarγshape and size , outlier points and noises , as well as highly variable density.

Determination of Independent Variable Number in Multi -Variable Statistical Analysis

Yao Zhi-xiαng Jian Hua li Liu Huan-bin

2007, 35(1):  123-128. 

Asbtract ( 251 )   PDF (395KB) ( 353 )  

Related Articles | Metrics

In the multi-variable system , there generally exist errors in the determination of independent variable number based on covariance matrix eigenvalues because of the nonuniformity in data space. To solve this problem ,a method is proposed to determine the independent variable number in multi-variable statistical analysis. In this method , sample data are first changed in Mahalanobis distance , and are then added with uniform white noise to shield the nonuniformity in data space. Mter the processing with uniform white noise , by arraying the covariance matrix eigenvalues in descending order and calculating the eigenvalues logarithm , the second difference is obtained.So , a successive value is deduced , which is divided distinctly into two parts , one is related to the noise that is al-most equal to zero , and the other is related to the independent variables that are obviously different from zero , ma-king the independent variable number accurately determined. The simulation example and the experiments all re-veal that the proposed method is exact , distinct and steady.

Hybrid Fuzzy Agent Structure

Guo Hong-xia Wu Jie

2007, 35(1):  129-132,137. 

Asbtract ( 588 )   PDF (328KB) ( 630 )  

Related Articles | Metrics

In order to overcome the intrinsic uncertainty of practical systems , a hybrid fuzzy Agent structure with learning and communication capabilities is first proposed , which consists of five modules一learning,communica-tion, control , knowledge and input-output modules. Then , the sets of fuzzy desire , fuzzy belief and fuzzy intention are defined according to the fuzziness of the Agent. Besides , the function and operation mechanism of each module are introduced , and the operation flowchart of the Agent in an autonomy mode is presented. Simulated results indi-cate that the proposed hybrid fuzzy Agent realizes the stability control of a complex system in three states , and pos-sesses high learning rate and strong robust.

Electronics, Communication & Automation Technology

Integrated Management Platform for Intelligent Buildings Based on Subsystem Peer Mode

Zeng Ming Chen Li-ding Xu Bu-gong

2007, 35(1):  133-137. 

Asbtract ( 241 )   PDF (386KB) ( 464 )  

Related Articles | Metrics

At present , the concept of system integration of intelligent buildings is frequently discussed , but few sys-tems implement a fully centralized management and control. In order to solve this problem , this paper first analyzes the functional requirements for the system integration of intelligent buildings , and then presents an integrated ma-nagement platform based on the subsystem peer mode according to practical conditions. Moreover , the key tasks in the system implementation are analyzed in the aspects of model , framework and key technology , including the de-sign of multi-protocol interface , the structure design of 1/0 point table , the graphic display of remote workstation ,the configurable tool based on the electronic map , as well as the effective organization and management of real-time and historical data. Practical results indicate that the proposed platform provides a standard OPC interface and a good human-machine interface with excellent compatibility and expansibility.

Computer Science & Technology

Design and Implementation of CA TIA-Sased Construction Tool for Component Library

Deng Dong-mei Zhou Lai-shui Chen Gong An Lu-ling Li Wei

2007, 35(1):  138-142. 

Asbtract ( 227 )   PDF (357KB) ( 1059 )  

Related Articles | Metrics

In order to construct a typical CA TIA tool component library , to implement the query , preview and use of the components , and to display the main parameters in a 3 D space , the construction and queηprocesses of the standard part librarγare investigated , and a general frame of the construction tool for the component library is put forward. Some key techniques for the library construction and the corresponding implementation methods are then
discussed , such as the modeling method of the component entity , the design of the parameter table and the CAA API-based preview and instance of the compo口ents. Moreover , a construction tool of component library is designed and developed based on CATIA. The tool is finally applied to an enterprise. The results show that the tool is of great applicability and helps to improve the design efficiency and production interchangeability.