Fangchun Yang
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
Fangchun Yang has a total of 55 co-authors. Here are the top co-authors by number of shared publications:
- Shangguang Wang
Beijing University of Posts and Telecommunications
14 shared publications - Jinglin Li
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China
8 shared publications - Rongheng Lin
Beijing University of Posts and Telecommunications
5 shared publications - Ao Zhou
Beijing University of Posts and Telecommunications
4 shared publications - Qibo Sun
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China
4 shared publications - Tao Lei
Beijing University of Posts and Telecommunications
4 shared publications
Latest Publications
- Open Access
- 3 September 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (17) , 3187
The Synergy of Double Neural Networks for Bridge Bidding
Artificial intelligence (AI) has made many breakthroughs in the perfect information game. Nevertheless, Bridge, a multiplayer imperfect information game, is still quite challenging. Bridge consists of two parts: bidding and playing. Bidding accounts for about 75% of the game and playing for about 25%. Expert-level teams are generally indistinguishable at the playing level, so bidding is the more decisive factor in winning or losing. The two teams can communicate using different systems during the bidding phase. However, existing bridge bidding models focus on at most one bidding system, which does not conform to the real game rules. This paper proposes a deep reinforcement learning model that supports multiple bidding systems, which can compete with players using different bidding systems and exchange hand information normally. The model mainly comprises two deep neural networks: a bid selection network and a state evaluation network. The bid selection network can predict the probabilities of all bids, and the state evaluation network can directly evaluate the optional bids and make decisions based on the evaluation results. Experiments show that the bidding model is not limited by a single bidding system and has superior bidding performance.
- 3 September 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (17) , 3187
Open AccessThe Synergy of Double Neural Networks for Bridge Bidding
Artificial intelligence (AI) has made many breakthroughs in the perfect information game. Nevertheless, Bridge, a multiplayer imperfect information game, is still quite challenging. Bridge consists of two parts: bidding and playing. Bidding accounts for about 75% of the game and playing for about 25%. Expert-level teams are generally indistinguishable at the playing level, so bidding is the more decisive factor in winning or losing. The two teams can communicate using different systems during the bidding phase. However, existing bridge bidding models focus on at most one bidding system, which does not conform to the real game rules. This paper proposes a deep reinforcement learning model that supports multiple bidding systems, which can compete with players using different bidding systems and exchange hand information normally. The model mainly comprises two deep neural networks: a bid selection network and a state evaluation network. The bid selection network can predict the probabilities of all bids, and the state evaluation network can directly evaluate the optional bids and make decisions based on the evaluation results. Experiments show that the bidding model is not limited by a single bidding system and has superior bidding performance.
- Open Access
AI Enabled Bridge Bidding Supporting Interactive Visualization
With the fast progress in perfect information game problems such as AI chess and AI Go, researchers have turned to imperfect information game problems, including Texas Hold’em and Bridge. Bridge is one of the most challenging card games that have significant research value. Bridge playing is divided into two phases: bidding and playing. This paper focuses on bridge bidding and proposes a bridge bidding service framework using deep neural networks, and supports bidding visualization for the first time. The framework consists of two parts: the bidding model (BM) with a multilayer neural network, and a visualization system. The framework predicts not only reasonable bids from the existing bidding system of humans, but also provides intuitive explanations for decisions to enable human–computer information interaction. Experimental results show that this bidding AI outperforms majority of existing systems.
Open AccessAI Enabled Bridge Bidding Supporting Interactive Visualization
With the fast progress in perfect information game problems such as AI chess and AI Go, researchers have turned to imperfect information game problems, including Texas Hold’em and Bridge. Bridge is one of the most challenging card games that have significant research value. Bridge playing is divided into two phases: bidding and playing. This paper focuses on bridge bidding and proposes a bridge bidding service framework using deep neural networks, and supports bidding visualization for the first time. The framework consists of two parts: the bidding model (BM) with a multilayer neural network, and a visualization system. The framework predicts not only reasonable bids from the existing bidding system of humans, but also provides intuitive explanations for decisions to enable human–computer information interaction. Experimental results show that this bidding AI outperforms majority of existing systems.
- Open Access
An Incremental Clustering Algorithm with Pattern Drift Detection for IoT-Enabled Smart Grid System
The IoT-enabled smart grid system provides smart meter data for electricity consumers to record their energy consumption behaviors, the typical features of which can be represented by the load patterns extracted from load data clustering. The changeability of consumption behaviors requires load pattern update for achieving accurate consumer segmentation and effective demand response. In order to save training time and reduce computation scale, we propose a novel incremental clustering algorithm with probability strategy, ICluster-PS, instead of overall load data clustering to update load patterns. ICluster-PS first conducts new load pattern extraction based on the existing load patterns and new data. Then, it intergrades new load patterns with the existing ones. Finally, it optimizes the intergraded load pattern sets by a further modification. Moreover, ICluster-PS can be performed continuously with new coming data due to parameter updating and generalization. Extensive experiments are implemented on real-world dataset containing diverse consumer types in various districts. The experimental results are evaluated by both clustering validity indices and accuracy measures, which indicate that ICluster-PS outperforms other related incremental clustering algorithm. Additionally, according to the further case studies on pattern evolution analysis, ICluster-PS is able to present any pattern drifts through its incremental clustering results.
Open AccessAn Incremental Clustering Algorithm with Pattern Drift Detection for IoT-Enabled Smart Grid System
The IoT-enabled smart grid system provides smart meter data for electricity consumers to record their energy consumption behaviors, the typical features of which can be represented by the load patterns extracted from load data clustering. The changeability of consumption behaviors requires load pattern update for achieving accurate consumer segmentation and effective demand response. In order to save training time and reduce computation scale, we propose a novel incremental clustering algorithm with probability strategy, ICluster-PS, instead of overall load data clustering to update load patterns. ICluster-PS first conducts new load pattern extraction based on the existing load patterns and new data. Then, it intergrades new load patterns with the existing ones. Finally, it optimizes the intergraded load pattern sets by a further modification. Moreover, ICluster-PS can be performed continuously with new coming data due to parameter updating and generalization. Extensive experiments are implemented on real-world dataset containing diverse consumer types in various districts. The experimental results are evaluated by both clustering validity indices and accuracy measures, which indicate that ICluster-PS outperforms other related incremental clustering algorithm. Additionally, according to the further case studies on pattern evolution analysis, ICluster-PS is able to present any pattern drifts through its incremental clustering results.
- 6 May 2021
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 14 (5) , 3349-3359
A double-layer collaborative apportionment method for personalized and balanced routing
- 6 May 2021
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 14 (5) , 3349-3359
A double-layer collaborative apportionment method for personalized and balanced routing
- 28 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 9 (12) , 2054-2058
Understanding Cooperative Data Exchange Problem in Multi-Hop Wireless Network
This letter theoretically formulates the coded cooperative data exchange (CCDE) problem in multi-channel multi-hop wireless networks, where a set of nodes initially hold a subset of packets and wish to retrieve all desired packets via multi-hop wireless communication. At first, we propose the model of tentative transmission, with which we can jointly consider resource allocation, transmission scheduling, and transmitted packet scheduling. Then, based on the time expanded graph, we convert the CCDE problem in multiple time slots into a single source and multiple sinks network (SSMN) within a time slot. Finally, the relationship between the required time slots and the number of channels is theoretically formulated based on the constructed SSMN. Experiments demonstrate that the gain due to the increasing number of channels flattens.
- 28 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 9 (12) , 2054-2058
Understanding Cooperative Data Exchange Problem in Multi-Hop Wireless Network
This letter theoretically formulates the coded cooperative data exchange (CCDE) problem in multi-channel multi-hop wireless networks, where a set of nodes initially hold a subset of packets and wish to retrieve all desired packets via multi-hop wireless communication. At first, we propose the model of tentative transmission, with which we can jointly consider resource allocation, transmission scheduling, and transmitted packet scheduling. Then, based on the time expanded graph, we convert the CCDE problem in multiple time slots into a single source and multiple sinks network (SSMN) within a time slot. Finally, the relationship between the required time slots and the number of channels is theoretically formulated based on the constructed SSMN. Experiments demonstrate that the gain due to the increasing number of channels flattens.
- 23 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. PP (15361233) , 1
QoS Driven Task Offloading with Statistical Guarantee in Mobile Edge Computing
In mobile edge computing, popular mobile applications, such as augmented reality, usually offload their tasks to resource-rich edge servers. The user experience can be considerably affected when many mobile users compete for the limited communication and computation resources. The key technical challenge in task offloading is to guarantee the Quality of Service (QoS) for such applications. Existing work on task offloading focus on deterministic QoS guarantee, which means that tasks have to complete before the given deadline with 100%. However, it is impractical to impose a deterministic QoS guarantee for tasks due to the high dynamics of the wireless environment when offloading to edge servers. In this paper, we focus on task offloading with statistical QoS guarantee, which can further save more energy by loosing the QoS requirement. Specially, we first propose a statistical computation model and a statistical transmission model to quantify the correlation between the statistical QoS guarantee and task offloading strategy. Then, we formulate the task offloading problem as an mixed integer non-Linear programming problem. We propose an algorithm to provide the statistical QoS guarantee for tasks using convex optimization theory and Gibbs sampling method. Experiment results show that the proposed algorithm outperforms the three baselines.
- 23 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. PP (15361233) , 1
QoS Driven Task Offloading with Statistical Guarantee in Mobile Edge Computing
In mobile edge computing, popular mobile applications, such as augmented reality, usually offload their tasks to resource-rich edge servers. The user experience can be considerably affected when many mobile users compete for the limited communication and computation resources. The key technical challenge in task offloading is to guarantee the Quality of Service (QoS) for such applications. Existing work on task offloading focus on deterministic QoS guarantee, which means that tasks have to complete before the given deadline with 100%. However, it is impractical to impose a deterministic QoS guarantee for tasks due to the high dynamics of the wireless environment when offloading to edge servers. In this paper, we focus on task offloading with statistical QoS guarantee, which can further save more energy by loosing the QoS requirement. Specially, we first propose a statistical computation model and a statistical transmission model to quantify the correlation between the statistical QoS guarantee and task offloading strategy. Then, we formulate the task offloading problem as an mixed integer non-Linear programming problem. We propose an algorithm to provide the statistical QoS guarantee for tasks using convex optimization theory and Gibbs sampling method. Experiment results show that the proposed algorithm outperforms the three baselines.
- 1 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 7 (4) , 3013-3025
Coded Cooperative Data Exchange in Multichannel Multihop Wireless Networks
- 1 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 7 (4) , 3013-3025
Coded Cooperative Data Exchange in Multichannel Multihop Wireless Networks
- 28 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 14 (3) , 3289-3300
E-WACGAN: Enhanced Generative Model of Signaling Data Based on WGAN-GP and ACGAN
In recent years, the generative adversarial network (GAN) has achieved outstanding performance in the image field and the derivatives of GAN, namely auxiliary classifier GAN (ACGAN) and Wasserstein GAN with gradient penalty (WGAN-GP) have also been widely used, but the GAN applications of nonimage domain are not wide. At the time when the telecommunication fraud is rampant, the signaling data of telephone contain a lot of useful information, which is helpful for distinguishing fraudulent and nonfraudulent calls. In this article, aiming at the problem of limited amount of data and information leakage in the research of telephone signaling data, we adopt WGAN-GP and ACGAN to generate analog data, which confirms distribution of true data. In order to solve the problem of category accuracy of analog data and to enhance the stability and speed of training, we proposed a new network structure for discriminator of GAN based on WGAN-GP and ACGAN. The experiments on telecommunication fraud dataset found that our method obtains better performance on signaling data than base model.
- 28 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 14 (3) , 3289-3300
E-WACGAN: Enhanced Generative Model of Signaling Data Based on WGAN-GP and ACGAN
In recent years, the generative adversarial network (GAN) has achieved outstanding performance in the image field and the derivatives of GAN, namely auxiliary classifier GAN (ACGAN) and Wasserstein GAN with gradient penalty (WGAN-GP) have also been widely used, but the GAN applications of nonimage domain are not wide. At the time when the telecommunication fraud is rampant, the signaling data of telephone contain a lot of useful information, which is helpful for distinguishing fraudulent and nonfraudulent calls. In this article, aiming at the problem of limited amount of data and information leakage in the research of telephone signaling data, we adopt WGAN-GP and ACGAN to generate analog data, which confirms distribution of true data. In order to solve the problem of category accuracy of analog data and to enhance the stability and speed of training, we proposed a new network structure for discriminator of GAN based on WGAN-GP and ACGAN. The experiments on telecommunication fraud dataset found that our method obtains better performance on signaling data than base model.
- Open Access
AUD-MTS: An Abnormal User Detection Approach Based on Power Load Multi-Step Clustering with Multiple Time Scales
With the rapid growth of Smart Grid, electricity load analysis has become the simplest and most effective way to divide user groups and understand user behavior. This paper proposes an AUD-MTS (Abnormal User Detection approach based on power load multi-step clustering with Multiple Time Scales). Firstly, we combine RBM (Restricted Boltzmann Machine) hidden feature learning with K-Means clustering to extract typical load patterns in the short-term. Secondly, time scale conversion is performed so that the analysis subject can be transformed from load pattern to user behavior. Finally, a two-step clustering in long-term is adopted to divide users from both coarse-grained and fine-grained dimensions so as to detect abnormal users referring to customized OutlierIndex. Experiments are conducted using annual 24-point power load data of American users in all states. The accuracy of clustering methods in AUD-MTS reaches 87.5% referring to the 16 commercial building types defined by the U.S. Department of Energy, which outperforms other common clustering algorithms on AMI (Advanced Metering Infrastructure). After that, the OutlierIndex score of AUD-MTS can be increased by 0.16 compared with other outlier detection algorithms, which shows that the proposed method can detect abnormal users precisely and efficiently. Furthermore, we summarized possible causes including federal holidays, climate zones and summertime that may lead to abnormal behavior changes and discussed countermeasures respectively, which accounts for 82.3% of anomalies. The rest may be potential electricity stealing users, which requires further investigation.
Open AccessAUD-MTS: An Abnormal User Detection Approach Based on Power Load Multi-Step Clustering with Multiple Time Scales
With the rapid growth of Smart Grid, electricity load analysis has become the simplest and most effective way to divide user groups and understand user behavior. This paper proposes an AUD-MTS (Abnormal User Detection approach based on power load multi-step clustering with Multiple Time Scales). Firstly, we combine RBM (Restricted Boltzmann Machine) hidden feature learning with K-Means clustering to extract typical load patterns in the short-term. Secondly, time scale conversion is performed so that the analysis subject can be transformed from load pattern to user behavior. Finally, a two-step clustering in long-term is adopted to divide users from both coarse-grained and fine-grained dimensions so as to detect abnormal users referring to customized OutlierIndex. Experiments are conducted using annual 24-point power load data of American users in all states. The accuracy of clustering methods in AUD-MTS reaches 87.5% referring to the 16 commercial building types defined by the U.S. Department of Energy, which outperforms other common clustering algorithms on AMI (Advanced Metering Infrastructure). After that, the OutlierIndex score of AUD-MTS can be increased by 0.16 compared with other outlier detection algorithms, which shows that the proposed method can detect abnormal users precisely and efficiently. Furthermore, we summarized possible causes including federal holidays, climate zones and summertime that may lead to abnormal behavior changes and discussed countermeasures respectively, which accounts for 82.3% of anomalies. The rest may be potential electricity stealing users, which requires further investigation.
- 1 February 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 15 (6) , 3538-3547
A Blockchain-Enabled Trustless Crowd-Intelligence Ecosystem on Mobile Edge Computing
Crowd-intelligence tries to gather, process, infer and ascertain massive useful information by utilizing the intelligence of crowds or distributed computers. A crowd-intelligence ecosystem involves three stakeholders, namely the platform, workers (e.g., individuals, sensors or processors), and task publisher. The stakeholders have no mutual trust but interest conflict, which means bad cooperation of them. Due to lack of trust, transferring raw data (e.g., pictures or video clips) between publisher and workers requires the remote platform center to serve as a relay node, which implies network congestion. First we use a reward-penalty model to align the incentives of stakeholders. Then the predefined rules are implemented using blockchain smart contract on many edge servers of the mobile edge computing network, which together function as a trustless hybrid human-machine crowd-intelligence platform. As edge servers are near to workers and publisher, network congestion can be effectively improved. Further, we proved the existence of the only one strong Nash equilibrium, which can maximize the interests of involved edge servers and make the ecosystem bigger. Theoretical analysis and experiments validate the proposed method respectively.
- 1 February 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 15 (6) , 3538-3547
A Blockchain-Enabled Trustless Crowd-Intelligence Ecosystem on Mobile Edge Computing
Crowd-intelligence tries to gather, process, infer and ascertain massive useful information by utilizing the intelligence of crowds or distributed computers. A crowd-intelligence ecosystem involves three stakeholders, namely the platform, workers (e.g., individuals, sensors or processors), and task publisher. The stakeholders have no mutual trust but interest conflict, which means bad cooperation of them. Due to lack of trust, transferring raw data (e.g., pictures or video clips) between publisher and workers requires the remote platform center to serve as a relay node, which implies network congestion. First we use a reward-penalty model to align the incentives of stakeholders. Then the predefined rules are implemented using blockchain smart contract on many edge servers of the mobile edge computing network, which together function as a trustless hybrid human-machine crowd-intelligence platform. As edge servers are near to workers and publisher, network congestion can be effectively improved. Further, we proved the existence of the only one strong Nash equilibrium, which can maximize the interests of involved edge servers and make the ecosystem bigger. Theoretical analysis and experiments validate the proposed method respectively.