Wen-Yu Chung

Wen-Yu Chung

Auto-generated profile, based on publicly available information

Wen-Yu Chung

Department of Computer Science and Information Engineering, National Kaohsiung University of Science and Technology, Kaohsiung City, Taiwan

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
16 June 2022 in Thorax
Verified
Journal Article
Open access
PDF file
CWChao-Chien Wu
Chao-Chien Wu
CWChin-Chou Wang
Chin-Chou Wang
WCWen-Yu Chung
Wen-Yu Chung
CSChau-Chyun Sheu
Chau-Chyun Sheu
YYYi-Hsin Yang
Yi-Hsin Yang
SHShau-Ku Huang
Shau-Ku Huang
Background: Adult asthma is phenotypically heterogeneous with unclear aetiology. We aimed to evaluate the potential contribution of environmental exposure and its ensuing response to asthma and its heterogeneity.Methods: Environmental risk was evaluated by assessing the records of National Health Insurance Research Database (NHIRD) and residence-based air pollution (particulate matter with diameter less than 2.5 micrometers (PM2.5) and PM2.5-bound polycyclic aromatic hydrocarbons (PAHs)), integrating biomonitoring analysis of environmental pollutants, inflammatory markers and sphingolipid metabolites in case–control populations with mass spectrometry and ELISA. Phenotypic clustering was evaluated by t-distributed stochastic neighbor embedding (t-SNE) integrating 18 clinical and demographic variables.Findings: In the NHIRD dataset, modest increase in the relative risk with time-lag effect for emergency (N=209 837) and outpatient visits (N=638 538) was observed with increasing levels of PM2.5and PAHs. Biomonitoring analysis revealed a panel of metals and organic pollutants, particularly metal Ni and PAH, posing a significant risk for current asthma (ORs=1.28–3.48) and its severity, correlating with the level of oxidative stress markers, notably Nε-(hexanoyl)-lysine (r=0.108–0.311, p<0.05), but not with the accumulated levels of PM2.5exposure. Further, levels of circulating sphingosine-1-phosphate and ceramide-1-phosphate were found to discriminate asthma (p<0.001 and p<0.05, respectively), correlating with the levels of PAH (r=0.196, p<0.01) and metal exposure (r=0.202–0.323, p<0.05), respectively, and both correlating with circulating inflammatory markers (r=0.186–0.427, p<0.01). Analysis of six phenotypic clusters and those cases with comorbid type 2 diabetes mellitus (T2DM) revealed cluster-selective environmental risks and biosignatures.Interpretation: These results suggest the potential contribution of environmental factors from multiple sources, their ensuing oxidative stress and sphingolipid remodeling to adult asthma and its phenotypic heterogeneity.

30 April 2024 in IEEE Transactions on Nanobioscience
Verified
Journal Article
Closed access
WCWeng-Long Chang
Weng-Long Chang
RWRenata Wong
Renata Wong
YCYu-Hao Chen
Yu-Hao Chen
WCWen-Yu Chung
Wen-Yu Chung
JCJu-Chin Chen
Ju-Chin Chen
Athanasios V. VasilakosAthanasios V. Vasilakos
Athanasios V. Vasilakos
Given an undirected, unweighted graph with n vertices and m edges, the maximum cut problem is to find a partition of the n vertices into disjoint subsets V 1 and V 2 such that the number of edges between them is as large as possible. Classically, it is an NP-complete problem, which has potential applications ranging from circuit layout design, statistical physics, computer vision, machine learning and network science to clustering. In this paper, we propose a biomolecular and a quantum algorithm to solve the maximum cut problem for any graph G. The quantum algorithm is inspired by the biomolecular algorithm and has a quadratic speedup over its classical counterparts, where the temporal and spatial complexities are reduced to, respectively, O(√2 n /r) and O(m 2 ). With respect to oracle-related quantum algorithms for NP-complete problems, we identify our algorithm as optimal. Furthermore, to justify the feasibility of the proposed algorithm, we successfully solve a typical maximum cut problem for a graph with three vertices and two edges by carrying out experiments on IBM’s quantum simulator.