A review on fault detection and diagnosis techniques: basics and beyond

Safety and reliability are absolutely important for modern sophisticated systems and technologies. Therefore, malfunction monitoring capabilities are instilled in the system for detection of the incipient faults and anticipation of their impact on the future behavior of the system using fault diagnosis techniques. In particular, state-of-the-art applications rely on the quick and efficient treatment of malfunctions within the equipment/system, resulting in increased production and reduced downtimes. This paper presents developments within Fault Detection and Diagnosis (FDD) methods and reviews of research work in this area. The review presents both traditional model-based and relatively new signal processing-based FDD approaches, with a special consideration paid to artificial intelligence-based FDD methods. Typical steps involved in the design and development of automatic FDD system, including system knowledge representation, data-acquisition and signal processing, fault classification, and maintenance related decision actions, are systematically presented to outline the present status of FDD. Future research trends, challenges and prospective solutions are also highlighted.

     

A dynamic variability management approach working with agile product line engineering practices for reusing features

The Journal of Supercomputing - Agile software development (ASD) and software product line (SPL) have shown significant benefits for software engineering processes and practices. Although both...     

Collaborative detection and mitigation of DDoS in software-defined networks

The Journal of Supercomputing - This research presents the detection and mitigation of distributed denial of service (DDoS) in software defined networks (SDN). The proposed method consists of three...     

Smart home security: challenges,issues and solutions at different IoT layers

The Journal of Supercomputing - The Internet of Things is a rapidly evolving technology in which interconnected computing devices and sensors share data over the network to decipher different...     

Benchmarking performance of machine and deep learning-based methodologies for Urdu text document classification

Neural Computing and Applications - In order to provide benchmark performance for Urdu text document classification, the contribution of this paper is manifold. First, it provides a publicly...     

Statistically correlated multi-task learning for autonomous driving

Neural Computing and Applications - Autonomous driving research is an emerging area in the machine learning domain. Most existing methods perform single-task learning, while multi-task learning...     

Hyperspectral imaging-based unsupervised adulterated red chili content transformation for classification: Identification of red chili adulterants

Neural Computing and Applications - Preserving red-chili quality is of utmost importance in which the authorities demand quality techniques to detect, classify, and prevent it from impurities. For...     

A hybrid model for spelling error detection and correction for Urdu language

Neural Computing and Applications - Detecting and correcting misspelled words in a written text are of great importance in many natural language processing applications. Errors can be broadly...     

Soil–conduit interaction: an artificial intelligence application for reinforced concrete and corrugated steel conduits

Neural Computing and Applications - Marston’s load theory is commonly used for understanding the soil–conduit interaction. However, there are no practical methods available which can...     

Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks

In this paper, we study the problem of continuous monitoring of reverse k nearest neighbors queries in Euclidean space as well as in spatial networks. Existing techniques are sensitive toward objects and queries movement. For example, the results of a query are to be recomputed whenever the query changes its location. We present a framework for continuous reverse k nearest neighbor (RkNN) queries by assigning each object and query with a safe region such that the expensive recomputation is not required as long as the query and objects remain in their respective safe regions. This significantly improves the computation cost. As a byproduct, our framework also reduces the communication cost in client–server architectures because an object does not report its location to the server unless it leaves its safe region or the server sends a location update request. We also conduct a rigid cost analysis for our Euclidean space RkNN algorithm. We show that our techniques can also be applied to answer bichromatic RkNN queries in Euclidean space as well as in spatial networks. Furthermore, we show that our techniques can be extended for the spatial networks that are represented by directed graphs. The extensive experiments demonstrate that our techniques outperform the existing techniques by an order of magnitude in terms of computation cost and communication cost.