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.

Xuhang Chen 0001

dblp:308/1093-1 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2023
—ORCID · conflict

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

Systems, architecture and hardware · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 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 architecture, parallel and distributed computing, and storage systems
2 papers
Memory systems · 62% Hardware accelerators and domain-specific architectures · 38%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures
graph processing accelerator
1.122022
Accelerating Graph-Connected Component Computation With Emerging Processing-In-Memory Architecture · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Triangle Counting Accelerations: From Algorithm to In-Memory Computing Architecture · IEEE Trans. Computers 2022
Memory systems
processing-in-memory
1.122022
Accelerating Graph-Connected Component Computation With Emerging Processing-In-Memory Architecture · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Triangle Counting Accelerations: From Algorithm to In-Memory Computing Architecture · IEEE Trans. Computers 2022
Graph algorithms and graph theory › graph connectivity
connected components
0.612022
Accelerating Graph-Connected Component Computation With Emerging Processing-In-Memory Architecture · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Graph algorithms and graph theory
graph connectivity
0.612022
Accelerating Graph-Connected Component Computation With Emerging Processing-In-Memory Architecture · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Memory systems
non-volatile memory
0.322022
Accelerating Graph-Connected Component Computation With Emerging Processing-In-Memory Architecture · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Triangle Counting Accelerations: From Algorithm to In-Memory Computing Architecture · IEEE Trans. Computers 2022
Memory systems › non-volatile memory › magnetic random access memory
STT-MRAM
0.322022
Accelerating Graph-Connected Component Computation With Emerging Processing-In-Memory Architecture · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Triangle Counting Accelerations: From Algorithm to In-Memory Computing Architecture · IEEE Trans. Computers 2022

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

bitwise logical operations · 1.1algorithm-architecture co-design · 1.1graph compression · 0.6bitwise logic reformulation · 0.6algorithm-architecture co-optimization · 0.6
YearPublicationVenuePosition
2023 WMNN: Wearables-Based Multi-Column Neural Network for Human Activity Recognition
abstract
In recent years, human activity recognition (HAR) technologies in e-health have triggered broad interest. In literature, mainstream works focus on the body's spatial information (i.e. postures) which lacks the interpretation of key bioinformatics associated with movements, limiting the use in applications requiring comprehensively evaluating motion tasks' correctness. To address the issue, in this article, a Wearables-based Multi-column Neural Network (WMNN) for HAR based on multi-sensor fusion and deep learning is presented. Here, the Tai Chi Eight Methods were utilized as an example as in which both postures and muscle activity strengths are significant. The research work was validated by recruiting 14 subjects in total, and we experimentally show 96.9% and 92.5% accuracy for training and testing, for a total of 144 postures and corresponding muscle activities. The method is then provided with a human-machine interface (HMI), which returns users with motion suggestions (i.e. postures and muscle strength). The report demonstrates that the proposed HAR technique can enhance users' self-training efficiency, potentially promoting the development of the HAR area.
Chenyu Tang, Xuhang Chen 0001, Luigi G. Occhipinti, Shuo Gao 0001
IEEE J. Biomed. Health Informatics2
2022 An IoT and Wearables-Based Smart Home for ALS Patients
abstract
In recent years, assistive wearables technologies based on Internet of Things (IoT) platforms for amyotrophic lateral sclerosis (ALS) patients trigger broad interests. Nevertheless, the user privacy leakage issue, owing to the scene camera installed on wearables to analyze environmental information, hinders further success use for ALS patients. To address this issue, in this article, a smart human-environment interactive (HEI) environment, including eye motion detection, radio-frequency identification (RFID), and speech feedback techniques, under the IoT framework is presented. Here, the users’ intentions are first interpreted by the eye motion classification, and then the target smart devices are reported and desired operations are confirmed by the RFID and speech feedback system in a hand-shaking manner. A high average accuracy of 93.2% is experimentally achieved, demonstrating the feasibility of the proposed method in obtaining satisfying performance while avoiding potential privacy leakage.
Xuhang Chen 0001, Zhe Fu 0004, Zhiying Song, Ajeck M. Ndifson, Zhiwei Su, Shuo Gao 0001
IEEE Internet Things J.1
2022 Triangle Counting Accelerations: From Algorithm to In-Memory Computing Architecture
abstract
Triangles are the basic substructure of networks and triangle counting (TC) has been a fundamental graph computing problem in numerous fields such as social network analysis. Nevertheless, like other graph computing problems, due to the high memory-computation ratio and random memory access pattern, TC involves a large amount of data transfers thus suffers from the bandwidth bottleneck in the traditional Von-Neumann architecture. To overcome this challenge, in this paper, we propose to accelerate TC with the emerging processing-in-memory (PIM) architecture through an algorithm-architecture co-optimization manner. To enable the efficient in-memory implementations, we come up to reformulate TC with bitwise logic operations (such as AND), and develop customized graph compression and mapping techniques for efficient data flow management. With the emerging computational Spin-Transfer Torque Magnetic RAM (STT-MRAM) array, which is one of the most promising PIM enabling techniques, the device-to-architecture co-simulation results demonstrate that the proposed TC in-memory accelerator outperforms the state-of-the-art GPU and FPGA accelerations by 12.2x and 31.8x, respectively, and achieves a 34x energy efficiency improvement over the FPGA accelerator.
Jianlei Yang 0001, Yinglin Zhao, Xiaotao Jia, Rong Yin 0001, Xuhang Chen 0001, Gang Qu 0001, Weisheng Zhao 0001
IEEE Trans. Computers6
2022 Accelerating Graph-Connected Component Computation With Emerging Processing-In-Memory Architecture
abstract
Computing the connected component (CC) of a graph is a basic graph computing problem, which has numerous applications like graph partitioning and pattern recognition. Existing methods for computing CC suffer from memory wall problems because of the frequent data transmission between CPU and memory. To overcome this challenge, in this article, we propose to accelerate CC computation with the emerging processing-in-memory (PIM) architecture through an algorithm–architecture co-design manner. The innovation lies in computing CC with bitwise logical operations (such as AND and OR), and the customized data flow management methods to accelerate computation and reduce energy consumption. As a proof of concept, experimental results with computational spin-transfer torque magnetic RAM (STT-MRAM) arrays demonstrate on average$19.8\times $and$12.4\times $speedups compared with the CPU and GPU implementations, and a$35.4 \times $energy efficiency improvement over the CPU implementation. Moreover, we investigate the potential associations between graph computing and bitwise Boolean logic, which could help design more general in-memory graph computing accelerators in the future.
Xuhang Chen 0001, Xiaotao Jia, Jianlei Yang 0001, Gang Qu 0001, Weisheng Zhao 0001
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1