Tianxi Ji

Tianxi Ji

Auto-generated profile, based on publicly available information

Tianxi Ji

Department of Computer Science, Texas Tech University, Lubbock, TX, USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
29 September 2020 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
YGYifan Guo
Yifan Guo
TJTianxi Ji
Tianxi Ji
Qianlong WangQianlong Wang
Qianlong Wang
LYLixing Yu
Lixing Yu
Geyong  MinGeyong Min
Geyong Min
PLPan Li
Pan Li
Anomaly detection is a critical problem in the Internet of Things (IoT) systems due to its wide applications for smart cities, like quality control in manufacturing, intrusion detection in system security, fault detection in system monitoring. Many existing anomaly detection schemes are problem specific and supervised approaches, which require domain knowledge and tremendous data labeling efforts. This paper investigates unsupervised anomaly detection on multidimensional time series data in IoT systems, and develops a GRU-based Gaussian Mixture VAE scheme called GGM-VAE. In particular, we employ Gated Recurrent Unit (GRU) cells to discover the correlations among time series data, and use Gaussian Mixture priors in the latent space to characterize the multimodal data. A few previous works assume simple distributions for Gaussian Mixture priors, resulting in insufficient ability to fully capture the data patterns. To overcome this issue, we design a model selection mechanism during the training process under the guidance of Bayesian Inference Criterion (BIC) to find the model which can well estimate the distribution in the Gaussian Mixture latent space. We conduct extensive simulations on four public datasets and observe that our proposed scheme outperforms state-of-the-art anomaly detection schemes and achieves up to 47.88% improvement in F1 scores on average.

5 January 2021 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
TJTianxi Ji
Tianxi Ji
YGYifan Guo
Yifan Guo
Qianlong WangQianlong Wang
Qianlong Wang
XWXufei Wang
Xufei Wang
PLPan Li
Pan Li
Most UAVs depend on realtime 3D point clouds to navigate through unknown environments. However, both point clouds processing and trajectory planning are computationally expensive and will deplete UAV's battery quickly. There are also inevitable uncertainties in point clouds, which further makes collision-free trajectory planning a very challenging problem. To address these issues, we propose an energy-efficient and cloud-assisted autonomous navigation system, called ECONOMY, which allows an UAV to transmit the point clouds through a cellular network to a computing cloud that plans the trajectories for the UAV in realtime. To maximize the UAV's energy-efficiency, we jointly optimize its velocity, transmission and reception power. Since the formulated problem is non-convex, we decompose it into a UAV velocity and trajectory optimization problem at a specific time t, and a UAV communication optimization problem at t, which are, in turn, resolved by an intelligent solver based on the Suggest-and-Improve framework, and coordinate gradient ascend. To address point clouds uncertainties, we devise probabilistic collision-free constraints which can be handled in a deterministic manner by exploiting the tight (N,2,R^N)-upper bound for convex sets. Simulation results on an UAV exploring a simulated urban environment demonstrate the efficacy of ECONOMY and its superiority over baseline systems.

18 July 2022 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
TJTianxi Ji
Tianxi Ji
EAErman Ayday
Erman Ayday
EYEmre Yilmaz
Emre Yilmaz
PLPan Li
Pan Li
Database fingerprinting is widely adopted to prevent unauthorized data sharing and identify the source of data leakages. Although existing schemes are robust against common attacks, their robustness degrades significantly if attackers utilize inherent correlations among database entries. In this paper, we demonstrate the vulnerability of existing schemes by identifying different correlation attacks: column-wise correlation attack, row-wise correlation attack, and their integration. We provide robust fingerprinting against these attacks by developing mitigation techniques, which can work as post-processing steps for any off-the-shelf database fingerprinting schemes and preserve the utility of databases. We investigate the impact of correlation attacks and the performance of mitigation techniques using a real-world database. Our results show (i) high success rates of correlation attacks against existing fingerprinting schemes (e.g., integrated correlation attack can distort 64.8% fingerprint bits by just modifying 14.2% entries in a fingerprinted database), and (ii) high robustness of mitigation techniques (e.g., after mitigation, integrated correlation attack can only distort 3% fingerprint bits). Additionally, the mitigation techniques effectively alleviate correlation attacks even if (i) attackers have access to correlation models directly computed from the original database, while the database owner uses inaccurate correlation models, (ii) or attackers utilize higher order of correlations than the database owner.

31 March 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
Qianlong WangQianlong Wang
Qianlong Wang
YGYifan Guo
Yifan Guo
TJTianxi Ji
Tianxi Ji
XWXufei Wang
Xufei Wang
BHBingfang Hu
Bingfang Hu
PLPan Li
Pan Li
The coronavirus disease 2019 (COVID-19) has rapidly become a significant public health emergency all over the world since it was first identified in Wuhan, China, in December 2019. Until today, massive disease-related data have been collected, both manually and through the Internet of Medical Things (IoMT), which can be potentially used to analyze the spread of the disease. On the other hand, with the help of IoMT, the analysis results of the current status of COVID-19 can be delivered to people in real time to enable situational awareness, which may help mitigate the disease spread in communities. However, current accessible data on COVID-19 are mostly at a macrolevel, such as for each state, county, or metropolitan area. For fine-grained areas, such as for each city, community, or geographical coordinate, COVID-19 data are usually not available, which prevents us from obtaining information on the disease spread in closer neighborhoods around us. To address this problem, in this article, we propose a two-level risk assessment system. In particular, we define a “risk index.” Then, we develop a risk assessment model, called MK-DNN, by taking advantage of the multikernel density estimation (MKDE) and deep neural network (DNN). We train MK-DNN at the macrolevel (for each metro area), which subsequently enables us to obtain the risk indices at the microlevel (for each geographic coordinate). Moreover, a heuristic validation method is further designed to help validate the obtained microlevel risk indices. Simulations conducted on real-world data demonstrate the accuracy and validity of our proposed risk assessment system.

6 March 2022 in arXiv
Verified
Preprint
Open access
PDF file
TJTianxi Ji
Tianxi Ji
EAErman Ayday
Erman Ayday
EYEmre Yilmaz
Emre Yilmaz
PLPan Li
Pan Li
When sharing sensitive relational databases with other parties, a database owner aims to (i) have privacy guarantees for the database entries, (ii) have liability guarantees (via fingerprinting) in case of unauthorized sharing of its database by the recipients, and (iii) provide a high quality (utility) database to the recipients. We observe that sharing a relational database with privacy and liability guarantees are orthogonal objectives. The former can be achieved by injecting noise into the database to prevent inference of the original data values, whereas, the latter can be achieved by hiding unique marks inside the database to trace malicious parties (data recipients) who redistribute the data without the authorization. We achieve these two objectives simultaneously by proposing a novel entry-level differentially-private fingerprinting mechanism for relational databases. At a high level, the proposed mechanism fulfills the privacy and liability requirements by leveraging the randomization nature that is intrinsic to fingerprinting and achieves desired entry-level privacy guarantees. To be more specific, we devise a bit-level random response scheme to achieve differential privacy guarantee for arbitrary data entries when sharing the entire database, and then, based on this, we develop an $\epsilon$-entry-level differentially-private fingerprinting mechanism. Next, we theoretically analyze the relationships between privacy guarantee, fingerprint robustness, and database utility by deriving closed form expressions. The outcome of this analysis allows us to bound the privacy leakage caused by attribute inference attack and characterize the privacy-utility coupling and privacy-fingerprint robustness coupling. Furthermore, we also propose a SVT-based solution to control the cumulative privacy loss when fingerprinted copies of a database are shared with multiple recipients.