Fault diagnosis for hydraulic pump based on EEMD-KPCA and LVQ

Hydraulic pump is regarded as the heart of hydraulic system. Achieving the real-time fault diagnosis of hydraulic pump is of great importance for the maintenance of the entire system. An accurate fault clustering solution with self-adaptive signal processing is needed for extracting performance degradation information hidden in the nonlinear and non-stationary signals of hydraulic pumps. Therefore, a fault diagnosis approach based on ensemble empirical mode decomposition (EEMD), kernel principal component analysis (KPCA), and learning vector quantization (LVQ) network is proposed in this study. First, EEMD is employed to acquire more significant intrinsic mode functions (IMFs), thus overcoming the drawback of empirical mode decomposition, and further extracting the energy values of each IMF to form the feature vector. Second, KPCA, a nonlinear dimension reduction method, is used to remove redundancies of the extracted feature vector for high accuracy of fault diagnosis. Finally, LVQ is employed to classify faults based on the reduced feature vector. The efficiency and accuracy of the proposed method is validated by a case study based on the vibration dataset of a plunger pump

A deep learning method using SDA combined with dropout for bearing fault diagnosis

The fault diagnosis of a rolling bearing is at present very important to ensure the steadiness of rotating machinery. According to the non-stationary and non-liner characteristics of bearing vibration signals, a large number of approaches for feature extraction and fault classification have been developed. An effective unsupervised self-learning method is proposed to achieve the complicated fault diagnosis of rolling bearing in this paper, which uses stacked denoising autoencoder (SDA) to learn useful feature representations and improve fault pattern classification robustness by corrupting the input data, meanwhile employs “dropout” to prevent the overfitting of hidden units. Finally the high-level feature representations extracted are set as the inputs of softmax classifier to achieve fault classification. Experiments indicate that the deep learning method of SDA combined with dropout has an advantage in fault diagnosis of bearing, and can be applied widely in future

Health assessment of rotary machinery based on integrated feature selection and Gaussian mixed model

Bearing failure is the most common failure mode of all rotary machinery failures, and can interrupt the production in a plant causing unscheduled downtime and production losses. A bearing failure also has the potential to damage machinery causing soaring machinery repair and/or replacement costs. In order to prevent unexpected bearing failure, a health assessment method is proposed in this paper. It employs an integrated feature selection approach and Gaussian mixture model (GMM). Firstly, the integrated feature selection approach, which combines empirical mode decomposition (EMD), singular value decomposition (SVD) and Principal Component Analysis (PCA), processes nonlinear and non-stationary vibration signals of a bearing and extracts features for health assessment. Then, GMM is utilized to evaluate and track the health degradation of the bearing in terms of confidence values (CV). This method, which is notable for bearing health tracking and detect the defect at its incipient stage, can be used without the need for failure datasets in applications. Finally, the feasibility and efficiency of this method was validated by two datasets of different bearing experiments

Fault Diagnosis of a Hydraulic Pump Based on the CEEMD-STFT Time-Frequency Entropy Method and Multiclass SVM Classifier

The fault diagnosis of hydraulic pumps is currently important and significant to ensure the normal operation of the entire hydraulic system. Considering the nonlinear characteristics of hydraulic-pump vibration signals and the mode mixing problem of the original Empirical Mode Decomposition (EMD) method, first, we use the Complete Ensemble EMD (CEEMD) method to decompose the signals. Second, the time-frequency analysis methods, which include the Short-Time Fourier Transform (STFT) and time-frequency entropy calculation, are applied to realize the robust feature extraction. Third, the multiclass Support Vector Machine (SVM) classifier is introduced to automatically classify the fault mode in this paper. An actual hydraulic-pump experiment demonstrates the procedure with a complete feature extraction and accurate mode classification

中國古代士人的離散—回歸意識與文學書寫 : 以唐宋貶謫文學爲例

