default search action
Nam Ho Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j11]Seokgoo Kim
, Jooho Choi, Nam Ho Kim:
Inspection schedule for prognostics with uncertainty management. Reliab. Eng. Syst. Saf. 222: 108391 (2022) - [j10]Hyung Jun Park
A Trade-Off Analysis between Sensor Quality and Data Intervals for Prognostics Performance. Sensors 22(19): 7220 (2022) - 2021
- [j9]Seokgoo Kim
A Study Toward Appropriate Architecture of System-Level Prognostics: Physics-Based and Data-Driven Approaches. IEEE Access 9: 157960-157972 (2021) - [j8]Seokgoo Kim
Challenges and Opportunities of System-Level Prognostics. Sensors 21(22): 7655 (2021) - 2020
- [j7]Seokgoo Kim
Information Value-Based Fault Diagnosis of Train Door System under Multiple Operating Conditions. Sensors 20(14): 3952 (2020)
2010 – 2019
- 2016
- [j6]Jungho Park, Jong Moon Ha
Model-Based Fault Diagnosis of a Planetary Gear: A Novel Approach Using Transmission Error. IEEE Trans. Reliab. 65(4): 1830-1841 (2016) - 2015
- [j5]Dawn An, Nam Ho Kim, Joo Ho Choi:
Practical options for selecting data-driven or physics-based prognostics algorithms with reviews. Reliab. Eng. Syst. Saf. 133: 223-236 (2015) - [c4]Kwon-Ha Yoon, Tharoeun Thap, Chang-Won Jeong, Nam Ho Kim, Seung Noh, Yunyoung Nam, Jinseok Lee
Analysis of Statistical Methods for Automatic Detection of Congestive Heart Failure and Atrial Fibrillation with Short RR Interval Time Series. IMIS 2015: 452-457 - 2014
- [j4]DongHa Lim, Chul-Ho Park, Nam Ho Kim, Sang-Hoon Kim, YunSeop Yu
Fall-Detection Algorithm Using 3-Axis Acceleration: Combination with Simple Threshold and Hidden Markov Model. J. Appl. Math. 2014: 896030:1-896030:8 (2014) - 2013
- [j3]Dawn An, Joo Ho Choi, Nam Ho Kim:
Prognostics 101: A tutorial for particle filter-based prognostics algorithm using Matlab. Reliab. Eng. Syst. Saf. 115: 161-169 (2013) - 2012
- [j2]Nam Ho Kim, YunSeop Yu:
HFAT: Log-Based FAT File System Using Dynamic Allocation Method. J. Inform. and Commun. Convergence Engineering 10(4): 405-410 (2012) - [c3]Juhyeon Lee, Hyung-Kun Park, Nam Ho Kim, YunSeop Yu
Modified proportional fair scheduling for Cognitive Radio networks. ICUFN 2012: 232-233 - 2010
- [c2]Gyeongyong Heo, Reinhard Klette
Fuzzy support vector machine with a fuzzy nearest neighbor classifier for insect footprint classification. FUZZ-IEEE 2010: 1-6
2000 – 2009
- 2008
- [c1]Seong-Ho Choi, Hyung-Kun Park, Nam Ho Kim, Sang-Hoon Kim, YunSeop Yu
Design of A Power-, Delay-, and Emergency-Efficient Protocol of Ubiquitous Sensor Network Systems for Silver Town Applications. FGCN (2) 2008: 306-309 - 2002
- [j1]Iulian R. Grindeanu, Nam Ho Kim, Kung K. Choi, Jiun-Shyan Chen:
CAD-Based Shape Optimization Using a Meshfree Method. Concurr. Eng. Res. Appl. 10(1): 55-66 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: