Jia Cao

Jia Cao


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
27 November 2022 in Sensors
Verified
Journal Article
Open access
PDF file
宁刘宁 刘
宁 刘
CLChuanwen Luo
Chuanwen Luo
JCJia Cao
Jia Cao
YHYi Hong
Yi Hong
ZCZhibo Chen
Zhibo Chen
This paper considers a laser-powered unmanned aerial vehicle (UAV)-enabled wireless power transfer (WPT) system. In the system, a UAV is dispatched as an energy transmitter to replenish energy for battery-limited sensors in a wireless rechargeable sensor network (WRSN) by transferring radio frequency (RF) signals, and a mobile unmanned vehicle (MUV)-loaded laser transmitter travels on a fixed path to charge the on-board energy-limited UAV when it arrives just below the UAV. Based on the system, we investigate the trajectory optimization of laser-charged UAVs for charging WRSNs (TOLC problem), which aims to optimize the flight trajectories of a UAV and the travel plans of an MUV cooperatively to minimize the total working time of the UAV so that the energy of every sensor is greater than or equal to the threshold. Then, we prove that the problem is NP-hard. To solve the TOLC problem, we first propose the weighted centered minimum coverage (WCMC) algorithm to cluster the sensors and compute the weighted center of each cluster. Based on the WCMC algorithm, we propose the TOLC algorithm (TOLCA) to design the detailed flight trajectory of a UAV and the travel plans of an MUV, which consists of the flight trajectory of a UAV, the hovering points of a UAV with the corresponding hovering times used for the charging sensors, the hovering points of a UAV with the corresponding hovering times used for replenishing energy itself, and the hovering times of a UAV waiting for an MUV. Numerical results are provided to verify that the suggested strategy provides an effective method for supplying wireless rechargeable sensor networks with sustainable energy.

1 January 2016 in Evidence-Based Complementary and Alternative Medicine
Verified
Journal Article
Open access
PDF file
JCJia Cao
Jia Cao
Prescription patterns are rules or regularities used to generate, recognize, or judge a prescription. Most of existing studies focused on the specific prescription patterns for diverse diseases or syndromes, while little attention was paid to the common patterns, which reflect the global view of the regularities of prescriptions. In this paper, we designed a method CPPM to find the common prescription patterns. The CPPM is based on the hierarchical clustering of herb‐pair efficacies (HPEs). Firstly, HPEs were hierarchically clustered; secondly, the individual herbs are labeled by the HPEC (the clusters of HPEs); and then the prescription patterns were extracted from the combinations of HPEC; finally the common patterns are recognized statistically. The results showed that HPEs have hierarchical clustering structure. When the clustering level is 2 and the HPEs were classified into two clusters, the common prescription patterns are obvious. Among 332 candidate prescriptions, 319 prescriptions follow the common patterns. The description of the patterns is that if a prescription contains the herbs of the cluster (C1), it is very likely to have other herbs of another cluster (C2); while a prescription has the herbs of C2, it may have no herbs of C1. Finally, we discussed that the common patterns are mathematically coincident with the Blood‐Qi theory.

7 January 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
BJBo Jiang
Bo Jiang
JCJia Cao
Jia Cao
Entity and relation extraction (ERE) is a core task in information extraction. This task has always faced the overlap problem. It was found that heterogeneous graph attention networks could enhance semantic analysis and fusion between entities and relations to improve the ERE performance in our previous work. In this paper, an entity and relation heterogeneous graph attention network (ERHGA) is proposed for joint ERE. A heterogeneous graph attention network with a gate mechanism was constructed containing word nodes, subject nodes, and relation nodes to learn and enhance the embedding of parts for relational triple extraction. The ERHGA was evaluated on the public relation extraction dataset named WebNLG. The experimental results demonstrate that the ERHGA, by taking subjects and relations as a priori information, can effectively handle the relational triple extraction problem and outperform all baselines to 93.3%, especially overlapping relational triples.


1 June 2015
Verified
Journal Article
Closed access
JCJia Cao
Jia Cao
JXJuan-Juan Xin
Juan-Juan Xin
YWYun Wang
Yun Wang

1 July 2014
Verified
Journal Article
Closed access
YHYa-Nan Hu
Ya-Nan Hu
YRYing-Long Ren
Ying-Long Ren
JCJia Cao
Jia Cao
MWMei Wang
Mei Wang
YWYun Wang
Yun Wang
YQYanjiang Qiao
Yanjiang Qiao