Search

To enhance the reliability of analog circuits in complex electrical systems, a novel fault diagnosis method is presented in this paper. A denoising autoencoder and a sparse autoencoder are combined, producing a feature extraction model named the denoising sparse deep autoencoder (DSDAE) that can obtain effective information from signals contaminated by noise. Compared with traditional feature extraction methods, the DSDAE model can be used to implement adaptive feature learning. Then, linear discriminant analysis is adopted to perform linear dimensionality reduction, thereby obtaining the maximum clustering features of the signals. Finally, a fault diagnosis model based on a support vector machine (SVM) with high versatility and accuracy is developed to identify the fault classes of analog circuits. In addition, the salp swarm algorithm, which is capable of convergence and strong global optimization, is employed to intelligently optimize the SVM classifier. The method is comprehensively evaluated with three typical analog circuits from the ISCAS’97 circuit set. The experimental results illustrate that the proposed fault diagnosis method can achieve excellent fault identification accuracy and generalization performance even under noise interference conditions.

To enhance the reliability of analog circuits in complex electrical systems, a novel incipient fault diagnosis method is presented in this article. The wavelet packet feature quantities, which consist of the energy, fluctuation coefficient, skewness, and margin factor, are obtained via multiscale time-frequency analysis with wavelet packet transform (WPT). Then, generalized discriminant analysis (GDA) is employed to realize the fusion of wavelet packet feature quantities because it can handle the data nonlinearity and eliminate redundant information. Furthermore, the generalized multiple kernel learning support vector machine (GMKL-SVM), which has the advantages of a strong generalization ability and high accuracy, is developed to identify the incipient fault classes of analog circuits. Moreover, a new particle swarm intelligent optimization algorithm, the sine cosine algorithm (SCA), is adopted to optimize key parameters of GMKL-SVM because of its high convergence speed and strong global optimization ability. The method is fully evaluated with the Sallen-Key bandpass filter circuit, the four-op-amp biquad high-pass filter circuit, and the leapfrog filter circuit. The experimental results demonstrate that the proposed incipient fault diagnosis method for analog circuits can produce higher diagnosis accuracy than other typical incipient fault diagnosis methods.

Combinatorial testing is an efficient test method, which can achieve high test coverage with as few test cases as possible. However, there are a large amount of test cases of combinatorial testing in industrial practice. If all the test cases are applied to executing, it takes a vast time and cost. How to select a subset of test cases which can guarantee failure detection rate is a common problem. In this paper, we introduce a novel technique for test case prioritization of combinatorial testing based on supervised machine learning. Our approach considers the test results of a small t-way covering array and the machine learning algorithm SVM is used to learn the test results first. Then SVM is used to predict a large t-way covering array. The test cases in the large t-way covering array are ordered according to the predicted results. The test cases which can lead failures in system under tests are ordered ahead. They own the priority. A subset of the ordered covering array which is selected from the start of the covering array can replace the whole covering array with time and cost saved reasonably. Our approach is evaluated by means of comparing the covering arrays which are ordered by SVM and the random ordering. Our results imply that our technique improves the failure detection rate significantly.

This paper presents a polarized random Fourier feature kernel least-mean-square algorithm that aims to overcome the dimension curve of the random Fourier feature kernel least-mean-square (RFFKLMS) algorithm. RFFKLMS is an effective nonlinear adaptive filtering algorithm based on the kernel approximation technique. However, random samples drawn from the distribution need more dimensions to achieve better-generalized performance because they are independent of the training data. To overcome this weakness, a kernel polarization method is adopted to optimize the random samples. Polarized random Fourier features demonstrate a clear advantage over a method without using the polarization method. The experimental results in the context of Lorenz time series prediction and channel equalization verify the effectiveness of the proposed method.

Testing of real-time embedded systems (RTESs) under input timing constraints is a critical issue. Models which can specify timing constraints have respective merits and demerits and test suites which can cover more input possibilities and detect more faults under input timing constraints are worthy of study. In this paper, clocked computation tree logic which is used to specify input timing constraints is presented. Neighbor covering arrays and parallel input time correlation test suites are introduced to test RTESs under serial and parallel input timing constraints. Three algorithms are described in generating test suites, respectively, and corresponding random testing-based algorithms which are used as baselines for comparison are introduced. Benchmarks with different configurations are conducted to evaluate the algorithms' performance. Three real-world RTESs are tested with the test suites described in this paper, respectively. The test results show that random testing may omit some neighbor input time point combinations as the randomness and increase test suite scales. This fact may lead to the omission of some faults and heavy costs. Therefore, the proposed test suites are more effective and efficient for testing RTESs under input timing constraints.

To address the issue of fault diagnosis of planetary gearboxes under imbalanced data, a novel fault diagnosis method based on the improved energy-based generative adversarial network (IEBGAN) is proposed. Firstly, convolutional layers are added to the energy-based generative adversarial network (EBGAN) discriminator, thereby improving the feature extraction ability. Then, the classification loss is introduced into the loss function of EBGAN with the purpose of expanding the classification function of the discriminator. Finally, a planetary gearbox fault diagnosis model with sample generation capability is established to achieve the Nash equilibrium by the confrontation between the generator and the discriminator. Experimental results illustrate that the proposed method can improve the accuracy of fault diagnosis for planetary gearboxes even under imbalanced data.

In actual engineering applications, inevitable noise seriously affects the accuracy of fault diagnosis for rotating machinery. To effectively identify the fault classes of rotating machinery under noise interference, an efficient fault diagnosis method without additional denoising procedures is proposed. First, a one-dimensional deep residual shrinkage network, which directly takes the raw vibration signals contaminated by noise as input, is developed to realize end-to-end fault diagnosis. Then, to further enhance the noise immunity of the diagnosis model, the first layer of the model is set to a wide convolution layer to extract short time features. Moreover, an adaptive batch normalization algorithm (AdaBN) is introduced into the diagnosis model to enhance the adaptability to noise. Experimental results illustrate that the fault diagnosis model for rotating machinery based on one-dimensional deep residual shrinkage network with a wide convolution layer (1D-WDRSN) can accurately identify the fault classes even under noise interference.

Real-time performance is one of the key properties in infrared targets detection system which limits the applications of many algorithms. In this paper, a novel infrared-small-target detection method using compressed sensing technology is proposed to improve real-time performance by combining the images compressed and targets detection. Furthermore, dealing with images with both bright targets and dark targets, filter images for two kinds of targets separately is commonly for the image preprocessing. In this paper, a local segment contrast measure method is proposed to preprocess images uniform. Finally, the influence of certain vital parameters (e.g., the block size and the filter window size) on the detection and compression performance is discussed at length. Several guiding principles for the selection of those vital parameters are developed. The experimental results demonstrate that the proposed framework with an appropriate block size and filter window size provides a great balance between real-time performance and accuracy. The proposed local segment contrast measure method is efficient when applied to both bright and dark small targets.

The purpose of kernel adaptive filtering (KAF) is to map input samples into reproducing kernel Hilbert spaces and use the stochastic gradient approximation to address learning problems. However, the growth of the weighted networks for KAF based on existing kernel functions leads to high computational complexity. This paper introduces a reduced Gaussian kernel that is a finite-order Taylor expansion of a decomposed Gaussian kernel. The corresponding reduced Gaussian kernel least-mean-square (RGKLMS) algorithm is derived. The proposed algorithm avoids the sustained growth of the weighted network in a nonstationary environment via an implicit feature map. To verify the performance of the proposed algorithm, extensive simulations are conducted based on scenarios involving time-series prediction and nonlinear channel equalization, thereby proving that the RGKLMS algorithm is a universal approximator under suitable conditions. The simulation results also demonstrate that the RGKLMS algorithm can exhibit a comparable steady-state mean-square-error performance with a much lower computational complexity compared with other algorithms.

Target tracking is one of the most important and active research areas in the field of computer vision. In this paper, we address the problem of tracking an object that is completely occluded in a video. The proposed robust spatio-temporal context (RSTC) method, inspired by the spatio-temporal context method, uses spatio-temporal context information to establish an early warning mechanism. The core technology of the early warning mechanism is to monitor the fluctuation of the relative change rate between two adjacent frames. When a target is completely occluded, the algorithm estimates the target’s location using accurate motion information saved during the early warning. Finally, the algorithm captures the target after the target reappears. Experimental results show that the proposed algorithm is very robust and efficient when used in visual tracking applications.

In active noise control (ANC) systems, the primary path may exhibit nonlinear impulse responses. Conventional linear ANC controllers based on a filtered-x least mean square (FxLMS) algorithm exhibit performance degradation when compensating for nonlinear distortions of the primary path. Several nonlinear active noise control algorithms, including Volterra filtered-x least mean square (VFxLMS) and filtered-s least mean square (FsLMS), have been utilized to overcome this nonlinear effect. However, the performance still needs to be improved when the reference noise is mixed with multiple narrowband signals and additional Gaussian white noise. Over the last several years, kernel adaptive filters have exhibited powerful capabilities in multiple signal processing domains. When kernel adaptive filters are introduced into the ANC system, a great challenge is to compensate for the inherent delay caused by the secondary path. Due to the implicit mapping of the kernel method, it is difficult to filter the reference signal in the high-dimensional feature space. In this paper, an approximate method is proposed in which the filtered reference signal is mapped to the high-dimensional feature space. In addition, a kernel filtered-x least mean square (KFxLMS) algorithm is developed for an ANC system with a nonlinear primary path. Simulation experiments demonstrate that the performance of the proposed KFxLMS algorithm is better than that of the FxLMS, VFxLMS, and FsLMS algorithms.

Noise control and cancellation over a spatial region is a fundamental problem in acoustic signal processing. In this paper, we utilize wave-domain adaptive algorithms to iteratively calculate the secondary source driving signals and to cancel the primary noise field over the control region. We propose wave-domain active noise control algorithms based on two minimization problems: first, minimizing the wave-domain residual signal coefficients, and second, minimizing the acoustic potential energy over the region, and derive the update equations with respect to two variables, the loudspeaker weights and wave-domain secondary source coefficients. Simulation results demonstrate the effectiveness of the proposed algorithms, more specifically the convergence speed and the noise cancellation performance in terms of the noise reduction level and acoustic potential energy reduction level over the entire spatial region.

Hyperspectral images provide a precise representation of the earth’s surface, with abundant spectral and spatial features, but normal classification algorithms use only the information provided by the spectral features of each data point. In this paper, we propose a new approach to hyperspectral image classification based on Mahalanobis distance metric learning and kernel learning that considers both the features of the spectral bands and a spatial prior. This approach consists of two components. First, we obtain a primary labeled classification result and a posterior probability distribution for each pixel point using a Mahalanobis-kernel-based classifier. Second, instead of the original or extracted spectral features, we reconstruct the spatial relationship of the hyperspectral images using the posterior probability of every data point, smooth the boundaries, and revise suspicious points based on this piecewise information using a kernel-based multi-region segmentation method. In an experimental study, we adopt a support vector machine (SVM) classifier as the kernel classifier to obtain the posterior probabilities using dimensionally reduced data. The proposed method is compared with several other methods from various perspectives. Simulation experiments run on several real hyperspectral data sets are reported. The results show that the proposed method performs better than other comparable classification algorithms, especially in a condition-constrained environment.

To enhance the reliability of multifunctional sensors, a novel data validation strategy is presented by handling independent and related variables separately. The maximal information coefficient (MIC), which can measure the strength of the correlation between two variables, is applied to divide all variables of multifunctional sensors into related and independent. For one thing, the k-nearest neighbor (kNN) rule is introduced to accomplish fault detection and isolation of independent variables, and the grey predictive model GM(1,1), which has the advantages of low computation burden and high accuracy, is adopted to achieve data recovery of faulty independent variables. For another, the kernel principal component analysis (KPCA), which can handle possible non-linearity of data, is employed to realize fault detection of related variables. An iterative reconstruction-based contribution (IRBC) method is developed to isolate all faulty related variables, and data recovery of them are implemented using a fuzzy similarity (FS)-based reconstruction method based on the spatial correlations among related variables. An experimental system for multifunctional sensors is built to evaluate the proposed strategy, and the performance comparisons with its counterparts are also conducted.

