相关实验视频

Updated: Jan 9, 2026

Interictal High Frequency Oscillations Detected with Simultaneous Magnetoencephalography and Electroencephalography as Biomarker of Pediatric Epilepsy
10:22

Interictal High Frequency Oscillations Detected with Simultaneous Magnetoencephalography and Electroencephalography as Biomarker of Pediatric Epilepsy

Published on: December 6, 2016

21.0K

一个时间频域诊断网络用于ICE故障检测

Daijie Tang1, Zhiyong Yin1, Demu Wu1

  • 1China Ship Scientific Research Center, Wuxi 214082, China.

Sensors (Basel, Switzerland)
|December 11, 2025
PubMed
概括

一个新的时间频域诊断网络 (TFDN) 通过结合时间和频率数据来增强内燃机 (ICE) 故障检测. 这种深度学习模型以较少的数据实现了高精度,使实时诊断成为可能.

关键词:
在美国,CNN是CNN.这就是ResNet ResNet.状态监控 状态监控 状态监控深度学习是一种深度学习.错误诊断 错误诊断 错误诊断 是一个问题.内部燃烧发动机的内部燃烧发动机.

更多相关视频

Design and Application of a Fault Detection Method Based on Adaptive Filters and Rotational Speed Estimation for an Electro-Hydrostatic Actuator06:45

Design and Application of a Fault Detection Method Based on Adaptive Filters and Rotational Speed Estimation for an Electro-Hydrostatic Actuator

Published on: October 28, 2022

2.1K
Network Analysis of the Default Mode Network Using Functional Connectivity MRI in Temporal Lobe Epilepsy12:09

Network Analysis of the Default Mode Network Using Functional Connectivity MRI in Temporal Lobe Epilepsy

Published on: August 5, 2014

18.5K

相关概念视频

Fault Types01:18

Fault Types

When analyzing a single line-to-ground fault from phase A to ground at a three-phase bus, it is important to consider the fault impedance. This impedance is zero for a bolted fault, equal to the arc impedance for an arcing fault, and represents the total fault impedance for a transmission-line insulator flashover. To derive sequence and phase currents, fault conditions are translated from the phase domain to the sequence domain.
For line-to-line faults occurring between phases B and C, the...
388
Discrete Fourier Transform01:15

Discrete Fourier Transform

The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
825
IR Frequency Region: Fingerprint Region01:03

IR Frequency Region: Fingerprint Region

IR spectra are divided into two main regions: the diagnostic region and the fingerprint region. The diagnostic region of the spectrum lies above 1500 cm−1. The absorptions resulting from single-bond vibrations of the N–H, C–H, and O–H stretch at higher wavenumbers and appear on the left side of the spectrum. The stretching absorptions of the C≡C and C≡N occur between 2100–2300 cm−1. In contrast, those arising from stretching absorptions of the...
1.8K
Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
632
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
992
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
851