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.

Han S. Kim

dblp:58/3036 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
0since 2021 · last 2005
0000-0002-6941-9868ORCID · corroborated

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

Computer networks · 3 · 3 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 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.

Artificial intelligence
1 paper
Robot manipulation · 100%
Computer networks
1 paper
Physical-layer communications · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation
parallel manipulator
0.012001
Forward/inverse force transmission capability analyses of fully parallel manipulators · IEEE Trans. Robotics Autom. 2001
Physical-layer communications
multiplexing
0.012001
Loss probability calculations and asymptotic analysis for finite buffer multiplexers · IEEE/ACM Trans. Netw. 2001
Performance modeling and evaluation
queueing models
0.012001
Loss probability calculations and asymptotic analysis for finite buffer multiplexers · IEEE/ACM Trans. Netw. 2001

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

large deviations · 0.1central limit theorem · 0.1asymptotic analysis · 0.1eigenvalue analysis · 0.0
YearPublicationVenuePosition
2005 The notion of end-to-end capacity and its application to the estimation of end-to-end network delays
Han S. Kim, Ness Shroff
Comput. Networks1
2003 An Approximation of the End-to-End Delay Distribution
Han S. Kim, Ness Shroff
IWQoS1
2001 Loss probability calculations and asymptotic analysis for finite buffer multiplexers
abstract
We propose an approximation for the loss probability, P/sub L/(x), in a finite buffer system with buffer size x. Our study is motivated by the case of a high-speed network where a large number of sources are expected to be multiplexed. Hence, by appealing to central limit theorem type of arguments, we model the input process as a general Gaussian process. Our result is obtained by making a simple mapping from the tail probability in an infinite buffer system to the loss probability in a finite buffer system. We also provide a strong asymptotic relationship between our approximation and the actual loss probability for a fairly large class of Gaussian input processes. We derive some interesting asymptotic properties of our approximation and illustrate its effectiveness via a detailed numerical investigation.
Han S. Kim, Ness Shroff
IEEE/ACM Trans. Netw.1
2001 Forward/inverse force transmission capability analyses of fully parallel manipulators
abstract
Presents the analytical methods to evaluate the forward/inverse force transmission capabilities of fully parallel manipulators. Two eigenvalue problems corresponding to the forward and inverse force transmission analyses are formulated. In view of the forward force transmission analysis, the conditions of the maximum isotropic force and moment transmissions are investigated for both planar and spatial parallel manipulators. Finally, numerical examples of the forward and inverse force transmission analyses are presented and the numerical algorithm of selecting actuator forces in the whole reachable workspace is suggested.
Han S. Kim, Yong J. Choi
IEEE Trans. Robotics Autom.1
1999 The kinetostatic capability analysis of robotic manipulators
abstract
This paper presents the analytical methods to evaluate the forward/inverse kinetostatic capabilities of robotic manipulators. The eigenvalue problems corresponding to the forward and inverse kinetostatic capability analyses have been formulated. The forward kinetostatic capability analysis is to determine the magnitude bounds of the force and moment (linear and angular velocity) vectors generated at the end-effector for the given magnitude of actuating forces (velocities). Conversely, the inverse analysis is to find the magnitude bound of actuating forces (velocities) for the given magnitudes of the force and moment (linear and angular velocity) vectors at the end-effector. The inverse analysis is important since it can provide a designer with valuable information about how to choose the actuators. It has been shown that the eigenvalues from the forward and inverse analyses have a reciprocal relation with each other, which implies that solving either of the eigenvalue problems may complete the forward/inverse kinetostatic capability analyses. It has been also presented that the proposed kinetostatic capability analysis can be extended to redundant manipulators.
Han S. Kim, Yong J. Choi
IROS1