A novel index structure based on pairwise attribute subspaces is presented.An efficient event matching algorithm named PADEM (Pairwise Attribute Division based Event Matching) is developed based on the novel index structure.The performance metrics (e.g. matching time, insertion time, deletion time and memory consumption) of PADEM are theoretically analysed and compared with its counterparts. The event matching algorithm, which checks the events against all the subscriptions, is a fundamental component of large-scale content-based publish/subscribe systems, and it is the key issue for improving the efficiency of the entire system. To meet the increasing efficiency requirements of real-time publish/subscribe systems, an event matching algorithm named PADEM (Pairwise Attribute Division based Event Matching) is presented in this paper. By dividing the attribute space into multiple pairwise attribute subspaces, PADEM constructs a novel index structure to classify all subscriptions in systems. This index structure can guarantee the matching process in its each unit can only be triggered by corresponding events. The experimental results demonstrate that PADEM can dramatically improve the efficiency of event matching, particularly in large-scale distributed systems with high volumes of subscriptions.

Multi-channel active noise control (ANC) is currently an attractive solution for the attenuation of low-frequency noise fields, in three-dimensional space. This paper develops a controller for the case when the noise source components are sparsely distributed in space. The anti-noise signals are designed as in conventional ANC to minimize the residual errors but with an additional term containing an ll norm regularization applied to the signal magnitude. This results in that only secondary sources close to the noise sources are required to be active for cancellation of sparse noise fields. Adaptive algorithms with low computational complexity and faster convergence speeds are proposed.

Robust tracking in the forward looking infrared (FLIR) sequences is still a challenging problem in the field of computer vision. Because images acquired by the infrared sensors are characterized by low signal-to-clutter ratios (SCR) and targets of interest may exhibit profound appearance variations due to ego-motion of the sensor platform and complex maneuvers. Though many efforts have been delivered, there are still some issues to be addressed. First, intensity features are not enough to deal with complex appearance variations for the challenging sequence. Second, to obtain satisfying estimation of target state, a plenty of particles have to be employed to approximate its probability density function (pdf). To deal with the two problems, a parallel search strategy based on kernel sparse representation (KL1PS tracker) is proposed to perform the tracking task in the FLIR sequences. With the ability of capturing the nonlinear features, kernel method is introduced to deal with complex appearance variations. After the kernel function is constructed based on the histogram features, both the target templates and candidates are mapped into the kernel feature space. Then efficient state particles are selected based on sparse representation which can be used to estimate the target state. The proposed method is tested on the AMCOM database, and the experimental results demonstrate its excellent performance in tracking accuracy compared with some state-of-the-art trackers.

Testing of Real-Time Embedded Systems (RTESs) under input timing constraints is a critical issue, especially for parallel input factors. Test suites which can cover more possibilities of input time and discover more defects under input timing constraints are worthy of study. In this paper, Parallel Input Time Test Suites (PITTSs) are proposed to improve the coverage of input time combinations. PITTSs not only cover all the neighbor input time point combinations of each factor, but also cover all the input time point combinations between each two factors of the same input. Particle swarm optimization based the PITTS construction algorithm is presented and benchmarks with different configurations are conducted to evaluate the algorithm’ performance. A real world RTES is tested with a PITTS as application and we have reason to believe that PITTSs are effective and efficient for testing RTESs under input timing constraints of parallel input factors.

