基于KISOMAP-LDA-KNN算法TE过程故障诊断研究

针对化工连续生产过程的时序性及非线性等特征,文章提出了一种基于KISOMAP-LDA-KNN的非线性故障辨识方法。首先采用核等距映射（KISOMAP）算法在保持训练数据内在几何结构下进行非线性降维,然后使用线性判别（LDA）算法保持数据的最佳分类效果下进行降维,完成过程的特征提取,最后用K近邻（KNN）算法进行模式分类。将上述方法应用到TE过程,仿真结果验证了该故障诊断方法有较高的辨识能力。     

Robust monitoring and fault reconstruction based on variational inference component analysis

Probabilistic models such as probabilistic principal component analysis (PPCA) have recently caught much attention in the process monitoring area. An important issue of the PPCA method is how to determine the dimensionality of the latent variable space. In the present paper, one of the most popular Bayesian type chemometric methods, Bayesian PCA (BPCA) is introduced for process monitoring purpose, which is based on the recent developed variational inference algorithm. In this monitoring framework, the effectiveness of each extracted latent variable can be well reflected by a hyperparameter, upon which the dimensionality of the latent variable space can be automatically determined. Meanwhile, for practical consideration, the developed BPCA-based monitoring method is robust to missing data and can also give satisfactory performance under limited data samples. Another contribution of this paper is due to the proposal of a new fault reconstruction method under the BPCA model structure. Two case studies are provided to evaluate the performance of the proposed method.     

嵌入式操作系统进程监测器的设计与实现

为避免嵌入式操作系统的进程受到恶意软件的修改破坏,提出一种适合于嵌入式操作系统的进程监测器。监测器周期性地对系统进程控制块进行检测恢复,通过设置进程检查点为系统提供恢复操作进程,并在Linux上进行实现,给出主要的数据结构和实现过程。实验结果表明,监测器的运行对系统性能影响小,能对系统进程进行有效的检测恢复。     

基于层次分析法的测试用例可复用性度量研究

对测试用例的可复用性度量进行研究,构建测试用例可复用性评估模型,通过分析转化得到易于度量的层次分析模型。通过层次分析模型构建权重比较矩阵,再进行相关属性的度量,并可进一步开展自动的测试用例可复用性度量。     

The voting analytic hierarchy process method for discriminating among efficient decision making units in data envelopment analysis

Making optimal use of available resources has always been of interest to humankind, and different approaches have been used in an attempt to make maximum use of existing resources. Limitations of capital, manpower, energy, etc., have led managers to seek ways for optimally using such resources. In fact, being informed of the performance of the units under the supervision of a manager is the most important task with regard to making sensible decisions for managing them. Data envelopment analysis (DEA) suggests an appropriate method for evaluating the efficiency of homogeneous units with multiple inputs and multiple outputs. DEA models classify decision making units (DMUs) into efficient and inefficient ones. However, in most cases, managers and researchers are interested in ranking the units and selecting the best DMU. Various scientific models have been proposed by researchers for ranking DMUs. Each of these models has some weakness(es), which makes it difficult to select the appropriate ranking model. This paper presents a method for ranking efficient DMUs by the voting analytic hierarchy process (VAHP). The paper reviews some ranking models in DEA and discusses their strengths and weaknesses. Then, we provide the method for ranking efficient DMUs by VAHP. Finally we give an example to illustrate our approach and then the new method is employed to rank efficient units in a real world problem.     

Time prediction based on process mining

Process mining allows for the automated discovery of process models from event logs. These models provide insights and enable various types of model-based analysis. This paper demonstrates that the discovered process models can be extended with information to predict the completion time of running instances. There are many scenarios where it is useful to have reliable time predictions. For example, when a customer phones her insurance company for information about her insurance claim, she can be given an estimate for the remaining processing time. In order to do this, we provide a configurable approach to construct a process model, augment this model with time information learned from earlier instances, and use this to predict e.g., the completion time. To provide meaningful time predictions we use a configurable set of abstractions that allow for a good balance between “overfitting” and “underfitting”. The approach has been implemented in ProM and through several experiments using real-life event logs we demonstrate its applicability.     

Pattern recognition of manufacturing process signals using Gaussian mixture models-based recognition systems

Unnatural patterns exhibited in manufacturing processes can be associated with certain assignable causes for process variation. Hence, accurate identification of various process patterns (PPs) can significantly narrow down the scope of possible causes that must be investigated, and speed up the troubleshooting process. This paper proposes a Gaussian mixture models (GMM)-based PP recognition (PPR) model, which employs a collection of several GMMs trained for PPR. By using statistical features and wavelet energy features as the input features, the proposed PPR model provides more simple training procedure and better generalization performance than using single recognizer, and hence is easier to be used by quality engineers and operators. Furthermore, the proposed model is capable of adapting novel PPs through using a dynamic modeling scheme. The simulation results indicate that the GMM-based PPR model shows good detection and recognition of current PPs and adapts further novel PPs effectively. Analysis from this study provides guidelines in developing GMM – based SPC recognition systems.     

A knowledge base model for complex forging die machining

Recent evolutions on forging process induce more complex shape on forging die. These evolutions, combined with High Speed Machining (HSM) process of forging die lead to important increase in time for machining preparation. In this context, an original approach for generating machining process based on machining knowledge is proposed in this paper. The core of this approach is to decompose a CAD model of complex forging die in geometrical features. Technological data and topological relations are aggregated to a geometrical feature in order to create machining features. Technological data, such as material, surface roughness and form tolerance are defined during forging process and dies design. These data are used to choose cutting tools and machining strategies. Topological relations define relative positions between the surfaces of the die CAD model. After machining features identification cutting tools and machining strategies currently used in HSM of forging die, are associated to them in order to generate machining sequences. A machining process model is proposed to formalize the links between information imbedded in the machining features and the parameters of cutting tools and machining strategies. At last machining sequences are grouped and ordered to generate the complete die machining process. In this paper the identification of geometrical features is detailed. Geometrical features identification is based on machining knowledge formalization which is translated in the generation of maps from STL models. A map based on the contact area between cutting tools and die shape gives basic geometrical features which are connected or not according to the continuity maps. The proposed approach is illustrated by an application on an industrial study case which was accomplished as part of collaboration.     

Multi-objective FMS process planning with various flexibilities using a symbiotic evolutionary algorithm

This paper presents an evolutionary algorithm, called the multi-objective symbiotic evolutionary algorithm (MOSEA), to solve a multi-objective FMS process planning (MFPP) problem with various flexibilities. The MFPP problem simultaneously considers four types of flexibilities related to machine, tool, sequence, and process and takes into account three objectives: balancing the machine workload, minimizing part movements, and minimizing tool changes. The MOSEA is modeled as a two-leveled structure to find a set of well-distributed solutions close to the true Pareto optimal solutions. To promote the search capability of such solutions, two main processes imitating symbiotic evolution and endosymbiotic evolution are introduced, together with an elitist strategy and a fitness sharing scheme. Evolutionary components suitable for the MFPP problem are provided. With a variety of test-bed problems, the performance of the proposed MOSEA is compared with those of existing multi-objective evolutionary algorithms. The experimental results show that the MOSEA is promising in solution convergence and diversity.