• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.880-886
• /
• 2016

With lots of information occurring on the Internet, the search engine plays a role in gathering the scattered information on the Internet. Some search engines show not only search result pages including search keyword but also search result numbers of the keyword. The number of keyword searching result provided by the Google search engine can be utilized to identify overall trends for this search word on the internet. This paper is aimed designing and realizing the system which can efficiently manage the number of searching result provided by Google search engine. This paper proposed system operates by Web, and consist of search agent, storage node, and search node, manage keyword and search result, numbers, and executing search. The proposed system make the results such as search keywords, the number of searching, NGD(Normalized Google Distance) that is the distance between two keywords in Google area.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.407-411
• /
• 1992

A method for optimal route planning is presented with the assumption that the overall defended area is known in terms of threat potential function. This approach employes tangent plane to reduce the dimension of the state space for optimal programming problems with a state equality constraint. One-dimensional search algorithm is used to select the optimal route among the extermal fields which are obtained by integrating three differential equations from the initial values. In addition to being useful for the route planning through threat potential area, the trajectory planning will be suitable for general two-dimensional searching problems.

• Journal of Korean Home Economics Education Association
• /
• v.8 no.2
• /
• pp.43-51
• /
• 1996

This article introduces the concept of stress and the stage of the stress response of children (stage of alarm, appraisal, searching for a coping strategy and implementing coping responses). Since not many studies have been done in this area, in this paper also suggest some directions for further research.

• The KIPS Transactions:PartB
• /
• v.13B no.4 s.107
• /
• pp.463-470
• /
• 2006

It is difficult to track and extract the movement of an object through a camera exactly because of noises and changes of the light. The fast searching algorithm is necessary to extract the object and to track the movement for realtime image. In this paper, we propose the correct and fast algorithm using the variable searching area and the background image change method to robustic for the change of background image. In case the threshold value is smaller than reference value on an experimental basis, change the background image. When it is bigger, we decide it is the point of the time of the object input and then extract boundary point of it through the pixel check. The extracted boundary points detect precise movement of the object by creating area block of it and searching block that maintaining distance. The designed and embodied system shows more than 95% accuracy in the experimental results.

• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.265-272
• /
• 2005

In this paper, we propose a technique which is speedily searching for correspondent points of two images using Voronoi-Distance, as an image registration method for feature based image mosaics. It extracts feature points in two images by the SUSAN corner detector, and then create not only the Voronoi Surface which has distance information among the feature points in the base image using a priority based Voronoi distance algorithm but also select the model area which has the maximum variance value of coordinates of the feature points in the model image. We propose a method for searching for the correspondent points in the Voronoi surface of the base image overlapped with the model area by use of the partitive search algorithm using queues. The feature of the method is that we can rapidly search for the correspondent points between adjacent images using the new Voronoi distance algorithm which has $O(width{\times}height{\times}logN)$ time complexity and the the partitive search algerian using queues which reduces the search range by a fourth at a time.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.1
• /
• pp.61-75
• /
• 2007

The purpose of this paper is to develop a new group classification method based on genetic algorithm and to com-pare its prediction performance with those of existing methods in the area of bond rating. To serve this purpose, we conduct various experiments with pilot and general models. Specifically, we first conduct experiments employing two pilot models : the one searching for the cluster center of each group and the other one searching for both the cluster center and the attribute weights in order to maximize classification accuracy. The results from the pilot experiments show that the performance of the latter in terms of classification accuracy ratio is higher than that of the former which provides the rationale of searching for both the cluster center of each group and the attribute weights to improve classification accuracy. With this lesson in mind, we design two generalized models employing genetic algorithm : the one is to maximize the classification accuracy and the other one is to minimize the total misclassification cost. We compare the performance of these two models with those of existing statistical and artificial intelligent models such as MDA, ANN, and Decision Tree, and conclude that the genetic algorithm-based group classification method that we propose in this paper significantly outperforms the other methods in respect of classification accuracy ratio as well as misclassification cost.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.37 no.4
• /
• pp.95-109
• /
• 2012

Being able to quickly locate valuable medical equipment is critical inside hospitals. In order to utilize limited budget and resources efficiently, accurate locating or tracking is required in many fields. In this research, we focus on how to find the location of missing assets by using RFID in real time indoors to track equipment. When equipment needs to be searched, the purpose of a RFID device is to minimize the time, investment cost and effort spent searching for the equipment. Thus, this research presents a mathematical model of using RFID (both handheld reader and stationary reader) for efficient asset location. We derive the expected time of locating RFID-tagged objects in a multi-area environment where hand-held RF readers are used. We then discuss where to deploy stationary RF readers in order to maximize the efficiency of the search process.

• Journal of Korea Multimedia Society
• /
• v.13 no.10
• /
• pp.1506-1513
• /
• 2010

Game Software is the high-value industry that is based on fun elements. To develop Game Software successfully, the method for systematically classifying and searching about fun elements needs. However, fun elements of game are still made by game developers 'experience', and have ambiguities about what are considered at development phase because of difference between viewpoints and definitions about them. We structured 9 groups and 34 fun elements after that 50 fun elements elicited from existing literature are classifies and refines by statistical analysis. And we found a omitted area with the result that the classified elements are applied to Roger Callois's Theory. Finally, we elicited new elements of omitted areas from web site and searched 1 group and 4 fun elements.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.887-890
• /
• 2007

For a integrated system to control several parking lots within a commercial district, it is required to guide a route to a nearest neighbor parking lot considering diverse realtime constraints such as realtime status of parking lots and changes of an access route. This paper proposes an optimized route-searching technique of integrated parking control system considering realtime contraints. In concrete, it proposes a method of researching a route in the surrounding area considering various status of parking lots that a customer designates (no parking, closed, under construction, no passing of a road) and deals with a route-searching technique optimized for each situation in detail.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.390-395
• /
• 2009

The robustness of audio fingerprinting system in a noisy environment is a principal challenge in the area of content-based audio retrieval. The selected feature for the audio fingerprints must be robust in a noisy environment and the computational complexity of the searching algorithm must be low enough to be executed in real-time. The audio fingerprint proposed by Philips uses expanded hash table lookup to compensate errors introduced by noise. The expanded hash table lookup increases the searching complexity by a factor of 33 times the degree of expansion defined by the hamming distance. We propose a new method to improve noise robustness of audio fingerprinting in noise environment using predominant pitch which reduces the bit error of created hash values. The sub-fingerprint of our approach method is computed in each time frames of audio. The time frame is transformed into the frequency domain using FFT. The obtained audio spectrum is divided into 33 critical bands. Finally, the 32-bit hash value is computed by difference of each bands of energy. And only store bits near predominant pitch. Predominant pitches are extracted in each time frames of audio. The extraction process consists of harmonic enhancement, harmonic summation and selecting a band among critical bands.