• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.36 no.10
• /
• pp.996-1002
• /
• 2008

This paper presents the development of a real-time algorithm for collision detection, collision avoidance and guidance to way-point. Three-dimensional point-mass aircraft models are used. For collision detection, time of closest point of approach(CPA) and distance at CPA are compared to threshold values. For collision avoidance, optimal acceleration input which maximizes the terminal relative distance is calculated based on optimal control theory. For guidance to way-point, proportional navigation guidance, the well-known method, is used. Two scenarios of encounter situation are illustrated to validate performance of proposed algorithm.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.260-262
• /
• 2004

Spatial database system provides many query types and most of them are required frequent disk I/O and much CPU time. k-NN search is to find k-th closest object from the query point and up to now, several k-NN search methods have been proposed. Among these, MINMAX distance method has an aim not to visit unnecessary node by applying pruning technique. But this method access more disk than necessary while pruning unnecessary node. In this paper, we propose new k-NN search algorithm based on density of object. With this method, we predict the radius to be expected to contain k-NN object using density of data set and search those objects within this radius and then adjust radius if failed. Experimental results show that this method outperforms the previous MINMAX distance method. This algorithm visit fewer disks than MINMAX method by the factor of maximum $22\%\;and\;average\;6\%.$

• Proceedings of the KIEE Conference
• /
• 1989.07a
• /
• pp.195-201
• /
• 1989

Voltage collapse is a serious concern to the electirc utility industry. It is common to associate steady-state stability with the ability of the transmission system to transport real power and to associate voltage collapse with the inability to provide reactive power at the necessary locations within the system. An algorithm to directly calculate the critical point of system voltage collapse was presented by the authors. The method (based on the ordinary power flow equations and explicit requirement of singularity of the Jacobian matrix) is basically one degree of freedom with proper load distribution factors. This paper suggests a modified algorithm to increase the degree of freedom, introducing the nonlinear programming technique. The objective function is a distance measure between the present operating point and the closest voltage collapse point. Knowledge of the distance and the most vulnarable bus from the voltage collapse point of view may be used as a useful index for the secure system operation.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.7
• /
• pp.101-108
• /
• 1998

In this paper, after we got to realized FDNN (fuzzy decision neural network) applied the quantization triangularity fuzzy function to DBNN(decision based neural network) of a hierarchical structure for image process, we could esign hardware of the realized FDNN. Also it is normalized the standard image and the input image as the same size. We are applied DWW algorithm which selected the closest value with finding similarity of an interval image by this distance to FDNN. So we could calulated in terms of distance to weight of pixel which composed two image and eliminated the nise of image, minimized the lost of information, obtained the optimal information. It is designed hardware of high speed weighted FDNN using COMPASS tool. Aslo, the total circuit is realized as gates of 61,000 and could show to superiority of FDNN using the simulation.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2023.05a
• /
• pp.263-264
• /
• 2023

본 연구는 자율운항선박의 실제 해상에서의 성능 검증하기 위한 실험을 진행하였다. 먼저 SAS(Samsung Autonomous System)을 활용하여 시뮬레이션을 진행하였다. 시뮬레이션은 Imazu 조우 모델을 기반으로 실험을 진행하였다. 시뮬레이션에서 조우 선박은 2-4척으로 정면, 횡단, 추월 등이 뒤섞인 상황을 가정하였다. 결과 분석은 6가지 항목(속력, Heading, Rate of Turn, Collison Risk Index, DCPA, TCPA, Closest Distance, XTD(Cross-Track Distance))을 분석하였다. 2 차례의 실해역 실험을 진행하였다. 목포-제주도 구간에서 실해역 실험을 진행 후 목포-이어도-독도 항로에서 실해역 실험을 진행하였다. 실해역 실험 결과 Imazu 모델 기반 시뮬레이션과 비슷한 결과를 보였다.

• International journal of advanced smart convergence
• /
• v.12 no.4
• /
• pp.171-176
• /
• 2023

