ライフサイエンスコーパス: fast Fourier transform

1 time detection of multiple species using the fast Fourier transform.

2 he ultrasound signals were calculated with a fast Fourier transform.

3 me by a novel application of convolution and Fast Fourier Transforms.

4 s accomplished by correlation analysis using fast Fourier transforms.

5 e t-tubule disorganization, as quantified by fast-Fourier transforms.

6 ive-structural parameters, coupled with a 2D Fast Fourier Transform(2D-FFT) approach that automated t

7 overcome the limiting O(nlogn) complexity of fast Fourier transform algorithms.

8 opy image-based finite element modelling and fast Fourier transform analysis are used to develop a mu

9 Sarcomere length was accurately measured by fast Fourier transform analysis of images before, within

10 lation and reciprocal-space patterns through fast Fourier transform analysis of real-space pattern do

11 Fast Fourier transform analysis of the tremor revealed a

12 Fast Fourier transform analysis was applied to the neuro

13 of mean velocity made by the catheter, using fast Fourier transform analysis, both without and with c

14 s of each bipolar AEG were also subjected to fast Fourier transform analysis.

15 Signal processing analyses using fast Fourier transform and continuous wavelet transforms

16 made using a combination of two-dimensional fast Fourier transform and fractal analysis, which allow

17 Using fast Fourier transform and principal components analysis

18 R-interval power spectra were computed using fast Fourier transforms and log(power) was regressed on

19 rms of convolutions which are calculated via fast Fourier transforms and stored on predefined grids.

20 We performed fast Fourier transform (and autoregressive) power spectr

21 Using a grid-based Fast Fourier Transform approach, a space of exclusively

22 Here, we present a fast Fourier transform-based algorithm that can be used

23 In previous studies, we developed a fast Fourier transform-based method, FMAPB2, to compute

24 Energy evaluation is based on the fast Fourier transform correlation approach, which allow

25 into the docking program PIPER based on the fast Fourier transform correlation approach.

26 ystem of proteins was mapped by the pairwise fast Fourier transform docking and sampled in space and

27 cture-function pipeline using AlphaFold2 and fast Fourier transform docking that is benchmarked with

28 The commonly used Fast Fourier Transform (FFT) algorithm is applicable onl

29 l-optical soliton method for calculating the Fast Fourier Transform (FFT) algorithm is presented.

30 increased the amplitude of the 1-4 Hz band (Fast Fourier Transform (FFT) analysis, p<0.05), which is

31 Using fast Fourier transform (FFT) analysis, we previously obs

32 two Fermi pockets at the Fermi level via the fast Fourier transform (FFT) analysis.

33 a: see text], as opposed to the conventional fast Fourier transform (FFT) based approach with the com

34 es of mixtures and SwiftComp, as well as the Fast Fourier Transform (FFT) based computational homogen

35 We use a Fast Fourier Transform (FFT) based docking method to qui

36 e search is based on the extremely efficient fast Fourier transform (FFT) correlation approach which

37 protein-protein docking server based on the fast Fourier transform (FFT) correlation approach.

38 ny protein docking algorithms begin by using fast Fourier transform (FFT) correlation techniques to f

39 The application of Fast Fourier Transform (FFT) coupled with Atomic Force M

40 harmonic to the fundamental harmonic of the fast Fourier transform (FFT) for these responses.

41 RA was estimated using the Fast Fourier Transform (FFT) method using a custom devel

42 eristics of V(m) were analyzed by short-time fast Fourier transform (FFT) or generalized time-frequen

