On the multi‐input second‐order sliding mode control of nonlinear uncertain systems

This note addresses the multi‐input second‐order sliding mode control design for a class of nonlinear multivariable uncertain dynamics. Among the most important peculiarities of the considered control problem, the considered sliding vector variable has a uniform vector relative degree [2,2, … ,2] with respect to the vector control variable, and only the sign of the sliding vector and of its derivative are available for feedback. Additionally, the symmetric part of the state‐dependent control matrix is supposed to be positive definite. Under some further mild restrictions on the uncertain system's dynamics, a control algorithm that realizes a multi‐input version of the ‘twisting’ second‐order sliding mode control algorithm is suggested. Simple controller tuning conditions are derived by means of a constructive Lyapunov analysis, which demonstrates that the suggested control algorithm guarantees the semiglobal asymptotic convergence to the sliding manifold. Simulation results, which confirm the good performance of the proposed scheme and investigate the actual accuracy obtained under the discrete‐time implementation effects, are given. Copyright © 2011 John Wiley & Sons, Ltd.     

SVM-based ontology matching approach

There are a lot of heterogeneous ontologies in semantic web, and the task of ontology mapping is to find their semantic relationship. There are integrated methods that only simply combine the similarity values which are used in current multi-strategy ontology mapping. The semantic information is not included in them and a lot of manual intervention is also needed, so it leads to that some factual mapping relations are missed. Addressing this issue, the work presented in this paper puts forward an ontology matching approach, which uses multi-strategy mapping technique to carry on similarity iterative computation and explores both linguistic and structural similarity. Our approach takes different similarities into one whole, as a similarity cube. By cutting operation, similarity vectors are obtained, which form the similarity space, and by this way, mapping discovery can be converted into binary classification. Support vector machine (SVM) has good generalization ability and can obtain best compromise between complexity of model and learning capability when solving small samples and the nonlinear problem. Because of the said reason, we employ SVM in our approach. For making full use of the information of ontology, our implementation and experimental results used a common dataset to demonstrate the effectiveness of the mapping approach. It ensures the recall ration while improving the quality of mapping results.     

Stabilization of impulsive hybrid systems using quantized input and output feedback

In this paper, we consider the feedback stabilization of impulsive control systems with quantized input and output signals. To study the problem, the notions of quasi‐invariant sets and attracting sets for impulsive systems with quantization are introduced first, and then applied to the control design. Hybrid quantized control schemes are proposed to stabilize the considered impulsive linear or nonlinear systems via either input or output feedback. Mathematical analysis and numerical simulations are given to show the principle and effectiveness of the proposed designs. Copyright © 2011 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Input‐to‐state stability of min‐max MPC scheme for nonlinear time‐varying delay systems

This paper studies the robustness problem of the min–max model predictive control (MPC) scheme for constrained nonlinear time‐varying delay systems subject to bounded disturbances. The notion of the input‐to‐state stability (ISS) of nonlinear time‐delay systems is introduced. Then by using the Lyapunov–Krasovskii method, a delay‐dependent sufficient condition is derived to guarantee input‐to‐state practical stability (ISpS) of the closed‐loop system by way of nonlinear matrix inequalities (NLMI). In order to lessen the online computational demand, the non‐convex min‐max optimization problem is then converted to a minimization problem with linear matrix inequality (LMI) constraints and a suboptimal MPC algorithm is provided. Finally, an example of a truck‐trailer is used to illustrate the effectiveness of the proposed results. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Entropy/cross entropy-based group decision making under intuitionistic fuzzy environment

We study the group decision making problem under intuitionistic fuzzy environment. Based on entropy and cross entropy, we give two methods to determine the optimal weights of attributes, and develop two pairs of entropy and cross entropy measures for intuitionistic fuzzy values. Then, we discuss the properties of these measures and the relations between them and the existing ones. Furthermore, we introduce three new aggregation operators, which treat the membership and non-membership information fairly, to aggregate intuitionistic fuzzy information. Finally, several practical examples are presented to illustrate the developed methods.     

