Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yang You 0002

dblp:33/8167-2 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
5since 2021 · last 2025
0000-0003-2659-863XORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 1 first-author · 2 since 2021Security and privacy · 2 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Privacy and data protection · 57% Cyber-physical and IoT security · 43%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Energy systems and smart grids · 100%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection
smart grid privacy
0.712023
Non-Cooperative Games for Privacy-Preserving and Cost-Efficient Smart Grid Energy Management · IEEE Trans. Inf. Forensics Secur. 2023
Cyber-physical and IoT security › iot privacy
smart meter privacy
0.512021
Energy Management Strategy for Smart Meter Privacy and Cost Saving · IEEE Trans. Inf. Forensics Secur. 2021
Energy systems and smart grids
demand-side management
0.322023
Non-Cooperative Games for Privacy-Preserving and Cost-Efficient Smart Grid Energy Management · IEEE Trans. Inf. Forensics Secur. 2023
Energy Management Strategy for Smart Meter Privacy and Cost Saving · IEEE Trans. Inf. Forensics Secur. 2021
Algorithmic game theory and mechanism design › solution concepts in games › equilibrium concepts
nash equilibrium
0.212023
Non-Cooperative Games for Privacy-Preserving and Cost-Efficient Smart Grid Energy Management · IEEE Trans. Inf. Forensics Secur. 2023
Algorithmic game theory and mechanism design
non-cooperative game
0.212023
Non-Cooperative Games for Privacy-Preserving and Cost-Efficient Smart Grid Energy Management · IEEE Trans. Inf. Forensics Secur. 2023
Energy systems and smart grids
energy storage
0.112021
Energy Management Strategy for Smart Meter Privacy and Cost Saving · IEEE Trans. Inf. Forensics Secur. 2021

Methods — techniques the papers use, named apart from their topics

