Te-Jen Chang

Prof. Dr. Te-Jen Chang

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
1 August 2022 in Energy Reports
Verified
Journal Article
Open access
TCTe-Jen Chang
Te-Jen Chang
SCShan-Jen Cheng
Shan-Jen Cheng
CHChang-Hung Hsu
Chang-Hung Hsu
JMJr-Ming Miao
Jr-Ming Miao
SCShih-Feng Chen
Shih-Feng Chen

15 September 2021 in Energies
Verified
Journal Article
Open access
PDF file
SCShan-Jen Cheng
Shan-Jen Cheng
WLWen-Ken Li
Wen-Ken Li
TCTe-Jen Chang
Te-Jen Chang
CHChang-Hung Hsu
Chang-Hung Hsu
Prognostics technology is important for the sustainability of solid oxide fuel cell (SOFC) system commercialization, i.e., through failure prevention, reliability assessment, and the remaining useful life (RUL) estimation. To solve SOFC system issues, data-driven prognostics methods based on the dynamic neural network (DNN), one of non-linear models, were investigated in this study. Based on DNN model types, the neural network autoregressive (NNARX) model with external inputs, the neural network autoregressive moving average (NNARMAX) model with external inputs, and the neural network output error (NNOE) were utilized to predict the degradation trend and estimate the RUL. First, the degradation trend prediction was executed to evaluate the correctness of the proposed DNN model structures in the first learning phase. Then, the RUL was estimated on the basis of the degradation trend of the NN models in the second inference phase. The comparison test results show the prediction accuracy of the NNARX model is higher and the RUL estimation can be given within a smaller relative error than the NNARMAX and NNOE models. The evaluation criteria of the root mean square error and mean absolute error of the NNARX model are the smallest among these three models. Therefore, the proposed NNARX model can effectively and precisely provide degradation trend prediction and RUL estimation of the SOFC system.

22 March 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
CHChang-Hung Hsu
Chang-Hung Hsu
SCShan-Jen Cheng
Shan-Jen Cheng
TCTe-Jen Chang
Te-Jen Chang
YHYi-Mei Huang
Yi-Mei Huang
CFChin-Ping Fung
Chin-Ping Fung
CCChen Chen
Chen Chen
This study proposes a design for unmanned chemical factories and implementation based on ultra-low-cost Internet of Things technology, to combat the impact of COVID-19 on industrial factories. A safety and private blockchain network architecture was established, including a three-layer network structure comprising edge, fog, and cloud calculators. Edge computing uses a programmable logic controller and a single-chip microcomputer to transmit and control the motion path of a four-axis robotic arm motor. The fog computing architecture is implemented using Python software. The structure is integrated and applied using a convolutional neural network (CNN) and a fractional-order proportional-integral-derivative controller (FOPID). In addition, edge computing and fog computing signals are transmitted through the blockchain, and can be directly uploaded to the cloud computing controller for signal integration. The integrated application of the production line sensor and image recognition based on the network layer was addressed. We verified the image recognition of the CNN and the robot motor signal control of the FOPID. This study proposes that a CNN + FOPID method can improve the efficiency of the factory by more than 50% compared with traditional manual operators. The low-cost, high-efficiency equipment of the new method has substantial contribution and application potential.

28 June 2022 in Sensors
Verified
Journal Article
Open access
PDF file
IPI-Hui Pan
I-Hui Pan
PHPing-Sheng Huang
Ping-Sheng Huang
TCTe-Jen Chang
Te-Jen Chang
HCHsiang-Hsiung Chen
Hsiang-Hsiung Chen
The rapid development of internet and social media has driven the great requirement for information sharing and intelligent property protection. Therefore, reversible information embedding theory has marked some approaches for information security. Assuming reversibility, the original and embedded data must be completely restored. In this paper, a high-capacity and multilayer reversible information hiding technique for digital images was presented. First, the integer Haar wavelet transform scheme converted the cover image from the spatial into the frequency domain that was used. Furthermore, we applied dynamic threshold analysis, the parameters of the predicted model, the location map, and the multilayer embedding method to improve the quality of the stego image and restore the cover image. In comparison with current algorithms, the proposed algorithm often had better embedding capacity versus image quality performance.

9 July 2026 in Applied Sciences
Verified
Journal Article
Open access
PDF file
SCShan-Jen Cheng
Shan-Jen Cheng
KCKai-Wei Chang
Kai-Wei Chang
TCTe-Jen Chang
Te-Jen Chang
Modular exponentiation is among the most demanding computational operations in cryptographic systems. Effective computation of modular exponentiation is most beneficial for public-key cryptography. The computational complexity and the growing number of bits of the key size, as required by increasingly stringent security demands in the RSA, the Diffie–Hellman key exchange and the Zero-Knowledge Proof (ZKP) protocols, have become a top research priority in terms of algorithmic efficiency. This study proposes a novel triple modular exponentiation algorithm based on the Improved Common-Multiplicand-Multiplication (ICMM) framework. The exact complexity formula was obtained through systematic probabilistic analysis of eight mutually exclusive bit-level states. The efficiency of modular exponentiation is primarily determined by the number of modular multiplications and exponentiation squares required. It is observed that improved common-multiplicand multiplication efficiently minimizes the computational complexity of the triple modular exponentiation by reducing the number of modular multiplications. The overall computational complexity of triple modular exponentiation is 1.875j, where j is the bit length of the exponent. This represents a reduction of approximately 16.7% in total multiplication count relative to double modular exponentiation, corresponding to a 44.4% reduction on a per-exponent basis, and a reduction of 58.3% relative to three independent binary exponentiations. This study concludes that the proposed decomposition reduces the average-case computational complexity of triple modular exponentiation to 1.875j modular multiplications for a j-bit exponent. The proposed triple modular exponentiation algorithm is shown to have lower number of multiplications per bit length of exponent as compared to double modular exponentiation. This result demonstrates the potential of proposed algorithm to reduce the computational cost of triple modular exponentiation in cryptographic protocols where it is a recurring operation, such as interactive ZKP identification schemes.