Zhe Quan

Dr. Zhe Quan


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
18 December 2019 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
ZQZhe Quan
Zhe Quan
ZWZhi-Jie Wang
Zhi-Jie Wang
TYTing Ye
Ting Ye
SGSong Guo
Song Guo
Power-aware task scheduling on processors has been a research hotspot in computing systems. In this paper, we study the problem of minimizing the schedule length for energy consumption constrained parallel applications on heterogeneous computing systems. For this problem, existing work adopts a policy that preassigns the minimum energy consumption for each unassigned task. Nevertheless, our analysis reveals that, such a preassignment policy could be unfair for the low priority tasks, and it may not achieve an optimistic schedule length. Thereby, we propose a new task scheduling algorithm that suggests a weight-based mechanism to preassign energy consumption for unassigned tasks, and we provide the rigorous proof to show its feasibility. Further, we show that this idea can be extended to solve reliability maximization problems with energy consumption constraint or with both deadline and energy consumption constraints. We have conducted extensive experiments based on real parallel applications. The experimental results consistently demonstrate that our proposed algorithms can achieve favourable performance, compared to state-of-the-art algorithms.

14 February 2019 in IEEE/ACM Transactions on Audio, Speech, and Language Processing
Verified
Journal Article
Closed access
ZQZhe Quan
Zhe Quan
ZWZhi-Jie Wang
Zhi-Jie Wang
YLYuquan Le
Yuquan Le
BYBin Yao
Bin Yao
KLKenli Li
Kenli Li
JYJian Yin
Jian Yin
Sentence similarity modeling lies at the core of many natural language processing applications, and thus has received much attention. Owing to the success of word embeddings, recently, popular neural network methods achieved sentence embedding. Most of them focused on learning semantic information and modeling it as a continuous vector, yet the syntactic information of sentences has not been fully exploited. On the other hand, prior works have shown the benefits of structured trees that include syntactic information, while few methods in this branch utilized the advantages of word embeddings and another powerful technique - attention weight mechanism. This paper suggests to absorb their advantages by merging these techniques in a unified structure, dubbed as ACV-tree. Meanwhile, this paper develops a new tree kernel, known as ACVT kernel, that is tailored for sentence similarity measure based on the proposed structure. The experimental results, based on 19 widely-used STS datasets, demonstrate that our model is effective and competitive, compared against state-of-the-art models. Additionally, the experimental results validate that many attention weight mechanisms and word embedding techniques can be seamlessly integrated into our model, demonstrating the robustness and universality of our model.

29 May 2023 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
TXTong Xiao
Tong Xiao
ZQZhe Quan
Zhe Quan
ZWZhi-Jie Wang
Zhi-Jie Wang
YLYuquan Le
Yuquan Le
YDYunfei Du
Yunfei Du
Keqin LiKeqin Li
Keqin Li
Detecting anomalies in logs is crucial for service and system management, since logs are widely used to record the runtime status, and are often the only data available for postmortem analysis. Since anomalies are usually rare in real-world services and systems, a common and feasible practice is to mine or learn normal patterns from logs, and deem those violating the normal patterns as anomalies. As log sequences are a kind of time series data, RNN (Recurrent Neural Network) and its variants have been extensively employed to capture the normal patterns. Nevertheless, the sequential nature of RNN and its variants makes them hard to parallelize and capture long-term dependencies, which may hinder their performance. To address this issue, in this paper we propose Loader, a novel semi-supervised lo g a nomaly d etector based on Transform er , because the Transformer architecture eschews recurrence and is able to draw global dependencies. Loader leverages the Transformer encoder to capture normal patterns from normal log sequences. When detecting, it gives a set of candidate log templates, that may appear after the input log substring under normal conditions. If the template of the actual next log message is not within the candidate set, this implies an anomaly. Previous similar methods select the most possible $k$ log templates as candidates in any case, so the performance is sensitive to $k$ , and it is nontrivial to pick a proper $k$ . To alleviate this, we design a more flexible and robust ‘top- $p$ ’ algorithm, which determines the candidate set based on the cumulative probability of the most possible log templates. Extensive experiments are conducted based on three public log datasets, the experimental results validate the effectiveness and competitiveness of our approach.

1 November 2018
Verified
Conference Paper
Open access
BDBang Di
Bang Di
JSJianhua Sun
Jianhua Sun
DLDong Li
Dong Li
HCHao Chen
Hao Chen
ZQZhe Quan
Zhe Quan

11 August 2022 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
XLXuan Lin
Xuan Lin
ZQZhe Quan
Zhe Quan
ZWZhi-Jie Wang
Zhi-Jie Wang
YGYan Guo
Yan Guo
XZXIANGXIANG ZENG
XIANGXIANG ZENG
PYPhilip S. Yu
Philip S. Yu
Effectively identifying compound-protein interactions (CPIs) is crucial for new drug design, which is an important step in silico drug discovery. Current machine learning methods for CPI prediction mainly use one-demensional (1D) compound/protein strings and/or the specific descriptors. However, they often ignore the fact that molecules are essentially modeled by the molecular graph. We observe that in real-world scenarios, the topological structure information of the molecular graph usually provides an overview of how the atoms are connected, and the local chemical context reveals the functionality of the protein sequence in CPI. These two types of information are complementary to each other and they are both significant for modeling compound-protein pairs. Motivated by this, we propose an end-to-end deep learning framework named GraphCPI, which captures the structural information of compounds and leverages the chemical context of protein sequences for solving the CPI prediction task. Our framework can integrate any popular graph neural networks for learning compounds, and it combines with a convolutional neural network for embedding sequences. To compare our method with classic and state-of-the-art deep learning methods, we conduct extensive experiments based on several widely-used CPI datasets. The experimental results show the feasibility and competitiveness of our proposed method.

1 January 2024 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
JWJiawei Wang
Jiawei Wang
YLYuquan Le
Yuquan Le
DCDa Cao
Da Cao
SLShaofei Lu
Shaofei Lu
ZQZhe Quan
Zhe Quan
MWMeng Wang
Meng Wang
Given the fact descriptions of legal cases, the legal judgment prediction (LJP) problem aims to determine three judgment tasks of law articles, charges, and the term of penalty. Most existing studies have considered task dependencies while neglecting the prior dependencies of labels among different tasks. Therefore, how to make better use of the information on the relation dependencies among tasks and labels becomes a crucial issue. To this end, we transform the text classification problem into a node classification framework based on graph reasoning and supervised contrastive learning (SCL) techniques, named GraSCL. Specifically, we first design a graph reasoning network to model the potential dependency structures and facilitate relational learning under various graph topologies. Then, we introduce the SCL method for the LJP task to further leverage the label relation on the graph. To accommodate the node classification settings, we extend the traditional SCL method to novel variants for SCL at the node level, which allows the GraSCL framework to be trained efficiently even with small batches. Furthermore, to recognize the importance of hard negative samples in contrastive learning, we introduce a simple yet effective technique called online hard negative mining (OHNM) to enhance our SCL approach. This technique complements our SCL method and enables us to control the number and complexity of negative samples, leading to further improvements in the model’s performance. Finally, extensive experiments are conducted on two well-known benchmarks, demonstrating the effectiveness and rationality of our proposed SCL approach as compared to the state-of-the-art competitors.