Model Selection for Unsupervised Learning of Visual Context

This study addresses the problem of choosing the most suitable probabilistic model selection criterion for unsupervised learning of visual context of a dynamic scene using mixture models. A rectified Bayesian Information Criterion (BICr) and a Completed Likelihood Akaike’s Information Criterion (CL-AIC) are formulated to estimate the optimal model order (complexity) for a given visual scene. Both criteria are designed to overcome poor model selection by existing popular criteria when the data sample size varies from small to large and the true mixture distribution kernel functions differ from the assumed ones. Extensive experiments on learning visual context for dynamic scene modelling are carried out to demonstrate the effectiveness of BICr and CL-AIC, compared to that of existing popular model selection criteria including BIC, AIC and Integrated Completed Likelihood (ICL). Our study suggests that for learning visual context using a mixture model, BICr is the most appropriate criterion given sparse data, while CL-AIC should be chosen given moderate or large data sample sizes.     

A possibilistic clustering approach to novel fault detection and isolation

In this paper, a new approach for fault detection and isolation that is based on the possibilistic clustering algorithm is proposed. Fault detection and isolation (FDI) is shown here to be a pattern classification problem, which can be solved using clustering and classification techniques. A possibilistic clustering based approach is proposed here to address some of the shortcomings of the fuzzy c-means (FCM) algorithm. The probabilistic constraint imposed on the membership value in the FCM algorithm is relaxed in the possibilistic clustering algorithm. Because of this relaxation, the possibilistic approach is shown in this paper to give more consistent results in the context of the FDI tasks. The possibilistic clustering approach has also been used to detect novel fault scenarios, for which the data was not available while training. Fault signatures that change as a function of the fault intensities are represented as fault lines, which have been shown to be useful to classify faults that can manifest with different intensities. The proposed approach has been validated here through simulations involving a benchmark quadruple tank process and also through experimental case studies on the same setup. For large scale systems, it is proposed to use the possibilistic clustering based approach in the lower dimensional approximations generated by algorithms such as PCA. Towards this end, finally, we also demonstrate the key merits of the algorithm for plant wide monitoring study using a simulation of the benchmark Tennessee Eastman problem.     

Prediction Model for BTA Deep-Hole Machining using Fuzzy Clustering Approach: Experimental Study

In this article, a subtractive clustering-based fuzzy identification method and a Sugeno-type fuzzy inference system are used for modeling in metal cutting. This approach is considered with its application on the experimental study of Boring and Trepanning Association (BTA) deep-hole drilling. The model for the surface roughness is identified by using the cutting speed and feed as input data and roughness as the output data. Using subtractive clustering in both input and output spaces performs the model-building process. Minimum error model is obtained through enumerative search of clustering parameters. The fuzzy model obtained is capable of predicting the surface roughness for a given set of inputs (speed and feed). Therefore, the operator can predict the quality of the surface for a given set of working parameters and will then be able to set the machining parameters to achieve a certain surface quality. The fuzzy model is verified experimentally by further experimentation using different sets of inputs. The tool life is also investigated using the same approach. The fuzzy inference system obtained is capable of predicting the tool life for a given set of cutting parameters. Therefore, the operator will be able to predict how many minutes the cutting tool is going to last and will set the time for the next tool change.     

双级染料激光放大器泵浦能量分配的数值研究

用染料激光放大器的横向稳态泵浦理论，对不同的入射光能量选择不同的增益计算方法，研究了双级染料放大器的泵浦能量分配比例、泵浦光总能量和信号光能量大小对激光增益的影响。计算结果表明，对于其他参数确定的放大系统，存在着最佳的泵浦能量分配比例，可获得最大增益输出。通过自编程序的计算，可方便地找出特定系统泵浦能量分配比例的最佳值。     

一种T-S型动态模糊推理模型的建模算法研究

以一种进化聚类算法（ECM）为基础,提出了一种新的T-S型动态模糊推理模型的建模算法.以往许多神经模糊模型都不适用于自适应在线学习,而文章模型能够实时地调整模糊规则库及规则参数,具有较强的在线学习能力.仿真结果表明,该方法是有效的.     

An algorithm for architecture partitioning in high-speed networks with bursty traffic

This paper analyzes the performance of a switching architecture. The performance measures include the elapsed time of packet transfer and the waiting time to begin transfer. The architecture is partitioned depending on the type of network used and the expected traffic in the network. Every partition has a switch with a buffer that can absorb surges of bursty traffic within the network partition. The buffer size depends on the type of the network and incoming traffic. The partition size depends on the network bandwidth, network traffic, packet size and buffer size. Examples of different networks are used to show the applications of the model. The results show that the elapsed time of packet switch transfer depends exponentially on the number of partitions in the network.     

基于虚拟分割机制的多服务交换路由器的研究

本文提出了一处基于虚拟分割机制的可编程多服务器由器实现结构：PVSMR，并对它的三个层面的主要构成及其关键技术进行了深入研究。PVSMR基于一种有效而灵活的资源虚拟分割算法，它能够提供与多类应用相适应的、灵活的报文处理和转发控制能力。     

有序聚类法在锦凌水库风化岩体定量分带中的应用

应用有序聚类法对辽宁省锦凌水库坝基的风化岩体进行定量分带,所得结果与地质观察方法、规范法等所得出的结果进行了分析比较.采用岩体风化差异系数法进行综合分析,最终推荐按照有序聚类方法进行风化岩体分带.     

基于聚类算法实现信号盲分类

本文解决了信号处理、工业控制等领域存在的非平稳信号盲分类问题。在聚类中广泛应用的K-Means算法及其它基于中心的聚类算法有两个共同的缺陷-需要预先确定类数目且随机初始化中心引起性能不稳定。本文提出的算法较好地解决了这两个问题，提高了算法稳定性，实现了非平稳信号盲分类。提取非平稳信号的小波系数作为聚类的样本空间，分析聚类结果的统计偏差以估计类的数目，采用调和均值准则进行分类。最后给出的仿真结果表明本文提出的方法较传统的K-Means算法明显降低分类错误率。     

A fuzzy clustering algorithm enhancing local model interpretability

In this work, simple modifications on the cost index of particular local-model fuzzy clustering algorithms are proposed in order to improve the readability of the resulting models. The final goal is simultaneously providing local linear models (reasonably close to the plant’s Jacobian) and clustering in the input space so that desirable characteristics (regarding final model accuracy, and convexity and smoothness of the cluster membership functions) are improved with respect to other proposals in literature. Some examples illustrate the proposed approach.