• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12C
• /
• pp.1722-1728
• /
• 2004

To discover a certificate path is a very important topic in the PKI with a lot of candidate paths. The certificate path discovery processing is executed via many verifications and as the number of verification times increases, the validity of the discovered path becomes high. The selection of the path with high validity provides high-speed certificate validation by reducing the number of repetition times of path discovery and validation processing. Otherwise, there is a problem that the speed and computation overheads are increased. In this paper, we propose an efficient certificate path discovery algorithm can make high the certificate validity with low overhead.

• Journal of Gifted/Talented Education
• /
• v.25 no.4
• /
• pp.511-528
• /
• 2015

The development process from creative potential to realized talent is complex and non-linear. This feature of the process stands out more in the process of living a creative life in the long-term rather than in a situation to solve certain problems in the short-term. The purpose of this study is to develop Creativity Path Inventory (CPI) for undergraduate students based on Sawyer's Zigzag Model which is one of creative process theories and to verify reliability and validity of the inventory. Thus, reflecting the characteristics of each stage of the model, this study developed 88 items in 8 factors and finally confirmed 38 items in 7 factors through item analysis and verification process on construct validity. Internal consistency of a total of 38 items in CPI turned out to be .835, confirming the reliability of the inventory and goodness-of-fit index of the final model also demonstrated an appropriate result. CPI with verified reliability and validity will help enable people who want to manifest creativity in view of everyday creativity to realize self-improvement by self-reporting their strengths and weaknesses on their own.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.1
• /
• pp.61-67
• /
• 1999

There has been an ever increasing interest in mobile robot for home services. However, issues currently being investigated for path planning of the mobile robot is concentrated to solving the problem of finding the optimal path from the initial location to the final location under the given performance index. In this study, we newly present a sweeping algorithm for autonomous mobile robot to cover the whole closed area under the unknown environment. And we verify the validity the validity of the formalized algorithm by computer simulation with the changing environment conditions. In addition to this, we analyse the effect of real system implementation of the proposed algorithm to a experimental miniature mobile robit(Khepera).

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2014.10a
• /
• pp.292-293
• /
• 2014

Transfer Path Analysis is technique predicting transmitted energy through each path. Using the Transfer Path Analysis, structure-borne noise and air-borne noise can be predicted from the system. In this study, however, the Transfer Path Analysis to target only the structure-borne noise due to the noise radiated from the vibrating panel was performed. Predicted noise by the Transfer Path Analysis and measured noise by the experiment were a high correlation. We confirmed the validity of the Transfer Path Analysis through the analysis of these results, showed how to apply the Transfer Path Analysis.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2417-2419
• /
• 2001

A path planning is one of the main subjects in a mobile robot. It is divided into two parts. One is a global path planning and another is a local path planning. This paper, using the formal two methods, presents that the mobile robot moves to multi-targets with avoiding unknown obstacles. For the shortest time and the lowest cost, the mobile robot has to find a optimal path between targets. To find a optimal global path, we used GA(Genetic Algorithm) that has advantage of optimization. After finding the global path, the mobile robot has to move toward targets without a collision. FLC(Fuzzy Logic Controller) is used for local path planning. FLC decides where and how faster the mobile robot moves. The validity of the study that searches the shortest global path using GA in multi targets and moves to targets without a collision using FLC, is verified by simulations.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.9 no.1
• /
• pp.139-147
• /
• 2001

In this study a path control scheme of simulation models of various vehicles to evaluate their handling characteristic is developed. Based on the forward target method, path deviation error is estimated and the required steering effort to reduce the error is computed by Ziegler-Nichols PID control rule. Velocity control model is also included in the proposed path control scheme to achieve the desired velocity. The path control scheme is implemented on a full vehicle model to perform ISO test procedures, such as steady state cornering, lane change, and sinusoidal input, etc. Through the simulations of ISO test procedures and comparison with actual tests, effectiveness and validity of the path control model is demonstrated.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.7
• /
• pp.32-45
• /
• 1995

In this paper, we present a new method to tool path planning problem for rough cut of pocket milling operations. The key idea is to formulate the tool path problem into a TSP (Travelling Salesman Problem) so that the powerful neural network approach can be effectively applied. Specifically, our method is composed of three procedures: a) discretization of the pocket area into a finite number of tool points, b) neural network approach (called SOM-Self Organizing Map) for path finding, and c) postprocessing for path smoothing and feedrate adjustment. By the neural network procedure, an efficient tool path (in the sense of path length and tool retraction) can be robustly obtained for any arbitrary shaped pockets with many islands. In the postprocessing, a) the detailed shape of the path is fine tuned by eliminating sharp corners of the path segments, and b) any cross-overs between the path segments and islands. With the determined tool path, the feedrate adjustment is finally performed for legitimate motion without requiring excessive cutting forces. The validity and powerfulness of the algorithm is demonstrated through various computer simulations and real machining.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.131.4-131
• /
• 2001

A lot of path planning algorithms have been developed to find the collision-free path with minimum cost. But most of them require complicated computations. In this paper, a thinning method, which is one of the image processing schemes, was adopted to simplify the path planning procedure. In addition, critical points are used to find the shortest-distance path among all possible paths from the start to the goal point. Since the critical points contain the information on the neighboring paths, a new path can be quickly obtained on the map even when the start and goal points change. To investigate the validity of the proposed algorithm, various simulations have been performed for the environment where the obstacles with arbitrary shapes exist. It is shown that the optimal paths can be found with relative easiness.

• Journal of the Korean Society of Physical Medicine
• /
• v.11 no.4
• /
• pp.85-92
• /
• 2016

PURPOSE: A good, valid, and feasible tool for evaluating sit to stand (STS) is needed to help clinicians quantify the STS ability of stroke patients and people with balance disorders. The purpose of this study was to evaluate the concurrent validity of the Nintendo Wii Balance Board (WBB) and a force plate during STS and gait. METHODS: Seventeen healthy adults performed five trials of STS and gait on the WBB placed on the force plate. The force plate and the WBB were compared in regard to center of pressure (COP) and ground reaction force (GRF) data that were collected simultaneously. The variables used for analysis were time (s), integral summation (%), COP path length (mm), COP x range, and COP y range, all of which were measured for both tasks. Counter (%), peak (%), and rebound (%) were analyzed for STS, and $1^{st}$ peak (%), min peak (%), and 2nd peak (%) were analyzed for gait. The concurrent validity was analyzed using an intraclass correlation coefficient (ICC) and a standard error of measurement (SEM) with a 95% confidence interval. RESULTS: The concurrent validity of the WBB for STS ranged from fair to good (ICC=.701~.994, SEM=.029~3.815). The concurrent validity for gait was good (ICC=.869 ~.989, SEM=.007~2.052) aside from path length and x and y ranges of COP (ICC=-.150~.371, SEM=3.635~4.142). CONCLUSION: The GRF of the WBB has a good validity for STS and gait analysis. The WBB is remarkably portable, easy to use, and convenient for clinically assessing STS and gait.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.9
• /
• pp.789-794
• /
• 2005

This paper describes an algorithm for minimal turning complete coverage Path planning for cleaning robots. This algorithm divides the whole cleaning area by cellular decomposition, and then provides the path planning among the cells employing a flow network. It also provides specific path planning inside each cell guaranteeing the minimal turning of the robots. The minimal turning of the robots is directly related to the faster motion and energy saving. The proposed algorithm is compared with previous approaches in simulation and the result shows the validity of the algorithm.