qiong wang

Dr. qiong wang

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 October 2024 in Biomedical Signal Processing and Control
Verified
Journal Article
Closed access
SZShumei Zhu
Shumei Zhu
WYWanyi Yi
Wanyi Yi
SWShuwang Wang
Shuwang Wang
QWqiong wang
qiong wang
DBDengxuan Bai
Dengxuan Bai
JWJun Wang
Jun Wang

30 June 2023 in Entropy
Verified
Journal Article
Open access
PDF file
QWqiong wang
qiong wang
WYWenpo Yao
Wenpo Yao
DBDengxuan Bai
Dengxuan Bai
WYWanyi Yi
Wanyi Yi
WYWanyi Yan
Wanyi Yan
JWJun Wang
Jun Wang
Network analysis is an important approach to explore complex brain structures under different pathological and physiological conditions. In this paper, we employ the multivariate inhomogeneous polynomial kernel Granger causality (MKGC) to construct directed weighted networks to characterize schizophrenia magnetoencephalography (MEG). We first generate data based on coupled autoregressive processes to test the effectiveness of MKGC in comparison with the bivariate linear Granger causality and bivariate inhomogeneous polynomial kernel Granger causality. The test results suggest that MKGC outperforms the other two methods. Based on these results, we apply MKGC to construct effective connectivity networks of MEG for patients with schizophrenia (SCZs). We measure three network features, i.e., strength, nonequilibrium, and complexity, to characterize schizophrenia MEG. Our results suggest that MEG of the healthy controls (HCs) has a denser effective connectivity network than that of SCZs. The most significant difference in the in-connectivity strength is observed in the right frontal network (p=0.001). The strongest out-connectivity strength for all subjects occurs in the temporal area, with the most significant between-group difference in the left occipital area (p=0.0018). The total connectivity strength of the frontal, temporal, and occipital areas of HCs exhibits higher values compared with SCZs. The nonequilibrium feature over the whole brain of SCZs is significantly higher than that of the HCs (p=0.012); however, the results of Shannon entropy suggest that healthy MEG networks have higher complexity than schizophrenia networks. Overall, MKGC provides a reliable approach to construct MEG brain networks and characterize the network characteristics.

3 February 2024 in Biomedical Signal Processing and Control
Verified
Journal Article
Closed access
QWqiong wang
qiong wang
XYXinran Yang
Xinran Yang
WYWei Yan
Wei Yan
JYJiafeng Yu
Jiafeng Yu
JWJun Wang
Jun Wang

1 January 2024 in International Journal of RF and Microwave Computer-Aided Engineering
Verified
Journal Article
Open access
QWqiong wang
qiong wang
JDJi Ding
Ji Ding
JWJun Wang
Jun Wang
A finite difference delay modeling (FDDM) method accelerated by adaptive cross approximation‐singular value decomposition (ACA‐SVD) is developed to solve time‐domain combined field integral equations for transient electromagnetic scattering. In the proposed method, the variable s in the Laplace domain is expressed as a difference function about z in the z‐transform domain to achieve the temporal discretization, thus improving the stability of the solution. And the method is purely algebraic and does not depend on the Green’s function. It takes advantage of the rank‐deficient nature of the impedance submatrix blocks in the FDDM to reduce the memory requirement and the computational cost. The rank‐deficient submatrix blocks can reach the maximum compression level through the ACA‐SVD. Numerical results about the electromagnetic scattering from perfect electric conducting objects are given to verify the validity and efficiency of the proposed method.

24 September 2024 in Electronics Letters
Verified
Journal Article
Open access
QWqiong wang
qiong wang
JWJun Wang
Jun Wang
In this article, a modified scheme of the fast dipole method (FDM) is proposed based on the Cartesian tensor. To achieve separation between the field and the source, the Taylor series used in the FDM is an incomplete second‐order expansion, which limits computational accuracy and flexibility. To address this issue, a Cartesian tensor is employed to expand the interactions between the far‐group pairs. This approach allows for a complete expansion of any order and offers flexibility in precision control, enabling a balance between computational efficiency and accuracy requirements across different application scenarios. Moreover, the computational accuracy of the proposed method can be improved without a substantial increase in time and memory requirements compared to the FDM. The validity and accuracy of the proposed method are demonstrated with numerical examples.

5 March 2026 in Applied Sciences
Verified
Journal Article
Open access
PDF file
SWShuwang Wang
Shuwang Wang
GLGuofeng Lin
Guofeng Lin
XYXinxin Ye
Xinxin Ye
YHYan Huang
Yan Huang
SZShumei Zhu
Shumei Zhu
JWJun Wang
Jun Wang
Attribute-based encryption (ABE) provides a robust mechanism for fine-grained access control, making it an ideal candidate for secure cloud data sharing. However, existing schemes often incur significant computational overhead, hindering their large-scale deployment, especially on resource-constrained nodes. In this work, we propose a practical ABE scheme that simultaneously simplifies access policy structures and enhances overall efficiency. By introducing a weighted access policy, our scheme achieves rich expressiveness while maintaining a compact logic structure, offering enhanced flexibility through the redefinability of attribute weights. Notably, the proposed construction is pairing-free and yields small-size ciphertexts and private keys compared to traditional tree-based models. Security analysis demonstrates that our scheme is selectively secure against chosen-ciphertext attacks. Extensive simulation results show that encryption and decryption latency is reduced to nearly 10 ms when 20 attributes are involved, which is a typical requirement in cloud data sharing scenarios. This validates the efficiency of our scheme in resource-constrained environments.