Li wenjun

Dr. Li wenjun


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
26 September 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
LWLi wenjun
Li wenjun
ZCZhenyu Chen
Zhenyu Chen
XGXingyu Gao
Xingyu Gao
WLWei Liu
Wei Liu
JWJin Wang
Jin Wang
Location estimation technology under the wireless environment has become a vital technology in the field of mobile edge computing. Especially, under the mobile edge of entire networks environment, indoor location estimation is gradually getting the interest research and application topic, due to technical constraints of GPS technology for indoor environment and the popularity of the mobile edge computing servers. In this paper, the widely used single-model framework for indoor localization is presented as an introduction, which consists of three stages: sample data collection, model building and localization estimation. And then, through analyzing of the actual scene of indoor localization, a new framework for indoor localization under mobile edge computing environment, named Multi-Model, is proposed from the theoretical perspective. It is mainly based on the observation that the environment of the sample data collection and that of localization data collection may change seriously. In order to make up for the shortcomings of this framework, two combinatorial optimization problems are proposed. Later, we discuss the NP-hardness of them in several different cases. In addition, two heuristic algorithms are given, and the performance of which are illustrated by the corresponding experimental results.

2 July 2020 in Human-centric Computing and Information Sciences
Verified
Journal Article
Open access
PDF file
LWLi wenjun
Li wenjun
YDYang Ding
Yang Ding
YYYongjie Yang
Yongjie Yang
RSR. Simon Sherratt
R. Simon Sherratt
JPJong Hyuk Park
Jong Hyuk Park
JWJin Wang
Jin Wang
Parameterized computation theory has developed rapidly over the last two decades. In theoretical computer science, it has attracted considerable attention for its theoretical value and significant guidance in many practical applications. We give an overview on parameterized algorithms for some fundamental NP-hard problems, including MaxSAT, Maximum Internal Spanning Trees, Maximum Internal Out-Branching, Planar (Connected) Dominating Set, Feedback Vertex Set, Hyperplane Cover, Vertex Cover, Packing and Matching problems. All of these problems have been widely applied in various areas, such as Internet of Things, Wireless Sensor Networks, Artificial Intelligence, Bioinformatics, Big Data, and so on. In this paper, we are focused on the algorithms’ main idea and algorithmic techniques, and omit the details of them.

24 October 2019 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
LWLi wenjun
Li wenjun
HXHuayi Xu
Huayi Xu
HLHuixi Li
Huixi Li
YYYongjie Yang
Yongjie Yang
Pradip SharmaPradip Sharma
Pradip Sharma
Saurabh SinghSaurabh Singh
Saurabh Singh

12 August 2024 in IEEE Transactions on Nanobioscience
Verified
Journal Article
Closed access
XTXiwei Tang
Xiwei Tang
YZYiqiang Zhou
Yiqiang Zhou
MYMengyun Yang
Mengyun Yang
LWLi wenjun
Li wenjun
Bioinformatics is a rapidly growing field involving the application of computational methods to the analysis and interpretation of biological data. An important task in bioinformatics is the identification of novel drug-target interactions (DTIs), which is also an important part of the drug discovery process. Most computational methods for predicting DTI consider it as a binary classification task to predict whether drug target pairs interact with each other. With the increasing amount of drug-target binding affinity data in recent years, this binary classification task can be transformed into a regression task of drug-target affinity (DTA), which reflects the degree of drug-target binding and can provide more detailed and specific information than DTI, making it an important tool in drug discovery through virtual screening. Effectively predicting how compounds interact with targets can help speed up the drug discovery process. In this study, we propose a deep learning model called TC-DTA for the prediction of the DTA, which makes use of the convolutional neural networks (CNN) and encoder module of the transformer architecture. First, the raw drug SMILES strings and protein amino acid sequences are extracted from the dataset. These are then represented using different encoding methods. We then use CNN and the Transformer’s encoder module to extract feature information from drug SMILES strings and protein amino acid sequences, respectively. Finally, the feature information obtained is concatenated and fed into a multi-layer perceptron for prediction of the binding affinity score. We evaluated our model on two benchmark DTA datasets, Davis and KIBA, against methods including KronRLS, SimBoost and DeepDTA. On evaluation metrics such as Mean Squared Error, Concordance Index and r2m index, TC-DTA outperforms these baseline methods. These results demonstrate the effectiveness of the Transformer’s encoder and CNN in the extraction of meaningful representations from sequences, thereby improving the accuracy of DTA prediction. The deep learning model for DTA prediction can accelerate drug discovery by identifying drug candidates with high binding affinity to specific targets. Compared to traditional methods, the use of machine learning technology allows for a more effective and efficient drug discovery process.

