Jinbao Wang

Dr. Jinbao Wang

orcid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
28 October 2019 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
JWJinbao Wang
Jinbao Wang
ZCZhipeng Cai
Zhipeng Cai
JYJiguo Yu
Jiguo Yu
Enabled by the industrial Internet, intelligent transportation has made remarkable achievements such as autonomous vehicles by carnegie mellon university (CMU) Navlab, Google Cars, Tesla, etc. Autonomous vehicles benefit, in various aspects, from the cooperation of the industrial Internet and cyber-physical systems. In this process, users in autonomous vehicles submit query contents, such as service interests or user locations, to service providers. However, privacy concerns arise since the query contents are exposed when the users are enjoying the services queried. Existing works on privacy preservation of query contents rely on location perturbation or k-anonymity, and they suffer from insufficient protection of privacy or low query utility incurred by processing multiple queries for a single query content. To achieve sufficient privacy preservation and satisfactory query utility for autonomous vehicles querying services in cyber-physical systems, this article proposes a novel privacy notion of client-based personalized k-anonymity (CPkA). To measure the performance of CPkA, we present a privacy metric and a utility metric, based on which, we formulate two problems to achieve the optimal CPkA in term of privacy and utility. An approach, including two modules, to establish mechanisms which achieve the optimal CPkA is presented. The first module is to build in-group mechanisms for achieving the optimal privacy within each content group. The second module includes linear programming-based methods to compute the optimal grouping strategies. The in-group mechanisms and the grouping strategies are combined to establish optimal CPkA mechanisms, which achieve the optimal privacy or the optimal utility. We employ real-life datasets and synthetic prior distributions to evaluate the CPkA mechanisms established by our approach. The evaluation results illustrate the effectiveness and efficiency of the established mechanisms.

8 February 2018 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
JLJi Li
Ji Li
ZCZhipeng Cai
Zhipeng Cai
JWJinbao Wang
Jinbao Wang
MHMeng Han
Meng Han
YLYingshu Li
Yingshu Li
Sensor-embedded smartphones have become ubiquitous nowadays, further leveraging the popularity of mobile crowdsensing. A mobile crowdsensing platform gathers sensory data from smartphone users and makes payments to them in return. Due to the spatial correlation of sensory data in various applications, users close to each other in geographical positions usually provide similar sensory data, and it is quite an economic waste for a mobile sensing platform to buy duplicated sensory data with multiple payments to geographically close users. Unfortunately, the existing works do not take this matter into consideration. To prevent waste, our paper considers geographical position conflicting mobile crowdsensing systems in which any two users within a limited geographical distance cannot obtain payments simultaneously while participating in crowdsensing tasks. Two algorithms are proposed to select appropriate mobile crowdsensing participants and calculate the payments to them. Solid theoretical proofs are presented to demonstrate the beneficial properties of our proposed algorithms. The extensive experiment results based on real-world datasets indicate that our proposed algorithms are efficient while providing beneficial properties.

1 April 2022 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
ZCZhipeng Cai
Zhipeng Cai
XZXU ZHENG
XU ZHENG
JWJinbao Wang
Jinbao Wang
ZHZaobo He
Zaobo He
The data collected in Internet of Thing (IoT) systems (IoT data) have stimulated dramatic extension to the boundary of commercialized data statistic analysis, owing to the pervasive availability of low-cost wireless network access and off-the-shelf mobile devices. In such cases, many data consumers post their queries for urban statistic analysis in the system, like the scales of traffics, and then data contributors in IoT networks upload their contents, which can be evaluated by data brokers and responded to data consumers. However, huge volumes of devices bring large scales of data, constituting heavy burdens for data exchange. Even worse, contents in IoT systems are also sensitive as they are usually linked to private physical status of data contributors. The previous studies for IoT data trading fail to provide comprehensive estimation and pricing towards these difficulties. Therefore, this paper proposes a novel framework for the range counting trading over IoT networks by jointly considering data utility, bandwidth consumption, and privacy preservation. The range counting accumulates the number of data items falling in a concerned range of value, providing important information on the underlying data distribution. This paper first proposes a novel sampling-based method with histogram sketching for range counting estimation. The estimator is proved to be unbiased and achieves advanced performance on variance. Then the framework adopts a perturbation mechanism that can further preserve the results under differential privacy. The theoretical analysis shows that the mechanism can guarantee the privacy preservation under a given size of samples and the accuracy requirement of results. Finally, two types of pricing strategies for range counting trading are introduced for different circumstances, providing holistic consideration on how the parameters given in the estimator should be used for data trading. The framework is evaluated by estimating the air pollution levels and the traffic levels with different ranges on the 2014 CityPulse Smart City datasets. The evaluation results demonstrate that our framework can provide more accurate and reliable statistical information, with reduced bandwidth consumption and strengthened privacy preservation.

