Hybrid Wavelet Stacking Ensemble Model for Insulators Contamination Forecasting

N/

Modeling and fault diagnosis of broken rotor bar faults in induction motors

Due to vast industrial applications, induction motors are often referred to as the “workhorse” of the industry. To detect incipient faults and improve reliability, condition monitoring and fault diagnosis of induction motors are very important. In this thesis, the focus is to model and detect broken rotor bar (BRB) faults in induction motors through the finite element analysis and machine learning approach. The most successfully deployed method for the BRB fault detection is Motor Current Signature Analysis (MSCA) due to its non-invasive, easy to implement, lower cost, reliable and effective nature. However, MSCA has its own limitations. To overcome such limitations, fault diagnosis using machine learning attracts more research interests lately. Feature selection is an important part of machine learning techniques. The main contributions of the thesis include: 1) model a healthy motor and a motor with different number of BRBs using finite element analysis software ANSYS; 2) analyze BRB faults of induction motors using various spectral analysis algorithms (parametric and non-parametric) by processing stator current signals obtained from the finite element analysis; 3) conduct feature selection and classification of BRB faults using support vector machine (SVM) and artificial neural network (ANN); 4) analyze neighbouring and spaced BRB faults using Burg and Welch PSD analysis

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words