Xiaoming Jiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xiaoming Jiang has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Aiting Yao
Pengcheng Laboratory, Shenzhen, China
1 shared publication - Chengzu Dong
School of Information Technology, Deakin University, Geelong, VIC 3216, Australia
1 shared publication - Junjun Mao
School of Big Data and Statistics, Anhui University, Hefei 230601, China
1 shared publication - Ou Liu
Wenzhou Institute, University of Chinese Academy of Sciences, Wenzhou 325001, China
1 shared publication - Shiyu Liu
School of Economics and Management, Beihang University, Beijing 100191, China
1 shared publication - Weiqi Zhang
Deakin University
1 shared publication
Latest Publications
- Open Access
- 3 July 2024
- Published by MDPI AG in Preprints.org
Enhancing Cyber Defense Strategies with Discrete Multidimensional Z-Numbers: A Multi-Attribute Decision-Making Approach
With the rapid development of intelligent logistics and network environment, it has become an urgent problem to efficiently and accurately handle and analyse the huge amount of uncertain decision information. Traditional decision making methods often fail to make the best use of complex and incomplete information, especially in the field of cyber defence. To address these problems, this paper introduces a new mathematical tool, discrete multidimensional Z-numbers (MZs), for expressing and dealing with uncertainty and reliability in network defence decisions. In this paper, we first introduce the synthesis method of discrete multidimensional Z-numbers, which allows us to consider the uncertainty and reliability of multi-source information in network defence strategy. Then, the hidden probability of MZs is calculated by using the hidden probability model, and the multidimensional Z+−number is proposed, which improves the expressiveness of the model in dealing with information uncertainty. Based on MZs, we define a variety of utility functions and build a multi-attribute group decision framework for network defence around these functions. The MZs provides a novel perspective for analysing and designing response strategies, especially against highly adaptive and covert attacks. The method in this paper is verified by a case of network security assessment of an intelligent logistics company. The results show that this method can significantly improve the accuracy and efficiency of decision making, demonstrating its unique advantages and wide application potential in network defence. This integrated discrete multidimensional Z-number group decision method is not only suitable for intelligent logistics decision making, but also provides an efficient decision support tool for network defence, which helps to improve the intelligence and adaptability of network security defence.
- 3 July 2024
- Published by MDPI AG in Preprints.org
Open AccessEnhancing Cyber Defense Strategies with Discrete Multidimensional Z-Numbers: A Multi-Attribute Decision-Making Approach
With the rapid development of intelligent logistics and network environment, it has become an urgent problem to efficiently and accurately handle and analyse the huge amount of uncertain decision information. Traditional decision making methods often fail to make the best use of complex and incomplete information, especially in the field of cyber defence. To address these problems, this paper introduces a new mathematical tool, discrete multidimensional Z-numbers (MZs), for expressing and dealing with uncertainty and reliability in network defence decisions. In this paper, we first introduce the synthesis method of discrete multidimensional Z-numbers, which allows us to consider the uncertainty and reliability of multi-source information in network defence strategy. Then, the hidden probability of MZs is calculated by using the hidden probability model, and the multidimensional Z+−number is proposed, which improves the expressiveness of the model in dealing with information uncertainty. Based on MZs, we define a variety of utility functions and build a multi-attribute group decision framework for network defence around these functions. The MZs provides a novel perspective for analysing and designing response strategies, especially against highly adaptive and covert attacks. The method in this paper is verified by a case of network security assessment of an intelligent logistics company. The results show that this method can significantly improve the accuracy and efficiency of decision making, demonstrating its unique advantages and wide application potential in network defence. This integrated discrete multidimensional Z-number group decision method is not only suitable for intelligent logistics decision making, but also provides an efficient decision support tool for network defence, which helps to improve the intelligence and adaptability of network security defence.
- Open Access
- 16 February 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (4) , 1012
An Efficient Algorithm for the Joint Replenishment Problem with Quantity Discounts, Minimum Order Quantity and Transport Capacity Constraints
The joint replenishment problem has been extensively studied and the joint replenishment strategy has been adopted by a large variety of retailers in recent years. However, the joint replenishment problem under minimum order quantity and other constraints does not receive sufficient attention. This paper analyzes a retailing supply chain involving a supplier that provides quantity discount schedules and limits the order quantity. The order quantity constraints include minimum order requirements for each item and as to the total quantity; additionally, the latter cannot exceed the transport capacity constraint. These are common constraints in the retail industry today and create greater complexity and difficulty in the retailer’s decision-making. To analyze the problem, an integer nonlinear programming model is set up to maximize retailers’ profit with all practical constraints. A two-layer efficient algorithm named the Marginal and Cumulative Profit-Based Algorithm (MCPB) is then proposed to find whether to order and the optimal order quantity for each item. The results of computational experiments show that the proposed algorithm can find near-optimal solutions to the problem efficiently and is a reference for retailers to solve practical joint replenishment problems.
- 16 February 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (4) , 1012
Open AccessAn Efficient Algorithm for the Joint Replenishment Problem with Quantity Discounts, Minimum Order Quantity and Transport Capacity Constraints
The joint replenishment problem has been extensively studied and the joint replenishment strategy has been adopted by a large variety of retailers in recent years. However, the joint replenishment problem under minimum order quantity and other constraints does not receive sufficient attention. This paper analyzes a retailing supply chain involving a supplier that provides quantity discount schedules and limits the order quantity. The order quantity constraints include minimum order requirements for each item and as to the total quantity; additionally, the latter cannot exceed the transport capacity constraint. These are common constraints in the retail industry today and create greater complexity and difficulty in the retailer’s decision-making. To analyze the problem, an integer nonlinear programming model is set up to maximize retailers’ profit with all practical constraints. A two-layer efficient algorithm named the Marginal and Cumulative Profit-Based Algorithm (MCPB) is then proposed to find whether to order and the optimal order quantity for each item. The results of computational experiments show that the proposed algorithm can find near-optimal solutions to the problem efficiently and is a reference for retailers to solve practical joint replenishment problems.