• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1571-1580
• /
• 1999

When a hierarchical structure is derived from data set for data mining and machine learning, using a conceptual clustering algorithm, one of the unsupervised learning paradigms, it is not unusual to have a different set of outcomes with respect to the order of processing data objects. To overcome this problem, the first classification process is proceeded to construct an initial partition. The partition is expected to imply the possible range in the number of final classes. We apply center sorting to the data objects in the classes of the partition for new data ordering and build a new partition using ITERATE clustering procedure. We developed an algorithm, REIT that leads to the final partition with stable and best partition score. A number of experiments were performed to show the minimization of order bias effects using the algorithm.

• Journal of KIISE:Databases
• /
• v.28 no.1
• /
• pp.1-14
• /
• 2001

중대한 산업용 소프트웨어가 동작하는 공유된 객체지향 데이터베이스를 안전하게 변경하기 위해서는, 그 공유 데이터베이스를 변경할 동안 데이터베이스 위에서 작동하는 기존의 응용 프로그램이 지속적으로 작동되어야 한다. 데이터베이스 변경을 필요로 하는 새로운 요구사항은 새 응용 프로그램의 추가, 기존 응용 프로그램의 기능 확장, 초기 디자인 에러 수정 등으로 인하여 발생할 수 있다. 우리는 한 사람의 사용자가 다른 사용자에게 악영향을 주지 않고 데이터베이스 스키마를 변경할 수 있게 하여 이 문제를 해결하는 투명한 스키마 진화(TSE: Transparent Schema Evolution) 방법론을 소개한다. 이 방법론은 기존의 스키마를 직접 변경하는 대신 스키마 변경 연산의 의미를 반영하는 데이터베이스 큐를 공유 객체지향 데이터베이스 상에 생성하여 투명한 진화를 달성한다. 데이터베이스의 용량을 증가시키지 못하는 뷰 메카니즘의 한계를 극복하기 위하여 이 방법론은 데이터베이스 용량 증가 연산에 대하여 다음의 새 단계로 정렬된다. (1) 기저의 베이스 스키마는 데이터베이스 용량 증가를 위해 물리적으로 변호한다. (2) 데이터베이스 변경의 의미를 달성하는 목표 뷰가 위의 변화된 베이스 스키마로부터 생성된다. (3) 변화 이전의 베이스 스키마는 데이터베이스 뷰로서 재 구축된다. 이로써 기존의 다른 사용자가 정의한 데이터 인터페이스가 보존된다. 우리는 객체-지향 뷰 기술을 이용하여 스키마 변화 연산을 구현함으로써 TSE 방법론의 구현가능성(feasibility)을 확인하였다. 표준적인 객체-지향 뷰 모델이 정의되고 상용 객체-지향 데이터베이스인 잼스톤(Gemstone) 위에 구현되었다. 그 뷰 모델은 갱신 의미(semantic) 정의를 그 뷰가 베이스 스키마의 갱신 의미를 보존하도록 정의하였다. 그러한 뷰는 사용자가 그들이 실제로는 베이스 스키마가 아니라 뷰에서 작업하고 있다는 사실을 모르게 하기 위하여 TSE에서 필요하다.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.6
• /
• pp.595-602
• /
• 2008

In this paper, performance of the initial alignment for INS whose attitude is not leveled is investigated. Observability of the initial alignment filter is analyzed and estimation errors of the estimated state variables are derived. First, the observability is analyzed using the rank test of observability matrix and the normalized error covariance of the Kalman filter based on the 10-state model. In result, it can be seen that the accelerometer biases on horizontal axes are unobservable. Second, the steady-state estimation errors of the state variables are derived using the observability equation. It is verified that the estimates of the state variables have errors due to the unobservable state variables and the non-leveling tilt angles of a vehicle containing the INS. Especially, this paper shows that the larger the tilt angles of the vehicle are, the larger the estimation errors corresponding to the sensor biases are. Finally, it is shown that the performance of the 8-state model excepting the accelerometer biases on horizontal axes is better than that of the 10-state model in the initial alignment by simulation.

• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.7
• /
• pp.691-698
• /
• 2015

Inertial Navigation Systems (INS) are widely used as the main navigation device for aircraft. To get the initial attitude, the INS requires the initial alignment before navigation starts. An aircraft also needs an engine test procedure that causes some vibrations before flight. An INS can't be aligned in a vibration environment so the initial alignment is performed before the aircraft engine test. Therefore, the initial alignment time of an INS has been a major factor in limiting an aircraft's takeoff response time. In this paper, we designed an initial alignment algorithm that can be executed even in disturbances such as aircraft run-up. We demonstrated verification of the algorithm that is embedded on the real INS and testing methods to evaluate the alignment of the INS. We also analyzed the test results of the proposed initial alignment algorithm that is performed during a real aircraft run-up.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.05a
• /
• pp.696-698
• /
• 2022

게임에서는 장애물이 가로 막고 있을 때 길 찾기 알고리즘이 요구된다. Path Finding Method 는 길과 장애물을 고려하여 목적지까지의 경로를 찾는 방법을 말한다. A^* 알고리즘은 이런 복잡한 미로 찾기에 최적화된 Path Finding 알고리즘이다. 하지만, 모바일 같은 저비용 기기에서 A^* 알고리즘을 사용하기엔 단순한 지형에서도 연산 부하가 발생할 수 있다. 본 논문에서는 가상의 공간에서 Grid를 구축하여, 통행이 가능한 곳과 불가능한 곳을 나누어 최종 지점에 도달할 수 있도록 하는 방식을 제안한다. 본 논문에서 제시한 Path Finding Method 는 최종 지점이 막다른 길인 경우 가장 가까운 이동 가능한 경로로 길을 안내하도록 설계하여 예외 상황에 대처했다. 대표적인 길 찾기 알고리즘인 Dijkstra 알고리즘은 최소 비용을 고려해서 최단으로 가는 거리를 비교하여 길을 나타낼 수 있다. 하지만, Dijkstra 알고리즘 경우 비용이 양수가 아닌 음수의 경우 무한 루프에 빠지는 등 결과 값이 제대로 나오지 않을 수 있다. 본 논문에서 제안한 Path Finding Method 는 최소 비용을 노드별로 비교하는 방식이 아닌 초기 비용을 알 수 없는 분야에 쉽게 사용할 수 있다. 본 논문에서는 제안한 Path Finding Method 를 적용하여 Web 게임을 제작하는 것에 성공하였다. 향후, Path Finding Method 결과에 위치 정렬 알고리즘을 적용하여, 중복된 지역을 가는 확률을 최소화하면서 정리된 Path 가 돌출되도록 연구할 예정이다. 본 논문의 Path Finding Method 은 게임 개발 분야에 적극 기여되길 바란다.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.37 no.3
• /
• pp.275-282
• /
• 2009

Generally, the sinusoidal cavity dither is adopted to ring laser gyroscope for eliminating the lock-in which is non-linear effect at the small rotation input. Despite this method, there are some remained errors which are generated at the dither turnaround, and those errors produce random walk which is a general character of a ring laser gyroscope. As one of the numerous research results for compensating these errors, there is a special lock-in compensation method which is the method of error estimation and compensation by comparing the beat signal periods of before and after the dither turnarounds. In this paper, by ring laser gyroscope modeling and numerical analysis, we verified the theoretical validity and confirmed the effectiveness of this method in expectation of the possible beat signal measurement time resolution. As a result, we confirmed the random walk decreases from a-half to a-third by this lock-in compensation method. So, it is expected to be a remarkable method for reducing the INS alignment time.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.31 no.2
• /
• pp.62-72
• /
• 2019

