Jim-Min Lin

Dr. Jim-Min Lin


Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

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

Representative Publications

View All Publications
1 April 2006 in Journal of Electronic Testing
Verified
Journal Article
Closed access
PDF file
CLChiou-yng Lee
Chiou-yng Lee
CCChe Wun Chiou
Che Wun Chiou
JLJim-Min Lin
Jim-Min Lin

1 October 2005 in Journal of Electronic Testing
Verified
Journal Article
Closed access
PDF file
CLChiou-yng Lee
Chiou-yng Lee
CCChe Wun Chiou
Che Wun Chiou
JLJim-Min Lin
Jim-Min Lin

1 June 2013 in IET Information Security
Verified
Journal Article
Open access
PDF file
YHYing Yan Hua
Ying Yan Hua
JLJim-Min Lin
Jim-Min Lin
CCChe Wun Chiou
Che Wun Chiou
CLChiou-yng Lee
Chiou-yng Lee
YLYong Huan Liu
Yong Huan Liu
Multiplication is one important finite field arithmetic operation in cryptographic computations. Dual basis multipliers over Galois field GF(2 m ) have been widely applied in this kind of computations because of its advantage of small chip area. Nevertheless, up to date, there are only few methods that can keep balance of low space complexity and low time complexity at the same time. In order to achieve such an efficient aim, this study presents a novel digit‐serial dual basis multiplier that is different from existing ones with a modified cut‐set method using Karatsuba algorithm as well as Hankel matrix. As a result, the proposed multiplier can save much space and thus be particularly suitable for some hand held devices equipped with only limited resources. The proposed digit‐serial dual basis multiplier saves 55% space complexity as compared with existing similar studies with National Institute of Standards and Technology (NIST) suggested values for elliptic curve cryptosystem.

8 April 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
JCJireh Yi-Le Chan
Jireh Yi-Le Chan
SLSteven Mun Hong Leow
Steven Mun Hong Leow
KBKhean Thye Bea
Khean Thye Bea
WCWai Khuen Cheng
Wai Khuen Cheng
SPSeuk Yen Phoong
Seuk Yen Phoong
Yen-Lin ChenYen-Lin Chen
Yen-Lin Chen
Algorithmic trading is a common topic researched in the neural network due to the abundance of data available. It is a phenomenon where an approximately linear relationship exists between two or more independent variables. It is especially prevalent in financial data due to the interrelated nature of the data. The existing feature selection methods are not efficient enough in solving such a problem due to the potential loss of essential and relevant information. These methods are also not able to consider the interaction between features. Therefore, we proposed two improvements to apply to the Long Short-Term Memory neural network (LSTM) in this study. It is the Multicollinearity Reduction Module (MRM) based on correlation-embedded attention to mitigate multicollinearity without removing features. The motivation of the improvements is to allow the model to predict using the relevance and redundancy within the data. The first contribution of the paper is allowing a neural network to mitigate the effects of multicollinearity without removing any variables. The second contribution is improving trading returns when our proposed mechanisms are applied to an LSTM. This study compared the classification performance between LSTM models with and without the correlation-embedded attention module. The experimental result reveals that a neural network that can learn the relevance and redundancy of the financial data to improve the desired classification performance. Furthermore, the trading returns of our proposed module are 46.82% higher without sacrificing training time. Moreover, the MRM is designed to be a standalone module and is interoperable with existing models.

1 January 2007 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
CLChiou-yng Lee
Chiou-yng Lee
YCYung-Hui Chen
Yung-Hui Chen
CCChe-Wun Chiou
Che-Wun Chiou
JLJim-Min Lin
Jim-Min Lin