H
Heow Pueh Lee
Researcher at National University of Singapore
Publications - 409
Citations - 12586
Heow Pueh Lee is an academic researcher from National University of Singapore. The author has contributed to research in topics: Beam (structure) & Finite element method. The author has an hindex of 45, co-authored 385 publications receiving 10452 citations. Previous affiliations of Heow Pueh Lee include Institute of High Performance Computing Singapore & Jilin University.
Papers
More filters
Journal ArticleDOI
Proper orthogonal decomposition and its applications—part i: theory
TL;DR: The equivalence of the matrices for processing, the objective functions, the optimal basis vectors, the mean-square errors, and the asymptotic connections of the three POD methods are demonstrated and proved when the methods are used to handle the POD of discrete random vectors.
Journal ArticleDOI
A comparison of PCA, KPCA and ICA for dimensionality reduction in support vector machine
TL;DR: The experiment shows that SVM by feature extraction using PCA, KPCA or ICA can perform better than that without feature extraction, and among the three methods, there is the best performance in K PCA feature extraction; followed by ICA feature extraction.
Journal ArticleDOI
Modeling and analysis of micro piezoelectric power generators for micro-electromechanical-systems applications
TL;DR: In this article, a general concept of the piezoelectric energy conversion is first given and a simple design modeling and analysis of the 31 transverse mode type PZE micro-generator is presented.
Journal ArticleDOI
Dynamic properties of flexural beams using a nonlocal elasticity model
TL;DR: In this article, a nonlocal Bernoulli-Euler beam model is established based on the theory of nonlocal elasticity, which can be applied to modeling and characterization of size-dependent mechanical properties of micro- or nanoelectromechanical system (MEMS or NEMS) devices.
Journal ArticleDOI
Particle swarm optimization-based algorithms for TSP and generalized TSP
TL;DR: A novel particle swarm optimization (PSO)-based algorithm for the traveling salesman problem (TSP) is presented and it has been shown that the size of the solved problems could be increased by using the proposed algorithm.