基于混合最小二乘支持向量机网络模型的非线性系统辨识

针对基于输入输出数据的非线性系统辨识问题,提出一种新的混合最小二乘支持向量机(LS-SVMs)网络模型及相应的学习算法.该算法将系统的辨识问题动态自适应的划分为若干子问题,将支持向量机(SVM)用于各子模块辨识;通过分析模型的统计学特性,给出基于整体框架优化的系统参数辨识方法.针对系统中参数相关联的特性,采用期望条件最大化(ECM)算法对其进行条件辨识,同时结合正则化理论和最小二乘法,保证各专家模块的结构风险最小化辨识原则.试验结果表明,该方法兼具良好的辨识精度和泛化性能.     

Windows CE下基于SPI总线的双机通信技术

智能分析仪器要求在Windows CE系统下能够通过SPI总线实现副板与主板、主板与主板之间的数据传输。首先介绍了SPI双机通信的机理,其次分析了Windows CE下的中断处理机制的流程,最后从内核态的中断服务程序、驱动层的中断服务线程、流接口函数、驱动加载等方面实现了Windows CE下SPI双机通信的驱动程序。实验表明,两个智能分析仪器的主板之间能够可靠、稳定地传输数据。     

基于支持向量机的故障诊断

将支持向量机应用于故障的分类诊断,通过实例建立了两类故障分类器和多故障分类器,给出了具体的建立多故障分类器的步骤和仿真结果。最后提出了一种新的方法——基于支持向量机的并行诊断网络。     

Dispatching rule for non-identical parallel machines with sequence-dependent setups and quality restrictions

This paper proposes a dispatching rule that guarantees a predetermined minimum quality level for non-identical parallel machines with multiple product types. Manufacturers are focusing on improving the overall quality of their products, as the demand for top quality products is increasing. Such changes increase the possibility of neglecting another crucial factor in manufacturing schedules, namely due date. Traditionally, jobs are dispatched with the focus on meeting due dates. That is, jobs are assigned to machines without consideration of product quality. This approach opens the possibility of manufacturing poor quality products. Realizing the shortcomings of the existing dispatching rules, manufacturers are tempted to dispatch jobs with the objective of maximizing product quality. With such an attempt, jobs are likely to be assigned to high performance machines only. In turn, waiting times will increase and job delays are inevitable. This research proposes a dispatching rule that satisfies both criteria, reducing due date delays, while ensuring a predefined product quality level. A quality index is introduced to standardize various product qualities. The index is used to ensure a predetermined quality level, whilst minimizing product delays. Simulations compare various dispatch methods, evaluating them based on mean tardiness and product quality.     

基于小波变换核主元分析和多支持向量机的过程监控

针对过程工业数据中所含的噪声和干扰信号、过程工业的非线性及基于主元分析(Principal Component Analysis,PCA)的统计性能监控法由于不用过程机理模型的信息从而对故障诊断问题难以在理论上作系统分析的缺陷,提出基于小波变换核主元分析和多支持向量机的过程监控方法,该方法首先采用基于小波变换的收缩阈值去噪法对建模数据进行预处理,以有效抑制过程数据中所含的噪声和干扰信号,然后利用核主元分析来进行故障特征的提取,从而提高非线性统计过程监控的准确性;最后提出多支持向量机用来对故障的来源进行分类,以避免求解核主元空间到原始空间的逆映射.将该方法应用到对TE(Tennessee Eastman,TE)过程的监控,表明了所提出方法的有效性,为过程的监控和故障诊断提供了一个新的方法.     

Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times

In this paper, we discuss a scheduling problem for jobs on identical parallel machines. Ready times of the jobs, precedence constraints, and sequence-dependent setup times are considered. We are interested in minimizing the performance measure total weighted tardiness that is important for achieving good on-time delivery performance. Scheduling problems of this type appear as subproblems in decomposition approaches for large scale job shops with automated transport of the jobs as, for example, in semiconductor manufacturing. We suggest several variants of variable neighborhood search (VNS) schemes for this scheduling problem and compare their performance with the performance of a list based scheduling approach based on the Apparent Tardiness Cost with Setups and Ready Times (ATCSR) dispatching rule. Based on extensive computational experiments with randomly generated test instances we are able to show that the VNS approach clearly outperforms heuristics based on the ATCSR dispatching rule in many situations with respect to solution quality. When using the schedule obtained by ATCSR as an initial solution for VNS, then the entire scheme is also fast and can be used as a subproblem solution procedure for complex job shop decomposition approaches.     

Size-reduction heuristics for the unrelated parallel machines scheduling problem

In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job differs from machine to machine. We deal with the objective of the minimisation of the maximum completion time of the jobs, usually referred to as makespan or C_max. This is a type of assignment problem that has been frequently studied in the scientific literature due to its many potential applications. We propose a set of metaheuristics based on a size-reduction of the original assignment problem that produce solutions of very good quality in a short amount of time. The underlying idea is to consider only a few of the best possible machine assignments for the jobs and not all of them. The results are simple, yet powerful methods. We test the proposed algorithms with a large benchmark of instances and compare them with current state-of-the-art methods. In most cases, the proposed size-reduction algorithms produce results that are statistically proven to be better by a significant margin.     

Support vector regression based modeling of pier scour using field data

This paper investigates the potential of support vector machines based regression approach to model the local scour around bridge piers using field data. A dataset of consisting of 232 pier scour measurements taken from BSDMS were used for this analysis. Results obtained by using radial basis function and polynomial kernel based Support vector regression were compared with four empirical relation as well as with a backpropagation neural network and generalized regression neural network. A total of 154 data were used for training different algorithms whereas remaining 78 data were used to test the created model. A coefficient of determination value of 0.897 (root mean square error=0.356) was achieved by radial basis kernel based support vector regression in comparison to 0.880 and 0.835 (root mean square error=0.388 and 0.438) by backpropagation neural and generalized regression neural network. Comparisons of results with four predictive equations suggest an improved performance by support vector regression. Results with dimensionless data using all three algorithms suggest a better performance by dimensional data with this dataset. Sensitivity analysis suggests the importance of depth of flow and pier width in predicting the scour depth when using support vector regression based modeling approach.     

支持向量机的进化多核设计

为提高支持向量机分类精度,提出一种基于遗传程序设计的进化多核算法.算法中每个个体表示一个多核函数,并采用树形结构进行编码,增强了多核函数的非线性;初始种群由生长法产生,经过遗传操作后得到适合具体问题的进化多核函数.遗传程序设计的全局搜索性能使得算法设计不需要先验知识.与单核函数及其他多核函数的对比实验结果表明,进化多核...