Ying Liu

Dr. Ying Liu

School of Computer Science and Engineering,, Northeastern University, Shenyang, Liaoning, China
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
20 January 2023 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
CSChuan Sheng
Chuan Sheng
YYYu Yao
Yu Yao
WLWenxuan Li
Wenxuan Li
WYWei Yang
Wei Yang
YLYing Liu
Ying Liu
Attack Traffic Classification (ATC) technique is an essential tool for Industrial Control System (ICS) network security, which can be widely used in active defense, situational awareness, attack source traceback and so on. At present, the state-of-the-art ATC methods are usually based on traffic statistical features and machine learning techniques, including supervised classification methods and unsupervised clustering methods. However, it is difficult for these methods to overcome the problems of lack of attack samples and high real-time requirement in ATC in Supervisory Control and Data Acquisition (SCADA) networks. In order to address the above problems, we propose a self-growing ATC model based on a new density-based heuristic clustering method, which can continuously and automatically detect and distinguish different kinds of unknown attack traffic generated by various attack tools against SCADA networks in real time. An effective representation method of SCADA network traffic is proposed to further improve the performance of ATC. In addition, a large number of experiments are conducted on a compound dataset consisting of the SCADA network dataset, the attack tool dataset and the ICS honeypot dataset, to evaluate the proposed method. The experimental results show that the proposed method outperforms existing state-of-the-art ATC methods in the crucial situation of only normal SCADA network traffic.

14 March 2022 in Rare Metals
Verified
Journal Article
Closed access
PDF file
JZJack Jiaqi ZHANG
Jack Jiaqi ZHANG
SCShuang Cao
Shuang Cao
YLYing Liu
Ying Liu
MBMian‐Mian Bao
Mian‐Mian Bao
JRJing Ren
Jing Ren
JWJianjie Wang
Jianjie Wang

8 May 2025 in Mathematics
Verified
Journal Article
Open access
PDF file
YLYing Liu
Ying Liu
XMXinyue Mi
Xinyue Mi
ZLZhaofu Liu
Zhaofu Liu
YYYu Yao
Yu Yao
The purpose of infrared and visible image fusion is to generate a composite image that can contain both the thermal radiation profile information of the infrared image and the texture details of the visible image. This kind of composite image can be used to detect targets under various lighting conditions and offer high scene spatial resolution. However, the existing image fusion algorithms rarely consider light factor in the modeling process. The study presents a novel image fusion approach (AIF) that can adaptively fuse infrared and visible images under various lighting conditions. Specifically, the infrared image and the visible image are extracted by the AdC feature extractor, respectively, and both of them are adaptively fused under the guidance of the illumination perception subnetwork. The image fusion model is trained in an unsupervised manner with a customized loss function. The AdC feature extractor adopts an ascending–descending feature extraction mechanism to organize convolutional layers and combines these convolutional layers with cross-modal interactive differential modules to achieve the effective extraction of hierarchical complementary and differential information. The illumination perception subnetwork obtains the scene lighting condition based on the visible image, which determines the contribution weights of the visible image and the infrared image in the composite image. The customized loss function consists of illumination loss, gradient loss, and intensity loss. It is more targeted and can effectively improve the fusion effect of visible images and infrared images under different lighting conditions. Ablation experiments demonstrate the effectiveness of the loss function. We compare our method with nine other methods on public datasets, including four traditional methods and five deep-learning-based methods. Qualitative and quantitative experiments show that our method performs better in terms of indicators such as SD, and the fused image has more prominent contour information and richer detail information.

1 January 2021 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
YLYing Liu
Ying Liu
JLJunting Liu
Junting Liu
FGFuxiang Gao
Fuxiang Gao
When the transactional memory system detects conflicts, the more read-write addresses are, the higher the false positive rate of this algorithm is. This paper studies the problem and proposes a new signature based optimization algorithm, adaptive increase signature algorithm (AISA). The algorithm can calculate the saturation value of the number of read-write addresses, and dynamically adjust the size of bit string through the calculated saturation value, thus greatly reducing the false positive rate. The experimental results show that AISA can control the false positive rate at a low level on the basis of considering the space cost, and its effect is almost the same as that of 6 times of space, which will improve the performance of transactional memory system greatly.

16 January 2026 in Applied Sciences
Verified
Journal Article
Open access
PDF file
YLYing Liu
Ying Liu
ZLZhaofu Liu
Zhaofu Liu
YYYu Yao
Yu Yao
The integration of Mobile Edge Computing and container virtualization technologies provides crucial support for low-latency and highly resilient service deployment in Internet of Vehicles (IoV) applications. However, the high mobility of vehicles poses challenges to service continuity, necessitating dynamic adjustment of service deployment locations through container migration. Existing research predominantly focuses on independent service migration while overlooking the complex interdependencies among multiple subtasks in practical applications. In this paper, we investigate the container migration problem for dependency-aware services in IoV environments. We first formulate the problem as a dual-objective optimization problem centered on minimizing both the average service delay and system load imbalance. To address the complex dependencies among containers and the highly dynamic nature of IoV environments, we propose an intelligent migration algorithm named GADM that integrates Graph Attention Networks with Deep Reinforcement Learning. The GADM algorithm leverages Graph Attention Networks to capture critical paths in task dependencies, and combines this with an actor–critic-based Deep Reinforcement Learning framework to achieve adaptive decision-making in dynamic environments. Validation using real-world vehicle trajectory datasets and Alibaba cluster trace datasets demonstrates the effectiveness of the proposed algorithm. Experimental results indicate that compared to other methods, GADM significantly improves system load balancing while reducing average service latency.

11 August 2026 in Applied Sciences
Verified
Journal Article
Open access
PDF file
YLYing Liu
Ying Liu
ZQZeguan Qiao
Zeguan Qiao
Author verification is a fundamental task in natural language processing with potential applications in digital forensics, copyright dispute resolution, and social media account linkage. While existing deep pre-trained models achieve high accuracy, they incur substantial computational costs, high inference latency, and poor interpretability, limiting their deployment in resource-constrained environments. To address this gap, a lightweight and interpretable author verification method is proposed that relies solely on hand-crafted stylistic features and classical machine learning classifiers, requiring no GPU acceleration. Specifically, three complementary feature sets are extracted per text: 37 punctuation features, 22 text-style features, and an 800-dimensional character-level TF-IDF vector. For each text pair, we compute the absolute difference and element-wise product for each feature group separately, and we also concatenate all resulting vectors to form the final classification representation. On a public review dataset under a strict author-level split, the proposed method achieves competitive verification performance with significantly improved training and inference efficiency. Notably, while the lightweight neural architectures evaluated in this study yield marginal accuracy gains, they incur substantially longer inference and training times, validating the efficiency-performance trade-off of our approach. Ablation studies confirm the contribution of each feature group, with text statistics being the most influential. The proposed method offers an efficient, transparent, and easily deployable solution for author verification in resource-limited settings and provides empirical evidence for integrating traditional stylistic features with lightweight models.