Shan Liao

Shan Liao

Auto-generated profile, based on publicly available information

Shan Liao

School of Cyber Science and Engineering, Sichuan University, Chengdu, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
17 July 2020 in Sensors
Verified
Journal Article
Open access
PDF file
YCYang Chen
Yang Chen
RZRongfeng Zheng
Rongfeng Zheng
AZAnmin Zhou
Anmin Zhou
SLShan Liao
Shan Liao
LLLiang Liu
Liang Liu
Pornographic and gambling websites become increasingly stubborn via disguising, misleading, blocking, and bypassing, which hinder the construction of a safe and healthy network environment. However, most traditional approaches conduct the detection process through a single aspect of these sites, which would fail to handle the more intricate and challenging situations. To alleviate this problem, this study proposed an automatic detection system for porn and gambling websites based on visual and textual content using a decision mechanism (PG-VTDM). This system can be applied to the intelligent wireless router at home or school to realize the identification, blocking, and warning of ill-suited websites. First, Doc2Vec was employed to learn the textual features that can be used to represent the textual content in the hypertext markup language (HTML) source code of the websites. In addition, the traditional bag-of-visual-words (BoVW) was improved by introducing local spatial relationships of feature points for better representing the visual features of the website screenshot. Then, based on these two types of features, a text classifier and an image classifier were both trained. In the decision mechanism, a data fusion algorithm based on logistic regression (LR) was designed to obtain the final prediction result by measuring the contribution of the two classification results to the final category prediction. The efficiency of this proposed approach was substantiated via comparison experiments using gambling and porn website datasets crawled from the Internet. The proposed approach outperformed the approach based on a single feature and some state-of-the-art approaches, with accuracy, precision, and F-measure all over 99%.

2 February 2021 in Future Internet
Verified
Journal Article
Open access
PDF file
Tianfang SunTianfang Sun
Tianfang Sun
PYPin Yang
Pin Yang
MLMengming Li
Mengming Li
SLShan Liao
Shan Liao
With the progressive deterioration of cyber threats, collecting cyber threat intelligence (CTI) from open-source threat intelligence publishing platforms (OSTIPs) can help information security personnel grasp public opinions with specific pertinence, handle emergency events, and even confront the advanced persistent threats. However, due to the explosive growth of information shared on multi-type OSTIPs, manually collecting the CTI has had low efficiency. Articles published on the OSTIPs are unstructured, leading to an imperative challenge to automatically gather CTI records only through natural language processing (NLP) methods. To remedy these limitations, this paper proposes an automatic approach to generate the CTI records based on multi-type OSTIPs (GCO), combing the NLP method, machine learning method, and cybersecurity threat intelligence knowledge. The experiment results demonstrate that the proposed GCO outperformed some state-of-the-art approaches on article classification and cybersecurity intelligence details (CSIs) extraction, with accuracy, precision, and recall all over 93%; finally, the generated records in the Neo4j-based CTI database can help reveal malicious threat groups.

7 December 2021 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
SLShan Liao
Shan Liao
JLJiayong Liu
Jiayong Liu
YQYimeng Qi
Yimeng Qi
HHHaoen Huang
Haoen Huang
RZRongfeng Zheng
Rongfeng Zheng
XXXiuchun Xiao
Xiuchun Xiao
In this article, the existing approaches, including numerical algorithms as well as neural networks to solve dynamic linear matrix equations, have been presented and reviewed. Specifically, the conventional gradient recurrent neural networks (CGRNNs) and the conventional zeroing neural networks (CZNNs) are successively provided to solve the dynamic problems and linear matrix equations, both of which manifest inherent limitations during the solving procedures. To remedy the drawbacks on convergence time, nonzero residual error, and large computational load of the traditional models, an adaptive gradient recurrent neural network (AGRNN) to solve dynamic linear matrix equations is proposed. This proposed inversion-free model possesses rapid convergence rate and accurate calculated solutions. Moreover, theoretical analyses guarantee the advantages of the AGRNN compared with the CGRNN and the CZNN to solve dynamic linear matrix equations. Finally, three numerical experiments, and applications to a PUMA 560 robot motion planning and a mobile subject localization based on angle-of-arrival technique are implemented to testify the advantages of the AGRNN.

6 June 2024 in Information Sciences
Verified
Journal Article
Closed access
LLLiang Liu
Liang Liu
CTChuhao Tang
Chuhao Tang
LZLei Zhang
Lei Zhang
SLShan Liao
Shan Liao

21 January 2021 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
DFDongyang Fu
Dongyang Fu
HHHaoen Huang
Haoen Huang
LWLin Wei
Lin Wei
XXXiuchun Xiao
Xiuchun Xiao
Long JinLong Jin
Long Jin
ZXZhengtai Xie
Zhengtai Xie
Currently, the Newton–Raphson iterative algorithm has been extensively employed in the fields of basic research and engineering. However, when noise components exist in a system, its performance is largely affected. To remedy shortcomings that the conventional computing methods have encountered in a noisy workspace, a novel modified Newton integration (MNI) algorithm is proposed in this article. In addition, the steady-state error of the proposed MNI algorithm is smaller than that of the Newton–Raphson algorithm under a noise-free or noisy workspace. To lay the foundations for the corresponding theoretical analyses, the proposed MNI algorithm is first converted into a homogeneous linear equation with a residual term. Then, the related theoretical analyses are carried out, which indicate that the MNI algorithm possesses noise-tolerance ability under various noisy environments. Finally, multiple computer simulations and physical experiments on robot control applications are performed to verify the feasibility and advantage of the proposed MNI algorithm.

11 March 2022 in Neural Networks
Verified
Journal Article
Closed access
SLShan Liao
Shan Liao
SLShubin Li
Shubin Li
JLJiayong Liu
Jiayong Liu
HHHaoen Huang
Haoen Huang
XXXiuchun Xiao
Xiuchun Xiao