Xiaobin Yin

Xiaobin Yin

Auto-generated profile, based on publicly available information

Xiaobin Yin

School of Mathematics and Statistics, Anhui Normal University, Wuhu, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
27 July 2023 in IEEE Access
Verified
Journal Article
Open access
BWBeining Wu
Beining Wu
ZCZhengkun Cai
Zhengkun Cai
WWWei Wu
Wei Wu
XYXiaobin Yin
Xiaobin Yin
The freshness of information is critical for patient vital signs and physiological parameters in the healthcare system because changes in these parameters can indicate a patient’s overall health status and guide treatment decisions. In this paper, we consider an edge device-aided smart healthcare system that relies on a resource management scheme. The medical center requires patient information, and edge nodes process the latest measurements received by each wearable device. Our goal is to find the optimal strategy to minimize the worst case of information freshness, i.e., the peak AoI age of information (PAoI). Firstly, we model the problem as a Markov Decision Process (MDP). Then, we design two separate Reinforcement Learning (RL)-based algorithms to find the optimal strategy that minimizes energy consumption and the average PAoI. To minimize energy consumption, we propose a pair of sleep mechanisms, including the N policy and p wake-up policy, to improve the energy efficiency of each wearable device. Simulation results show that the proposed wake-up strategy and the proposed RL algorithm make a better trade-off between the average PAoI and power dissipation compared to the baseline schemes.

14 August 2018 in Algebra Colloquium
Verified
Journal Article
Closed access
PDF file
JCJian Cui
Jian Cui
XYXiaobin Yin
Xiaobin Yin

1 January 2026 in Journal of Mathematics
Verified
Journal Article
Open access
ZWZiyi Wu
Ziyi Wu
XYXiaobin Yin
Xiaobin Yin
Let R be a finite commutative ring with identity 1. The U ‐clean graph U ‐ C l ( R ) of a ring R is a simple undirected graph with vertices are of the form ( e , u ), where e is a nonzero idempotent and u is a unit of R , and two distinct vertices ( e , u ), ( f , v ) of U ‐ C l ( R ) are adjacent if and only if e = f = 1 or u v = 1. In this paper, we present the strong resolving graph U ‐ C l ( R ) S R of U ‐ C l ( R ). The vertex degrees, the independence number, the clique number, and the chromatic number of U ‐ C l ( R ) S R are determined. Moreover, we show that if k is a divisor of ( n − 1) n , where k and n are positive integers with k > n ≥ 3, then U ‐ is not a complete graph. Finally, we give some examples of U ‐ and U ‐ to illustrate our results.