• 한국통신학회논문지
• /
• 제29권12C호
• /
• pp.1722-1728
• /
• 2004

다수의 인증 경로가 존재하는 PKI 구조에서 인증 경로를 설정하는 것은 중요한 문제이다. 경로 설정은 다양한 검증을 통해 이루어지고 검증이 많을수록 경로의 유효성은 높아진다. 유효성 높은 경로의 선택은 경로 설정 및 검증 작업의 반복 횟수를 감소시킴으로서 고속의 인증서 검증이 가능하도록 하는 반면에 하나의 경로를 설정하는데 소요되는 시간 및 부담을 증가시킨다는 문제점을 가진다. 본 논문에서는 보다 적은 부합으로 경로의 유효성을 높일 수 있는 효율적인 인증 경로 설정 알고리즘을 제안한다.

• 영재교육연구
• /
• 제25권4호
• /
• pp.511-528
• /
• 2015

창의적 잠재력이 실현된 재능으로 발달하는 과정은 복합적이고 비선형적이다. 이러한 특성은 단기적으로 어떤 문제를 해결해야 하는 상황에서보다 장기적으로 창의적인 삶을 살아가야 하는 과정에서 더욱 두드러진다. 본 연구는 대학생을 대상으로 창의적 과정 이론 중 하나인 Sawyer의 Zigzag 모델을 토대로 창의성 경로 척도(CPI: Creativity Path Inventory)를 개발하고 척도의 신뢰도와 타당도를 검증하였다. 이에 모델의 각 단계 특성을 반영한 8요인 88문항을 개발하였으며, 문항분석과 구인 타당도 검증 과정을 통해 최종 7요인(생각해내기, 배우기, 궁금해하기, 도전하기, 되돌아보기, 구현하기, 연결하기) 38문항을 확정하였다. CPI 전체 38문항의 내적 합치도는 .835로 나타나 신뢰로운 척도임이 확인되었고, 최종 모형의 적합도 지수 역시 양호한 결과를 보였다. 신뢰도와 타당도가 입증된 CPI는 일상적 창의성의 관점에서 창의성을 발현하고자 하는 사람들이 자신의 강점과 약점을 스스로 점검함으로써 자기계발을 할 수 있도록 도움을 줄 것이다.

• 대한전기학회논문지:전력기술부문A
• /
• 제48권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).

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2014년도 추계학술대회 논문집
• /
• 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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 하계학술대회 논문집 D
• /
• 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.

• 한국자동차공학회논문집
• /
• 제9권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.

• 한국정밀공학회지
• /
• 제12권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년도 ICCAS
• /
• 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.

• 대한물리의학회지
• /
• 제11권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.

• 제어로봇시스템학회논문지
• /
• 제11권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.