• Proceedings of the KIEE Conference
• /
• 2005.07e
• /
• pp.100-102
• /
• 2005

This paper is purpose to introduce the database management program of insulation tests for high voltage rotating machines. KEPRI has carried out insulation tests for high voltage equipment since 1998, the number of tests grow larger every year. It is difficult to manage the numerous test results, so we developed the insulation diagnostic database program. The features of this program are an easy-search test result and making a graph of AC, tan${\Delta}$ test. the most useful function is the trend management. Using the trend function, we can find the aging deterioration for high voltage machines easily.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.9
• /
• pp.124-134
• /
• 1996

Korean has a large set of characters, and has a two-dimensional formation: each character is composed of graphemes in two dimensions. Whereas connections between characters are rare, connections inside a grapheme and between graphemes happen frequently and these connections generate many cursive strokes. To deal with the large character set and the cursive strokes, using the graphemes as a recognition unit is an efffective approach, because it naturally accommodates the structural characteristics of the characters. In this paper, we propose a grapheme-based on-line recognition method for cursive korean characters. Our method uses a TDNN recognition engine to segment cursive strokes into graphemes and a graph-algorithmic postprocessor based on korean grapheme composition rule and viterbi search algorithm to find the best recognition score path. We experimented the method on freely hand-written charactes and obtained a recognition rate of 94.5%.

• Journal of the Korean Home Economics Association
• /
• v.34 no.5
• /
• pp.235-248
• /
• 1996

The purpose of this study was to search for new food labeling system that would support effective consumer decision-making, by examining consumer behavior of food labels and its' related factors. The survey was conducted on 410 housewives under 60-year-old who live in Seoul or Metropolitan area, using questionnaires and the illustrated material of labels. Respondents generally considered food labels very important as devices. Among 12 items of label which are required to disclose, they evaluated circulation period, and nutritional information. Among 12 items of label, housewives read manufacture date, circulation period, and price more often than business admission number and self standard number. The respondents preferred the format of marking both manufacture date and expiration date on the same side, the format of printing both price and weight on the same side of package, the diagramatic type, and the format represented by ration graph per daily value.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.595-597
• /
• 2005

본 논문에서는 자율 에이전트에 의해 미지의 공간을 탐사하는 실시간 그래프 탐색 알고리즘 DFS-RTA*와 DFS-PHA*를 제안하고 그 효율성을 비교한다. 두 알고리즘들은 모두 깊이-우선 탐색(DFS)을 기초로 하고 있으며, 직전 노드로의 빠른 후진(backtrack) 을 위해 각각 실시간 최단 경로 탐색 방법인 RTA*와 PHA*를 적용하는 것이 특징이다. 본 논문에서는 대표적인 3차원 온라인 게임 환경인 Unreal Tournament 게임과 지능형 캐릭터 에이전트인 KGBot를 이용한 실험을 통해 두 탐색 알고리즘의 완전성과 효율성을 분석해본다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.18 no.2
• /
• pp.43-49
• /
• 1992

Edge coloring problem is to find a minimum cardinality coloring of the edges of a graph so that any pair of edges incident to a common node do not have the same colors. Edge coloring problem is NP-hard, hence it is unlikely that there exists a polynomial time algorithm. We formulate the problem as a covering of the edges by matchings and find valid inequalities for the convex hull of feasible solutions. We show that adding the valid inequalities to the linear programming relaxation is enough to determine the minimum coloring number(chromatic index). We also propose a method to use the valid inequalities as cutting planes and do the branch and bound search implicitly. An example is given to show how the method works.

• Annual Conference of KIPS
• /
• 2010.04a
• /
• pp.898-899
• /
• 2010

