• Journal of Electrical Engineering and Technology
• /
• v.6 no.6
• /
• pp.853-866
• /
• 2011

We propose a multi-objective space search algorithm (MSSA) and introduce the identification of fuzzy inference systems based on the MSSA and information granulation (IG). The MSSA is a multi-objective optimization algorithm whose search method is associated with the analysis of the solution space. The multi-objective mechanism of MSSA is realized using a non-dominated sorting-based multi-objective strategy. In the identification of the fuzzy inference system, the MSSA is exploited to carry out parametric optimization of the fuzzy model and to achieve its structural optimization. The granulation of information is attained using the C-Means clustering algorithm. The overall optimization of fuzzy inference systems comes in the form of two identification mechanisms: structure identification (such as the number of input variables to be used, a specific subset of input variables, the number of membership functions, and the polynomial type) and parameter identification (viz. the apexes of membership function). The structure identification is developed by the MSSA and C-Means, whereas the parameter identification is realized via the MSSA and least squares method. The evaluation of the performance of the proposed model was conducted using three representative numerical examples such as gas furnace, NOx emission process data, and Mackey-Glass time series. The proposed model was also compared with the quality of some "conventional" fuzzy models encountered in the literature.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.6
• /
• pp.943-950
• /
• 2002

Real time strategy game is a computer game genre of Playing with human or computer opponents in real time It differs from turn-type computer games in the game process method. Turn type games, such as chess, allow only one Player to move at a time. Real time strategy games allow two or more Players to move simultaneously. Therefore, in real time strategy computer games, the game components' movement plans must be calculated very quickly in order to not disturb other processes such as gathering resources, building structures, and combat activities. There are many approaches, which can reduce the amount of memory required for calculating path, search space, and reactive time of components. (or units). However, existing path finding algorithms tend to concentrate on achieving optimal Paths that are not as important or crucial in real time strategy game. This Paper introduces Dynamic Heuristic Af(DHA*) algorithm which is capable of reducing search space and reactive time of game units and compares with A* algorithm using static heuristic weighting.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.1
• /
• pp.157-162
• /
• 2011

In this paper, we propose enhanced methods of path finding based on an abstract graph with extension of search space to improve the quality of path. The proposed methods that are called simple buffering method, velocity constrained method and distance constrained method are to extract buffering-cells for using search space with valid-cells. The simple buffering method is to extract adjacent cells of valid-cells as buffering-cells. velocity constrained method and distance constrained method are based on simple buffering method, these eliminate buffering-cells through each of threshold. In experiment, proposed methods can improve the quality of path. The proposed methods are applicable to develop various kinds of telematics application, such as path finding and logistics.

• Proceedings of the KIEE Conference
• /
• 1999.07c
• /
• pp.1422-1424
• /
• 1999

This Paper Presents a efficient algorithm for loss reduction of distribution system by automatic sectionalizing switch operation in distribution systems of radial type. To apply tabu search to reconfiguration of distribution system, in this Paper we Propose the several move methods and efficient reconfiguration procedure. We also discuss the tabu search techniques of diversifying the search of solution space as well as the simple tabu search. The experimental results show that the proposed tabu search techniques have the ability to search a good solution.

• Proceedings of the CALSEC Conference
• /
• 2001.08a
• /
• pp.625-629
• /
• 2001

A cyber shopping mall is a place where consumers acquire product information, and make purchase decisions in the cyber space. Even though it offers many advantages over traditional malls, there are still several limitations to do shopping in an existing cyber mall. One of these limitations is the absence of an efficient shopping aid to compare multiple items from multiple malls. Existing search systems usually support a keyword search with limited conditions. Consumers spend lots of their time to compare multiple alternatives from search results. In this paper, we propose an intelligent product search system. There are two main features in our system. The first one is a full support of comparison shopping with multiple perspectives based on commercial search engines. The second one is an enhancement to the shopping aid based on a new concept of Shopping AssistanT. Our system is implemented in Visual Basic and PERL, and experimental results show a satisfactory performance.

