Stochastic resonance is a new type of weak signal detection method. Compared with traditional noise suppression technology, stochastic resonance uses noise to enhance weak signal information, and there is a mechanism for the transfer of noise energy to signal energy. The purpose of this paper is to study the theory and application of weak signal detection based on stochastic resonance mechanism. This paper studies the stochastic resonance characteristics of the bistable circuit and conducts an experimental simulation of its circuit in the Multisim simulation environment. It is verified that the bistable circuit can achieve the stochastic resonance function very well, and it provides strong support for the actual production of the bistable circuit. This paper studies the stochastic resonance phenomenon of FHN neuron model and bistable model, analyzes the response of periodic signals and nonperiodic signals, verifies the effect of noise on stochastic resonance, and lays the foundation for subsequent experiments. It proposes to feedback the link and introduces a two-layer FHN neural network model to improve the weak signal detection performance under a variable noise background. The paper also proposes a multifault detection method based on the total empirical mode decomposition of sensitive intrinsic mode components with variable scale adaptive stochastic resonance. Using the weighted kurtosis index as the measurement index of the system output can not only maintain the similarity between the system output signal and the original signal but also be sensitive to impact characteristics, overcoming the missed or false detection of the traditional kurtosis index. Experimental research shows that this method has better noise suppression ability and a clear reproduction effect on details. Especially for images contaminated by strong noise (D = 500), compared with traditional restoration methods, it has better performance in subjective visual effects and signal-to-noise ratio evaluation.

Stochastic resonance can detect weak periodic signals from strong background noise without loss of signal energy. However, the classical bistable stochastic resonance has the inherent output saturation defect, which limits the detection performance of system. And it is more difficult to detect signal with strong background noise. In this article, we constructed improved unsaturated bistable stochastic resonance to overcome this shortcoming. The improved bistable potential function makes the output signal more easily oscillate in two potential wells. To improve the stability and the accuracy of the method, we further propose an adaptive improved unsaturated bistable stochastic resonance (AIUBSR) by constructing a synthetic index (SI). The SI combines zero‐crossing ratio and structural correlation coefficient, which can measure the periodicity of output signal and the accuracy of detective frequency at the same time. Theoretical analysis and numerical simulations show that the proposed AIUBSR can have good weak signal detection capability in strong background noise.

No abstract

Magnetic memory test technology is a new nondestructive testing technique, which is able to detect of the stress concentration area and potential fault of low speed and heavy load gear. Because the magnetic memory signals are easy to be disturbed by various sources of noises, a new method based on the intrinsic time-scale decomposition (ITD) is proposed to achieve the extraction of magnetic memory signal. Firstly, the magnetic memory signals are decomposed into several proper rotation components (PRC) and a trend component by ITD. Then reconstruct the first four order PRCs to eliminate the low frequency cyclic composition of magnetic memory signal and magnetic noise. Finally, the magnetic signal strengths of each gear tooth root are extracted using cycle average and local statistic method. The results of Experiments show that the method is suitable to pick up effective ingredients of signal to extract signal feature and has important application value in potential fault diagnosis of low speed and heavy load gearbox.

Knowledge graphs are structured representations of real world facts. However, they typically contain only a small subset of all possible facts. Link prediction is the task of inferring missing facts based on existing ones. Knowledge graph embedding, representing entities and relations in the knowledge graphs with high-dimensional vectors, has made significant progress in link prediction. The tensor decomposition models are an embedding family with good performance in link prediction. The previous tensor decomposition models do not consider the problem of attribute separation. These models mainly explore particular regularization to improve performance. No matter how sophisticated the design of tensor decomposition models is, the performance is theoretically under the basic tensor decomposition model. Moreover, the unnoticed task of attribute separation in the traditional models is just handed over to the training. However, the amount of parameters for this task is tremendous, and the model is prone to overfitting. We investigate the design approaching the theoretical performance of tensor decomposition models in this paper. The observation that measuring the rationality of specific triples means comparing the matching degree of the specific attributes associated with the relations is well-known. Therefore, the comparison of actual triples needs first to separate specific attribute dimensions, which is ignored by existing models. Inspired by this observation, we design a novel tensor ecomposition model based on Separating Attribute space for knowledge graph completion (SeAttE). The major novelty of this paper is that SeAttE is the first model among the tensor decomposition family to consider the attribute space separation task. Furthermore, SeAttE transforms the learning of too many parameters for the attribute space separation task into the structure’s design. This operation allows the model to focus on learning the semantic equivalence between relations, causing the performance to approach the theoretical limit. We also prove that RESCAL, DisMult and ComplEx are special cases of SeAttE in this paper. Furthermore, we classify existing tensor decomposition models for subsequent researchers. Experiments on the benchmark datasets show that SeAttE has achieved state-of-the-art among tensor decomposition models.