온톨로지는 특정 개념에 대한 부가정보 및 개념간의 관계를 기술하는 방법으로서 고차원의 웹과 서비스를 실현하기 위한 시멘틱 웹, 그리고 지식관리 시스템을 비롯한 다양한 응용분야의 요구와 관심이 증가하면서 그 중요성이 대두되고 있다. 온톨로지에서의 정보 검색은 특정 개념과 특정 관계를 가지는 데이터를 찾는 것이 주를 이루는데, 이러한 관계는 검색 대상에 대한 조상/ 후손을 모두 검색하여 찾아, 검색 결과를 반환해야 하기 때문에 정보를 처리하는 비용이 많은 비중을 차지한다. 본 논문에서는 온톨로지의 효과적인 저장 및 검색을 위한 기존의 연구들의 동향을 살펴보고, 그 방법들에 대하여 정리하고, 보다 나은 방법에 대한 논의를 한다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2023.01a
• /
• pp.147-150
• /
• 2023

본 논문에서는 코로나 19 확산에 따른 마스크 생산량 급증에 따라 폐마스크 수거함을 배치하는 경기도 용인시에 데이터를 기반으로 한 수거함 위치 추천을 목표하는 프로젝트를 소개한다. 해당 프로젝트는 전국 표준노드 링크와 건축물 용도 API를 활용했으며 데이터 전처리와 메모이제이션 기법 등으로 적절한 시간 안에 결과가 도출되도록 위치 추천 엔진을 개발했다. 개발 완료된 엔진으로부터 도출된 결과를 바탕으로 폐마스크 수거함을 배치한다면 보다 효과적인 결과로 이어질 것으로 기대된다.

• Spatial Information Research
• /
• v.20 no.4
• /
• pp.83-92
• /
• 2012

Location-based services (LBS) are increasingly popular due to the improvement of geo-positioning capabilities and wireless communication technology. However, in order to enjoy LBS services, a user requesting a query must send his/her exact location to the LBS provider. Therefore, it is a key challenge to preserve user's privacy while providing LBS. To solve this problem, the existing method employs a 2PASS cloaking framework that not only hides the actual user location but also reduces bandwidth consumption. However, 2PASS does not fully guarantee the actual user privacy because it does not take the real user distribution into account. Hence, in this paper, we propose a nearest neighbor query processing algorithm that supports K-anonymity property based on the weighted adjacency graph(WAG). Our algorithm not only preserves the location of a user by guaranteeing k-anonymity in a query region, but also improves a bandwidth usage by reducing unnecessary search for a query result. We demonstrate from experimental results that our algorithm outperforms the existing one in terms of query processing time and bandwidth usage.

• Journal of the Korea Computer Graphics Society
• /
• v.21 no.2
• /
• pp.11-20
• /
• 2015

We present a new interactive technique for directing the motion sequences of an animated character by dragging its specific body part to a desired location in the three-dimensional virtual environment via a hand motion tracking device. The motion sequences of our character is synthesized by reordering subsequences of captured motion data based on a well-known graph representation. For each new input location, our system samples the space of possible future states by unrolling the graph into a spatial search tree, and retrieves one of the states at which the dragged body part of the character gets closer to the input location. We minimize the difference between each pair of successively retrieved states, so that the user is able to anticipate which states will be found by varying the input location, and resultantly, to quickly reach the desired states. The usefulness of our method is demonstrated through experiments with breakdance, boxing, and basketball motion data.

• Journal of Korea Multimedia Society
• /
• v.11 no.9
• /
• pp.1310-1323
• /
• 2008

Recently, many studies on automated generation of composite Web services have been done. Most of these works compose Web services by chaining their inputs and outputs, but do not consider the functional semantics. Therefore, they may construct unsatisfied composite services against users' intention. Futhermore, they have high time-complexity since every possible combinations of available services should be considered. To resolve these problems, this paper proposes a sophisticated composition method that explicitly specifies and uses the functional semantics of Web services. Specifically, A graph model is constructed to represent the functional semantics of Web services as well as the dependency among inputs and outputs. On the graph, we search core services which provide the requested function ality and additional services which transform between I/O types of the user request and the core services. Then, composite services are built from combinations of the discovered services. The proposed method improves the semantic correctness of composite services by the functional semantics of Web services, and reduces the time complexity by combinations of functionally related services.