Wen-Yu Chung

Dr. Wen-Yu Chung

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

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
26 April 2021 in IEEE Transactions on Nanobioscience
Verified
Journal Article
Closed access
WCWeng-Long Chang
Weng-Long Chang
JCJu-Chin Chen
Ju-Chin Chen
WCWen-Yu Chung
Wen-Yu Chung
CHChun-Yuan Hsiao
Chun-Yuan Hsiao
RWRenata Wong
Renata Wong
Athanasios V. VasilakosAthanasios V. Vasilakos
Athanasios V. Vasilakos
In this paper, we propose a bio-molecular algorithm with O( ${n}^{{2}} + {m}$ ) biological operations, O( $2^{n}$ ) DNA strands, O( ${n}$ ) tubes and the longest DNA strand, O( ${n}$ ), for solving the independent-set problem for any graph G with ${m}$ edges and ${n}$ vertices. Next, we show that a new kind of the straightforward Boolean circuit yielded from the bio-molecular solutions with ${m}$ NAND gates, ( ${m} +{n} \times $ ( ${n} + {1}$ )) AND gates and (( ${n} \times $ ( ${n} + {1}$ ))/2) NOT gates can find the maximal independent-set(s) to the independent-set problem for any graph ${G}$ with ${m}$ edges and ${n}$ vertices. We show that a new kind of the proposed quantum-molecular algorithm can find the maximal independent set(s) with the lower bound $\Omega $ ( $2^{n/{2}}$ ) queries and the upper bound O( $2^{n/{2}}$ ) queries. This work offers an obvious evidence for that to solve the independent-set problem in any graph ${G}$ with ${m}$ edges and ${n}$ vertices, bio-molecular computers are able to generate a new kind of the straightforward Boolean circuit such that by means of implementing it quantum computers can give a quadratic speed-up. This work also offers one obvious evidence that quantum computers can significantly accelerate the speed and enhance the scalability of bio-molecular computers. Next, the element distinctness problem with input of ${n}$ bits is to determine whether the given $2^{n}$ real numbers are distinct or not. The quantum lower bound of solving the element distinctness problem is $\Omega $ ( $2^{n\times {(}{2}/{3}{)}}$ ) queries in the case of a quantum walk algorithm. We further show that the proposed quantum-molecular algorithm reduces the quantum lower bound to $\Omega $ (( $2^{n/{2}}$ )/( $2^{\text {1/2}}{)}$ ) queries. Furthermore, to justify the feasibility of the proposed quantum-molecular algorithm, we successfully solve a typical independent set problem for a graph G with two vertices and one edge by carrying out experiments on the backend ibmqx4 with five quantum bits and the backend simulator with 32 quantum bits on IBM’s quantum computer.

25 November 2021 in IEEE Transactions on Nanobioscience
Verified
Journal Article
Closed access
WCWeng-Long Chang
Weng-Long Chang
WCWen-Yu Chung
Wen-Yu Chung
CHChun-Yuan Hsiao
Chun-Yuan Hsiao
RWRenata Wong
Renata Wong
JCJu-Chin Chen
Ju-Chin Chen
Athanasios V. VasilakosAthanasios V. Vasilakos
Athanasios V. Vasilakos
In this paper, we propose a bio-molecular algorithm with O( ${n}$ 2 ) biological operations, O( $2^{n-1}$ ) DNA strands, O( ${n}$ ) tubes and the longest DNA strand, O( ${n}$ ), for inferring the value of a bit from the only output satisfying any given condition in an unsorted database with $2^{n}$ items of ${n}$ bits. We show that the value of each bit of the outcome is determined by executing our bio-molecular algorithm ${n}$ times. Then, we show how to view a bio-molecular solution space with $2^{{\textit {n-1}}}$ DNA strands as an eigenvector and how to find the corresponding unitary operator and eigenvalues for inferring the value of a bit in the output. We also show that using an extension of the quantum phase estimation and quantum counting algorithms computes its unitary operator and eigenvalues from bio-molecular solution space with $2^{{\textit {n-1}}}$ DNA strands. Next, we demonstrate that the value of each bit of the output solution can be determined by executing the proposed extended quantum algorithms ${n}$ times. To verify our theorem, we find the maximum-sized clique to a graph with two vertices and one edge and the solution ${b}$ that satisfies ${b}^{2} \equiv 1$ (mod 15) and $1 < {b} < (15/2)$ using IBM Quantum’s backend.