1 January 2021 in SIAM Journal on Discrete Mathematics
Verified
Journal Article
Closed access
GRGuozhen Rong
Guozhen Rong
LWLi wenjun
Li wenjun
JWJianxin Wang
Jianxin Wang
YYYongjie Yang
Yongjie Yang
In 1990, Hendry conjectured that all Hamiltonian chordal graphs are cycle extendable. After a series of papers confirming the conjecture for a number of graph classes, the conjecture is yet refuted by Lafond and Seamone in 2015. Given that their counterexamples are not strongly chordal graphs and they are all only 2-connected, Lafond and Seamone asked the following two questions: (1) Are Hamiltonian strongly chordal graphs cycle extendable? (2) Is there an integer $k$ such that all $k$-connected Hamiltonian chordal graphs are cycle extendable? Later, a conjecture stronger than Hendry's is proposed. In this paper, we resolve all these questions in the negative. On the positive side, we add to the list of cycle-extendable graphs two more graph classes, namely, Hamiltonian 4-fan-free chordal graphs, where every induced $K_5 - e$ has true twins, and Hamiltonian $\{4{\sc -fan}, \overline{A} \}$-free chordal graphs.

19 September 2022 in IEEE Transactions on Neural Systems and Rehabilitation Engineering
Verified
Journal Article
Open access
LKLi–Dan Kuang
Li–Dan Kuang
QLQiu-Hua Lin
Qiu-Hua Lin
XGXiao-Feng Gong
Xiao-Feng Gong
Jianming ZhangJianming Zhang
Jianming Zhang
LWLi wenjun
Li wenjun
VCVince Calhoun
Vince Calhoun
Complex-valued shift-invariant canonical polyadic decomposition (CPD) under a spatial phase sparsity constraint (pcsCPD) shows excellent separation performance when applied to band-pass filtered complex-valued multi-subject fMRI data. However, some useful information may also be eliminated when using a band-pass filter to suppress unwanted noise. As such, we propose an alternating rank- ${R}$ and rank-1 least squares optimization to relax the CPD model. Based upon this optimization method, we present a novel constrained CPD algorithm with temporal shift-invariance and spatial sparsity and orthonormality constraints. More specifically, four steps are conducted until convergence for each iteration of the proposed algorithm: 1) use rank- ${R}$ least-squares fit under spatial phase sparsity constraint to update shared spatial maps after phase de-ambiguity; 2) use orthonormality constraint to minimize the cross-talk between shared spatial maps; 3) update the aggregating mixing matrix using rank- ${R}$ least-squares fit; 4) utilize shift-invariant rank-1 least-squares on a series of rank-1 matrices reconstructed by each column of the aggregating mixing matrix to update shared time courses, and subject-specific time delays and intensities. The experimental results of simulated and actual complex-valued fMRI data show that the proposed algorithm improves the estimates for task-related sensorimotor and auditory networks, compared to pcsCPD and tensorial spatial ICA. The proposed alternating rank- ${R}$ and rank-1 least squares optimization is also flexible to improve CPD-related algorithm using alternating least squares.