• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.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.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.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.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.1-11
• /
• 2000

Up to the present, many GIS logical data models have been proposed to incorporate time dimension into traditional 2-dimensional (2D space) GIS databases. However, these models are difficult to implementation of multi-dimensional GIS and have problems of significant data redundancy and search performance. This paper proposes a new storage strategy and a separate storage structure, that is composed of current database and past database, in order to reduce data redundancy and improve search performance of temporal query. Also we design moving algorithm for migration from current database to past database, and design efficient search algorithm for temporal query.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.5
• /
• pp.125-134
• /
• 2008

A great number of RFID authentication protocols have been proposed for the secure RFID system. These are typically divided into three types according to primitive that they use : Hash-based, Re-encryption based, and XORing-based protocol. The well-known attacks in RFID system are eavesdropping. impersonating, location tracking, and so on. However, existing protocols could not provide security against above attacks, or it was not efficient to search for tags on database. Therefore, in this paper we present a protocol which is secure against above attacks by using hash function and makes Database search tags easily by attaining the state information of previous session through the shared values with all tags and database.

• Journal of the Korean Home Economics Association
• /
• v.44 no.4 s.218
• /
• 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.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.05a
• /
• 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.

• Convergence Security Journal
• /
• v.17 no.2
• /
• pp.81-88
• /
• 2017

It is occurred frequently the reverse nearest neighbor queries to find objects where a query point can be the nearest neighbor object in recently applications like the encrypted spatial database. In a search space of the real world, however, there are many physical obstacles(e.g., rivers, lakes, highways, etc.). It is necessary the accurate measurement of distances considered the obstacles to increase the retrieval performance such as this circumstance. In this study, we present the algorithm and the measurement of distance to optimize the processing performance of reverse nearest neighbor queries in a search space with the presence of obstacles.

• 한국디지털정책학회:학술대회논문집
• /
• 2007.06a
• /
• 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.

• Journal of Digital Convergence
• /
• v.5 no.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
• /
• v.1 no.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.