• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.2
• /
• pp.103-109
• /
• 2010

The edit distance problem is finding the minimum number of edit operations to transform a string into another one. It is one of the important problems in algorithm research and there are some algorithms that compute an optimal edit distance for the one-dimensional languages such as the English alphabet. However, there are a few researches to find the edit distance for the more complicated language such as the Korean or Chinese alphabet. In this paper, we define the measure of the edit distance for the Korean alphabet and present an algorithm for the edit distance problem for the Korean alphabet.

• 한국정보교육학회:학술대회논문집
• /
• 2007.08a
• /
• pp.108-113
• /
• 2007

온라인 학습 환경을 효율적으로 구성하는 것은 학습자의 학습 성공을 촉진할 뿐만 아니라 학습과정의 이해에 절대적으로 필요한 일이다. 만일 학습자와 교수자가 효율적으로 교류하면 학습자가 느끼는 심리적 거리감은 상당히 최소화될 수 있을 것이다. 이 연구는 학습자들의 온라인 학습에서 교류적 거리의 구조 지각은 성별에 따라 달라지는가를 알아보고 온라인 환경에서의 수업만족도, 지속성, 학업성취도에 가장 큰 영향을 미치는 구조의 하위영역이 무엇인지를 밝혀 학습자들의 학습효과를 체계적으로 높일 수 있는 온라인 환경의 요소를 탐색하는데 있다. 설문을 통해 수집된 자료는 연구 목적에 따라 다양한 분석을 실시하였다. 이 연구 결과 학습자의 일반적 특성인 성별에 따른 교류적 거리의 구조 지각수준은 의의있는 차이가 없었다(p>.05). 교류적 거리의 구조 지각수준과 학습자가 지각하는 수업만족도간에 의의있는 상관이 있었으며, 학습자의 학습 지속성과도 통계적으로 의의있는 상관이 있는 것으로 나타났다. 그러나 학업성취도와 교류적 거리의 구조 지각수준 간에는 유의의한 차이가 발견되지 않았다(p>.05). 교류적 거리의 구조 하위영역 중 수업만족도에 대한 영향력이 큰 하위영역은 과정 상호 작용이며, 학습 지속성에 대한 영향력이 큰 하위영역은 내용 구성요인으로 나타났다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.8
• /
• pp.385-393
• /
• 2008

The best coverage problem is finding a path whose worst distance to the sensor-set is the best among all paths. Instead, if the user stays close to its nearest two sensors, then the stability of the wireless connection may be guaranteed. So we consider the problem of finding a second best coverage path; given the sensor set U, a starting point s and a target point t, find a path whose worst distance to the second closest sensor is minimized. This paper presents an O(n logn) -time algorithm to find such a path. We also give experimental evidence showing that the connection to the sensor-set along a second best coverage path is more stable than that along the best coverage path.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.357-358
• /
• 2018

The track radar use the range track loop to track the target range. The bandwidth of the radar range tracker can be determined by tradeoff according to signal to noise ratio and the target range. On the other hand, electronic warfare is carried out to prevent the radar from tracking targets by electronic attack. The deception or noise jamming in electronic warfare can be performed to interfere with the range track loop of the radar. In order to efficiently perform electronic warfare, the bandwidth in radar tracking loop is estimated and can be used for electronic attack. To do this, we have studied the method of estimating the bandwidth of radar tracking loop using the variables that can be gathered in electronic warfare.

• Journal of Internet Computing and Services
• /
• v.15 no.2
• /
• pp.1-7
• /
• 2014

This paper presents an analytical method for finding the optimum transmission range in mobile ad hoc networks(MANETs). The results are particularly useful for the operation of military networks, as the transmission range affects the throughput, delay, and battery consumption. Plus, the proposed method allows the optimum transmission range to be determined in advance when deploying combatants with mobile terminals. And we analyze the battery life-time and the optimum transmission range under various propagation scenarios based on Hata propagation model. The proposed method obtains the optimum transmission range in a MANET based on the operational conditions.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.127-130
• /
• 2009

In this paper, we introduce a Y/T(Yard Tractor) Multi-Cycle System on the basis of RTLS that improves a low efficient loading and unloading. In the proposed approach, we apply the best suited algorithm looking for seeking of the optimum path and the shortest movement distance. In this paper, Our experiment results show that rate of a driving distance is reduced more than 12% compared to the average value, and that is reduced more than 23% compared to the maximum value.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.1
• /
• pp.83-90
• /
• 2010

The number of searched nodes and the computation time in an index should be minimized for optimizing the processing cost of the nearest neighbor query. The Measurement of search distance considered a circular location property of objects is required to accurately select the nodes which will be searched in the nearest neighbor query. In this paper, we propose the processing method of the nearest neighbor query be considered a circular location property of object where the search space consists of a circular domain and show its performance by experiments. The proposed method uses the circular minimum distance and the circular optimal distance which are the search measurements for optimizing the processing cost of the nearest neighbor query.

• The KIPS Transactions:PartA
• /
• v.11A no.2
• /
• pp.189-194
• /
• 2004

This paper describes method to distribute much high-dimensional facial expression motion data to 2 dimensional space, and method to create facial expression animation by select expressions that want by realtime as animator navigates this space. In this paper composed expression space using about 2400 facial expression frames. The creation of facial space is ended by decision of shortest distance between any two expressions. The expression space as manifold space expresses approximately distance between two points as following. After define expression state vector that express state of each expression using distance matrix which represent distance between any markers, if two expression adjoin, regard this as approximate about shortest distance between two expressions. So, if adjacency distance is decided between adjacency expressions, connect these adjacency distances and yield shortest distance between any two expression states, use Floyd algorithm for this. To materialize expression space that is high-dimensional space, project on 2 dimensions using Sammon's Mapping. Facial animation create by realtime with animators navigating 2 dimensional space using user interface.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.1
• /
• pp.41-49
• /
• 2015

The common way to obtain a stereoscopic image of a subject at a distance is to place two cameras on the parallel axis rather than crossing axis. To find the IAD and maximum focal length, left and right images are obtained by varying the IAD of cameras and the focal length of the camera lens and the depth budget for the obtained images is analyzed through post production. Then, the database for IAD and focal length of the camera lens with the depth range that does not cause visual fatigue and visual discomfort are developed. These data are used to design fuzzy control and deduce the IAD and focal length of the camera lens to shoot a subject at a distance, and the function of the fuzzy control is confirmed through the actual shooting within the range of deduced IAD and focal length of the camera lens.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10b
• /
• pp.647-649
• /
• 1999

본 논문은 매쉬 분할시 생성되는 정점들과 그 점들의 극한위치와의 차이로 정의되는 근접거리 메트릭을 이용한 적응적 Loop 메쉬분할법을 제안한다. 근접거리 메트릭은 모든 approximation 분할법에 적용가능하며, 이 메트릭을 이용하여 초기메쉬를 사용자 입력 허용치에 따라 적응적으로 분할하여 적은 데이터로 극한메쉬에 근접한 결과를 생성할 수 있다. 또한, 본 논문에서 제시한 적응적 Loop 분할법은 다단계 메쉬표현이나 메쉬 편집 등 Loop 메쉬분할법이 사용되는 알고리즘에 유용하게 적용시킬 수 있다.