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

Wenrui Lin

dblp:260/0992 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
3since 2021 · last 2026
—ORCID · unresolved

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

Computer networks · 2 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 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.

Computer networks
1 paper
Internet of things and sensor networks · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
age of information
0.612022
Age of Changed Information: Content-Aware Status Updating in the Internet of Things · IEEE Trans. Commun. 2022
Internet of things and sensor networks
status update
0.612022
Age of Changed Information: Content-Aware Status Updating in the Internet of Things · IEEE Trans. Commun. 2022
Mathematical optimization › sequential decision making › markov decision processes
average-cost markov decision process
0.212022
Age of Changed Information: Content-Aware Status Updating in the Internet of Things · IEEE Trans. Commun. 2022
Mathematical optimization › sequential decision making
markov decision processes
0.212022
Age of Changed Information: Content-Aware Status Updating in the Internet of Things · IEEE Trans. Commun. 2022

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

relative policy iteration · 1.1markov decision process · 1.1
YearPublicationVenuePosition
2026 Adaptive self-supervised learning for retinal disease detection in optical coherence tomography images
Wenrui Lin, Chenao Yuan, Yunzhi Huang, Jun Xu 0005, Yuemei Luo
Neurocomputing1
2023 A Wearable Auricular Laser Acupuncture Device with IoT Sensors for Personalized Wellness Enhancement
abstract
Laser acupuncture has long been regarded as an effective and minimally intrusive practice for regulating body dysfunctions. However, there are critical gaps, notably unwearable devices and difficulty in acupoint localization without professional guidance, that impede the ability to introduce laser acupuncture therapy pervasively into telemedicine scenarios. This paper proposed a prototype wearable cyber-physical system for auricular laser acupuncture therapy that enables realtime, quantitative evaluation of treatment effectiveness. This paper also presents background research on laser acupuncture and a literature review of the most commonly used laser parameters for laser acupuncture. IoT sensors are also utilized for the real-time monitoring of physiological signals and feedback control during the telemedicine process of laser acupuncture therapy. The objective data collected by sensors along with subjective survey data are critical to assess the treatment effectiveness and provide crucial insights for personalizing the most effective laser parameters. The proposed wearable system has the potential to overcome gaps in current laser acupuncture practice and improve the customization of effective therapy in telemedicine settings.
Wenrui Lin, Guann-Pyng Li
WiMob1
2022 Age of Changed Information: Content-Aware Status Updating in the Internet of Things
abstract
In Internet of Things (IoT), the freshness of status updates is crucial for mission-critical applications. In this regard, it is suggested to quantify the freshness of updates by using Age of Information (AoI) from the receiver’s perspective. Specifically, the AoI measures the freshness over time. However, the freshness in the content is neglected. In this paper, we introduce an age-based utility, named asAge of Changed Information(AoCI), which captures both the passage of time and the change of information content. By modeling the underlying physical process as a discrete time Markov chain, we investigate the AoCI in a time-slotted status update system, where a sensor samples the physical process and transmits the update packets to the destination. With the aim of minimizing the weighted sum of the AoCI and the update cost, we formulate an infinite horizon average cost Markov Decision Process. We show that the optimal updating policy has a special structure with respect to the AoCI and identify the condition under which the special structure exists. By exploiting the special structure, we provide a low complexity relative policy iteration algorithm that finds the optimal updating policy. We further investigate the optimal policy for two special cases. In the first case where the state of the physical process transits with equiprobability, we show that optimal policy is of threshold type and derive the closed-form of the optimal threshold. We then study a more generalized periodic Markov model of the physical process in the second case. Lastly, simulation results are laid out to exhibit the performance of the optimal updating policy and its superiority over the zero-wait baseline policy.
Xijun Wang 0001, Wenrui Lin, Chao Xu 0007, Xinghua Sun, Xiang Chen 0007
IEEE Trans. Commun.2
2020 Average Age Of Changed Information In The Internet Of Things
abstract
The freshness of status updates is imperative in mission-critical Internet of things (IoT) applications. Recently, Age of Information (AoI) has been proposed to measure the freshness of updates at the receiver. However, AoI only characterizes the freshness over time, but ignores the freshness in the content. In this paper, we introduce a new performance metric, Age of Changed Information (AoCI), which captures both the passage of time and the change of information content. Also, we examine the AoCI in a time-slotted status update system, where a sensor samples the physical process and transmits the update packets with a cost. We formulate a Markov Decision Process (MDP) to find the optimal updating policy that minimizes the weighted sum of the AoCI and the update cost. Particularly, in a special case that the physical process is modeled by a two-state discrete time Markov chain with equal transition probability, we show that the optimal policy is of threshold type with respect to the AoCI and derive the closed-form of the threshold. Finally, simulations are conducted to exhibit the performance of the threshold policy and its superiority over the zero-wait baseline policy.
Wenrui Lin, Xijun Wang 0001, Chao Xu 0007, Xinghua Sun, Xiang Chen 0007
WCNC1