14 March 2023 in Scientific Reports
Verified
Journal Article
Open access
PDF file
RWRenata Wong
Renata Wong
WCWeng-Long Chang
Weng-Long Chang
WCWen-Yu Chung
Wen-Yu Chung
Athanasios V. VasilakosAthanasios V. Vasilakos
Athanasios V. Vasilakos
A dominating set of a graph $$G = (V, E)$$ G = ( V , E ) is a subset U of its vertices V, such that any vertex of G is either in U, or has a neighbor in U. The dominating-set problem is to find a minimum dominating set in G. Dominating sets are of critical importance for various types of networks/graphs, and find therefore potential applications in many fields. Particularly, in the area of communication, dominating sets are prominently used in the efficient organization of large-scale wireless ad hoc and sensor networks. However, the dominating set problem is also a hard optimization problem and thus currently is not efficiently solvable on classical computers. Here, we propose a biomolecular and a quantum algorithm for this problem, where the quantum algorithm provides a quadratic speedup over any classical algorithm. We show that the dominating set problem can be solved in $$O(2^{n/2})$$ O ( 2 n / 2 ) queries by our proposed quantum algorithm, where n is the number of vertices in G. We also demonstrate that our quantum algorithm is the best known procedure to date for this problem. We confirm the correctness of our algorithm by executing it on IBM Quantum’s qasm simulator and the Brooklyn superconducting quantum device. And lastly, we show that molecular solutions obtained from solving the dominating set problem are represented in terms of a unit vector in a finite-dimensional Hilbert space.

6 May 2019 in Applied Sciences
Verified
Journal Article
Open access
PDF file
CLChun-Cheng Lin
Chun-Cheng Lin
WLWei-Ching Li
Wei-Ching Li
JCJu-Chin Chen
Ju-Chin Chen
WCWen-Yu Chung
Wen-Yu Chung
SCSheng-Hao Chung
Sheng-Hao Chung
KLKawuu W. Lin
Kawuu W. Lin
Data mining is a set of methods used to mine hidden information from data. It mainly includes frequent pattern mining, sequential pattern mining, classification, and clustering. Frequent pattern mining is used to discover the correlation among various sets of items within large databases. The rapid upward trend in data size slows the mining of frequent patterns. Numerous studies have attempted to develop algorithms that operate in distributed computing environments to accelerate the mining process. FLR-mining (Fast, Load balancing and Resource efficient mining algorithm) is one of the fastest methods of mining with efficient consideration of load balancing and resources. FLR-mining can automatically determine the appropriate number of computing nodes. However, FLR-mining and existing methods assume that the network bandwidth is constant. In practical distributed and many-task computing systems, this assumption fails because there are packet collisions caused by many mining tasks that run in a simultaneous manner. Therefore, a method that can consider the varying network bandwidth is necessary. In this study, we propose a method that can rapidly mine frequent patterns under the varying network bandwidth. The proposed method can also determine the appropriate number of computing nodes to efficiently utilize computing resources and achieve load balancing. Through empirical evaluation, the proposed method is shown to deliver excellent performance in terms of execution efficiency and load balancing.

13 June 2023 in arXiv
Verified
Preprint
Open access
PDF file
WCWeng-Long Chang
Weng-Long Chang
RWRenata Wong
Renata Wong
WCWen-Yu Chung
Wen-Yu Chung
YCYu-Hao Chen
Yu-Hao Chen
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 quantum algorithm to solve the maximum cut problem for any graph $G$ with a quadratic speedup over its classical counterparts, where the temporal and spatial complexities are reduced to, respectively, $O(\sqrt{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 computer.