• Structural Engineering and Mechanics
• /
• v.29 no.4
• /
• pp.391-410
• /
• 2008

In this article, a harmony search algorithm is presented for optimum design of steel frame structures. Harmony search is a meta-heuristic search method which has been developed recently. It is based on the analogy between the performance process of natural music and searching for solutions of optimization problems. The design algorithms obtain minimum weight frames by selecting suitable sections from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange (W) shapes. Stress constraints of AISC Load and Resistance Factor Design (LRFD) and AISC Allowable Stress Design (ASD) specifications, maximum (lateral displacement) and interstorey drift constraints, and also size constraint for columns were imposed on frames. The results of harmony search algorithm were compared to those of the other optimization algorithms such as genetic algorithm, optimality criterion and simulated annealing for two planar and two space frame structures taken from the literature. The comparisons showed that the harmony search algorithm yielded lighter designs for the design examples presented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4B
• /
• pp.403-418
• /
• 2009

IP version 6 (IPv6) is a new If addressing scheme that has 128-bit address space. IPv6 is proposed to solve the address space problem of IP version 4 (IPv4) which has 32-bit address space. For a given IPv6 routing set, if a forwarding table is built using a trio structure, the trio has a lot more levels than that for IPv4. Hence, for IPv6 address lookup, the binary search on trio levels would be more appropriate and give better search performance than linear search on trio levels. This paper proposes a new IPv6 address lookup algorithm performing binary search on trio levels. The proposed algorithm uses a Bloom filter in pre-filtering levels which do not have matching nodes, and hence it reduces the number of off-chip memory accesses. Simulation has been performed using actual IPv6 routing sets, and the result shows that an IPv6 address lookup can be performed with 1-3 memory accesses in average for a routing data set with 1096 prefixes.

• The Bulletin of The Korean Astronomical Society
• /
• v.30 no.1
• /
• pp.74.2-74.2
• /
• 2005

• Korean Institute of Interior Design Journal
• /
• v.23 no.3
• /
• pp.117-124
• /
• 2014

This study has inferred the mechanism of psychological observation activities through comparison analysis of the observation data acquired from eye-tracking and their post-estimation. The results of their analysis can be summarized as the followings. First, even though the frame of analysis has been set up so that there might not be any change to the number of the sections even with any change of consecutive observation times, the fact that the time by area decreases along with the change of consecutive observation from three times to six and nine times means that the time spent on "recognition" of space information reduces in the course that the feature of observing for space information switches from "perception to recognition". Second, the subjects moves their eyes incessantly in order to acquire space information while observing the space, when it was confirmed that there was a difference between "the space which the subjects searched for information by means of observation activities" and "that which they thought they observed that remaining in their consciousness". The appreciation of this kind of difference is very significant for the analysis of observation features. Third, the short observation (0.1 second, three times of consecutive observations) is consistent with "Ares I, intensively searched = that marked as having been observed consciously" by 60%, while the long-time observation (0.3 second, 9 times of consecutive observations) had 56%, which was relatively high, of "Area I, searched intensively ${\neq}$ that marked as having been observed consciously", which means that the observation feature seen at the activities of "consciousness : unconsciousness" and "observation : search" had some change in the course of changing from "perception to recognition".

• Journal of Digital Contents Society
• /
• v.15 no.5
• /
• pp.651-661
• /
• 2014

The complexity to search a specific content over TV platform is drastically increasing. Based on previous studies from computer data management system, we propose a new method that helps users to search and select content effectively. In general, contents over computers are represented by spatial metaphor, which replicates our physical environment and value systems about space. We suggest 3D lattice structure to construct information space for TV platform. Users can infer relevance between contents via special clue in information space, so as to select content more easily. Also, they can search contents through its temporal property that also represented in space. We make full use of our natural capability that can reduce additional overload to learning new interface. The results of this study can be significant and heuristic contributions, as they can be applied to diverse service areas utilizing video contents.