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

Guopeng Wang

dblp:119/2661 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
6since 2021 · last 2025
0000-0002-5947-3131ORCID · corroborated

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

Computer networks · 3 · 3 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 3 since 2021Systems, architecture and hardware · 1 · 1 first-authorHuman-computer interaction and ubiquitous 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.

Artificial intelligence
1 paper
Robot manipulation · 56% Legged, aerial and field robots · 44%

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

TopicWeightPapersLastEvidence papers
Robotics › Legged, aerial and field robots › limbless locomotion
crawling robot
0.612022
Origami-Inspired Soft Actuators for Stimulus Perception and Crawling Robot Applications · IEEE Trans. Robotics 2022
Robotics › Robot manipulation
soft robotics
0.612022
Origami-Inspired Soft Actuators for Stimulus Perception and Crawling Robot Applications · IEEE Trans. Robotics 2022
Robotics › Robot manipulation › actuator design
pneumatic actuation
0.212022
Origami-Inspired Soft Actuators for Stimulus Perception and Crawling Robot Applications · IEEE Trans. Robotics 2022

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

kresling origami design · 0.6
YearPublicationVenuePosition
2025 A blockchain-oriented covert communication technology with controlled security level based on addressing confusion ciphertext
Lejun Zhang, Zhujun Wang 0003, Guopeng Wang, Jing Qiu 0002, Shen Su, Yuan Liu 0002, Guangxia Xu, Zhihong Tian 0001, Sergey Gataullin
Frontiers Comput. Sci.5
2024 A Secure and Efficient Privacy Data Aggregation Mechanism
Wenshuo Ma, Kan Yu 0001, Chuanwen Luo, Guopeng Wang, Xiaowu Liu
WASA (2)5
2024 3D Physical Layer Secure Transmission for UAV-Assisted Mobile Communications Without Locations of Eavesdroppers
Wenlu Yu, Xin Fan 0004, Guopeng Wang, Guangkai Li, Chuanwen Luo, Yi Hong 0003, Ting Chen 0002
WASA (2)4
2023 M2SH: A Hybrid Approach to Table Structure Recognition using Two-Stage Multi-Modality Feature Fusion
abstract
Automatically recovering the original structure of tables from unstructured images is a challenging task, combining techniques from computer vision (CV) and natural language processing (NLP). Unfortunately, common feature extraction methods, naive fusion strategies, and rigid inductive biases have become roadblocks to the effective improvement of previous approaches. Distinguished from other modes of data representation, tables consist of many dispersed cells that are interdependent. Therefore, in this paper, we aim to propose a novel approach for recognizing table structures by mining the special properties of tables. The method begins by utilizing the adaptive fusion method to fuse visual and textual features acquired through a two-stream network. In the second stage, the layout features will be seamlessly integrated using a Kronecker-based strategy. The table elements with multi-modality features are then modeled based on spatial relationships. Interactions among them are established by a hybrid contextual aggregator that allows message passing at both local and global levels. Finally, table structure recognition is achieved by predicting the relationship between elements. We meticulously evaluate the proposed approach on various public datasets, including ICDAR2013, UNLV, WTW, SciTSR, and SciTSR-COMP, as well as a more complicated private dataset. The proposed method performs excellently on these datasets.
Zhihan Ning, Guopeng Wang, Yingjie Bai, David Zhang 0001
SMC4
2023 A covert channel over blockchain based on label tree without long waiting times
Zhujun Wang 0003, Lejun Zhang, Guopeng Wang, Jing Qiu 0002, Shen Su, Yuan Liu 0002, Guangxia Xu, Zhihong Tian 0001
Comput. Networks4
2022 Origami-Inspired Soft Actuators for Stimulus Perception and Crawling Robot Applications
abstract
Origami has been proved as a valuable tool to develop deployable, multifunctional, and tunable devices for diverse engineering applications. Inspired by the Kresling origami, this article presents a soft pneumatic actuator with vacuum control to realize the compound motion of twist and contraction. The twist direction varies as the crease angle changes and it offers pure contraction after combining two actuators with reverse creases. Our actuator can lift 180 folds of its weight and achieve the contraction ratio of 47%, while the response time is below 0.3 s. The origami-based actuator can realize an adjustable bistable property, leading to the possibility for external stimulus detection and mechanical memory devices, where the sensitivity can be regulated by the initial vacuum pressure. Through several actuators, we demonstrate the reconfigurable crawling robots capable of worm-like creep, alternating-step locomotion as well as obstacle detection. After activating all the actuators, the four-actuator robot with two working modes is validated to perform agilely for confined space navigation, showing our actuator has the potential in soft robotics applications.
Long Li 0009, Tianhong Wang 0004, Guopeng Wang, Jianguo Cai, Yingzhong Tian
IEEE Trans. Robotics4
2012 Self-Aligning Return Address Stack
abstract
Return-Address Stack (RAS) has been widely used in modern high-performance microprocessor to predict the return address of a routine. But speculative execution frequently corrupts the RAS, making repair mechanisms necessary. In this paper, based on analysis of RAS activities after misprediction and current RAS repair mechanisms, an effective return address prediction structure called Self-Aligning Return-Address Stack (SARAS) is proposed. SARAS is composed of a classical RAS, a self-aligning queue and a top-of-stack counter. The self-aligning queue records the contents popped from RAS for recovery. The top-of-stack counter tracks the latest correct position of the top-of-stack pointer. The experiment results show that SARAS can reduces hardware-cost and enhances prediction accuracy, with a 32-entry stack, the average prediction accuracy of SARAS is nearly 100%, improving performance by 3.91% up to 11.27% over the conventional checkpointing repair mechanisms for RAS. At the same hardware budget, this speedup is even higher.
Guopeng Wang, Xiangdong Hu
NAS1