Small-target detection in infrared imagery used in forward looking infrared is an important task in remote sensing fields. It is important to improve the detection capabilities such as detection rate, false alarm rate and speed. In this letter, a novel approach inspired by human visual system (HVS) is presented. First, block compressed sampling theory was used to compress the image and obtain the modulation map. Then, small abnormal regions in the modulation map were detected by high speed local contrast method and defined as candidate targets. Experimental results show the proposed algorithm pursue good performance in detection rate, false alarm rate and speed simultaneously.

A target of interest may exhibit significant appearance variations because of its complex maneuvers, ego-motion of the camera platform, etc. Currently, target tracking in forward-looking infrared (FLIR) sequences is still a challenging problem in the field of computer vision. Although many efforts have been devoted, there are still some issues to be addressed. First, state particles generated by prior information cannot approximate the probability density function well when the target state changes obviously. Second, plenty of particles have to be employed to obtain satisfying estimation of target state which will cause heavy computational burden in turn. In this paper, a hierarchical search strategy (HS tracker) is proposed to track infrared target in the particle filter framework, and there are two observation models employed to locate the target robustly. In the first stage, a saliency map leads the redistributed state particles to cover the salient areas that can provide a rough prediction of the target areas. In the second stage, sparse representation is employed to search for a subset of true ones from all the target candidates; thus, only efficient state particles are used to estimate the target state. The proposed method is tested on numerous FLIR sequences from the US army aviation and missile command database, and experimental results demonstrate the excellent performance.

Small-target detection in infrared imagery with a complex background is always an important task in remote sensing fields. It is important to improve the detection capabilities such as detection rate, false alarm rate, and speed. However, current algorithms usually improve one or two of the detection capabilities while sacrificing the other. In this letter, an Infrared (IR) small target detection algorithm with two layers inspired by Human Visual System (HVS) is proposed to balance those detection capabilities. The first layer uses high speed simplified local contrast method to select significant information. And the second layer uses machine learning classifier to separate targets from background clutters. Experimental results show the proposed algorithm pursue good performance in detection rate, false alarm rate and speed simultaneously.

In recent years, the online secondary path modeling (SPM) method with an auxiliary noise power scheduling strategy has been crucial for active noise control (ANC) systems and has also become a popular research topic. However, most scheduling strategies have been designed for broadband active noise control (BANC), and these ideas may not be directly applied to narrowband active noise control (NANC) systems due to the difference in structure between BANC and NANC systems. In this paper, a new online SPM method with auxiliary noise power scheduling is proposed. Here, the controlled system is adapted using the filtered-x weighted accumulated least mean square (FXWALMS) algorithm proposed by the authors. Moreover, the auxiliary noise power is scheduled based on the convergence status of the forgetting factor to accurately track the change in the NANC system. As a result, the proposed method not only achieves good modeling accuracy and fast convergence but also considerably increases noise attenuation. Extensive simulations are conducted to prove the superior performance of the proposed method in various scenarios.

The accuracy and reliability of multifunctional sensor outputs directly influence the running state and performance of measurement and control systems in chemical processes. Given their importance, self-validating multifunctional sensors are presented to improve the reliability of measurements in operation. A novel strategy based on the grey bootstrap method (GBM) is proposed for the online data validation and dynamic uncertainty estimation of self-validating multifunctional sensors. The data validation algorithm and the working principle based on GBM are applied for multiple faults detection, isolation and recovery (FDIR). The proposed FDIR scheme can simultaneously isolate multiple faults of multifunctional sensors and accomplish failure recovery with high accuracy and good timeliness. Moreover, it has a good performance of discriminating between fault-free signals with sudden changes and undoubted faults. On account of the unknown probability distribution and small sample size, the traditional expression of uncertainty has limitation in dynamic measurements. As a data-driven method, the GBM can evaluate the measurement uncertainty from poor information without prior information about the probability distribution of measurand in real-time. The performance of the proposed strategy is verified by computer simulations and a real experimental system of chemical gas concentration monitoring. Through the comparison of different methods, the results show that the GBM has superiority for the data validation and dynamic uncertainty estimation of self-validating multifunctional sensors.

