• Journal of KIBIM
• /
• v.5 no.1
• /
• pp.8-15
• /
• 2015

With the emergence of environment-friendly paradigms, many countries around the world have enacted various laws to take care of environmental pollution-related problems. The goal of these environmental laws and regulations was to properly respond to rapid environmental pollution. Because of the simultaneous enactment of these laws on diverse pollution sources, however, a variety of problems, including an unclear correlation among these laws, have occurred. As a result, workers have found it hard to collect and use the related laws and regulations. Therefore, this study proposes a metadata-based information retrieval method for the efficient search of environment-friendly laws and regulations. The laws and regulations were structured using metadata from users, business stage, topic and department. These were obtained through semantic analysis on environment-friendly laws and regulations, and then an intelligent retrieval approach was utilized. To verify the retrieval plan, a test case was conducted, and improvement in retrieval accuracy against the conventional system was confirmed. It appears that the proposed plan will improve productivity in the construction industry by improving accuracy in retrieving environment-friendly laws and regulations.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.3
• /
• pp.291-296
• /
• 2008

This paper presents the dodecagon-based Q-leaning and SVM algorithm for object search with multiple robots. We organized an experimental environment with several mobile robots, obstacles, and an object. Then we sent the robots to a hallway, where some obstacles were tying about, to search for a hidden object. In experiment, we used four different control methods: a random search, a fusion model with Distance-based action making(DBAM) and Area-based action making(ABAM) process to determine the next action of the robots, and hexagon-based Q-learning and dodecagon-based Q-learning and SVM to enhance the fusion model with Distance-based action making(DBAM) and Area-based action making(ABAM) process.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.3
• /
• pp.285-290
• /
• 2006

In this paper we propose a novel personalized paper search system using the relevance among user's queried keywords and user's behaviors on a searched paper list. The proposed system builds user's individual relevance network from analyzing the appearance frequencies of keywords in the searched papers. The relevance network is personalized by providing weights to the appearance frequencies of keywords according to users' behaviors on the searched list, such as 'downloading,' 'opening,' and 'no-action.' In the experimental section, we demonstrate our method using 100 users' search information in the University of Suwon.

• Journal of Korea Game Society
• /
• v.9 no.4
• /
• pp.81-88
• /
• 2009

In this paper, I suggested a way for searching a path of the intelligent character in an action game by using a genetic algorithm. This realized the algorithm which enables not only to chose the nearest path but also to search the optimum path by using genetic algorithm. In this case, if the codes of chromosomes are applied as they are, a lot of lethal genes could occur. In order to solve such a problem, I used a splicing method, one of the DNA's behavior characteristics. The intelligent character searched out a optimum pass as well as a shortcut path with one treatment by using the characteristic of a genetic algorithm which generates multiple candidate solutions in the search process.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.418-423
• /
• 2004

The motion estimation algorithm based block matching is a widely used in the international standards related to video compression, such as the MPEG series and H.26x series. Full search algorithm(FA) ones of this block matching algorithms is usually impractical because of the large number of computations required for large search region. Fast search algorithms and conventional binary block matching algorithms reduce computational complexity and data processing time but this algorithms have disadvantages that is less performance than full search algorithm. This paper presents new Boolean matching algorithm, called BCBM(Bit Converted Boolean Matching). Proposed algorithm has performance closed to the FA by Boolean only block matching that may be very efficiently implemented in hardware for real time video communication. Simulation results show that the PSNR of the proposed algorithm is about 0.08㏈ loss than FA but is about 0.96∼2.02㏈ gain than fast search algorithm and conventional Boolean matching algorithm.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.1
• /
• pp.78-89
• /
• 2017

This study derived the algorithm of a public transportation route search that adds safety and environmental costs according to user preference. As the means of an algorithm application and evaluation, Macro Simulation, VISUM was conducted for an analysis. The route using the subway, which is relatively low in safety and environment resistance value was preferred, and it was analyzed to select the safe and environmental route even though it detours. This study can be applicable when to verify the algorithm of route search considering safety and environment, and when introducing the algorithm of route search according to user preference in the smart-phone application in the future, it can provide users with very useful information by choosing a route as for safety and environment, and through this, the quality of user-friendly information provision can be promoted.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.4
• /
• pp.406-411
• /
• 2005

