Search

This paper proposes a new passive robust fault detection scheme using non-linear models that include parameter uncertainty. The non-linear model considered here is described by a group method of data handling (GMDH) neural network. The problem of passive robust fault detection using models including parameter uncertainty has been mainly addressed by checking if the measured behaviour is inside the region of possible behaviours based on the so-called forward test since it bounds the direct image of an interval function. The main contribution of this paper is to propose a new backward test, based on the inverse image of an interval function, that allows checking if there exists a parameter in the uncertain parameter set that is consistent with the measured system behaviour. This test is implemented using interval constraint satisfaction algorithms which can perform efficiently in deciding if the measured system state is consistent with the GMDH model and its associated uncertainty. Finally, this approach is tested on the servoactuator being a FDI benchmark in the European Project DAMADICS. [Copyright &y& Elsevier]

Weight-perturbation (WP) algorithms for supervised and/or reinforcement learning offer improved biological plausibility over backpropagation because of their reduced circuitry requirements for realization in neural hardware. This paper explores the hypothesis that biological synaptic noise might serve as the substrate by which weight perturbation is implemented. We explore the basic synaptic noise hypothesis (BSNH), which embodies the weakest assumptions about the underlying neural circuitry required to implement WP algorithms. This paper identifies relevant biological constraints consistent with the BSNH, taxonomizes existing WP algorithms with regard to consistency with those constraints, and proposes a new WP algorithm that is fully consistent with the constraints. By comparing the learning effectiveness of these algorithms via simulation studies, it is found that all of the algorithms can support traditional neural network learning tasks and have similar generalization characteristics, although the results suggest a trade-off between learning efficiency and biological accuracy. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we are considering that the design process can be modelled in the form of a constraint satisfaction problem (CSP). CSP modelling or resolution has proved its efficiency within the framework of single-designer design. We propose to extend the functions of CSP to the context of multi-concept design of the same artefact. We define CoCSP as cooperative constraint satisfaction problem including the actors of the design problem. We are presenting the operating principles of an algorithm for the real-time management of design decisions, based on a model described in the form of a CoCSP for the integration of supply-chain constraints. This algorithm enables the number of design decisions rejected at a given moment in design to be kept to a minimum. The algorithm forms the core of a prototype for an unsupervised, generic constraint-based collaborative design system. Our aim is to produce a platform centred on the notion of constraints that will enable a product design problem to be modelled and solved by integrating supply-chain constraints as far upstream as possible. [Copyright &y& Elsevier]

In this paper, a modified learning algorithm to obtain better generalization performance is proposed. The cost terms of this new algorithm are selected based on the second-order derivatives of the neural activation at the hidden layers and the first-order derivatives of the neural activation at the output layer. It can be guaranteed that in the course of training, the additional cost terms for this algorithm can penalize both the input-to-output mapping sensitivity and the high frequency components to obtain better generalization performance. Finally, theoretical justifications and simulation results are given to verify the efficiency and effectiveness of the proposed learning algorithm. [ABSTRACT FROM AUTHOR]

This paper proposes document clustering using Kohonen neural network with pairwise constraints. This algorithm works directly on textual information without mapping document into some representation that has quantitative features. The input level of the proposed neural network can directly receive a qualitative value without mapping the qualitative value into the numerical value. The proposed neural network is based on the architecture of text processing Kohonen neural network, the concepts of dissimilarity measure of symbolic objects and pairwise constrained concepts. As a result, the model can successfully assign cluster label to the objects. [ABSTRACT FROM AUTHOR]