A hybrid stock selection model using genetic algorithms and support vector regression

In the areas of investment research and applications, feasible quantitative models include methodologies stemming from soft computing for prediction of financial time series, multi-objective optimization of investment return and risk reduction, as well as selection of investment instruments for portfolio management based on asset ranking using a variety of input variables and historical data, etc. Among all these, stock selection has long been identified as a challenging and important task. This line of research is highly contingent upon reliable stock ranking for successful portfolio construction. Recent advances in machine learning and data mining are leading to significant opportunities to solve these problems more effectively. In this study, we aim at developing a methodology for effective stock selection using support vector regression (SVR) as well as genetic algorithms (GAs). We first employ the SVR method to generate surrogates for actual stock returns that in turn serve to provide reliable rankings of stocks. Top-ranked stocks can thus be selected to form a portfolio. On top of this model, the GA is employed for the optimization of model parameters, and feature selection to acquire optimal subsets of input variables to the SVR model. We will show that the investment returns provided by our proposed methodology significantly outperform the benchmark. Based upon these promising results, we expect this hybrid GA-SVR methodology to advance the research in soft computing for finance and provide an effective solution to stock selection in practice.     

Soft computing approach to fault diagnosis of centrifugal pump

Fault detection and isolation in rotating machinery is very important from an industrial viewpoint as it can help in maintenance activities and significantly reduce the down-time of the machine, resulting in major cost savings. Traditional methods have been found to be not very accurate. Soft computing based methods are now being increasingly employed for the purpose. The proposed method is based on a genetic programming technique which is known as gene expression programming (GEP). GEP is somewhat a new member of the genetic programming family. The main objective of this paper is to compare the classification accuracy of the proposed evolutionary computing based method with other pattern classification approaches such as support vector machine (SVM), Wavelet-GEP, and proximal support vector machine (PSVM). For this purpose, six states viz., normal, bearing fault, impeller fault, seal fault, impeller and bearing fault together, cavitation are simulated on centrifugal pump. Decision tree algorithm is used to select the features. The results obtained using GEP is compared with the performance of Wavelet-GEP, support vector machine (SVM) and proximal support vector machine (PSVM) based classifiers. It is observed that both GEP and SVM equally outperform the other two classifiers (PSVM and Wavelet-GEP) considered in the present study.     

机动车车牌识别中SVM的应用

支持向量机是一类新型机器学习方法,成功应用于各个领域,算法在分类性能上优于其它学习算法。该文在字符特征提取基础上,将支持向量机理论应用于车牌识别系统,提高识别率和识别速度,具有很好的推广价值。     

A parallel Monte Carlo search algorithm for the conformational analysis of polypeptides

In recent years several approaches have been proposed to overcome the multiple-minima problem associated with nonlinear optimization techniques used in the analysis of molecular conformations. One such technique based on a parallel Monte Carlo search algorithm is analyzed. Experiments on the Intel iPSC/2 confirm that the attainable parallelism is limited by the underlying acceptance rate in the Monte Carlo search. It is proposed that optimal performance can be achieved in combination with vector processing. Tests on both the IBM 3090 and Intel iPSC/2-VX indicate that vector performance is related to molecule size and vector pipeline latency.     

基于支持向量机的图书馆借阅量预测

为了准确预测图书馆借阅量,本文提出基于支持向量机的图书馆借阅量时序预测方法,支持向量机能有效解决非线性、高维、小样本等问题,并采用遗传算法选取合适的支持向量机训练参数,以此增加支持向量机的泛化能力。首先提出了支持向量机预测模型,并进行实例分析,将华北科技学院图书馆流通部1997-2007年度借阅量作为本文的实验数据。实验结果表明支持向量机的图书馆借阅量预测效果优于径向基(Radial Basis Function,RBF)神经网络。