In this paper, we present the area-based Q-learning to search a target object using multiple robot. To search the target in Markovian space, the robots should recognize their surrounding at where they are located and generate some rules to act upon by themselves. Under area-based Q-learning, a robot, first of all, obtains 6-distances from itself to environment by infrared sensor which are hexagonally allocated around itself. Second, it calculates 6-areas with those distances then take an action, i.e., turn and move toward where the widest space will be guaranteed. After the action is taken, the value of Q will be updated by relative formula at the state. We set up an experimental environment with five small mobile robots, obstacles, and a target object, and tried to search for a target object while navigating in a unknown hallway where some obstacles were placed. In the end of this paper, we presents the results of three algorithms - a random search, area-based action making (ABAM), and hexagonal area-based Q-teaming.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.3
• /
• pp.395-400
• /
• 2011

In this paper, we propose an study of the facial emotion recognition considering the dynamical variation of emotional state in facial image sequences. The proposed system consists of two main step: facial image based emotional feature extraction and emotional state classification/recognition. At first, we propose a method for extracting and analyzing the emotional feature region using a combination of Active Shape Model (ASM) and Facial Action Units (FAUs). And then, it is proposed that emotional state classification and recognition method based on Hidden Markov Model (HMM) type of dynamic Bayesian network. Also, we adopt a Harmony Search (HS) algorithm based heuristic optimization procedure in a parameter learning of HMM in order to classify the emotional state more accurately. By using all these methods, we construct the emotion recognition system based on variations of the dynamic facial image sequence and make an attempt at improvement of the recognition performance.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.5
• /
• pp.567-572
• /
• 2005

Recently, owing to miniaturization of computer and popularization of internet, ubiquitous computing is attracting considerable attention. In ubiquitous environment, user can receive desired information service anywhere, any time. With the advent of ubiquitous age through popularization of internet, it becomes important how to provide user with ubiquitous environment, and what and how to provide to user. In this paper, method to automatically select device most suitable for user in ubiquitous environment is offered. search agents search peripherals, make a list by function, and transmit to serve. Serve learn the transmitted information through intelligent system. If user input information in the form of linguistic according to the list, serve select device suitable for work environment, and compose the system through IP address. This was realize through practical example, experimented and confirmed.

• Journal of Korean Library and Information Science Society
• /
• v.31 no.1
• /
• pp.87-114
• /
• 2000

The purpose of this study is offering appropriate system and training program to helf the system designer and the trainer in addition to analyze information use behavior about the web search tools and evaluate the estimated system by user groups. The results of the study are as follows $\circledS1$ It is desirable to consider age than other demographic variables in the case of web search tool. $\circledS2$ It is desirable to design Directory Search Tool in the case of web search tool which serves the student user group. $\circledS3$ An Intelligent Search Tool is more appropriate for the students who are using keyword search tool than any other tools. $\circledS4$ A discussion about standard classification of the web information should be accomplished soon because users feel confused in using web search tools due t o absence of standard mode of classification about classified item. $\circledS5$ Librarians need the cognition about data on internet s a source of information and need positive service and user training program about these information because student users hardly get help from librarians or library orientation for learning method to use web search tool. $\circledS6$ Internet use experience and years of computer use had effect on their use ability when using web search tool, whereas computer use experience, library use experience and Online Public Access Catalogs (OPAC) use experience had no effect on it. Especially, OPAC use experience had no effect on use ability of web search tool of student user group because student user groups had no information about internet and web search tool and they did not recognized the difference about search method between web search tool and OPAC. $\circledS7$In the case of web search tool, it si important to index the increasing web resource automatically by a searching robot. But in the case of student users, web search tool is much more needed to index by index expert due to the absence of ability about selecting and combining keyword.