• 대한전기학회논문지:전력기술부문A
• /
• 제53권10호
• /
• pp.565-572
• /
• 2004

This paper proposes an expert system which can enhance the accuracy of real-time bus reconfiguration strategy by adopting local minimum tree search method and minimize the spreading effect of the fault by considering totally the operating condition when a main transformer fault occurs in the automated substation. The local minimum tree search method to expand the best-first search method. This method has an advantage which can improve the performance of solution within the limits of the real-time condition. The inference strategy proposed expert system consists of two stages. The first stage determines the switching candidate set by searching possible switching candidates starting from the main transformer or busbar related to the event. And, second stage determines the rational real-time bus reconfiguration strategy based on heuristic rules for the obtained switching candidate set. Also, this paper studies the generalized distribution substation modelling using graph theory and a substation database is designed based on the study result. The inference engine of the expert system and the substation database is implemented in MFC function of Visual C++. Finally, the performance and effectiveness of the proposed expert system is verified by comparing the best-first search solution and local minimum tree search solution based on diversity event simulations for typical distribution substation.

• 한국CDE학회논문집
• /
• 제14권6호
• /
• pp.404-414
• /
• 2009

In the computational molecular analysis, 3D structural comparison for protein searching plays a very important role. As protein databases have been grown rapidly in size, exhaustive search methods cannot provide satisfactory performance. Because exhaustive search methods try to handle the structure of protein by using sphere set which is converted from atoms set, the similarity calculation about two sphere sets is very expensive. Instead, the filter-and-refine paradigm offers an efficient alternative to database search without compromising the accuracy of the answers. In recent, a very fast algorithm based on the inter-atomic distance has been suggested by Ballester and Richard. Since they adopted the moments of distribution with inter-atomic distance between atoms which are rotational invariant, they can eliminate the structure alignment and orientation fix process and perform the searching faster than previous methods. In this paper, we propose a new 3D shape descriptor. It has properties of the general shape distribution and useful property in screening the molecular database. We show some experimental results for the validity of our method.

• 한국정보처리학회논문지
• /
• 제7권1호
• /
• pp.1-11
• /
• 2000

최근에 기존의 2차원적인 지리정보시스템에 시간차원을 포함하는 다차원 지리정보 데이터를 저장하기 위한 연구가 진행되고 있지만 대부분이 실제 구현에는 적용하기 어려운 개념적인 데이터모델의 설계단계에 머물고 있다. 본 논문에서는 기존 모델들의 문제점인 데이터 중복을 최소로 하고, 시간을 포함하는 질의에 대한 연산을 빠르게 수행할 수 있는 저장 기법인 MBNF기법을 설계하고, 데이터의 시간적 특성을 고려해서 과거 데이터베이스와 현재 데이터베이스에 분리하여 저장하는 분리된 저장구조를 설계하며, 분리된 데이터베이스간의 데이터 이동 알고리즘과 시간을 포함하는 질의를 효율적으로 수행하기 위한 검색 알고리즘을 설계한다.

• 정보보호학회논문지
• /
• 제18권5호
• /
• pp.125-134
• /
• 2008

안전한 RFID 시스템을 위하여 현재까지 다수의 RFID 인증 프로토콜이 제안되었다. 이들은 어떤 암호학적 요소를 사용하느냐에 따라 크게 해시기반, 재 암호화 기반, XOR 기반으로 나눌 수 있다. 현재까지 알려진 대표적인 공격으로는 도청, 사칭, 위치추적공격 등이 있는데 기존에 제안된 프로토콜들은 이러한 공격에 안전하지 않거나, 데이터베이스의 태그 검색과정이 비효율적이었다. 따라서 본 논문에서는 해시함수를 사용하여 알려진 공격에 안전하고 데이터베이스가 태그와 사전에 공유한 값을 통해 이전 세션의 상태를 파악하게 하여 태그 검색 과정이 비교적 간단한 프로토콜을 제안한다.

• 대한가정학회지
• /
• 제44권4호
• /
• pp.133-144
• /
• 2006

