Ju-Chin Chen

Ju-Chin Chen


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
11 March 2020 in Applied Sciences
Verified
Journal Article
Open access
PDF file
JCJu-Chin Chen
Ju-Chin Chen
CLChien-Yi Lee
Chien-Yi Lee
PHPeng-Yu Huang
Peng-Yu Huang
CLCheng-Rong Lin
Cheng-Rong Lin
According to the World Health Organization global status report on road safety, traffic accidents are the eighth leading cause of death in the world, and nearly one-fifth of the traffic accidents were cause by driver distractions. Inspired by the famous two-stream convolutional neural network (CNN) model, we propose a driver behavior analysis system using one spatial stream ConvNet to extract the spatial features and one temporal stream ConvNet to capture the driver’s motion information. Instead of using three-dimensional (3D) ConvNet, which would suffer from large parameters and the lack of a pre-trained model, two-dimensional (2D) ConvNet is used to construct the spatial and temporal ConvNet streams, and they were pre-trained by the large-scale ImageNet. In addition, in order to integrate different modalities, the feature-level fusion methodology was applied, and a fusion network was designed to integrate the spatial and temporal features for further classification. Moreover, a self-compiled dataset of 10 actions in the vehicle was established. According to the experimental results, the proposed system can increase the accuracy rate by nearly 30% compared to the two-stream CNN model with a score-level fusion.

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.

20 October 2023 in Processes
Verified
Journal Article
Open access
PDF file
Yen-Liang PanYen-Liang Pan
Yen-Liang Pan
CTChing-Yun Tseng
Ching-Yun Tseng
JCJu-Chin Chen
Ju-Chin Chen
After the fourth industrial evolution, precision and automatic manufacturing have become increasingly widely accepted in production. With highly variable productivity and flexibility, flexible manufacturing systems (FMS) lower production costs and increase efficiency. Due to its resource shareability, unexpected system deadlock may occur in some specific situations. Many existing works use deadlock prevention as the primary control methodology in research on system deadlock control, while this type of control policy would constrain the transportation resources and reduce the system’s liveness. This paper adopts a new transition-based deadlock recovery policy as the direct control strategy, which uses generating and comparing aiding matrix (GCAM) to determine the optimal control transition. We also improve the existing GCAM-based method by reducing the computational redundancy. This kind of control strategy and its benefit could be demonstrated through two typical systems of simple sequential processes with resource (S3PR) nets and their Petri nets model.

21 September 2023 in Sensors
Verified
Journal Article
Open access
PDF file
ELEn-Yu Lin
En-Yu Lin
JCJu-Chin Chen
Ju-Chin Chen
JLJenn-Jier James Lien
Jenn-Jier James Lien
Currently, the majority of industrial metal processing involves the use of taps for cutting. However, existing tap machines require relocation to specialized inspection stations and only assess the condition of the cutting edges for defects. They do not evaluate the quality of the cutting angles and the amount of removed material. Machine vision, a key component of smart manufacturing, is commonly used for visual inspection. Taps are employed for processing various materials. Traditional tap replacement relies on the technician’s accumulated empirical experience to determine the service life of the tap. Therefore, we propose the use of visual inspection of the tap’s external features to determine whether replacement or regrinding is needed. We examined the bearing surface of the tap and utilized single images to identify the cutting angle, clearance angle, and cone angles. By inspecting the side of the tap, we calculated the wear of each cusp. This inspection process can facilitate the development of a tap life system, allowing for the estimation of the durability and wear of taps and nuts made of different materials. Statistical analysis can be employed to predict the lifespan of taps in production lines. Experimental error is 16 μm. Wear from tapping 60 times is equivalent to 8 s of electric grinding. We have introduced a parameter, thread removal quantity, which has not been proposed by anyone else.

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.