Zhibang Yang

Zhibang Yang

Auto-generated profile, based on publicly available information

Zhibang Yang

Hunan Province Key Laboratory of Industrial Internet Technology and Security, Changsha University, Changsha, Hunan, China

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
16 May 2018 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
XZXu Zhou
Xu Zhou
KLKenli Li
Kenli Li
ZYZhibang Yang
Zhibang Yang
GXGuoqing Xiao
Guoqing Xiao
Keqin LiKeqin Li
Keqin Li
Group skyline query is a powerful tool for optimal group analysis. Most of the existing group skyline queries select optimal groups by comparing the dominance relationship between aggregate-based points; such feature creates difficulties for customers to specify an appropriate aggregate function. Besides, many significant groups that have great attractions to users in practice may be overlooked. Conversely, the group skyline (GSky) query is formulated on basis of a general definition of group dominance operator. While the existing GSky query algorithms are effective, there is still room for improvement in terms of progressiveness and efficiency. In this paper, we propose some new lemmas which facilitate direct generation of the GSky query results. Consecutively, we design a layered unit-based (LU) algorithm that applies a layered optimum strategy. Additionally, for the GSky query over the data that are dynamically produced and cannot be indexed, we propose a novel index-independent algorithm, called sorted-based progressive (SP) algorithm. The experimental results demonstrate the effectiveness, efficiency and progressiveness of the proposed algorithms. By comparing with the state-of-the-art algorithm, our algorithm is more scalable and two orders of magnitude faster.

14 December 2021 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
KZKai Zhong
Kai Zhong
ZYZhibang Yang
Zhibang Yang
GXGuoqing Xiao
Guoqing Xiao
XLXingpei Li
Xingpei Li
WYWangdong Yang
Wangdong Yang
KLKenli Li
Kenli Li
The ongoing digitalization enables stable control processes and smooth operations of Industrial Control Systems (ICSs). A direct consequence of the highly interconnected architecture of ICSs is the introduced cyber vulnerability and increasing cyber security threats to ICSs. Numerous researches pay attention to the security problem of ICSs. However, most current studies face two challenges. First, the interaction problem between the cyber layer and the physical layer of ICSs may result in incorrect attack response strategies. Second, ICSs are real-time systems, but existing defense decision algorithms based on game theory or reinforcement learning techniques have high computational complexity, which prevents them from making decisions quickly. In this paper, we design a new multi-attribute based method for quantifying rewards and propose a multi-attribute based Q-learning algorithm to resolve the interaction problem. In addition, to overcome the limitation of slow convergence, we develop an effective parallel Q-learning (PQL) algorithm to quickly find the optimal strategy. The experimental results show the effectiveness of the PQL algorithm. Compared with the Q-learning algorithm (QL) and the deep Q-network (DQN) algorithm, our proposed solution can reduce the average completion time by 12.5 to 37 percent.

6 April 2018 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
XZXu Zhou
Xu Zhou
KLKenli Li
Kenli Li
ZYZhibang Yang
Zhibang Yang
Keqin LiKeqin Li
Keqin Li
Recently, online shopping marketplaces usually implement price promotion strategies to attract customers and increase their purchase intention. Considering the requirements of customers in this practical application scenario, we are concerned about product selection under price promotion. We formulate a constrained optimal product combination (COPC) problem. It aims to identify the skyline product combinations that both meet a customer's willingness to pay and bring the maximum discount rate. The COPC problem is significant to offer powerful decision support for customers under price promotion, which is certified by a customer study. To process the COPC problem effectively, we first propose a two list exact (TLE) algorithm. The COPC problem is proven to be NP-hard, and the TLE algorithm is not scalable because it needs to process an exponential number of product combinations. Additionally, we design a lower bound approximate (LBA) algorithm that has guarantee about the accuracy of the results and an incremental greedy (IG) algorithm that has good performance. The experiment results demonstrate the efficiency and effectiveness of our proposed algorithms.

10 October 2024 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
KZKai Zhong
Kai Zhong
ZYZhibang Yang
Zhibang Yang
SYSiyang Yu
Siyang Yu
KLKenli Li
Kenli Li
Cyber-physical systems (CPSs) are intricate systems integrating both physical and computational components. When these components fail due to malfunction or cyber-attack, potentially leading to significant damage or even collapse of the network topology. Cyber resilience, defined as the capability of a network to restore its function and structure after component failures, is crucial for ensuring that CPSs can sustain their operational capabilities in the face of complex disturbances. Recently, CPS resilience has garnered increasing attention, leading to the development of various resilience recovery methods. However, most existing studies address network and physical layer resilience in isolation, which hampers the ability to implement adaptive resilience recovery decisions across different systems. To overcome these limitations, we propose a multi-layered cascaded resilient recovery framework grounded in deep reinforcement learning. Initially, we synthesize the complex interactions between the information and physical layers in CPS resilience recovery from a global perspective, modeling the interrelations within CPSs. Subsequently, we introduce a hybrid resilient recovery strategy, encompassing both horizontal and vertical resilient recovery. The correlation matrix is used to partition the system into horizontal and vertical resilience slices. The resilient recovery strategy is subsequently modeled as an optimization problem using these slices. Following this, the Deep Recurrent Q-learning (DRQL) algorithm is introduced to implement the resilient recovery strategy in CPSs. While DRQL exhibits strong adaptability, it may lead to the sparse selection of critical samples, thereby hindering the learning process and convergence on essential experiences. To address this issue, we further develop the RR-DRQL algorithm, designed to identify the optimal CPS resilient recovery strategy. The RR-DRQL algorithm is rigorously proven to converge to the optimal solution through extensive theoretical analysis. Comprehensive experiments demonstrate that the RR-DRQL algorithm surpasses existing resilience recovery methods by 3.8%-25% regarding resilient policy recovery performance across realistic scenarios and various simulation platforms.

1 November 2018 in Neurocomputing
Verified
Journal Article
Closed access
ZYZhibang Yang
Zhibang Yang
KLKenli Li
Kenli Li
XZXu Zhou
Xu Zhou
JMJing Mei
Jing Mei
YGYunjun Gao
Yunjun Gao

3 March 2025 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
JMJing Mei
Jing Mei
CZCuibin Zeng
Cuibin Zeng
ZTZhao Tong
Zhao Tong
ZYZhibang Yang
Zhibang Yang
Keqin LiKeqin Li
Keqin Li
Due to the limited computing resources of both mobile devices (MDs) and the mobile edge computing (MEC) server, devising reasonable strategies for MD task offloading, MEC server resource pricing, and resource allocation is crucial. In this paper, a scenario is considered, comprising multiple MDs and a single MEC server. Each MD has a divisible task in each time slot, allowing for partial offloading and the option to discard parts of the task. The MEC server contains multiple computing units with the same computing power, and its computing resources can be dynamically adjusted through dynamic voltage and frequency scaling (DVFS) according to the size of tasks offloaded by MDs. At any given time slice, a Stackelberg game is formulated based on the strategies of the MDs and the strategy of the MEC server. An iterative evolution algorithm is employed to explore the optimal strategies for MDs and the MEC server. Simulation results demonstrate that both parties can reach an equilibrium state through the game, and these experiments confirm that the algorithm effectively enhances system efficiency.