Lixing Tan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Lixing Tan has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Jinjin Zhang
Department of Computer Science, Nanjing Audit University, Nanjing 211815, China
5 shared publications - Zhenyu Song
School of Artificial Intelligence, Taizhou University, Taizhou 225300, China
5 shared publications - Zhaohui Zhu
Nanjing Univ Aeronaut & Astronaut, Coll Comp Sci & Technol, Nanjing 211106, Peoples R China
4 shared publications - Cheng Tang
Kyushu University
3 shared publications - Zenan Lu
School of Artificial Intelligence, Taizhou University, Taizhou 225300, China
3 shared publications - Chengfei Cai
Taizhou University
2 shared publications
Latest Publications
- Open Access
- 24 September 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (19) , 3478
Fairness-Aware Opinion Seeding in Undirected Signed Friedkin–Johnsen Networks
Opinion-maximization methods often optimize an aggregate network response and may therefore distribute target-aligned intervention gains unevenly across groups. This issue is especially important in signed networks, where cooperative and antagonistic relations can make the same positive opinion seed increase the equilibrium opinion of one group while decreasing that of another. We study fairness-aware internal-opinion seeding in undirected signed Friedkin–Johnsen networks with heterogeneous anchoring strengths. The objective combines the whole-network average opinion gain with the minimum group-average gain through a tunable fairness parameter. We show that the equilibrium response of any seed set decomposes additively into candidate-wise group-gain vectors. This representation yields an equivalent mixed-integer linear program for exact optimization on tractable instances and an adjoint formulation that evaluates all candidate gains using only one shifted signed-Laplacian solve per group. Because the global averaging vector is a size-weighted combination of the group averaging vectors, no additional global solve is required. We further introduce a dynamically maintained Pareto frontier based on componentwise dominance and establish conditions under which pruning preserves the underlying greedy sequence. Theoretical results establish well-posedness and stability of the signed equilibrium, correctness of the gain and adjoint formulations, sufficient conditions for monotonicity, non-submodularity in general, residual-based numerical error bounds, and computational complexity. Experiments on 14 signed networks ranging from hundreds to more than four million nodes show that the adjoint implementation scales most robustly among the tested methods. The results further demonstrate that the fairness parameter and heterogeneous anchoring strengths can substantially affect both the selected seed sets and the fairness–efficiency balance. Against structural, random, and target-aware Top-K baselines, the proposed greedy method remains broadly competitive, and on small full-candidate instances it matches the solver-certified mixed-integer linear program (MILP) optimum in five of six tested configurations. Overall, the framework provides a scalable approach to group-aware opinion intervention in signed networks while explicitly distinguishing opinion seeding from clamped leader selection.
- 24 September 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (19) , 3478
Open AccessFairness-Aware Opinion Seeding in Undirected Signed Friedkin–Johnsen Networks
Opinion-maximization methods often optimize an aggregate network response and may therefore distribute target-aligned intervention gains unevenly across groups. This issue is especially important in signed networks, where cooperative and antagonistic relations can make the same positive opinion seed increase the equilibrium opinion of one group while decreasing that of another. We study fairness-aware internal-opinion seeding in undirected signed Friedkin–Johnsen networks with heterogeneous anchoring strengths. The objective combines the whole-network average opinion gain with the minimum group-average gain through a tunable fairness parameter. We show that the equilibrium response of any seed set decomposes additively into candidate-wise group-gain vectors. This representation yields an equivalent mixed-integer linear program for exact optimization on tractable instances and an adjoint formulation that evaluates all candidate gains using only one shifted signed-Laplacian solve per group. Because the global averaging vector is a size-weighted combination of the group averaging vectors, no additional global solve is required. We further introduce a dynamically maintained Pareto frontier based on componentwise dominance and establish conditions under which pruning preserves the underlying greedy sequence. Theoretical results establish well-posedness and stability of the signed equilibrium, correctness of the gain and adjoint formulations, sufficient conditions for monotonicity, non-submodularity in general, residual-based numerical error bounds, and computational complexity. Experiments on 14 signed networks ranging from hundreds to more than four million nodes show that the adjoint implementation scales most robustly among the tested methods. The results further demonstrate that the fairness parameter and heterogeneous anchoring strengths can substantially affect both the selected seed sets and the fairness–efficiency balance. Against structural, random, and target-aware Top-K baselines, the proposed greedy method remains broadly competitive, and on small full-candidate instances it matches the solver-certified mixed-integer linear program (MILP) optimum in five of six tested configurations. Overall, the framework provides a scalable approach to group-aware opinion intervention in signed networks while explicitly distinguishing opinion seeding from clamped leader selection.
- 27 August 2026
- Published by Elsevier in Ad Hoc Networks
- Vol. 194
A group-selling auction for deadline-constrained computation collaborative offloading in multi-UAV edge networks
- 27 August 2026
- Published by Elsevier in Ad Hoc Networks
- Vol. 194
A group-selling auction for deadline-constrained computation collaborative offloading in multi-UAV edge networks
- Open Access
- 24 July 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (15) , 2675
A Multi-Head Attention-Enhanced Fusion Model for Cross-Domain Short-Term Time Series Forecasting
With the rapid advancement of artificial intelligence technologies in the era of big data, time series forecasting has become indispensable in critical fields such as environmental monitoring and financial market analysis. However, the existing forecasting models often encounter performance limitations when extracting high-dimensional features and generally cannot dynamically focus on critical information within long-term sequences. To address these challenges, this study proposes a multi-head attention fusion model (MAFM) designed to enhance the predictive accuracy and modelling capability for high-dimensional and nonlinear data across diverse application scenarios. Experiments were conducted on two heterogeneous datasets from the environmental and financial domains. After the key hyperparameters of the MAFM were optimized through an orthogonal experimental design, the model achieved coefficients of determination exceeding 0.90 on both datasets. Furthermore, the results of four comparative experiments demonstrate that the MAFM consistently outperforms traditional machine learning models, including support vector regression and extreme gradient boosting, as well as state-of-the-art deep learning models such as long short-term memory, temporal convolutional networks, and transformers. Compared with the best-performing baseline model on each sub-dataset, the MAFM reduced the mean squared error by 44.4%, 8.3%, 29.4%, and 65.5%, respectively, highlighting its superior predictive performance and strong generalization capability. In summary, the proposed MAFM provides an efficient, robust, and interpretable solution for time series forecasting tasks across multiple domains. Its outstanding performance demonstrates significant potential for practical applications in environmental monitoring, financial forecasting, and other real-world scenarios.
- 24 July 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (15) , 2675
Open AccessA Multi-Head Attention-Enhanced Fusion Model for Cross-Domain Short-Term Time Series Forecasting
With the rapid advancement of artificial intelligence technologies in the era of big data, time series forecasting has become indispensable in critical fields such as environmental monitoring and financial market analysis. However, the existing forecasting models often encounter performance limitations when extracting high-dimensional features and generally cannot dynamically focus on critical information within long-term sequences. To address these challenges, this study proposes a multi-head attention fusion model (MAFM) designed to enhance the predictive accuracy and modelling capability for high-dimensional and nonlinear data across diverse application scenarios. Experiments were conducted on two heterogeneous datasets from the environmental and financial domains. After the key hyperparameters of the MAFM were optimized through an orthogonal experimental design, the model achieved coefficients of determination exceeding 0.90 on both datasets. Furthermore, the results of four comparative experiments demonstrate that the MAFM consistently outperforms traditional machine learning models, including support vector regression and extreme gradient boosting, as well as state-of-the-art deep learning models such as long short-term memory, temporal convolutional networks, and transformers. Compared with the best-performing baseline model on each sub-dataset, the MAFM reduced the mean squared error by 44.4%, 8.3%, 29.4%, and 65.5%, respectively, highlighting its superior predictive performance and strong generalization capability. In summary, the proposed MAFM provides an efficient, robust, and interpretable solution for time series forecasting tasks across multiple domains. Its outstanding performance demonstrates significant potential for practical applications in environmental monitoring, financial forecasting, and other real-world scenarios.
- 19 March 2026
- Published by Elsevier in Applied Soft Computing
- Vol. 196
Short-term traffic flow prediction with a dendritic neural network-enhanced time series decomposition framework
- 19 March 2026
- Published by Elsevier in Applied Soft Computing
- Vol. 196
Short-term traffic flow prediction with a dendritic neural network-enhanced time series decomposition framework
- 19 February 2026
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 170
Evaluating a novel incremental-input neural network for multivariate air temperature forecasting
- 19 February 2026
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 170
Evaluating a novel incremental-input neural network for multivariate air temperature forecasting
- 8 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (9) , 13795-13808
MKF-ADS: Multi-Knowledge Fusion Based Anomaly Detection System in Vehicular Control Area Networks
As the standard communication protocol for vehicular networks, the Controller Area Network (CAN) plays a crucial role in coordinating interactions among Electronic Control Units (ECUs). However, intruders can launch malicious attacks on the CAN due to the lack of security mechanisms. Intrusion Detection Systems (IDSs), as a defense component, are deployed to monitor the CAN and detect suspicious behavior resulting from an attack. Existing IDSs have high false alarms in complex attacks due to limited feature modeling capabilities. In this paper, we propose a multi-knowledge fusion-based anomaly detection system, called MKF-ADS. Specifically, the method designs a prediction-based framework that integrates a spatial-temporal correlation module with an attention mechanism (STcAM) and a patch-based sparse transformer (PatchST) module. The fine-pruned STcAM applies one-dimensional convolution (Conv1D) to extract spatial features and subsequently employs the Bidirectional Long Short Term Memory (Bi-LSTM) to capture temporal features, with an attention mechanism that focuses on important time steps. Meanwhile, the PatchST captures contextual features from independent univariate time series. Finally, the proposed model uses STcAM as a student model to learn intrinsic knowledge and cross-imitate PatchST's competencies through knowledge distillation. Extensive evaluations demonstrate that MKF-ADS is lightweight and effectively performs anomaly prediction and detection across six attack scenarios. Compared to the baseline, the proposed method is more robust, achieving a high F1-score while maintaining controllable false alarms.
- 8 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (9) , 13795-13808
MKF-ADS: Multi-Knowledge Fusion Based Anomaly Detection System in Vehicular Control Area Networks
As the standard communication protocol for vehicular networks, the Controller Area Network (CAN) plays a crucial role in coordinating interactions among Electronic Control Units (ECUs). However, intruders can launch malicious attacks on the CAN due to the lack of security mechanisms. Intrusion Detection Systems (IDSs), as a defense component, are deployed to monitor the CAN and detect suspicious behavior resulting from an attack. Existing IDSs have high false alarms in complex attacks due to limited feature modeling capabilities. In this paper, we propose a multi-knowledge fusion-based anomaly detection system, called MKF-ADS. Specifically, the method designs a prediction-based framework that integrates a spatial-temporal correlation module with an attention mechanism (STcAM) and a patch-based sparse transformer (PatchST) module. The fine-pruned STcAM applies one-dimensional convolution (Conv1D) to extract spatial features and subsequently employs the Bidirectional Long Short Term Memory (Bi-LSTM) to capture temporal features, with an attention mechanism that focuses on important time steps. Meanwhile, the PatchST captures contextual features from independent univariate time series. Finally, the proposed model uses STcAM as a student model to learn intrinsic knowledge and cross-imitate PatchST's competencies through knowledge distillation. Extensive evaluations demonstrate that MKF-ADS is lightweight and effectively performs anomaly prediction and detection across six attack scenarios. Compared to the baseline, the proposed method is more robust, achieving a high F1-score while maintaining controllable false alarms.
- Open Access
- 27 March 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (7) , 1105
Fuzzy Epistemic Logic: Fuzzy Logic of Doxastic Attitudes
In traditional epistemic logic—particularly modal logic—agents are often assumed to have complete and certain knowledge, which is unrealistic in real-world scenarios where uncertainty, imprecision, and the incompleteness of information are common. This study proposes an extension of the logic of doxastic attitudes to a fuzzy setting, representing beliefs or knowledge as continuous values in the interval [0, 1] rather than binary Boolean values. This approach offers a more nuanced and realistic modeling of belief states, capturing the inherent uncertainty and vagueness in human reasoning. We introduce a set of axioms for the fuzzy logic of doxastic attitudes, formalizing how agents reason with regard to uncertain beliefs. The theoretical foundations of this logic are established through proofs of soundness and completeness. To demonstrate practical utility, we present a concrete example, illustrating how the fuzzy logic of doxastic attitudes can model uncertain preferences and beliefs.
- 27 March 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (7) , 1105
Open AccessFuzzy Epistemic Logic: Fuzzy Logic of Doxastic Attitudes
In traditional epistemic logic—particularly modal logic—agents are often assumed to have complete and certain knowledge, which is unrealistic in real-world scenarios where uncertainty, imprecision, and the incompleteness of information are common. This study proposes an extension of the logic of doxastic attitudes to a fuzzy setting, representing beliefs or knowledge as continuous values in the interval [0, 1] rather than binary Boolean values. This approach offers a more nuanced and realistic modeling of belief states, capturing the inherent uncertainty and vagueness in human reasoning. We introduce a set of axioms for the fuzzy logic of doxastic attitudes, formalizing how agents reason with regard to uncertain beliefs. The theoretical foundations of this logic are established through proofs of soundness and completeness. To demonstrate practical utility, we present a concrete example, illustrating how the fuzzy logic of doxastic attitudes can model uncertain preferences and beliefs.
- 30 September 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Software Engineering and Knowledge Engineering
- Vol. 34 (11) , 1783-1805
A Formal Language for Performance Evaluation Based on Reinforcement Learning
Temporal Logics are a rich variety of logical systems designed for specifying properties over time, and about events and changes in the world over time. Traditional temporal logic, however, is limited to binary outcomes true or false and lacks the capacity to specify performance properties of a system such as the maximum, minimum, or average costs between states. Current languages do not accommodate the quantification of such performance properties, especially in scenarios involving infinite execution paths where performance property like cumulative sums may fail to converge. To this end, this paper introduces a novel formal language aimed at assessing system performance, which encapsulates not only temporal dynamics but also various performance-related properties. In this study, this paper utilizes reinforcement learning techniques to compute the values of performance property formulas. Finally, in the experimental part, a formal language representation of system performance properties was implemented, and the values of the performance property formulas were computed using reinforcement learning. The effectiveness and feasibility of the proposed method were validated.
- 30 September 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Software Engineering and Knowledge Engineering
- Vol. 34 (11) , 1783-1805
A Formal Language for Performance Evaluation Based on Reinforcement Learning
Temporal Logics are a rich variety of logical systems designed for specifying properties over time, and about events and changes in the world over time. Traditional temporal logic, however, is limited to binary outcomes true or false and lacks the capacity to specify performance properties of a system such as the maximum, minimum, or average costs between states. Current languages do not accommodate the quantification of such performance properties, especially in scenarios involving infinite execution paths where performance property like cumulative sums may fail to converge. To this end, this paper introduces a novel formal language aimed at assessing system performance, which encapsulates not only temporal dynamics but also various performance-related properties. In this study, this paper utilizes reinforcement learning techniques to compute the values of performance property formulas. Finally, in the experimental part, a formal language representation of system performance properties was implemented, and the values of the performance property formulas were computed using reinforcement learning. The effectiveness and feasibility of the proposed method were validated.
- 31 May 2024
- Published by Elsevier in Information Processing Letters
- Vol. 187
Reduced meet over labelling-based semantics in abstract argumentation
- 31 May 2024
- Published by Elsevier in Information Processing Letters
- Vol. 187
Reduced meet over labelling-based semantics in abstract argumentation