Aiming at improving the real-time performance of infrared weapon systems, a method based on block compressed sensing is proposed to detect infrared small target, which is also easy to be implemented with hardware. The proposed method can detect and locate small infrared targets by classifying compressed results of blocks. In addition, in order to solve the low detection accuracy caused by using uniform block, the proposed method uses overlapping blocks to reduce the maximum distance between the center of the test sample block and that of the target. Experiments show that the proposed method can effectively improve the detection accuracy of infrared small targets.

The content-based publish/subscribe systems are attracting more and more attention in Internet applications due to their intrinsic time, space, and synchronization decoupling properties. With the increase in system scale, the efficiency of event matching becomes more critical for system performance. However, most existing methods suffer significant performance degradation when the system has large volumes of subscriptions. This paper presents DOCO (DOuble COmbination event matching algorithm) to improve the efficiency of event matching in content-based publish/subscribe systems. Via assembling the attributes in the attribute space by pairs, a novel index structure is built up for classification of the subscriptions. On the arrival of an event, the event matching process is only carried out on some related units of the index structure, thus, the number of subscriptions that involved in the event matching process is reduced. A series of experiments are designed to verify the performance of the proposed algorithm, and a comparison with other event matching algorithms is also carried out. The experimental results show that DOCO can improve the efficiency of event matching in content-based publish/subscribe systems.

Analog circuits are an important component of complex electrical systems. Therefore, fault diagnosis of analog circuits plays a vital role in ensuring the reliability of electronic systems. A novel fault diagnostic method for analog circuits based on the support vector machine (SVM) optimized by the firefly algorithm (FA) using frequency response features is presented in this paper. Wilks Λ-statistic can effectively assess the ability of variables to resolve multiple types of samples in multivariate statistical analysis. Frequency responses of analog circuits are measured, and then, features are extracted by using the particle swarm optimization (PSO) method. Additionally, the fitness function of the PSO is set to Wilks Λ-statistic. Then, an SVM based analog circuit’s fault diagnosis model is introduced to classify the faulty components according to the extracted frequency response features. The optimal penalty parameter and kernel function parameter of SVM are obtained by using the FA. The method is fully evaluated in fault diagnosis simulations of the Sallen-Key bandpass filter and four-op-amp biquad high-pass filter. The experimental results demonstrate that the proposed fault diagnostic method can produce higher diagnosis accuracy than other typical analog circuit fault diagnosis methods.

The traditional gas sensor array has been viewed as a simple apparatus for information acquisition in chemosensory systems. Gas sensor arrays frequently undergo impairments in the form of sensor failures that cause significant deterioration of the performance of previously trained pattern recognition models. Reliability monitoring of gas sensor arrays is a challenging and critical issue in the chemosensory system. Because of its importance, we design and implement a status self-validating gas sensor array prototype to enhance the reliability of its measurements. A novel fault detection, isolation, and diagnosis (FDID) strategy is presented in this paper. The principal component analysis-based multivariate statistical process monitoring model can effectively perform fault detection by using the squared prediction error statistic and can locate the faulty sensor in the gas sensor array by using the variables contribution plot. The signal features of gas sensor arrays for different fault modes are extracted by using ensemble empirical mode decomposition (EEMD) coupled with sample entropy (SampEn). The EEMD is applied to adaptively decompose the original gas sensor signals into a finite number of intrinsic mode functions (IMFs) and a residual. The SampEn values of each IMF and the residual are calculated to reveal the multi-scale intrinsic characteristics of the faulty sensor signals. Sparse representation-based classification is introduced to identify the sensor fault type for the purpose of diagnosing deterioration in the gas sensor array. The performance of the proposed strategy is compared with other different diagnostic approaches, and it is fully evaluated in a real status self-validating gas sensor array experimental system. The experimental results demonstrate that the proposed strategy provides an excellent solution to the FDID of status self-validating gas sensor arrays.