This study is about a speech recognition error correction system designed to detect and correct speech recognition errors before natural language processing to increase the success rate of intent analysis in natural language processing with optimal efficiency in various service domains. An encoder is constructed to embedded the correct speech token and one or more error speech tokens corresponding to the correct speech token so that they are all located in a dense vector space for each correct token with similar vector values. One or more utterance tokens within a preset Manhattan distance based on the correct utterance token in the dense vector space for each embedded correct utterance token are detected through an error detector, and the correct answer closest to the detected error utterance token is based on the Manhattan distance. Errors are corrected by extracting the utterance token as the correct answer.

• Spatial Information Research
• /
• v.20 no.2
• /
• pp.165-172
• /
• 2012

The query of the K closest object pairs between two object sets frequently occurs at recently retrieval systems. The circular location property of objects should be considered for efficiently process queries finding such a K nearest object pair. In this paper, we propose the optimal algorithm finding the K object pairs which are closest to each other in a search space with a circular domain and show its performance by experiments. The proposed algorithm optimizes the cost of finding the K nearest object pairs by using the circular search distances which is much applied the circular location property.

• Journal of Information Technology Services
• /
• v.13 no.4
• /
• pp.359-375
• /
• 2014

Researchers cannot avoid missing data in collecting data, because some respondents arbitrarily or non-arbitrarily do not answer questions in studies and experiments. Missing data not only increase and distort standard deviations, but also impair the convenience of estimating parameters and the reliability of research results. Despite widespread use of hot deck, researchers have not been interested in it, since it handles missing data in ambiguous ways. Hot deck can be complemented using K-nn, a method of machine learning, which can organize donor groups closest to properties of missing data. Interested in the role of k-nn, this study was conducted to impute missing data based on the hot deck method using k-nn. After setting up imputation of missing data based on hot deck using k-nn as a study objective, deletion of listwise, mean, mode, linear regression, and svm imputation were compared and verified regarding nominal and ratio data types and then, data closest to original values were obtained reasonably. Simulations using different neighboring numbers and the distance measuring method were carried out and better performance of k-nn was accomplished. In this study, imputation of hot deck was re-discovered which has failed to attract the attention of researchers. As a result, this study shall be able to help select non-parametric methods which are less likely to be affected by the structure of missing data and its causes.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.1
• /
• pp.159-166
• /
• 2004

Custom-tailored products are meant by the products having various sizes and shapes to meet the customer's different tastes or needs. Thus fabrication of custom-tailored products inherently involves inefficiency. To minimize this inefficiency, a new paradigm is proposed in this work. In this paradigm, different parts are grouped together according to their sizes and shapes. Then, representative shape of each group is derived and it will be used as the work-piece from which the parts in the group are machined. Once a new product is ordered, the optimal work-piece is selected through making similarity comparisons of new product and each representative shape. Then an effective NC tool-path is generated to machine only the different portions between the work-piece and the ordered product. The efficient machining conditions are also derived from this shape difference. By machining only the different portions between the work-piece and the ordered product, it saves time. Similarity comparison starts with the determination of the closest pose between two shapes in consideration. The closest pose is derived by comparing the ray distances while one shape is virtually rotated with respect to the other. Shape similarity value and overall similarity value calculated from ray distances are used for grouping. A prototype system based on the proposed methodology has been implemented and applied to the grouping and machining of the shoe lasts of various shapes and sizes.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.70-73
• /
• 2003

Custom-tailored products are meant by the products having various sizes and shapes to meet the customer's different tastes or needs. Thus fabrication of custom-tailored products inherently involves inefficiency. To minimize this inefficiency, a new paradigm is proposed in this work. In this paradigm. different paris are grouped together according to their sizes and shapes. Then, representative shape of each group is derived and it will be used as the work-piece from which the parts in the group are machined. Once a new product is ordered, the optimal work-piece is selected through making similarity comparisons of new product and each representative shape. Then an effective NC tool-path is generated to machine only the different portions between the work-piece and the ordered product. The efficient machining conditions are also derived from this shape difference. By machining only the different portions between the work-piece and the ordered product, it saves time. Similarity comparison starts with the determination of the closest pose between two shapes in consideration. The closest pose is derived by comparing the ray distances while one shape is virtually rotated with respect to the other. Shape similarity value and overall similarity value calculated from ray distances are used for grouping. A prototype system based on the proposed methodology has been implemented and applied to the grouping and machining of the shoe lasts of various shapes and sizes.