Qing Li 0022

dblp:181/2689-22 · DBLP profile ↗
← Back
19ranked-venue papers
11as first author
10since 2021 · last 2025
0000-0001-6350-0502ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 3 first-author · 2 since 2021Databases, data management, data science and information retrieval · 6 · 3 first-author · 4 since 2021Applied, interdisciplinary, general and emerging computing · 4 · 3 first-author · 2 since 2021Systems, architecture and hardware · 3 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
YearPublicationVenuePosition
2025 Explainable reasoning over temporal knowledge graphs by pre-trained language model
Qing Li 0022, Guanzhong Wu
Inf. Process. Manag.1
2025 Dual-Centralized Q-Network-Based Reinforcement Learning for Cooperative Path Planning of Multiple UAVs
Jinchao Chen, Chongde Ren, Yujiao Hu, Ying Zhang 0060, Yantao Lu, Qing Li 0022, Tao You, Joel J. P. C. Rodrigues
IEEE Trans. Intell. Transp. Syst.6
2025 Non-Preemptive Scheduling of Periodic Tasks with Data Dependencies in Heterogeneous Multiprocessor Embedded Systems
abstract
Heterogeneous multiprocessor architecture is frequently employed as an economical and efficient means of providing excellent parallel processing capabilities while keeping production cost and power consumption under control. Although this architecture achieves significant performance enhancement and cost reduction, it results in a serious task allocation and scheduling problem, especially for periodic tasks with data dependencies, all of which should be reasonably scheduled and executed in a timely manner such that their deadlines and dependence requirements could be satisfied even if the worst happens. In this article, we concentrate on the non-preemptive scheduling problem of periodic tasks with data dependencies upon heterogeneous multiprocessor platforms. First, with models of data-dependent tasks and heterogeneous processors, we analyze the time, space, precedence, and data dependence constraints of tasks and design an exact formulation based on the mixed integer linear programming to completely explore the solution space and produce the optimal solutions. Then, by constructing a directed acyclic graph to depict the dependence relationship of jobs generated by tasks, we propose an efficient off-line list-based scheduling algorithm to provide a reasonable time and processor allocation for each job, with a view to minimizing the completion time of jobs. Experiments with randomly generated tasks are performed to evaluate the effectiveness and efficiency of the proposed algorithm, and the experimental results show that our algorithm can averagely enhance the scheduling success ratio by 28.5%, and, respectively, reduce the task completion time and the deviation ratio by 23.3% and 17.2%, on average.
Jinchao Chen, Ying Zhang 0060, Yantao Lu, Qing Li 0022, Qiuhao Shu
ACM Trans. Design Autom. Electr. Syst.5
2024 BioDynGrap: Biomedical event prediction via interpretable learning framework for heterogeneous dynamic graphs
Qing Li 0022, Tao You, Jinchao Chen, Ying Zhang 0060, Chenglie Du
Expert Syst. Appl.1
2024 TransLSTD: Augmenting hierarchical disease risk prediction model with time and context awareness via disease clustering
Tao You, Qiaodong Dang, Qing Li 0022, Guanzhong Wu
Inf. Syst.3
2024 Anomaly detection with dual-channel heterogeneous graph based on hypersphere learning
Qing Li 0022, Guanzhong Wu, Hang Ni, Tao You
Inf. Sci.1
2024 NHGMI: Heterogeneous graph multi-view infomax with node-wise contrasting samples selection
Qing Li 0022, Hang Ni, Yuanchun Wang 0002
Knowl. Based Syst.1
2024 LI-EMRSQL: Linking Information Enhanced Text2SQL Parsing on Complex Electronic Medical Records
abstract
Converting natural language text into executable SQL queries significantly impacts the healthcare domain, specifically when applied to electronic medical records. Given that electronic medical records store extensive patient information in a relational multitable database, developing a Text-to-SQL parser would enable the correlation of intricate medical terminology through semantic parsing. A major challenge is designing a versatile Text2SQL parser applicable to new databases. A critical step towards this goal involves schema linking - accurately identifying references to previously unseen columns or tables during SQL creation. In response to these key challenges, we propose a novel framework—Linking Information Enhanced Text2SQL Parsing on Complex Electronic Medical Records (LI-EMRSQL). This model leverages the Poincaré distance metric detection procedure, utilizing induced relations to enhance the performance of pre-existing graph-based parsers and improve schema linkage. To enhance the generalizability of LI-EMRSQL, the detection process is completely unsupervised and does not necessitate additional parameters. On two conventional Text2SQL datasets and two EMRs Text2SQL datasets, the system delivers SOTA performance. Furthermore, notable enhancements in the model's comprehension and alignment of schemas are observed.
Qing Li 0022, Tao You, Jinchao Chen, Ying Zhang 0060, Chenglie Du
IEEE Trans. Reliab.1
2023 PAGCL: An unsupervised graph poisoned attack for graph contrastive learning model
Qing Li 0022
Future Gener. Comput. Syst.1
2022 BioKnowPrompt: Incorporating imprecise knowledge into prompt-tuning verbalizer with biomedical text for relation extraction
Qing Li 0022, Tao You, Yantao Lu
Inf. Sci.1
2020 Real-time sepsis severity prediction on knowledge graph deep learning networks for the intensive care unit
Qing Li 0022, L. Frank Huang
J. Vis. Commun. Image Represent.1
2020 A comprehensive exploration of semantic relation extraction via pre-trained CNNs
Qing Li 0022, Qi Li 0025
Knowl. Based Syst.1
2020 A Comprehensive Exploration on Spider with Fuzzy Decision Text-to-SQL Model
abstract
The challenge of natural language processing is from natural language to logical form (SQL). In this article, we present an fuzzy semantic to structured query language (F-SemtoSql) neural approach that is a fuzzy decision semantic deep network query model based on demand aggregation. It aims to address the problem of the complex and cross-domain text-to-SQL generation task. The corpus is trained as the input word vector of the model with LSTM and Word2Vec embedding technology. Combined with the dependency graph method, the problem of SQL statement generation is converted to slot filling. Complex tasks are divided into four levels via F-SemtoSql and constructed by the need of aggregation. At the same time, to avoid the order problem in the traditional model effectively, we have adopted the attention mechanism and used a fuzzy decision mechanism to improve the model decision. On the challenging text-to-SQL benchmark Spider and the other three datasets, F-SemtoSql achieves faster convergence and occupies the first position.
Qing Li 0022, Qi Li 0025
IEEE Trans. Ind. Informatics1
2019 Data-driven Discovery of a Sepsis Patients Severity Prediction in the ICU via Pre-training BiLSTM Networks
abstract
Sepsis is the third-highest mortality disease in intensive care units(ICU) and expensive treatment costs, but the best treatment strategy remains uncertain. In this paper, we proposed a pre-training bidirectional LSTM Networks to predict the Sepsis severity of patients in ICU. Most previous models for severity prediction rely on the multi-task recurrent neural networks. In addition, state-of-the-art neural models based on attention mechanisms do not fully utilize information of organ systems that may be the most crucial features for severity prediction. To address these issues, we propose an end-to-end recurrent neural model which incorporates simultaneously analyses different organ systems and intuitively reflect the condition of the patients in a timely fashion. Specifically, we apply a pre-training technique in our model to combines it with labeled data via multi-task learning. Experimental results on the real-world clinical dataset (MIMIC-III), one of the most popular sepsis severity prediction tasks, demonstrate that our model outperforms existing state-of-the-art models.
Qing Li 0022, L. Frank Huang, Qi Li 0025
BIBM1
2019 Enhancing Network Embedding with Implicit Clustering
Qi Li 0025, Qing Li 0022, Zehong Cao, Chen Wang 0074
DASFAA (1)3
2019 DETER: Streaming Graph Partitioning via Combined Degree and Cluster Information
Qi Li 0025, Qing Li 0022
ICA3PP (1)4
2019 Graph representation learning with encoding edges
Qi Li 0025, Zehong Cao, Qing Li 0022
Neurocomputing4
2019 A neural model for type classification of entities for text
Qi Li 0025, JunQi Dong, Qing Li 0022, Chen Wang 0074
Knowl. Based Syst.4
2018 A New Graph-Partitioning Algorithm for Large-Scale Knowledge Graph
Chen Wang 0074, Qi Li 0025, Qing Li 0022
ADMA4