A Bayesian solution to the multiple composite hypothesis testing for fault diagnosis in dynamic systems

This paper is concerned with model-based isolation and estimation of additive faults in discrete-time linear Gaussian systems. The isolation problem is stated as a multiple composite hypothesis testing on the innovation sequence of the Kalman filter (KF) that considers the system operating under fault-free conditions. Fault estimation is carried out, after isolating a fault mode, by using the Maximum a Posteriori (MAP) criterion. An explicit solution is presented for both fault isolation and estimation when the parameters of the fault modes are assumed to be realizations of specific random variables (RV).     

Active fault tolerant control of discrete event systems using online diagnostics

The aim of this paper is to deal with the problem of fault tolerant control in the framework of discrete event systems modeled as automata. A fault tolerant controller is a controller able to satisfy control specifications both in nominal operation and after the occurrence of a fault. This task is solved by means of a parameterized controller that is suitably updated on the basis of the information provided by online diagnostics: the supervisor actively reacts to the detection of a malfunctioning component in order to eventually meet degraded control specifications. Starting from an appropriate model of the system, we recall the notion of safe diagnosability as a necessary step in order to achieve fault tolerant control. We then introduce two new notions: (i) “safe controllability”, which represents the capability, after the occurrence of a fault, of steering the system away from forbidden zones and (ii) “active fault tolerant system”, which is the property of safely continuing operation after faults. Finally, we show how the problem can be solved using a general control architecture based on the use of special kind of diagnoser, called “diagnosing controller”, which is used to safely detect faults and to switch between the nominal control policy and a bank of reconfigured control policies. A simple example is used to illustrate the new notions and the control architecture introduced in the paper.     

Communication-efficient and crash-quiescent Omega with unknown membership

The failure detector class Omega (Ω) provides an eventual leader election functionality, i.e., eventually all correct processes permanently trust the same correct process. An algorithm is communication-efficient if the number of links that carry messages forever is bounded by n, being n the number of processes in the system. It has been defined that an algorithm is crash-quiescent if it eventually stops sending messages to crashed processes. In this regard, it has been recently shown the impossibility of implementing Ω crash quiescently without a majority of correct processes. We say that the membership is unknown if each process pi only knows its own identity and the number of processes in the system (that is, i and n), but pi does not know the identity of the rest of processes of the system. There is a type of link (denoted by ADD link) in which a bounded (but unknown) number of consecutive messages can be delayed or lost.In this work we present the first implementation (to our knowledge) of Ω in partially synchronous systems with ADD links and with unknown membership. Furthermore, it is the first implementation of Ω that combines two very interesting properties: communication-efficiency and crash-quiescence when the majority of processes are correct. Finally, we also obtain with the same algorithm a failure detector () such that every correct process eventually and permanently outputs the set of all correct processes.     

Multi-objective K-connected Deployment and Power Assignment in WSNs using a problem-specific constrained evolutionary algorithm based on decomposition

The K-connected Deployment and Power Assignment Problem (DPAP) in WSNs aims at deciding both the sensor locations and transmit power levels, for maximizing the network coverage and lifetime objectives under K-connectivity constraints, in a single run. Recently, it is shown that the Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) is a strong enough tool for dealing with unconstraint real life problems (such as DPAP), emphasizing the importance of incorporating problem-specific knowledge for increasing its efficiency. In a constrained Multi-objective Optimization Problem (such as K-connected DPAP), the search space is divided into feasible and infeasible regions. Therefore, problem-specific operators are designed for MOEA/D to direct the search into optimal, feasible regions of the space. Namely, a DPAP-specific population initialization that seeds the initial solutions into promising regions, problem-specific genetic operators (i.e. M-tournament selection, adaptive crossover and mutation) for generating good, feasible solutions and a DPAP-specific Repair Heuristic (RH) that transforms an infeasible solution into a feasible one and maintains the MOEA/D’s efficiency simultaneously. Simulation results have shown the importance of each proposed operator and their interrelation, as well as the superiority of the DPAP-specific MOEA/D against the popular constrained NSGA-II in several WSN instances.     

On the estimation of adequate test set size using fault failure rates

Test set size in terms of the number of test cases is an important consideration when testing software systems. Using too few test cases might result in poor fault detection and using too many might be very expensive and suffer from redundancy. We define the failure rate of a program as the fraction of test cases in an available test pool that result in execution failure on that program. This paper investigates the relationship between failure rates and the number of test cases required to detect the faults. Our experiments based on 11 sets of C programs suggest that an accurate estimation of failure rates of potential fault(s) in a program can provide a reliable estimate of adequate test set size with respect to fault detection and should therefore be one of the factors kept in mind during test set construction. Furthermore, the model proposed herein is fairly robust to incorrect estimations in failure rates and can still provide good predictive quality. Experiments are also performed to observe the relationship between multiple faults present in the same program using the concept of a failure rate. When predicting the effectiveness against a program with multiple faults, results indicate that not knowing the number of faults in the program is not a significant concern, as the predictive quality is typically not affected adversely.     

Induction motor fault detection and diagnosis using a current state space pattern recognition

In the last few decades the continuous monitoring of complex dynamic systems has become an increasingly important issue across diverse engineering areas. This paper presents a pattern recognition based system that uses visual-based efficient invariants features for continuous monitoring of induction motors. The procedures presented here are based on the image identification of the 3-D current state space patterns that allow the identification of distinct fault types and, furthermore, their corresponding severity. This automatic fault detection system deals with time-variant electric currents and is based on the identification of three-phase stator currents specified patterns. Several simulation and experimental results are also presented in order to verify the effectiveness of the proposed methodology.     

基于18F4520的风光互补路灯控制系统的研究

可再生能源的综合利用对社会经济的可持续发展和环境保护有着十分重要的作用,太阳能和风能作为两种应用广泛的可再生资源,在资源条件和技术应用上都具互补性.本文介绍了以PIC18F4520单片机为控制核心的风光互补路灯系统的硬件结构、工作原理与软件设计方法,实现了对风光互补路灯系统的智能化管理和控制,系统运行可靠,成本低,易于实现,便于维护升级.     

手持式电站锅炉配风监测仪的设计

针对当前电站锅炉燃烧器的现场巡视、检修设备的溃乏,研制一种手持式电站锅炉配风监测仪势在必行。基于在了解电站锅炉煤粉配风监测系统的工作原理以及测量工作原理的基础上,首先采用经标定过的测速元件测量,经差压变速器送到测量装置内部的压力传感器变送测量出动压;其次由测速原理可以计算出风速;再次由三支分别用于测量热风温度、煤粉温度和风粉混合温度的铂电阻传感器所测得的温度值,根据热平衡原理计算出煤粉浓度。重点介绍了基本设计电路硬件结构以及关键低功耗电路设计,既给出了监测仪主程序软件流程图,又给出了电站锅炉配风仪动压测量的结果分析,达到了设计的要求。经电厂技术人员试验证明,运行可靠,使用方便,成本低,有较高的推广价值。     

粗糙集及PSO优化BP网络的故障诊断研究

针对PP神经网络故障诊断存在网络结构复杂、训练时间长、精度不高的问题,将粗糙集、微粒群算法、遗传算法引入到柴油机故障诊断中,提出了基于粗糙集理论与改进PP神经网络相结合的柴油机故障诊断算法。算法采用自组织映射方法对连续属性离散化,利用粗糙集理论对特征参数进行属性约简,使用微粒群算法优化PP网络结构,从而缩短训练时间,有效提高故障诊断的准确度。最后用柴油机的实际诊断结果验证了该算法的可行性、快速性和准确性。