The least squares support vector regression (LS-SVR) is usually used for the modeling of single output system, but it is not well suitable for the actual multi-input-multi-output system. The paper aims at the modeling...
详细信息
The least squares support vector regression (LS-SVR) is usually used for the modeling of single output system, but it is not well suitable for the actual multi-input-multi-output system. The paper aims at the modeling of multi-output systems by LS-SVR. The multi-output LS-SVR is derived in detail. To avoid the inversion of large matrix, the recursive algorithm of the parameters is given, which makes the online algorithm of LS-SVR practical. Since the computing time increases with the number of training samples, the sparseness is studied based on the pro-jection of online LS-SVR. The residual of projection less than a threshold is omitted, so that a lot of samples are kept out of the training set and the sparseness is obtained. The standard LS-SVR, nonsparse online LS-SVR and sparse online LS-SVR with different threshold are used for modeling the isomerization of C8 aromatics. The root-mean-square-error (RMSE), number of support vectors and running time of three algorithms are compared and the result indicates that the performance of sparse online LS-SVR is more favorable.
A sparse approximation algorithm based on projection is presented in this paper in order to overcome the limitation of the non-sparsity of least squares support vector machines (LS-SVM). The new inputs are projected...
详细信息
A sparse approximation algorithm based on projection is presented in this paper in order to overcome the limitation of the non-sparsity of least squares support vector machines (LS-SVM). The new inputs are projected into the subspace spanned by previous basis vectors (BV) and those inputs whose squared distance from the subspace is higher than a threshold are added in the BV set, while others are rejected. This consequently results in the sparse approximation. In addition, a recursive approach to deleting an exiting vector in the BV set is proposed. Then the online LS-SVM, sparse approximation and BV removal are combined to produce the sparse online LS-SVM algorithm that can control the size of memory irrespective of the processed data size. The suggested algorithm is applied in the online modeling of a pH neutralizing process and the isomerization plant of a refinery, respectively. The detailed comparison of computing time and precision is also given between the suggested algorithm and the nonsparse one. The results show that the proposed algorithm greatly improves the sparsity just with little cost of precision.
A strategy for the integration of production planning and scheduling in refineries is proposed. This strategy relies on rolling horizon strategy and a two-level decomposition strategy. This strategy involves an upper ...
详细信息
A strategy for the integration of production planning and scheduling in refineries is proposed. This strategy relies on rolling horizon strategy and a two-level decomposition strategy. This strategy involves an upper level multiperiod mixed integer linear programming (MILP) model and a lower level simulation system, which is extended from our previous framework for short-term scheduling problems [Luo, C.E, Rong, G, "Hierarchical apthis extended framework is to reduce the number of variables and the size of the optimization model and, to quickly find the optimal solution for the integrated planning/scheduling problem in refineries. Uncertainties are also considered in this article. An integrated robust optimization approach is introduced to cope with uncertain parameters with both continuous and discrete probability distribution.
The quality of process data in a chemical plant significantly affects the performance and benefits gained from activities like performance monitoring, online optimization, and control. Since many chemical processes of...
详细信息
The quality of process data in a chemical plant significantly affects the performance and benefits gained from activities like performance monitoring, online optimization, and control. Since many chemical processes often show nonlinear dynamics, techniques like extended Kalman filter (EKF) and nonlinear dynamic data reconciliation (NDDR) have been developed to improve the data quality. Recently, the recursive nonlinear dynamic data reconciliation (RNDDR) technique has been proposed, which combines the merits of EKF and NDDR techniques. However, the RNDDR technique cannot handle measurements with gross errors. In this paper, a support vector (SV) regression approach for recursive simultaneous data reconciliation and gross error detection in nonlinear dynamical systems is proposed. SV regression is a compromise between the empirical risk and the model complexity, and for data reconciliation it is robust to random and gross errors. By minimizing the regularized risk instead of the maximum likelihood in the RNDDR, our approach could achieve not only recursive nonlinear dynamic data reconciliation but also gross error detection simultaneously. The nonlinear dynamic system simulation results in this paper show that the proposed approach is robust, efficient, stable, and accurate for simultaneous data reconciliation and gross error detection in nonlinear dynamic systems within a recursive real-time estimation framework. It can also give better performance of control.
The problem of L2-L∞ filtering is discussed for singular time-delay *** is focused on the design of full-order filter that guarantees the delay-dependent exponential admissibility and a prescribed noise attenuation l...
详细信息
The problem of L2-L∞ filtering is discussed for singular time-delay *** is focused on the design of full-order filter that guarantees the delay-dependent exponential admissibility and a prescribed noise attenuation level in L2-L∞ sense for the filtering error *** desired filter can be constructed by solving certain linear matrix inequality (LMI).Numerical examples are given to show that the methods have less conservatism.
Applying statistical mechanics to search problems in AI, decisions and optimization has been one of the powerful channels to solve NP-hard problems. Extensive analytical and experimental research has shown that the &q...
详细信息
Applying statistical mechanics to search problems in AI, decisions and optimization has been one of the powerful channels to solve NP-hard problems. Extensive analytical and experimental research has shown that the "phase transition" phenomenon in search space is often associated with the hardness of complexity. A Bak-Sneppen(BS) model based general-purpose heuristic method, called extremal optimization(EO), proposed by Boettcher and Percus from physics society may perform very well, especially near the phase transitions in compared with other optimization methods, e.g., genetic algorithm and simulated annealing, etc. To actuate more extensive investigations on this new optimization approach particularly in control, computer and optimization communities,this survey reviews the latest research results from fundamental to practice about the connection between computational complexity and phase transitions. Then, further introduces the concepts, fundamentals, algorithms and applications of EO from its capability of self-organized criticality, backbone analysis and co-evolution moving to a far-from-equilibrium state. Finally, the concluding remarks with suggested future research are illustrated.
This paper presents a novel approach for refinery crude oil operations under uncertainty. Due to the flexibility of the crude oil scheduling, decisions made by deterministic optimizations are often conservative or lac...
详细信息
This paper presents a novel approach for refinery crude oil operations under uncertainty. Due to the flexibility of the crude oil scheduling, decisions made by deterministic optimizations are often conservative or lack of robustness or even infeasible, so in this paper future uncertainties are considered to improve feasibility and robustness of the schedule. To handle fluctuating product demand and uncertain ship arrival time, deterministic formulation is replaced by chance constrained programming. Through a series of examples, it proves that by using probabilistic programming, the solution of the problem provides a more robust scheduling under a comprehensive confidence level. The relationship between the probability and reliability of a planned operation is also discussed.
To find global frequent itemsets in a multiple, continuous, rapid and time-varying data stream, a fast, incremental, real-time, and little-memory-cost algorithm should be used. Based on the max-frequency window model,...
详细信息
To find global frequent itemsets in a multiple, continuous, rapid and time-varying data stream, a fast, incremental, real-time, and little-memory-cost algorithm should be used. Based on the max-frequency window model, a BHS summary structure and a novel algorithm called GGFI-MFW are proposed. It merely updates the summaries for subsets of the data new arrived and could directly generate the max-frequency for a given item set without scanning the whole summary. Experiment results indicate that the proposed algorithm could efficiently find global frequent itemsets over a data stream with a small memory and perform overwhelming superiority for a large number of distinct items.
The quality of process data in a chemical plant significantly affects the performance and benefits gained from activities like performance monitoring, online optimization, and control. Since many chemical processes of...
详细信息
The quality of process data in a chemical plant significantly affects the performance and benefits gained from activities like performance monitoring, online optimization, and control. Since many chemical processes often show nonlinear dynamics, techniques like extended Kalman filter (EKF) and nonlinear dynamic data reconciliation (NDDR) have been developed to improve the data quality. Recently, the recursive nonlinear dynamic data reconciliation (RNDDR) technique has been proposed, which combines the merits of EKF and NDDR techniques. However, the RNDDR technique cannot handle measurements with gross errors. In this paper, a support vector (SV) regression approach for recursive simultaneous data reconciliation and gross error detection in nonlinear dynamical systems is proposed. SV regression is a compromise between the empirical risk and the model complexity, and for data reconciliation it is robust to random and gross errors. By minimizing the regularized risk instead of the maximum likelihood in the RNDDR, our approach could achieve not only recursive nonlinear dynamic data reconciliation but also gross error detection simultaneously. The nonlinear dynamic system simulation results in this paper show that the proposed approach is robust, efficient, stable, and accurate for simultaneous data reconciliation and gross error detection in nonlinear dynamic systems within a recursive real-time estimation framework. It can also give better performance of control.
Performance monitoring of model predictive controlsystems (MPC) has received a great interest from both academia and industry. In recent years some novel approaches for multivariate control performance monitoring hav...
详细信息
ISBN:
(纸本)9783902661548
Performance monitoring of model predictive controlsystems (MPC) has received a great interest from both academia and industry. In recent years some novel approaches for multivariate control performance monitoring have been developed without the requirement of process models or interactor matrices. Among them the prediction error approach has been shown to be a promising one, but it is k-step prediction based and may not be fully comparable with the MPC objective that is multi-step prediction based. This paper develops a multi-step prediction error approach for performance monitoring of model predictive controlsystems, and demonstrates its application in an industrial MPC performance monitoring and diagnosis problem.
暂无评论