43 ctors showed no preferential directions, and fast Fourier transform (FFT) power spectra were broad (1

44 A fast Fourier transform (FFT) routine was used to analyze

45 y; the resulting data were preprocessed with Fast Fourier Transform (FFT), followed by CVA treatment.

46 After a fast Fourier transform (FFT), the sound wave generated f

47 approximately the first 40 components of the fast Fourier transform (FFT)-it's possible to achieve an

48 ermined from OP power spectra computed using fast Fourier transform (FFT).

49 ty data to a simple interference model or by fast Fourier transform (FFT).

50 h is followed for the Poisson equation using Fast Fourier Transform (FFT).

51 studies, the field has historically favored fast Fourier transforms (FFT) and iterative techniques d

52 The method uses fast Fourier transforms (FFT) of single entity electroch

53 g triple-reference point normalization and a fast-Fourier transform (FFT)-based pre-processing scheme

54 Energy evaluation using fast Fourier transforms (FFTs) enables sampling billions

55 ate a periodic signal that is processed with fast Fourier transforms (FFTs) to obtain the oscillation

56 Sequential fast Fourier transforms (FFTs) were performed.

57 DynOmics is based on the fast Fourier transform, from which the difference in exp

58 er subtraction of the ventricular component, fast Fourier transform identified the DF at each site.

59 nsform (ICZT), which generalizes the inverse fast Fourier transform (IFFT) off the unit circle in the

60 be viewed as a generalization of the inverse fast Fourier transform (IFFT) off the unit circle in the

61 gies: (i) cross-correlation, implemented via fast Fourier transform; (ii) a match scoring scheme that

62 Fast Fourier transforms indicated that baroreflex sensit

63 curacy over MUSCLE, Multiple Alignment using Fast Fourier Transform (MAFFT), ClustalW and the origina

64 Fourier or fast Fourier transform methods are not used.

65 Full-field Fast-Fourier-Transform micromechanics modeling shows tha

66 ng ventricular pacing, the peak amplitude of fast Fourier transform of dZ/dt (between 1.5 and 4.5 Hz)

67 In cardiac arrest, a peak amplitude of fast Fourier transform of dZ/dt of < or = 4 dB x ohm x r

68 re noncontributory in cardiac arrest, so the fast Fourier transform of dZ/dt was assessed.

69 The square of the peak amplitude of the Fast Fourier Transform of dZ/dt was the best predictor o

70 oduct ions' m/z values) is recovered through fast Fourier transform of each mass spectral peak, revea

71 Fast Fourier transform of optical and bipolar electrode

72 e used a novel algorithm to characterize the fast Fourier transform of the image as a function of spa

73 -to-charge ratios of ions are obtained using fast Fourier transform of the image current detected on

74 or [Formula: see text] if evaluated using a Fast Fourier Transform on a grid of size [Formula: see t

75 tory-frequency (0.20 to 0.30 Hz) ranges with fast Fourier transform power spectra and used cross-spec

76 s from each channel were demodulated using a fast Fourier transform, resolving the contributions from

77 We integrated fast Fourier transform RR-interval spectral power at ver

78 ic acid and transmission electron microscopy/fast Fourier transform, that yeast prion Sup35 oligomers

79 From the fast Fourier transform, the dominant frequency was deter

80 For signal analysis using a fast Fourier transform, the inhomogeneous distribution o

81 r and quadratic terms for dZ/dt(max) and the Fast Fourier Transform to identify significant parameter

82 ins in wavenumber or 'k-space' followed by a fast Fourier transform to yield real-space images with n

83 combined with a six-dimensional search using fast Fourier transforms to rapidly scan the rigid-body d

84 als underwent frequency domain analysis as a fast Fourier transform was performed over a 2-second win

85 electrograms were digitally filtered, and a fast Fourier transform was performed over a sliding 2-s

86 A fast-Fourier transform was performed every 0.5 s on a sl

87 g spectra of images post Gabor filtering and Fast Fourier Transform, we were able to measure subtle c

88 Data from fast-Fourier transforms were then incorporated in the mo

89 e-sensitive dye, ECG, and signal processing (fast Fourier transform) were used for analysis.

90 on a two-dimensional cross correlation using fast Fourier transforms with computer-generated referenc