Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Zhikang Jiang"'
Publikováno v:
BMC Microbiology, Vol 24, Iss 1, Pp 1-13 (2024)
Abstract Background Bergeyella porcorum is a newly identified bacterium that has an ambiguous relationship with pneumonia in pigs. However, few studies have adequately characterized this species. Results In this study, we analyzed the morphological,
Externí odkaz:
https://doaj.org/article/af110ce0854b40b4a28feaae283aa4da
Publikováno v:
Heliyon, Vol 10, Iss 12, Pp e33137- (2024)
Benzo (a) pyrene is a highly carcinogenic polycyclic aromatic compound, difficult to be degraded, widely present in the environment. However, there is currently no cost-effective and efficient method for removing benzo (a) pyrene. In this study, a fe
Externí odkaz:
https://doaj.org/article/8cb59d7deff14908b4889dce73083c78
Publikováno v:
Beilstein Journal of Nanotechnology, Vol 13, Iss 1, Pp 788-795 (2022)
The KP15 nanowires with one-dimensional properties has a defect-free surface, high anisotropy, and carrier mobility which is desirable for the development of novel nanodevices. However, the preparation of nanoscale KP15 is still inefficient. In this
Externí odkaz:
https://doaj.org/article/a3c89816c0084d14bd98be0279332942
Publikováno v:
IEEE Access, Vol 9, Pp 97100-97119 (2021)
Computing the Sparse Fast Fourier Transform(sFFT) has emerged as a critical topic for a long time. The sFFT algorithms decrease the runtime and sampling complexity by taking advantage of the signal’s inherent characteristics that a large number of
Externí odkaz:
https://doaj.org/article/be8915e827944d86a2d89dc0b92c08e4
Publikováno v:
IEEE Access, Vol 8, Pp 79134-79146 (2020)
The problem of computing the Sparse Fast Fourier Transform(sFFT) of a K-sparse signal of size N has received significant attention for a long time. The first stage of sFFT is hashing the frequency coefficients into $B(\approx {K})$ buckets named freq
Externí odkaz:
https://doaj.org/article/2be99159cbbb4749affb08b2827ee2a5
Autor:
Qinghe He, Zhikang Jiang, Deguan Li, Nan Tian, Disheng Yao, Guoyuan Zheng, Jilin Wang, Bing Zhou, Fei Long
Publikováno v:
Solar Energy. 238:126-131
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2dd03b8a992e8a46337cf69df4f74f99
https://doi.org/10.1016/j.solener.2022.04.018
https://doi.org/10.1016/j.solener.2022.04.018
Publikováno v:
Circuits, Systems, and Signal Processing. 41:4547-4569
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c6a4cacc69e6ea136b471e282fa31752
https://doi.org/10.1007/s00034-022-01989-6
https://doi.org/10.1007/s00034-022-01989-6
Publikováno v:
Journal of Manufacturing Processes. 75:573-583
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fec55fa950c0e9979426a7383d4335c9
https://doi.org/10.1016/j.jmapro.2022.01.023
https://doi.org/10.1016/j.jmapro.2022.01.023
Publikováno v:
IEEE Access, Vol 8, Pp 79134-79146 (2020)
The problem of computing the Sparse Fast Fourier Transform(sFFT) of a $K$ -sparse signal of size $N$ has received significant attention for a long time. The first stage of sFFT is hashing the frequency coefficients into $B(\approx {K})$ buckets named
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f92532b53dcbbc1b5311eb921fb20367
https://doi.org/10.1109/access.2020.2989327
https://doi.org/10.1109/access.2020.2989327
Publikováno v:
Electronics; Volume 11; Issue 15; Pages: 2291
The research on efficient computation of sparse signals by various Sparse Fast Fourier Transform (sFFT) algorithms has always been a hot topic in the direction of signal processing. The algorithms can decrease the sampling and running complexity by t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a92cb7e62ddd815709ed8fcab19a6560
https://doi.org/10.3390/electronics11152291
https://doi.org/10.3390/electronics11152291