Yong Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yong Zhao has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Xingwei Wang
Northeastern University
5 shared publications - Qiang He
Northeastern University
4 shared publications - Min Huang
Northeastern University
3 shared publications Bo Yi
College of Computer Science and Engineering, Northeastern University, Shenyang, China
2 shared publications- Lianbo Ma
Northeastern University, Shenyang, China
2 shared publications Min Huang
State Key Laboratory of Synthetical Automation for Process Industries, College of Information Science and Engineering, Northeastern University, Shenyang, China
2 shared publications
Latest Publications
- 6 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 12 (6) , 4757-4769
Efficient Rumor Suppression With Dynamic Blocking Strategy in Social Networks
With the continuous development of Internet technology, social networks have provided convenient conditions for information dissemination. The rapid dissemination of information has provided us with great convenience, but some criminals extensively spread rumors based on such convenience, adversely affecting social stability. In this context, two key challenges arise: the survivability of rumors, which refers to their persistence and long-term impact, and the dynamic viewpoint changes of individuals, which influence how rumors spread and diminish over time. This article proposes a dynamic-susceptible-exposed-infected-recovered (DSEIR) rumor propagation model based on human social behavior to solve the spread of rumors problem. This model considers the characteristics of rumors spread in social networks with the Markov chain and makes the simulation more authentic. To suppress rumor propagation, we introduce the concept of rumor survivability and propose a dynamic truth movement blocking strategy, which adapts to people’s evolving viewpoints to curb the influence of rumors effectively. Finally, we analyze the proposed model and blocking strategy in four real networks. The experimental results show that the proposed propagation model can authentically simulate the propagation of rumors in social networks and the proposed blocking strategy efficiently suppresses the rumor propagation. We have released our code here: https://github.com/gf9264/DSEIR.
- 6 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 12 (6) , 4757-4769
Efficient Rumor Suppression With Dynamic Blocking Strategy in Social Networks
With the continuous development of Internet technology, social networks have provided convenient conditions for information dissemination. The rapid dissemination of information has provided us with great convenience, but some criminals extensively spread rumors based on such convenience, adversely affecting social stability. In this context, two key challenges arise: the survivability of rumors, which refers to their persistence and long-term impact, and the dynamic viewpoint changes of individuals, which influence how rumors spread and diminish over time. This article proposes a dynamic-susceptible-exposed-infected-recovered (DSEIR) rumor propagation model based on human social behavior to solve the spread of rumors problem. This model considers the characteristics of rumors spread in social networks with the Markov chain and makes the simulation more authentic. To suppress rumor propagation, we introduce the concept of rumor survivability and propose a dynamic truth movement blocking strategy, which adapts to people’s evolving viewpoints to curb the influence of rumors effectively. Finally, we analyze the proposed model and blocking strategy in four real networks. The experimental results show that the proposed propagation model can authentically simulate the propagation of rumors in social networks and the proposed blocking strategy efficiently suppresses the rumor propagation. We have released our code here: https://github.com/gf9264/DSEIR.
- 7 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 24 (7) , 5716-5730
Power Optimization for Low Transmission Delay in Software Defined Data Center Networks
Software-Defined Data Center Networks (SDDCNs) utilizes Software Defined Networking (SDN) as a network architecture to achieve highly flexible, programmable, and automated management of Data Center Networks (DCNs). The high energy consumption of DCNs remains a persistent and significant challenge. Thus, the energy saving is crucial and imperative for DCNs. Current energy-efficient solutions primarily rely on flow consolidation and dynamic device sleeping techniques to reduce energy consumption. However, these approaches often yield long Flow Completion Time (FCT), potentially resulting in violations of service-level agreements, particularly for delay-sensitive applications. In this paper, we formulate the problem of minimizing the power consumption in SDDCNs as key objective while ensuring timely FCT for delay-sensitive applications. To solve this problem, we first introduce the Active Network Generation (ANG) approach, which generates a minimal active subnet with the least number of active devices while meeting the current traffic demand. Subsequently, we propose two algorithms based on the type of applications: the Delay-Tolerant Flow Route (DTFR) algorithm for delay-tolerant applications and the Delay-Sensitive Flow Route (DSFR) algorithm for delay-sensitive applications. Simulation results demonstrate that our propose solution achieves an energy-saving rate of up to 67.77% and significantly reduces FCT compared to benchmark solutions.
- 7 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 24 (7) , 5716-5730
Power Optimization for Low Transmission Delay in Software Defined Data Center Networks
Software-Defined Data Center Networks (SDDCNs) utilizes Software Defined Networking (SDN) as a network architecture to achieve highly flexible, programmable, and automated management of Data Center Networks (DCNs). The high energy consumption of DCNs remains a persistent and significant challenge. Thus, the energy saving is crucial and imperative for DCNs. Current energy-efficient solutions primarily rely on flow consolidation and dynamic device sleeping techniques to reduce energy consumption. However, these approaches often yield long Flow Completion Time (FCT), potentially resulting in violations of service-level agreements, particularly for delay-sensitive applications. In this paper, we formulate the problem of minimizing the power consumption in SDDCNs as key objective while ensuring timely FCT for delay-sensitive applications. To solve this problem, we first introduce the Active Network Generation (ANG) approach, which generates a minimal active subnet with the least number of active devices while meeting the current traffic demand. Subsequently, we propose two algorithms based on the type of applications: the Delay-Tolerant Flow Route (DTFR) algorithm for delay-tolerant applications and the Delay-Sensitive Flow Route (DSFR) algorithm for delay-sensitive applications. Simulation results demonstrate that our propose solution achieves an energy-saving rate of up to 67.77% and significantly reduces FCT compared to benchmark solutions.
- 2 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 10 (5) , 2244-2253
Graph Convolutional Network-Based Rumor Blocking on Social Networks
Misinformation and rumors can spread rapidly and widely through online social networks, seriously endangering social stability. Therefore, rumor blocking on social networks has become a hot research topic. In the existing research, when users receive two opposing opinions, they tend to believe the one arrives first. In this article, we argue that users will dialectically trust the information based on their own opinions rather than the rule of first-come-first-listen. We propose a confidence-based opinion adoption (CBOA) model, which considers the opinion and confidence according to the traditional linear threshold (LT) model. Based on this model, we propose the directed graph convolutional network (DGCN) method to select the$k$ most influential positive cascade nodes to suppress the propagation of rumors. Finally, we verify our method on four real network datasets. The experimental results show that our method can sufficiently suppress the propagation of rumors and obtains smaller number of rumor nodes than the baseline algorithms.- 2 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 10 (5) , 2244-2253
Graph Convolutional Network-Based Rumor Blocking on Social Networks
Misinformation and rumors can spread rapidly and widely through online social networks, seriously endangering social stability. Therefore, rumor blocking on social networks has become a hot research topic. In the existing research, when users receive two opposing opinions, they tend to believe the one arrives first. In this article, we argue that users will dialectically trust the information based on their own opinions rather than the rule of first-come-first-listen. We propose a confidence-based opinion adoption (CBOA) model, which considers the opinion and confidence according to the traditional linear threshold (LT) model. Based on this model, we propose the directed graph convolutional network (DGCN) method to select the$k$ most influential positive cascade nodes to suppress the propagation of rumors. Finally, we verify our method on four real network datasets. The experimental results show that our method can sufficiently suppress the propagation of rumors and obtains smaller number of rumor nodes than the baseline algorithms.- 11 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 9 (5) , 1505-1514
Reinforcement-Learning-Based Competitive Opinion Maximization Approach in Signed Social Networks
Competitive opinion maximization (COM) in signed social networks targets at selecting a subset of influential individuals (i.e., seed nodes), spreading the desired opinions of the product to their neighbors against its opponents, and eventually achieving the maximum opinion propagation. Current studies mainly focus on competitive influence maximization and opinion maximization. However, COM in signed social networks has not been studied in depth. In this article, we study the COM in signed social networks and propose a novel reinforcement-learning-based opinion maximization framework (RLOM) to solve the COM problem. The proposed RLOM is composed of two phases: the activated dynamic opinion model and the reinforcement-learning-based seeding process. We theoretically prove the COM problem to be NP-hard. To model the opinion propagation process, we propose the activated dynamic opinion model based on a stateless Q-learning approach. Moreover, we propose the reinforcement-learning-based seeding scheme, which is leveraged in an unknown opponent strategy. Experiment results verify the effectiveness of our method in terms of effective opinions on three signed datasets.
- 11 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 9 (5) , 1505-1514
Reinforcement-Learning-Based Competitive Opinion Maximization Approach in Signed Social Networks
Competitive opinion maximization (COM) in signed social networks targets at selecting a subset of influential individuals (i.e., seed nodes), spreading the desired opinions of the product to their neighbors against its opponents, and eventually achieving the maximum opinion propagation. Current studies mainly focus on competitive influence maximization and opinion maximization. However, COM in signed social networks has not been studied in depth. In this article, we study the COM in signed social networks and propose a novel reinforcement-learning-based opinion maximization framework (RLOM) to solve the COM problem. The proposed RLOM is composed of two phases: the activated dynamic opinion model and the reinforcement-learning-based seeding process. We theoretically prove the COM problem to be NP-hard. To model the opinion propagation process, we propose the activated dynamic opinion model based on a stateless Q-learning approach. Moreover, we propose the reinforcement-learning-based seeding scheme, which is leveraged in an unknown opponent strategy. Experiment results verify the effectiveness of our method in terms of effective opinions on three signed datasets.
- 31 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (12) , 10018-10033
Power-Efficient Software-Defined Data Center Network
The energy consumed by data centers has been growing rapidly in recent years. Among all the major contributors to the power consumption of entire data centers, data center network (DCN) can account for up to 20% of the total power consumption. In this article, we first devise a power-efficient software-defined DCN (PESD-DCN) framework, which can achieve desirable power efficiency, avoid potential link congestion, and reduce frequent device state transition. Then, we formulate the optimization problem of maximizing the radio full-utilized devices to all devices. To solve it, we propose correlation-aware flow routing (CFR) algorithm, which leverages correlation-aware flow consolidation (CFC) technique to improve energy efficiency, avoid the potential link congestion, and reduce frequent device state transition. Moreover, to further improve the DCN energy efficiency, we propose flow rerouting, link rate adaptation, and device sleeping (FLD) algorithm. Finally, simulation results demonstrate that PESD-DCN can achieve a good performance. More specifically, in comparison to the other baseline algorithms, PESD-DCN can achieve up to 79.19% energy efficiency, 67.1% decrease in switch state transition (SST), and 55.4% decrease in link state transition (LST).
- 31 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (12) , 10018-10033
Power-Efficient Software-Defined Data Center Network
The energy consumed by data centers has been growing rapidly in recent years. Among all the major contributors to the power consumption of entire data centers, data center network (DCN) can account for up to 20% of the total power consumption. In this article, we first devise a power-efficient software-defined DCN (PESD-DCN) framework, which can achieve desirable power efficiency, avoid potential link congestion, and reduce frequent device state transition. Then, we formulate the optimization problem of maximizing the radio full-utilized devices to all devices. To solve it, we propose correlation-aware flow routing (CFR) algorithm, which leverages correlation-aware flow consolidation (CFC) technique to improve energy efficiency, avoid the potential link congestion, and reduce frequent device state transition. Moreover, to further improve the DCN energy efficiency, we propose flow rerouting, link rate adaptation, and device sleeping (FLD) algorithm. Finally, simulation results demonstrate that PESD-DCN can achieve a good performance. More specifically, in comparison to the other baseline algorithms, PESD-DCN can achieve up to 79.19% energy efficiency, 67.1% decrease in switch state transition (SST), and 55.4% decrease in link state transition (LST).
- 4 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 15 (1) , 526-537
PLOFR: An Online Flow Route Framework for Power Saving and Load Balance in SDN
The power consumed by the Internet has been growing sharply in recent years, which accounts for a considerable proportion of the overall power consumption. To reduce high power consumption in the network, numerous proposals on power saving are proposed. Unfortunately, most of them have some side effects, such as load imbalance and even link congestion. Power saving and load balance are two conflicting optimization objectives, and the optimization solutions of them cannot be achieved at the same time. To achieve the desired tradeoff between power saving and load balance, in this article, based on software-defined networking, we first propose a Power-efficient and Load-balanced Online Flow Route framework. Then, we formulate the optimization problem of jointly taking power saving and load balance into account. After proving the problem is NP-hard, we propose the power-efficient and load-balanced flow scheduling algorithm to address it. In addition, we propose a route updating algorithm to enable path updating caused by flow scheduling. Finally, the experimental results demonstrate the proposed algorithm outperforms benchmarks on power saving, load balance, and reduces the possibility of link congestion.
- 4 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 15 (1) , 526-537
PLOFR: An Online Flow Route Framework for Power Saving and Load Balance in SDN
The power consumed by the Internet has been growing sharply in recent years, which accounts for a considerable proportion of the overall power consumption. To reduce high power consumption in the network, numerous proposals on power saving are proposed. Unfortunately, most of them have some side effects, such as load imbalance and even link congestion. Power saving and load balance are two conflicting optimization objectives, and the optimization solutions of them cannot be achieved at the same time. To achieve the desired tradeoff between power saving and load balance, in this article, based on software-defined networking, we first propose a Power-efficient and Load-balanced Online Flow Route framework. Then, we formulate the optimization problem of jointly taking power saving and load balance into account. After proving the problem is NP-hard, we propose the power-efficient and load-balanced flow scheduling algorithm to address it. In addition, we propose a route updating algorithm to enable path updating caused by flow scheduling. Finally, the experimental results demonstrate the proposed algorithm outperforms benchmarks on power saving, load balance, and reduces the possibility of link congestion.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5913-5918
Coal properties on-line analysis with synergy adaptive moving window support vector regression based on immune clone algorithm
It is of great significance to obtain moisture, volatile matter, ash and heating value in real time. Online type coal analyzer used in principle is generally used in X ray fluorescence or neutron induced gamma ray, but these methods are radioactive, bring security risks to the field staff. With the development of modern computer and chemometrics, NIR on-line detection of coal quality gradually get people's attention. However, when using near infrared spectroscopy for coal quality analysis, it is often used to select the optimal pretreatment method under the full spectrum, and the selection process usually depends on the expert experience or trial method. It is very difficult to get the optimal model solution. To solve this problem, a novel spectrum analysis tool named synergy adaptive moving window support vector regression based on immune clone algorithm (SA-MWSVR-ICA) is proposed, based on the working principle of the human immune system. Based on the working principle of the human immune system, the performance of the quantitative model is regarded as antigen, and a special vector corresponding to the above mentioned antigen is regarded as antibody. The antibody contains a pre-processing method optimization region which is created by 11 decimal digits, a spectrum variable optimization region which is formed by some moving windows with changeable width and position, and a model parameter optimization region. Through the on-line near infrared coal properties analysis device installed in the actual power station, the quantitative analysis of field pulverized coal shows that the model established by the immune clonal algorithm is better than the traditional methods. Additionally, the selected pre-processing methods and spectrum variables are easily explained.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5913-5918
Coal properties on-line analysis with synergy adaptive moving window support vector regression based on immune clone algorithm
It is of great significance to obtain moisture, volatile matter, ash and heating value in real time. Online type coal analyzer used in principle is generally used in X ray fluorescence or neutron induced gamma ray, but these methods are radioactive, bring security risks to the field staff. With the development of modern computer and chemometrics, NIR on-line detection of coal quality gradually get people's attention. However, when using near infrared spectroscopy for coal quality analysis, it is often used to select the optimal pretreatment method under the full spectrum, and the selection process usually depends on the expert experience or trial method. It is very difficult to get the optimal model solution. To solve this problem, a novel spectrum analysis tool named synergy adaptive moving window support vector regression based on immune clone algorithm (SA-MWSVR-ICA) is proposed, based on the working principle of the human immune system. Based on the working principle of the human immune system, the performance of the quantitative model is regarded as antigen, and a special vector corresponding to the above mentioned antigen is regarded as antibody. The antibody contains a pre-processing method optimization region which is created by 11 decimal digits, a spectrum variable optimization region which is formed by some moving windows with changeable width and position, and a model parameter optimization region. Through the on-line near infrared coal properties analysis device installed in the actual power station, the quantitative analysis of field pulverized coal shows that the model established by the immune clonal algorithm is better than the traditional methods. Additionally, the selected pre-processing methods and spectrum variables are easily explained.
- 1 March 2012
- Published by Elsevier in Powder Technology
- Vol. 218, 1-4
Experimental investigation on the drying process of the sinter mixture
- 1 March 2012
- Published by Elsevier in Powder Technology
- Vol. 218, 1-4
Experimental investigation on the drying process of the sinter mixture