Ju-Chin Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ju-Chin Chen has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Wen-Yu Chung
Department of Computer Science and Information Engineering, National Kaohsiung University of Science and Technology, Kaohsiung, Taiwan
4 shared publications - Athanasios Vasilakos
University of Agder (UiA)
3 shared publications - Weng-Long Chang
Department of Computer Science and Information Engineering, National Kaohsiung University of Science and Technology, Kaohsiung, Taiwan
3 shared publications - Cheng-Rong Lin
Department of Computer Science and Information Engineering, National Kaohsiung University of Science and Technology, Kaohsiung city 8078, Taiwan
2 shared publications - Chun-Huei Chen
Department of Computer Science and Information Engineering, National Kaohsiung University of Science and Technology, Kaohsiung city 8078, Taiwan
2 shared publications Chun-Yuan Hsiao
Department of Computer Science and Information Engineering, National Kaohsiung University of Science and Technology, Kaohsiung, Taiwan
2 shared publications
Latest Publications
- 8 February 2025
- Published by Springer Nature in Computing
- Vol. 107  (2) , 1-38
A parallel and distributed C4.5 algorithm in cloud computing environments
- 8 February 2025
- Published by Springer Nature in Computing
- Vol. 107  (2) , 1-38
A parallel and distributed C4.5 algorithm in cloud computing environments
- Open Access
Enhancement of Computational Efficiency for Deadlock Recovery of Flexible Manufacturing Systems Using Improved Generating and Comparing Aiding Matrix Algorithms
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.
Open AccessEnhancement of Computational Efficiency for Deadlock Recovery of Flexible Manufacturing Systems Using Improved Generating and Comparing Aiding Matrix Algorithms
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.
- 29 September 2023
- Published by Springer Nature
- p. 317-324
A Distilled 2D CNN-LSTM Framework with Temporal Attention Mechanism for Action Recognition
- 29 September 2023
- Published by Springer Nature
- p. 317-324
A Distilled 2D CNN-LSTM Framework with Temporal Attention Mechanism for Action Recognition
- Open Access
Intelligent Tapping Machine: Tap Geometry Inspection
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.
Open AccessIntelligent Tapping Machine: Tap Geometry Inspection
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.
- Open Access
- 5 September 2023
- Published by MDPI AG in Preprints.org
Intelligent Tapping Machine: Tap Geometry Inspection
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 con-dition 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 com-monly 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 ser-vice life of the tap. Typically, inspecting tooth wear involves removing the tap and evaluating the degree of wear to determine if regrinding or replacement is necessary. 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. We further investigated whether the cutting portion affected the length of the tool by measuring changes in tooth surface area and the amount of removed thread. 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.
- 5 September 2023
- Published by MDPI AG in Preprints.org
Open AccessIntelligent Tapping Machine: Tap Geometry Inspection
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 con-dition 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 com-monly 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 ser-vice life of the tap. Typically, inspecting tooth wear involves removing the tap and evaluating the degree of wear to determine if regrinding or replacement is necessary. 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. We further investigated whether the cutting portion affected the length of the tool by measuring changes in tooth surface area and the amount of removed thread. 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.
- Open Access
Quantum Speedup for the Maximum Cut Problem
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.Open AccessQuantum Speedup for the Maximum Cut Problem
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. - 25 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nanobioscience
- Vol. 21  (2) , 286-293
Quantum Speedup for Inferring the Value of Each Bit of a Solution State in Unsorted Databases Using a Bio-Molecular Algorithm on IBM Quantum’s Computers
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.
- 25 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nanobioscience
- Vol. 21  (2) , 286-293
Quantum Speedup for Inferring the Value of Each Bit of a Solution State in Unsorted Databases Using a Bio-Molecular Algorithm on IBM Quantum’s Computers
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.
- 26 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nanobioscience
- Vol. 20  (3) , 354-376
Quantum Speedup and Mathematical Solutions of Implementing Bio-Molecular Solutions for the Independent Set Problem on IBM Quantum Computers
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.- 26 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nanobioscience
- Vol. 20  (3) , 354-376
Quantum Speedup and Mathematical Solutions of Implementing Bio-Molecular Solutions for the Independent Set Problem on IBM Quantum Computers
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.- Open Access
- 11 March 2020
- Published by MDPI AG in Applied Sciences
- Vol. 10  (6) , 1908
Driver Behavior Analysis via Two-Stream Deep Convolutional Neural Network
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.
- 11 March 2020
- Published by MDPI AG in Applied Sciences
- Vol. 10  (6) , 1908
Open AccessDriver Behavior Analysis via Two-Stream Deep Convolutional Neural Network
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.
- Open Access
- 25 December 2019
- Published by MDPI AG in Applied Sciences
- Vol. 10  (1) , 188
Person Search via Deep Integrated Networks
This study proposes an integrated deep network consisting of a detection and identification module for person search. Person search is a very challenging problem because of the large appearance variation caused by occlusion, background clutter, pose variations, etc., and it is still an active research issue in the academic and industrial fields. Although various studies have been proposed, following the protocols of the person re-identification (ReID) benchmarks, most existing works take cropped pedestrian images either from manual labelling or a perfect detection assumption. However, for person search, manual processing is unavailable in practical applications, thereby causing a gap between the ReID problem setting and practical applications. One fact is also ignored: an imperfect auto-detected bounding box or misalignment is inevitable. We design herein a framework for the practical surveillance scenarios in which the scene images are captured. For person search, detection is a necessary step before ReID, and previous studies have shown that the precision of detection results has an influence on person ReID. The detection module based on the Faster R-CNN is used to detect persons in a scene image. For identifying and extracting discriminative features, a multi-class CNN network is trained with the auto-detected bounding boxes from the detection module, instead of the manually cropped data. The distance metric is then learned from the discriminative features output by the identification module. According to the experimental results of the test performed in the scene images, the multi-class CNN network for the identification module can provide a 62.7% accuracy rate, which is higher than that for the two-class CNN network.
- 25 December 2019
- Published by MDPI AG in Applied Sciences
- Vol. 10  (1) , 188
Open AccessPerson Search via Deep Integrated Networks
This study proposes an integrated deep network consisting of a detection and identification module for person search. Person search is a very challenging problem because of the large appearance variation caused by occlusion, background clutter, pose variations, etc., and it is still an active research issue in the academic and industrial fields. Although various studies have been proposed, following the protocols of the person re-identification (ReID) benchmarks, most existing works take cropped pedestrian images either from manual labelling or a perfect detection assumption. However, for person search, manual processing is unavailable in practical applications, thereby causing a gap between the ReID problem setting and practical applications. One fact is also ignored: an imperfect auto-detected bounding box or misalignment is inevitable. We design herein a framework for the practical surveillance scenarios in which the scene images are captured. For person search, detection is a necessary step before ReID, and previous studies have shown that the precision of detection results has an influence on person ReID. The detection module based on the Faster R-CNN is used to detect persons in a scene image. For identifying and extracting discriminative features, a multi-class CNN network is trained with the auto-detected bounding boxes from the detection module, instead of the manually cropped data. The distance metric is then learned from the discriminative features output by the identification module. According to the experimental results of the test performed in the scene images, the multi-class CNN network for the identification module can provide a 62.7% accuracy rate, which is higher than that for the two-class CNN network.