Shuqun Yang

Shuqun Yang


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
5 July 2021 in Sensors
Verified
Journal Article
Open access
PDF file
XZXin Zeng
Xin Zeng
XZXiaomei Zhang
Xiaomei Zhang
SYShuqun Yang
Shuqun Yang
ZSZhicai Shi
Zhicai Shi
CCChi-Hung Chi
Chi-Hung Chi
Implicit authentication mechanisms are expected to prevent security and privacy threats for mobile devices using behavior modeling. However, recently, researchers have demonstrated that the performance of behavioral biometrics is insufficiently accurate. Furthermore, the unique characteristics of mobile devices, such as limited storage and energy, make it subject to constrained capacity of data collection and processing. In this paper, we propose an implicit authentication architecture based on edge computing, coined Edge computing-based mobile Device Implicit Authentication (EDIA), which exploits edge-based gait biometric identification using a deep learning model to authenticate users. The gait data captured by a device’s accelerometer and gyroscope sensors is utilized as the input of our optimized model, which consists of a CNN and a LSTM in tandem. Especially, we deal with extracting the features of gait signal in a two-dimensional domain through converting the original signal into an image, and then input it into our network. In addition, to reduce computation overhead of mobile devices, the model for implicit authentication is generated on the cloud server, and the user authentication process also takes place on the edge devices. We evaluate the performance of EDIA under different scenarios where the results show that i) we achieve a true positive rate of 97.77% and also a 2% false positive rate; and ii) EDIA still reaches high accuracy with limited dataset size.

8 May 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
JZJia Zhang
Jia Zhang
SYShuqun Yang
Shuqun Yang
Model-based systems engineering (MBSE) is a modeling approach used in industry to support the formalization, analysis, design, checking and verification of systems. In MBSE modeling, domain knowledge is the basis of the modeling. However, modeling does not happen overnight; it requires systematic training and a significant investment of resources. Unfortunately, many domain experts lack the expertise required for modeling, even though they know the domain well. The question arises about how to provide system modelers with domain knowledge at the right time to support the efficient completion of modeling. Since MBSE research that integrates AI is just beginning to take off, no public dataset is available. In this paper, aerospace SysML models are constructed based on spacecraft-related domain knowledge to form SysML model data. The validation rules are studied to validate the SysML model data, and combined with the concept of the recommended system, a recommendation method for the MBSE modeling process based on the knowledge and SysML model is proposed. A GLOVE language model is pre-trained by using domain knowledge and general knowledge; the model data are also used to fine-tune the GLOVE language model combined with the pre-training to recommend some domain development processes. The recommendation list is manually quality-verified and fed into the pre-training phase, while new requirement texts are continuously added in the fine-tuning phase, resulting in a more relevant and accurate recommendation list. Experiments show that the incremental recommender system can not only effectively recommend SysML models, but also improve the quality and efficiency of MBSE development.

8 December 2021 in Symmetry
Verified
Journal Article
Open access
PDF file
NLNing Lan
Ning Lan
SYShuqun Yang
Shuqun Yang
LYLing Yin
Ling Yin
YGYongbin Gao
Yongbin Gao
The application of knowledge graphs has been restricted in some domains, especially the industrial and academic domains. One of the reasons is that they require a high reliability of knowledge, which cannot be satisfied by the existing knowledge graph research. By comparison, traditional knowledge engineering has a high correctness, but low efficiency is an inevitable drawback. Therefore, it is meaningful to organically connect traditional knowledge engineering and knowledge graphs. Therefore, we propose a theory from Attribute Implications to Knowledge Graphs, named AIs-KG, which can construct knowledge graphs based on implications. The theory connects formal concept analysis and knowledge graphs. We firstly analyze the mutual transformation based on the ideas of symmetry with a strict proof among the attribute implication, the formal context and the concept lattice, which forms the closed cycle between the three. Particularly, we propose an Augment algorithm (IFC-A) to generate the Implication Formal Context through the attribute implication, which can make knowledge more complete. Furthermore, we regard ontology as a bridge to realize the transformation from the concept lattice to the knowledge graph through some mapping methods. We conduct our experiments on the attribute implication from the rule base of an animal recognition expert system to prove the feasibility of our algorithms.

2 June 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
WYWang Yong
Wang Yong
SYShuqun Yang
Shuqun Yang
Graph neural networks (GNNs) are crucial tools for processing non-Euclidean data. However, due to scalability issues caused by the dependency and topology of graph data, deploying GNNs in practical applications is challenging. Some methods aim to address this issue by transferring GNN knowledge to MLPs through knowledge distillation. However, distilled MLPs cannot directly capture graph structure information and rely only on node features, resulting in poor performance and sensitivity to noise. To solve this problem, we propose a lightweight optimization method for GNNs that combines graph contrastive learning and variable-temperature knowledge distillation. First, we use graph contrastive learning to capture graph structural representations, enriching the input information for the MLP. Then, we transfer GNN knowledge to the MLP using variable temperature knowledge distillation. Additionally, we enhance both node content and structural features before inputting them into the MLP, thus improving its performance and stability. Extensive experiments on seven datasets show that the proposed KDGCL model outperforms baseline models in both transductive and inductive settings; in particular, the KDGCL model achieves an average improvement of 1.63% in transductive settings and 0.8% in inductive settings when compared to baseline models. Furthermore, KDGCL maintains parameter efficiency and inference speed, making it competitive in terms of performance.

25 September 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
天吴天翔 吴
天翔 吴
SYShuqun Yang
Shuqun Yang
Multi-label text classification (MLTC) aims to assign appropriate labels to each document from a given set. Prior research has acknowledged the significance of label information, but its utilization remains insufficient. Existing approaches often focus on either label correlation or label textual semantics, without fully leveraging the information contained within labels. In this paper, we propose a multi-perspective contrastive model (MPCM) with an attention mechanism to integrate labels and documents, utilizing contrastive methods to enhance label information from both textual semantic and correlation perspectives. Additionally, we introduce techniques for contrastive global representation learning and positive label representation alignment to improve the model’s perception of accurate labels. The experimental results demonstrate that our algorithm achieves superior performance compared to existing methods when evaluated on the AAPD and RCV1-V2 datasets.

10 August 2022 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
YWYini Wang
Yini Wang
YGYongbin Gao
Yongbin Gao
WYWenjun Yu
Wenjun Yu
ZXZhenghao Xi
Zhenghao Xi
WWWeibing Wan
Weibing Wan
BHBo Huang
Bo Huang