The contemporary period is called "the age of sensibility" in which each individual consumer seeks to have her or his own products. Businesses are in need of design developments with an emphasis on customer sensitivity, and at the same time consumers must understand their own sensitivity to acquire information on designs that suit them. This research established a sensitivity and configuration database on designing men's jackets using the sensitivity engineering approach to clothing design information. The user interface was created on the Internet. Sixty-seven sensitivity terms of vocabulary appropriate for the assessment of men's jacket design were selected, and the different designs were classified into six items and 24 categories. Thirty men's jackets with different designs were produced for sensory testing and the results were analyzed in accordance with general linear I statistics. A sensitivity database was established for each category. My-sql, PHP, Java Script, and Html were used for the configuration database work. The configuration of items/categories, with the most appropriate sensitivity database information assigned to the selected sensitivity vocabulary, was programmed for display on the computer screen. The sensitivity vocabulary of a customer's choice for each factor was selected for the program to run, while the category and product configuration of the men's jacket most suitable for the search was displayed based on the user interface.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2000년도 춘계학술대회 학술발표 논문집
• /
• pp.146-149
• /
• 2000

In this paper, Computer Colour Matching and Kitchen System (CCMKS) is developed on the basis of delphi package and one-chip processor with fuzzy-PID control. CCMKS will be widely used in the colour dyeing industry as an integrated colour matching and dispensing system which have more advantages than the conventional matching or dispensing system, when controlling the real dyeing processes. Delphi is utilized in making database and search/matching routes. The developed matching function reduces the search and matching time to about one third. One-chip processor is designed and manufactured for the distributed control of three-phase induction motors. Fuzzy-PID control is applied to the speed control of three-phase induction motors for a very precise weight of colour at CCMKS. The developed kitchen function decreases the dispensing time to about one twentieth. The experimental results show CCMKS has more excellent search time, more precise weight and much high fidelity than conventional colour matching or dispensing system, in the performance.

• 융합보안논문지
• /
• 제17권2호
• /
• pp.81-88
• /
• 2017

암호화된 공간데이터베이스와 같은 최근의 여러 응용에서는 질의 기준이 최대근접객체가 되는 객체들을 찾는 역최대 근접질의가 자주 발생한다. 실세계의 검색공간에는 강, 호수 그리고 고속도로 등과 같은 다양한 장애물이 존재하며, 이러한 환경에서 검색성능을 높이기 위해서는 장애물을 고려한 검색거리 측도가 반드시 필요하다. 본 연구에서는 장애물이 존재하는 검색공간에서 역최대근접질의 처리를 최적화하기 위한 검색거리 측도들과 질의처리 알고리즘을 제시한다.

• 한국디지털정책학회:학술대회논문집
• /
• 한국디지털정책학회 2007년도 춘계학술대회
• /
• pp.287-296
• /
• 2007

In this paper we present a plan-based Korean dialogue system as a natural language database user interface for product search. The system can be characterized by its support for mixed initiative to give user more control over dialogue, employment of user model to reflect user' spreferences, alternative solution suggestion if there is no product matched exactly to user's requirements, handling circumlocution which frequently occurs in dialogues. The user model ing shell system BGP-MS is adapted for the system. The system provides for a user-friendly database user interface bymanaging dialogue intelligently. By its implementation and test it has been shown that the user model-based dialogue system can be utilized effectively for product search.

• 디지털융복합연구
• /
• 제5권1호
• /
• pp.69-76
• /
• 2007

This paper presents a study on the introduction of User Model-Based Dialogue System. Also we present a plan-based Korean dialogue system as a natural language database user interface for product search. The system can be characterized by its support for mixed initiative to give user more control over dialogue, employment of user model to reflect user's preferences, alternative solution suggestion if there is no product matched exactly to user's requirements, handling circumlocution which frequently occurs in dialogues. The user modeling shell system BGP-MS is adapted for the system. The system provides for a user-friendly database user interface by managing dialogue intelligently. By its implementation and test, it has been shown that the user model-based dialogue system can be utilized effectively for product search.

• Journal of Computational Design and Engineering
• /
• 제1권3호
• /
• pp.161-172
• /
• 2014

This paper presents three different search engines for the detection of CAD-parts in large databases. The analysis of the contained information is performed by the export of the data that is stored in the structure trees of the CAD-models. A preparation program generates one XML-file for every model, which in addition to including the data of the structure tree, also owns certain physical properties of each part. The first search engine is specializes in the discovery of standard parts, like screws or washers. The second program uses certain user input as search parameters, and therefore has the ability to perform personalized queries. The third one compares one given reference part with all parts in the database, and locates files that are identical, or similar to, the reference part. All approaches run automatically, and have the analysis of the structure tree in common. Files constructed with CATIA V5, and search engines written with Python have been used for the implementation. The paper also includes a short comparison of the advantages and disadvantages of each program, as well as a performance test.