從生存狀態和生存體認出發，“離散”概念的外延，可以延伸到“離散意識”，以及與它相對的“回歸意識”這一層面。而離散的主體，則可以延伸到中國古代士人這一群體。自故鄉—政治文化中心離散，期盼回歸到故鄉—政治文化中心，構成了中國古代士人離散—回歸意識的核心内涵。這裡的“故鄉”，除了故土家園之外，還具有理想、歸宿或者精神家園的含義：所謂“此心安處是吾鄉”。古代中國士人“離散—回歸”意識的獨特内涵，及其文學書寫的獨特風貌，便是由上述質素構成、影響和造就的。從貶謫文學的視角看，貶謫帶來的離散，具有不可忽視的文化價值。 From the living state and survival awareness, the extension of the concept of ‘‘diaspora” can be extended to ‘‘diaspora consciousness” and its relative “regression consciousness”. Meanwhile, the subject of diaspora can be extended to the group of Chinese ancient intellectuals. Leaving from hometown-political cultural center and looking forward to return to hometown-political cultural center constitutes the Chinese ancient intellectual’s core connotation of the diaspora-regression consciousness. Here the “hometown” is not only the meaning of homeland but also includes the connotation of the ideal, destination or spiritual home: the so-called “Wherever my heart is at peace is my home”. The characteristic connotation of the “diaspora-regression” consciousness of the Chinese ancient intellectual and the unique style of their literature writing are composed, influenced and created by the above factors. From the perspective of relegation literature, the diaspora which brought by the relegation has the cultural value that can not be ignored

Sub-GMN: The Neural Subgraph Matching Network Model

As one of the most fundamental tasks in graph theory, subgraph matching is a crucial task in many fields, ranging from information retrieval, computer vision, biology, chemistry and natural language processing. Yet subgraph matching problem remains to be an NP-complete problem. This study proposes an end-to-end learning-based approximate method for subgraph matching task, called subgraph matching network (Sub-GMN). The proposed Sub-GMN firstly uses graph representation learning to map nodes to node-level embedding. It then combines metric learning and attention mechanisms to model the relationship between matched nodes in the data graph and query graph. To test the performance of the proposed method, we applied our method on two databases. We used two existing methods, GNN and FGNN as baseline for comparison. Our experiment shows that, on dataset 1, on average the accuracy of Sub-GMN are 12.21\% and 3.2\% higher than that of GNN and FGNN respectively. On average running time Sub-GMN runs 20-40 times faster than FGNN. In addition, the average F1-score of Sub-GMN on all experiments with dataset 2 reached 0.95, which demonstrates that Sub-GMN outputs more correct node-to-node matches. Comparing with the previous GNNs-based methods for subgraph matching task, our proposed Sub-GMN allows varying query and data graphes in the test/application stage, while most previous GNNs-based methods can only find a matched subgraph in the data graph during the test/application for the same query graph used in the training stage. Another advantage of our proposed Sub-GMN is that it can output a list of node-to-node matches, while most existing end-to-end GNNs based methods cannot provide the matched node pairs

Demystifying Developers' Issues in Distributed Training of Deep Learning Software

Deep learning (DL) has been pervasive in a wide spectrum of nowadays software systems and applications. The rich features of these DL based software applications (i.e., DL software) usually rely on powerful DL models. To train powerful DL models with large datasets efficiently, it has been a common practice for developers to parallelize and distribute the computation and memory over multiple devices in the training process, which is known as distributed training. However, existing efforts in the software engineering (SE) research community mainly focus on issues in the general process of training DL models. In contrast, to the best of our knowledge, issues that developers encounter in distributed training have never been well studied. Given the surging importance of distributed training in the current practice of developing DL software, this paper fills in the knowledge gap and presents the first comprehensive study on developers' issues in distributed training. To this end, we extract and analyze 1,054 real-world developers' issues in distributed training from Stack Overflow and GitHub, two commonly used data sources for studying software issues. We construct a fine-grained taxonomy consisting of 30 categories regarding the fault symptoms and summarize common fix patterns for different symptoms. Based on the results, we suggest actionable implications and research avenues that can potentially facilitate the future development of distributed training