Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kian Meng Lim

dblp:01/4452 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2025
0000-0003-4311-9223ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Systems, architecture and hardware · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 33% Parallel and multicore computing · 33% Performance modeling and evaluation · 33%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%
Computer graphics and multimedia
1 paper
Computer animation and physical simulation · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Medical and health informatics › medical simulation
surgical simulation
0.012004
Multi-scale Simulation for Microsurgery Trainer · ICRA 2004
Electronic design automation
circuit simulation
0.012004
A parallel fast Fourier transform on multipoles (FFTM) algorithm for electrostatics analysis of three-dimensional structures · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2004
Performance modeling and evaluation › numerical algorithms
fast multipole method
0.012004
A parallel fast Fourier transform on multipoles (FFTM) algorithm for electrostatics analysis of three-dimensional structures · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2004
Parallel and multicore computing › parallel computing
parallel scientific computing
0.012004
A parallel fast Fourier transform on multipoles (FFTM) algorithm for electrostatics analysis of three-dimensional structures · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2004
Computer animation and physical simulation
finite element method
0.012004
Multi-scale Simulation for Microsurgery Trainer · ICRA 2004
Computer animation and physical simulation
multi-scale simulation
0.012004
Multi-scale Simulation for Microsurgery Trainer · ICRA 2004

Methods — techniques the papers use, named apart from their topics

multi-scale mesh hierarchy · 0.1finite element method · 0.1parallel computation · 0.0multipole and local expansions · 0.0fast fourier transform on multipoles · 0.0
YearPublicationVenuePosition
2025 Deep transferable model with multi-head attention for small sample fault diagnosis of hydraulic pumps
Shengnan Tang, Zhengqi Yan, Yuhang Xue, Kian Meng Lim, Yong Zhu 0005
Eng. Appl. Artif. Intell.4
2004 Multi-scale Simulation for Microsurgery Trainer
abstract
For use in a Virtual Reality based training system for surgical micromanipulation, we have developed a fast multi-scale FEM algorithm that concentrates detail where needed while still handling global deformations. The resulting 6-to-7-fold speed up is promising for the development of real-time simulation of the mechanical response of a virtual organ or tissue. FEM algorithm uses elements from multiple levels in a hierarchy of mesh similar to the progressive mesh. This algorithm has been integrated with a visual/haptic feedback workstation.
Kian Meng Lim, Fei Wang 0010, Tim Poston, Chee Leong Teo, Etienne Burdet
ICRA1
2004 A parallel fast Fourier transform on multipoles (FFTM) algorithm for electrostatics analysis of three-dimensional structures
abstract
A fast algorithm, called the fast Fourier transform on multipoles (FFTM) method, is developed for efficient solution of the integral equation in the boundary element method (BEM). This method employs the multipole and local expansions to approximate far field potentials, and uses the fast Fourier transform (FFT) to accelerate the multipole to local translation operator based on its convolution nature. The series of uncoupled convolutions allows further speed up in the algorithm through parallel computation. In this paper, we present the results of using the FFTM algorithm for solving large-scale three-dimensional electrostatic problems. It is demonstrated that the method can give accurate results with relatively low order of expansion. It is also found that the serial version of the algorithm has computational complexities of O(N/sup a/), where a ranges from 1.0 to 1.4 for computational time, and from 1.1 to 1.2 for memory storage requirement. Significant speedup is also observed in the parallel implementation of FFTM using up to 16 processors on an IBM-p690 supercomputer.
Eng Teo Ong, Heow Pueh Lee, Kian Meng Lim
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3