Li Jie

Dr. Li Jie

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
10 March 2023 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
MWMengyuan Wang
Mengyuan Wang
HJHongbo Jiang
Hongbo Jiang
PZPing Zhao
Ping Zhao
LJLi Jie
Li Jie
JLJiangchuan Liu
Jiangchuan Liu
Schahram DustdarSchahram Dustdar
Schahram Dustdar
Spatial Crowdsourcing (SC) has been an indispensable Location-based Service where the SC server assigns tasks to workers based on the locations of task requesters and workers, raising strong privacy concerns. Limited by the computational and time complexity, existing works prefer differential privacy-based methods to protect location privacy. However, most differential privacy-based works ignore the road network, perturbing locations on two-dimensional plane, resulting in more failures in tasks and moreover extensive privacy disclosure in practice. This paper aims to implement a multi-task assignment with both high utility and efficiency while protecting the location privacy of both task requesters and workers on road networks. Specifically, we design a Road Network-aware Exponential Mechanism and propose an Obfuscated Locations Selection algorithm to guarantee location privacy of all participants and extensive privacy. Then, we propose region distance. Based on this, we further formulate multi-task assignment as a Binary Linear Programming problem and a utility-aware optimization problem. We solve the first problem to obtain optimal efficiency and then propose a utility-aware optimization algorithm for the second problem to improve the utility. Our experiments demonstrate sufficient and stable privacy guarantee and the well-performance on both utility and efficiency of our framework.

16 August 2011 in Physical Review A
Verified
Journal Article
Open access
LJLi Jie
Li Jie
TFThomas Fogarty
Thomas Fogarty
CCCecilia Cormick
Cecilia Cormick
JGJohn Goold
John Goold
TBThomas Busch
Thomas Busch
Mauro PaternostroMauro Paternostro
Mauro Paternostro
We study a system of three trapped ions in an anisotropic bidimensional trap. By focusing on the transverse modes of the ions, we show that the mutual ion-ion Coulomb interactions set entanglement of a genuine tripartite nature, to some extent persistent to the thermal nature of the vibronic modes. We tackle this issue by addressing a nonlocality test in the phase space of the ionic system and quantifying the genuine residual tripartite entanglement in the continuous variable state of the transverse modes.

8 July 2022 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
WHWenbin Huang
Wenbin Huang
KXKun Xie
Kun Xie
LJLi Jie
Li Jie
Anomalous traffic detection is a vital task in advanced Internet supervision and maintenance. To detect anomalies accurately, various data representations, such as vectors, matrices, and tensors, have been adopted to model traffic data. Among them, tensor-based methods outperform others due to their capability of capturing comprehensive correlations between complex network traffic. However, existing tensor-based algorithms remain certain shortcomings, such as working offline, cannot timely detect traffic anomalies, and high computation costs. To conquer the aforementioned deficiencies, we propose a novel sequence tensor recovery (STR) algorithm in this paper, which utilizes the results of historical tensor decomposition to achieve quick and accurate anomaly detection with low consumption when traffic data series arrive. Furthermore, we propose a dynamic sequence tensor recovery (DSTR) algorithm to improve anomaly detection accuracy by better capturing the variation over time of the comprehensive correlation of traffic data hidden in the tensor structure. The experimental results on two real traffic traces, Abilene and G $\grave{E}$ ANT, indicate the proposed STR and DSTR algorithms are superior to the state-of-the-art algorithms in terms of accuracy and computation cost.

22 February 2021 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
LJLi Jie
Li Jie
FZFanzi Zeng
Fanzi Zeng
Zhu XiaoZhu Xiao
Zhu Xiao
ZZZhirun Zheng
Zhirun Zheng
HJHongbo Jiang
Hongbo Jiang
ZLZhetao Li
Zhetao Li
The ubiquity of private vehicles with positioning services leaves a great deal of mobility data in the physical world, which supports abundant mobile applications in the Internet of Vehicles. Despite numerous desirable features that the data provide, the social relationship privacy inherent in private vehicle mobility data has gone with little notice. The relevant work that concentrates on social relation privacy either only considers the temporal and spatial features, attempts to obtain the explicit venue cooccurrence frequency statistics of mobility data, or characterizes the semantics of locations by directly matching the POI information to the location. In this paper, we propose a SEmantic-aware and Memory-Efficient scheme (SEME) for inferring social relationships from private vehicle mobility data. We determine the probability distribution of the visit purpose for each stopover location in vehicle trajectories by a probabilistic generative model with a latent variable of semantic feature vectors that embeds the semantic information, time context, and correlations. Labeling the trajectories with visit purposes, we derive a mobility feature vector for each driver with a feature learning model. Based on the mobility feature vectors, the similarity score that indicates the social connection strength can be pairwise-computed with an effective measurement, i.e., the cosine similarity. Additionally, for both scalability and computational efficiency, we convert the large-scale similarity calculation to an extended version of a maximum inner-product search problem and derive the closed-form solution of binary codes which is used to approximately solve the problem. To evaluate the performance of SEME, we conduct experiments with respect to effectiveness, efficiency, and robustness based on real-world private vehicle trajectories. The evaluation results demonstrate that our scheme improves the inference accuracy and reduces the time cost of similarity calculation.

10 May 2024 in Biomedicines
Verified
Journal Article
Open access
PDF file
PLPengyu Lei
Pengyu Lei
LJLi Jie
Li Jie
JYJizheng Yi
Jizheng Yi
WCWenjie Chen
Wenjie Chen
The distribution of adipose tissue in the lungs is intricately linked to a variety of lung diseases, including asthma, chronic obstructive pulmonary disease (COPD), and lung cancer. Accurate detection and quantitative analysis of subcutaneous and visceral adipose tissue surrounding the lungs are essential for effectively diagnosing and managing these diseases. However, there remains a noticeable scarcity of studies focusing on adipose tissue within the lungs on a global scale. Thus, this paper introduces a ConvBiGRU model for localizing lung slices and a multi-module UNet-based model for segmenting subcutaneous adipose tissue (SAT) and visceral adipose tissue (VAT), contributing to the analysis of lung adipose tissue and the auxiliary diagnosis of lung diseases. In this study, we propose a bidirectional gated recurrent unit (BiGRU) structure for precise lung slice localization and a modified multi-module UNet model for accurate SAT and VAT segmentations, incorporating an additive weight penalty term for model refinement. For segmentation, we integrate attention, competition, and multi-resolution mechanisms within the UNet architecture to optimize performance and conduct a comparative analysis of its impact on SAT and VAT. The proposed model achieves satisfactory results across multiple performance metrics, including the Dice Score (92.0% for SAT and 82.7% for VAT), F1 Score (82.2% for SAT and 78.8% for VAT), Precision (96.7% for SAT and 78.9% for VAT), and Recall (75.8% for SAT and 79.1% for VAT). Overall, the proposed localization and segmentation framework exhibits high accuracy and reliability, validating its potential application in computer-aided diagnosis (CAD) for medical tasks in this domain.

19 August 2024 in The European Physical Journal Plus
Verified
Journal Article
Closed access
PDF file
YFYanyan Feng
Yanyan Feng
SLSisi Liu
Sisi Liu
JZJian Zhou
Jian Zhou
LJLi Jie
Li Jie
WZWei Zhao
Wei Zhao
JSJinjing Shi
Jinjing Shi