Xinxin Zhang

Dr. Xinxin Zhang

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
14 March 2025 in Algorithms
Verified
Journal Article
Open access
PDF file
JQJunhong Qiu
Junhong Qiu
XZXinxin Zhang
Xinxin Zhang
TWTao Wang
Tao Wang
HHHuiying Hou
Huiying Hou
SWSiyuan Wang
Siyuan Wang
TYTiejun Yang
Tiejun Yang
A Cyber-Physical System (CPS) incorporates communication dynamics and software into phsical processes, providing abstractions, modeling, design, and analytical techniques for the system. Based on spatial temporal graph neural networks (STGNNs), anomaly detection technology has been presented to detect anomaly data in smart grids with good performance. However, since topological changes of power networks in smart grids often already predict the occurrence of anomalies, traditional models based on STGNNs to portray network evolution cannot be directly utilized in smart grids. Our research proposed a smart grid anomaly detection method on the grounds of STGNNs, which used evolution in the information of several attributes that affected the power network to represent the evolution of the power network, subsequently used STGNNs to obtain the time-space dependencies of nodes in several information networks, and used a cross-domain method to help the anomaly detection of the power network through anomaly information of other related networks. Laboratory findings reveal that the abnormal data detection rate of our scheme reaches 90% in the initial stage of data transmission and outperforms other comparative methods, and as time goes by, the detection rate becomes higher and higher.

21 March 2024 in Computing
Verified
Journal Article
Closed access
PDF file
ZXZhenyu Xu
Zhenyu Xu
XZXinxin Zhang
Xinxin Zhang
MCMingzhi Chen
Mingzhi Chen
LXLi Xu
Li Xu

18 October 2022 in Computing
Verified
Journal Article
Closed access
PDF file
XZXinxin Zhang
Xinxin Zhang
MGMin Gao
Min Gao
LXLi Xu
Li Xu
ZZZhaobin Zhou
Zhaobin Zhou

31 December 2021 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
XZXinxin Zhang
Xinxin Zhang
LXLi Xu
Li Xu
ALAihua Li
Aihua Li
As the core infrastructure of cloud computing, a large scale of the data center networks (DCNs), which consist of millions of servers with high capacity, suffer from node failure such that the reliability is deteriorated. Malicious group could inevitably compromise the quality and reliability of data; thus, how to ensure the security routing of data is an urgent practical problem. As models for large-scale DCNs, it is worth mentioning the balanced hypercube, which is well-known for its strong connectivity, regularity, and a smaller diameter. Each of which makes a balanced hypercube a trustworthy model to deal with data traffic and provides a certain degree of fault-tolerance as well. In this paper, we use the balanced hypercube as a model for the data center networks and design a reliable safety level by referring to different safety levels of related subgraph. This subgraph contains the source and destination nodes, and the shortest feasible paths are located so that the reliable transmission is achieved. Then, we get that the length of fault-tolerant safety routing of data center networks based on balanced hypercube is always no greater than the Hamming distance plus two. Experiment shows that our fault-tolerant security routing scheme is more effective in the same reliable network environment of DCNs.

23 October 2025 in Expert Systems with Applications
Verified
Journal Article
Closed access
XZXinxin Zhang
Xinxin Zhang
ZXZhenyu Xu
Zhenyu Xu
XLXuefeng Li
Xuefeng Li

23 December 2022
Verified
Conference Paper
Open access
XZXinxin Zhang
Xinxin Zhang
LXLi Xu
Li Xu
ZXZhenyu Xu
Zhenyu Xu
HSHUNG-MIN SUN
HUNG-MIN SUN
Chia-Wei LeeChia-Wei Lee
Chia-Wei Lee
The most influential nodes are capable of generating maximum influence and widest information spread to their connected nodes in mobile social networks. Hence identifying high influential users plays an important role in monitoring network public opinion. However, influence maximization is an open and challenging issue, and existing works only focus on online social networks but fail to characterize the user social relations and social behavior. In this paper, firstly, we present a novel method based on location and preference relationships to calculate the social influence of users, and the initial nodes are identified by community partition. Secondly, according to the stochastic information spreading process in MSNs, we propose the Fluctuate Particle Swarm Optimization (FPSO)-algorithm to solve the problem of changing communication relationship between users at the optimization stage. Finally, we use extensive experiments on the real datasets to prove the effectiveness of the proposed FPSO-algorithm. The experimental evaluation shows that in the real networks, our proposal achieves better performance than other related methods.