Wenlu Wang

Dr. Wenlu Wang


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
30 May 2023 in Molecules
Verified
Journal Article
Open access
PDF file
YWYe Wang
Ye Wang
HZHonggang Zhao
Honggang Zhao
SSSimone Sciabola
Simone Sciabola
WWWenlu Wang
Wenlu Wang
Deep generative models applied to the generation of novel compounds in small-molecule drug design have attracted a lot of attention in recent years. To design compounds that interact with specific target proteins, we propose a Generative Pre-Trained Transformer (GPT)-inspired model for de novo target-specific molecular design. By implementing different keys and values for the multi-head attention conditional on a specified target, the proposed method can generate drug-like compounds both with and without a specific target. The results show that our approach (cMolGPT) is capable of generating SMILES strings that correspond to both drug-like and active compounds. Moreover, the compounds generated from the conditional model closely match the chemical space of real target-specific molecules and cover a significant portion of novel compounds. Thus, the proposed Conditional Generative Pre-Trained Transformer (cMolGPT) is a valuable tool for de novo molecule design and has the potential to accelerate the molecular optimization cycle time.

18 June 2023
Verified
Conference Paper
Open access
ZGZhitao Gong
Zhitao Gong
WWWenlu Wang
Wenlu Wang

24 June 2024
Verified
Conference Paper
Open access
CRCarlos E. Rubio-Medrano
Carlos E. Rubio-Medrano
AKAkash Kotak
Akash Kotak
WWWenlu Wang
Wenlu Wang
KSKarsten Sohr
Karsten Sohr
Large Language Models (LLMs), such as ChatGPT and Google Bard, have performed interestingly well when assisting developers on computer programming tasks, a.k.a., coding, thus potentially resulting in convenient and faster software constructions. This new approach significantly enhances efficiency but also presents challenges in unsupervised code construction with limited security guarantees. LLMs excel in producing code with accurate grammar, yet they are not specifically trained to guarantee the security of the code. In this paper, we provide an initial exploration into using formal software specifications as a starting point for software construction, allowing developers to translate descriptions of security-related behavior into natural language instructions for LLMs, a.k.a., prompts. In addition, we leveraged automated verification tools to evaluate the code produced against the aforementioned specifications, following a modular, step-by-step software construction process. For our study, we leveraged Role-based Access Control (RBAC), a mature security model, and the Java Modeling Language (JML), a behavioral specification language for Java. We test our approach on different publicly-available LLMs, namely, OpenAI ChatGPT 4.0, Google Bard, and Microsoft CoPilot. We provide a description of two applications-a security-sensitive Banking application employing RBAC and an RBAC API module itself-, the corresponding JML specifications, as well as a description of the prompts, the generated code, the verification results, as well as a series of interesting insights for practitioners interested in further exploring the use of LLMs for securely constructing applications.

17 September 2018 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
WWWenlu Wang
Wenlu Wang
JZJi Zhang
Ji Zhang
MSMin-Te Sun
Min-Te Sun
WKWei-Shinn Ku
Wei-Shinn Ku

3 September 2020 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
HWHeri Wijayanto
Heri Wijayanto
WWWenlu Wang
Wenlu Wang
WKWei-Shinn Ku
Wei-Shinn Ku
ACArbee L.P. Chen
Arbee L.P. Chen
A skyline query searches the data points that are not dominated by others in the dataset. It is widely adopted for many applications which require multi-criteria decision making. However, skyline query processing is considerably time-consuming for a high-dimensional large scale dataset. Parallel computing techniques are therefore needed to address this challenge, among which $MapReduce$ is one of the most popular frameworks to process big data. A great number of efficient $MapReduce$ skyline algorithms have been proposed in the literature and most of their designs focus on partitioning and pruning the given dataset. However, there are still opportunities for further parallelism. In this study, we propose two parallel skyline processing algorithms using a novel $LShape$ partitioning strategy and an effective $Propagation$ $Filtering$ method. These two algorithms are $2Phase$ $LShape$ and $1Phase$ $LShape$ , used for multiple reducers and single reducer, respectively. By extensive experiments, we verify that our algorithms outperformed the state-of-the-art approaches, especially for high-dimensional large scale datasets.

12 July 2021 in Distributed and Parallel Databases
Verified
Journal Article
Closed access
PDF file
PHPo-Wei Harn
Po-Wei Harn
JZJi Zhang
Ji Zhang
TSTing Shen
Ting Shen
WWWenlu Wang
Wenlu Wang
XJXunfei Jiang
Xunfei Jiang
YCYao-Yi Chiang
Yao-Yi Chiang