• Proceedings of the KSPS conference
• /
• 2007.05a
• /
• pp.327-329
• /
• 2007

This paper presents a FSN-based LVCSR system and it's application to the speech TV program guide. Unlike the most popular statistical language model-based system, we used FSN grammar based on the graph theory-based FSN optimization algorithm and knowledge-based advanced word boundary modeling. For the memory and latency efficiency, we implemented the dynamic pruning scheduling based on the histogram of active words and their likelihood distribution. We achieved a 10.7% word accuracy improvement with 57.3% speedup.

• Language and Information
• /
• v.4 no.1
• /
• pp.43-65
• /
• 2000

Along with the flourishign development of computational linguistics, research on the meanings of individual words has started to resume. Polyusemous words are especially brought into focus since their multiple senses have placed a real challenge to linguists and computer scientists. This paper mainly concerns the following three questions with regard to the treatments of such polysemous nouns and verbs in English and Korean. Firstly, what types of information should be represented in individual lexical entries for those polysemous words\ulcorner Secondly, how different are corresponding polysemous lexical entries in both languages\ulcorner Thirdly, what does a mental lexicon look like with regard to polysemous lexical entries\ulcorner For the first and second questions, Pustejosky's (1995) Generative Lexicon Theory (hereafter GLT) will be discussed in detail: the main focus falls on developing alternative way of representing (polysemous) lexical entries. For the third question, a brief discussion is made on mapping between concepts and their lexicalizations. Furthermore, a conceptual graph around conept 'bake' is depicted in terms of Sowa(2000)

• The Journal of Information Technology and Database
• /
• v.3 no.1
• /
• pp.97-108
• /
• 1996

In this paper we obtain several function defined on finite partially ordered sets(posets) which may indicate constraints of comparability on sets of teams(tasks, etc.) for which evaluation is computationally simple, a relatively rare condition in graph-based algorithms. Using these functions a set of numerical coefficients and associated distributions obtained from a computer simulation of certain families of random graphs is determined. From this information estimates may be made as to the actual linearity of complicated posets. Applications of these ideas is to all areas where obtaining rankings from partial information in rational ways is relevant as in, e.g., team_, scaling_, and scheduling theory as well as in theoretical computer science. Theoretical consideration of special and desirable properties of various functions is provided permitting judgment concerning sensitivity of these functions to changes in parameters describing (finite) posets.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.1
• /
• pp.7-14
• /
• 1983

Linear feature such as lines and curves are one of important features in image processing. In this paper, new method of linear feature detection is suggested. Also, we have studied approximation technique which transforms detected linear feature into data structure for the practical. This method is based on graph theory and principle of this method is based on minimal spanning tree concept which is widely used in edge linking process. By postprocessing, Hairs and inconsistent line segments are removed. To approximate and describe traced linear feature, piecewise linear approximation is adapted. The algorithm is demonstrated through computer simulations.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.3
• /
• pp.155-160
• /
• 2001

본 논문은 영역별 근접 그래프 (geographic nearest neighbor graph)와 레인지 트리 (range tree)를 이용하여 평면 위의 n 개의 점에 대한 L$_{\infty}$ (L$_1$) 거리 (metric) 상의 디루니 삼각분할 (Delaunay triangulation)을 구축하는 방법을 소개한다. 이 방법은 L$_{\infty}$ (L$_1$) 거리 상에서 디루니 삼각분할에 있는 각 삼각형의 최소한 한 선분이 영역별 근접 그래프에 포함됨을 이용하여 레인지 트리 방법으로 디루니 삼각분할을 구축한다. 본 방법은 0(nlogn)의 순차계산 시간에 L$_{\infty}$ (L$_1$) 디루니 삼각분할을 구축하며, CREW-PRAM (Concurrent Read Exclusive Write Parallel Random Access Machine)에서 0(n)의 프로세서로 0(logn)의 병렬처리 시간에 L$_{\infty}$ (L$_1$) 디루니 삼각분할을 구축한다. 또한, 이 방법은 직선간의 교차점 계산 대신 거리비교를 하기 때문에 수치오차가 적고 구현이 용이하다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10b
• /
• pp.77-82
• /
• 2006

Situation awareness는 유비쿼터스 환경에서 사용자의 상황에 맞는 적절한 서비스를 제공하기 위한 방법으로, 다양한 context와 action이력을 기술하여 협동 시스템을 표현할 수 있는 Situation Aware-Interface Definition Language(SA-IDL) 접근방법이 유용하다. 하지만, SA-IDL로 다수의 상황인지 서비스를 만들게 될 때 서비스 단독으로는 문제가 없을지라도 여러 개의 서비스들 사이에서는 충돌문제가 발생할 수 있다. 이런 충돌을 검출해내고 해결하기 위해서, 을 수학적으로 모델링된 SA-IDL을 통해, 충돌을 수학적으로 정의하여 기술하고, graph theory적인 접근 방법과 자기 상관계수를 통한 마크호프 예측 기법으로 해결하고자 한다.

• 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.

• Journal of Power System Engineering
• /
• v.9 no.4
• /
• pp.202-208
• /
• 2005

The genetic algorithm (GA) which is one of the popular optimum algorithm has been used to solve a variety of optimum problems. Because it need not require the gradient of objective function and is easier to find global solution than gradient-based optimum algorithm using the gradient of objective function. However optimum method using the GA and the finite element method (FEM) takes many computational time to solve the optimum structural design problem which has a great number of design variables, constraints, and system with many degrees of freedom. In order to overcome the drawback of the optimum structural design using the GA and the FEM, the author developed a computer program which can optimize frame structures by using the GA and the generalized transfer stiffness coefficient method. In order to confirm the effectiveness of the developed program, it is applied to optimum design of plane frame structures. The computational results by the developed program were compared with those of iterative design.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.20 no.11
• /
• pp.1052-1057
• /
• 2010

Dynamic stability of rotating blade considering gravity effect is investigated in this paper. Equations of motion for the beam is derived by employing hybrid deformation variable method and transformed into dimensionless form. The present modeling method is verified by RecurDyn. Stability diagrams are presented to show the influence of the configuration of the beam and angular velocity on the dynamic stability by applying Floquet's theory. Since the natural frequencies are varied when the blade has rotating motion, it is found that relatively large unstable regions exist approximately 1.1 times as high as the first bending natural frequency and half of the sum of first and second bending natural frequency.

• Proceedings of the KAIS Fall Conference
• /
• 2009.05a
• /
• pp.722-725
• /
• 2009

본 논문에서는 문자인식, 손등 정맥 인식 등에 이용할 수 있는 패턴인식 기법으로 입력된 패턴을 전 처리하여 세선화한 후 유일성이 보장되는 행렬로 변환하는 방법에 관하여 연구 하였다. 입력된 패턴을 세선화 한 후 노드 중심으로 노드에 연결된 에지의 체인 코드와 유크리디안 거리를 노드를 중심으로 가중치와 체인코드를 이용한 행렬을 생성하고, 생성된 행렬의 고유치를 이용하여 인식의 기본 도구로 사용하였다. 이 때 연결된 에지의 방향 코드는 설정된 문턱치 값을 초과하는 변곡에 대하여 새로운 노드를 생성하였다. 이러한 방법을 손등 정맥 패턴 인식에 적용한 결과 인식률이 매우 우수함을 확인할 수 있었다.