1 March 2021 in Pharmacological Research
Verified
Journal Article
Open access
YYYanan Yu
Yanan Yu
LTLu Tang
Lu Tang
FCFangyuan Cui
Fangyuan Cui
FJFuying Jiao
Fuying Jiao
DZDong Zhang
Dong Zhang
ZWzhong wang
zhong wang
An individual's level of lower limb motor function is associated with his or her disability level after stroke, and motor improvement may lead to a better prognosis and quality of life. Data from animal models show that Qizhitongluo (QZTL) capsule facilitates recovery after focal brain injury. We aimed to validate the efficacy and safety of the QZTL capsule for promoting lower limb motor recovery in poststroke patients. In this randomized, multicenter, double-blind, placebo- and active-controlled trial from 13 sites in China, participants with ischemic stroke and Fugl-Meyer motor scale (FMMS) scores of <95 were eligible for inclusion. Patients were randomly assigned in a 2:1:1 ratio to the QZTL group, Naoxintong (NXT) group or placebo group for 12 weeks at 15-28 days after the onset of stroke. The primary outcome was the change in the Lower Limb FMMS (FMMS-LL) score from baseline over the 12-week intervention period. 622 participants were randomly assigned to the QZTL group (309), NXT group (159), or placebo group (154). The FMMS-LL score increased by 4.81 points (95 % CI, 4.27-5.35) in the QZTL group, by 3.77 points (95 % CI, 3.03-4.51) in the NXT group and by 3.00 points (95 % CI, 3.03-4.51) in the placebo group at week 12. The QZTL group showed significantly larger improvements compared with the placebo group at each interview from weeks 4-12 (difference, 0.89 [0.30,1.49] at week 4, P = 0.0032; difference, 1.83[1.01,2.66] at 90 days poststroke, P < 0.0001; difference, 1.81[0.88,2.74] at week 12, P = 0.0001). The QZTL capsule is an effective treatment for lower limb motor impairment. The finding indicates that the QZTL capsule may be used as a potential new strategy for stroke rehabilitation.

16 March 2018 in IEEE Access
Verified
Journal Article
Open access
MHMeng Han
Meng Han
LLLei Li
Lei Li
YXYing Xie
Ying Xie
JWJinbao Wang
Jinbao Wang
ZDZhuojun Duan
Zhuojun Duan
MYMingyuan Yan
Mingyuan Yan
While enjoying the convenience of location-based services (LBS) in everyday life, wireless device users could also put their location privacy at risk. An untrusted LBS provider can store mobile users data on its server, track users in various ways or share users location data to the third parties. To protect LBS users privacy, many position confusion algorithms were proposed, but those algorithms often have difficulty balancing the utility-privacy tradeoffs. In this paper, we propose a new cognitive approach that enables near-complete privacy protection for LBS users by leveraging existing social network resources. We introduce a heterogeneous multi-server architecture that cuts off the direct connection between the LBS queries and the query issuers and an auction-based incentive mechanism the guaranteed user participation which is critical for the success of the proposed architecture. A simulation system and a smartphone application were developed and our evaluation results show that the proposed method can not only achieve the near-total privacy protection for LBS users, but also significantly improve the quality of the services.

3 January 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
JHJingxuan He
Jingxuan He
XHXixian Han
Xixian Han
XWXiaolong Wan
Xiaolong Wan
JWJinbao Wang
Jinbao Wang
Frequent itemset mining (FIM) and high-utility itemset mining (HUIM) are two important branches of itemset mining which is a key technology of knowledge discovery in many applications. Nowadays, there have been extensive algorithms on FIM and HUIM, but few studies consider frequency and utility together, so skyline frequent-utility itemset mining (SFUIM) is proposed to find useful itemsets with both frequency and utility measurements. Nevertheless, SFUIM is more challenging than FIM and HUIM since the search space is large and the calculation cost is expensive without any threshold, especially on large-scale databases. To address it, this paper proposes a novel prefix-based algorithm PSI* to mine skyline frequent-utility itemsets on massive data. PSI* divides the huge database by prefix-based partitioning, so that the calculation of itemsets with a specific prefix-item only involves a partition instead of the database. A multilevel-index based list is presented to compactly maintain the maximal utility under the frequency constraint, and a novel grid-based structure is devised to organize partitions or items by a designed order. Moreover, four efficient pruning strategies are proposed to prune itemsets as early as possible. Substantial experiments show that the PSI* algorithm has better performance than the state-of-the-art algorithms, obviously on large-scale databases.