factorial hidden markov model · 2.0distributed nash equilibrium seeking · 2.0noncooperative game theory · 1.3q-learning · 1.0markov decision process · 1.0kullback-leibler divergence · 1.0non-cooperative game theory · 0.7
YearPublicationVenuePosition
2025 Homomorphic-encryption-based Decentralized Federated Learning
abstract
To meet the requirements of the artificial internet of things (AIoT), decentralization is essential to provide wide coverage, trustworthiness, and low-latency communication. For this purpose, decentralized federated learning (DFL) has rapidly evolved and gained popularity in recent years by reducing reliance on a central server and promoting a more robust, scalable, and privacy-preserving system. Nevertheless, the exchange of model updates and gradients in peer-to-peer (P2P) wireless communication systems introduces new vulnerabilities that threaten both model performance and data security, while frequent P2P communication among clients can lead to high communication costs. To address these issues, in this work, we develop a communicationefficient and security-enhanced DFL algorithm, which integrates the fast incremental alternating direction method of multipliers (FI-ADMM) algorithm with parameter-selective additively homomorphic encryption. Additionally, by introducing a first-order approximation for primal updates and rearranging the update order in FI-ADMM, the proposed method is superior to the other benchmarks in terms of computational and time complexity, which is validated by theoretical analysis and simulations.
Yue Xiao 0002, Yu Ye 0001, Xiyu Sheng, Yang You 0002, Sotiris A. Tegos, Guoqiang Xiao 0001, George K. Karagiannidis, Carlo Fischione
ICC4
2023 Non-Cooperative Games for Privacy-Preserving and Cost-Efficient Smart Grid Energy Management
abstract
In this paper, we design privacy-preserving and cost-efficient energy management strategies for smart grid users that are equipped with renewable energy sources. The adversary is assumed to employ a factorial hidden Markov model based inference for load disaggregation, and the corresponding joint log-likelihood of the model is utilized as the privacy measure. The studied dynamic pricing model is applicable to a commodity-limited market, where the price of unit amount of energy is determined by the users’ aggregated power request. The users’ energy management strategies are designed under a non-cooperative game framework, where each user aims to optimize a weighted sum objective of both privacy measure and energy cost saving. The users’ non-cooperative game is shown to admit a unique pure strategy Nash equilibrium. As an extension, a computational-efficient distributed Nash equilibrium energy management strategy seeking method is proposed, which also avoids the privacy leakage due to the sharing of payoff functions between users. The performance of practical designs of the energy management strategies in the equilibrium is finally illustrated by numerical experiments.
Yang You 0002, Zuxing Li, Tobias J. Oechtering
IEEE Trans. Inf. Forensics Secur.1
2023 Time-Adaptive Expectation Maximization Learning Framework for HMM Based Data-Driven Gas Sensor Calibration
abstract
In this article, data-driven self-calibration algorithms for the low-cost gas sensors are designed. The sensor measurement errors happen due to the imperfect compensation for the variation of sensor component behavior that is caused by changing of environmental factors. To calibrate the sensors, the hidden Markov model (HMM) is utilized to characterize the statistical dependency between the environmental factors and the variation of sensor component behavior. Considering the time-varying property of this dependency, a time-adaptive learning framework is further designed to update the HMM so that the time-varying drift process can be better tracked over a long term. More specifically, a time-adaptive expectation maximization learning approach is proposed to efficiently update the HMM parameters. A closed form of the convergence rate of this time-adaptive learning approach is derived, which provides a theoretical guarantee on the time efficiency as well as the computational efficiency. The performance of the scheme is illustrated in numerical experiments utilizing real data, which shows that long-term stable calibration performance can be achieved.
Yang You 0002, Tobias J. Oechtering
IEEE Trans. Ind. Informatics1
2022 On Data-Driven Self-Calibration for IoT-Based Gas Concentration Monitoring Systems
abstract
In this article, data-driven self-calibration algorithms for the Internet of Things-based gas concentration monitoring systems embedded with low-cost gas sensors are designed. The measurement errors are assumed to be caused by imperfect compensation for the variation of sensor component behavior. Specifically, the calibration procedure for the nondispersive infrared$CO_{2}$sensors is developed, for which the temperature dependency is the most dominant drift source. For a single sensor, the hidden Markov model is used to characterize the statistical relationship between different quantities introduced by the physical model that builds on the Beer–Lambert law. For the calibration in the Internet of Things-based system, sensors first transmit their belief functions of the true gas concentration level to the cloud. Then, the cloud fusion center computes a fused belief function according to certain rules. This belief function is then used as reference for calibrating the sensors. To deal with the case where belief functions highly conflict with each other, a Wasserstein distance-based weighted average belief function fusion approach is first proposed as a networked calibration algorithm. To achieve more long-term stable calibration results, the networked calibration problem is further formulated as a partially observed Markov decision process (MDP) problem, and the calibration strategies are derived in a sequential manner. Correspondingly, the deep$Q$-network approach is applied as a computationally efficient method to solve the proposed MDP problem. The performance of practical designs of the proposed self-calibration algorithms is finally illustrated in numerical experiments utilizing real data.
Yang You 0002, Kai You, Hao Chen 0048, Tobias J. Oechtering
IEEE Internet Things J.1
2021 Energy Management Strategy for Smart Meter Privacy and Cost Saving
abstract
We design optimal privacy-enhancing and cost-efficient energy management strategies for consumers that are equipped with a rechargeable energy storage. The Kullback-Leibler divergence rate is used as privacy measure and the expected cost-saving rate is used as utility measure. The corresponding energy management strategy is designed by optimizing a weighted sum of both privacy and cost measures over a finite time horizon, which is achieved by formulating our problem into a belief-state Markov decision process problem. A computationally efficient approximated Q-learning method is proposed as a generalization to high-dimensional problems over an infinite time horizon. At last, we explicitly characterize a stationary policy that achieves the steady belief state over an infinite time horizon, which greatly simplifies the design of the privacy-preserving energy management strategy. The performance of the practical design approaches are finally illustrated in numerical experiments.
Yang You 0002, Zuxing Li, Tobias J. Oechtering
IEEE Trans. Inf. Forensics Secur.1