• Korean Journal of Cognitive Science
• /
• v.13 no.1
• /
• pp.1-11
• /
• 2002

In this paper, a test was performed to determine whether words in Anchor Text were appropriate as key words. As a result of the test. there were proper words of high weighting factor, while some others did not even appear in the text. therefore, were not appropriate as key words. In order to resolve this problem. a new method was proposed to extract key words. Using the proposed method, inappropriate key words can be removed so that new key words be set, and then, ranking becomes possible with the TFIDF value as a weighting factor of the key word. It was verified that the new method has higher accuracy compared to the previous methods.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.4
• /
• pp.433-441
• /
• 1992

This paper describes an algorithm that can efficiently analyze the ECG signal using frame knowledge representation technique. Input to the analysis process is a set of significant points which have been extracted from an original sampled signal(lead II) by the syntactic peak recognition algorithm. The hierarchical property of ECG signal is represented by hierarchical AND/OR graph. The semantic information and constraints of the ECG signal are desctibed by frame. As the control mechanism for labeling points, the search mechanism with the mixed paradigms of data-driven and model driven hypothesis formation, scoring function, hypothesis modification network and instance inheritance are used. We used the CSE database in order to evaluate the performance of the proposed algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.575-579
• /
• 1990

This paper describes an algorithm that can efficiently analyze the multichannel ECG signal using the frame. The input is a set of significant features (points) which have been extracted from an original sampled signal by using the split-and-merge algorithm. A signal from each channel can be hierarchical ADN/OR graph on the basis of the priori knowledge for ECG signal. The search mechanisms with some heuristics and the mixed paradigms of data-driven hypothesis formation are used as the major control mechanisms. The mutual relations among features are also considered by evaluating a score based on the relational spectrum. For recognition of morphologies corresponding to OR nodes, an hypothesis modification strategy is used. Other techniques such as instance, priority update of prototypes, and template matching facility are also used. This algorithm exactly recognized the primary points and supporting points from the multichannel ECG signals.

• Annual Conference of KIPS
• /
• 2001.04b
• /
• pp.1165-1168
• /
• 2001

최단경로문제(Shortest Path Problem)는 네트???p에서 하나 혹은 그 이상의 노드들의 쌍 사이에서 가장 짧은 경로, 가장 저렴한 경로 또는 가장 신뢰할 만한 경로를 찾을 때 고려된다. 컴퓨터나 통신망들은 edge-weighted 그래프로 대치될 수 있으며 그렇게 함으로써 최단 경로를 찾아줄 수 있다. 통신 링크는 실제 실패할 수도 있고, 또한 전송될 데이터의 양에 따라 전달되는 시간이 달라지기도 하므로, 가장 신뢰할만한 경로 중에서 가장 빠른 경로(The Quickest Most Reliable Path) 문제와 가장 빠른 경로 중에서 가장 신뢰할만한 경로(The Most Reliable Quickest Path) 문제는 최단경로문제보다 더 현실적이다[1]. 이 논문에서는 그 중 '가장 신뢰할만한 경로 중에서 가장 빠른 경로' 문제를 자바를 사용하여 시각화함으로써 가변 상황에 따라 다른 경로를 찾아주는 과정을 보여준다.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.38 no.8
• /
• pp.658-666
• /
• 1989

In this paper, an efficient algorithm for estimation volume and surface area and a reconstruction algorithm for 3-dimensional graphics are presented.In order to improve computing efficiency, the graph theory is utilized and the algorithm to obtain proper contour points is developed by considering several tolerances. Search for the contour points is limited by the change of curvature of cross sectional contour to provide efficiency in searching the minimum cost path. In computer simulation of these algorithms, the results show that, for the tolerance values of 1.001 and 1.002, the execution time reduced to 66%-80% and the error for the measured value is less than 3%. The reconstructed 3-dimensional images from the cross sections can be analyzed in many directions using the graphic scheme.