In this paper, we investigate active noise control over large 2D spatial regions when the noise source is sparsely distributed. The l1 relaxation technique originated from compressive sensing is adopted and based on that we develop the algorithm for two cases: multipoint noise cancellation and wave domain noise cancellation. This results in two new variants (i) zero-attracting multi-point complex FxLMS and (ii) zero-attracting wave domain complex FxLMS. Both approaches use a feedback control system, where a microphone array is distributed over the boundary of the control region to measure the residual noise signals and a loudspeaker array is placed outside the microphone array to generate the anti-noise signals. Simulation results demonstrate the performance and advantages of the proposed methods in terms of convergence rate and spatial noise reduction levels.

Robust small target detection of low signal-to-noise ratio (SNR) is very important in infrared search and track applications for self-defense or attacks. Due to the complex background, current algorithms have some unsolved issues with false alarm rate. In order to reduce the false alarm rate, an infrared small target detection algorithm based on saliency detection and support vector machine was proposed. Firstly, we detect salient regions that may contain targets with phase spectrum Fourier transform (PFT) approach. Then, target recognition was performed in the salient regions. Experimental results show the proposed algorithm has ideal robustness and efficiency for real infrared small target detection applications.

Test and training are two important links to form battle effectiveness, and integration of them could offer test chance for test people as well as training environment for operater, saving the resource. Collabrative environment is a way to share resource, imported in the range integrated test and training. After the architecture of collaborative environment constructed, the collaborative framework, which consists of distributed data, distributed tools, distributed processes and distributed people, is advanced. And then an idea of implementing collaborative environment is put forward, that is to attempt to resolve problems from three aspectsdata integration, model integration and processes integration. At last the feasibility analysis of weapon equipment development is presented to demonstrate analysis of collabrative environment.

In this paper, a DC speed regulator of double closed loop of rotational speed and current is designed for permanent-magnet brushless DC motor of flywheel energy storage system. Varela immune controller is modeled by the Simulink in Matlab and applied in double closed-loops DC motor speed regulator of flywheel. Simulation results show that Varela immune controller can have better control effect than PID on the respect of dynamics response and has good robust performance.

Biogeography-based optimization algorithm(BBO) is a new kind of optimization algorithm based on Biogeography. It mimics the migration strategy of animals to solve the problem of optimization. In this paper, the clone selection strategy is combined with biogeography for solving the problem of sensors selection of aircraft. It is compared with other classical nature inspired algorithms. The comparison results show that BBOCSA is an effective algorithm for optimization problem in practice. It provides a new method for this kind of problem.

Four rotors flyer(FRF) is difficult to control because its control system is a multi-inputs and multi outputs with characteristics of nonlinear, strong coupling and sensitive to disturbance. In this paper, several intelligence control methods including genetic algorithm(GA), immune algorithm(IA), radial basis function(RBF), fuzzy system(FS) are used to control the flyer and the performance is analyzed respectively. The results show that RBF has the best performance in all the tests of pitch and yaw control of FRF.

Order tracking spectrum analysis is an effective method used in the research of transient vibration signal. Through careful study of its principles and applications in vibration test, a new simple formula of calculating the signal order tracking fast was brought forward. With the means mentioned above, a coarse order tracking of vibration signal could be derived easily in time domain. In the mean time, some principles of how to select the parameters in order tracking spectrum analysis were discussed with the help of the new method. Finally, the experiments showed its feasibility and validity in application of real-time processing and analysis of vibration signals.

To the operational effectiveness evaluation of radar jammer, a general evaluation idea was given. The evaluation problem was converted to a multi-class classification problem of support vector machine (SVM), and the evaluation method was proposed based on C-SVM classifier. RBF (radial basis function) was selected as kernel and cross-validation techniques were used for parameter optimization. Finally, a simulation experiment was implemented, and the results show that this method is simple and effective.

For lack of universality and flexibility in current avionics simulator, a universal semi-physical simulation platform was designed. The innovation is that a simulation database used to describe the behavior, attribute and interface information of avionics was proposed, and simulation is realized by software’s analysis to the database filled with the information. Because the object to be simulated is separated from simulation software, the universality and flexibility of the platform are enhanced greatly. Now this simulation platform has been successfully used in the union simulation experimentation of one airplane’s avionics system.