Due to the difficulties in forecasting the intensity and the source location of tsunami the countermeasures prepared based on the deterministic approach fail to work properly. Thus, there is an increasing demand of the tsunami hazard analyses that consider the uncertainties of tsunami behavior in probabilistic approach. In this paper a fundamental study is conducted to perform the probabilistic tsunami hazard analysis (PTHA) for the tsunamis that caused the disaster to the east coast of Korea. A logic tree approach is employed to consider the uncertainties of the initial free surface displacement and the tsunami height distribution along the coast. The branches of the logic tree are constructed by reflecting characteristics of tsunamis that have attacked the east coast of Korea. The computational time is nonlinearly increasing if the number of branches increases in the process of extracting the fractile curves. Thus, an improved method valid even for the case of a huge number of branches is proposed to save the computational time. The performance of the discrete weight distribution method proposed first in this study is compared with those of the conventional sorting method and the Monte Carlo method. The present method is comparable to the conventional methods in its accuracy, and is efficient in the sense of computational time when compared with the conventional sorting method. The Monte Carlo method, however, is more efficient than the other two methods if the number of branches and the number of fault segments increase significantly.

• KIPS Transactions on Computer and Communication Systems
• /
• v.11 no.6
• /
• pp.167-174
• /
• 2022

PIPO lightweight block ciphers were announced in ICISC'20. In this paper, a single-block optimization implementation and parallel optimization implementation of PIPO lightweight block cipher ECB, CBC, and CTR operation modes are performed on a 32-bit RISC-V processor. A single block implementation proposes an efficient 8-bit unit of Rlayer function implementation on a 32-bit register. In a parallel implementation, internal alignment of registers for parallel implementation is performed, and a method for four different blocks to perform Rlayer function operations on one register is described. In addition, since it is difficult to apply the parallel implementation technique to the encryption process in the parallel implementation of the CBC operation mode, it is proposed to apply the parallel implementation technique in the decryption process. In parallel implementation of the CTR operation mode, an extended initialization vector is used to propose a register internal alignment omission technique. This paper shows that the parallel implementation technique is applicable to several block cipher operation modes. As a result, it is confirmed that the performance improvement is 1.7 times in a single-block implementation and 1.89 times in a parallel implementation compared to the performance of the existing research implementation that includes the key schedule process in the ECB operation mode.

• Journal of Advanced Navigation Technology
• /
• v.17 no.1
• /
• pp.115-122
• /
• 2013

Disease diagnostics based on medical imaging is getting popularity day by day. Presence of the atherosclerosis is one of the causes of narrowing of carotid arteries which may block partially or fully blood flow into the brain. Serious brain strokes may occur due to such types of blockages in blood flow. Early detection of the plaque and taking precautionary steps in this regard may prevent from such type of serious strokes. In this paper, we present an automatic image segmentation technique for carotid artery ultrasound images based on active contour approach. In our experimental study, we assume that ultrasound images are properly aligned before applying automatic image segmentation. We have successfully applied the automatic segmentation of carotid artery ultrasound images using snake based model. Qualitative comparison of the proposed approach has been made with the manual initialization of snakes for carotid artery image segmentation. Our proposed approach successfully segments the carotid artery images in an automated way to help radiologists to detect plaque easily. Obtained results show the effectiveness of the proposed approach.

• The Journal of the Korea Contents Association
• /
• v.18 no.8
• /
• pp.118-126
• /
• 2018

In order to dominate the multiple-targets of high threat in the initial stage of combat, it is necessary to maximize the combat effect by rapidly firing as many weapons as possible within a short time. Therefore, it is mandatory to establish the effective weapon allocation and utilize them for the combat. In this paper, we propose a weapon assignment algorithm for rapid reaction in multi-target and multi-weapon environments. The proposed algorithm maximizes the combat effect by establishing the fire plan that enables the rapid action with the operation of low complexity. To show the superiority of our algorithm, we implement the evaluation and verification of performances through the simulation and visualization of our algorithm. Our experimental results show that the proposed algorithm perform the effective weapon assignment, which shows the high target assignment rate within the fast hour even under the large-scale battle environments. Therefore, our proposed scheme are expected to be highly useful when it is applied to real weapon systems.