• 한국신재생에너지학회:학술대회논문집
• /
• 2009.11a
• /
• pp.409-412
• /
• 2009

In this research, the intensity of solar energy, which was injected to the different angle plane every hour day by day, was technically documented and quantitatively analyzed through actual observations. In order to group every days into days with similar intensity, graph was drawn with respect to time for every day and each area value under the curve was calculated. Then, the search for grouped days having similar intensity curve patterns was carried out and the optimum incident angle of absorber plate was derived to maximize the efficiency of solar energy systems.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.576-579
• /
• 2002

This paper presents the jacobian analysis of new type Casing Oscillator using the inverse kinematics, and to search for it's singularities through the jacobian analysis. All parallel manipulator have some singularities in workspace or it's outside workspace. Singularities were cleared by many other study of parallel manipulator f3r that reason recent publication of device control. In this paper defined that singularities of new file of Casing Oscillator and, to show it's graph. Finally this paper will be used for a practical example for construction spot, aviation simulator, vehicles simulator, military equipment etc.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.208-210
• /
• 2002

재생기에서 MP4 파일을 재생하기 위해서는 Drawing 정보와 Routing 정보가 필요하다. 기존의 저작도구에서의 객체 Naming은 그 객체와는 상관없이 단순히 문자열과 숫자의 조합으로 되어 있고 실제 화면상에 기술되는 객체의 ID값을 부여하는 방법이었다. 객체 Naming을 구현하는 객체 ID 설정이 이러한 방법이었기 때문에 재생기에서 객체 정보를 구하려면 Scene 그래프를 반복해서 검색하는 load가 발생한다. 본 논문에서는 이러한 load를 줄이기 위해서 비트 연산을 이용한 각 객체의 ID를 부여함으로써 각 객체에 속하는 Attribute의 ID가 자신의 실제 객체의 ID를 추론할 수 있는 방법으로 객체에 대한 Naming을 구현하였다. 이러한 객체 Naming 기법으로 설정된 객체의 ID값은 비트 연산과 시프트 연산을 이용해서 객체 정보를 구할 수 있기 때문에 Scene 그래프 탐색 load를 줄일 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.343-346
• /
• 2011

대부분의 퍼즐 게임에서 발생 할 수 있는 중요한 문제 중 하나는 교착상태 문제이다. 본 논문에서는 이러한 교착상태를 해결하기 위해 퍼즐 게임을 그래프 기법으로 나타낸 뒤, 이를 이용한 새로운 교착상태 발견 기법인 Cycle Detection을 제안한다. 기존의 기법들은 알고리즘을 수행하는데 너무 많은 시간이 걸리거나, 패턴에 대한 데이터베이스가 구축되어 있어야 하기 때문에 실시간으로 교착상태를 발견하기엔 문제가 있다. 본 논문에서는 이러한 문제점을 해결하기 위하여 탐색해야 하는 노드의 개수를 최대한 줄이는 Local search 기법과 Pruning 기법을 적용하여 퍼즐 게임을 플레이하는 동안 실시간으로 교착상태를 발견할 수 있는 기법을 제안한다. 본 기법은 성능을 평가하기 위해 실제 퍼즐게임 환경에서 알고리즘을 수행하고, 그 결과로 검색하는 노드의 개수와 검색 시간을 기존의 기법과 비교하여 성능향상을 확인하였다.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.2
• /
• pp.89-95
• /
• 2002

Global routing is to assign each net to routing regions to accomplish the required interconnections. The most popular algorithms for global routing inlcude maze routing algorithm, line-probe algorithm, shortest path based algorithm, and Steiner tree based algorithm. In this paper we propose weighted network heuristic(WNH) as a minimal Steiner tree search method in a routing graph and a genetic algorithm based on WNH for the global routing. We compare the genetic algorithm(GA) with simulated annealing(SA) by analyzing the results of each implementation.