Jing-Wei Wu

dblp:254/4976 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 68% High-performance computing · 32%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › knowledge representation in biology
biomedical knowledge graph
0.812024
TarKG: a comprehensive biomedical knowledge graph for target discovery · Bioinform. 2024
Performance modeling and evaluation › parallel system performance
strong and weak scaling
0.512021
Critique of "Planetary Normal Mode Computation: Parallel Algorithms, Performance, and Reproducibility" by SCC Team From National Tsing Hua University · IEEE Trans. Parallel Distributed Syst. 2021
High-performance computing › numerical linear algebra
eigensolver
0.112021
Critique of "Planetary Normal Mode Computation: Parallel Algorithms, Performance, and Reproducibility" by SCC Team From National Tsing Hua University · IEEE Trans. Parallel Distributed Syst. 2021
High-performance computing › numerical linear algebra › eigensolver
polynomial filtering eigensolver
0.112021
Critique of "Planetary Normal Mode Computation: Parallel Algorithms, Performance, and Reproducibility" by SCC Team From National Tsing Hua University · IEEE Trans. Parallel Distributed Syst. 2021

Methods — techniques the papers use, named apart from their topics

knowledge graph embedding · 0.8polynomial filtering · 0.5parallel eigensolver · 0.5
YearPublicationVenuePosition
2024 TarKG: a comprehensive biomedical knowledge graph for target discovery
abstract
MOTIVATION: Target discovery is a crucial step in drug development, as it directly affects the success rate of clinical trials. Knowledge graphs (KGs) offer unique advantages in processing complex biological data and inferring new relationships. Existing biomedical KGs primarily focus on tasks such as drug repositioning and drug-target interactions, leaving a gap in the construction of KGs tailored for target discovery. RESULTS: We established a comprehensive biomedical KG focusing on target discovery, termed TarKG, by integrating seven existing biomedical KGs, nine public databases, and traditional Chinese medicine knowledge databases. TarKG consists of 1 143 313 entities and 32 806 467 relations across 15 entity categories and 171 relation types, all centered around 3 core entity types: Disease, Gene, and Compound. TarKG provides specialized knowledges for the core entities including chemical structures, protein sequences, or text descriptions. By using different KG embedding algorithms, we assessed the knowledge completion capabilities of TarKG, particularly for disease-target link prediction. In case studies, we further examined TarKG's ability to predict potential protein targets for Alzheimer's disease (AD) and to identify diseases potentially associated with the metallo-deubiquitinase CSN5, using literature analysis for validation. Furthermore, we provided a user-friendly web server (https://tarkg.ddtmlab.org) that enables users to perform knowledge retrieval and relation inference using TarKG. AVAILABILITY AND IMPLEMENTATION: TarKG is accessible at https://tarkg.ddtmlab.org.
Chuipu Cai, Xiao-Tian Huang, Jun-Lin Yu, Jing-Wei Wu, Jiansong Fang, Guo-Bo Li
Bioinform.6
2021 Critique of "Planetary Normal Mode Computation: Parallel Algorithms, Performance, and Reproducibility" by SCC Team From National Tsing Hua University
abstract
As a special activity of the Student Cluster Competition at SC19 conference, we made an attempt to reproduce the scalability evaluations of a highly paralleled polynomial filtering eigensolver for computing planetary interior normal modes. Our experiments were conducted on a Mars dataset using a small scale 4-node cluster with Intel Skylake CPU architecture, while the original article's were conducted on a Moon dataset using a large scale 256-node supercomputer with Intel CPU Skylake and KNL architectures. This article shares our experiences and observations from our reproducibility activity and discusses our findings on three main sections: the weak scalability, the strong scalability, and the relationships between variables. The results of weak scalability and strong scalability were successfully reproduced. But due to the differences on the problem scale, input dataset, and system architecture, different behaviors regarding the polynomial degree were observed.
Wei-Fang Sun, Hung-Hsin Chen, ShaoFu Lin, YuanChing Lin, Jing-Wei Wu, En-Te Lin, Jerry Chou 0001
IEEE Trans. Parallel Distributed Syst.5