Junying Cui

Ms. Junying Cui


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
5 March 2024 in IEEE Access
Verified
Journal Article
Open access
XHXiaoLi Huang
XiaoLi Huang
HXHaifeng Xu
Haifeng Xu
JCJunying Cui
Junying Cui
To enhance the precision of rolling bearing fault detection and lessen the likelihood of safety mishaps, this paper proposes a fault detection method grounded in improved variational mode decomposition. This technique initially employs the Northern Eagle Algorithm to determine the optimal parameter value for variational mode decomposition, subsequently decomposing the signal. This is followed by the utilization of the Spearman correlation coefficient to differentiate between the effective component and the noise-dominant component. Finally, the wavelet packet decomposition is adopted to filter noise and yield the Hilbert envelope spectrum of the de-noised signal to ascertain the bearing’s health status based on the extraction of characteristic fault frequencies and harmonics. The experimental findings illustrate that the enhanced variational mode decomposition technique not only escalates the inner ring signal’s signal-to-noise ratio from -10.844dB to 8.4471dB and the outer ring signal’s ratio from -4.5852dB to 3.0997dB but also reduces the error of outer ring fault detection from 3.14% to 0.37%, and improves the frequency of inner ring fault detection from a feature extraction inability to an error frequency of 0.45%.

20 February 2024 in Physical Review E
Verified
Journal Article
Closed access
PDF file
IBIzat B. Baybusinov
Izat B. Baybusinov
EFEnrico Maria Fenoaltea
Enrico Maria Fenoaltea
JCJunying Cui
Junying Cui
YZYi-Cheng Zhang
Yi-Cheng Zhang
There are two main categories of networks studied in the complexity physics community: Monopartite and bipartite networks. In this paper, we present a general framework that provides insights into the connection between these two classes. When a random bipartite network is projected into a monopartite network, under quite general conditions, the result is a nonrandom monopartite network, the features of which can be studied analytically. Unlike previous studies in the physics literature on complex networks, which rely on sparse-network approximations, we provide a complete analysis, focusing on the degree distribution and the clustering coefficient. Our findings primarily offer a technical contribution, adding to the current body of literature by enhancing the understanding of bipartite networks within the community of physicists. In addition, our model emphasizes the substantial difference between the information that can be extracted from a network measuring its degree distribution, or using higher-order metrics such as the clustering coefficient. We believe that our results are general and have broad real-world implications.

9 August 2025 in Entropy
Verified
Journal Article
Open access
PDF file
XNXu Na
Xu Na
JCJunying Cui
Junying Cui
CSChang Su
Chang Su
Shimin CaiShimin Cai
Shimin Cai
Linyuan LüLinyuan Lü
Linyuan Lü
Research on network robustness has long focused on changes in the structure connectivity of networks under attacks, effectively depicting structural integrity while ignoring the exploration of functional integrity. When the core path of the network is attacked, even if it remains connected, the rapid increase in energy consumption may still trigger systematic risks. Existing studies mainly use random networks and scale-free networks as comparative models, which has become a classic research paradigm. However, real-world networks often exhibit mixed topological features. To address the above issues, this paper introduces the concept of energy from physics into bipartite networks and establishes an evaluation framework for assessing the synergistic effects of structural evolution and attack strategies on network matching robustness. We first introduce a structural parameter u to construct a structural evolution model, where the network’s minimal matching energy distribution evolves from topological heterogeneity to random features. When u approaches 0, edges with the minimal matching energy concentrate on a few candidates, manifesting scale-free network features. When u approaches 1, the uniform distribution of the minimum-matching-energy edges corresponds to random network features. We then design three types of edge attack strategies—minimum-energy (min-E), random-energy (ran-E), and maximum-energy (max-E) attacks—simulating the impacts of critical path destruction, uniform perturbation, and redundancy removal, respectively. In addition, we construct two evaluation indicators, the average matching energy and the matching retention rate. The results show that structural evolution significantly affects network matching robustness in a nonlinear manner. Different attack strategies also exert different influence on matching robustness. Furthermore, the findings reveal the synergistic effects of the two factors on network matching robustness. The synergistic effects of redundancy capacity and network structure on matching robustness are also explored. The research deepens the understanding of network matching robustness and provides a theoretical basis for resource allocation systems to combat network attacks.