Arrow Research search

Author name cluster

Yong Ding

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
1 author row

Possible papers

3

JBHI Journal 2025 Journal Article

Data Knee Pads: A Lower Limb Motion Capture System Based on Heterogeneous Sensors

  • Yong Ding
  • Tianhang Nan
  • Fujia Wang
  • Yue Zhao
  • Xiaoyu Cui

Accurate lower limb motion capture is crucial for improving performance and user experience in fields such as motion analysis, rehabilitation training, and virtual reality. Traditional motion capture systems can only provide motion information, and often face issues such as occlusion or drift due to the limitations of sensor characteristics. For this purpose, we have designed a new type of data knee pad that integrates an Inertial Measurement Unit (IMU) and five liquid metal sensors. IMU provides basic motion data, while liquid metal sensors can provide information on joint bending and muscle activity. In order to extract effective information from sensor signals, we have developed an pose estimation model. The model first uses Fast Fourier Transform (FFT) to perform time-domain and frequency-domain analysis on the signal, in order to reveal hidden features in the signal. Next, inverse FFT and feature extraction are performed using the Transformer encoder to capture key motion features in the signal. Finally, we utilize a fully connected regression network to transform the extracted features into reconstruction of lower limb movements. Our system's lower limb pose estimation performance has been validated through a series of experiments, with an average tracking error of 1. 48° for the personalized model. In addition, the ability of the system to capture muscle activity signals was also verified through experiments. Our system has achieved high-precision measurement of knee joint bending angle while capturing muscle activity signals, which other existing technologies cannot achieve. This makes our system more widely applicable in fields such as motion detection and rehabilitation evaluation of muscle diseases.

TCS Journal 2015 Journal Article

Practical (fully) distributed signatures provably secure in the standard model

  • Yujue Wang
  • Duncan S. Wong
  • Qianhong Wu
  • Sherman S.M. Chow
  • Bo Qin
  • Jianwei Liu
  • Yong Ding

A distributed signature scheme allows participants in a qualified set to jointly generate a signature which cannot be forged even when any unqualified set of participants collude together. In this paper, we propose an efficient scheme that supports any monotone access structures and show its unforgeability and robustness under the computational Diffie–Hellman (CDH) assumption in the standard model. For 192-bit security, its secret key shares and signature fragments are as short as 511 bits and 1022 bits, which are shorter than existing schemes assuming random oracle. We then propose two extensions. The first one allows new participants to dynamically join the system without any help from the dealer. The second one supports a type of multipartite access structures, where the participant set is divided into multiple disjoint groups, and each group is bounded so that a distributed signature cannot be generated unless a pre-defined number of participants from multiple groups work together. Finally, we present a fully distributed signature scheme such that the centralized trusted dealer can be removed from the system, and the secret keys (shares) can be jointly computed by the involved participants.

TCS Journal 2010 Journal Article

Solving the minimum bisection problem using a biologically inspired computational model

  • Xingchang Liu
  • Xiaofan Yang
  • Shenglin Li
  • Yong Ding

The traditional trend of DNA computing aims at solving computationally intractable problems. The minimum bisection problem (MBP) is a well-known NP-hard problem, which is intended to partition the vertices of a given graph into two equal halves so as to minimize the number of those edges with exactly one end in each half. Based on a biologically inspired computational model, this paper describes a novel algorithm for the minimum bisection problem, which requires a time cost and a DNA strand length that are linearly proportional to the instance size.

v2026.09.13